Search

E-commerce business process nets (EBPNs) are a novel formal model for describing and validating e-commerce systems including interactive parties such as shopper, merchant, and third-party payment platform. Data errors and nondeterminacy of the data states during the trading process can be depicted with the help of EBPNs. However, the problem about how to analyze EBPNs remains largely open. To analyze their data-liveness, data-boundedness, and reachability, this paper presents two analysis methods. For EBPNs, reachability analysis is proposed based on a 3-D incidence matrix method. Additionally, reduction methods are proposed for a special EBPN. Finally, the validity and reliability of the proposed methods are illustrated via the examples of e-commerce systems. [ABSTRACT FROM PUBLISHER]

van der Aalst et al. proved that the soundness problem is solvable in polynomial time for free-choice workflow nets (FCWF-nets). However, FCWF-nets cannot model most web services composition and interorganizational business processes because the interaction among processes does not usually satisfy the free-choice requirement. Asymmetric-choice workflow nets (ACWF-nets) as a larger class than FCWF-nets can model lots of such cases. Our previous work showed that the (weak) soundness problem is co-NP-hard for three-bounded ACWF-nets. Later, Tiplea et al. proved that for three-bounded acyclic ACWF-nets, the weak soundness problem is co-NP-complete. We sharp these results in this paper. First, we prove that for ACWF-nets, whether they are one-bounded or k -bounded ( k~\boldsymbol > 1 ), the soundness problem is co-NP-hard. Second, it is proven that the soundness is equivalent to the weak soundness for any acyclic ACWF-nets, i.e., an acyclic ACWF-net is sound if and only if it is weakly sound. [ABSTRACT FROM AUTHOR]

Database technology affects many disciplines beyond computer science and business. This paper describes two animations developed with images and color that visually and dynamically introduce fundamental relational database concepts and querying to students of many majors. The goal is for educators in diverse academic disciplines to incorporate the animations in their existing courses in order to meet their pedagogical needs. The introduction of the animations was assessed and evaluated within several contexts, including non-majors courses offered by computer scientists as well as a course on computational molecular biology. The evaluation indicated that student knowledge of fundamental database concepts improved significantly with the use of the courseware. The animations provide visual learners with an engaging method to learn the topics presented with the ability to replay the dynamic presentation. Overall, the evaluation indicates the accessibility of database topics across the disciplines as well as the specific concepts that need further elaboration. [ABSTRACT FROM AUTHOR]

Despite a variety of management tools, valuable management prescriptions, and the desire of information technology (IT) managers and business managers alike to build a better relationship, the current state of the IT-business relationship is far from ideal. Although many believe the difficulty in managing this relationship is rooted in differences in knowledge, culture, motivation, and language, we argue in this paper that the key to managing relationships is in the frame of reference and that a marketing perspective can prove valuable. We outline how concepts from marketing (e.g., price, product, customer, place, and promotion) are useful within an IT context and propose a marketing maturity model for IT executives to assess how to enhance their relationship with their business counterparts. [ABSTRACT FROM AUTHOR]

This section provides an overview of several articles on deep computing or high-performance computing which are applied to problems that require significant computing resources in order to facilitate relatively complex decision-making in fields ranging from business to the sciences. The papers capture a few illustrations of deep computing that cut across traditional disciplines. Deep computing requires not only massive amounts of computing,but also the processing of vast amounts of data and the use of sophisticated means for the interpretation of results. New algorithmic approaches are being developed that take into account computer architecture in order to address problems of general interest and answer questions that have impact beyond just scientific inquiry. The paper by Crivelli and Head-Gordon discusses a load-balancing technique to exploit the use of parallel architectures for addressing protein structure problems. In their paper, Fann et al. investigate multiwavelet approaches and apply them to areas of computational chemistry, computational electromagnetics, and fluid dynamics. Newns et al. discuss new algorithmic techniques they have developed for improving magnetic recording simulation. The applicability of deep computing to astrophysics is illustrated by the paper by Lake et al. The authors apply new algorithms coupled with deep computing to advance our understanding of the N-body problem.