Pragati Agrawal - Academia.edu (original) (raw)

Uploads

Papers by Pragati Agrawal

IEEE Transactions on Automation Science and Engineering, 2014

With data becoming a salient asset worldwide, dependence within data kept on growing, hence the r... more With data becoming a salient asset worldwide, dependence within data kept on growing, hence the real world datasets that one works upon in today's time are highly correlated. Since the past few years, researchers have given attention to this aspect of data privacy and found that where there exists a correlation among data, the existing privacy guarantees could not be assured with existing privacy algorithms. The privacy guarantees provided by existing algorithms were enough when there existed no relation between data in the datasets. Hence, by keeping the existence of data correlation into account, there is a dire need, to reconsider the privacy algorithms. Some of the research have considered to utilize a well known machine learning concept, i.e., Data Correlation Analysis to understand the relationship between data in a better way. This has given some promising results as well. Though its less but still a considerable amount of research has been done for correlated data privac...

Given a system model where machines have distinct speeds and power ratings but are otherwise comp... more Given a system model where machines have distinct speeds and power ratings but are otherwise compatible, we consider various problems of scheduling under resource constraints on the system which place the restriction that not all machines can be run at once. These can be power, energy, or makespan constraints on the system. Given such constraints, there are problems with divisible as well as non-divisible jobs. In the setting where there is a constraint on power, we show that the problem of minimizing makespan for a set of divisible jobs is NP-hard by reduction to the knapsack problem. We then show that scheduling to minimize energy with power constraints is also NP-hard. We then consider scheduling with energy and makespan constraints with divisible jobs and show that these can be solved in polynomial time, and the problems with non-divisible jobs are NP-hard. We give exact and approximation algorithms for these problems as required.

ASIAN JOURNAL OF CONVERGENCE IN TECHNOLOGY

Phishing attacks capitalize on human errors and target the vulnerabilities formed due to it. Most... more Phishing attacks capitalize on human errors and target the vulnerabilities formed due to it. Most of the attacks are aimed at stealing private information from users, which spread via different mechanisms. There is no single solution to this problem to effectively nullify all the attacks but multiple techniques have been developed to defend against these attacks. This paper reviews the work on the detection of phishing attacks. In this paper, we aim to study the techniques which mainly detect and help in preventing phishing attacks rather than mitigating them. A general run-through of the most successful techniques for phishing attack detection has been presented here.

Sādhanā, 2021

The problem of attaining energy efficiency in distributed systems is of importance, but a general... more The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal scheduling and present theoretical foundations of the same. We derive results concerning energy-minimal scheduling of independent jobs in a distributed system with functionally similar machines with different working and idle power ratings. The machines considered in our system can have identical as well as different speeds. If the jobs can be divided into arbitrary parts, we show that the minimum-energy schedule can be generated in linear time and give exact scheduling algorithms. For the cases where jobs are non-divisible, we prove that the scheduling problems are NP-hard and also give approximation algorithms for the same along with their bounds.

Current Science, Jan 10, 2013

Information technology (IT) equipment is already estimated to account for about 2% of the global ... more Information technology (IT) equipment is already estimated to account for about 2% of the global energy consumption, and this figure is only expected to rise. However, the use of solar power for IT has yet to receive the attention it deserves from researchers, and there is a vast array of important problems to be addressed to enable the use of solar and other alternative energy sources in IT. In this note, we take the view that a broad systems perspective of solar-power generation and utilization (rather than looking only at component technologies such as PV, solar-thermal, etc.) is essential, and mention major directions which in our opinion merit attention in this regard.

Book chapter in "Orthogonal Frequency Division Multiple Access Fundamentals and Applications." Ba... more Book chapter in "Orthogonal Frequency Division Multiple Access Fundamentals and Applications." Base Station User 1 User 2 User K Base Station User 1 User 2 User K Single Cell Downlink Communications Single Cell Uplink Communications Figure 1: Example of a single cell downlink (left) and uplink scenerio (right).

Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems - e-Energy '15, 2015

It is known that energy-minimal scheduling is strictly harder than minimal-makespan scheduling, b... more It is known that energy-minimal scheduling is strictly harder than minimal-makespan scheduling, but it is not well understood. This paper is a study of the problems of scheduling to minimize the energy consumed by a system of dissimilar machines (with no restriction on the makespan). The different system types considered are for machines with identical speeds but different power ratings, and for machines with different speeds and power ratings but no idle power consumption. The results give insights for further studies classifying various types of energy-minimal scheduling problems, and for deriving algorithms for exact or approximate solutions for such problems.

IEEE Transactions on Automation Science and Engineering, 2014

