Deepak Kumar

Dr. Deepak Kumar


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2018 in International Journal of Biological Macromolecules
Verified
Journal Article
Closed access
AKAditya Kumar
Aditya Kumar
DKDeepak Kumar
Deepak Kumar
NGNancy George
Nancy George
PSPrince Sharma
Prince Sharma
NGNaveen Gupta
Naveen Gupta

14 October 2021 in Environmental Science and Pollution Research
Verified
Journal Article
Closed access
PDF file
DKDeepak Kumar
Deepak Kumar
RBRaveena Bhardwaj
Raveena Bhardwaj
SJSunena Jassal
Sunena Jassal
TGTanya Goyal
Tanya Goyal
AKAastha Khullar
Aastha Khullar
NGNaveen Gupta
Naveen Gupta

1 March 2018 in International Journal of Biological Macromolecules
Verified
Journal Article
Closed access
ADAditi David
Aditi David
PCPrakram Singh Chauhan
Prakram Singh Chauhan
AKAditya Kumar
Aditya Kumar
SASteffy Angural
Steffy Angural
DKDeepak Kumar
Deepak Kumar
NGNaveen Gupta
Naveen Gupta

14 March 2018 in 3 Biotech
Verified
Journal Article
Closed access
PDF file
DKDeepak Kumar
Deepak Kumar
AKAditya Kumar
Aditya Kumar
SSSonica Sondhi
Sonica Sondhi
PSPrince Sharma
Prince Sharma
NGNaveen Gupta
Naveen Gupta

1 January 2021 in Heliyon
Verified
Journal Article
Open access
SASteffy Angural
Steffy Angural
IBIndu Bala
Indu Bala
AKAditya Kumar
Aditya Kumar
DKDeepak Kumar
Deepak Kumar
SJSunena Jassal
Sunena Jassal
NGNaveen Gupta
Naveen Gupta
The Application of a combination of enzymes is the best alternative to reduce the use of chemicals in the paper industry. Bacillus sp. NG-27 and Bacillus nealsonii PN-11 are known to produce thermoalkali stable xylanse (X) and mannanase (M) respectively having potential for pulp biobleaching. The Present study, reports the production of a mixture of X + M by co-culturing of strains in SSF and standardizing its application for pulp biobleaching. Production of enzymes by co-cultivation in SSF was optimized by statistical methods. Substantial increase in the yield of enzymes; 3.61 fold of xylanase and 37.71 fold of mannanase was achieved. Application of enzyme cocktail for pulp biobleaching resulted in a 45.64% reduction of kappa number with 55 IU g−1odp of enzyme dose (xylanase:mannanase; 3:1) at pH 8.0 in 1h at 65 °C along with significant increase in brightness (11%) and whiteness (75%). The Same quality of paper as made up from chemical treated pulp can be made from enzyme-treated pulp with 30% less use of chlorine. Structural analysis of enzyme-treated pulp showed dissolution of hemicellulose as indicated by pores, cracks and increased roughness all over the surface. Cocktail of X + M produced economically in a single fermentation having all the requisite characteristics for pulp biobleaching is a highly suitable candidate for application in the pulp and paper industry.

1 May 2018
Verified
Conference Paper
Closed access
RTRavi Tandon
Ravi Tandon
MAMaryam Abdul-Wahid
Maryam Abdul-Wahid
FAFiras Almoualem
Firas Almoualem
DKDeepak Kumar
Deepak Kumar
Private information retrieval (PIR) allows a user to retrieve a desired message out of K possible messages from N databases without revealing the identity of the desired message. There has been significant recent progress on understanding fundamental information-theoretic limits of PIR, and in particular the download cost of PIR for several variations. Majority of existing works however, assume the presence of replicated databases, each storing all the K messages. In this work, we consider the problem of PIR from storage constrained databases. Each database has a storage capacity of μKL bits, where K is the number of messages, L is the size of each message in bits, and μ ∈ [1/N, 1] is the normalized storage. In the storage constrained PIR problem, there are two key design questions: a) how to store content across each database under storage constraints; and b) construction of schemes that allow efficient PIR through storage constrained databases. The main contribution of this work is a general achievable scheme for PIR from storage constrained databases for any value of storage. In particular, for any (N, K), with normalized storage μ = t/N, where the parameter t can take integer values t ∈ {1, 2, ..., N}, we show that our proposed PIR scheme achieves a download cost of (1 + 1/t + 1/2 + ⋯ + 1/t K-1 ). The extreme case when μ = 1 (i.e., t = N) corresponds to the setting of replicated databases with full storage. For this extremal setting, our scheme recovers the information-theoretically optimal download cost characterized by Sun and Jafar as (1 + 1/N + ⋯ +1/N K-1 ). For the other extreme, when μ = 1/N (i.e., t = 1), the proposed scheme achieves a download cost of K. The most interesting aspect of the result is that for intermediate values of storage, i.e., 1/N <; μ <; 1, the proposed scheme can strictly outperform memory-sharing between extreme values of storage.