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

Physical Sciences and Mathematics Commons

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

Research Collection School Of Computing and Information Systems

2008

Discipline
Keyword

Articles 31 - 60 of 158

Full-Text Articles in Physical Sciences and Mathematics

Link Layer Multicast Using Smart Antennas: No Client Left Behind, Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury Oct 2008

Link Layer Multicast Using Smart Antennas: No Client Left Behind, Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury

Research Collection School Of Computing and Information Systems

Wireless link layer multicast is an important service primitive for emerging applications, such as live video, streaming audio, and other content telecasts. The broadcast nature of the wireless channel is amenable to multicast because a single packet transmission may be received by all clients in the multicast group. However, in view of diverse channel conditions at different clients, the rate of such a transmission is bottlenecked by the rate of the weakest client. Multicast throughput degrades severely. Attempts to increase the data rate result in lower reliability and higher unfairness. This paper utilizes smart beamforming antennas to improve multicast performance …


Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan Oct 2008

Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

We propose, theorize and implement the Recursive Pattern-based Hybrid Supervised (RPHS) learning algorithm. The algorithm makes use of the concept of pseudo global optimal solutions to evolve a set of neural networks, each of which can solve correctly a subset of patterns. The pattern-based algorithm uses the topology of training and validation data patterns to find a set of pseudo-optima, each learning a subset of patterns. It is therefore well adapted to the pattern set provided. We begin by showing that finding a set of local optimal solutions is theoretically equivalent, and more efficient, to finding a single global optimum …


Ontology Enhanced Web Image Retrieval: Aided By Wikipedia And Spreading Activation Theory, Huan Wang, Xing Jiang, Liang-Tien Chia, Ah-Hwee Tan Oct 2008

Ontology Enhanced Web Image Retrieval: Aided By Wikipedia And Spreading Activation Theory, Huan Wang, Xing Jiang, Liang-Tien Chia, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Ontology, as an efective approach to bridge the semantic gap in various domains, has attracted a lot of interests from multimedia researchers. Among the numerous possibilities enabled by ontology, we are particularly interested in exploiting ontology for a better understanding of media task (particularly, images) on the World Wide Web. To achieve our goal, two open issues are inevitably involved: 1) How to avoid the tedious manual work for ontology construction? 2) What are the effective inference models when using an ontology? Recent works about ontology learned from Wikipedia has been reported in conferences targeting the areas of knowledge management …


Selection Of Concept Detectors For Video Search By Ontology-Enriched Semantic Spaces, Xiao-Yong Wei, Chong-Wah Ngo, Yu-Gang Jiang Oct 2008

Selection Of Concept Detectors For Video Search By Ontology-Enriched Semantic Spaces, Xiao-Yong Wei, Chong-Wah Ngo, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

This paper describes the construction and utilization of two novel semantic spaces, namely Ontology-enriched Semantic Space (OSS) and Ontology-enriched Orthogonal Semantic Space (OS2), to facilitate the selection of concept detectors for video search. These two semantic spaces are enriched with ontology knowledge, while emphasizing consistent and uniform comparison of ontological relatedness among concepts for query-to-concept mapping. OS2, in addition to being a linear space like OSS, also guarantees orthogonality of the semantic space. Compared with other ontology reasoning measures, both spaces are capable of providing platforms that offer a global view of concept inter-relatedness, by allowing evaluation of concept similarity …


Video Event Detection Using Motion Relativity And Visual Relatedness, Feng Wang, Yu-Gang Jiang, Chong-Wah Ngo Oct 2008

Video Event Detection Using Motion Relativity And Visual Relatedness, Feng Wang, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Event detection plays an essential role in video content analysis. However, the existing features are still weak in event detection because: i) most features just capture what is involved in an event or how the event evolves separately, and thus cannot completely describe the event; ii) to capture event evolution information, only motion distribution over the whole frame is used which proves to be noisy in unconstrained videos; iii) the estimated object motion is usually distorted by camera movement. To cope with these problems, in this paper, we propose a new motion feature, namely Expanded Relative Motion Histogram of Bag-ofVisual-Words …


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 …


Output Regularized Metric Learning With Side Information, Wei Liu, Steven C. H. Hoi, Jianzhuang Liu Oct 2008

Output Regularized Metric Learning With Side Information, Wei Liu, Steven C. H. Hoi, Jianzhuang Liu

Research Collection School Of Computing and Information Systems

Distance metric learning has been widely investigated in machine learning and information retrieval. In this paper, we study a particular content-based image retrieval application of learning distance metrics from historical relevance feedback log data, which leads to a novel scenario called collaborative image retrieval. The log data provide the side information expressed as relevance judgements between image pairs. Exploiting the side information as well as inherent neighborhood structures among examples, we design a convex regularizer upon which a novel distance metric learning approach, named output regularized metric learning, is presented to tackle collaborative image retrieval. Different from previous distance metric …


