Search results

This study attempts to discover effective strategies for mobile commerce applications (apps) to grow their consumer base by releasing app strategic updates. Drawing on the landscape search model from strategy research, this study conceptualizes mobile app update strategy as three interdependent decisions, i.e. what business elements are changed in an app strategic update, how substantial the changes are and when strategic updates are released relative to the competitive environment.

Using a field data set of 1,500 strategic updates of seven rival apps in the mobile travel market, this study integrated fuzzy set qualitative comparative analysis (fsQCA) with econometric analysis to analyze how app strategic update decisions interdependently influence app performance.

This study identified three effective and one ineffective mobile app update strategies from the mixed-method analysis, which verified the complex interdependency of app strategic update decisions. A general takeaway from these strategies is that a complex strategy problem on the mobile platform must be solved with respect to the constraints and capabilities of mobile technology.

This study moves beyond a linear view of the relationship between app update frequency and app performance and provides a holistic view of how and why app strategic update decisions mutually influence one another in their impact on app performance. This work makes contributions by identifying interdependency as a conceptual bridge between strategy and mobile app literature and developing an empirically testable version of the landscape search model.

Network embeddedness has been widely considered in enterprise innovation as an effective means of overcoming resource dilemmas. However, while focussing on acquiring external innovation resources, the existing research often ignores the vital role of internal routine updates. Therefore, this study explores the mechanism by which network embeddedness affects innovation performance of enterprises from the perspective of organisational routine updating.

This paper proposes a theoretical model based on social network theory and organisational routines–immune response theory. A total of 328 pieces of research data on high-tech enterprises in China were collected, and the hypotheses were verified using hierarchical regression analysis.

The results show that the two forms of network embeddedness – structural embeddedness and relational embeddedness, have a positive effect on enterprise innovation performance and a significant positive effect on organisational routine revision and organisational routine creation. Both organisational routine revision and organisational routine creation positively affect enterprise innovation performance and partially mediate the relationship between network embeddedness and enterprise innovation performance.

This conclusion provides a new perspective on the impact of network embeddedness on enterprise innovation performance and expands the related research on organisational routine updating. This study provides a theoretical reference for high-tech enterprises to improve their competitiveness and innovation performance through network embeddedness and organisational routine updating.

The purpose of this paper is to propose methods for fast incremental indexing with effective and efficient query processing in XML element retrieval. The effectiveness of a search system becomes lower if document updates are not handled when these occur frequently on the Web. The search accuracy is also reduced if drastic changes in document statistics are not managed. However, existing studies of XML element retrieval do not consider document updates, although these studies have attained both effectiveness and efficiency in query processing. Thus, the authors add a function for handling document updates to the existing techniques for XML element retrieval.

Though it will be important to enable fast updates of indices, preliminary experiments have shown that a simple incremental update approach has two problems: some kinds of statistics are inaccurate, and it takes a long time to update indices. Therefore, two methods are proposed: one to approximate term weights accurately with a small number of documents, even for dynamically changing statistics; and the other to eliminate unnecessary update targets.

Experimental results show that this proposed system can update indices up to 32 per cent faster than the simple incremental updates while the search accuracy improved by 4 per cent compared with the simple approach. The proposed methods can also be fast and accurate in query processing, even if document statistics change drastically.

The paper shows that there could be a more practical XML element search engine, which can access the latest XML documents accurately and efficiently.

The dynamic nature of information content on the Web has posed a serious problem to users who need constantly to keep track of the latest updates on specific information. Traditional search engines enable users to retrieve potentially relevant Web information, but they do not track and monitor Web pages based on users’ interests. On the other hand, Web information monitoring systems are designed specifically to help users track and monitor Web information. However, to make Web monitoring effective, it is necessary to identify and understand typical Web page update characteristics so that useful monitoring features and functions can be designed and built into these systems. In this study, a total of 105 Web pages from the Internet were collected and monitored over a one‐month period. These pages are selected from seven domains under Yahoo!’s directories. The analysis results are presented according to Web site domains, Web page types, Web page attributes and change frequency. Based on this study, different functions and features for a Web monitoring system are identified. These features have been incorporated into a Web monitoring system, WebMon, that has been developed at the School of Computer Engineering, Nanyang Technological University, Singapore.

Enterprise knowledge graphs (EKG) in resource description framework (RDF) consolidate and semantically integrate heterogeneous data sources into a comprehensive dataspace. However, to make an external relational data source accessible through an EKG, an RDF view of the underlying relational database, called an RDB2RDF view, must be created. The RDB2RDF view should be materialized in situations where live access to the data source is not possible, or the data source imposes restrictions on the type of query forms and the number of results. In this case, a mechanism for maintaining the materialized view data up-to-date is also required. The purpose of this paper is to address the problem of the efficient maintenance of externally materialized RDB2RDF views.

This paper proposes a formal framework for the incremental maintenance of externally materialized RDB2RDF views, in which the server computes and publishes changesets, indicating the difference between the two states of the view. The EKG system can then download the changesets and synchronize the externally materialized view. The changesets are computed based solely on the update and the source database state and require no access to the content of the view.

