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

Computer Sciences Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6721 - 6750 of 8479

Full-Text Articles in Computer Sciences

Smoothly Varying Affine Stitching, Wen-Yan Lin, Siying Liu, Yasuyuki Matsuhita, Tian-Tsong Ng, Loong-Fah Cheong Jun 2011

Smoothly Varying Affine Stitching, Wen-Yan Lin, Siying Liu, Yasuyuki Matsuhita, Tian-Tsong Ng, Loong-Fah Cheong

Research Collection School Of Computing and Information Systems

Traditional image stitching using parametric transforms such as homography, only produces perceptually correct composites for planar scenes or parallax free camera motion between source frames. This limits mosaicing to source images taken from the same physical location. In this paper, we introduce a smoothly varying affine stitching field which is flexible enough to handle parallax while retaining the good extrapolation and occlusion handling properties of parametric transforms. Our algorithm which jointly estimates both the stitching field and correspondence, permits the stitching of general motion source images, provided the scenes do not contain abrupt protrusions.


Towards Human-Like Social Multi-Agents With Memetic Automaton, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Xian-Shun Chen Jun 2011

Towards Human-Like Social Multi-Agents With Memetic Automaton, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Xian-Shun Chen

Research Collection School Of Computing and Information Systems

Memetics is a new science that has attracted increasing attentions in the recent decades. Beyond the formalism of simple hybrids, adaptive hybrids and memetic algorithms, the notion of memetic automaton as an adaptive entity that is self-contained and uses memes as building blocks of information is recently conceptualized in the context of computational intelligence as potential tools for effective problem-solving [1]. Taking this cue, this paper embarks a study on Memetic Multiagent system (MeM) towards human-like social agents with memetic automaton. Particularly, we introduce a potentially rich meme-inspired design and operational model, with Darwin’s theory of natural selections and Dawkins’ …


Fully Secure Cipertext-Policy Hiding Cp-Abe, Junzuo Lai, Robert H. Deng, Yingjiu Li Jun 2011

Fully Secure Cipertext-Policy Hiding Cp-Abe, Junzuo Lai, Robert H. Deng, Yingjiu Li

Research Collection School Of Computing and Information Systems

In ciphertext-policy attributed-based encryption (CP-ABE), each ciphertext is labeled by the encryptor with an access structure (also called ciphertext policy) and each private key is associated with a set of attributes. A user should be able to decrypt a ciphertext if and only if his private key attributes satisfy the access structure.The traditional security property of CP-ABE is plaintext privacy, which ciphertexts reveal no information about the underlying plaintext. At ACNS’08, Nishide, Yoneyama and Ohta introduced the notion of ciphertext-policy hiding CP-ABE. In addition to protecting the privacy of plaintexts, ciphertext-policy hiding CP-ABE also protects the description of the access …


Hierarchical Identity-Based Chameleon Hash And Its Applications, Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao Jun 2011

Hierarchical Identity-Based Chameleon Hash And Its Applications, Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao

Research Collection School Of Computing and Information Systems

At ACNS 2008, Canard et al. introduced the notion of trapdoor sanitizable signature (TSS) based on identity-based chameleon hash (IBCH). Trapdoor sanitizable signatures allow the signer of a message to delegate, at any time, the power of sanitization to possibly several entities who can modify predetermined parts of the message and generate a new signature on the sanitized message without interacting with the original signer. In this paper, we introduce the notion of hierarchical identity-based chameleon hash (HIBCH), which is a hierarchical extension of IBCH. We show that HIBCH can be used to construct other cryptographic primitives, including hierarchical trapdoor …


A Quality Metric For Sustainable Innovations, Arcot Desai Narasimhalu Jun 2011

A Quality Metric For Sustainable Innovations, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Sustainability has become a major concern for nations and firms especially since the Kyoto Protocol was defined in 1997. While there have been several studies on benchmarks for national innovation systems and effectiveness of innovation management within firms there is as yet no reasonable metric for determining the quality of an innovation much less its quality relating to sustainability? Similarly, there have been several studies on sustainability but that such research groups have also not focused on developing a metric for denoting the quality of sustainable innovations. This paper offers a metric that defines the quality of an innovation, especially …


