Well, let's start by-- Plato starts by telling us, reminding us of what it is to remember something.

让我们从这里开始,柏拉图首先告诉我们,提醒我们什么是记起一件事情

耶鲁公开课 - 死亡课程节选

However, there are several points that need to be remembered.

但是，这里需要提醒大家几点。

选美大会，很不错 - SpeakingMax英语口语达人

All right,I've got to remind you though, none of the options here are all that attractive.

好了，我必须提醒各位，这里的所有可能性都不具吸引力。

耶鲁公开课 - 死亡课程节选

The question of providential justice is of course of primary significance to Milton's poem, but Hartman goes on to say that the moon, which reminds us of a calm and perfect sense of Providence, also works to guarantee the principal of free will.

这里，关于天佑的公平的问题,是其对于弥尔顿的诗最基本的重要性，但是哈特曼接着又说月亮是，这提醒了我们天意的冷静和完美感，月亮在这儿也是为了保障自由意志的原则。

耶鲁公开课 - 弥尔顿课程节选

And as a reminder, hopefully I don't need to remind any of you, but exam 1 is on Wednesday, so rather than our clicker question being on something from last class, which is exam 2 material, let's just make sure everyone remembers some small topic from exam 1 material, which is the idea of angular nodes.

而作为一个提醒--我希望大家都不需要提醒，但是这周三就要进行第一次考试了，因此我们的这个选择题,不是关于上节课内容的，那是第二次考试的内容，这里只是想确认大家都记得,第一次考试所要求的一些小问题，也就是关于角向节点的概念。

麻省理工公开课 - 化学原理课程节选

But just go to cs50.net, click office hours and you'll see the Google Calendar with all of the office hours that are still happening tonight, as well as tomorrow and these are just an opportunity to chat, to ask questions one on one with the teaching fellows or course assistants or frankly just a way to hang out during brain break and work on projects and then see what some of your friends might be tackling themselves.

但是我要提醒大家去cs50，net网站看看,这里清清楚楚告诉你,什么时候该学习工作，当然也包括今晚的明天的，我们还有一个机会供，一个与研究生助教或课程辅导员交流的机会,更直白来说,是提供你们开小差的机会,看看你们周围哪些人,在开小差呢。

哈佛公开课 - 计算机科学课程节选

And that's just a way of reminding you that we want to think carefully, but what are the things we're trying to measure when we talk about complexity here? It's both the size of the thing and how often are we going to use it? And there are some trade offs, but I still haven't said how I'm going to get an n log n sorting algorithm, and that's what I want to do today.

这只是在提醒你们我们要仔细的思考问题,但是当我们在讨论复杂性的时候,我们到底要衡量哪些东西？,是列表的大小和对其进行查找的频率吗？,这里面临一些取舍,但是我还没有说明,怎样得到一个n，log，n复杂度的排序算法,并且这是我今天想要讲的内容。

麻省理工公开课 - 计算机科学及编程导论课程节选