1,533 Hits in 1.5 sec

System has failed us including the intellectuals

Vitull K. Gupta, Meghna Gupta, Varun Gupta
2017 Indian Heart Journal  
doi:10.1016/j.ihj.2017.05.018 pmid:28822533 pmcid:PMC5560906 fatcat:5jqdwzbegnh3pascycjv5a2qmy

Recent Development Of Four Wheel Steering System

2017 Zenodo  
In city life, the driving circumstances of the vehicle with higher Wheelbase and track breadth face problems of turning as space is captive, the same problem is faced in low speed to gain control over Four wheel steering is a method developed in the automobile industry for the effective turning of the vehicle and to increase the flexibility. For a vehicle, working on all wheel drive (AWD) it is necessary to achieve adjustability. This calls for a continuous need and demand of a car to attain
more » ... xibility. With this attribute, handling and operating at the minimum speed achieved is till 6.2 mph. The main aim is to come up with effective steering response resulting increase in vehicle adjustability while manoeuvring at high speed and to decrease turning radius at low speed with keeping up as less weight as possible of the vehicle.
doi:10.5281/zenodo.1453762 fatcat:rd4ei6ckh5hwfip72hck3hww2a

A Typical Presentation of Crystal Arthritis (Gout)

Varun Gupta, Prabhjot Gupta
2018 Journal of Arthritis  
Gout is a type of crystal arthritis afflicting middle age group. However, the onset is earlier in men (40-50) than women (60+). There is an abnormality of uric acid metabolism which results in hyperuricaemia and deposition of monosodium urate crystals in the affected joint. The onset of the gout can be acute, chronic or asymptomatic. Figure 1: Clinical picture showing swelling and redness of left great toe. A 45 years old female presented in an outpatient clinic with one week history of mild
more » ... n over left great toe involving 1st Metatarsophalangeal joint ( MTP) of left foot. The pain was gradual in onset but since one day, pain has suddenly increased to severe intensity with moderate swelling and redness of great toe. The patient denied any trauma or similar history in the past. Figure 2: AP and oblique view of left foot showing gross destruction of 1 st MTP joint. However, patient's past medical history significant for type 2 diabetes mellitus and renal stones for which she was managed with Oral hypoglycaemics and Narcotics with Diuretic medications. On examination, she was febrile (38.2°C) and left great toe was swollen, warm and tender to touch. J o u r n a l of Ar th r i t is
doi:10.4172/2167-7921.1000i108 fatcat:te6jy7ywwza7jikqwxpz2ku454

Constrained High Dimensional Statistical Inference [article]

Ming Yu, Varun Gupta, Mladen Kolar
2019 arXiv   pre-print
In typical high dimensional statistical inference problems, confidence intervals and hypothesis tests are performed for a low dimensional subset of model parameters under the assumption that the parameters of interest are unconstrained. However, in many problems, there are natural constraints on model parameters and one is interested in whether the parameters are on the boundary of the constraint or not. e.g. non-negativity constraints for transmission rates in network diffusion. In this paper,
more » ... we provide algorithms to solve this problem of hypothesis testing in high-dimensional statistical models under constrained parameter space. We show that following our testing procedure we are able to get asymptotic designed Type I error under the null. Numerical experiments demonstrate that our algorithm has greater power than the standard algorithms where the constraints are ignored. We demonstrate the effectiveness of our algorithms on two real datasets where we have intrinsic constraint on the parameters.
arXiv:1911.07319v1 fatcat:j7z75tz5urf3tlzcqzwx4whgj4

Develop Indian guidelines and revolutionize the heath care system

Vitull K. Gupta, Meghna Gupta, Varun Gupta
2015 Indian Heart Journal  
doi:10.1016/j.ihj.2015.08.015 pmid:26702707 pmcid:PMC4699966 fatcat:4meqkzxwxffkjnw6cnpdyxdyne

Online Stochastic Bin Packing [article]

