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

Computer Sciences Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 7561 - 7590 of 9003

Full-Text Articles in Computer Sciences

Does Co-Opetition Change The Game? A Bayesian Analysis Of Participation Strategy In An Industry Standard-Setting Organization, Robert J. Kauffman, Benjamin B. M. Shao, Juliana Y. Tsai Jan 2010

Does Co-Opetition Change The Game? A Bayesian Analysis Of Participation Strategy In An Industry Standard-Setting Organization, Robert J. Kauffman, Benjamin B. M. Shao, Juliana Y. Tsai

Research Collection School Of Computing and Information Systems

Across different industries, we observe the emergence of industry standard-setting organizations (SSO) that focus on the creation of industry-specific process standards. Firms adopt a strategy of co-opetition, the combination of cooperation and competition, during standards development. We propose that a firm's co-opetition strategy is revealed to some extent by when it elects to participate in an industry SSO. Bayesian information updating offers an effective empirical modeling perspective for studying firms' participation strategies when managers' beliefs and uncertainties are factored into their decision-making. We analyze a panel data set of 73 U.S. public firms over a 20-year period. These firms are …


Crctol: A Semantic Based Domain Ontology Learning System, Xing Jiang, Ah-Hwee Tan Jan 2010

Crctol: A Semantic Based Domain Ontology Learning System, Xing Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Domain ontologies play an important role in supporting knowledge‐based applications in the Semantic Web. To facilitate the building of ontologies, text mining techniques have been used to perform ontology learning from texts. However, traditional systems employ shallow natural language processing techniques and focus only on concept and taxonomic relation extraction. In this paper we present a system, known as Concept‐Relation‐Concept Tuple‐based Ontology Learning (CRCTOL), for mining ontologies automatically from domain‐specific documents. Specifically, CRCTOL adopts a full text parsing technique and employs a combination of statistical and lexico‐syntactic methods, including a statistical algorithm that extracts key concepts from a document collection, …


Do Online Reviews Reflect A Product's True Perceived Quality? An Investigation Of Online Movie Reviews Across Cultures, Noi Sian Koh, Nan Hu, Eric K. Clemons Jan 2010

Do Online Reviews Reflect A Product's True Perceived Quality? An Investigation Of Online Movie Reviews Across Cultures, Noi Sian Koh, Nan Hu, Eric K. Clemons

Research Collection School Of Computing and Information Systems

When does the reported average of online ratings match perceived average assessment? We apply behavioral theory to capture intentions in rating online movie reviews in two dissimilar countries - China and the United States. We argue that consumers' rating behaviors are affected by cultural influences. Based on data collected from imdb.com and douban.com, we found significant differences across raters from these two different cultures. Additionally, we examined how cultural elements influence rating behavior for a hybrid culture - Singapore. Under-reporting bias occurs when consumers with extreme opinions are more likely to report their opinions than consumers with moderate reviews, resulting …


Dual Phase Learning For Large Scale Video Gait Recognition, Jialie Shen, Hwee Hwa Pang, Dacheng Tao, Xuelong Li Jan 2010

Dual Phase Learning For Large Scale Video Gait Recognition, Jialie Shen, Hwee Hwa Pang, Dacheng Tao, Xuelong Li

Research Collection School Of Computing and Information Systems

Accurate gait recognition from video is a complex process involving heterogenous features, and is still being developed actively. This article introduces a novel framework, called GC2F, for effective and efficient gait recognition and classification. Adopting a ”refinement-and-classification” principle, the framework comprises two components: 1) a classifier to generate advanced probabilistic features from low level gait parameters; and 2) a hidden classifier layer (based on multilayer perceptron neural network) to model the statistical properties of different subject classes. To validate our framework, we have conducted comprehensive experiments with a large test collection, and observed significant improvements in identification accuracy relative to …


Remote Attestation On Function Execution, Liang Gu, Yueqiang Cheng, Xuhua Ding, Robert H. Deng, Yao Guo, Weizhong Shao Jan 2010

Remote Attestation On Function Execution, Liang Gu, Yueqiang Cheng, Xuhua Ding, Robert H. Deng, Yao Guo, Weizhong Shao