Using Service Responsibility Tables To Supplement Uml In Analyzing E-Service Systems, Xin Tan, Steven Alter, Keng Siau Jun 2011

Using Service Responsibility Tables To Supplement Uml In Analyzing E-Service Systems, Xin Tan, Steven Alter, Keng Siau

Research Collection School Of Computing and Information Systems

This paper proposes using Service Responsibility Tables (SRTs) as a tool in analyzing e-service systems. First it discusses difficulties and deficiencies of using formal modeling languages such as UML in analyzing e-service systems. It proposes using SRTs as an informal language and lightweight analytical tool to be used by business professionals in analyzing e-service systems. SRTs are based on a service value chain framework but do not rely on abstract concepts and constructs, and therefore can be used by business professionals to supplement UML. We suggest a set of heuristics for transforming SRTs into two key UML diagrams, thereby illustrating …


On Combining State Space Reductions With Global Fairness Assumptions, Shao Jie Zhang, Jun Sun, Jun Pang, Yang Liu, Jin Song Dong Jun 2011

On Combining State Space Reductions With Global Fairness Assumptions, Shao Jie Zhang, Jun Sun, Jun Pang, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Model checking has established itself as an effective system analysis method, as it is capable of proving/dis-proving properties automatically. Its application to practical systems is however limited by state space explosion. Among effective state reduction techniques are symmetry reduction and partial order reduction. Global fairness often plays a vital role in designing self-stabilizing population protocols. It is known that combining fairness and symmetry reduction is nontrivial. In this work, we first show that global fairness, unlike weak/strong fairness, can be combined with symmetry reduction. We extend the PAT model checker with the technique and demonstrate its usability by verifying recently …


Topical Keyphrase Extraction From Twitter, Xin Zhao, Jing Jiang, Jing He, Yang Song, Palakorn Achananuparp, Ee Peng Lim, Xiaoming Li Jun 2011

Topical Keyphrase Extraction From Twitter, Xin Zhao, Jing Jiang, Jing He, Yang Song, Palakorn Achananuparp, Ee Peng Lim, Xiaoming Li

Research Collection School Of Computing and Information Systems

Summarizing and analyzing Twitter content is an important and challenging task. In this paper, we propose to extract topical keyphrases as one way to summarize Twitter. We propose a context-sensitive topical PageRank method for keyword ranking and a probabilistic scoring function that considers both relevance and interestingness of keyphrases for keyphrase ranking. We evaluate our proposed methods on a large Twitter data set. Experiments show that these methods are very effective for topical keyphrase extraction.


Optimizing Sensor Data Acquisition For Energy-Efficient Smartphone-Based Continuous Event Processing, Archan Misra, Lipyeow Lim Jun 2011

Optimizing Sensor Data Acquisition For Energy-Efficient Smartphone-Based Continuous Event Processing, Archan Misra, Lipyeow Lim

Research Collection School Of Computing and Information Systems

Many pervasive applications, such as activity recognition or remote wellness monitoring, utilize a personal mobile device (aka smartphone) to perform continuous processing of data streams acquired from locally-connected, wearable, sensors. To ensure the continuous operation of such applications on a battery-limited mobile device, it is essential to dramatically reduce the energy overhead associated with the process of sensor data acquisition and processing. To achieve this goal, this paper introduces a technique of "acquisition-cost" aware continuous query processing, as part of the Acquisition Cost-Aware Query Adaptation (ACQUA) framework. ACQUA replaces the current paradigm, where the data is typically streamed (pushed) from …


Adaptive Display Power Management For Mobile Games, Bhojan Anand, Karthik Thirugnanam, Jeena Sebastian, Pravein G. Kannan, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan Jun 2011