Varun Gupta, Ana Radovanovic
2012 arXiv   pre-print
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of one-dimensional online stochastic bin packing. Items with sizes i.i.d. from an unknown distribution with integral support arrive as a stream and must be packed on arrival in bins of size B, also an integer. The size of an item is known when it arrives and the goal is to minimize the waste, defined to be the total unused space in non-empty bins. While there are many heuristics for
more » ... stochastic bin packing, all such heuristics are either optimal for only certain classes of item size distributions, or rely on learning the distribution. The state-of-the-art Sum of Squares heuristic (Csirik et al.) obtains sublinear (in number of items seen) waste for distributions where the expected waste for the optimal offline algorithm is sublinear, but has a constant factor larger waste for distributions with linear waste under OPT. Csirik et al. solved this problem by learning the distribution and solving an LP to inject phantom jobs in the arrival stream. We present two distribution-agnostic bin packing heuristics that achieve additive O(sqrtn) waste compared to OPT for all distributions. Our algorithms are gradient descent on suitably defined Lagrangian relaxations of the bin packing Linear Program. The first algorithm is very similar to the SS algorithm, but conceptually packs the bins top-down instead of bottom-up. This motivates our second heuristic that uses a different Lagrangian relaxation to pack bins bottom-up. Next, we consider the more general problem of online stochastic bin packing with item departures where the time requirement of an item is only revealed when the item departs. Our algorithms extend as is to the case of item departures. We also briefly revisit the Best Fit heuristic which has not been studied in the scenario of item departures yet.
arXiv:1211.2687v1 fatcat:btsitxzqundt7nwzbxdj77avyq

Stability of the bipartite matching model [article]

Ana Bušić, Varun Gupta, Jean Mairesse
2010 arXiv   pre-print
We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and servers play symmetrical roles. There is a finite set C resp. S, of customer, resp. server, classes. Time is discrete and at each time step, one customer and one server arrive in the system according to a joint probability measure on CxS, independently of the past. Also, at each time step, pairs of matched customer and server, if they exist,
more » ... t from the system. Authorized matchings are given by a fixed bipartite graph. A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete time Markov chain. We study its stability under various admissible matching policies including: ML (Match the Longest), MS (Match the Shortest), FIFO (match the oldest), priorities. There exist natural necessary conditions for stability (independent of the matching policy) defining the maximal possible stability region. For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite graph. For the MS and priority policies, we exhibit a bipartite graph with a non-maximal stability region.
arXiv:1003.3477v1 fatcat:slg257iz4zd4th3w5jmoopezvq

Adaptive Machine Unlearning [article]