Research Collection School Of Computing and Information Systems

Remote attestation provides the basis for one platform to establish trusts on another. In this paper, we consider the problem of attesting the correctness of program executions. We propose to measure the target program and all the objects it depends on, with an assumption that the Secure Kernel and the Trusted Platform Module provide a secure execution environment through process separation. The attestation of the target program begins with a program analysis on the source code or the binary code in order to find out the relevant executables and data objects. Whenever such a data object is accessed or a …


Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe Jan 2010

Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has failed to address communication. Without communication, the size of a local policy at each agent within the ND-POMDPs grows exponentially in the time horizon. To overcome this problem, we extend existing algorithms so that agents periodically communicate their observation and action histories with each other. After communication, agents can start from new synchronized belief state. Thus, we can avoid the exponential growth in the size of local policies at agents. Furthermore, we introduce …


Teleoph: A Secure Real-Time Teleophthalmology System, Yongdong Wu, Zhou Wei, Haixia Yao, Zhigang Zhao, Lek Heng Ngoh, Robert H. Deng, Shengsheng Yu Jan 2010

Teleoph: A Secure Real-Time Teleophthalmology System, Yongdong Wu, Zhou Wei, Haixia Yao, Zhigang Zhao, Lek Heng Ngoh, Robert H. Deng, Shengsheng Yu

Research Collection School Of Computing and Information Systems

Teleophthalmology (TeleOph) is an electronic counterpart of today's face-to-face, patient-to-specialist ophthalmology system. It enables one or more ophthalmologists to remotely examine a patient's condition via a confidential and authentic communication channel. Specifically, TeleOph allows a trained nonspecialist in a primary clinic to screen the patients with digital instruments (e.g., camera, ophthalmoscope). The acquired medical data are delivered to the hospital where an ophthalmologist will review the data collected and, if required, provide further consultation for the patient through a real-time secure channel established over a public Internet network. If necessary, the ophthalmologist is able to further sample the images/video of …


Universal Authentication Protocols For Anonymous Wireless Communications, Guomin Yang, Qiong Huang, Duncan S. Wong, Xiaotie Deng Jan 2010

Universal Authentication Protocols For Anonymous Wireless Communications, Guomin Yang, Qiong Huang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

A secure roaming protocol allows a roaming user U to visit a foreign server V and establish a session key in an authenticated way such that U authenticates V and at the same time convinces V that it is a legitimate subscriber of some server H, called the home server of U. The conventional approach requires the involvement of all the three parties. In this paper, we propose a new approach which requires only two parties, U and V, to get involved. We propose two protocols: one provides better efficiency and supports user anonymity to an extent comparable to that …


Workshop Report From Web2se: First Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Kate Ehrlich, Arie Van Deursen Jan 2010

Workshop Report From Web2se: First Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Kate Ehrlich, Arie Van Deursen

Research Collection School Of Computing and Information Systems

Web 2.0 technologies such as wikis, blogs, tags and feeds have been adopted and adapted by software engineers. With Web2SE, we provide a venue for pertinent work by highlighting current state-of-the-art research, by identifying research areas, and by discussing implications of Web 2.0 on software engineering. This paper reports on the paper presentations and the discussions among participants at Web2SE 2010 as well as on future directions of the Web2SE community.


Information Technology Diffusion With Influentials, Imitators, And Opponents: Model And Preliminary Evidence, Hasan Cavusoglu, Nan Hu, Yingjiu Li, Dan Ma Jan 2010

Information Technology Diffusion With Influentials, Imitators, And Opponents: Model And Preliminary Evidence, Hasan Cavusoglu, Nan Hu, Yingjiu Li, Dan Ma

Research Collection School Of Computing and Information Systems

Information technology (IT) innovations follow a diverse set of diffusion patterns. Early diffusion models explaining technology diffusion patterns assumed that there is a single homogeneous segment of potential adopters. It was later shown that a two-segment model considering two groups of adopters explains variations in diffusion patterns better than the existing one-segment models. While the two-segment model considers a group of adopters promoting adoption by exerting a positive influence on prospective adopters, it does not consider the members of society who aim to inhibit the adoption process by exerting a negative influence on prospective adopters. In fact, most IT innovations …