Adaptive Display Power Management For Mobile Games, Bhojan Anand, Karthik Thirugnanam, Jeena Sebastian, Pravein G. Kannan, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

In this paper, we show how tone mapping techniques can be used to dynamically increase the image brightness, thus allowing the LCD backlight levels to be reduced. This saves significant power as the majority of the LCD’s display power is consumed by its backlight. The Gamma function (or equivalent) can be efficiently implemented in smartphones with minimal resource cost. We describe how we overcame the Gamma function’s non-linear nature by using adaptive thresholds to apply different Gamma values to images with differing brightness levels. These adaptive thresholds allow us to save significant amounts of power while preserving the image quality. …


Getting To Global Yes! Designing A Distributed Student Collaboration, Selma Limam Mansar, Randy Weinberg, Benjamin Kok Siew Gan Jun 2011

Getting To Global Yes! Designing A Distributed Student Collaboration, Selma Limam Mansar, Randy Weinberg, Benjamin Kok Siew Gan

Research Collection School Of Computing and Information Systems

The authors have taught a course called 'Global Project Management' for four years, engaging students in three international locations in hands-on distance projects. The distance projects are intended to provide students with enriching, realistic global project experience. With experience, improved planning and better coordination, each iteration of the distance projects has improved. In this paper, the authors present lessons learned and a mind map demonstrating key aspects of design of global hands-on projects.


Kb-Anonymity: A Model For Anonymized Behavior-Preserving Test And Debugging Data, Aditya Budi, David Lo, Lingxiao Jiang, Lucia Lucia Jun 2011

Kb-Anonymity: A Model For Anonymized Behavior-Preserving Test And Debugging Data, Aditya Budi, David Lo, Lingxiao Jiang, Lucia Lucia

Research Collection School Of Computing and Information Systems

It is often very expensive and practically infeasible to generate test cases that can exercise all possible program states in a program. This is especially true for a medium or large industrial system. In practice, industrial clients of the system often have a set of input data collected either before the system is built or after the deployment of a previous version of the system. Such data are highly valuable as they represent the operations that matter in a client's daily business and may be used to extensively test the system. However, such data often carries sensitive information and cannot …


A Solution With Security Concern For Rfid-Based Track And Trace Services In Epcglobal-Enabled Supply Chains, Wei He, Yingjiu Li, Kevin Chiew, Tieyan Li, Eng Wah Lee Jun 2011

A Solution With Security Concern For Rfid-Based Track And Trace Services In Epcglobal-Enabled Supply Chains, Wei He, Yingjiu Li, Kevin Chiew, Tieyan Li, Eng Wah Lee

Research Collection School Of Computing and Information Systems

A supply chain represents the flow of materials, information, and finance as they move through supply chain partners such as manufacturers, suppliers, distributors, retailers, and consumers. The track & trace services in supply chains can help improve supply chain visibility and efficiency, and prevent counterfeiting and stealing of products thus enhance security. Track & trace services in supply chains require identification of items, capture of events as items move through supply chains, and query of events of items. RFID (radio frequency identification) is a technology that allows to identify objects simultaneously in a fully automated manner via radio waves. This …


Supervisory Evolutionary Optimization Strategy For Adaptive Maintenance Schedules, Zhaoxia Wang, C. S. Chang Jun 2011

Supervisory Evolutionary Optimization Strategy For Adaptive Maintenance Schedules, Zhaoxia Wang, C. S. Chang

Research Collection School Of Computing and Information Systems

No abstract provided.


Real-Time Trip Information Service For A Large Taxi Fleet, Rajesh Krishna Balan, Nguyen Xuan Khoa, Lingxiao Jiang Jun 2011

Real-Time Trip Information Service For A Large Taxi Fleet, Rajesh Krishna Balan, Nguyen Xuan Khoa, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

