scispace - formally typeset
Search or ask a question
Institution

Bell Labs

Company
About: Bell Labs is a based out in . It is known for research contribution in the topics: Laser & Optical fiber. The organization has 36499 authors who have published 59862 publications receiving 3190823 citations. The organization is also known as: Bell Laboratories & AT&T Bell Laboratories.


Papers
More filters
Journal ArticleDOI
Adel A. M. Saleh1
TL;DR: A frequencydependent quadrature model is proposed whose parameters are obtainable from single-tone measurements and is shown to fit measured data very well.
Abstract: Simple two-parameter formulas are presented for the functions involved in the amplitude-phase and the quadrature nonlinear models of a TWT amplifier, and are shown to fit measured data very well. Also, a closed-form expression is derived for the output signal of a TWT amplifier excited by two phase-modulated carriers, and an expression containing a single integral is given when more than two such earriers are involved. Finally, a frequencydependent quadrature model is proposed whose parameters are obtainable from single-tone measurements.

1,442 citations

Journal ArticleDOI
David E. Aspnes1
TL;DR: In this article, the connection between microstructure and absolute limits to the allowed values of the dielectric response of two-phase composites is reviewed and a solution of the Clausius-Mossotti problem is developed from basic principles.

1,433 citations

Book
William S. Cleveland1
01 Jan 1985
TL;DR: The power of graphs, improving graphs, and history as mentioned in this paper, and the power of graph construction, improving graph, and improving graph history, are discussed in detail in Section 2.1.
Abstract: The power of graphs, improving graphs, and history. Principles of graph construction. Graphical methods. Graphical perception.

1,421 citations

Journal ArticleDOI
TL;DR: This work introduces pricing of transmit powers in order to obtain Pareto improvement of the noncooperative power control game, i.e., to obtain improvements in user utilities relative to the case with no pricing.
Abstract: A major challenge in the operation of wireless communications systems is the efficient use of radio resources. One important component of radio resource management is power control, which has been studied extensively in the context of voice communications. With the increasing demand for wireless data services, it is necessary to establish power control algorithms for information sources other than voice. We present a power control solution for wireless data in the analytical setting of a game theoretic framework. In this context, the quality of service (QoS) a wireless terminal receives is referred to as the utility and distributed power control is a noncooperative power control game where users maximize their utility. The outcome of the game results in a Nash (1951) equilibrium that is inefficient. We introduce pricing of transmit powers in order to obtain Pareto improvement of the noncooperative power control game, i.e., to obtain improvements in user utilities relative to the case with no pricing. Specifically, we consider a pricing function that is a linear function of the transmit power. The simplicity of the pricing function allows a distributed implementation where the price can be broadcast by the base station to all the terminals. We see that pricing is especially helpful in a heavily loaded system.

1,416 citations

Proceedings Article
12 Jul 1992
TL;DR: A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.
Abstract: We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure or resolution. We also show that GSAT can solve structured satisfiability problems quickly. In particular, we solve encodings of graph coloring problems, N-queens, and Boolean induction. General application strategies and limitations of the approach are also discussed. GSAT is best viewed as a model-finding procedure. Its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.

1,410 citations


Authors

Showing all 36526 results

NameH-indexPapersCitations
Yoshua Bengio2021033420313
David R. Williams1782034138789
John A. Rogers1771341127390
Zhenan Bao169865106571
Stephen R. Forrest1481041111816
Bernhard Schölkopf1481092149492
Thomas S. Huang1461299101564
Kurt Wüthrich143739103253
John D. Joannopoulos137956100831
Steven G. Louie13777788794
Joss Bland-Hawthorn136111477593
Marvin L. Cohen13497987767
Federico Capasso134118976957
Christos Faloutsos12778977746
Robert J. Cava125104271819
Network Information
Related Institutions (5)
IBM
253.9K papers, 7.4M citations

90% related

Georgia Institute of Technology
119K papers, 4.6M citations

89% related

University of California, Santa Barbara
80.8K papers, 4.6M citations

89% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

88% related

Princeton University
146.7K papers, 9.1M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20233
202245
2021479
2020712
2019750
2018862