Latest Announcements
August 4, 2006
The Conference pictures and movies:
Click here to
view
July 26, 2006
ICTACS'06
Final Program:
Click here to download
May 12, 2006
Accepted papers announcement:
Click here to download
May 3, 2006
Due to the large number of submitted papers, the notification of acceptance was extended to May 10th.
April 10, 2006
The deadline for submission has passed.
April 4, 2006
Besides the web submission system, authors can submit papers via email (tacs06@fit.hcmuns.edu.vn) in the case authors can not submit papers via the web system.
March 31, 2006
Due to a large number of requests for extension from authors, the deadline for submission is extended to April 7th, 2006.
|
|
Invited Speaker List:
- Prof.
Y. C.
Tay, National University
Singapore, Singapore
Title: Universal Cache Miss Equations for Autonomic Computing
- Prof.
Jay Bagga, Ball State University, USA
Title: Software Systems for Implementing Graph Algorithms for
Learning and Research
- Dr. Phong Q. Nguyen,
ENS, France
Title: New Trends in Cryptology
- Dr. Dat H.
Nguyen,
Harvard University, USA
Title: Deciphering Principles of Transcription Regulation
in Eukaryotic Genomes
Invited
Speaker 1
Universal Cache Miss Equations for Autonomic Computing
| Brief Bio: |
Y.C. Tay received his B.Sc.
degree from the University of Singapore and Ph.D. degree
from Harvard University. He is a professor in the
Departments of Mathematics and Computer Science at the
National University of Singapore.
His main research interest is performance modeling
(transaction processing, wireless access, memory management
and Internet equilibrium).
|
| Abstract: |
Computer systems in large
enterprises and in the outsourcing industry are difficult to
manage manually. This difficulty has led to a push for
autonomic computing, where the goal is to have the system
automatically configure its settings, tune its performance
and recover from failures.
Such large systems have innumerable caches to enhance
performance. One task in autonomic computing lies in sizing
these caches and sharing them out among competing workloads.
Cache miss equations can help to automate this task.
For the cache miss equations to be helpful, they must be
universal: they must fit any real memory reference pattern
and cache management policy, through parameters that can be
calibrated automatically and dynamically.
Three cache miss equations -- one each for main memory,
database buffers and processor caches -- are presented as
evidence that universality is possible. |
Invited
Speaker 2
Software
Systems for Implementing Graph Algorithms for
Learning and Research
| Brief Bio: |
Jay Bagga is Professor and
Chair of the Department of Computer Science at Ball State
University.
He has research interests and publications in the area of
graph theory and graph algorithms, computational geometry,
formal methods and model checking.
|
| Abstract: |
Graph algorithms have
several important applications in fields including computer
science, software engineering, mathematics, engineering,
business, and bioinformatics. Researchers and practitioners
in these disciplines often need to experiment with empirical
data about graphs to gain deeper insights into their
properties, which may lead to general proofs. Students also
need to learn and be able to implement graph algorithms for
their applications. However, these individuals often have
varying backgrounds and training, and they may not have a
working knowledge of programming tools to implement graph
algorithms.
The goal of our research is to create a software system
which allows a user to easily create and implement graph
algorithms through a simple graphical user interface,
without any coding. Towards this goal, we have developed
several systems that can be used to draw and manipulate
graphs as well as to execute graph algorithms. The
development of the general system raises a number of
interesting research questions that we will discuss.
To illustrate the need for experimentation with different
graph algorithms, we will present some examples of our
research in different areas of graph theory and
computational geometry. We will also present some features
of our systems that we have found useful in teaching graph
theory. |
Invited
Speaker 3
New Trends in Cryptology
| Brief Bio: |
Dr. Phong. Q. Nguyen
received his Ph.D. degree in 1999 from the University of
Paris 7, and is currently a CNRS researcher in the crypto
team of the Ecole normale superieure. He is the recipient of
the 2001 Cor Baayen award and the EUROCRYPT 2006 best paper
award. His main research interests are cryptology
(particularly cryptanalysis) and algorithmic number theory.
|
| Abstract: |
| Cryptology is the science of secret, which can be viewed nowadays as the scientific study of adversarial information protection. Can I send my credit card number securely over the Internet? Can I authentify emails? Is there such a thing as electronic cash? Those are typical questions that cryptology tries to answer.
Cryptology is now routinely used in everyday's life: for instance, mobile phones, banking cards, and game consoles all include cryptographic functionalities.
Modern cryptology started thirty years ago with the publication of a seminal article by Diffie and Hellman.
But much has changed since. In this talk, after recalling cryptology fundamentals, we will survey the most recent advances in cryptology, and outline ongoing trends.
This includes the standardization of cryptography and exciting breakthroughs in the cryptanalysis of hash functions.
No prior knowledge of cryptology will be assumed. |
Invited
Speaker 4
Deciphering Principles of Transcription Regulation in Eukaryotic
Genomes
| Brief Bio: |
| Dr. Dat H. Nguyen’s main
research focus while at Harvard University as an Alfred P.
Sloan Postdoctoral Fellow has been to develop theory and
mathematical methods for understanding the design principles
in living organisms that are encoded in their genomes.
During this time, he and his colleagues led the
international effort to establish the first peer-reviewed
and open-access online journal and the first digital
library, the Vietnamese Public Library of Knowledge
abbreviated as ViPLOK (http://www.viplok.org), for
Vietnamese students and scholars to publish and to
communicate their high-quality intellectual works to their
peers worldwide. In addition, he also serves as one of the
Directors of the VACETS (Vietnamese-American Association for
Computing, Engineering Technology, and Sciences)
organization. From 1999-2002, as an Institutional
Pre-doctoral Fellow at the Lawrence Livermore National
Laboratory, his research then was on (1) the theoretical
study of principles underlying the structure-function
relationships in biological molecules such as protein, RNA
and DNA, and (2) the development of the linear-scaling
parallel algorithm for massive parallel computations of many
frontier problems in computational physics, chemistry and
biology. Dr. Dat H. Nguyen
received a Ph.D. in theoretical chemistry, a M.S. in
computer science, and a B.S. with highest honors in
chemistry from the University of California. More about his
work can be found online at:
http://arep.med.harvard.edu/~dnguyen.
|
| Abstract: |
| Transcription regulation has
been responsible for organismal complexity and diversity in
the course of biological evolution and adaptation, and it is
determined largely by the context-dependent behavior of cis-regulatory
elements (CREs). Therefore, understanding principles
underlying CRE behavior in regulating transcription
constitutes a fundamental objective of quantitative biology,
yet these remain poorly understood. One of the major
obstacles has been the lack of a suitable mathematical
strategy for deciphering such principles at a fine level of
detail to in order to detect the intricacy of regulatory
signals encoded in the genome. In my talk, I will present
the first deterministic mathematical strategy, the motif
expression decomposition (MED) method, I developed for
deriving principles of transcription regulation at the
single-gene resolution level. MED operates on all genes in a
genome without requiring any a priori knowledge of gene
cluster membership, or manual tuning of parameters. In
addition, I will present a few classes of transcriptional
regulatory principles that CREs obey in order to regulate
gene expression we discovered when applying MED to yeast
Saccharomyces cerevisiae transcriptional regulatory
networks. Finally, I will present a few evidences showing
how nature could use these principles as an additional
dimension to amplify the combinatorial power of a small set
of CREs in regulating transcription. (1) Nguyen, D.H. and
P. D’haeseleer. 2006. Deciphering Principles of
Transcription Regulation in Eukaryotic Genomes. Nature/EMBO
Molecular Systems Biology doi:10.1038/msb4100054 (accessible
at: http://www.nature.com/msb/journal/v2/n1/full/msb4100054.html)
(2) Bussemaker, H.J. 2006. Modeling gene expression
control using Omes Law. Nature/EMBO Molecular Systems
Biology doi: 10.1038/msb4100055 (accessible online at:
http://www.nature.com/msb/journal/v2/n1/full/msb4100055.html) |
|
