.:: 回首頁 | 陽明交通大學 | 意見回饋 | 網站地圖 | 手機板 | English  ::.
國立陽明交通大學 回陽明交通大學 回本系應數首頁
最新消息 系所介紹 師資人員 學術研究 招生入學 修業規章 學生專區 系友會 FAQ

  • 招生與徵聘
  • 系所公告
  • 獎勵與補助
  • 工讀與就業
  • 學生活動
  • 其他消息

  • 演講公告月份查詢
  • 論文研討
  • 演講
  • 研討會

    • 微積分教學小組
    • 相關學術網站
    • 校內相關單位
    • 陽明交通大學
    • 意見回饋

演講公告

新聞標題: ( 2015-03-04 )

  • 演講主題:Learning Hidden Graphs

  • 主講人:傅恆霖 教授(交通大學 應用數學系)

  • 演講日期:2015年3月10日(星期二) 下午2:00 –3:00

  • 演講地點:(光復校區) 科學一館223室

  • 茶會時間:當天下午1:30 (科學一館205室)

  • 摘要內容:

    This talk is devoted to introducing a topic of group testing and its applications on computational molecular biology. The topic we study is complex group testing. Complex group testing has an equivalent formulation in graph theory: Given a graph (or a hypergraph) G = (V, E) where the vertices would represent the items and edges would represent the complexes, the main task is to identify all edges by edge detecting queries of the form “Q(S): does S induce at least one edge of G?” Here, S is a subset of V. For convenience, we let V = [n] = {1, 2, 3, …, n}. A query on a subset S of [n] can be represented by Q(S) = 1 means the outcome is yes and Q(s) = 0 otherwise.

    In has been studied by several authors where the size of each complex is restricted to be 2. It is less known where the size of complexes are of size larger than 2. In this talk, we shall first introduce the motivation of learning a hidden graph and then report our results on the case where the complexes are larger than 2. Mainly, adaptive algorithms of group testing are utilized in our works.

返回go back





  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •    
  • English Version|
  • 意見回饋|
  • Go Top
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         
  •         

本網站著作權屬於國立陽明交通大學 應用數學系  © 2023

地址: 300 新竹市大學路1001號 科學一館2樓

系辦電話 (03)5722088 傳真 (03) 5724679 電子郵件:lcchang@math.nctu.edu.tw

本系網站資訊開放宣告

本系個人資料保護暨資訊安全宣言

最後更新:2018-03-1 05:31:24 PM (CST)