Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 361 - 390 of 413

Full-Text Articles in Programming Languages and Compilers

A Semiotic Analysis Of Unified Modeling Language Graphical Notations, Keng Siau, Yuhong Tian Jan 2009

A Semiotic Analysis Of Unified Modeling Language Graphical Notations, Keng Siau, Yuhong Tian

Research Collection School Of Computing and Information Systems

Unified modeling language (UML) is the standard modeling language for object-oriented system development. Despite its status as a standard, UML has a fuzzy formal specification and a weak theoretical foundation. Semiotics, the study of signs, provides a good theoretical foundation for UML research because graphical notations (or visual signs) of UML are subjected to the principles of signs. In our research, we use semiotics to study the effectiveness of graphical notations in UML. We hypothesized that the use of iconic signs as UML graphical notations leads to representation that is more accurately interpreted and that arouses fewer connotations than the …


Specifying And Verifying Event-Based Fairness Enhanced Systems, Jun Sun, Yang Liu, Jin Song Dong, Hai H. Wang Oct 2008

Specifying And Verifying Event-Based Fairness Enhanced Systems, Jun Sun, Yang Liu, Jin Song Dong, Hai H. Wang

Research Collection School Of Computing and Information Systems

Liveness/Fairness plays an important role in software specification, verification and development. Existing event-based compositional models are safety-centric. In this paper, we describe a framework for systematically specifying and verifying event-based systems under fairness assumptions. We introduce different event annotations to associate fairness constraints with individual events. Fairness annotated events can be used to embed liveness/fairness assumptions in event-based models flexibly and naturally. We show that state-of-the-art verification algorithms can be extended to verify models under fairness assumptions, with little computational overhead. We further improve the algorithm by other model checking techniques like partial order reduction. A toolset named Pat has …


Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang Oct 2008

Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang

Research Collection School Of Computing and Information Systems

With the development of sensor technology and electronic miniaturization, wireless sensor networks have shown a wide range of promising applications as well as challenges. Early stage sensor network analysis is critical, which allows us to reveal design errors before sensor deployment. Due to their distinguishable features, system specification and verification of sensor networks are highly non-trivial tasks. On the other hand, numerous formal theories and analysis tools have been developed in formal methods community, which may offer a systematic method for formal analysis of sensor networks. This paper presents our attempt on applying formal methods to sensor network specification/verification. An …


Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi Jun 2008

Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi

Research Collection School Of Computing and Information Systems

Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. In this work, we define a set of composable Timed Automata patterns based on hierarchical constructs in time-enriched process algebras. The patterns facilitate the hierarchical design of complex systems …


A Scalable Approach To Multi-Style Architectural Modeling And Verification, Stephen Wong, Jing Sun, Ian Warren, Jun Sun Apr 2008

A Scalable Approach To Multi-Style Architectural Modeling And Verification, Stephen Wong, Jing Sun, Ian Warren, Jun Sun

Research Collection School Of Computing and Information Systems

Software Architecture represents the high level description of a system in terms of components, external properties and communication. Despite its importance in the software engineering process, the lack of formal description and verification support limits the value of developing architectural models. Automated formal engineering methods can provide an effective means to precisely describe and rigorously verify intended structures and behaviors of software systems. In this paper, we present an approach to support the design and verification of software architectural models using the Alloy analyzer. Based on our earlier work, we propose a fundamental library for specifying system structures in terms …


A Formal Model Of Semantic Web Service Ontology (Wsmo) Execution, Hai H. Wang, Nick Gibbins, Terry R. Payne, Ahmed Saleh, Jun Sun Apr 2008

A Formal Model Of Semantic Web Service Ontology (Wsmo) Execution, Hai H. Wang, Nick Gibbins, Terry R. Payne, Ahmed Saleh, Jun Sun

Research Collection School Of Computing and Information Systems

Semantic Web services have been one of the most significant research areas within the semantic Web vision, and have been recognized as a promising technology that exhibits huge commercial potential. Current semantic Web service research focuses on defining models and languages for the semantic markup of all relevant aspects of services, which are accessible through a Web service interface. The Web service modelling ontology (WSMO) is one of the most significant semantic Web service framework proposed to date. To support the standardization and tool support of WSMO, a formal semantics of the language is highly desirable. As there are a …


Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun Nov 2007

Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun

