Abstract We consider the properties of hard real-time tasks in the context of online scheduling o... more Abstract We consider the properties of hard real-time tasks in the context of online scheduling on multiprocessors in an environment where the parameters concerning the set of all future tasks are not known a-priori. We consider a set of ready tasks T 0 that need to ...
We recently introduced a new flow control scheme, called send-time control, which is based on a d... more We recently introduced a new flow control scheme, called send-time control, which is based on a deterministic model of virtual circuits in a computer network. In this scheme, the time at which a packet is sent by a source is computed from estimates of round-trip time, traffic in the ...
Executive Summary In pandemics or epidemics, public health authorities need to rapidly test a lar... more Executive Summary In pandemics or epidemics, public health authorities need to rapidly test a large number of individuals without adequate testing kits. We propose a testing protocol to accelerate infection diagnostics by combining multiple samples, and in case of positive results, re-test individual samples. The key insight is that a negative result in the first stage implies negative infection for all individuals. Thus, a single test could rule out infection in multiple individuals. Using simulations, we show that this protocol reduces the required number of testing kits, especially when the infection rate is low, alleviating a key bottleneck for public health authorities in times of pandemics and epidemics such as COVID-19. Our proposed protocol is expected to be more effective when the infection rate is low, which suggests that it is better suited for early stage and large-scale, population-wide testing. However, the managerial trade-off is that the protocol has costs in additional time for returning test results and an increased number of false negatives. We discuss applications of pooled testing in understanding population-wide testing to understand infection prevalence, to diagnose infections in high-risk groups of individuals, and to identify disease cold spots.
ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. I... more ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. It consists of an n-level full/binary tree augmented with (2n-2) redundant links. The short and regular redundant links improve several properties of the full/binary tree, such as increased tolerance, reduced traffic congestion and efficient routing of messages. It is shown that there exist at least two node-disjoint paths between every pair of nodes in the LAB-tree. In fact, all nonfaulty nodes remain connected in the presence of one faulty node at each level of the tree. The LAB-tree supports simple shortest-path routing algorithms which distribute messages evenly over links. The LAB-tree can be constructed modularly in VLSI by interconnecting modules or smaller size.
IEEE Transactions on Automatic Control, Jun 1, 1975
Attention has been directed to the problem of estimating the state of a linear dynamic system whi... more Attention has been directed to the problem of estimating the state of a linear dynamic system which has correlated noise. The cross correlations between the random vectors affecting the system are assumed unknown. A linear estimator is developed which bounds the corresponding error covariance matrix for any allowed cross correlation between the random disturbances in the plant and/or in the measuring device. The computational requirements are of the order of the corresponding Kalman filter assuming white and uncorrelated plant and measurement noise processes.
2006 1st International Conference on Communication Systems Software & Middleware
Abstract In the context of mobile ad hoc networks (MANETs), we consider the problem of identifyi... more Abstract In the context of mobile ad hoc networks (MANETs), we consider the problem of identifying (a) an optimal primary path which satisfies the required QoS constraints, and (b) a set of alternate paths that may be used in case a link or a node on the primary path fails. The alternate ...
Classification of higher education institutions (HEIs) of a country allows viewing higher educati... more Classification of higher education institutions (HEIs) of a country allows viewing higher education as a differentiated system which respects the diversity of purposes and aspirations of different HEIs. Classification is fundamentally different from ranking, which aims to rank universities in order with higher ranked HEIs being Bbetter^than lower ranked ones. In classification, the universities in a class are grouped by their purpose and mission, and no attempt is made to rank them. Carnegie Classification of universities in the USA is the oldest classification system, which groups universities into a few categories like Research Universities, Masters Universities, Baccalaureate Universities, and Secondary. This classification has been found extremely useful over decades for various purposes including policy making and planning. This has thus motivated similar exercises in many other countries, particularly for research universities. In this paper, we evolve an approach to classify research universities in India, based on the Carnegie Classification approach. We propose a simple basic criterion for identifying research universities, and apply it to the top 100 universities and top 100 engineering institutions in India. Using this criteria, 40 universities and 32 engineering institutions were identified as research HEIs. Based on the data on the level of research activity in these HEIs, we apply a clustering approach similar to the one Carnegie uses to group research HEIs into two sub-categories, viz. Bhighest research activity^and Bmoderate research activity^. The clustering approach identified six universities and eight engineering institutions in India to be in the highest research activity category. The level of research activity uses data on the number of full time PhD students, the number of faculty, research grants, and publications.
Proceedings of 5th International Workshop on Parallel and Distributed Real-Time Systems and 3rd Workshop on Object-Oriented Real-Time Systems
Abstract We consider the properties of hard real-time tasks in the context of online scheduling o... more Abstract We consider the properties of hard real-time tasks in the context of online scheduling on multiprocessors in an environment where the parameters concerning the set of all future tasks are not known a-priori. We consider a set of ready tasks T 0 that need to ...
IEE Proceedings E Computers and Digital Techniques, 1993
ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. I... more ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. It consists of an n-level full/binary tree augmented with (2n-2) redundant links. The short and regular redundant links improve several properties of the full/binary tree, such as increased tolerance, reduced traffic congestion and efficient routing of messages. It is shown that there exist at least two node-disjoint paths between every pair of nodes in the LAB-tree. In fact, all nonfaulty nodes remain connected in the presence of one faulty node at each level of the tree. The LAB-tree supports simple shortest-path routing algorithms which distribute messages evenly over links. The LAB-tree can be constructed modularly in VLSI by interconnecting modules or smaller size.
Abstract We consider the properties of hard real-time tasks in the context of online scheduling o... more Abstract We consider the properties of hard real-time tasks in the context of online scheduling on multiprocessors in an environment where the parameters concerning the set of all future tasks are not known a-priori. We consider a set of ready tasks T 0 that need to ...
We recently introduced a new flow control scheme, called send-time control, which is based on a d... more We recently introduced a new flow control scheme, called send-time control, which is based on a deterministic model of virtual circuits in a computer network. In this scheme, the time at which a packet is sent by a source is computed from estimates of round-trip time, traffic in the ...
Executive Summary In pandemics or epidemics, public health authorities need to rapidly test a lar... more Executive Summary In pandemics or epidemics, public health authorities need to rapidly test a large number of individuals without adequate testing kits. We propose a testing protocol to accelerate infection diagnostics by combining multiple samples, and in case of positive results, re-test individual samples. The key insight is that a negative result in the first stage implies negative infection for all individuals. Thus, a single test could rule out infection in multiple individuals. Using simulations, we show that this protocol reduces the required number of testing kits, especially when the infection rate is low, alleviating a key bottleneck for public health authorities in times of pandemics and epidemics such as COVID-19. Our proposed protocol is expected to be more effective when the infection rate is low, which suggests that it is better suited for early stage and large-scale, population-wide testing. However, the managerial trade-off is that the protocol has costs in additional time for returning test results and an increased number of false negatives. We discuss applications of pooled testing in understanding population-wide testing to understand infection prevalence, to diagnose infections in high-risk groups of individuals, and to identify disease cold spots.
ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. I... more ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. It consists of an n-level full/binary tree augmented with (2n-2) redundant links. The short and regular redundant links improve several properties of the full/binary tree, such as increased tolerance, reduced traffic congestion and efficient routing of messages. It is shown that there exist at least two node-disjoint paths between every pair of nodes in the LAB-tree. In fact, all nonfaulty nodes remain connected in the presence of one faulty node at each level of the tree. The LAB-tree supports simple shortest-path routing algorithms which distribute messages evenly over links. The LAB-tree can be constructed modularly in VLSI by interconnecting modules or smaller size.
IEEE Transactions on Automatic Control, Jun 1, 1975
Attention has been directed to the problem of estimating the state of a linear dynamic system whi... more Attention has been directed to the problem of estimating the state of a linear dynamic system which has correlated noise. The cross correlations between the random vectors affecting the system are assumed unknown. A linear estimator is developed which bounds the corresponding error covariance matrix for any allowed cross correlation between the random disturbances in the plant and/or in the measuring device. The computational requirements are of the order of the corresponding Kalman filter assuming white and uncorrelated plant and measurement noise processes.
2006 1st International Conference on Communication Systems Software & Middleware
Abstract In the context of mobile ad hoc networks (MANETs), we consider the problem of identifyi... more Abstract In the context of mobile ad hoc networks (MANETs), we consider the problem of identifying (a) an optimal primary path which satisfies the required QoS constraints, and (b) a set of alternate paths that may be used in case a link or a node on the primary path fails. The alternate ...
Classification of higher education institutions (HEIs) of a country allows viewing higher educati... more Classification of higher education institutions (HEIs) of a country allows viewing higher education as a differentiated system which respects the diversity of purposes and aspirations of different HEIs. Classification is fundamentally different from ranking, which aims to rank universities in order with higher ranked HEIs being Bbetter^than lower ranked ones. In classification, the universities in a class are grouped by their purpose and mission, and no attempt is made to rank them. Carnegie Classification of universities in the USA is the oldest classification system, which groups universities into a few categories like Research Universities, Masters Universities, Baccalaureate Universities, and Secondary. This classification has been found extremely useful over decades for various purposes including policy making and planning. This has thus motivated similar exercises in many other countries, particularly for research universities. In this paper, we evolve an approach to classify research universities in India, based on the Carnegie Classification approach. We propose a simple basic criterion for identifying research universities, and apply it to the top 100 universities and top 100 engineering institutions in India. Using this criteria, 40 universities and 32 engineering institutions were identified as research HEIs. Based on the data on the level of research activity in these HEIs, we apply a clustering approach similar to the one Carnegie uses to group research HEIs into two sub-categories, viz. Bhighest research activity^and Bmoderate research activity^. The clustering approach identified six universities and eight engineering institutions in India to be in the highest research activity category. The level of research activity uses data on the number of full time PhD students, the number of faculty, research grants, and publications.
Proceedings of 5th International Workshop on Parallel and Distributed Real-Time Systems and 3rd Workshop on Object-Oriented Real-Time Systems
Abstract We consider the properties of hard real-time tasks in the context of online scheduling o... more Abstract We consider the properties of hard real-time tasks in the context of online scheduling on multiprocessors in an environment where the parameters concerning the set of all future tasks are not known a-priori. We consider a set of ready tasks T 0 that need to ...
IEE Proceedings E Computers and Digital Techniques, 1993
ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. I... more ABSTRACT A new augmented binary-tree multiprocessor architecture, called LAB-tree, is proposed. It consists of an n-level full/binary tree augmented with (2n-2) redundant links. The short and regular redundant links improve several properties of the full/binary tree, such as increased tolerance, reduced traffic congestion and efficient routing of messages. It is shown that there exist at least two node-disjoint paths between every pair of nodes in the LAB-tree. In fact, all nonfaulty nodes remain connected in the presence of one faulty node at each level of the tree. The LAB-tree supports simple shortest-path routing algorithms which distribute messages evenly over links. The LAB-tree can be constructed modularly in VLSI by interconnecting modules or smaller size.
Uploads
Papers by Bijendra Jain