Matching Items (3)
Filtering by
- All Subjects: Computer networks--Security measures.
- All Subjects: Text-mining
- Creators: Santanam, Raghu
Description
Mobile applications (Apps) markets with App stores have introduced a new approach to define and sell software applications with access to a large body of heterogeneous consumer population. Several distinctive features of mobile App store markets including – (a) highly heterogeneous consumer preferences and values, (b) high consumer cognitive burden of searching a large selection of similar Apps, and (c) continuously updateable product features and price – present a unique opportunity for IS researchers to investigate theoretically motivated research questions in this area. The aim of this dissertation research is to investigate the key determinants of mobile Apps success in App store markets. The dissertation is organized into three distinct and related studies. First, using the key tenets of product portfolio management theory and theory of economies of scope, this study empirically investigates how sellers’ App portfolio strategies are associated with sales performance over time. Second, the sale performance impacts of App product cues, generated from App product descriptions and offered from market formats, are examined using the theories of market signaling and cue utilization. Third, the role of App updates in stimulating consumer demands in the presence of strong ranking effects is appraised. The findings of this dissertation work highlight the impacts of sellers’ App assortment, strategic product description formulation, and long-term App management with price/feature updates on success in App market. The dissertation studies make key contributions to the IS literature by highlighting three key managerially and theoretically important findings related to mobile Apps: (1) diversification across selling categories is a key driver of high survival probability in the top charts, (2) product cues strategically presented in the descriptions have complementary relationships with market cues in influencing App sales, and (3) continuous quality improvements have long-term effects on App success in the presence of strong ranking effects.
ContributorsLee, Gun Woong (Author) / Santanam, Raghu (Thesis advisor) / Gu, Bin (Committee member) / Park, Sungho (Committee member) / Arizona State University (Publisher)
Created2015
Description
Most existing security decisions for both defending and attacking are made based on some deterministic approaches that only give binary answers. Even though these approaches can achieve low false positive rate for decision making, they have high false negative rates due to the lack of accommodations to new attack methods and defense techniques. In this dissertation, I study how to discover and use patterns with uncertainty and randomness to counter security challenges. By extracting and modeling patterns in security events, I am able to handle previously unknown security events with quantified confidence, rather than simply making binary decisions. In particular, I cope with the following four real-world security challenges by modeling and analyzing with pattern-based approaches: 1) How to detect and attribute previously unknown shellcode? I propose instruction sequence abstraction that extracts coarse-grained patterns from an instruction sequence and use Markov chain-based model and support vector machines to detect and attribute shellcode; 2) How to safely mitigate routing attacks in mobile ad hoc networks? I identify routing table change patterns caused by attacks, propose an extended Dempster-Shafer theory to measure the risk of such changes, and use a risk-aware response mechanism to mitigate routing attacks; 3) How to model, understand, and guess human-chosen picture passwords? I analyze collected human-chosen picture passwords, propose selection function that models patterns in password selection, and design two algorithms to optimize password guessing paths; and 4) How to identify influential figures and events in underground social networks? I analyze collected underground social network data, identify user interaction patterns, and propose a suite of measures for systematically discovering and mining adversarial evidence. By solving these four problems, I demonstrate that discovering and using patterns could help deal with challenges in computer security, network security, human-computer interaction security, and social network security.
ContributorsZhao, Ziming (Author) / Ahn, Gail-Joon (Thesis advisor) / Yau, Stephen S. (Committee member) / Huang, Dijiang (Committee member) / Santanam, Raghu (Committee member) / Arizona State University (Publisher)
Created2014
Description
Service based software (SBS) systems are software systems consisting of services based on the service oriented architecture (SOA). Each service in SBS systems provides partial functionalities and collaborates with other services as workflows to provide the functionalities required by the systems. These services may be developed and/or owned by different entities and physically distributed across the Internet. Compared with traditional software system components which are usually specifically designed for the target systems and bound tightly, the interfaces of services and their communication protocols are standardized, which allow SBS systems to support late binding, provide better interoperability, better flexibility in dynamic business logics, and higher fault tolerance. The development process of SBS systems can be divided to three major phases: 1) SBS specification, 2) service discovery and matching, and 3) service composition and workflow execution. This dissertation focuses on the second phase, and presents a privacy preserving service discovery and ranking approach for multiple user QoS requirements. This approach helps service providers to register services and service users to search services through public, but untrusted service directories with the protection of their privacy against the service directories. The service directories can match the registered services with service requests, but do not learn any information about them. Our approach also enforces access control on services during the matching process, which prevents unauthorized users from discovering services. After the service directories match a set of services that satisfy the service users' functionality requirements, the service discovery approach presented in this dissertation further considers service users' QoS requirements in two steps. First, this approach optimizes services' QoS by making tradeoff among various QoS aspects with users' QoS requirements and preferences. Second, this approach ranks services based on how well they satisfy users' QoS requirements to help service users select the most suitable service to develop their SBSs.
ContributorsYin, Yin (Author) / Yau, Stephen S. (Thesis advisor) / Candan, Kasim (Committee member) / Dasgupta, Partha (Committee member) / Santanam, Raghu (Committee member) / Arizona State University (Publisher)
Created2011