应届毕业生面试英文自我介绍
资源预览文档简介为自动调取,内容显示的完整度及准确度或有误差,请您下载后查看完整的文档内容。
应届毕业生面试英文自我介绍 <br />generalintroduction*i'amathirdyearmaster,全国文秘工作者的!majorinautomationatshanghaijiaotonguniversity,p.r.china.withtremendousinterestinindustrialengineering,i'amwritingtoalyforacceptanceintoyourph.d.graduateprogram.educationbackgroundin1995,ienteredthenanjinguniversityofscience&amtechnology(nust)--widelycoideredoneofthechina'sbestengineeringschools.duringthefollowingundergraduatestudy,myacademicrecordskeptdistinguishedamongthewholedepartment.iwasgrantedfirstclaprizeeverysemester,andmyoverallgpa(89.5/100)rankedno.1among113students.in1999,igottheprivilegetoenterthegraduateprogramwaivedoftheadmiiontest.iselectedtheshanghaijiaotonguniversitytocontinuemystudyforitsbestreputationoncombinatorialoptimizationandnetworkschedulingwheremyresearchinterestlies.attheperiodofmygraduatestudy,myoverallgpa(3.77/4.0)rankedtop5inthedepartment.inthesecondsemester,ibecameteacheraistantthatisgiventotalentedandmaturedstudentsonly.thisyear,iwontheacerscholarshipastheoneandonlycandidateinmydepartment,whichistheultimateaccoladefordistinguishedstudentsendowedbymyuniversity.presently,i'ampreparingmygraduationthesisandtryingforthehonorofexcellentgraduationthesis.researchexperienceandacademicactivitywhenasophomore,ijoinedtheaociationofaienthusiastandbegantonarrowdownmyinterestformyfutureresearch.in1997,iparticipatedinsimulationtooldevelopmentfortheschedulingsysteminprof.wang'slab.withthetoolofopenglandmatlab,idesignedasimulationprogramfortraortationschedulingsystem.itisnowwidelyusedbydifferentresearchgrouinnust.in1998,iaumedandfulfilledasewageanalysis&amdioseprojectfornanjingsewagetreatmentplant.thiswasmyfirstpracticetoconvertalaboratoryideatoacommercialproduct.in1999,ijoinedthedistinguishedprofeoryu-gengxisresearchgroupaimingatnetworkflowproblemsolvingandheuristicalgorithmresearch.sooniwasengagedinthefudangenedatabasedesign.mydutywastopickuptheusefulinformationamongdifferentkindsofgenematchingformat.throughthecomparisonandanalysisformanyheuristicalgorithms,iintroducedan <br />improvedevolutionaryalgorithm--multi-populationgeneticalgorithm.bydividingawholepopulationintoseveralsub-populatio,thisimprovedalgorithmcaneffectivelypreventgafromlocalconvergenceandpromotevariousevolutionary,全国文秘工作者的!orientatio.itprovedmoreefficientlythansgainexperiments,too.inthesecondsemester,ijoinedtheworkshop-schedulingresearchinshanghaiheavydutytyreplant.theschedulingwasdesignedfortheruer-makingprocethatcoverednotonlydiscretebutalsocontinuouscircumstances.tomakeabalancepointbetweenoptimizationqualityandtimecost,iproposedadynamiclayeredschedulingmethodbasedonhybridpetrinets.thepracticalalicationshowedthattheaveragemakeanwasshortenedbyalargescale.ialsopublicizedtwopapersincorejournalswiththisidea.recently,i'amdoingresearchinthecompositepredictoftheelectricalpowersystemaistedwiththetechnologyofdataminingforbaosteel.itrytocombinethedecisiontreewithrecedingoptimizationtoprovideanewsolutionforthecompositepredictiveproblem.thisprojectisnowundercotruction.besides,injuly2000,igottheoortunitytogivealectureinenglishinasiacontrolconference(ascc)whichisoneofthetop-levelconferencesamongtheworldintheareaofcontrolandautomation.inmysenioryear,imetprof.xiao-songlin,avisitingprofeorofmathematicsfromuniversityofcalifornia-riverside,ilearnedgraphtheoryfromhimformynetworkresearch.theseexperiencesallrapidlyexpandedmyknowledgeofenglishandtheunderstandingofwesternculture.ihopetostudyindepthinretroect,ifindmyselfstandingonasolidbasisinboththeoryandexperience,whichhaspreparedmefortheph.d.program.myfutureresearchinterestsinclude:networkschedulingproblem,heuristicalgorithmresearch(eeciallyingaandneuralnetwork),sulychainnetworkresearch,hybridsystemperformanceanalysiswithpetrinetsanddatamining.pleasegivemyalicationmaterialsaseriouscoideration.thankyouverymuch. <br />
版权提示
- 温馨提示:
- 1.
部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
- 2.
本文档由用户上传,版权归属用户,莲山负责整理代发布。如果您对本文档版权有争议请及时联系客服。
- 3.
下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
- 4.
下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服vx:lianshan857处理。客服热线:13123380146(工作日9:00-18:00)