英语教师面试自我介绍
合集下载
相关主题
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
学生入学自我介绍。
Байду номын сангаас各种考试也需要使用。
编辑个人档案也需要使用。
演讲或者主持的时候
英语教师面试自我介绍
小编精心推荐阅读
自我介绍范文|自我介绍ppt |简短的自我介绍|一分钟自我介绍|英文自我介绍
General Introduction
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.
Besides, In July 2000, I got the opportunity to give a lecture in English in Asia Control Conference (ASCC) which is one of the top-level conferences among the world in the area of control and automation. In my senior year, I met Prof. Xiao-Song Lin, a visiting professor of mathematics from University of California-Riverside, I learned graph theory from him for my network research. These experiences all rapidly expanded my knowledge of English and the understanding of western culture.
I hope to study in depth
In retrospect, I find myself 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.
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.
At the period of my graduate study, my overall GPA(3.77/4.0) ranked top 5% in thedepartment. In the second semester, I became teacher assistant that is given to talented and matured students only. This year, I won the Acer Scholarship as the one and only candidate in my department, which is the ultimate accolade for distinguished students endowed by my university. Presently, I am preparing my graduation thesis and trying for the honor of Excellent Graduation Thesis.
Please give my application materials a serious consideration. Thank you very much.
延伸阅读：
自我介绍基本简述简介
自我介绍是每一个职场中人都必然要经历的一件事情，只不过，有的人一年用不上几次，而有的人则一个星期可能需要做N次。众所周知，自我介绍是日常工作中与陌生人建立关系、打开局面的一种非常重要的手段，因此，让自己通过自我介绍或得到对方的认识甚至认可，一种非常重要的职场技术。[1]
基本内容
自我介绍务必讲清下述5-6项内容：
姓名;
爱好、籍贯、学历或业务经历(应注意与公司有关);
专业知识、学术背景(应注意与岗、职有关);
优点、技能(应突出能对公司所作的贡献);
用幽默或警句概括自己的特点可加深他人的印象;
致谢。
运用场合
用于不认识的朋友间的初次见面时。
一般还用于求职的时候使用。
参加公务员考试也需要使用。
步骤目的
无非是“认识——了解——欣赏”三个步骤，但通常情况下，绝大部分的自我介绍只能达到前两个层次，很难达到第三个层次。[1]
比如在招聘面试中的自我介绍，目的是使招聘者明了求职者的三个问题：
你现在是干什么的(应该在共同点中强调不同点);
你将来准备干什么(应力求具体、合理);
你过去干过什么(应保持与将来的一致或连贯性)。
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 algorithmcan 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. Recently, I am doing research in the Composite Predict of the Electrical Power system assisted with the technology of Data Mining for Bao Steel. I try to combine the Decision Tree with Receding Optimization to provide a new solution for the Composite Predictive Problem. This project is now under construction.
Байду номын сангаас各种考试也需要使用。
编辑个人档案也需要使用。
演讲或者主持的时候
英语教师面试自我介绍
小编精心推荐阅读
自我介绍范文|自我介绍ppt |简短的自我介绍|一分钟自我介绍|英文自我介绍
General Introduction
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.
Besides, In July 2000, I got the opportunity to give a lecture in English in Asia Control Conference (ASCC) which is one of the top-level conferences among the world in the area of control and automation. In my senior year, I met Prof. Xiao-Song Lin, a visiting professor of mathematics from University of California-Riverside, I learned graph theory from him for my network research. These experiences all rapidly expanded my knowledge of English and the understanding of western culture.
I hope to study in depth
In retrospect, I find myself 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.
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.
At the period of my graduate study, my overall GPA(3.77/4.0) ranked top 5% in thedepartment. In the second semester, I became teacher assistant that is given to talented and matured students only. This year, I won the Acer Scholarship as the one and only candidate in my department, which is the ultimate accolade for distinguished students endowed by my university. Presently, I am preparing my graduation thesis and trying for the honor of Excellent Graduation Thesis.
Please give my application materials a serious consideration. Thank you very much.
延伸阅读：
自我介绍基本简述简介
自我介绍是每一个职场中人都必然要经历的一件事情，只不过，有的人一年用不上几次，而有的人则一个星期可能需要做N次。众所周知，自我介绍是日常工作中与陌生人建立关系、打开局面的一种非常重要的手段，因此，让自己通过自我介绍或得到对方的认识甚至认可，一种非常重要的职场技术。[1]
基本内容
自我介绍务必讲清下述5-6项内容：
姓名;
爱好、籍贯、学历或业务经历(应注意与公司有关);
专业知识、学术背景(应注意与岗、职有关);
优点、技能(应突出能对公司所作的贡献);
用幽默或警句概括自己的特点可加深他人的印象;
致谢。
运用场合
用于不认识的朋友间的初次见面时。
一般还用于求职的时候使用。
参加公务员考试也需要使用。
步骤目的
无非是“认识——了解——欣赏”三个步骤，但通常情况下，绝大部分的自我介绍只能达到前两个层次，很难达到第三个层次。[1]
比如在招聘面试中的自我介绍，目的是使招聘者明了求职者的三个问题：
你现在是干什么的(应该在共同点中强调不同点);
你将来准备干什么(应力求具体、合理);
你过去干过什么(应保持与将来的一致或连贯性)。
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 algorithmcan 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. Recently, I am doing research in the Composite Predict of the Electrical Power system assisted with the technology of Data Mining for Bao Steel. I try to combine the Decision Tree with Receding Optimization to provide a new solution for the Composite Predictive Problem. This project is now under construction.