Kumar, P. R.
Overview
Works:  105 works in 179 publications in 2 languages and 1,583 library holdings 

Genres:  Conference papers and proceedings Biography 
Roles:  Author, Editor, Other, Contributor 
Classifications:  QA402, 003 
Publication Timeline
.
Most widely held works by
P. R Kumar
Stochastic systems : estimation, identification, and adaptive control by
P. R Kumar(
Book
)
17 editions published between 1986 and 2016 in English and held by 354 WorldCat member libraries worldwide
Since its origins in the 1940s, the subject of decision making under uncertainty has grown into a diversified area with application in several branches of engineering and in those areas of the social sciences concerned with policy analysis and prescription. These approaches required a computing capacity too expensive for the time, until the ability to collect and process huge quantities of data engendered an explosion of work in the area. This book provides succinct and rigorous treatment of the foundations of stochastic control; a unified approach to filtering, estimation, prediction, and stochastic and adaptive control; and the conceptual framework necessary to understand current trends in stochastic control, data mining, machine learning, and robotics
17 editions published between 1986 and 2016 in English and held by 354 WorldCat member libraries worldwide
Since its origins in the 1940s, the subject of decision making under uncertainty has grown into a diversified area with application in several branches of engineering and in those areas of the social sciences concerned with policy analysis and prescription. These approaches required a computing capacity too expensive for the time, until the ability to collect and process huge quantities of data engendered an explosion of work in the area. This book provides succinct and rigorous treatment of the foundations of stochastic control; a unified approach to filtering, estimation, prediction, and stochastic and adaptive control; and the conceptual framework necessary to understand current trends in stochastic control, data mining, machine learning, and robotics
Adaptive control, filtering, and signal processing by
Karl J Åström(
Book
)
10 editions published in 1995 in English and held by 187 WorldCat member libraries worldwide
The area of adaptive systems, which encompasses recursive identification, adaptive control, filtering, and signal processing, has been one of the most active areas of the past decade. Since adaptive controllers are fundamentally nonlinear controllers which are applied to nominally linear, possibly stochastic and timevarying systems, their theoretical analysis is usually very difficult. Nevertheless, over the past decade much fundamental progress has been made on some key questions concerning their stability, convergence, performance, and robustness. Moreover, adaptive controllers have been successfully employed in numerous practical applications, and have even entered the marketplace
10 editions published in 1995 in English and held by 187 WorldCat member libraries worldwide
The area of adaptive systems, which encompasses recursive identification, adaptive control, filtering, and signal processing, has been one of the most active areas of the past decade. Since adaptive controllers are fundamentally nonlinear controllers which are applied to nominally linear, possibly stochastic and timevarying systems, their theoretical analysis is usually very difficult. Nevertheless, over the past decade much fundamental progress has been made on some key questions concerning their stability, convergence, performance, and robustness. Moreover, adaptive controllers have been successfully employed in numerous practical applications, and have even entered the marketplace
Discrete event systems, manufacturing systems, and communication networks by
P. R Kumar(
Book
)
10 editions published in 1995 in English and held by 170 WorldCat member libraries worldwide
See publisher description :
10 editions published in 1995 in English and held by 170 WorldCat member libraries worldwide
See publisher description :
Mathematical foundations of complex networked information systems : Politecnico di Torino, Verrès, Italy 2009 by
P. R Kumar(
Book
)
11 editions published in 2015 in English and held by 73 WorldCat member libraries worldwide
Introducing the reader to the mathematics beyond complex networked systems, these lecture notes investigate graph theory, graphical models, and methods from statistical physics. Complex networked systems play a fundamental role in our society, both in everyday life and in scientific research, with applications ranging from physics and biology to economics and finance. The book is selfcontained, and requires only an undergraduate mathematical background
11 editions published in 2015 in English and held by 73 WorldCat member libraries worldwide
Introducing the reader to the mathematics beyond complex networked systems, these lecture notes investigate graph theory, graphical models, and methods from statistical physics. Complex networked systems play a fundamental role in our society, both in everyday life and in scientific research, with applications ranging from physics and biology to economics and finance. The book is selfcontained, and requires only an undergraduate mathematical background
Scaling laws for ad hoc wireless networks : an information theoretic approach by
Feng Xue(
Book
)
7 editions published in 2006 in English and held by 20 WorldCat member libraries worldwide
In recent years there has been significant and increasing interest in ad hoc wireless networks. The design, analysis and deployment of such wireless networks necessitate a fundamental understanding of how much information transfer they can support, as well as what the appropriate architectures and protocols are for operating them. This monograph addresses these questions by presenting various models and results that quantify the information transport capability of wireless networks, as well as shed light on architecture design from a high level point of view. The models take into consideration important features such as the spatial distribution of nodes, strategies for sharing the wireless medium, the attenuation of signals with distance, and how information is to be transferred, whether it be by encoding, decoding, choice of power level, spatiotemporal scheduling of transmissions, choice of multihop routes, or other modalities of cooperation between nodes. An important aspect of the approach is to characterize how the information hauling capacity scales with the number of nodes in the network. The monograph begins by studying models of wireless networks based on current technology, which schedules concurrent transmissions to take account of interference, and then routes packets from their sources to destinations in a multihop fashion. An index of performance, called transport capacity, which is measured by the bit meters per second the network can convey in aggregate, is studied. For arbitrary networks, including those allowing for optimization of node locations, the scaling law for the transport capacity in terms of the number of nodes in the network is identified. For random networks, where nodes are randomly distributed, and sourcedestination pairs are randomly chosen, the scaling law for the maximum common throughput capacity that can be supported for all the sourcedestination pairs is characterized. The constructive procedure for obtaining the sharp lower bound gives insight into an order optimal architecture for wireless networks operating under a multihop strategy. To determine the ultimate limits on how much information wireless networks can carry requires an information theoretic treatment, and this is the subject of the second half of the monograph. Since wireless communication takes place over a shared medium, it allows more advanced operations in addition to multihop. To understand the limitations as well as possibilities for such information transfer, wireless networks are studied from a Shannon informationtheoretic point of view, allowing any causal operation. Models that characterize how signals attenuate with distance, as well as multipath fading, are introduced. Fundamental bounds on the transport capacity are established for both high and low attenuation regimes. The results show that the multihop transport scheme achieves the same order of scaling, though with a different preconstant, as the information theoretically best possible, in the high attenuation regime. However, in the low attenuation regime, superlinear scaling may be possible through recourse to more advanced modes of cooperation between nodes. Techniques used in analyzing multiantenna systems are also studied to characterize the scaling behavior of large wireless networks
7 editions published in 2006 in English and held by 20 WorldCat member libraries worldwide
In recent years there has been significant and increasing interest in ad hoc wireless networks. The design, analysis and deployment of such wireless networks necessitate a fundamental understanding of how much information transfer they can support, as well as what the appropriate architectures and protocols are for operating them. This monograph addresses these questions by presenting various models and results that quantify the information transport capability of wireless networks, as well as shed light on architecture design from a high level point of view. The models take into consideration important features such as the spatial distribution of nodes, strategies for sharing the wireless medium, the attenuation of signals with distance, and how information is to be transferred, whether it be by encoding, decoding, choice of power level, spatiotemporal scheduling of transmissions, choice of multihop routes, or other modalities of cooperation between nodes. An important aspect of the approach is to characterize how the information hauling capacity scales with the number of nodes in the network. The monograph begins by studying models of wireless networks based on current technology, which schedules concurrent transmissions to take account of interference, and then routes packets from their sources to destinations in a multihop fashion. An index of performance, called transport capacity, which is measured by the bit meters per second the network can convey in aggregate, is studied. For arbitrary networks, including those allowing for optimization of node locations, the scaling law for the transport capacity in terms of the number of nodes in the network is identified. For random networks, where nodes are randomly distributed, and sourcedestination pairs are randomly chosen, the scaling law for the maximum common throughput capacity that can be supported for all the sourcedestination pairs is characterized. The constructive procedure for obtaining the sharp lower bound gives insight into an order optimal architecture for wireless networks operating under a multihop strategy. To determine the ultimate limits on how much information wireless networks can carry requires an information theoretic treatment, and this is the subject of the second half of the monograph. Since wireless communication takes place over a shared medium, it allows more advanced operations in addition to multihop. To understand the limitations as well as possibilities for such information transfer, wireless networks are studied from a Shannon informationtheoretic point of view, allowing any causal operation. Models that characterize how signals attenuate with distance, as well as multipath fading, are introduced. Fundamental bounds on the transport capacity are established for both high and low attenuation regimes. The results show that the multihop transport scheme achieves the same order of scaling, though with a different preconstant, as the information theoretically best possible, in the high attenuation regime. However, in the low attenuation regime, superlinear scaling may be possible through recourse to more advanced modes of cooperation between nodes. Techniques used in analyzing multiantenna systems are also studied to characterize the scaling behavior of large wireless networks
Packets with deadlines : a framework for realtime wireless networks by
IHong Hou(
Book
)
7 editions published in 2013 in English and held by 20 WorldCat member libraries worldwide
"With the explosive increase in the number of mobile devices and applications, it is anticipated that wireless traffic will increase exponentially in the coming years. Moreover, future wireless networks all carry a wide variety of flows, such as video streaming, online gaming, and VoIP, which have various quality of service (QoS) requirements. Therefore, a new mechanism that can provide satisfactory performance to the complete variety of all kinds of flows, in a coherent and unified framework, is needed. In this book, we introduce a framework for realtime wireless networks. This consists of a model that jointly addresses several practical concerns for realtime wireless networks, including perpacket delay bounds, throughput requirements, and heterogeneity of wireless channels. We detail how this framework can be employed to address a wide range of problems, including admission control, packet scheduling, and utility maximization."Page [vi]
7 editions published in 2013 in English and held by 20 WorldCat member libraries worldwide
"With the explosive increase in the number of mobile devices and applications, it is anticipated that wireless traffic will increase exponentially in the coming years. Moreover, future wireless networks all carry a wide variety of flows, such as video streaming, online gaming, and VoIP, which have various quality of service (QoS) requirements. Therefore, a new mechanism that can provide satisfactory performance to the complete variety of all kinds of flows, in a coherent and unified framework, is needed. In this book, we introduce a framework for realtime wireless networks. This consists of a model that jointly addresses several practical concerns for realtime wireless networks, including perpacket delay bounds, throughput requirements, and heterogeneity of wireless channels. We detail how this framework can be employed to address a wide range of problems, including admission control, packet scheduling, and utility maximization."Page [vi]
Research on rapeseed & mustard : proceedings of an IndoSwedish Symposium, September 46, 1989(
Book
)
4 editions published in 1990 in English and held by 10 WorldCat member libraries worldwide
4 editions published in 1990 in English and held by 10 WorldCat member libraries worldwide
Mathematical foundations of complex networked information systems : Politecnico di Torino, Verrès, Italy 2009(
)
1 edition published in 2015 in English and held by 9 WorldCat member libraries worldwide
Introducing the reader to the mathematics beyond complex networked systems, these lecture notes investigate graph theory, graphical models, and methods from statistical physics. Complex networked systems play a fundamental role in our society, both in everyday life and in scientific research, with applications ranging from physics and biology to economics and finance. The book is selfcontained, and requires only an undergraduate mathematical background
1 edition published in 2015 in English and held by 9 WorldCat member libraries worldwide
Introducing the reader to the mathematics beyond complex networked systems, these lecture notes investigate graph theory, graphical models, and methods from statistical physics. Complex networked systems play a fundamental role in our society, both in everyday life and in scientific research, with applications ranging from physics and biology to economics and finance. The book is selfcontained, and requires only an undergraduate mathematical background
Proceedings, twentyfifth annual Allerton Conference on Communication, Control, and Computing : conference held September
30October 2, 1987, Allerton House, Monticello, Illinois by
P. R Kumar(
Book
)
3 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
Lecture series in mobile telecommunications and networks : transcripts of the third series of three lectures, March 2008 
February 2009 by
P. R Kumar(
Book
)
1 edition published in 2009 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 2009 in English and held by 6 WorldCat member libraries worldwide
Proceedings / Twentyfifth Annual Allerton Conference on Communication, Control, and Computing : conference held September
30  October 2, 1987, Allerton House, Monticello, Illinois by
Control, and Computing (25, 1987, Monticello, Ill.) Allerton Conference on Communication(
Book
)
2 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide
Stochastic optimal control and stochastic differential games by
P. R Kumar(
Book
)
4 editions published between 1977 and 1979 in English and held by 4 WorldCat member libraries worldwide
4 editions published between 1977 and 1979 in English and held by 4 WorldCat member libraries worldwide
Proceedings, Twentyseventh Annual Allerton Conference on Communication, Control, and Computing : conference held September
2729, 1989, Allerton House, Monticello, Illinois by
Control, and Computing (25, 1987, Monticello, Ill.) Allerton Conference on Communication(
Book
)
2 editions published between 1987 and 1989 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 1987 and 1989 in English and held by 3 WorldCat member libraries worldwide
Ramana pahavanum thirukkoiyilkalum by
P. R Kumar(
Book
)
2 editions published in 2010 in Tamil and held by 3 WorldCat member libraries worldwide
Temples in South India
2 editions published in 2010 in Tamil and held by 3 WorldCat member libraries worldwide
Temples in South India
Clean slate approach to secure wireless networking by Jonathan Ponniah(
Book
)
4 editions published between 2013 and 2015 in English and held by 2 WorldCat member libraries worldwide
The current process of designing secure protocols is tantamount to an arms race between attacks and "patches". We introduce a system theoretic approach to secure protocol design with provable security guarantees against all attacks that fall within the system model. In this approach, we frame the secure protocol design problem as a maxmin optimization of a specific payoff function, where the adversarial nodes with a priori knowledge of the protocol choose a strategy that minimizes the payoff, and the protocol seeks to maximize this worstcase payoff. We make the following three contributions. First, we solve the optimization problem. That is, we describe a protocol and show that is maxmin optimal. Second, we show that the protocol is actually minmax optimal which is generally higher than maxmin optimality. Finally, we show that the adversarial nodes are effectively limited to one of two modes: either jamming or conforming with the protocol
4 editions published between 2013 and 2015 in English and held by 2 WorldCat member libraries worldwide
The current process of designing secure protocols is tantamount to an arms race between attacks and "patches". We introduce a system theoretic approach to secure protocol design with provable security guarantees against all attacks that fall within the system model. In this approach, we frame the secure protocol design problem as a maxmin optimization of a specific payoff function, where the adversarial nodes with a priori knowledge of the protocol choose a strategy that minimizes the payoff, and the protocol seeks to maximize this worstcase payoff. We make the following three contributions. First, we solve the optimization problem. That is, we describe a protocol and show that is maxmin optimal. Second, we show that the protocol is actually minmax optimal which is generally higher than maxmin optimality. Finally, we show that the adversarial nodes are effectively limited to one of two modes: either jamming or conforming with the protocol
Verification and Enforcement of StateBased Notions of Opacity in Discrete Event Systems by Anooshiravan Saboori(
)
1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide
Motivated by security and privacy considerations in applications of discrete event systems, we describe and analyze the complexity of verifying various statebased notions of opacity in systems that are modeled as (possibly nondeterministic) finite automata with partial observation on their transitions. Assuming that the intruder observes system activity through some projection map and has complete knowledge of the system model, we define three notions of opacity with respect to a set of secret states: (i) initialstate opacity is a notion that requires the membership of the system true initial state to the set of secret states remain opaque (i.e., uncertain) to the intruder; (ii) Kstep opacity is a notion that requires that at any specific point in time within the last K observations, the entrance of the system state to the given set of secret states remain opaque to the intruder; (iii) infinitestep opacity is a notion that requires the entrance of the system state at any particular instant to the set of secret states remain opaque, for the length of the system operation, to the intruder. As illustrated via examples in the thesis, the above statebased notions of opacity can be used to characterize the security requirements in many applications, including encryption using pseudorandom generators, coverage properties in sensor networks, and anonymity requirements in protocols for web transactions. In order to model the intruder capabilities regarding initialstate opacity, we address the initialstate estimation problem in a nondeterministic finite automaton under partial observations on its transitions via the construction of an initialstate estimator. We analyze the properties and complexity of the initialstate estimator, and show how the complexity of the verification method can be greatly reduced in the special case when the set of secret states is invariant (i.e., it does not change over time). We also establish that the verification of initialstate opacity is a PSPACEcomplete problem. In order to verify Kstep opacity, we introduce the Kdelay state estimator which constructs the estimate of the state of the system K observations ago (Kdelayed state estimates) for a given nondeterministic finite automaton under partial observation on its transitions. We provide two methods for constructing Kdelay state estimators, and hence two methods for verifying Kstep opacity, and analyze the computational complexity of both. In the process, we also establish that the verification of $K$step opacity is an NPhard problem. We also investigate the role of the delay K in Kstep opacity and show that there exists a delay K* such that Kstep opacity implies K'step opacity for any K and K' such that K'>K>= K*. This is not true for arbitrary K'>K though the converse holds trivially. Infinitestep opacity can be verified via the construction of a currentstate estimator and a bank of appropriate initialstate estimators. The verification of infinitestep opacity is also shown to be a PSPACEhard problem. Finally, we tackle the problem of constructing a minimally restrictive opacityenforcing supervisor (MOES) which limits the system's behavior within some prespecified legal behavior while enforcing opacity requirements. We characterize the solution to MOES, under some mild assumptions, in terms of the supremal element of certain controllable, normal, and opaque languages. We also show that this supremal element always exists and that it can be implemented using state estimators. The result is a supervisor that achieves conformance to the prespecified legal behavior while enforcing opacity by disabling, at any given time, a subset of the controllable system events, in a way that minimally restricts the range of allowable system behavior
1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide
Motivated by security and privacy considerations in applications of discrete event systems, we describe and analyze the complexity of verifying various statebased notions of opacity in systems that are modeled as (possibly nondeterministic) finite automata with partial observation on their transitions. Assuming that the intruder observes system activity through some projection map and has complete knowledge of the system model, we define three notions of opacity with respect to a set of secret states: (i) initialstate opacity is a notion that requires the membership of the system true initial state to the set of secret states remain opaque (i.e., uncertain) to the intruder; (ii) Kstep opacity is a notion that requires that at any specific point in time within the last K observations, the entrance of the system state to the given set of secret states remain opaque to the intruder; (iii) infinitestep opacity is a notion that requires the entrance of the system state at any particular instant to the set of secret states remain opaque, for the length of the system operation, to the intruder. As illustrated via examples in the thesis, the above statebased notions of opacity can be used to characterize the security requirements in many applications, including encryption using pseudorandom generators, coverage properties in sensor networks, and anonymity requirements in protocols for web transactions. In order to model the intruder capabilities regarding initialstate opacity, we address the initialstate estimation problem in a nondeterministic finite automaton under partial observations on its transitions via the construction of an initialstate estimator. We analyze the properties and complexity of the initialstate estimator, and show how the complexity of the verification method can be greatly reduced in the special case when the set of secret states is invariant (i.e., it does not change over time). We also establish that the verification of initialstate opacity is a PSPACEcomplete problem. In order to verify Kstep opacity, we introduce the Kdelay state estimator which constructs the estimate of the state of the system K observations ago (Kdelayed state estimates) for a given nondeterministic finite automaton under partial observation on its transitions. We provide two methods for constructing Kdelay state estimators, and hence two methods for verifying Kstep opacity, and analyze the computational complexity of both. In the process, we also establish that the verification of $K$step opacity is an NPhard problem. We also investigate the role of the delay K in Kstep opacity and show that there exists a delay K* such that Kstep opacity implies K'step opacity for any K and K' such that K'>K>= K*. This is not true for arbitrary K'>K though the converse holds trivially. Infinitestep opacity can be verified via the construction of a currentstate estimator and a bank of appropriate initialstate estimators. The verification of infinitestep opacity is also shown to be a PSPACEhard problem. Finally, we tackle the problem of constructing a minimally restrictive opacityenforcing supervisor (MOES) which limits the system's behavior within some prespecified legal behavior while enforcing opacity requirements. We characterize the solution to MOES, under some mild assumptions, in terms of the supremal element of certain controllable, normal, and opaque languages. We also show that this supremal element always exists and that it can be implemented using state estimators. The result is a supervisor that achieves conformance to the prespecified legal behavior while enforcing opacity by disabling, at any given time, a subset of the controllable system events, in a way that minimally restricts the range of allowable system behavior
Proceedings of the ACM/IEEE 4th International Conference on CyberPhysical Systems by
Chenyang Lu(
)
1 edition published in 2013 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 0 WorldCat member libraries worldwide
ICCPS '14 ACMIEEE 5th International Conference on CyberPhysical Systems (with CPS Week 2014) by
P. R Kumar(
)
1 edition published in 2014 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2014 in English and held by 0 WorldCat member libraries worldwide
ANC'13 : proceedings of the 2013 Workshop on Airborne Networks and Communications : July 29, 2013, Bangalore, India by ACM MobiHoc Workshop on Airborne Networks and Communications(
)
1 edition published in 2013 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 0 WorldCat member libraries worldwide
Proceedings of the second ACM MobiHoc workshop on Airborne networks and communications by
P. R Kumar(
)
2 editions published in 2013 in English and held by 0 WorldCat member libraries worldwide
2 editions published in 2013 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Varaiya, P. P. (Pravin Pratap) Other Editor
 Wainwright, Martin (Martin J.)
 Ravazzi, Chiara Editor
 Fosson, Sophie M. Editor
 Zecchina, Riccardo
 Fagnani, Fabio Editor
 Åström, Karl J. (Karl Johan) 1934 Author Editor
 Goodwin, Graham C. (Graham Clifford) 1945 Editor
 Hou, IHong Author
 Xue, Feng Author
Associated Subjects
Adaptive control systems AeronauticsCommunication systems Automatic control Cell phone systems Computer network protocols Computer networksSecurity measures Computer science Control theory Cybernetics Differential games Discretetime systems Electric circuits Electronic data processingComputerassisted instruction Electronic data processingDistributed processing Electronic digital computers Embedded computer systems Filters (Mathematics) Graph theory Hindu saints India Mathematical optimization Mathematics Mechanics Mobile communication systems Mustard Packet switching (Data transmission) Production scheduling Ramana,Maharshi Rape (Plant) Realtime data processing Realtime programming Signal processing Stochastic processes Stochastic systems System analysis Telecommunication Telecommunication systems TelecommunicationTrafficMathematical models Wireless communication systems Wireless communication systemsSecurity measures Wireless LANs