An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu Oct 2008

An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu

Research Collection School Of Computing and Information Systems

The key challenge with 3D deformable surface tracking arises from the difficulty in estimating a large number of 3D shape parameters from noisy observations. A recent state-of-the-art approach attacks this problem by formulating it as a Second Order Cone Programming (SOCP) feasibility problem. The main drawback of this solution is the high computational cost. In this paper, we first reformulate the problem into an unconstrained quadratic optimization problem. Instead of handling a large set of complicated SOCP constraints, our new formulation can be solved very efficiently by resolving a set of sparse linear equations. Based on the new framework, a …


Structuring Low-Quality Videotaped Lectures For Cross-Reference Browsing By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong Oct 2008

Structuring Low-Quality Videotaped Lectures For Cross-Reference Browsing By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

This paper presents an unified approach in analyzing and Structuring the content of videotaped lectures for distance learning applications. By Structuring lecture videos, we can Support topic indexing and semantic querying of multimedia documents captured in the traditional classrooms. Our goal in this paper is to automatically construct the cross references of lecture videos and textual documents so as to facilitate the synchronized browsing and presentation of multimedia information. The major issues involved in our approach are topical event detection, video text analysis and the matching of slide shots and external documents. In topical event detection, a novel transition detector …


Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo Oct 2008

Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a novel approach to exploit the ontological relationship of visual words by linguistic reasoning. A visual word ontology is constructed to facilitate the rigorous evaluation of linguistic similarity across visual words. The linguistic similarity measurement enables cross-bin matching of visual words, compromising the effectiveness and speed of conventional keypoint matching and bag-of-word approaches. A constraint EMD is proposed and experimented to efficiently match visual words. Empirical findings indicate that the proposed approach offers satisfactory performance to near-duplicate retrieval, while still enjoying the merit of speed efficiency compared with other techniques.


Remote Attestation On Program Execution, Liang Gu, Xuhua Ding, Robert H. Deng, Bing Xie, Hong Mei Oct 2008

Remote Attestation On Program Execution, Liang Gu, Xuhua Ding, Robert H. Deng, Bing Xie, Hong Mei

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 …


Using English Information In Non-English Web Search, Wei Gao, Wei Gao, Ming Zhou Oct 2008

Using English Information In Non-English Web Search, Wei Gao, Wei Gao, Ming Zhou

Research Collection School Of Computing and Information Systems

The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is that they are designed around features such as PageRank, automatic query and domain taxonomies, and click-through information, etc. Unfortunately, many of these features are absent or altered in other languages. In this work, we show how to exploit these English features for a subset of Chinese queries which we call linguistically non-local (LNL). LNL Chinese queries have a minimally ambiguous English translation which also functions as a good English query. We first …


Using Trusted Computing Technology To Facilitate Security Enforcement In Wireless Sensor Networks, Yanjiang Yang, Robert H. Deng, Feng Bao, Jianying Zhou Oct 2008

Using Trusted Computing Technology To Facilitate Security Enforcement In Wireless Sensor Networks, Yanjiang Yang, Robert H. Deng, Feng Bao, Jianying Zhou

Research Collection School Of Computing and Information Systems

Security enforcement in wireless sensor networks is by no means an easy task, due to the inherent resource-constrained nature of sensor nodes. To facilitate security enforcement, we propose to incorporate more powerful high-end Security Enforcement Facilitators (SEFs) into wireless sensor networks. In particular, the SEFs are equipped with TCG-compliant Trusted Platform Modules (TPMs) to protect cryptographic secrets, perform authenticated booting and attest their platform state to a remote base station.As such, the SEFs act as online trusted third parties toeffectively monitor the states of sensor nodes, help in keymanagement, simplify secure routing, and facilitate accesscontrol.


Leveraging Social Context For Searching Social Media, Marc Smith, Vladimir Barash, Lise Getoor, Hady W. Lauw Oct 2008

Leveraging Social Context For Searching Social Media, Marc Smith, Vladimir Barash, Lise Getoor, Hady W. Lauw

Research Collection School Of Computing and Information Systems

The ability to utilize and benefit from today's explosion of social media sites depends on providing tools that allow users to productively participate. In order to participate, users must be able to find resources (both people and information) that they find valuable. Here, we argue that in order to do this effectively, we should make use of a user's "social context". A user's social context includes both their personal social context (their friends and the communities to which they belong) and their community social context (their role and identity in different communities).


Bayesian Tensor Approach For 3-D Face Modeling, Dacheng Tao, Mingli Song, Xuelong Li, Jialie Shen, Jimeng Sun, Xindong Wu, Christos Faloutsos, Stephen J. Maybank Oct 2008

