当前位置：文档之家 › Thesis “Declarative Networking Extensible Networks with Declarative Queries”

Thesis “Declarative Networking Extensible Networks with Declarative Queries”

  • 格式：pdf
  • 大小：18.86 KB
  • 文档页数：4

Boon Thau Loo 421 Soda Hall University of California, Berkeley Berkeley, CA 94720 boonloo@eecs.berkeley.edu http://www.cs.berkeley.edu/~boonloo Cell: (510) 295-5272 Office: (510) 642-1863

Research Interests Distributed data management systems, Internet-scale query processing, and the application of database technologies to various aspects of networked systems.

Teaching Interests Databases, distributed systems and networking courses at both the undergraduate and graduate levels.

Education Aug 2001 – present University of California at Berkeley Ph.D. candidate in Computer Science. Advisors: Joseph M. Hellerstein, Ion Stoica Expected graduation date: Aug 2006 Thesis: “Declarative Networking: Extensible Networks with Declarative Queries”

Aug 2002 – Dec 2002 MIT Visiting student in the EECS Dept

Sept 1999 – Sept 2000 Stanford University M.S. in Computer Science, specialized in Databases

Aug 1996 – May 1999 University of California at Berkeley B.S. in Electrical Engineering and Computer Science (Highest honors)

Experience Jan 2005 - present UC Berkeley, P2 Project (graduate student researcher)

Lead graduate student of the P2 project on declarative networking. Designed and implemented declarative routing and declarative overlays using P2. Investigated declarative query language design, query semantics and query optimizations in P2. This project forms the core of my dissertation research.

May 2005 – Aug 2005 Intel Research Berkeley (summer intern)

Implemented and evaluated a declarative version of Chord in P2. Led the redesign efforts of P2’s language and query planner.

Aug 2001 – Dec 2004 UC Berkeley, PIER project (graduate student researcher)

Member of the PIER project on Internet-scale query processing over structured overlays. Performed analytical and empirical studies of P2P search infrastructures for web and file-sharing workloads. Designed and implemented a hybrid search infrastructure that uses structured overlay techniques to search for rare items, and flood-based techniques for handling popular items. Designed and implemented distributed crawlers using PIER. Several ideas developed in the PIER project laid the foundations of P2 and declarative networking. Aug 2002 – Dec 2002 MIT (visiting student)

Collaborated with members of the Chord project group on P2P web search and indexing.

Jun 2002 – Aug 2002 Intel Research Seattle (summer intern)

Designed and implemented Flashback, a middleware layer that provides power-aware data replication for mobile devices.

Jun 2000 – Sept 2000 VMware Inc (summer intern)

Designed and implemented a new feature to VMware that allows virtual disks to grow beyond 2GB regardless of file system limitations.

Mar 2000 – Aug 2000 Stanford University, TRAPP project (masters student)

Worked on the TRAPP project, which investigated tradeoffs between precision and performance in replicated data environments.

Jun 1999 – Sept 1999 IBM Almaden Research Center, Storage Systems group (summer intern)

Analyzed techniques for reorganizing the layout of data on disks to maximize I/O throughput.

Jun 1998 – Aug 1998 IBM Almaden Research Center, Storage Systems group (summer intern)

Analyzed logging and recovery algorithms in a log-structured file system.

Feb 1998 – May 1998 UC Berkeley, Titanium project (undergraduate researcher)

Developed parallel programs to benchmark Titanium, a parallel dialect of Java.

Teaching Experience • University of California at Berkeley o Graduate Student Instructor for CS186 in Spring 2003 (Database Systems). o Teaching ratings based on HKN course survey by students: 4.7/5.0

Publications • Implementing Declarative Overlays. Boon Thau Loo, Tyson Condie, Joseph M. Hellerstein, Petros Maniatis, Timothy Roscoe, Ion Stoica. 20th ACM Symposium on Operating Systems Principles (SOSP), October 2005. • Declarative Routing: Extensible Routing with Declarative Queries. Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, Raghu Ramakrishnan. ACM SIGCOMM Conference on Data Communication, Aug 2005. • The Architecture of PIER: an Internet-Scale Query Processor. Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, Scott Shenker, Ion Stoica, Aydan R. Yumerefendi. 2nd Biennial Conference on Innovative Data Systems Research (CIDR), Jan 2005. • Customizable Routing with Declarative Queries. Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica. 3rd Workshop on Hot Topics in Networks (ACM SIGCOMM HotNets-III), Nov 2004. • Enhancing P2P File-Sharing with an Internet-Scale Query Processor. Boon Thau Loo, Joseph M. Hellerstein, Ryan Huebsch, Scott Shenker, Ion Stoica. 30th International Conference on Very Large Databases (VLDB), Sep 2004. • The Case for a Hybrid P2P Search Infrastructure. Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M. Hellerstein. 3rd International Workshop on Peer-to-Peer Systems (IPTPS), Feb 2004. • Querying the Internet with PIER. Ryan Huebsch, Joseph M. Hellerstein, Nick Lanham, Boon Thau Loo, Scott Shenker, Ion Stoica. 29th International Conference on Very Large Databases (VLDB), Sept 2003.

