scispace - formally typeset
Search or ask a question
Institution

Orange S.A.

CompanyParis, France
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.


Papers
More filters
Journal ArticleDOI
TL;DR: Variation in electron capture times and the short time observed at resonance, when the barrier and the well levels are separated by 1 LO-phonon energy, demonstrate the importance of quantum-mechanical electron capture processes.
Abstract: We have studied a series of modified GaAs/${\mathrm{Al}}_{\mathit{x}}$${\mathrm{Ga}}_{1\mathrm{\ensuremath{-}}\mathit{x}}$As multiple-quantum-well structures, where increased capture times are obtained owing to the engineering of the band configuration. Both electron and hole capture times have been measured as a function of well width. Hole capture times are fast (typically 10 ps) and depend weakly on the structure. Electron capture times are shown to vary between 2 and 120 ps for well widths covering the whole range between 30 and 100 \AA{}. This variation and the short time observed at resonance, when the barrier and the well levels are separated by 1 LO-phonon energy, demonstrate the importance of quantum-mechanical electron capture processes.

35 citations

Book ChapterDOI
07 Nov 2006
TL;DR: Through their global, uniform provision of services and their distributed nature, global computers have the potential to profoundly enhance the authors' daily life, but they will not realize their full potential, unless the necessary levels of trust and security can be guaranteed.
Abstract: Through their global, uniform provision of services and their distributed nature, global computers have the potential to profoundly enhance our daily life. However, they will not realize their full potential, unless the necessary levels of trust and security can be guaranteed. The goal of the MOBIUS project is to develop a Proof Carrying Code architecture to secure global computers that consist of Java-enabled mobile devices. In this progress report, we detail its objectives and provide a snapshot of the project results during its first year of activity.

35 citations

Journal ArticleDOI
TL;DR: It is shown how the redundancy of application servers can be invested to ensure efficient failover of Internet services when the legitimate processing server goes down.
Abstract: Fault-tolerant frameworks provide highly available services by means of fault detection and fault recovery mechanisms. These frameworks need to meet different constraints related to the fault model strength, performance, and resource consumption. One of the factors that led to this work is the observation that current fault-tolerant frameworks are not always adapted to existing Internet services. In fact, most of the proposed frameworks are not transport-level- or session-level-aware, although the concerned services range from regular services like HTTP and FTP to more recent Internet services such as multimodal conferencing and voice over IP. In this work we give a comprehensive overview of fault tolerance concepts, approaches, and issues. We show how the redundancy of application servers can be invested to ensure efficient failover of Internet services when the legitimate processing server goes down.

35 citations

Book ChapterDOI
Matthew Robshaw1
TL;DR: Initial estimates suggest that the computational resources required for the implementation of this aes-like pseudo-random number generator are sufficiently modest for it to be suitable for use in RFID tags.
Abstract: In this paper we describe an aes-like pseudo-random number generator called cgen Initial estimates suggest that the computational resources required for its implementation are sufficiently modest for it be suitable for use in RFID tags

35 citations

Journal ArticleDOI
TL;DR: The proposed approach is a linear programming based one and allows the computation of optimal routing paths with regard to max-min fairness, in stable and known traffic conditions, and it is shown how the proposed approach can handle the case of upper-bounded access rates.
Abstract: In this paper, we consider the max-min fair resource allocation problem as applied to elastic flows. We are interested in computing the optimal max-min fair rate allocation. The proposed approach is a linear programming based one and allows the computation of optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. We consider non-bounded access rates, but we show how the proposed approach can handle the case of upper-bounded access rates. A proof of optimality and some computational results are also presented

35 citations


Authors

Showing all 6762 results

NameH-indexPapersCitations
Patrick O. Brown183755200985
Martin Vetterli10576157825
Samy Bengio9539056904
Aristide Lemaître7571222029
Ifor D. W. Samuel7460523151
Mischa Dohler6835519614
Isabelle Sagnes6775318178
Jean-Jacques Quisquater6533518234
David Pointcheval6429819538
Emmanuel Dupoux6326714315
David Gesbert6345624569
Yonghui Li6269715441
Sergei K. Turitsyn6172214063
Joseph Zyss6143417888
Jean-Michel Gérard5842114896
Network Information
Related Institutions (5)
Alcatel-Lucent
53.3K papers, 1.4M citations

92% related

Fujitsu
75K papers, 827.5K citations

90% related

Bell Labs
59.8K papers, 3.1M citations

89% related

NEC
57.6K papers, 835.9K citations

89% related

Hewlett-Packard
59.8K papers, 1.4M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20238
20225
20215
20205
201915
201814