With data becoming a salient asset worldwide, dependence within data kept on growing, hence the r... more With data becoming a salient asset worldwide, dependence within data kept on growing, hence the real world datasets that one works upon in today's time are highly correlated. Since the past few years, researchers have given attention to this aspect of data privacy and found that where there exists a correlation among data, the existing privacy guarantees could not be assured with existing privacy algorithms. The privacy guarantees provided by existing algorithms were enough when there existed no relation between data in the datasets. Hence, by keeping the existence of data correlation into account, there is a dire need, to reconsider the privacy algorithms. Some of the research have considered to utilize a well known machine learning concept, i.e., Data Correlation Analysis to understand the relationship between data in a better way. This has given some promising results as well. Though its less but still a considerable amount of research has been done for correlated data privac...

Given a system model where machines have distinct speeds and power ratings but are otherwise comp... more Given a system model where machines have distinct speeds and power ratings but are otherwise compatible, we consider various problems of scheduling under resource constraints on the system which place the restriction that not all machines can be run at once. These can be power, energy, or makespan constraints on the system. Given such constraints, there are problems with divisible as well as non-divisible jobs. In the setting where there is a constraint on power, we show that the problem of minimizing makespan for a set of divisible jobs is NP-hard by reduction to the knapsack problem. We then show that scheduling to minimize energy with power constraints is also NP-hard. We then consider scheduling with energy and makespan constraints with divisible jobs and show that these can be solved in polynomial time, and the problems with non-divisible jobs are NP-hard. We give exact and approximation algorithms for these problems as required.

ASIAN JOURNAL OF CONVERGENCE IN TECHNOLOGY

Phishing attacks capitalize on human errors and target the vulnerabilities formed due to it. Most... more Phishing attacks capitalize on human errors and target the vulnerabilities formed due to it. Most of the attacks are aimed at stealing private information from users, which spread via different mechanisms. There is no single solution to this problem to effectively nullify all the attacks but multiple techniques have been developed to defend against these attacks. This paper reviews the work on the detection of phishing attacks. In this paper, we aim to study the techniques which mainly detect and help in preventing phishing attacks rather than mitigating them. A general run-through of the most successful techniques for phishing attack detection has been presented here.

Sādhanā, 2021

The problem of attaining energy efficiency in distributed systems is of importance, but a general... more The problem of attaining energy efficiency in distributed systems is of importance, but a general, non-domain-specific theory of energy-minimal scheduling is far from developed. In this paper, we classify the problems of energy-minimal scheduling and present theoretical foundations of the same. We derive results concerning energy-minimal scheduling of independent jobs in a distributed system with functionally similar machines with different working and idle power ratings. The machines considered in our system can have identical as well as different speeds. If the jobs can be divided into arbitrary parts, we show that the minimum-energy schedule can be generated in linear time and give exact scheduling algorithms. For the cases where jobs are non-divisible, we prove that the scheduling problems are NP-hard and also give approximation algorithms for the same along with their bounds.

Current Science, Jan 10, 2013

Information technology (IT) equipment is already estimated to account for about 2% of the global ... more Information technology (IT) equipment is already estimated to account for about 2% of the global energy consumption, and this figure is only expected to rise. However, the use of solar power for IT has yet to receive the attention it deserves from researchers, and there is a vast array of important problems to be addressed to enable the use of solar and other alternative energy sources in IT. In this note, we take the view that a broad systems perspective of solar-power generation and utilization (rather than looking only at component technologies such as PV, solar-thermal, etc.) is essential, and mention major directions which in our opinion merit attention in this regard.

Book chapter in "Orthogonal Frequency Division Multiple Access Fundamentals and Applications." Ba... more Book chapter in "Orthogonal Frequency Division Multiple Access Fundamentals and Applications." Base Station User 1 User 2 User K Base Station User 1 User 2 User K Single Cell Downlink Communications Single Cell Uplink Communications Figure 1: Example of a single cell downlink (left) and uplink scenerio (right).

Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems - e-Energy '15, 2015

It is known that energy-minimal scheduling is strictly harder than minimal-makespan scheduling, b... more It is known that energy-minimal scheduling is strictly harder than minimal-makespan scheduling, but it is not well understood. This paper is a study of the problems of scheduling to minimize the energy consumed by a system of dissimilar machines (with no restriction on the makespan). The different system types considered are for machines with identical speeds but different power ratings, and for machines with different speeds and power ratings but no idle power consumption. The results give insights for further studies classifying various types of energy-minimal scheduling problems, and for deriving algorithms for exact or approximate solutions for such problems.