Research Collection School Of Computing and Information Systems

Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we showed the idea of applying Timed Interval Calculus (TIC) to complement Simulink. In this paper, we develop machine-assisted proof support for Simulink models represented in TIC. The work is based on a generic theorem prover, Prototype Verification System (PVS). The TIC specifications of both Simulink models and requirements are transformed to PVS specifications automatically. Verification can be carried out at interval level with a high level of automation. Analysis of continuous and discrete behaviors is …


Novelty Detection For Cross-Lingual News Stories With Visual Duplicates And Speech Transcripts, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo Sep 2007

Novelty Detection For Cross-Lingual News Stories With Visual Duplicates And Speech Transcripts, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

An overwhelming volume of news videos from different channels and languages is available today, which demands automatic management of this abundant information. To effectively search, retrieve, browse and track cross-lingual news stories, a news story similarity measure plays a critical role in assessing the novelty and redundancy among them. In this paper, we explore the novelty and redundancy detection with visual duplicates and speech transcripts for cross-lingual news stories. News stories are represented by a sequence of keyframes in the visual track and a set of words extracted from speech transcript in the audio track. A major difference to pure …


An Augmented Approach To Support Collaborative Distance Learning Of Unified Modeling Language, Keng Siau, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, Ashu Guru Aug 2007

An Augmented Approach To Support Collaborative Distance Learning Of Unified Modeling Language, Keng Siau, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, Ashu Guru

Research Collection School Of Computing and Information Systems

Teaching in the classroom faces many challenges of providing a collaborative, interactive environment that effectively facilitates students’ learning. The challenges increase when the physical classroom converts into a virtual classroom. This difficulty is further exacerbated when the course is diagramming intensive, practice-oriented, and hands-on in nature. Technology has been sought after to help with these challenges. Web Conferencing software, when compared to Web Broadcasting software, can facilitate real-time interaction and collaboration in a distance learning context. For courses that are diagramming intensive and practice-oriented, Tablet PCs, when compared to desktop PCs, can support drawing and diagramming because of the ability …


Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska May 2007

Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska

Research Collection School Of Computing and Information Systems

Traditional supervised classification algorithms require a large number of labelled examples to perform accurately. Semi-supervised classification algorithms attempt to overcome this major limitation by also using unlabelled examples. Unlabelled examples have also been used to improve nearest neighbour text classification in a method called bridging. In this paper, we propose the use of bridging in a semi-supervised setting. We introduce a new bridging algorithm that can be used as a base classifier in any supervised approach such as co-training or selflearning. We empirically show that classification performance increases by improving the semi-supervised algorithm’s ability to correctly assign labels to previouslyunlabelled …


Solving The Teacher Assignment-Course Scheduling Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh Jan 2007

Solving The Teacher Assignment-Course Scheduling Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh

Research Collection School Of Computing and Information Systems

This paper presents a hybrid algorithm for solving atimetabling problem, which is commonly encountered in manyuniversities. The problem combines both teacher assignment andcourse scheduling problems simultaneously, and is presented as amathematical programming model. However, this problem becomesintractable and it is unlikely that a proven optimal solution can beobtained by an integer programming approach, especially for largeproblem instances. A hybrid algorithm that combines an integerprogramming approach, a greedy heuristic and a modified simulatedannealing algorithm collaboratively is proposed to solve the problem.Several randomly generated data sets of sizes comparable to that ofan institution in Indonesia are solved using the proposed algorithm.Computational results …


An Improvement Heuristic For The Timetabling Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh Jan 2007

An Improvement Heuristic For The Timetabling Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh

Research Collection School Of Computing and Information Systems

This paper formulates a timetabling problem, which is often encountered in a university, as a mathematical programming model. The proposed model combines both teacher assignment and course scheduling problems simultaneously, which causes the entire model to become more complex. We propose an improvement heuristic algorithm to solve such a model. The proposed algorithm has been tested with several randomly generated datasets of sizes that are comparable to those occurring in a university in Indonesia. The computational results show that the improvement heuristic is not only able to obtain good solutions, but is also able to do so within reasonable computational …


Design Synthesis From Interaction And State-Based Specifications, Jun Sun, Jin Song Dong Jan 2006