Bayesian Tensor Approach For 3-D Face Modeling, Dacheng Tao, Mingli Song, Xuelong Li, Jialie Shen, Jimeng Sun, Xindong Wu, Christos Faloutsos, Stephen J. Maybank

Research Collection School Of Computing and Information Systems

Effectively modeling a collection of three-dimensional (3-D) faces is an important task in various applications, especially facial expression-driven ones, e.g., expression generation, retargeting, and synthesis. These 3-D faces naturally form a set of second-order tensors-one modality for identity and the other for expression. The number of these second-order tensors is three times of that of the vertices for 3-D face modeling. As for algorithms, Bayesian data modeling, which is a natural data analysis tool, has been widely applied with great success; however, it works only for vector data. Therefore, there is a gap between tensor-based representation and vector-based data analysis …


Comparison Of Online Social Relations In Volume Vs Interaction: A Case Study Of Cyworld, Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue Moon, Hawoong. Jeong Oct 2008

Comparison Of Online Social Relations In Volume Vs Interaction: A Case Study Of Cyworld, Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue Moon, Hawoong. Jeong

Research Collection School Of Computing and Information Systems

Online social networking services are among the most popular Internet services according to Alexa.com and have become a key feature in many Internet services. Users interact through various features of online social networking services: making friend relationships, sharing their photos, and writing comments. These friend relationships are expected to become a key to many other features in web services, such as recommendation engines, security measures, online search, and personalization issues. However, we have very limited knowledge on how much interaction actually takes place over friend relationships declared online. A friend relationship only marks the beginning of online interaction.Does the interaction …


Understanding Evolution In Technology Ecosystems, Gediminas Adomavicius, Jesse Bockstedt, Alok Gupta, Robert J. Kauffman Oct 2008

Understanding Evolution In Technology Ecosystems, Gediminas Adomavicius, Jesse Bockstedt, Alok Gupta, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

The current environment of information technology can be a complex place for analysts and firms to navigate, especially when making decisions about new product development, technology investment, and technology planning. Many industry analysts recognize that it is difficult, if not impossible, to accurately predict future technological advances. However, successful firms need to understand the nature of technological change and evolution in order to accurately forecast and take advantage of investment and market opportunities. For example, although RFID has been in the news for the past decade as the potential distribution and retail "killer technology", uncertainties about its future technical capabilities, …


Near-Duplicate Keyframe Retrieval By Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan Oct 2008

Near-Duplicate Keyframe Retrieval By Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Near-duplicate image retrieval plays an important role in many real-world multimedia applications. Most previous approaches have some limitations. For example, conventional appearance-based methods may suffer from the illumination variations and occlusion issue, and local feature correspondence-based methods often do not consider local deformations and the spatial coherence between two point sets. In this paper, we propose a novel and effective Nonrigid Image Matching (NIM) approach to tackle the task of near-duplicate keyframe retrieval from real-world video corpora. In contrast to previous approaches, the NIM technique can recover an explicit mapping between two near-duplicate images with a few deformation parameters and …


Spatio-Temporal Efficiency In A Taxi Dispatch System, Darshan Santani, Rajesh Krishna Balan, C. Jason Woodard Oct 2008

Spatio-Temporal Efficiency In A Taxi Dispatch System, Darshan Santani, Rajesh Krishna Balan, C. Jason Woodard

Research Collection School Of Computing and Information Systems

In this paper, we present an empirical analysis of the GPS-enabled taxi dispatch system used by the world’s second largest land transportation company. We first summarize the collective dynamics of the more than 6,000 taxicabs in this fleet. Next, we propose a simple method for evaluating the efficiency of the system over a given period of time and geographic zone. Our method yields valuable insights into system performance—in particular, revealing significant inefficiencies that should command the attention of the fleet operator. For example, despite the state of the art dispatching system employed by the company, we find imbalances in supply …


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 …


Model Checking Csp Revisited: Introducing A Process Analysis Toolkit, Jun Sun, Yang Liu, Jin Song Dong Oct 2008

Model Checking Csp Revisited: Introducing A Process Analysis Toolkit, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

FDR, initially introduced decades ago, is the de facto analyzer for Communicating Sequential Processes (CSP). Model checking techniques have been evolved rapidly since then. This paper describes PAT, i.e., a process analysis toolkit which complements FDR in several aspects. PAT is designed to analyze event-based compositional system models specified using CSP as well as shared variables and asynchronous message passing. It supports automated refinement checking, model checking of LTL extended with events, etc. In this paper, we highlight how partial order reduction is applied to improve refinement checking in PAT. Experiment results show that PAT outperforms FDR in some cases.


