午夜精品福利视频,亚洲激情专区,免费看a网站,aa毛片,亚洲色图激情小说,亚洲一级毛片,免费一级毛片一级毛片aa

求職應(yīng)聘英語(yǔ)自我介紹

時(shí)間:2024-08-23 06:48:49 資料大全 我要投稿
  • 相關(guān)推薦

求職應(yīng)聘英語(yǔ)自我介紹

    I am a third year master major in automation at Shanghai Jiao Tong University, P. R. China. With tremendous interest in Industrial Engineering, I am writing to apply for acceptance into your Ph.D. graduate program.

求職應(yīng)聘英語(yǔ)自我介紹

    Education background

    In 1995, I entered the Nanjing University of Science & Technology (NUST) -- widely considered one of the China’s best engineering schools. During the following undergraduate study, my academic records kept distinguished among the whole department. I was granted First Class Prize every semester, and my overall GPA(89.5/100) ranked No.1 among 113 students. In 1999, I got the privilege to enter the graduate program waived of the admission test. I selected the Shanghai Jiao Tong University to continue my study for its best reputation on Combinatorial Optimization and Network Scheduling where my research interest lies.

    Research experience and academic activity

    When a sophomore, I joined the Association of AI Enthusiast and began to narrow down my interest for my future research. In 1997, I participated in simulation tool development for the scheduling system in Prof. Wang’s lab. With the tool of OpenGL and Matlab, I designed a simulation program for transportation scheduling system. It is now widely used by different research groups in NUST. In 1998, I assumed and fulfilled a sewage analysis & dispose project for Nanjing sewage treatment plant. This was my first practice to convert a laboratory idea to a commercial product.

    In 1999, I joined the distinguished Professor Yu-Geng Xis research group aiming at Network flow problem solving and Heuristic algorithm research. Soon I was engaged in the FuDan Gene Database Design. My duty was to pick up the useful information among different kinds of gene matching format. Through the comparison and analysis for many heuristic algorithms, I introduced an improved evolutionary algorithm -- Multi-population Genetic Algorithm. By dividing a whole population into several sub-populations, this improved algorithm can effectively prevent GA from local convergence and promote various evolutionary orientations. It proved more efficiently than SGA in experiments, too. In the second semester, I joined the workshop-scheduling research in Shanghai Heavy Duty Tyre plant. The scheduling was designed for the rubber-making process that covered not only discrete but also continuous circumstances. To make a balance point between optimization quality and time cost, I proposed a Dynamic Layered Scheduling method based on hybrid Petri Nets. The practical application showed that the average makespan was shortened by a large scale. I also publicized two papers in core journals with this idea.

   I hope to study in depth

    In retrospect, I find my self standing on a solid basis in both theory and experience, which has prepared me for the Ph.D. program. My future research interests include: Network Scheduling Problem, Heuristic Algorithm research (especially in GA and Neural network), Supply chain network research, Hybrid system performance analysis with Petri nets and Data Mining.

    Please give my application materials a serious consideration.

    Thank you very much.

【求職應(yīng)聘英語(yǔ)自我介紹】相關(guān)文章:

英語(yǔ)自我介紹應(yīng)聘08-01

求職應(yīng)聘自我介紹范例07-24

外貿(mào)求職應(yīng)聘自我介紹范文05-25

最新應(yīng)聘面試英語(yǔ)自我介紹模板09-23

應(yīng)聘英語(yǔ)教師面試自我介紹09-24

應(yīng)聘英語(yǔ)教師自我介紹范文09-04

應(yīng)聘面試英語(yǔ)教師自我介紹08-08

應(yīng)聘面試英語(yǔ)10-01

應(yīng)聘求職面試自我介紹(通用19篇)09-15

英語(yǔ)求職自我介紹范文【經(jīng)典】10-12