Design Synthesis From Interaction And State-Based Specifications, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Interaction-based and state-based modeling are two complementary approaches of behavior modeling. The former focuses on global interactions between system components. The latter concentrates on the internal states of individual components. Both approaches have been proven useful in practice. One challenging and important research objective is to combine the modeling power of both effectively and then use the combination as the basis for automatic design synthesis. We present a combination of interaction-based and state-based modeling, namely, Live Sequence Charts and Z, for system specification. We then propose a way of generating distributed design from the combinations. Our approach handles systems with …


Agile Modeling, Agile Software Development, And Extreme Programming: The State Of Research, John Erickson, Kalle Lyytinen, Keng Siau Oct 2005

Agile Modeling, Agile Software Development, And Extreme Programming: The State Of Research, John Erickson, Kalle Lyytinen, Keng Siau

Research Collection School Of Computing and Information Systems

While there are many claims for the successful use of extreme programming (XP) and agile modeling (AM), and the proponents can often be vocal in the extreme regarding their supposed benefits, research evidence supporting proponents' claims is somewhat lacking. Currently, the only research appearing to investigate the phenomena consists of two prominent streams. A small number of case studies and experience reports that generally promote the success of XP in various development environments, and a well-established stream of research into pair programming has generated results that in part support the idea of XP. Research into AM appears to be even …


An Investigation Into The Continued Use Of Unified Modeling Language (Uml) In Information Systems Development, Keng Siau, X. Tan Aug 2005

An Investigation Into The Continued Use Of Unified Modeling Language (Uml) In Information Systems Development, Keng Siau, X. Tan

Research Collection School Of Computing and Information Systems

As the de facto standard for object-oriented modeling language, UML is expected to play an increasingly important role in information systems development. The long-term viability and eventual success of UML depend, to a great extent, on the continued use by UML users such as developers and analysts. Systematic investigations on UML’s continued use have been missing from contemporary discussions. Our study attempts to fill this gap in the literature. We developed a research model, which is primarily based on the Expectation Disconfirmation Theory (EDT). According to this model, UML users’ perceived discrepancy between pre-adoption expectation and post-adoption perceived performance, which …


Synthesis Of Distributed Processes From Scenario-Based Specifications, Jun Sun, Jin Song Dong Jul 2005

Synthesis Of Distributed Processes From Scenario-Based Specifications, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Given a set of sequence diagrams, the problem of synthesis is of deciding whether there exists a satisfying object system and if so, synthesize one automatically. It is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases and if synthesizable they could lead directly to implementation. It is even more interesting (and harder) if the synthesized object system is distributed. In this paper, we propose a systematic way of synthesizing distributed processes from Live Sequence Charts. The basic idea is to first construct a CSP specification from the LSC specification, and then …


Theoretical And Practical Complexity Of Unified Modeling Language: Delphi Study And Metrics Analyses, J. Erickson, Keng Siau Dec 2004

Theoretical And Practical Complexity Of Unified Modeling Language: Delphi Study And Metrics Analyses, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

Systems have become increasingly complex, and as a result development methods have become more complex as well. The unified modeling language (UML) has been criticized for the often cited and sometimes over- whelming complexity it presents to its users, and those seeking to learn to use it. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao (2001) completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee (2002) proposed that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, known as theoretical complexity. This …


Supply Chains Integration: Architecture And Enabling Technologies, Keng Siau, Yuhong Tian Jan 2004

Supply Chains Integration: Architecture And Enabling Technologies, Keng Siau, Yuhong Tian

Research Collection School Of Computing and Information Systems

An effective and efficient supply chain is vital to the competitiveness and the survival of an organization. With the emergence of the e-business era, supply chain systems need to be able to extend beyond the traditional boundaries. This paper proposes integrated supply chain architecture (SCA) that combines the benefits of Enterprise Resource Planning (ERP) and the various supply chain applications. Some necessary criteria for an integrated supply chain include completeness, security, flexibility, scalability, and interoperability. The enabling technologies for such a supply chain system include XML, DCOM, CORBA, SOAP, Net, and Semantic Web. Wireless and mobile technologies could further extend …


