• Worked extensively to generate listings, graphs and tables for clinical data.
• Generated tables, listings and graphs according to Protocol and Statistical Analysis Plan (SAP) using PROC MEANS, FREQ, TRANSPOSE, REPORT, TABULATE, and GCHART, GPLOT.
• Created SAS Customized Reports using the Data _Null_.
• Worked on TFLs on clinical study reports.
• SAS/STAT procedures such as UNIVARIATE, FREQ, and MEANS were used to carry out analyses and the SAS REPORT procedure is generally used to display results.
• Used SAS ODS to produce HTML, PDF and XML format files.
• Environment: SAS/BASE, SAS/SQL, SAS/GRAPH, SAS/STAT, SAS/MACRO.

Sales project

BIRT project is a big project includes a company which has various branches and they sell different products to many customers and keep data of all the customers employees and the order status, payment status, product details. So what we have to do in that project is to combine few tables and using different base SAS functions to infer the results.

• Data preparation and validation: sorting and merging techniques are used for the input datasets, to get the required output and then writing the code using SAS tools to do edit checks.
• Performed statistical analysis and data management on study data by utilizing appropriate statistical methods using SAS and SAS tools like SAS/Base, SAS/Macros and SAS/Graph and SAS/SQL
• Extensively worked in SAS/report writing environment to produce summary reports using SAS/ODS to create HTML, RTF, PDF reports, create report using SAS/BASE data sets procedures like proc report, proc print, Data _Null_.
• Used SAS ODS for generating reports in specific output formats like rtf, PDF, html etc…
• Carried out all activities according to SOPs and worked within the framework of the Quality Management System and adhered to Good Clinical Practices (GCPs).
• Environment: BASE SAS, SAS/JCL, SAS/GRAPH, SAS/SQL, MS Excel, MS Access, and Windows XP.

Details about Academic Research work:

Classical trajectories are stationary solutions of the action. The stochastic difference equation in length (SDEL) algorithm is an approximate method to obtain these trajectories based on the optimization of the first variation of the action. Using a graph representation of coordinate space, we have developed a new kind of shortest path algorithm to obtain optimal SDEL trajectories for which the path length computation not only depends on the current node but also on the node already traversed. The new algorithm is based on a redefinition of the graph in which the edges represent connections between 3 configurations of the system. We use Dijkstra's algorithm to compute the shortest trajectory between nodes in the redefined graph. The first numerical evaluations of the algorithm have been done using the 2D Muller and three-hole potentials. Shortest trajectories have been computed varying the total energy, number of conformations, and graph connectivity.