高考自我介紹範文

高考自我介紹範文 篇1

尊敬的評審老師,大家好!我是來自東京汴梁的呂品。18歲的我熱愛生活,樂觀向上,我喜歡在球場上揮汗如雨,更喜歡和朋友們一起聽音樂,看電視,看電影。和很多同齡人一樣,我十分喜愛綜藝類節目,喜歡節目裡主持人的幽默詼諧,佩服他們調動現場氣氛的能力,成為一名優秀的傳媒工作者是我的夢想,源於這些喜好,今天我來到各位考官面前。我堅信,有志者事竟成,希望老師們可以給我一個實現夢想的機會。我是號考生呂品。謝謝!

高考自我介紹範文 篇3

尊敬的評審老師,你們好!我叫黃聖迪。聖賢的聖啟迪的迪,爸爸媽媽希望我將來可以出人頭地,闖出一片屬於自己的天地。我從小熱愛文學,在文學的旅途中領悟浩瀚文化的精髓,我也熱愛音樂,在音樂的殿堂里聆聽紛擾背後的靈魂之深。漸漸的,我愛上電影,在它的身上我能看到文學與音樂的升華,感受影片中喜怒哀樂,人情冷暖。在夢想的旅途中,我願如家鄉的黃河之水,向傳媒這片廣闊的海洋釋放自己全部力量。

“熱情”是家鄉賦予我們的特質,帶著這份熱情,我選擇了我熱愛的傳媒專業,去追求自己的夢想。各位評審老師,請給我一個完成夢想的機會,相信我能走得更遠。我是號考生黃聖迪,謝謝!

高考自我介紹範文 篇4

我的名字叫。這個名字對於別人可能很普通。對我來說卻有特殊的意義。正所謂望子成龍望女成鳳,這個名字里不僅蘊含著父母之間的感情,還包含著他們在我身上寄予的成功的希望。

我是一個性格多元化的女生。我既有戲文需要的沉穩,也有導演需要的活潑。生活中我是一個踏實上進的人。我的愛好很廣泛,在我腦海中的知識庫就好像一個雜貨鋪,什麼都懂點,但並不是所有的都了解得很透徹。

每當看到中國電影在國際影展中大放光彩時,我都深深的感受到正是有幕後工作人員的默默付出,精心策劃,才成就了台前明星們的光彩,因此我懷著對前輩的敬重選擇了編導專業,希望通過自己的努力能為中國傳媒的發展出一把力.同時也為自己將來規劃一條走向成功的道路。

我想,做任何事情都要看自己是想成功,還是一定要成功,做什麼事情自己是盡力了,還是拚命了,我覺得,任何事情都要相信自己能做好,是最好的最棒的,那么,我又向成功邁進了一步.

今天,我有幸得到這個機會站在這裡,這是我自己一直以來的願望,我希望到貴校繼續深造,為我的夢想增加一個台階,為我的成功邁進重要的一步。

謝謝各位老師。

高考自我介紹範文 篇5

各位老師好,我叫李薇,今年18歲,一個像向日葵一樣的陽光女孩,來自鄭州,我曾為時光匆匆流逝而遺憾,曾為生命如此短暫而感傷,曾為花草樹木的調殘而惆悵,曾為生活的堅信而彷徨,當情海思緒積壓我心頭的時候,我想尋找一葉扁舟,在大海上遊蕩,讓思緒盡情的釋放。於是我愛上了能傾訴心聲的播音主持,它精彩而不張揚,它充實而不煩瑣,它神聖美麗而不驕傲媚俗,它帶給我無盡的快樂和自信,讓我更堅定的去選擇它。

愛生活,愛播音,這就是我,一個愛唱愛跳愛笑愛鬧而又多愁善感的女孩,希望陽光下的蓓蕾能在這裡開放,在電波的搖籃里茁壯成長!請記住我,號考生李薇!謝謝!

高考自我介紹範文 篇6

hello, i'd like to introduce myself, my name is Liujie,19 years old and come from Peiling Chongqing. in my spare time, i like reading some books, singing songs with friends and also like doing some sports, such as running, swimming. now i am very interest in English and hope i can continue in the colleague, and my favorate colleague is university, and i really hope my dream would come true and i would be one memerber of it.

it is really my honour to have such opportunity to have such interview, and i am so glad to meet all of you, thanks!

高考自我介紹範文 篇7

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. 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 the department. 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. 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 piding 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. 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. Besides, In July 20xx, 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. Please give my application materials a serious consideration. Thank you very much.