千文網(wǎng)小編為你整理了多篇相關(guān)的《外企面試英語自我介紹》,但愿對你工作學習有幫助,當然你在千文網(wǎng)還可以找到更多《外企面試英語自我介紹》。
第一篇:外企面試英語自我介紹中慎用詞
去新公司面試,必定會做什么事情?有99%的面試官會先讓應聘者自我介紹一番。
“Good morning, sir. My name is…”打招呼和過場基本是必須的?! 癐’m xxx, I’m xxx, and I’m very xxx?!卑凑瘴覀兊膫鹘y(tǒng)思維,自我夸耀一番也是難以避免的。但是這真的好嗎?
如果說自我夸耀是正常的,那么就有99%的人在面試時這么做了。然而,那么多人都用一樣的措辭自夸,真的會有積極的效果?就怕非但沒有積極效果,反而讓人覺得你很浮夸,盡說大話很不可靠。而且,老外們對此更加在意,一聽到某些單詞,說不定就觸碰到“雷區(qū)”,馬上say “Good bye”了。
這里有10個單詞,不適合在面試的時候形容自己??纯茨阌袥]有如此自夸的習慣吧。
1. generous(寬宏大量的)
肚量是看在旁人眼里的,并不是喊出來的,尤其是不適合從自己的嘴巴里喊出來。真正心胸開闊的人,從不會炫耀,也不會索取別人的稱贊。他們就不認為自己的心胸氣度如此廣闊,因為他們覺得他們還能做得更多。
2. humble(謙恭的)
認為自己很謙虛的人其實并不謙虛,因為真正謙虛的人從不稱贊自己謙虛。如果你真要讓別人了解自己有多謙虛,就在言語中表現(xiàn)出自己的謙和吧,千萬不要直接就說“其實啊,我這個人很謙虛的”。你聽到別人這么說,會怎么想?
3. self-disciplined(嚴格自律的)
自律是好事,但是如果自律過了頭,會給別人什么印象?不懂變通,缺乏彈性,死腦筋,不好相處……你身邊有沒有對待自己特別嚴格的人?你覺不覺得這樣的人太硬不太好相處呢?所以別說自我要求特別嚴格了,職場不如軍隊,不需要鐵一般的紀律,這樣反而會讓人覺得你缺乏人性化的變通,也難以溝通。
4. passionate(充滿激情的)
熱情從來不是喊出來的,而是在實際工作中做出來的。說得好聽比做什么都容易,千萬別讓人覺得你只是嘴巴上特別有干勁而已。另外,熱愛工作是好事,但是太過于熱愛工作,會讓人擔心你是否會做出什么過激的舉動。而且,如果讓別人覺得你動不動就滿懷激情地工作,這樣你的同事也會很累。
5. witty(機智幽默的)
一般很機智又有幽默感的人,是不會刻意這么稱贊自己的,除非他擅長說冷笑話。想想,如果一個人對你說“你知道嗎?我是個很機智幽默的人”,你的反應一定是兩個字——呵呵。真正機智幽默的人,在談吐間就能讓別人感受到了,用得著挑明了說嗎?這反而是愚笨的自夸。
6. empathetic(善于察言觀色的)
empathy這個詞是指理解他人感受和想法的能力。但是明目張膽告訴別人你善于窺探別人的心事,則容易引起別人的反感。比如某人失戀了,想把這當作秘密藏起來,卻看到你用“看穿一切”的眼神看著他,一定會因為被你看穿而感到煩躁吧?如果你真有這方面的“超能力”,藏起來,別讓人知道,省得他人警戒你。
7. fearless(無所畏懼的)
每個人都應該學會畏懼,會害怕才是正常人該有的心態(tài)。有勇氣并非是無畏,而是明明害怕卻依然在做著該做的事情。所以不要說自己天不怕地不怕,因為這樣不正常,不知道危險才容易折戟于危險之中?;蛟S你應該換個詞,比如courageous(富有勇氣的)。
8. straightforward(直截了當?shù)?
想一想,如果別人對你說“我是個直截了當?shù)娜恕保敲茨憧赡軙胨南乱痪湓捠恰澳愕墓ぷ髡媸翘槐M責了,我深刻質(zhì)疑你的工作能力,你肯定辦不好這件事……”。我們是要說話誠實,但誠實不代表一定要傷了別人的心。如果一個人說自己很直截了當,很可能別人就會對他敬而遠之,因為他一點不客氣,甚至不講禮貌。
9. adaptable(能夠適應)
其實,這句話原本挺不錯,只是現(xiàn)在已經(jīng)淪為了陳詞濫調(diào)。萬物恒變,沒有東西保持不變,我們只有適應才能夠生存,也就是說適應能力是我們的基礎能力。不要覺得做到了自己應該做的事很了不起,實際上這本應該就是要做好的事情。就好像一位設計師去新公司應聘,然后說“我會做設計”一樣,別人反而懷疑你是不是能力不夠刻意這么說。
10. independent(獨立性強)
第二篇:外企面試自我介紹英語
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.
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 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. 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.