Analyzing Unified Modeling Language Using Concept Mapping, Keng Siau, Z. Shen Aug 2002

Analyzing Unified Modeling Language Using Concept Mapping, Keng Siau, Z. Shen

Research Collection School Of Computing and Information Systems

The Unified Modeling Language (UML) is a visual modeling language for object-oriented software development. Although the Object Management Group (OMG) adopted UML as its standard modeling language in 1997, the consensus in the academic community and the industry is that further research is needed to evaluate, enhance, extend, and formalize UML. A substantial amount of research has been conducted to this end, but most was based on common sense, informal observation, and intuition. Systematic and empirical studies to analyze, evaluate, and enhance UML have been lacking. This paper attempts to evaluate and study UML from a cognitive perspective. Specifically, the …


Unified Modeling Language: A Complexity Analysis, Keng Siau, Q. Cao Jan 2001

Unified Modeling Language: A Complexity Analysis, Keng Siau, Q. Cao

Research Collection School Of Computing and Information Systems

Unified Modeling Language (UML) is the standard visual modeling language for Object Oriented (OO) systems development, but it has been criticized for its complexity, inconsistent semantics, and ambiguous constructs. A set of complexity indices for UML and the nine diagramming techniques in UML was compiled recently. The complexity analysis is formulated based on the number of constructs, associations, roles, and so forth, in a modeling method. We argue that this set of metrics provides an indication of the theoretical complexity of the modeling methods. On the other hand, the theoretical complexity of the modeling methods does not necessarily relate to …


A Study Of Single W Production In E+E- Collisions At √S = 161-183 Gev, R. Barate, Manoj Thulasidas Jan 1999

A Study Of Single W Production In E+E- Collisions At √S = 161-183 Gev, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Single W production is studied in the data recorded with the ALEPH detector at LEP at centre-of-mass energies between 161 and 183 GeV. The cross section is measured to be σw = 0.41 ± 0.17(stat.) ± 0.04(syst.) pb at 183 GeV, consistent with the Standard Model expectation. Limits on non-standard WWγ couplings are deduced as -1.6 γ γ = 0) and -1.6 γ γ = 1) at 95% C.L. A search for effectively invisible decays of the W boson in W pair production is performed, leading to an upper limit on the branching ratio of 1.3% (Γinv = 27 MeV) …


Determination Of The Lep Centre-Of-Mass Energy From Zγ Events, R. Barate, Manoj Thulasidas Jan 1999

Determination Of The Lep Centre-Of-Mass Energy From Zγ Events, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A study of events with photons and missing energy has been performed with the data sample obtained with the ALEPH detector at centre-of-mass energies from 161 to 184 GeV, corresponding to a total integrated luminosity of about 80 pb−1. The measured distributions are in agreement with Standard Model predictions, leading to constraints on WWγ gauge coupling parameters ∆κγ and λγ. The results from the fit to the cross sections and to the energy and angular distributions of the photons are: ∆κγ = 0.05+1.15 −1.10(stat)±0.25(syst) λγ = −0.05+1.55 −1.45(stat)±0.30(syst).


Measurement Of W-Pair Production In E+E- Collisions At 183 Gev, R. Barate, Manoj Thulasidas Jan 1999

Measurement Of W-Pair Production In E+E- Collisions At 183 Gev, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The production of W+W− pairs is analysed in a data sample collected by ALEPH at a mean centre-of-mass energy of 182.7 GeV, corresponding to an integrated luminosity of 57 pb−1 . Cross sections are given for different topologies of W decays into leptons or hadrons. Under Standard Model assumptions for the W-pair production and decay, the W-pair cross section is measured to be 15.57 ± 0.62(stat.) ± 0.29(syst.) pb. Using also the W-pair data samples collected by ALEPH at lower centre-of-mass energies, the decay branching ratio of the W boson into hadrons is measured to be B(W → hadrons) = …


Monitoring The Stability Of The Aleph Vertex Detector, G. Sguazzoni, Manoj Thulasidas Jan 1999

Monitoring The Stability Of The Aleph Vertex Detector, G. Sguazzoni, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The ALEPH Silicon Vertex Detector features an optical fibre laser system to monitor its mechanical stability. The operating principle and the general performance of the laser system are described. The experience obtained during 1997 and 1998 operations confirms the important role that such a system can have with respect to the detector alignment requirements. In particular, the laser system has been used to monitor short-term temperature-related effects and long-term movements. These results and a description of the laser-based alignment correction applied to the 1998 data are presented.


