FCS'07: June 27, 2007 Schedule

To select a different day CLICK HERE

6:45am - 5:00pm:  Registration (Second Floor, Conference Lobby: 1-5)


08:00a - 12:20p:  During this period, FCS attendees are encouraged to participate
                  in sessions belonging to PDPTA'07, BIOCOMP'07, SERP'07, FECS'07,
                  or IKE'07.  These sessions discuss topics that overlap the
                  scope of FCS.

12:20 - 01:20pm:  LUNCH (On Your Own)


SESSION 3-FCS:    THEORETICAL FOUNDATIONS FOR DISTRIBUTED AND CONCURRENT
                  SYSTEMS AND COMPUTATIONS
                  Chair:  Prof. Mark Burgin, University of California, Los Angeles, CA, USA)
                  June 27, 2007 (Wednesday); 01:20pm - 02:40pm
                  (LOCATION: Ballroom 8)

01:20 - 01:40pm:  Interactive Hypercomputation
                  Mark Burgin
                  University of California, Los Angeles, California, USA

01:40 - 02:00pm:  Distributed System Architecture and Specification with TLB
                  Norman R. Howes
                  Institute for Defense Analyses, Alexandria, Virginia, USA

02:00 - 02:20pm:  A Unifying Model of Concurrent Processes
                  Mark Burgin and Marc Smith
                  University of California, Los Angeles, California, USA

02:20 - 02:40pm:  A Voting Scheme for BLOB Replication
                  Preethi Vishwanath and Chris Pollett


02:40 - 03:20pm:  DISCUSSION SESSION B-FCS (Refreshments will be available)
                  June 27 (Wednesday)
                  (LOCATION: Hallways - Ballrooms 6-8)

                  O.  Data Structures for Storing Binary Numbers in DNA Computing
                      Takeshi Tateishi and Akihiro Fujiwara
                      Kyushu Institute of Technology, Japan
                  O.  The Possible Decidability of the Halting Problem
                      Jose Ulisses Ferreira
                      Brazil
                  O.  A Perfect Secret Sharing Scheme for (r-1, r)-Uniform
                      Hypergraph-Based Access Structures
                      Yi-Chun Wang and Justie Su-Tzu Juan
                      National Chi Nan University, Taiwan
                  O.  Lower Bounds on the Cardinality of Maximum Matchings in Graphs
                      with Bounded Degrees
                      Wangsen Feng
                      Peking University, Beijing, P. R. China


03:20 - 06:00pm:  During this period, FCS attendees are encouraged to participate
                  in sessions belonging to PDPTA'07, BIOCOMP'07, SERP'07, FECS'07,
                  or IKE'07.  These sessions discuss topics that overlap the
                  scope of FCS.


06:00 - 09:00pm:  FOUR TUTORIALS  (planned)

                  Factor Graphs for Advanced Algorithm Design in Wireless Communications
                  Dr. Henk Wymeersch
                  Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
                  Location: Ballroom 2

                  Data Mining in Time Series and Multimedia Databases
                  Dr. Eamonn Keogh
                  University of California - Riverside, California, USA
                  Location: Ballroom 1

                  Cryptographic Features and Applications in Java (and C++)
                  Prof. Ray Kresman
                  Bowling Green State University, USA
                  Location: Ballroom 4

                  Mobile Terminal Software Architecture - Present and Future
                  S. Vijay Anand
                  General Manager, SASKEN Communication Technologies Limited - CTO Team, India
                  Location: Ballroom 3

To select a different day CLICK HERE