Varun Gupta, Christopher Jung, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, Chris Waites
2021 arXiv   pre-print
Data deletion algorithms aim to remove the influence of deleted data points from trained models at a cheaper computational cost than fully retraining those models. However, for sequences of deletions, most prior work in the non-convex setting gives valid guarantees only for sequences that are chosen independently of the models that are published. If people choose to delete their data as a function of the published models (because they don't like what the models reveal about them, for example),
more » ... hen the update sequence is adaptive. In this paper, we give a general reduction from deletion guarantees against adaptive sequences to deletion guarantees against non-adaptive sequences, using differential privacy and its connection to max information. Combined with ideas from prior work which give guarantees for non-adaptive deletion sequences, this leads to extremely flexible algorithms able to handle arbitrary model classes and training methodologies, giving strong provable deletion guarantees for adaptive deletion sequences. We show in theory how prior work for non-convex models fails against adaptive deletion sequences, and use this intuition to design a practical attack against the SISA algorithm of Bourtoule et al. [2021] on CIFAR-10, MNIST, Fashion-MNIST.
arXiv:2106.04378v1 fatcat:lgiq7qk2kvgonln3ktpafnlrx4

Object-Oriented Cognitive-Spatial Complexity Measures

Varun Gupta, Jitender Kumar Chhabra
2009 Zenodo  
Thus, the type of control structure in which Varun Gupta is with the Directorate/Information Technology, PSEB, Patiala, India (phone: 91-175-2201433; e-mail: varun3dec@  ...  of different measures as given in Object-Oriented Cognitive-Spatial ComplexityMeasures International Science Index, Computer and Information Engineering Vol:3, No:3, 2009 Varun  ...  Varun Gupta  ... 
doi:10.5281/zenodo.1072346 fatcat:ptfuwwt3znebhlhjuud5s3tia4

Crude Oil Price Prediction Using Lstm Networks

Varun Gupta, Ankit Pandey
2018 Zenodo  
Results with 10 lookback, 100 epochs and 3 LSTM layersFig. 12 Results with 10 lookback, 50epochs and 4 LSTM layers The various results obtained from experimentation with the proposed network are shown in Varun  ...  Gupta is with the Chandigarh College of Engineering and Technology (Degree Wing), Sector 26, Chandigarh 160019 India (corresponding author, phone: 91-9646047091; e-mail: varun3dec@  ... 
doi:10.5281/zenodo.1316680 fatcat:cxux3tpqs5cfle5f3ewpp7iady

A Decentralized Framework for Managing Task Allocation in Distributed Software Engineering

Chetna Gupta, Varun Gupta
2021 Applied Sciences  
In distributed software development, planning and managing fair and transparent task allocation is both critical and challenging. The objective of this paper is to propose a decentralized blockchain-oriented, transparent task allocation framework to improve the quality of the task allocation process. It addresses the concerns of (i) enhancing collaboration, (ii) inhibiting knowledge vaporization, and (iii) reducing documentation problems. The proposed method is a novel two-fold process: First,
more » ... t identifies and categorizes tasks exhibiting different dependencies and complexities to create equal task clusters based on their dependency type, difficulty, cost, and time. Second, it uses a blockchain-oriented framework to broadcast, check bid validity, allow developers to bid on tasks matching their roles and expertise, evaluate, and announce the winner for task allocation using smart contracts. Results of experimentation, surveys, and interviews with software practitioners conclude that the proposed solution is transparent and effective in allocating tasks (with Cranach's alpha of 0.894) at a low cost of contract execution in a distributed software development environment. Overall, the proposed approach will have a positive and significant impact in industrial settings.
doi:10.3390/app112210633 fatcat:jorb6bd3w5ecbebxvxhcdgaa5i

Approximation Schemes for Multiperiod Binary Knapsack Problems [article]

Zuguang Gao, John R. Birge, Varun Gupta
2021 arXiv   pre-print
An instance of the multiperiod binary knapsack problem (MPBKP) is given by a horizon length T, a non-decreasing vector of knapsack sizes (c_1, ..., c_T) where c_t denotes the cumulative size for periods 1,...,t, and a list of n items. Each item is a triple (r, q, d) where r denotes the reward of the item, q its size, and d its time index (or, deadline). The goal is to choose, for each deadline t, which items to include to maximize the total reward, subject to the constraints that for all
more » ... ,T, the total size of selected items with deadlines at most t does not exceed the cumulative capacity of the knapsack up to time t. We also consider the multiperiod binary knapsack problem with soft capacity constraints (MPBKP-S) where the capacity constraints are allowed to be violated by paying a penalty that is linear in the violation. The goal is to maximize the total profit, i.e., the total reward of selected items less the total penalty. Finally, we consider the multiperiod binary knapsack problem with soft stochastic capacity constraints (MPBKP-SS), where the non-decreasing vector of knapsack sizes (c_1, ..., c_T) follow some arbitrary joint distribution but we are given access to the profit as an oracle, and we choose a subset of items to maximize the total expected profit, i.e., the total reward less the total expected penalty. For MPBKP, we exhibit a fully polynomial-time approximation scheme with runtime 𝒪̃(min{n+T^3.25/ϵ^2.25,n+T^2/ϵ^3,nT/ϵ^2,n^2/ϵ}) that achieves (1+ϵ) approximation; for MPBKP-S, the (1+ϵ) approximation can be achieved in 𝒪(nlog n/ϵ·min{T/ϵ,n}); for MPBKP-SS, a greedy algorithm is a 2-approximation when items have the same size.
arXiv:2104.00034v1 fatcat:ya2xqpspaneorddh25hlti32zi

Portal Vein Thrombosis with Tropical Splenomegaly-A Rare Coincidental Finding

Nalini Bansal Gupta, Manav Wadhawan, Varun Gupta
2018 Journal of Liver  
Citation: Gupta NB, Wadhawan M, Gupta V (2018) Portal Vein Thrombosis with Tropical Splenomegaly-A Rare Coincidental Finding. J Liver 7:  ... 
doi:10.4172/2167-0889.1000225 fatcat:ap36iyjrgrajrmkvwmfk6vdo6m

Finding the optimal quantum size

Varun Gupta
2008 Performance Evaluation Review  
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharing (PS) policy is an idealization of the quantum-based round-robin scheduling in the limit where the quantum size becomes infinitesimal, and has been the subject of many papers. It is well known that the mean response time in an M/G/1/P S queue depends on the job size distribution via only its mean. However, almost no
more » ... plicit results are available for the round-robin policy. For example, how does the variability of job sizes affect the mean response time in an M/G/1/RR queue? How does one choose the optimal quantum size in the presence of switching overheads? In this paper we present some preliminary answers to these fundamental questions.
doi:10.1145/1453175.1453198 fatcat:jquj4oa4rrgmlg444swu3gwedm

Importance of Multicast Virtual Private Networks based on RFC 2547

Varun P Saxena, Varun Gupta, Ajay Goel, O.P. Sahu
2010 International Journal of Computer Applications  
The Multi-protocol Label Switching is one of the proposed technologies useful for traffic engineering in the specific aspects of measurement and control of Internet traffic and virtual Private network (VPN) is a concept that significant on the future of business communication, it replace existing private network with flexible architecture that is easily manage and at a same time it provide enhanced service.
doi:10.5120/756-984 fatcat:i3a55z5psnb3hb3lw4r6ywrl4q
« Previous Showing results 1 — 15 out of 1,533 results