1 / 10

Research Meeting

Research Meeting. 2009-09-19 Jaeseok Myung. Summary. TA DB : 23 일 수업 WEC : 강의 평가 Honor Society Omega Chi Epsilon Research Conference Abstract Schedule. Survey. Omega Chi Epsilon. # of Active Chapters : 71 Total Membership: 25477 University List U. of Michigan U. of Illinois

sancho
Download Presentation

Research Meeting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Research Meeting 2009-09-19 JaeseokMyung

  2. Summary • TA • DB : 23일 수업 • WEC : 강의 평가 • Honor Society • Omega Chi Epsilon • Research • Conference • Abstract • Schedule Center for E-Business Technology

  3. Survey Center for E-Business Technology

  4. Omega Chi Epsilon • # of Active Chapters : 71 • Total Membership: 25477 • University List • U. of Michigan • U. of Illinois • U. of Texas • U. of Northwestern • Georgia Institute of Technology Center for E-Business Technology

  5. Omega Chi Epsilon • 입회 자격 • Juniors, at least 50% of their degree requirements who • have completed at least three hours of course work, and • are in the upper one-fourth of their class, or a GPA of 3.25/4.00 • Senior, at least 70% of their degree requirements who • are in the upper one-third of their class, or a GPA of 3.00/4.00 • Graduate students with a major in Chemical Engineering • at least nine semester-hours of graduate courses, and a GPA of 3.5/4.0 • 입회 제도 • There shall be at least one election meetings each year • Three-fourths of members shall constitute a quorum • The candidate must receive at least 80% of votes • $20 fee Center for E-Business Technology

  6. Omega Chi Epsilon • 특권, 의무 • 아래의 행사 진행 및 참여 (대학별로 세부 활동 다름) • Sponsor and arrange for alumni activities at homecoming • Maintain a student lounge and library/reading room • Provide career guidance to high school students • Provide tutorial services to chemical engineering students • Conduct course and faculty evaluations • Administer outstanding student and teacher awards • 특징 • AIChE (American Institute of Chemical Engineers)와 연계하여 매년 정기 미팅을 갖고,competition을 주최하고 있음 • 지원방안 • 금전적 지원보다는 정보 교환 및 네트워킹 기능에 초점을 맞춘 단체 • 세미나, 튜토리얼등을 제공 Center for E-Business Technology

  7. Omega Chi Epsilon • 기타 • Awards (1990 ~ 2005) • 3 awards in the AIChE (American Institute of Chemical Engineers) National Student Paper Competition • 4 awards in the AIChE National Student Design Competition • 대학별 차별화 • Michigan State University (Junior Competitive Exam) • Georgia Institute of Technology (Internship Program) • University of Illinois at Urbana-Champaign (Score) • 대부분 비슷한 활동을 하고 있으며 차이점이 거의 없음 Center for E-Business Technology

  8. Conference • APWeb 2010 • Submission : Oct 19th, 7 pages • DataSEM 2010 • 1st International Workshop on Data Semantics • Co-located with the EDBT/ICDT 2010 Joint Conference • Submission : Oct 15th, 12 pages • DESWeb 2010 • 1st International Workshop on Data Engineering meets the Semantic Web in conjunction with ICDE 2010 • Submission : Nov 15th, 6 pages Center for E-Business Technology

  9. SPARQL Basic Graph Pattern Processing with Iterative MapReduce • Abstract • In this paper, we propose an iterative MapReduce(MR) algorithm for SPARQL Basic Graph Pattern (BGP). Generally, a BGP may have a lot of self-join in itself, but because of MR’s shared-nothing architecture, it is difficult to process such join operations with MR framework. In other words, an expensive MR iteration is needed for getting a shared join key between two graph patterns. For this reason, we suggest an algorithm which reduces the number of MR iteration, and we examine the algorithm with the Lehigh University Benchmark(LUBM). Our experiments are based on physically separated RDF storage and parallel data processing framework, and the result shows that the algorithm provides scalable access to large RDF data. Center for E-Business Technology

  10. Schedule Center for E-Business Technology

More Related