2007 Graduate Catalog and 2006 Annual R & D Report - Sirindhorn ...

2007 Graduate Catalog and 2006 Annual R & D Report
Sirindhorn International Institute of Technology (SIIT)
Research Interests:
Semantic Web
The basic idea of the Semantic Web is to describe the
meaning of Web data in a way suitable for automatic
reasoning. Expectedly, the Semantic Web
technology will bring about large-scale heterogeneous
Web knowledge bases with a qualitatively new level
of service. The concept of ontology (domain theory)
will play a key role as a formal, explicit specification of
shared conceptualizations that describe the
semantics of data on the Web. Formal ontology
languages as well as meta-level representation of
Web resources are investigated. The possibility of
developing automated reasoning systems for
Semantic Web is explored from both theoretical and
practical viewpoints, e.g., a hybrid approach with a
strict separation between ontology predicates and
rule predicates and a homogeneous approach
embedding rules and ontologies in a logical language.
Realization of the Semantic Web vision demands
further research works on several other knowledgerepresentation-related
issues.
Reasoning with UML Diagrams
The Unified Modeling Language (UML) is a graphical
language, adopted as a standard by the Object
Management Group (OMG) for visualizing, specifying,
constructing, and documenting the artifacts of a
software-intensive system. As reported by recent
works on the formal semantics of UML, there exist
inherent interrelationships between components of a
UML model. Such interrelationships constitute part of
general knowledge about the domain of UML, which
may be used for, e.g., deriving implicit properties and
verifying the consistency of the model. A framework
for knowledge representation and reasoning in the
domain of UML is proposed, in which a UML model is
represented as textual XML data, and the general
knowledge about the UML domain as an XML
declarative description. Development of an inference
engine for automatic refinement of the encoded UML
diagrams and derivation of implicit model properties is
underway.
Equivalent-Transformation Computation Model
In declarative paradigms, a declarative description
plays the role of a precise specification, and, at the
same time, operates as a program. A number of
works on amalgamation and generalization of
declarative languages have been proposed. Most of
them have been driven mainly by computationoriented
requirements, e.g., enhancement of
operational semantics and integration of computation
models; other important related concepts such as
program synthesis and program transformation are
investigated only afterwards and not inherent in their
designs. By contrast, the equivalent transformation
(ET) paradigm takes a program-synthesis-oriented
approach, i.e., effective generation of efficient and
correct programs from specifications is its underlying
design motivation. Theoretical investigation of the ET
computation model is in progress.
A Theoretical Framework for Comparing
Computation Models
Systematic generation of programs relies on some
specific practically-determined correctness relation,
which associates with each specification a number of
cost-effectively-derivable correct programs with
respect to it. Between two such correctness
relations, if one is more expressive than the other, the
former is preferable, i.e., it determines a larger space
of derivable correct programs. Program generation in
different computation paradigms, e.g., logic
programming (LP), constraint logic programming
(CLP), functional programming (FP), functional logic
programming (FLP), and equivalent transformation
(ET), employs different correctness relations, and the
expressiveness thereof cannot be compared directly
due to the discrepancy in the forms of specifications,
programs and computations. The need arises for a
means of comparing the expressiveness of
correctness relations across computation frameworks.
Dr. Komwut Wipusitwarakun
Assistant Professor
B.Eng. (Honors) in Electrical Engineering, Chulalongkorn University, Thailand
M.Eng. in Communication Engineering, Osaka University, Osaka, Japan
Ph.D. in Communication Engineering, Osaka University, Osaka, Japan
Areas of Specialization: Broadband communication networks, Network reliability analysis, Self-healing network
design, ATM and TCP/IP technologies, Congestion control technologies.
Research Interests:
Highly Reliable Wide Area Network Design
In the coming “Information Age”, business and daily
life will be highly reliant on telecommunication
services. All organizations, companies and ordinary
homes will be connected together by the Wide Area
Communication Networks (WAN) so that various
kinds of services, provided at anywhere, can be
accessible from everywhere at anytime. Network
reliability will become a vital concern since the failure
of network functionality will result in a significant
impact on a wide-range of users both in tangible and
intangible forms. Thus, technologies for designing
and assuring the high reliability of WAN are needed.
These include, for example, theory and tools to
analyze the reliability-level of networks, automatic rerouting
algorithms (self-healing algorithm) design,
reliability-level based traffic prioritizing scheme,
24