oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 27 )

2018 ( 20 )

2017 ( 33 )

2016 ( 34 )

Custom range...

Search Results: 1 - 10 of 8519 matches for " Manoj Gupta "
All listed articles are free for downloading (OA Articles)
Page 1 /8519
Display every page Item
Changing Wisdom of Metallic Alloys Development  [PDF]
Manoj Gupta
Materials Sciences and Applications (MSA) , 2018, DOI: 10.4236/msa.2018.913074
Abstract: Metallic alloys have been instrumental through the ages in shaping the progress of human civilization. The development of the alloys from ancient to present time initiated from accidents to through the use of well-defined scientific principles. This article provides a snapshot of the alloys development from ancient to present time and the likely future direction.
Cryptographic Schemes Based on Elliptic Curves over the Ring Zp[i]  [PDF]
Manoj Kumar, Pratik Gupta
Applied Mathematics (AM) , 2016, DOI: 10.4236/am.2016.73027
Abstract: Elliptic Curve Cryptography recently gained a lot of attention in industry. The principal attraction of ECC compared to RSA is that it offers equal security for a smaller key size. The present paper includes the study of two elliptic curve \"\" and \"\" defined over the ring \"\" where \"\". After showing isomorphism between \"\" and \"\" , we define a composition operation (in the form of a mapping) on their union set. Then we have discussed our proposed cryptographic schemes based on the elliptic curve \"\". We also illustrate the coding of points over E, secret key exchange and encryption/decryption methods based on above said elliptic curve. Since our proposed schemes are based on elliptic curve of the particular type, therefore the proposed schemes provides a highest strength-per-bit of any cryptosystem known today with smaller key size resulting in faster computations, lower power assumption and memory. Another advantage is that authentication protocols based on ECC are secure enough even if a small key size is used.
LINEAR AND NON-LINEAR CAMERA CALIBRATION TECHNIQUES
Manoj Gupta
Journal of Global Research in Computer Science , 2011,
Abstract: This Paper deals with calibrate a camera to find out the intrinsic and extrinsic camera parameters which are necessary to recover the depth estimation of an object in stereovision system. Keywords: Camera Calibration, Tsai’s algorithm, Stereovision, Linear Calibration, Non-Linear Calibration, Depth estimation
Simple and Faster algorithm for Reachability in a Decremental Directed Graph
Manoj Gupta
Computer Science , 2015,
Abstract: Consider the problem of maintaining source sink reachability($st$-Reachability), single source reachability(SSR) and strongly connected component(SCC) in an edge decremental directed graph. In particular, we design a randomized algorithm that maintains with high probability: 1) $st$-Reachability in $\tilde{O}(mn^{4/5})$ total update time. 2) $st$-Reachability in a total update time of $\tilde{O}(n^{8/3})$ in a dense graph. 3) SSR in a total update time of $\tilde{O}(m n^{9/10})$. 4) SCC in a total update time of $\tilde{O}(m n^{9/10})$. For all the above problems, we improve upon the previous best algorithm (by Henzinger et. al. (STOC 2014)). Our main focus is maintaining $st$-Reachability in an edge decremental directed graph (other problems can be reduced to $st$-Reachability). The classical algorithm of Even and Shiloach (JACM 81) solved this problem in $O(1)$ query time and $O(mn)$ total update time. Recently, Henzinger, Krinninger and Nanongkai (STOC 2014) designed a randomized algorithm which achieves an update time of $\tilde{O}(m n^{0.98})$ and broke the long-standing $O(mn)$ bound of Even and Shiloach. However, they designed four algorithms $A_i (1\le i \le 4)$ such that for graphs having total number of edges between $m_i$ and $m_{i+1}$ ($m_{i+1} > m_i$), $A_i$ outperforms other three algorithms. That is, one of the four algorithms may be faster for a particular density range of edges, but it may be too slow asymptotically for the other ranges. Our main contribution is that we design a {\it single} algorithm which works for all types of graphs. Not only is our algorithm faster, it is much simpler than the algorithm designed by Henzinger et.al. (STOC 2014).
The Use of Trans-Esophageal Electrophysiology Study to Identify a High Risk Asymptomatic Wolff Parkinson White Syndrome Patient  [PDF]
Manoj Gupta, Walter Hoyt, Christopher S. Snyder
Open Journal of Pediatrics (OJPed) , 2014, DOI: 10.4236/ojped.2014.43030
Abstract: Patients with a Wolff-Parkinson-White (WPW) pattern on their ECG can experience symptoms such as syncope, palpitations, supraventricular tachycardia, and atrial fibrillation, or they can be asymptomatic (aWPW). All patients with WPW, regardless of the presence or absence of symptoms, are at risk of sudden death. Therefore, it is recommended that younger patients with WPW undergo studies to determine their risk. We report a previously asymptomatic WPW patient identified as high risk for sudden death due to rapid conduction down her accessory pathway during atrial fibrillation induced during a trans-esophageal electrophysiology study.
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
Manoj Gupta,Ankit Sharma
Computer Science , 2009,
Abstract: In this paper, we have developed a fully-dynamic algorithm for maintaining cardinality of maximum-matching in a tree using the construction of top-trees. The time complexities are as follows: 1. Initialization Time: $O(n(log(n)))$ to build the Top-tree. 2. Update Time: $O(log(n))$ 3. Query Time: O(1) to query the cardinality of maximum-matching and $O(log(n))$ to find if a particular edge is matched.
On Dynamic Optimality for Binary Search Trees
Navin Goyal,Manoj Gupta
Computer Science , 2011,
Abstract: Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem. A simple offline BST algorithm GreedyFuture was proposed independently by Lucas and Munro, and they conjectured it to be O(1)-competitive. Recently, Demaine et al. gave a geometric view of the BST problem. This view allowed them to give an online algorithm GreedyArb with the same cost as GreedyFuture. However, no o(n)-competitive ratio was known for GreedyArb. In this paper we make progress towards proving O(1)-competitive ratio for GreedyArb by showing that it is O(\log n)-competitive.
Fully Dynamic $(1+ε)$-Approximate Matchings
Manoj Gupta,Richard Peng
Computer Science , 2013,
Abstract: We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is a data structure that maintains a $(1+\epsilon)$ approximation of maximum matching under edge insertions/deletions in worst case $O(\sqrt{m}\epsilon^{-2})$ time per update. This improves the 3/2 approximation given in [Neiman,Solomon,STOC 2013] which runs in similar time. The result is based on two ideas. The first is to re-run a static algorithm after a chosen number of updates to ensure approximation guarantees. The second is to judiciously trim the graph to a smaller equivalent one whenever possible. We also study extensions of our approach to the weighted setting, and combine it with known frameworks to obtain arbitrary approximation ratios. For a constant $\epsilon$ and for graphs with edge weights between 1 and N, we design an algorithm that maintains an $(1+\epsilon)$-approximate maximum weighted matching in $O(\sqrt{m} \log N)$ time per update. The only previous result for maintaining weighted matchings on dynamic graphs has an approximation ratio of 4.9108, and was shown in [Anand,Baswana,Gupta,Sen, FSTTCS 2012, arXiv 2012].
Correlation of Fine Needle Aspiration Cytology with Histopathology in the Diagnosis of Solitary Thyroid Nodule
Manoj Gupta,Savita Gupta,Ved Bhushan Gupta
Journal of Thyroid Research , 2010, DOI: 10.4061/2010/379051
Abstract: Background. Fine needle aspiration cytology is considered the gold standard diagnostic test for the diagnosis of thyroid nodules. Fine needle aspiration cytology is a cost effective procedure that provides specific diagnosis rapidly with minimal complications. Based on the cytology findings, patients can be followed in cases of benign diagnosis and subjected to surgery in cases of malignant diagnosis thereby decreasing the rate of unnecessary surgery. Purpose of the present study was to correlate the fine needle aspiration cytology findings with histopathology of excised specimens. Material and Methods. This was a prospective study conducted on 75 consecutive patients between January 2003 and December 2005. All patients with clinically diagnosed solitary thyroid nodule who were clinically and biochemically euthyroid were included for study. Patients with multinodular goitre and who were hypothyroid or hyperthyroid were excluded from the study. Results. The sensitivity, specificity, accuracy, false positive rate, false negative rate, positive predictive value, and negative predictive value of FNAC for the diagnosis of neoplastic solitary thyroid nodules were 80%, 86.6%, 13.3%, 20%, 80%, and 86.6%, respectively. Commonest malignancy detected was papillary carcinoma in 12 patients. Conclusions. Fine needle aspiration cytology is a simple, easy to perform, cost effective, and easily repeated procedure for the diagnosis of thyroid cancer. It is recommended as the first line investigation for the diagnosis of solitary thyroid nodule. 1. Introduction Solitary thyroid nodule is defined clinically as the localised thyroid enlargement with apparently normal rest of the gland. Solitary thyroid nodule is a common entity. Majority of these nodules are benign. The main goal of evaluating these nodules is to identify nodules with malignant potential. A multitude of diagnostic tests like ultrasound, thyroid nuclear scan, and fine needle aspiration cytology (FNAC) is available to the clinician for evaluation of thyroid nodule. FNAC is considered the gold standard diagnostic test in the evaluation of a thyroid nodule, and other tests like ultrasound and nuclear scan should be used in conjunction with FNAC. FNAC is simple, cost effective, readily repeated, and quick to perform procedure in the outpatient department with excellent patient compliance. Important factor for the satisfactory test includes representative specimen from the nodule and an experienced cytologist to interpret findings. It is often used as the initial screening test for diagnosis of thyroid nodules
Carbon Nanotube Addition to Simultaneously Enhance Strength and Ductility of Hybrid AZ31/AA5083 Alloy  [PDF]
Muralidharan Paramsothy, Manoj Gupta, Jimmy Chan, Richard Kwok
Materials Sciences and Applications (MSA) , 2011, DOI: 10.4236/msa.2011.21004
Abstract: AZ31/AA5083 hybrid alloy nanocomposite containing CNT nanoparticle reinforcement was fabricated using solidification processing followed by hot extrusion. The AZ31/AA5083 hybrid alloy nanocomposite exhibited similar grain size to monolithic AZ31/AA5083 hybrid alloy, reasonable CNT nanoparticle distribution, non-dominant (0 0 0 2) texture in the longitudinal direction, and 20% higher hardness than monolithic AZ31/AA5083 hybrid alloy. Compared to monolithic AZ31/AA5083 hybrid alloy (in tension), the AZ31/AA5083 hybrid alloy nanocomposite exhibited higher 0.2% TYS, UTS, failure strain and work of fracture (WOF) (+ 9%, + 4%, + 38% and + 44%, respectively). Also, compared to monolithic AZ31/AA5083 hybrid alloy (in compression), the AZ31/AA5083 hybrid alloy nanocomposite exhibited similar 0.2% CYS (+ 1%), and higher UCS, failure strain and WOF (+ 7%, + 23% and + 23%, respectively). The effect of CNT nanoparticle addition on the enhanced tensile and compressive response of AZ31/AA5083 hybrid alloy is investigated in this paper.
Page 1 /8519
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.