scispace - formally typeset
Search or ask a question
Institution

IBM

CompanyArmonk, New York, United States
About: IBM is a company organization based out in Armonk, New York, United States. It is known for research contribution in the topics: Layer (electronics) & Signal. The organization has 134567 authors who have published 253905 publications receiving 7458795 citations. The organization is also known as: International Business Machines Corporation & Big Blue.


Papers
More filters
Book ChapterDOI
19 Aug 2001
TL;DR: In this paper, the Subset-Cover framework is proposed for the stateless receiver case, where the users do not (necessarily) update their state from session to session, and sufficient conditions that guarantee the security of a revocation algorithm in this class are provided.
Abstract: We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their state from session to session. We present a framework called the Subset-Cover framework, which abstracts a variety of revocation schemes including some previously known ones. We provide sufficient conditions that guarantees the security of a revocation algorithm in this class. We describe two explicit Subset-Cover revocation algorithms; these algorithms are very flexible and work for any number of revoked users. The schemes require storage at the receiver of log N and 1/2 log2 N keys respectively (N is the total number of users), and in order to revoke r users the required message lengths are of r log N and 2r keys respectively. We also provide a general traitor tracing mechanism that can be integrated with any Subset-Cover revocation scheme that satisfies a "bifurcation property". This mechanism does not need an a priori bound on the number of traitors and does not expand the message length by much compared to the revocation of the same set of traitors. The main improvements of these methods over previously suggested methods, when adopted to the stateless scenario, are: (1) reducing the message length to O(r) regardless of the coalition size while maintaining a single decryption at the user's end (2) provide a seamless integration between the revocation and tracing so that the tracing mechanisms does not require any change to the revocation algorithm.

1,277 citations

Journal ArticleDOI
TL;DR: In this paper, the authors use the method of probability-weighted moments to derive estimators of the parameters and quantiles of the generalized extreme-value distribution, and investigate the properties of these estimators in large samples via asymptotic theory, and in small and moderate samples, via computer simulation.
Abstract: We use the method of probability-weighted moments to derive estimators of the parameters and quantiles of the generalized extreme-value distribution. We investigate the properties of these estimators in large samples, via asymptotic theory, and in small and moderate samples, via computer simulation. Probability-weighted moment estimators have low variance and no severe bias, and they compare favorably with estimators obtained by the methods of maximum likelihood or sextiles. The method of probability-weighted moments also yields a convenient and powerful test of whether an extreme-value distribution is of Fisher-Tippett Type I, II, or III.

1,275 citations

Journal ArticleDOI
Paul P. Maglio1, James C. Spohrer1
TL;DR: Service-dominant logic may be the philosophical foundation of service science, and the service system may be its basic theoretical construct, according to this paper.
Abstract: Service systems are value-co-creation configurations of people, technology, value propositionsconnecting internal and external service systems, and shared information (e.g., language, laws, measures, and methods). Service science is the study of service systems, aiming to create a basis for systematicservice innovation. Service science combines organization and human understanding with business andtechnological understanding to categorize and explain the many types of service systems that exist as wellas how service systems interact and evolve to co-create value. The goal is to apply scientific understandingto advance our ability to design, improve, and scale service systems. To make progress, we think servicedominantlogic provides just the right perspective, vocabulary, and assumptions on which to build a theory ofservice systems, their configurations, and their modes of interaction. Simply put, service-dominant logicmay be the philosophical foundation of service science, and the service system may be its basic theoreticalconstruct.

1,274 citations

Journal ArticleDOI
Jerry Tersoff1
TL;DR: In this paper, an alternative parametrization is given for a previous empirical interatomic potential for silicon, designed to more accurately reproduce the elastic properties of silicon, which were poorly described in the earlier potential.
Abstract: An alternative parametrization is given for a previous empirical interatomic potential for silicon. The new potential is designed to more accurately reproduce the elastic properties of silicon, which were poorly described in the earlier potential. The properties of liquid Si are also improved, but energies of surfaces are less accurate. Detailed tests of the new potential are described.

1,273 citations

Journal ArticleDOI
TL;DR: This article provides a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes, and other important issues in resource allocation such as overlay cells, frequency planning, and power control.
Abstract: This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed/centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.

1,273 citations


Authors

Showing all 134658 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
Anil K. Jain1831016192151
Hyun-Chul Kim1764076183227
Rodney S. Ruoff164666194902
Tobin J. Marks1591621111604
Jean M. J. Fréchet15472690295
Albert-László Barabási152438200119
György Buzsáki15044696433
Stanislas Dehaene14945686539
Philip S. Yu1481914107374
James M. Tour14385991364
Thomas P. Russell141101280055
Naomi J. Halas14043582040
Steven G. Louie13777788794
Daphne Koller13536771073
Network Information
Related Institutions (5)
Carnegie Mellon University
104.3K papers, 5.9M citations

93% related

Georgia Institute of Technology
119K papers, 4.6M citations

92% related

Bell Labs
59.8K papers, 3.1M citations

90% related

Microsoft
86.9K papers, 4.1M citations

89% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202330
2022137
20213,163
20206,336
20196,427
20186,278