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.

Handover between wireless networks of different technologies

Abstract: A telecommunications apparatus comprises an applications server and a mobility manager. The applications server is operable to provide a telecommunications service to at least one mobile terminal via at least one of a first access network and a second access network. The mobility manager is operable to monitor an affiliation of the mobile terminal with at least the first and the second access networks. The applications server in combination with the mobility manager is operable to negotiate a change in the telecommunications service as a result of the change in communications parameters associated with the change of affiliation from the first to the second access networks. The telecommunications apparatus can provide a facility for a mobile terminal to change affiliation, from one access network to another access network, with the effect that the mobile terminal is provided with one of a pre-specified set of services which can be supported by the second access network. Accordingly, when there is a change of communications parameters, resulting from the mobile terminal changing affiliation, a facility for changing the service to the mobile terminal is provided in accordance with the change of communications parameters, reducing a likelihood of services crashing.

Efficient information hiding in H.264/AVC video coding

Abstract: This paper proposes a new real-time information hiding algorithm on latest H.264/AVC video coding standard. The information is embedded into the Trailing Ones of 4×4 blocks during the Context-based Adaptive Variable Length Coding (CAVLC) process. This algorithm is efficient with low computational complexity. The simulation results show that the degradation of video quality is negligible, and the same overall bit-stream length is maintained. Based on this information hiding method, a video subtitle transmission scheme is proposed. Under the simulation of different RTP packet loss channels, the embedded information can be well recovered. The comparison with other algorithms shows the superiority of our proposed method.

Ergodic Control and Polyhedral approaches to PageRank Optimization

Abstract: We study a general class of PageRank optimization problems which consist in finding an optimal outlink strategy for a web site subject to design constraints. We consider both a continuous problem, in which one can choose the intensity of a link, and a discrete one, in which in each page, there are obligatory links, facultative links and forbidden links. We show that the continuous problem, as well as its discrete variant when there are no constraints coupling different pages, can both be modeled by constrained Markov decision processes with ergodic reward, in which the webmaster determines the transition probabilities of websurfers. Although the number of actions turns out to be exponential, we show that an associated polytope of transition measures has a concise representation, from which we deduce that the continuous problem is solvable in polynomial time, and that the same is true for the discrete problem when there are no coupling constraints. We also provide efficient algorithms, adapted to very large networks. Then, we investigate the qualitative features of optimal outlink strategies, and identify in particular assumptions under which there exists a "master" page to which all controlled pages should point. We report numerical results on fragments of the real web graph.

Performance evaluation of early and late fusion methods for generic semantics indexing

Abstract: This paper focuses on the comparison between two fusion methods, namely early fusion and late fusion. The former fusion is carried out at kernel level, also known as multiple kernel learning, and in the latter, the modalities are fused through logistic regression at classifier score level. Two kinds of multilayer fusion structures, differing in the quantities of feature/kernel groups in a lower fusion layer, are constructed for early and late fusion systems, respectively. The goal of these fusion methods is to put each of various features into effect and mine redundant information of the combination of them, and then to develop a generic and robust semantic indexing system to bridge semantic gap between human concepts and these low-level visual features. Performance evaluated on both TRECVID2009 and TRECVID2010 datasets demonstrates that the systems with our proposed multilayer fusion methods at kernel level perform more stably to reach the goal than the classification-score-level fusion; the most effective and robust one with highest MAP score is constructed by early fusion with two-layer equally weighted composite kernel learning.

The intelligent network signaling and switching costs of an alternate location strategy using memory

Abstract: In future high density microcellular personal communications systems (PCS), it is expected that most of the signaling traffic will come from registrations. An alternate location strategy has been proposed to reduce the signaling traffic on the radio link by increasing the responsibilities placed upon the fixed network. A fixed network performance comparison to the classic location strategy being implemented in evolving digital cellular and cordless standards is presented. The key measures are SS7 traffic and switching complexity. An example based on the Groupe Speciale Mobile (GSM) system illustrates the results.