The central result of this paper shows that changesets computed according to the formal framework correctly maintain the externally materialized RDB2RDF view. The experiments indicate that the proposed strategy supports live synchronization of large RDB2RDF views and that the time taken to compute the changesets with the proposed approach was almost three orders of magnitude smaller than partial rematerialization and three orders of magnitude smaller than full rematerialization.

The main idea that differentiates the proposed approach from previous work on incremental view maintenance is to explore the object-preserving property of typical RDB2RDF views so that the solution can deal with views with duplicates. The algorithms for the incremental maintenance of relational views with duplicates published in the literature require querying the materialized view data to precisely compute the changesets. By contrast, the approach proposed in this paper requires no access to view data. This is important when the view is maintained externally, because accessing a remote data source may be too slow.

Most current condition‐based maintenance (CBM) systems using proportional hazards model (PHM) assume that enough historical data are available. However, in many practical cases, it is usually costly to collect much historical data prior to real practice (model implementation). This paper aims to focus on the necessity and benefits of updating a PHM with new samples generated in the process of model implementation.

First, an updating scheme is presented and embedded into the entire cycle of PHM establishment, its application/implementation, and its updating. Next, a simulation evaluation is conducted based on a typical degradation model.

By updating a PHM using newly generated samples, the precision and reliability of residual life (RL) prediction can be improved, especially close to system failure.

The current version of PHM is typically for non‐repairable systems or those systems only receiving renewal maintenance. Further research should focus on the inclusion of the effect of imperfect maintenance.

The updating scheme enables maintenance practitioners to more precisely and reliably predict the RL of an in‐operation system, and enhances further CBM decision making.

This paper highlights the necessity and benefits of updating a PHM using emerging new training resources, which has not received enough attention in existing research/practice of a PHM.

This article seeks to examine the reference yield calculation method used in crop insurance rating and provides recommendations that could potentially improve actuarial performance of the Federal crop insurance program.

Conceptual, numerical, and statistical analysis is utilized to evaluate the reference yield calculation method used in the US Federal crop insurance program.

The results suggest that reference yields, which at the time of this study are calculated using National Agricultural Statistics Service (NASS) data, do not accurately represent the average actual yields of the insured pool of producers in the Federal crop insurance program. In addition, it is found that not regularly updating these NASS‐based reference yields exacerbates this problem because these reference yields do not appropriately represent the current state of technological progress.

The empirical analysis leads this paper to recommend a reference yield calculation procedure that utilizes county‐average yields from the risk management agency (RMA) participation database and an approach that uses spatially aggregated average yields in cases when data for a particular county are sparse.

No previous study has investigated the reference yield calculation method in the Federal crop insurance program using both RMA and NASS data sets. Moreover, this study contributes to the small literature that examines various aspects of the actual production history (APH) rating platform and suggests refinements to improve actuarial performance.

Despite the increasing demand for an effective XML document repository, many are still reluctant to store XML documents in their natural tree form. One main reason is the inadequacy of XML query languages to update the tree‐form XML documents. Even though some of the languages have supported minimum update facilities, they do not concern on preserving the documents constraints. The results are updated documents with very low database integrity. In this paper, we propose a methodology to accommodate XML Update without violating the conceptual constraints of the documents. The method takes form as a set of functions that perform checking mechanisms before update operations. In this paper we discuss the conceptual constraints embedded in three different relationship structures: association, aggregation and inheritance relationship. We highlight four constraints related with association relationship (nuber of participants, referential integrity, cardinality, and adhesion), five constraints related with aggregation relationship (cardinality, adhesion, ordering, homogeneity and share‐ability) and two constraints related to inheritance relationship (disjoint and number of super‐class). In addition, a specific constraint, which is collection type of children, will also be discussed. The proposed method can be implemented in different ways, for example in this paper we use XQuery language. Since the XML update requires schema, in this paper we also propose the mapping of the these constraints in the conceptual level to the XML Schema. We use XML Schema for structure validation, even though the algorithm can be used by any schema languages.

The purpose of this paper is to deliver empirical data comparing the effects of music with the effects of providing waiting time information on customers who are kept on hold when telephoning their bank. It aims to discover if either has a more positive impact on their affective responses (satisfaction), and to discern if these effects are measurably different to a telephone call without music, or waiting time information, and for different durations of wait.

The methodology is an empirical study using bank customers as participants. Questionnaires and user observations techniques are employed to collect quantitative data which are analysed using repeated measures ANOVAs.

Overall the presence of updates, or music, has a positive influence on satisfaction when compared to just a ringing tone, but for a waiting time of one minute music has no influence on satisfaction. The acceptable waiting time threshold plays a very critical influence on satisfaction with the service. A waiting time above this results in larger differences being observed in the responses to the four treatments, with music and updates both having greater influence. In general, the presence of music and updates are also shown to reduce the overestimation of perceived waiting time.

This paper reports findings from an existing UK telephone banking service with 197 customers in three different locations. Implications from the findings provide insights for telephone service managers when choosing between adopting music or updates for managing on‐hold periods.