Telephone interview with Youyou Tu

"Good News for the National Holiday!"

Telephone interview with Youyou Tu following the announcement of the 2015 Nobel Prize in Physiology or Medicine, 5 October 2015. The interviewer is Adam Smith, Chief Scientific Officer of Nobel Media. Professor Tu speaks in Chinese during the interview and the English questions and Professor Tu‘s answers are translated by Jin Li from the China Academy of Chinese Medical Sciences.

[Jin Li] Hello.

[Adam Smith] This is Adam Smith, calling from Nobelprize.org, the official website of the Nobel Prize, in Stockholm.

[JL] Yes, this is Professor Tu Youyou‘s home.

[AS} So first of all, may we ask what is Professor Tu‘s reaction to the award of the Nobel Prize?

[JL for Youyou Tu] Yes, Professor Tu Youyou is very glad to own the Nobel Prize.

[AS] Thank you very much. And what does the award of the Nobel Prize mean for her and for Chinese science?

[JL for TY] I‘m very glad that the new anti-malaria drug artemisinin earns international recognition from the Nobel Prize committee.

Also, I want to show my gratitude and respect to Nobel Committee, Karolinska Institute and Sweden people.

Yes, Chinese people wish to win Nobel Prize for long time, and this time artemisinin win this Prize. Shows that our work to research anti-malaria drugs is at a high level and achieve good result.

So at the moment when we begin to research anti-malaria drug this old drug had already got drug resistance. As a result we worked very hard to find anti-malaria drug artemisinin and to save millions of lives. It shows that as a scientific worker we need innovation spirit to find new things.

[AS] It‘s a great pleasure to speak to you and to Professor Tu, thank you very much. May we convey our…

[JL for TY] Yes, thanks, yes.

[AS] We would like to convey our congratulations and also say we are very much looking forward to welcoming her to Stockholm in December.

[JL for TY] Yes, thanks a lot.

[AS] Thank you. One last question, it‘s late evening there in Beijing. Will Professor Tu have time to celebrate tonight?

[JL for TY] I have many friends to come home to share my happiness. Even for Chinese people is also a good thing, a good news for the national holiday. Thanks a lot.

[AS] Yes, it‘s perfect timing, yes. Thank you very much. OK, well, Xie Xie, thank you.

[JL for TY] Thank you. Thank you very much.

[AS] Thank you, bye bye.

Link:http://www.nobelprize.org/nobel_prizes/medicine/laureates/2015/tu-interview.html

时间: 2024-10-04 22:58:38

Telephone interview with Youyou Tu的相关文章

Shanghai InfoSys .NET engineer telephone interview

Collect the answers,interested friends from research. 1,Interface and Abstract difference? 2,Generic type' s 'where' keyword? 3,What's the kind of wcf binding 4,What's reflection? 5,Design pattern(Singleton,Factory)? 6,Delegate and Event difference?

2018.1.27 扇贝新闻精选(5/10)

Health Officials: More Birth Defects in US Areas With Zika 卫生部负责人(表示):在美国地区出现更多与寨卡病毒相关的先天缺陷 (2016年1月16日,在巴西累西腓的 Fiocruz 基金会,一只携带寨卡病毒的埃及伊蚊通过显微镜被拍摄) CHICAGO - 芝加哥(来讯)-- ★ Health Officials:看到词典上的解释是"卫生官员"或者"健康官员",确实有这一说法,结合下文提到的美国疾病控制与预防中

poj 3662 Telephone Lines dijkstra+二分搜索

Telephone Lines Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5696   Accepted: 2071 Description Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of

[BZOJ] 1614: [Usaco2007 Jan]Telephone Lines架设电话线

1614: [Usaco2007 Jan]Telephone Lines架设电话线 Time Limit: 5 Sec  Memory Limit: 64 MBSubmit: 1806  Solved: 773[Submit][Status][Discuss] Description Farmer John打算将电话线引到自己的农场,但电信公司并不打算为他提供免费服务.于是,FJ必须为此向电信公司支付一定的费用. FJ的农场周围分布着N(1 <= N <= 1,000)根按1..N顺次编号的废

《Cracking the Coding Interview》——第16章:线程与锁——题目5

2014-04-27 20:16 题目:假设一个类Foo有三个公有的成员方法first().second().third().请用锁的方法来控制调用行为,使得他们的执行循序总是遵从first.second.third的顺序. 解法:你应该想到了用lock的方法类阻塞,不过这里面有个概念问题使得直接用ReentrantLock不能通过编译(对于一个锁对象,不同在A线程中锁定,又在B线程中解锁,不允许这样的归属关系),可以用Semaphore来达到相同的目的.请看下面的代码. 代码: 1 // 16

《Cracking the Coding Interview》——第16章:线程与锁——题目3

2014-04-27 19:26 题目:哲学家吃饭问题,死锁问题经典模型(专门用来黑哲学家的?). 解法:死锁四条件:1. 资源互斥.2. 请求保持.3. 非抢占.4. 循环等待.所以,某砖家拿起一只筷子后如果发现没有另一只了,就必须把手里这只筷子放下,这应该是通过破坏"请求保持"原则来防止死锁产生,请求资源失败时,连自己的资源也进一步释放,然后在下一轮里继续请求,直到成功执行. 代码: 1 // This is the class for chopsticks. 2 import j

《Cracking the Coding Interview》——第16章:线程与锁——题目2

2014-04-27 19:14 题目:如何测量上下文切换的时间? 解法:首先,上下文切换是什么,一搜就知道.对于这么一个极短的时间,要测量的话,可以通过放大N倍的方法.比如:有A和B两件事,并且经常一起发生,每件只需要花几纳秒.如果你把A事件连续做几百万次,而B时间只做了几次,这样就能排除B事件对于测量的影响.如果总时间S = mA + nB.当m >> n 时,A≈S / m.下面的测量方法类似于打乒乓球,在主线程和副线程间互相传递一个令牌,这个令牌可以是变量.管道之类的用于通信的工具.与

《Cracking the Coding Interview》——第16章:线程与锁——题目1

2014-04-27 19:09 题目:线程和进程有什么区别? 解法:理论题,操作系统教材上应该有很详细的解释.我回忆了一下,写了如下几点. 代码: 1 // 16.1 What is the difference between process and thread? 2 Answer: 3 Process: 4 1. Basic element of resource allocation in the operating system. 5 2. Possesses independent

Popular HashMap and ConcurrentHashMap Interview Questions

http://howtodoinjava.com/core-java/collections/popular-hashmap-and-concurrenthashmap-interview-questions/ Popular HashMap and ConcurrentHashMap Interview Questions June 14, 2013 by Lokesh Gupta In my previous post related to “How HashMap works in jav