Search For Invisible Higgs Boson Decays In E+E- Collisions At Centre-Of-Mass Energies Up To 184 Gev, R. Barate, Manoj Thulasidas Jan 1999

Search For Invisible Higgs Boson Decays In E+E- Collisions At Centre-Of-Mass Energies Up To 184 Gev, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

In a data sample of 78.3 pb−1 collected in 1996 and 1997 by the ALEPH detector at centre-of-mass energies from 161 to 184 GeV, invisible decays of a Higgs boson have been searched for in the reaction e+e− → hZ, where the Z can decay into e+e−, µ+µ− or q¯q. No evidence for a signal is found and limits on the production cross section are derived as a function of the Higgs boson mass. These results are combined with those obtained in an update of the analyses of the ALEPH data taken at LEP 1. For a production cross section …


Measurement Of The Hadronic Photon Structure Function At Lep 1 For 〈Q2〉 Values Between 9.9 And 284 Gev2, Barate, R.; Et Al., M. Thulasidas Jan 1999

Measurement Of The Hadronic Photon Structure Function At Lep 1 For 〈Q2〉 Values Between 9.9 And 284 Gev2, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Inclusive γ∗γ interactions to hadronic final states where one scattered electron or positron is detected in the electromagnetic calorimeters have been studied in the LEP 1 data taken by ALEPH from 1991 to 1995. The event sample has been used to measure the hadronic structure function of the photon F2γ in three bins with 〈Q2〉 of 9.9, 20.7 and 284 GeV2.


Measurement Of The W Mass In E+E- Collisions At 183 Gev, Barate, R.; Et Al., M. Thulasidas Jan 1999

Measurement Of The W Mass In E+E- Collisions At 183 Gev, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The mass of the W boson is obtained from reconstructed invariant mass distributions in W-pair events. The sample of W pairs is selected from 57 pb−1 collected with the ALEPH detector in 1997 at a centre-of-mass energy of 183 GeV.


Search For Sleptons In E+E- Collisions At Centre-Of-Mass Energies Up To 184 Gev Aleph Collaboration, R. Barate, Manoj Thulasidas Aug 1998

Search For Sleptons In E+E- Collisions At Centre-Of-Mass Energies Up To 184 Gev Aleph Collaboration, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The data collected by the ALEPH experiment at LEP at centre–of–mass energies around 183 GeV are analysed to search for sleptons, the partners of leptons in supersymmetric theories. The previously published search for acoplanar leptons and missing energy has been updated. New searches have been developed to cover a wider range of slepton signals. These include single electrons, acoplanar leptons accompanied by two photons plus missing energy as well as particles with lifetime. No evidence for the production of any such particles is found. Slepton mass limits are reported within gravity mediated and gauge mediated SUSY breaking scenarios.


The Forward-Backward Asymmetry For Charm Quarks At The Z, R. Barate, Manoj Thulasidas Aug 1998

The Forward-Backward Asymmetry For Charm Quarks At The Z, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

From 1.4 million hadronic Z decays collected by the ALEPH detector at LEP, an enriched sample of Z → cc̄ events is extracted by requiring the presence of a high momentum D∗±. The charm quark forward-backward charge asymmetry at the Z pole is measured to be AFB0.c = (8.0 ± 2.4) % corresponding to an effective electroweak mixing angle of sin2θWeff = 0.2302 ± 0.0054.


A Measurement Of The Inclusive B → Sγ Branching Ratio, R. Barate, Manoj Thulasidas Jun 1998

A Measurement Of The Inclusive B → Sγ Branching Ratio, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The avour changing neutral current decay b ! s has been detected in hadronic Z decays collected by ALEPH at LEP. The signal is isolated in lifetime-tagged b b events by the presence of a hard photon associated with a system of high momentum and high rapidity hadrons. The background processes are normalised from the data themselves. The inclusive branching ratio is measured to be (3:11 0:80stat 0:72syst) 104 ; consistent with the Standard Model expectation via penguin processes