In this paper, we describe the design, analysis, implementation, and operational deployment of a real-time trip information system that provides passengers with the expected fare and trip duration of the taxi ride they are planning to take. This system was built in cooperation with a taxi operator that operates more than 15,000 taxis in Singapore. We first describe the overall system design and then explain the efficient algorithms used to achieve our predictions based on up to 21 months of historical data consisting of approximately 250 million paid taxi trips. We then describe various optimisations (involving region sizes, amount of …


Online Fault Detection Of Induction Motors Using Frequency Domain Independent Components Analysis, Zhaoxia Wang, C. S. Chang Jun 2011

Online Fault Detection Of Induction Motors Using Frequency Domain Independent Components Analysis, Zhaoxia Wang, C. S. Chang

Research Collection School Of Computing and Information Systems

This paper proposes an online fault detection method for induction motors using frequency-domain independent component analysis. Frequency-domain results, which are obtained by applying Fast Fourier Transform (FFT) to measured stator current time-domain waveforms, are analyzed with the aim of extracting frequency signatures of healthy and faulty motors with broken rotor-bar or bearing problem. Independent components analysis (ICA) is applied for such an aim to the FFT results. The obtained independent components as well as the FFT results are then used to obtain the combined fault signatures. The proposed method overcomes problems occurring in many existing FFT-based methods. Results using laboratory-collected …


A Feature Based Frequency Domain Analysis Algorithm For Fault Detection Of Induction Motors, Zhaoxia Wang, C. S. Chang, Zhang Yifan Jun 2011

A Feature Based Frequency Domain Analysis Algorithm For Fault Detection Of Induction Motors, Zhaoxia Wang, C. S. Chang, Zhang Yifan

Research Collection School Of Computing and Information Systems

This paper studies the stator currents collected from several inverter-fed laboratory induction motors and proposes a new feature based frequency domain analysis method for performing the detection of induction motor faults, such as the broken rotor-bar or bearing fault. The mathematical formulation is presented to calculate the features, which are called FFT-ICA features in this paper. The obtained FFT-ICA features are normalized by using healthy motor as benchmarks to establish a feature database for fault detection. Compare with conventional frequency-domain analysis method, no prior knowledge of the motor parameters or other measurements are required for calculating features. Only one phase …


Query Weighting For Ranking Model Adaptation, Peng Cai, Wei Gao, Aoying Zhou, Kam-Fai Wong Jun 2011

Query Weighting For Ranking Model Adaptation, Peng Cai, Wei Gao, Aoying Zhou, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

We propose to directly measure the importance of queries in the source domain to the target domain where no rank labels of documents are available, which is referred to as query weighting. Query weighting is a key step in ranking model adaptation. As the learning object of ranking algorithms is divided by query instances, we argue that it’s more reasonable to conduct importance weighting at query level than document level. We present two query weighting schemes. The first compresses the query into a query feature vector, which aggregates all document instances in the same query, and then conducts query weighting …


Getting To Know Social Media Analytics, Tin Seong Kam May 2011

Getting To Know Social Media Analytics, Tin Seong Kam

Research Collection School Of Computing and Information Systems

Over the last five years, the unprecedented development and use of social mediating technologies such as blog, wiki, Facebook, and Tweeter have engendered radically new ways of working, playing, and creating meaning, leaving an indelible mark on nearly every domain imaginable. Despite the growing ubiquity of social mediating technologies, their potential has hardly been tapped. Effectively using data collected from social mediating technologies by the business community is far from trivial. This is mainly due to the general lack of awareness on Social Network Analysis (SNA) techniques and technologies among the business analysts and practitioners. This presentation aims to provide …


Continuous Nearest Neighbor Search In The Presence Of Obstacles, Yunjun Gao, Baihua Zheng, Gang Chen, Chun Chen, Qing Li May 2011

Continuous Nearest Neighbor Search In The Presence Of Obstacles, Yunjun Gao, Baihua Zheng, Gang Chen, Chun Chen, Qing Li

Research Collection School Of Computing and Information Systems

Despite the ubiquity of physical obstacles (e.g., buildings, hills, and blindages, etc.) in the real world, most of spatial queries ignore the obstacles. In this article, we study a novel form of continuous nearest-neighbor queries in the presence of obstacles, namely continuous obstructed nearest-neighbor (CONN) search, which considers the impact of obstacles on the distance between objects. Given a data setP, an obstacle set O, and a query line segment q, in a two-dimensional space, a CONN query retrieves the nearest neighbor p ∈ P of each point p′ on q according to the obstructed distance, the shortest path between …


Measuring Api Documentation On The Web, Chris Parnin, Christoph Treude May 2011

Measuring Api Documentation On The Web, Chris Parnin, Christoph Treude

Research Collection School Of Computing and Information Systems

Software development blogs, developer forums and Q&A websites are changing the way software is documented. With these tools, developers can create and communicate knowledge and experiences without relying on a central authority to provide official documentation. Instead, any content created by a developer is just a web search away. To understand whether documentation via social media can replace or augment more traditional forms of documentation, we study the extent to which the methods of one particular API — jQuery — are documented on the Web. We analyze 1,730 search results and show that software development blogs in particular cover 87.9% …


Second International Workshop On Web 2.0 For Software Engineering (Web2se 2011), Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black May 2011

Second International Workshop On Web 2.0 For Software Engineering (Web2se 2011), Christoph Treude, Margaret-Anne Storey, Arie Van Deursen, Andrew Begel, Sue Black

Research Collection School Of Computing and Information Systems

Social software is built around an "architecture of participation" where user data is aggregated as a side-effect of using Web 2.0 applications. Web 2.0 implies that processes and tools are socially open, and that content can be used in several different contexts. Web 2.0 tools and technologies support interactive information sharing, data interoperability and user centered design. For instance, wikis, blogs, tags and feeds help us organize, manage and categorize content in an informal and collaborative way. Some of these technologies have made their way into collaborative software development processes and development platforms. These processes and environments are just scratching …


Prototyping Video Games With Animation, Richard C. Davis May 2011

Prototyping Video Games With Animation, Richard C. Davis

Research Collection School Of Computing and Information Systems

This paper outlines a proposed design for StorySketch, a new video game storyboarding system. StorySketch borrows ideas from the K-Sketch animation sketching system, which allows short animations to be created in minutes or seconds. We build on K-Sketch in four ways. key frame animation capabilities, a branching timeline view, microphone and web-cam support, and hooks to connect to online game design documents.


Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein May 2011

Message-Passing Algorithms For Large Structured Decentralized Pomdps, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Decentralized POMDPs provide a rigorous framework for multi-agent decision-theoretic planning. However, their high complexity has limited scalability. In this work, we present a promising new class of algorithms based on probabilistic inference for infinite-horizon ND-POMDPs---a restricted Dec-POMDP model. We first transform the policy optimization problem to that of likelihood maximization in a mixture of dynamic Bayes nets (DBNs). We then develop the Expectation-Maximization (EM) algorithm for maximizing the likelihood in this representation. The EM algorithm for ND-POMDPs lends itself naturally to a simple message-passing paradigm guided by the agent interaction graph. It is thus highly scalable w.r.t. the number of …


Fragile Online Relationship: A First Look At Unfollow Dynamics In Twitter, Haewoon Kwak, Hyunwoo Chun, Sue. Moon May 2011

Fragile Online Relationship: A First Look At Unfollow Dynamics In Twitter, Haewoon Kwak, Hyunwoo Chun, Sue. Moon

Research Collection School Of Computing and Information Systems

We analyze the dynamics of the behavior known as 'unfollow' in Twitter. We collected daily snapshots of the online relationships of 1.2 million Korean-speaking users for 51 days as well as all of their tweets. We found that Twitter users frequently unfollow. We then discover the major factors, including the reciprocity of the relationships, the duration of a relationship, the followees' informativeness, and the overlap of the relationships, which affect the decision to unfollow. We conduct interview with 22 Korean respondents to supplement the quantitative results.They unfollowed those who left many tweets within a short time, created tweets about uninteresting …


Beespace Navigator: Exploratory Analysis Of Gene Function Using Semantic Indexing Of Biological Literature, Moushumi Sen Sarma, David Arcoleo, Radhika S. Khetani, Brant Chee, Xu Ling, Xin He, Jing Jiang, Qiaozhu Mei, Chengxiang Zhai, Bruce Schatz May 2011

Beespace Navigator: Exploratory Analysis Of Gene Function Using Semantic Indexing Of Biological Literature, Moushumi Sen Sarma, David Arcoleo, Radhika S. Khetani, Brant Chee, Xu Ling, Xin He, Jing Jiang, Qiaozhu Mei, Chengxiang Zhai, Bruce Schatz

Research Collection School Of Computing and Information Systems

With the rapid decrease in cost of genome sequencing, the classification of gene function is becoming a primary problem. Such classification has been performed by human curators who read biological literature to extract evidence. BeeSpace Navigator is a prototype software for exploratory analysis of gene function using biological literature. The software supports an automatic analogue of the curator process to extract functions, with a simple interface intended for all biologists. Since extraction is done on selected collections that are semantically indexed into conceptual spaces, the curation can be task specific. Biological literature containing references to gene lists from expression experiments …


Double Updating Online Learning, Peilin Zhao, Steven C. H. Hoi, Rong Jin May 2011

Double Updating Online Learning, Peilin Zhao, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

In most kernel based online learning algorithms, when an incoming instance is misclassified, it will be added into the pool of support vectors and assigned with a weight, which often remains unchanged during the rest of the learning process. This is clearly insufficient since when a new support vector is added, we generally expect the weights of the other existing support vectors to be updated in order to reflect the influence of the added support vector. In this paper, we propose a new online learning method, termed Double Updating Online Learning, or DUOL for short, that explicitly addresses this problem. …


Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig May 2011

Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig

Research Collection School Of Computing and Information Systems

Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-space ADOPT and any-space BnB-ADOPT to find cost-minimal solutions for all DCOPs in the sequence faster than by solving each DCOP individually. This procedure allows those agents that are guaranteed to remain unaffected by a change to reuse their lower and upper …


Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri May 2011

Distributed Model Shaping For Scaling To Decentralized Pomdps With Hundreds Of Agents, Prasanna Velagapudi, Pradeep Reddy Varakantham, Katia Sycara, Paul Scerri

Research Collection School Of Computing and Information Systems

The use of distributed POMDPs for cooperative teams has been severely limited by the incredibly large joint policy- space that results from combining the policy-spaces of the individual agents. However, much of the computational cost of exploring the entire joint policy space can be avoided by observing that in many domains important interactions between agents occur in a relatively small set of scenarios, previously defined as coordination locales (CLs) [11]. Moreover, even when numerous interactions might occur, given a set of individual policies there are relatively few actual interactions. Exploiting this observation and building on an existing model shaping algorithm, …


Configuring Global Software Teams: A Multi-Company Analysis Of Productivity, Quality, And Profits, Narayanasamy Ramasubbu, Marcelo Cataldo, Rajesh Krishna Balan, James Herbsleb May 2011

Configuring Global Software Teams: A Multi-Company Analysis Of Productivity, Quality, And Profits, Narayanasamy Ramasubbu, Marcelo Cataldo, Rajesh Krishna Balan, James Herbsleb

Research Collection School Of Computing and Information Systems

In this paper, we examined the impact of project-level configurational choices of globally distributed software teams on project productivity, quality, and profits. Our analysis used data from 362 projects of four different firms. These projects spanned a wide range of programming languages, application domain, process choices, and development sites spread over 15 countries and 5 continents. Our analysis revealed fundamental tradeoffs in choosing configurational choices that are optimized for productivity, quality, and/or profits. In particular, achieving higher levels of productivity and quality require diametrically opposed configurational choices. In addition, creating imbalances in the expertise and personnel distribution of project teams …