合集下载

Ad—Hoc网络中广播技术的可扩展性分析

Ad—Hoc网络中广播技术的可扩展性分析

销。
的节点不需要维持及 时准 确的路 由信 息 ， 需要转 发数 据时才 查找路 由， 路由开销小 ， 据传送 时延较 大， 适合 实时性 但数 不
需要 。大多数 操作 使用 的是 ｆ ｏｉｇ方 式或 １坚 持广播 方 ｌ ｄｎ ｏ ． 式， 就是传感器每个 节点把 自己接 受到的数 据包发送 给它的 所有 邻居节点 ， 这个 过 程一 直重 复直 到该分 组 到达 ｓ ｋ节 ｉ ｎ 点或该分组的生命 （ｖＬ， 感器网络中定义为最大跳数 ） １ｒ 传 到 期 。虽然 Ｒ Ｅ Ｒ Ｏ数据包的暴力 ｆ ｏ ｉ 方 式已保证 了 １０ ｌ ｄｎ ｏ ｇ ０％ 的可 到达率（ 网络 中所 有节 点接受 到数据包 ） 和最 大的路 由 自适应性 （ 发现所有 可能 的路 由）但 也产生 了所 谓 的“ 播 ， 广
维普资讯
山西 电子 技 术 ２０ ０ ７年 第 １期
网络 时 空
ＡｄＨｏ — ｃ网络 中广播 技 术 的 可扩展 性 分析
孙艳峰 徐永安
（ 苏扬 州 大 学信 息工程 学 院 ， 苏 扬 州 ２ ５ ０ ） 江 江 ２０ ９
摘 要 ： ｄＨ ｅ无 线 网络 中 ， 过 ｌ跳 邻 点 的周 期 性 更 新 或 使 用反 应 式路 由协 议 来 发 现 路 由 。尽 管 反 应 式路 Ａ —ｏ 通 ，
先应式路 由协议 … 需要周期性广播路 由信息 ， １ 虽保持 了及 时 准确 的路 由信 息 ， 但路 由开销过大 。运行反应式路 由协议心 Ｊ
比率来决定是否转播 。文献 ［］ ， 出了根 据邻 点数 目 自 ４中 提 适应 阈值 调 整 的方 法 ， 果 表 明 ， 助 于 全 球 定 位 系 统 结 借
ｂｓｄ 和基础位 置方 法 （ ｃｔ ｎｂｓｄ 。这 些 方 法 中 ， ａｅ） １ ａｉ ．ａｅ ） ｏ ｏ 接受 点分别 比较预定义的 阈值与接受到的相 同数据包的数 目、 接 受点与源点之间的距离 的大小 和覆盖未 被广播 过的地 区的
同济大学网络系统团队在ACM SIGCOMM’2022发表研究成果

同济大学网络系统团队在ACM SIGCOMM’2022发表研究成果

972022年第6期南开大学刘哲理教授数据安全团队论文被ＵＳＥＮＩＸ　ＳＥＣＵＲＩＴＹ信息安全会议录用同济大学网络系统团队在ＡＣＭ　ＳＩＧＣＯＭＭ’２０２２发表研究成果第31届国际信息安全会议USENIX SECURITY 将于2022年8月在美国波士顿举行，南开大学网络空间安全学院刘哲理教授带领的数据安全团队的论文“Birds of a Feather Flock Together: How Set Bias Helps to Deanonymize You via Revealed Intersection Sizes”被会议全文录用。

论文由刘哲理教授指导，博士生郭晓杰和硕士生韩叶合作完成。

安全多方计算是现代密码学的重要研究领域之一，该技术能够保证计算参与方协同计算一个既定函数，同时不泄露各参与方的数据隐私信息。

其中，针对集合交集的隐私统计技术由于业界广泛的需求而引起了关注与应用，这类技术协议允许计算参与方在其数据集合的交集上联合进行数据统计。

论文揭示了两方私有集合交集大小的隐私统计协议，在实际场景下进行应用时的隐私泄露情况。

通过模拟攻击者的视角，首次提出了两种针对此类协议的攻击方式，显示攻击者如何利用所获得的交集大小来推断参与协议运算的隐私集合中的交集成员身份，从而造成隐私数据中的身份信息泄露。

文章选取现实场景中的3个典型应用，使用所提出的攻击方案，针对真实数据集进行攻击实验模拟评估，指出了相关的信息泄露可能对现实实践造成的负面影响的程度，并提出了针对参与方攻击的可能防御措施。

近年来，南开大学数据安全团队聚焦隐私计算方向，在信息安全类期刊和会议连续发表论文。

2020年，团队研究成果“隐私保护的多平台联合广告推荐业务”在腾讯、京东、快手等公司的广告推荐业务中应用，入选中国首届十大典型数据安全实践案例，是唯一的高校入选案例。

同年，研究成果“大数据融合管理及隐私保护关键技术与应用”获得天津市科技进步二等奖。

写作步骤——精选推荐