A Review Of The Professionalization Of The Software Industry: Has It Made Software Engineering A Real Profession?, Heng Ngee Mok Jan 2010

A Review Of The Professionalization Of The Software Industry: Has It Made Software Engineering A Real Profession?, Heng Ngee Mok

Research Collection School Of Computing and Information Systems

Every industry strives to be called a "profession", and software engineering is no exception. This paper attempts to define "profession" from three different perspectives and provides a chronological narration of the professionalization efforts of major IT bodies such as the IEEE Computer Society, Association of Computing Machinery and British Computer Society to promote software engineering from "occupation" to "profession". The outcome of this professionalization process is then examined against the three vastly different definitions of "profession" to qualitatively gauge the success of the professionalization process.


Scalable Multi-Core Model Checking Fairness Enhanced Systems, Yang Liu, Jun Sun, Jin Song Dong Dec 2009

Scalable Multi-Core Model Checking Fairness Enhanced Systems, Yang Liu, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms. The Linear Temporal Logic (LTL) model checking problem is one of the difficult problems to be parallelized or scaled up to multi-core. In this work, we propose an on-the-fly parallel model checking algorithm based on the Tarjan’s strongly connected components (SCC) detection algorithm. The approach can be applied to general LTL model checking or with different fairness assumptions. Further, it is orthogonal to state space reduction techniques like partial order reduction. We enhance our PAT …


A New Approach For Anonymous Password Authentication, Yanjiang Yang, Jianying Zhou, Jian Weng, Feng Bao Dec 2009

A New Approach For Anonymous Password Authentication, Yanjiang Yang, Jianying Zhou, Jian Weng, Feng Bao

Research Collection School Of Computing and Information Systems

Anonymous password authentication reinforces password authentication with the protection of user privacy. Considering the increasing concern of individual privacy nowadays, anonymous password authentication represents a promising privacy-preserving authentication primitive. However, anonymous password authentication in the standard setting has several inherent weaknesses, making its practicality questionable. In this paper, we propose a new and efficient approach for anonymous password authentication. Our approach assumes a different setting where users do not register their passwords to the server; rather, they use passwords to protect their authentication credentials. We present a concrete scheme, and get over a number of challenges in securing password-protected credentials …


Insights Into Malware Detection And Prevention On Mobile Phones, Qiang Yan, Yingjiu Li, Tieyan Li, Robert H. Deng Dec 2009

Insights Into Malware Detection And Prevention On Mobile Phones, Qiang Yan, Yingjiu Li, Tieyan Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

The malware threat for mobile phones is expected to increase with the functionality enhancement of mobile phones. This threat is exacerbated with the surge in population of smart phones instilled with stable Internet access which provides attractive targets for malware developers. Prior research on malware protection has focused on avoiding the negative impact of the functionality limitations of mobile phones to keep the performance cost within the limitations of mobile phones. Being different, this paper investigates the positive impact of these limitations on suppressing the development of mobile malware. We study the state-of-the-art mobile malware, as well as the progress …


Denial-Of-Service Attacks On Host-Based Generic Unpackers, Limin Liu, Jiang Ming, Zhi Wang, Debin Gao, Chunfu Jia Dec 2009

Denial-Of-Service Attacks On Host-Based Generic Unpackers, Limin Liu, Jiang Ming, Zhi Wang, Debin Gao, Chunfu Jia

Research Collection School Of Computing and Information Systems

With the advance of packing techniques, a few generic and automatic unpackers have been proposed. These unpackers are designed to automatically unpack packed binaries without specific knowledge of the packing techniques used. In this paper, we present an automatic packer with which packed malware forges spurious unpacking behaviors that lead to a denial-of-service attack on host-based generic unpackers. We present the design, implementation, and evaluation of the proposed packer and malware produced using the proposed packer, and show the success of denial-of-service attacks on host-based generic unpackers.


Computationally Secure Hierarchical Self-Healing Key Distribution For Heterogeneous Wireless Sensor Networks, Yanjiang Yang, Jianying Zhou, Robert H. Deng, Feng Bao Dec 2009

