Professional Documents
Culture Documents
Ankit Resume
Ankit Resume
Ankit Resume
2. Korea Advanced Institute of Science & Technology, South Korea July 2018 – Oct. 2018
Project Title: Developing a classification model for cross-country skiing techniques to train amateur skiers
• Framed the problem as a multivariate time-series sequence classification task using signals from wearable sensors
• Performed signal processing on MATLAB; developed a CNN-LSTM model on Python – Keras & Tensorflow
• ↑ accuracy by 12% (79%→91%) and ↓ the no. of sensors for data collection from 21→5; new state of the art
A unified deep-learning model for classifying cross-country skiing techniques using wearable gyroscope sensors, Sensors 2018
Authors: Ankit, A; Jang, J.; Kim, J.; Jang, Y.J.; Kim, H.Y.; Kim, J.H.; Xiong, S, Citations Count: 14
3. National Tsing Hua University, Taiwan May 2018 – June 2018
Project Title: Improving the efficiency of supply-chains (SC) by identifying suboptimal stages & decreasing quality cost
• Designed economic model of variables single-state sampling plans with rectifying inspection for multistage SCs
• Derived cumulative distribution function of Cpmk index; solved constrained non-linear optimization on MATLAB
• ↓ quality cost & sample size by 7.8%; ↓ confidence interval size for μprocess by 25% w.r.t previous state of the art
Economic design of variables acceptance sampling plan with rectifying inspection based on advanced capability index
Authors: Ankit, A.; Song, W.T.; Manuscript under review in Intl. Journal of production Research
PROJECTS
1. Sparsification of neural networks for deployment on computationally weak systems
• Pruned k% weights and neurons of hidden layers based on L1 and L2 norms of weights; retrained the sparse network
• Results before retraining: [Sparsity, test-time speedup, loss in accuracy] = [50%, 2.40x, 6.86%]
• Results after retraining: [Sparsity, test-time speedup, loss in accuracy] = [90%, 7.06x, 1.94%]
2. Supply Chain (SC) network planning for a glass manufacturer with/without plant upgrade
• Defined the optimization problem as an integer programming problem; solved using Pulp library in Python
• Suggested 3 solutions against the baseline (current SC): new warehouses (WH), new plants (P), new P+WH
• ↑ service (defined as proximity to WH) from 11% (current)à80% (P+WH); with ↑ profit: 27%, ↓ trans. cost: 40%
PROGRAMMING
Languages: Python [Keras, Tensorflow, Matplotlib, Seaborn, Pandas, Numpy], MATLAB, C++ [basic], LaTeX
Big Data Tools, DBMS: Apache Spark, Apache Hadoop, SQL