写作步骤——精选推荐

写作步骤The Steps in Writing a CompositionClass: Grade Two, English MajorsTeaching Contents: The steps in writing a compositionTeaching Method: Explanation and PracticeTeaching Aims and DemandsTeach students write their compositions according to these correct steps. The Important Points:a. The steps in writing a compositionb. Types of outlinesc. How to write an outlineThe Difficult Points:(1) The steps in writing a composition(2) How to write an outlineI. Introductory RemarksIn this part, we will deal with three major points. First, the steps in writing a composition. There are seven steps altogether. Second, types of outlines. We will introduce two types of outlines, the topic outline and the sentence outline. Third, we will learn some rule of writing an outline.II. The steps in writing a compositionQuestion: In your idea, how many steps in writing a composition?There are seven steps:1. Decide on a topicFixing the topic is the first step for a composition. Only on the basis of a topic can a thesis be worked out, and only with a good thesis can you organize your ideas properly. However, when you decide your own topics, try to avoid settling down on broad subjects, such as 'The 21st Century', 'ChildhoodExperiences'. You should go on to probe into them until you come up with more limited and consequently more workable topics.2. Formulate a thesisThesis, we can also say theme or controlling idea. The thesis of a composition is its main point or its central idea. A thesis should be a single declarative sentence. A good thesis should be clear and specific. It must show clearly what you want to tell your readers.3. Collect materials or detailsAfter the thesis comes the third step of collecting details. You should think out as many relevant details as possible to support the thesis.4. Write an outlineArrange your materials in a logic order, and write an outline. Outline can help you arrange your materials logically.5. Write the first draftWrite the first draft, there should be enough space between lines for future corrections and improvements. When you write, you should care about your details and avoid to leave out.6. Revise the first draftRevise the first draft. Check and revision are always necessary. First, compare your draft with the outline and see if you have clearly illustrated what you have intended to write. Second, check the draft to see if thesentences are coherent with one another. Third, see if you have used some wrong or improper words and try to correct them. Fourth, make sure you havef ollowed the rules explained in “Manuscript Form”.7. Make the final copyMake the final copy. Make sure your final copy is clear, neat and tidy. It can help you give your readers a good expression about your passage.III. Types of OutlinesThere are two types of outlines: the topic outline (主题提纲)and the sentence outline (句⼦提纲). The topic outline consists of nouns, gerund phrases and infinitive phrases. It's brief and clear. The topic outline is the instant overview of the whole composition. The sentence outline consists of complete sentences It's a more detailed plan.IV.How to write an outline?Just now we have discussed the types of outlines. But how to write anoutline? Pay attention to the following rules:1. Make sure the thesis is a complete sentence in the affirmative. Don't use aquestion, a phrase or a dependent clause.2. Use parallel structures for the headings of the same rank. Make sure theheadings of like rank are of equal importance.3. Avoid single subdivisions. If there a major point marked 'I', there must beat least another marked 'II'; if there is an 'A', there must be a 'B'.4. Avoid mixing types. A topic outline is written in noun phrases, and asentence outline in sentence. Don't mix these two types.For example:Benefits of Sports and GamesThesis: Sports and games are beneficial to everybody in many aspects.I. Introduction: The importance of sports and gamesII. Benefits to body healthA. Make us strongB. Especially help mental workers exercise their bodies.III. Benefits to life varietyA. Make one versatileB. Enrich one's lifeIV. Benefits to character-trainingA. Enhance courage and enthusiasmB. Train collective spiritV. Conclusion: Everyone should be engaged in sports and games.V. HomeworkWrite an outline with title 'My Good Father'. A topic outline or a sentence outline are both ok. Pay attention to their features and the rules we have learned.。

集美大学思科网络技术上级实验题目及答案翻译

集美大学思科网络技术上级实验题目及答案翻译

实验1：第一章测试1 Which of the following are functions of a web browser without the addition of plug-ins? [Choose three.]（cde）下列哪项是一个没有插件的web浏览器的功能？解释：连接、接触服务器，请求、接受信息a. displays Quicktime movies 显示Quicktime电影b. displays flash animation 显示flash动画c. requests information .请求信息d. contacts web servers 接触web服务器e. receives information 接收信息f. updates IRQ…s更新IRQ的2 Why were TCP/IP protocols developed?（a）为什么TCP / IP协议开发?a. To allow cooperating computers to share resources across a network 允许合作的计算机通过网络共享资源b. To insure that error correction of each packet takes place. 对每个数据包发生的误差修正。

c. To allocate resources that are needed for operating a computer on a LAN. 在局域网内分配那些需要操作的电脑的资源d. To determine the "best path" decision making when forwarding packets of data.确定“最佳路径”转发数据包时的决策3 In an 8 bit binary number, what is the total number of combinations of the eight bits?（b）在一个8位二进制数,八个比特的组合的总数吗? 解释：0(0000 0000) - 255(1111 1111)a. 255b. 256c. 512d. 128e. 254f. 10244 Which statements best describe a physical connection? [Choose two.]哪个陈述最好的形容物理连接。