Computationally Secure Hierarchical Self-Healing Key Distribution For Heterogeneous Wireless Sensor Networks, Yanjiang Yang, Jianying Zhou, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Self-healing group key distribution is a primitive aimed to achieve robust key distribution in wireless sensor networks (WSNs) over lossy communication channels. However, all the existing self-healing group key distribution schemes in the literature are designed for homogenous WSNs that do not scale. In contract, heterogeneous WSNs have better scalability and performance. We are thus motivated to study self-healing group key distribution for heterogeneous WSNs. In particular, we propose the concept of hierarchical self-healing group key distribution, tailored to the heterogeneous WSN architecture; we further revisit and adapt Dutta et al.’s model to the setting of hierarchical self-healing group …


Managing Supply Uncertainty With An Information Market, Zhiling Guo, Fang Fang, Andrew B. Whinston Dec 2009

Managing Supply Uncertainty With An Information Market, Zhiling Guo, Fang Fang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

We propose a market-based information aggregation mechanism to manage the supply side uncertainty in the supply chain. In our analytical model, a simple supply chain consists of a group of retailers who order a homogeneous product from two suppliers. The two suppliers differ in their ability to fulfill orders – one always delivers orders and the other fulfills orders probabilistically. We model the supply chain decisions as a Stackelberg game where the supplier who has uncertain reliability decides a wholesale price before the retailers who independently receive signals about the supplier’s reliability determine their sourcing strategies. We then propose an …


Enabling Secure Secret Updating For Unidirectional Key Distribution In Rfid-Enabled Supply Chains, Shaoying Cai, Tieyan Li, Changshe Ma, Yingjiu Li, Robert H. Deng Dec 2009

Enabling Secure Secret Updating For Unidirectional Key Distribution In Rfid-Enabled Supply Chains, Shaoying Cai, Tieyan Li, Changshe Ma, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

In USENIX Security 08, Juels, Pappu and Parno proposed a secret sharing based mechanism to alleviate the key distribution problem in RFID-enabled supply chains. Compared to existing pseudonym based RFID protocols, the secret sharing based solution is more suitable for RFID-enabled supply chains since it does not require a database of keys be distributed among supply chain parties for secure ownership transfer of RFID tags. However, this mechanism cannot resist tag tracking and tag counterfeiting attacks in supply chain systems. It is also not convenient for downstream supply chain parties to adjust the size of RFID tag collections in recovering …


To Trust Or Not To Trust? Predicting Online Trusts Using Trust Antecedent Framework, Viet-An Nguyen, Ee Peng Lim, Jing Jiang, Aixin Sun Dec 2009

To Trust Or Not To Trust? Predicting Online Trusts Using Trust Antecedent Framework, Viet-An Nguyen, Ee Peng Lim, Jing Jiang, Aixin Sun

Research Collection School Of Computing and Information Systems

This paper analyzes the trustor and trustee factors that lead to inter-personal trust using a well studied Trust Antecedent framework in management science. To apply these factors to trust ranking problem in online rating systems, we derive features that correspond to each factor and develop different trust ranking models. The advantage of this approach is that features relevant to trust can be systematically derived so as to achieve good prediction accuracy. Through a series of experiments on real data from Epinions, we show that even a simple model using the derived features yields good accuracy and outperforms MoleTrust, a trust …


Learning Bregman Distance Functions And Its Application For Semi-Supervised Clustering, Lei Wu, Rong Jin, Steven C. H. Hoi, Jianke Zhu, Nenghai Yu Dec 2009

Learning Bregman Distance Functions And Its Application For Semi-Supervised Clustering, Lei Wu, Rong Jin, Steven C. H. Hoi, Jianke Zhu, Nenghai Yu

Research Collection School Of Computing and Information Systems

Learning distance functions with side information plays a key role in many machine learning and data mining applications. Conventional approaches often assume a Mahalanobis distance function. These approaches are limited in two aspects: (i) they are computationally expensive (even infeasible) for high dimensional data because the size of the metric is in the square of dimensionality; (ii) they assume a fixed metric for the entire input space and therefore are unable to handle heterogeneous data. In this paper, we propose a novel scheme that learns nonlinear Bregman distance functions from side information using a nonparametric approach that is similar to …


