Alcatel-Lucent

About: Alcatel-Lucent is a based out in Stuttgart, Germany. It is known for research contribution in the topics: Signal & Network packet. The organization has 37003 authors who have published 53332 publications receiving 1430547 citations. The organization is also known as: Alcatel-Lucent S.A. & Alcatel.

A Photocurable Poly(dimethylsiloxane) Chemistry Designed for Soft Lithographic Molding and Printing in the Nanometer Regime

Abstract: Patterning techniques that rely on high-resolution elastomeric elements such as stamps, molds, and conformable photomasks are operationally simple methods for nanofabrication that may find applicat...

Thermodynamic and electron diffraction signatures of charge and spin ordering in La1-xCaxMnO3

Abstract: The large-magnetoresistance compounds ${\mathrm{La}}_{1\ensuremath{-}x}{\mathrm{Ca}}_{x}{\mathrm{MnO}}_{3}$ have been studied using specific heat, sound velocity $(v)$, and electron diffraction. For $0.63\ensuremath{\le}x\ensuremath{\le}0.67$ charge ordering is observed at 260 K and accompanied by a dramatic $(g10%)$ increase in $v$. This simultaneous occurrence of electron and lattice ordering features implies extremely strong electron-phonon coupling, known to exist for the octahederally coordinated ${d}^{4}$ ion and originating in the Jahn-Teller effect. A dynamic manifestation of this Jahn-Teller coupling has been suggested by Millis et al. as the origin for colossal magnetoresistance.

Data distribution techniques for load-balanced fault-tolerant web access

Abstract: A server system for processing client requests received over a communication network includes a cluster of N document servers and at least one redirection server The redirection server receives a client request from the network and redirects it to one of the document servers, based on a set of pre-computed redirection probabilities Each of the document servers may be an HTTP server that manages a set of documents locally and can service client requests only for the locally-available documents A set of documents are distributed across the document servers in accordance with a load distribution algorithm which may utilize the access rates of the documents as a metric for distributing the documents across the servers and determining the redirection probabilities The load distribution algorithm attempts to equalize the sum of the access rates of all the documents stored at a given document server across all of the document servers In the event of a server failure, the redirection probabilities may be recomputed such that the load of client requests is approximately balanced among the remaining document servers The redirection probabilities may also be recomputed periodically in order to take into account changes in document access rates and changes in server capacity The recomputation may be based on a maximum-flow minimum-cost solution of a network flow problem

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Abstract: The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of $n$ items and $m$ bins (knapsacks) such that each item $i$ has a profit $p(i)$ and a size $s(i)$, and each bin $j$ has a capacity $c(j)$. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the bins. MKP is a special case of the generalized assignment problem (GAP) where the profit and the size of an item can vary based on the specific bin that it is assigned to. GAP is APX-hard and a 2-approximation, for it is implicit in the work of Shmoys and Tardos [Math. Program. A, 62 (1993), pp. 461-474], and thus far, this was also the best known approximation for MKP\@. The main result of this paper is a polynomial time approximation scheme (PTAS) for MKP\@. Apart from its inherent theoretical interest as a common generalization of the well-studied knapsack and bin packing problems, it appears to be the strongest special case of GAP that is not APX-hard. We substantiate this by showing that slight generalizations of MKP are APX-hard. Thus our results help demarcate the boundary at which instances of GAP become APX-hard. An interesting aspect of our approach is a PTAS-preserving reduction from an arbitrary instance of MKP to an instance with $O(\log n)$ distinct sizes and profits.

Methods and entities using IPSec ESP to support security functionality for UDP-based traffic

Abstract: Methods in OMA SEC_CF for providing security services to traffic over UDP between a client and a server and the relevant entities are provided. A pre-shared key is pre-shared between the client and the server. A pair of IPSec ESP SAs between the client and the server is established without shared key negotiation, wherein traffic data cryptographic algorithms are determined. Traffic data security keys are derived from the pre-shared key via the determined traffic data cryptographic algorithms. Then, data of the traffic can be provided with security services with the traffic data security keys through use of IPSec ESP.