Impacts Of Information And Communication Technologies On Country Development: Accounting For Area Interrelationships, Robert J. Kauffman, Ajay Kumar Oct 2008

Impacts Of Information And Communication Technologies On Country Development: Accounting For Area Interrelationships, Robert J. Kauffman, Ajay Kumar

Research Collection School Of Computing and Information Systems

Single-item composite indices gauge ICT readiness at the country level but do not represent the direct impact of ICTs on a country's development. This paper describes a new approach to measuring the macrolevel impacts of ICTs across a range of development areas. The indirect effects of one area on others is taken into consideration by a simultaneous equation model that permits the inclusion of multiple development areas. The model is applied to data pertaining to four development areas in 64 countries: trade flows, agricultural productivity, R&D, and quality of life. ICT readiness is found to have a positive association with …


A Study Of Early Stage Game Design And Prototyping, Brien Colwell, Richard C. Davis, James A. Landay Oct 2008

A Study Of Early Stage Game Design And Prototyping, Brien Colwell, Richard C. Davis, James A. Landay

Research Collection School Of Computing and Information Systems

Computer games and simulations can be valuable teaching and communication tools, and they are a powerful form of self-expression. Unfortunately, creating games requires programming, and programming requires time and skill. Some tools facilitate game creation to motivate novice programmers, but programming is still necessary. Other systems require less programming, but they are narrowly focused. To enable faster, simpler, and more expressive tools for professionals and amateurs, we have explored the processes and tools used in the early stages of game and simulation design. Interviews with educators clarified the uses of simulations in the classroom, while interviews with professional game designers …


Determining The Number Of Bp Neural Network Hidden Layer Units, Huayu Shen, Zhaoxia Wang, Chengyao Gao, Juan Qin, Fubin Yao, Wei Xu Oct 2008

Determining The Number Of Bp Neural Network Hidden Layer Units, Huayu Shen, Zhaoxia Wang, Chengyao Gao, Juan Qin, Fubin Yao, Wei Xu

Research Collection School Of Computing and Information Systems

This paper proposed an improved method to contrapose the problem which is difficult to determine the number of BP neural network hidden layer units. it is proved that the method is efficeient in reducing the frequency of the test through experients, and improves the efficiency of determining the best number of hidden units, which is more valuable in the applications.


Representative Entry Selection For Profiling Blogs, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun, Rong Jin Oct 2008

Representative Entry Selection For Profiling Blogs, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun, Rong Jin

Research Collection School Of Computing and Information Systems

Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of entries. We investigate novel techniques for profiling blogs by selecting a subset of representative entries for each blog. We propose two principles for guiding the entry selection task: representativeness and diversity. Further, we formulate the entry selection task into a combinatorial optimization problem and propose a greedy yet effective algorithm for finding a good approximate solution by exploiting the theory of submodular functions. We suggest blog classification for judging the …


Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu Oct 2008

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …


Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao Oct 2008

Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach to accelerate the matching of two video clips by exploiting the temporal coherence property inherent in the keyframe sequence of a video. Motivated by the fact that keyframe correspondences between near-duplicate videos typically follow certain spatial arrangements, such property could be employed to guide the alignment of two keyframe sequences. We set the alignment problem as an integer quadratic programming problem, where the cost function takes into account both the visual similarity of the corresponding keyframes as well as the alignment distortion among the set of correspondences. The set of keyframe-pairs found …


Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo Oct 2008

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Effective utilization of semantic concept detectors for large-scale video search has recently become a topic of intensive studies. One of main challenges is the selection and fusion of appropriate detectors, which considers not only semantics but also the reliability of detectors, observability and diversity of detectors in target video domains. In this paper, we present a novel fusion technique which considers different aspects of detectors for query answering. In addition to utilizing detectors for bridging the semantic gap of user queries and multimedia data, we also address the issue of "observability gap" among detectors which could not be directly inferred …


An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao Sep 2008

An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by after optimization.


Relative Importance, Specific Investment And Ownership In Interorganizational Systems., Kunsoo Han, Robert J. Kauffman, Barrie R. Nault Sep 2008

Relative Importance, Specific Investment And Ownership In Interorganizational Systems., Kunsoo Han, Robert J. Kauffman, Barrie R. Nault

Research Collection School Of Computing and Information Systems

Implementation and maintenance of interorganizational systems (IOS) require investments by all the participating firms. Compared with intraorganizational systems, however, there are additional uncertainties and risks. This is because the benefits of IOS investment depend not only on a firm's own decisions, but also on those of its business partners. Without appropriate levels of investment by all the firms participating in an IOS, they cannot reap the full benefits. Drawing upon the literature in institutional economics, we examine IOS ownership as a means to induce value-maximizing noncontractible investments. We model the impact of two factors derived from the theory of incomplete …