Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8526)
- Computer Sciences (8509)
- Databases and Information Systems (3448)
- Software Engineering (2153)
- Artificial Intelligence and Robotics (1686)
-
- Information Security (1060)
- Numerical Analysis and Scientific Computing (1024)
- Graphics and Human Computer Interfaces (926)
- Engineering (887)
- Social and Behavioral Sciences (681)
- Business (641)
- Theory and Algorithms (493)
- Computer Engineering (450)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (178)
- Education (168)
- Management Information Systems (166)
- Data Storage Systems (161)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (107)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (53)
- Visualization (51)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Task analysis (48)
- Anomaly detection (47)
- Twitter (46)
- Feature extraction (45)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 7291 - 7320 of 8567
Full-Text Articles in Entire DC Network
Continuous Visible Nearest Neighbour Queries, Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen
Continuous Visible Nearest Neighbour Queries, Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen
Research Collection School Of Computing and Information Systems
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line segment q, a CVNN query returns a set of (p, R) tuples such that p ? P is the nearest neighbor (NN) to every point r along the interval R ? q as well as p is visible to r. Note that p may be NULL, meaning that all points in P are invisible to all points in R, due to the obstruction of some obstacles in …
Web Query Recommendation Via Sequential Query Prediction, Qi He, Daxin Jiang, Zhen Liao, Steven C. H. Hoi, Kuiyu Chang, Ee Peng Lim, Hang Li
Web Query Recommendation Via Sequential Query Prediction, Qi He, Daxin Jiang, Zhen Liao, Steven C. H. Hoi, Kuiyu Chang, Ee Peng Lim, Hang Li
Research Collection School Of Computing and Information Systems
Web query recommendation has long been considered a key feature of search engines. Building a good Web query recommendation system, however, is very difficult due to the fundamental challenge of predicting users' search intent, especially given the limited user context information. In this paper, we propose a novel "sequential query prediction" approach that tries to grasp a user's search intent based on his/her past query sequence and its resemblance to historical query sequence models mined from massive search engine logs. Different query sequence models were examined, including the naive variable length N-gram model, Variable Memory Markov (VMM) model, and our …
Programmable Presence Virtualization For Next-Generation Context-Based Applications, Arup Acharya, Nilanjan Banerjee, Dipanjan Chakraborty, Koustuv Dasgupta, Archan Misra, Shachi Sharma, Xiping Wang, Charles P. Wright
Programmable Presence Virtualization For Next-Generation Context-Based Applications, Arup Acharya, Nilanjan Banerjee, Dipanjan Chakraborty, Koustuv Dasgupta, Archan Misra, Shachi Sharma, Xiping Wang, Charles P. Wright
Research Collection School Of Computing and Information Systems
Presence, broadly defined as an event publish-notification infrastructure for converged applications, has emerged as a key mechanism for collecting and disseminating context attributes for next-generation services in both enterprise and provider domains. Current presence-based solutions and products lack in the ability to a) support flexible user-defined queries over dynamic presence data and b) derive composite presence from multiple provider domains. Accordingly, current uses of context are limited to individual domains/organizations and do not provide a programmable mechanism for rapid creation of context-aware services. This paper describes a presence virtualization architecture, where a virtualized presence server receives customizable queries from multiple …
Server-Assisted Context-Dependent Pervasive Wellness Monitoring, Archan Misra, Ben Falchuk, Shoshana Loeb
Server-Assisted Context-Dependent Pervasive Wellness Monitoring, Archan Misra, Ben Falchuk, Shoshana Loeb
Research Collection School Of Computing and Information Systems
Recent research on remote health monitoring solutions has focused largely on developing context-dependent, streamprocessing capabilities on a personal mobile hub (typically, a cellphone) for energy-efficient transmission of data collected from a set of body-worn medical sensors. In this paper, we argue that commercial deployment of such pervasive wellness monitoring will require the extension of such ‘context dependency’ to the process of data collection (from the sensors to the mobile device) as well. In particular, the utilization of an individuals non-medical activity context, by the cellphone, in coordination with a backend server, is posited to be the key to supporting important …
A Social Relation Aware Routing Protocol For Mobile Ad Hoc Networks, Jisun An, Yangwoo Ko, Dongman Lee
A Social Relation Aware Routing Protocol For Mobile Ad Hoc Networks, Jisun An, Yangwoo Ko, Dongman Lee
Research Collection School Of Computing and Information Systems
In this paper, we propose a social relation aware routing protocol for mobile ad hoc networks, which is designed for content sharing mobile social applications. Since a content can be shared by a group of users who have similar interests, the similarity of users' interests is a good metric to predict who will consume which contents. Shared interests can be exploited in routing and replication of content request and reply to achieve enhanced efficacy in content sharing. Since routing determines which content will be forwarded by whom, a route selected based on similarity of interest increases the utilization of contents …
Fast Object Search On Road Networks, Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
Fast Object Search On Road Networks, Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
Research Collection School Of Computing and Information Systems
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search space pruning technique and providing a dynamic object mapping mechanism, ROAD is very efficient and flexible for various types of queries, namely, range search and nearest neighbor search, on objects over large-scale networks. ROAD is named after its two components, namely, Route Overlay and Association Directory, designed to address the network traversal and object access aspects of the framework. In ROAD, a large road network is organized as a hierarchy of interconnected regional sub-networks …
Pat: Towards Flexible Verification Under Fairness, Jun Sun, Yang Liu, Jin Song Dong, Jun Pang
Pat: Towards Flexible Verification Under Fairness, Jun Sun, Yang Liu, Jin Song Dong, Jun Pang
Research Collection School Of Computing and Information Systems
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing population protocols. Current practice of system analysis is, however, deficient under fairness. In this work, we present PAT, a toolkit for flexible and efficient system analysis under fairness. A unified algorithm is proposed to model check systems with a variety of fairness effectively in two different settings. Empirical evaluation shows that PAT complements existing model checkers in terms of fairness. We report that previously unknown bugs have been revealed using PAT against systems functioning …
Scale-Rotation Invariant Pattern Entropy For Keypoint-Based Near-Duplicate Detection, Wan-Lei Zhao, Chong-Wah Ngo
Scale-Rotation Invariant Pattern Entropy For Keypoint-Based Near-Duplicate Detection, Wan-Lei Zhao, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Near-duplicate (ND) detection appears as a timely issue recently, being regarded as a powerful tool for various emerging applications. In the Web 2.0 environment particularly, the identification of near-duplicates enables the tasks such as copyright enforcement, news topic tracking, image and video search. In this paper, we describe an algorithm, namely Scale-Rotation invariant Pattern Entropy (SR-PE), for the detection of near-duplicates in large-scale video corpus. SR-PE is a novel pattern evaluation technique capable of measuring the spatial regularity of matching patterns formed by local keypoints. More importantly, the coherency of patterns and the perception of visual similarity, under the scenario …
Team Collaboration In Virtual Worlds: The Role Of Task Complexity, Fiona Fui-Hoon Nah, B. Mennecke, S. Schiller
Team Collaboration In Virtual Worlds: The Role Of Task Complexity, Fiona Fui-Hoon Nah, B. Mennecke, S. Schiller
Research Collection School Of Computing and Information Systems
Virtual worlds are three-dimensional, computer-generated worlds where team collaboration is facilitated through the use of shared virtual space. In this research, we are interested in studying the effect of task complexity on team collaboration. We use a puzzle as the collaboration task and manipulate task complexity using the number of puzzle pieces. We hypothesize that task complexity will influence team cohesion as well as satisfaction with team process and outcome, increase the time taken to complete the task, and increase the relative unevenness in team members' contributions in terms of physical effort to accomplish the task due to the increased …
Real-Time Near-Duplicate Elimination For Web Video Search With Content And Context, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Real-Time Near-Duplicate Elimination For Web Video Search With Content And Context, Xiao Wu, Chong-Wah Ngo, Alexander G. Hauptmann
Research Collection School Of Computing and Information Systems
With the exponential growth of social media, there exist huge numbers of near-duplicate web videos, ranging from simple formatting to complex mixture of different editing effects. In addition to the abundant video content, the social web provides rich sets of context information associated with web videos, such as thumbnail image, time duration and so on. At the same time, the popularity of Web 2.0 demands for timely response to user queries. To balance the speed and accuracy aspects, in this paper, we combine the contextual information from time duration, number of views, and thumbnail images with the content analysis derived …
Learning Image‐Text Associations, Tao Jiang, Ah-Hwee Tan
Learning Image‐Text Associations, Tao Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Web information fusion can be defined as the problem of collating and tracking information related to specific topics on the World Wide Web. Whereas most existing work on Web information fusion has focused on text-based multidocument summarization, this paper concerns the topic of image and text association, a cornerstone of cross-media Web information fusion. Specifically, we present two learning methods for discovering the underlying associations between images and texts based on small training data sets. The first method based on vague transformation measures the information similarity between the visual features and the textual features through a set of predefined domain-specific …
An Examination Of Perceptions Of Male And Female Avatars, D. Dewester, Fiona Fui-Hoon Nah, S. Gervais, Keng Siau
An Examination Of Perceptions Of Male And Female Avatars, D. Dewester, Fiona Fui-Hoon Nah, S. Gervais, Keng Siau
Research Collection School Of Computing and Information Systems
Virtual worlds are three-dimensional, computer-generated worlds in which users take the form of avatars. Through their avatars, users can interact with objects and other avatars in the virtual world. Virtual worlds are growing in importance in both educational institutions and businesses. Educational institutions have adopted virtual worlds as a medium for instructional delivery whereas businesses are using virtual worlds for recruitment, training, collaboration, and marketing. Given these emerging phenomena, a better understanding of behavioral and perceptual issues in virtual worlds is warranted. In this paper, we propose a research model to study gender stereotypicality of male and female avatars and …
Stochastic Modeling Western Paintings For Effective Classification, Jialie Shen
Stochastic Modeling Western Paintings For Effective Classification, Jialie Shen
Research Collection School Of Computing and Information Systems
As one of the most important cultural heritages, classical western paintings have always played a special role in human live and been applied for many different purposes. While image classification is the subject of a plethora of related publications, relatively little attention has been paid to automatic categorization of western classical paintings which could be a key technique of modern digital library, museums and art galleries. This paper studies automatic classification on large western painting image collection. We propose a novel framework to support automatic classification on large western painting image collections. With this framework, multiple visual features can be …
Bmq-Processor: A High-Performance Border Crossing Event Detection Framework For Large-Scale Monitoring Applications, Jinwon Lee, Seungwoo Kang, Youngki Lee, Sangjeong Lee, Junehwa Song
Bmq-Processor: A High-Performance Border Crossing Event Detection Framework For Large-Scale Monitoring Applications, Jinwon Lee, Seungwoo Kang, Youngki Lee, Sangjeong Lee, Junehwa Song
Research Collection School Of Computing and Information Systems
In this paper, we present BMQ-Processor, a high-performance Border-Crossing Event (BCE) detection framework for large-scale monitoring applications. We first characterize a new query semantics, namely, Border Monitoring Query (BMQ), which is useful for BCE detection in many monitoring applications. It monitors the values of data streams and reports them only when data streams cross the borders of its range. We then propose BMQ-Processor to efficiently handle a large number of BMQs over a high volume of data streams. BMQ-Processor efficiently processes BMQs in a shared and incremental manner. It develops and operates over a novel stateful query index, achieving a …
Event-Detecting Multi-Agent Mdps: Complexity And Constant-Factor Approximation, Akshat Kumar, S. Zilberstein
Event-Detecting Multi-Agent Mdps: Complexity And Constant-Factor Approximation, Akshat Kumar, S. Zilberstein
Research Collection School Of Computing and Information Systems
Planning under uncertainty for multiple agents has grown rapidly with the development of formal models such as multi-agent MDPs and decentralized MDPs. But despite their richness, the applicability of these models remains limited due to their computational complexity. We present the class of event-detecting multi-agent MDPs (eMMDPs), designed to detect multiple mobile targets by a team of sensor agents. We show that eMMDPs are NP-Hard and present a scalable 2-approximation algorithm for solving them using matroid theory and constraint optimization. The complexity of the algorithm is linear in the state-space and number of agents, quadratic in the horizon, and exponential …
Offering Rss Feeds: Does It Help To Gain Competitive Advantage?, Dan Ma
Offering Rss Feeds: Does It Help To Gain Competitive Advantage?, Dan Ma
Research Collection School Of Computing and Information Systems
Nowadays, many Websites have adopted the really simple syndication (RSS) technology to deliver online content to visitors. In this paper, I build an analytical model to examine how the offering of RSS feeds impact the number of visitors, total traffic load, and profit of Websites in a competitive setting. I show that although RSS can always attract more visitors, it may reduce the Website's profit. Interestingly, in a competitive market there are cases that the RSS feeds hurt the offering Website but benefit the competing Website instead. The conditions under which these will happen are derived. I also study the …
Multiuser Private Queries Over Encrypted Databases, Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng
Multiuser Private Queries Over Encrypted Databases, Yanjiang Yang, Feng Bao, Xuhua Ding, Robert H. Deng
Research Collection School Of Computing and Information Systems
Searchable encryption schemes allow users to perform keyword-based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multiuser setting. Our results include a set of security notions for multiuser searchable encryption as well as a construction which is provably secure under the newly introduced security notions. We also discuss how …
When Is It Beneficial For A Firm To Pursue A Unified Procurement Strategy For Enterprise Software Solutions?, Robert J. Kauffman, Juliana Y. Tsai
When Is It Beneficial For A Firm To Pursue A Unified Procurement Strategy For Enterprise Software Solutions?, Robert J. Kauffman, Juliana Y. Tsai
Research Collection School Of Computing and Information Systems
The underlying structure of the enterprise software marketplace during the past ten years suggests that the arrangements that firms make with respect to the acquisition of such software capabilities will become increasingly concentrated. This article explores the multiple theoretical rationales and business cases for the move to a unified procurement strategy for enterprise software, reflecting some differences in terms of what might be expected from the predictions of the well known move-to-the-middle hypothesis. Our central argument is that a "move-to-the-middle" with more than just a single vendor is the likely outcome in unconsolidated industry markets. In industries experiencing consolidation, firms …
A Semiotic Analysis Of Unified Modeling Language Graphical Notations, Keng Siau, Yuhong Tian
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 …
Ontology-Based Business Process Customization For Composite Web Services, Qianhui (Althea) Liang, Xindong Wu, E. K. Park, T. Khoshgoftaar, C. Chi
Ontology-Based Business Process Customization For Composite Web Services, Qianhui (Althea) Liang, Xindong Wu, E. K. Park, T. Khoshgoftaar, C. Chi
Research Collection School Of Computing and Information Systems
A key goal of the Semantic Web is to shift social interaction patterns from a producer-centric paradigm to a consumer-centric one. Treating customers as the most valuable assets and making the business models work better for them are at the core of building successful consumer-centric business models. It follows that customizing business processes constitutes a major concern in the realm of a knowledge-pull-based human semantic Web. This paper conceptualizes the customization of service-based business processes leveraging the existing knowledge of Web services and business processes. We represent this conceptualization as a new Extensible Markup Language (XML) markup language Web Ontology …
A Comprehensive Study For Rfid Malwares On Mobile Devices, Qiang Yan, Yingjiu Li, Tieyan Li, Robert Huijie Deng
A Comprehensive Study For Rfid Malwares On Mobile Devices, Qiang Yan, Yingjiu Li, Tieyan Li, Robert Huijie Deng
Research Collection School Of Computing and Information Systems
Radio Frequency Identification (RFID) technique has been widely accepted as wireless identification standard in the business world. While RFID technique enables efficient collection of identification information, it also introduces new security risk due to the emerging of RFID malwares. This risk becomes increasingly severe due to the adoption of internet in RFID applications (e.g., track and trace in EPCglobal network) and the use of mobile devices as RFID readers. The prior work to defend the threat of RFID malwares has mainly focused on the protection of front-end tag-reader communications and back-end database systems. Less work has been conducted to defend …
Quality-Aware Collaborative Question Answering: Methods And Evaluation, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Quality-Aware Collaborative Question Answering: Methods And Evaluation, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Research Collection School Of Computing and Information Systems
Community Question Answering (QA) portals contain questions and answers contributed by hundreds of millions of users. These databases of questions and answers are of great value if they can be used directly to answer questions from any user. In this research, we address this collaborative QA task by drawing knowledge from the crowds in community QA portals such as Yahoo! Answers. Despite their popularity, it is well known that answers in community QA portals have unequal quality. We therefore propose a quality-aware framework to design methods that select answers from a community QA portal considering answer quality in addition to …
Partially Materialized Digest Scheme: An Efficient Verification Method For Outsourced Databases, Kyriakos Mouratidis, Dimitris Sacharidis, Hwee Hwa Pang
Partially Materialized Digest Scheme: An Efficient Verification Method For Outsourced Databases, Kyriakos Mouratidis, Dimitris Sacharidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
In the outsourced database model, a data owner publishes her database through a third-party server; i.e., the server hosts the data and answers user queries on behalf of the owner. Since the server may not be trusted, or may be compromised, users need a means to verify that answers received are both authentic and complete, i.e., that the returned data have not been tampered with, and that no qualifying results have been omitted. We propose a result verification approach for one-dimensional queries, called Partially Materialized Digest scheme (PMD), that applies to both static and dynamic databases. PMD uses separate indexes …
The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau
The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Game theory has gained popularity as an approach to analysing and understanding distributed systems with self-interested agents. Central to game theory is the concept of Nash equilibrium as a stable state (solution) of the system, which comes with a price − the loss in efficiency. The quantification of the efficiency loss is one of the main research concerns. In this paper, we study the quality and computational characteristics of the best Nash equilibrium in two selfish scheduling models: the congestion model and the sequencing model. In particular, we present the following results: (1) In the congestion model: first, the best …
Continuous Monitoring Of Spatial Queries, Kyriakos Mouratidis
Continuous Monitoring Of Spatial Queries, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
No abstract provided.
Efficient Valid Scope Computation For Location-Dependent Spatial Queries In Mobile And Wireless Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Efficient Valid Scope Computation For Location-Dependent Spatial Queries In Mobile And Wireless Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Research Collection School Of Computing and Information Systems
In mobile and wireless environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from similar client positions would normally return the same results, we explore the idea of valid scope, that represents a spatial area in which a set of LDSQs will retrieve exactly the same query results. With a valid scope derived and an LDSQ result cached at the client side, a client …
Chaos And Uncertainty, M. Thulasidas
Chaos And Uncertainty, M. Thulasidas
Research Collection School Of Computing and Information Systems
The end of 2008 in the finance industry can be summarized in two words – chaos and uncertainty. The subprime crisis, where everybody lost; the dizzying commodity price movements; the pink slip syndrome; the spectacular bank busts; and the gargantuan bail-outs all vouch for it.
Distributed Utility-Based Rate Adaptation Protocols For Prioritized, Quasi-Elastic Flows, Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta
Distributed Utility-Based Rate Adaptation Protocols For Prioritized, Quasi-Elastic Flows, Sharanya Eswaran, Matthew P. Johnson, Archan Misra, Thomas La Porta
Research Collection School Of Computing and Information Systems
This paper considers rate adaptation for streaming multimedia data in a wireless sensor network (WSN) consisting of multiple missions, where each mission subscribes to data streams from multiple sensors, and each sensor's data is utilized by multiple heterogenous missions. We specifically consider the application of the distributed network utility maximization (NUM) framework to a previously unconsidered scenario where the different missions have different priorities, as well as minimum utility demands. When all the utility demands are feasible, we first show that the addition of a penalty for failing to reach the minimum utility demand to the base NUM protocol leads …
Integrated Resource Allocation And Scheduling In Bidirectional Flow Shop With Multi-Machine And Cos Constraints, Hoong Chuin Lau, Zhengyi Zhao, Shuzhi Sam Ge
Integrated Resource Allocation And Scheduling In Bidirectional Flow Shop With Multi-Machine And Cos Constraints, Hoong Chuin Lau, Zhengyi Zhao, Shuzhi Sam Ge
Research Collection School Of Computing and Information Systems
An integer programming (IP) model is proposed for integrated resource allocation and operation scheduling for a multiple job-agents system. Each agent handles a specific job-list in a bidirectional flowshop. For the individual agent scheduling problem, a formulation is proposed in continuous time domain and compared with an IP formulation in discrete time domain. Of particular interest is the formulation of the machine utilization function-- both in continuous time and discrete time. Fast heuristic methods are proposed with the relaxation of the machine capacity. For the integrated resource allocation and scheduling problem, a linear programming relaxation approach is applied to solve …
The Architecture Of Platforms: A Unified View, Carliss Y. Baldwin, C. Jason Woodard
The Architecture Of Platforms: A Unified View, Carliss Y. Baldwin, C. Jason Woodard
Research Collection School Of Computing and Information Systems
Product and system designers have long exploited opportunities to create families of complex artifacts by developing and recombining modular components. An especially common design pattern has come to be associated with the concept of a ‘platform’, which we define as a set of stable components that supports variety and evolvability in a system by constraining the linkages among the other components. Our goal in this chapter is to shed light on the relationships between platforms and the systems in which they are embedded, in order to better understand firms and industries where platforms play an important role. We begin by …