Duol: A Double Updating Approach For Online Learning, Peilin Zhao, Steven C. H. Hoi, Rong Jin Dec 2009

Duol: A Double Updating Approach For Online Learning, Peilin Zhao, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

In most online learning algorithms, the weights assigned to the misclassified examples (or support vectors) remain unchanged during the entire learning process. This is clearly insufficient since when a new misclassified example is added to the pool of support vectors, we generally expect it to affect the weights for the existing support vectors. In this paper, we propose a new online learning method, termed Double Updating Online Learning, or DUOL for short. Instead of only assigning a fixed weight to the misclassified example received in current trial, the proposed online learning algorithm also tries to update the weight for one …


A Robust Damage Assessment Model For Corrupted Database Systems, Ge Fu, Hong Zhu, Yingjiu Li Dec 2009

A Robust Damage Assessment Model For Corrupted Database Systems, Ge Fu, Hong Zhu, Yingjiu Li

Research Collection School Of Computing and Information Systems

An intrusion tolerant database uses damage assessment techniques to detect damage propagation scales in a corrupted database system. Traditional damage assessment approaches in a intrusion tolerant database system can only locate damages which are caused by reading corrupted data. In fact, there are many other damage spreading patterns that have not been considered in traditional damage assessment model. In this paper, we systematically analyze inter-transaction dependency relationships that have been neglected in the previous research and propose four different dependency relationships between transactions which may cause damage propagation. We extend existing damage assessment model based on the four novel dependency …


Wake Up Or Fall Asleep: Value Implication Of Trusted Computing, Nan Hu, Jianhui Huang, Ling Liu, Yingjiu Li, Dan Ma Dec 2009

Wake Up Or Fall Asleep: Value Implication Of Trusted Computing, Nan Hu, Jianhui Huang, Ling Liu, Yingjiu Li, Dan Ma

Research Collection School Of Computing and Information Systems

More than 10 years have passed since trusted computing (TC) technology was introduced to the market; however, there is still no consensus about its value. The increasing importance of user and enterprise security and the security promised by TC, coupled with the increasing tension between the proponents and the opponents of TC, make it timely to investigate the value relevance of TC in terms of both capital market and accounting performance. Based on both price and volume studies, we found that news releases related to the adoption of the TC technology had no information content. All investors, regardless of whether …


Cyber Attacks: Does Physical Boundary Matter?, Qiu-Hong Wang, Seung-Hyun Kim Dec 2009

Cyber Attacks: Does Physical Boundary Matter?, Qiu-Hong Wang, Seung-Hyun Kim

Research Collection School Of Computing and Information Systems

Information security issues are characterized with interdependence. Particularly, cyber criminals can easily cross national boundaries and exploit jurisdictional limitations between countries. Thus, whether cyber attacks are spatially autocorrelated is a strategic issue for government authorities and a tactic issue for insurance companies. Through an empirical study of cyber attacks across 62 countries during the period 2003-2007, we find little evidence on the spatial autocorrelation of cyber attacks at any week. However, after considering economic opportunity, IT infrastructure, international collaboration in enforcement and conventional crimes, we find strong evidence that cyber attacks were indeed spatially autocorrelated as they moved over time. …


Coherent Phrase Model For Efficient Image Near-Duplicate Retrieval, Yiqun Hu, Xiangang Cheng, Liang-Tien Chia, Xing Xie, Deepu Rajan, Ah-Hwee Tan Dec 2009

Coherent Phrase Model For Efficient Image Near-Duplicate Retrieval, Yiqun Hu, Xiangang Cheng, Liang-Tien Chia, Xing Xie, Deepu Rajan, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper presents an efficient and effective solution for retrieving image near-duplicate (IND) from image database. We introduce the coherent phrase model which incorporates the coherency of local regions to reduce the quantization error of the bag-of-words (BoW) model. In this model, local regions are characterized by visual phrase of multiple descriptors instead of visual word of single descriptor. We propose two types of visual phrase to encode the coherency in feature and spatial domain, respectively. The proposed model reduces the number of false matches by using this coherency and generates sparse representations of images. Compared to other method, the …


