Institution
Alcatel-Lucent
Stuttgart, Germany•
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.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This review discusses various recent topics that characterize functional magnetic resonance imaging, including a brief description of MRI image acquisition, how to cope with noise or signal fluctuation, the basis of fMRI signal changes, and the relation of MRI signal to neuronal events.
Abstract: In this review we discuss various recent topics that characterize functional magnetic resonance imaging (fMRI). These topics include a brief description of MRI image acquisition, how to cope with noise or signal fluctuation, the basis of fMRI signal changes, and the relation of MRI signal to neuronal events. Several observations of fMRI that show good correlation to the neurofunction are referred to. Temporal characteristics of fMRI signals and examples of how the feature of real time measurement is utilized are then described. The question of spatial resolution of fMRI, which must be dictated by the vascular structure serving the functional system, is discussed based on various fMRI observations. Finally, the advantage of fMRI mapping is shown in a few examples. Reviewing the vast number of recent fMRI application that have now been reported is beyond the scope of this article.
339 citations
•
11 Jul 2002TL;DR: In this paper, a system and method for tracking utilization data for an electronic device, the electronic device having a nonvolatile data storage component associated therewith for retaining the utilization data is provided.
Abstract: There is provided a system and method for tracking utilization data for an electronic device, the electronic device having a non-volatile data storage component associated therewith for retaining the utilization data. In an embodiment, the method comprises the steps of: a) after passage of a utilization interval, reading a first utilization data value for the electronic device stored in the non-volatile data storage component; b) incrementing said read value; and c) storing said incremented value into the non-volatile data storage component. In an embodiment, the electronic device is a circuit card operating in a communication switch, and the utilization data value is a time value indicating cumulative time of operation of the circuit card in the communication switch.
339 citations
••
22 Apr 2001TL;DR: The results show that increasing the number of mirror sites under the constraint is effective in reducing client download time and reducing server load only for a surprisingly small range of values regardless of the mirror placement algorithm.
Abstract: Internet service providers and infrastructural companies often employ mirrors of popular content to decrease client download time and server load. Due to the immense scale of the Internet and decentralized administration of the networks, companies have a limited number of sites (relative to the size of the Internet) where they can place mirrors. Mirrors of popular content are usually replicated on every site to maximize reachability to clients. We study the performance improvements as the number of mirrors increases under different placement algorithms subject to the constraint that mirrors can be placed only at certain locations. Although there are extensive theoretical studies on center placement and, analytical and empirical studies on Web cache placement, we are not aware of any published literature on mirror placement especially in the case of constrained mirror placement. Our results show that increasing the number of mirror sites under the constraint is effective in reducing client download time and reducing server load only for a surprisingly small range of values regardless of the mirror placement algorithm.
337 citations
••
TL;DR: It is found, surprisingly, that fading may enhance performance in terms of Shannon theoretic achievable rates and the effect of a random number of users per cell is investigated and it is demonstrated that randomization is beneficial.
Abstract: For pt.I see ibid., vol.43, no.6, p.1877-94 (1997). A simple idealized linear (and planar) uplink, cellular, multiple-access communication model, where only adjacent cell interference is present and all signals may experience fading is considered. Shannon theoretic arguments are invoked to gain insight into the implications on performance of the main system parameters and multiple-access techniques. The model treated in Part I (Shamai, 1997) is extended here to account for cell-site receivers that may process also the received signal at an adjacent cell site, compromising thus between the advantage of incorporating additional information from other cell sites on one hand and the associated excess processing complexity on the other. Various settings which include fading, time-division multiple access (TDMA), wideband (WB), and (optimized) fractional inter-cell time sharing (ICTS) protocols are investigated and compared. In this case and for the WB approach and a large number of users per cell it is found, surprisingly, that fading may enhance performance in terms of Shannon theoretic achievable rates. The linear model is extended to account for general linear and planar configurations. The effect of a random number of users per cell is investigated and it is demonstrated that randomization is beneficial. Certain aspects of diversity as well as some features of TDMA and orthogonal code-division multiple access (CDMA) techniques in the presence of fading are studied in an isolated cell scenario.
337 citations
••
TL;DR: A simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.
Abstract: We consider the following queuing system which arises as a model of a wireless link shared by multiple users. There is a finite number N of input flows served by a server. The system operates in discrete time t = 0,1,2,…. Each input flow can be described as an irreducible countable Markov chain; waiting customers of each flow are placed in a queue. The sequence of server states m(t), t = 0,1,2,…, is a Markov chain with finite number of states M. When the server is in state m, it can serve mim customers of flow i (in one time slot).The scheduling discipline is a rule that in each time slot chooses the flow to serve based on the server state and the state of the queues. Our main result is that a simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.
337 citations
Authors
Showing all 37011 results
Name | H-index | Papers | Citations |
---|---|---|---|
George M. Whitesides | 240 | 1739 | 269833 |
Yoshua Bengio | 202 | 1033 | 420313 |
John A. Rogers | 177 | 1341 | 127390 |
Zhenan Bao | 169 | 865 | 106571 |
Thomas S. Huang | 146 | 1299 | 101564 |
Federico Capasso | 134 | 1189 | 76957 |
Robert S. Brown | 130 | 1243 | 65822 |
Christos Faloutsos | 127 | 789 | 77746 |
Robert J. Cava | 125 | 1042 | 71819 |
Ramamoorthy Ramesh | 122 | 649 | 67418 |
Yann LeCun | 121 | 369 | 171211 |
Kamil Ugurbil | 120 | 536 | 59053 |
Don Towsley | 119 | 883 | 56671 |
Steven P. DenBaars | 118 | 1366 | 60343 |
Robert E. Tarjan | 114 | 400 | 67305 |