Adaptive Type-2 Fuzzy Maintenance Advisor For Offshore Power Systems, Zhaoxia Wang, C. S. Chang, Fan Yang, W. W. Tan Dec 2009

Adaptive Type-2 Fuzzy Maintenance Advisor For Offshore Power Systems, Zhaoxia Wang, C. S. Chang, Fan Yang, W. W. Tan

Research Collection School Of Computing and Information Systems

Proper maintenance strategies are very desirable for minimizing the operational and maintenance costs of power systems without sacrificing reliability. Condition-based maintenance has largely replaced time-based maintenance because of the former's potential economic benefits. As offshore substations are often remotely located, they experience more adverse environments, higher failures, and therefore need more powerful analytical tools than their onshore counterpart. As reliability information collected during operation of an offshore substation can rarely avoid uncertainties, it is essential to obtain consistent estimates of reliability measures under changing environmental and operating conditions. Some attempts with type-1 fuzzy logic were made with limited success in …


On The Untraceability Of Anonymous Rfid Authentication Protocol With Constant Key-Lookup, Bing Liang, Yingjiu Li, Tieyan Li, Robert H. Deng Dec 2009

On The Untraceability Of Anonymous Rfid Authentication Protocol With Constant Key-Lookup, Bing Liang, Yingjiu Li, Tieyan Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

In ASIACCS'08, Burmester, Medeiros and Motta proposed an anonymous RFID authentication protocol (BMM protocol [2]) that preserves the security and privacy properties, and achieves better scalability compared with other contemporary approaches. We analyze BMM protocol and find that some of security properties (especial untraceability) are not fulfilled as originally claimed. We consider a subtle attack, in which an adversary can manipulate the messages transmitted between a tag and a reader for several continuous protocol runs, and can successfully trace the tag after these interactions. Our attack works under a weak adversary model, in which an adversary can eavesdrop, intercept and …


On Strategies For Imbalanced Text Classification Using Svm: A Comparative Study, Aixin Sun, Ee Peng Lim, Ying Liu Dec 2009

On Strategies For Imbalanced Text Classification Using Svm: A Comparative Study, Aixin Sun, Ee Peng Lim, Ying Liu

Research Collection School Of Computing and Information Systems

Many real-world text classification tasks involve imbalanced training examples. The strategies proposed to address the imbalanced classification (e.g., resampling, instance weighting), however, have not been systematically evaluated in the text domain. In this paper, we conduct a comparative study on the effectiveness of these strategies in the context of imbalanced text classification using Support Vector Machines (SVM) classifier. SVM is the interest in this study for its good classification accuracy reported in many text classification tasks. We propose a taxonomy to organize all proposed strategies following the training and the test phases in text classification tasks. Based on the taxonomy, …


Mining Hierarchical Scenario-Based Specifications, David Lo, Shahar Maoz Nov 2009

Mining Hierarchical Scenario-Based Specifications, David Lo, Shahar Maoz

Research Collection School Of Computing and Information Systems

Scalability over long traces, as well as comprehensibility and expressivity of results, are major challenges for dynamic analysis approaches to specification mining. In this work we present a novel use of object hierarchies over traces of inter-object method calls, as an abstraction/refinement mechanism that enables user-guided, top-down or bottom-up mining of layered scenario-based specifications, broken down by hierarchies embedded in the system under investigation. We do this using data mining methods that provide statistically significant sound and complete results modulo user-defined thresholds, in the context of Damm and Harel’s live sequence charts (LSC); a visual, modal, scenario-based, inter-object language. Thus, …


Trust-Oriented Composite Services Selection And Discovery, Lei Li, Yan Wang, Ee Peng Lim Nov 2009

Trust-Oriented Composite Services Selection And Discovery, Lei Li, Yan Wang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust level of a service or a service provider is a critical issue to consider in service selection and discovery, particularly when a client is looking for a service from a large set of services or service providers. However, a service may invoke other services offered by different providers forming composite services. The complex invocations in composite services greatly increase the complexity of trust-oriented service selection and discovery. In this paper, we propose novel approaches for composite service representation, …