Understanding online customer repurchasing intention and the mediating role of trust - an empirical investigation in two developed countries

Although e-commerce adoption and customers initial purchasing behavior have been well studied in the literature, repeat purchase intention and its antecedents remain understudied. This study proposes a model to understand the extent to which trust mediates the effects of vendor-specific factors on customers intention to repurchase from an online vendor. The model was tested and validated in two different country settings. We found that trust fully mediates the relationships between perceived reputation, perceived capability of order fulfillment, and repurchasing intention, and partially mediates the relationship between perceived website quality and repurchasing intention in both countries. Moreover, multi-group analysis reveals no significant between-country differences of the model with regards to the antecedents and outcomes of trust, except the effect of reputation on trust. Academic and practical implications and future research are discussed. © 2009 Operational Research Society Ltd.

A simple game-theoretic analysis of peering and transit contracting among Internet service providers

The paper presents a simple game-theoretic model of two Internet service providers (ISPs), drawn from a larger set consisting of Tiers-1 and -2 ISPs, who choose between peering and transit agreements. The study focuses on the costs of interconnection taking into account traffic imbalances. The analysis suggests that if the traffic flows and the costs of interconnection are fairly shared, the provider's peer, otherwise they choose transit. Moreover, the joint profits are maximized under the transit arrangement. Published by Elsevier Ltd.

'That horse that runnes vpon the toppe of Powles': Middleton, Dekker and the Anonymous The Fatal Marriage

Posits textual evidence for consideration of Middleton and Dekker as hands in the authorship of the anonymous play 'The Fatal Marriage'.

On Entropy-Based Molecular Descriptors: Statistical Analysis of Real and Synthetic Chemical Structures

This paper presents an analysis of entropy-based molecular descriptors. Specifically, we use real chemical structures, as well as synthetic isomeric structures, and investigate properties of and among descriptors with respect to the used data set by a statistical analysis. Our numerical results provide evidence that synthetic chemical structures are notably different to real chemical structures and, hence, should not be used to investigate molecular descriptors. Instead, an analysis based on real chemical structures is favorable. Further, we find strong hints that molecular descriptors can be partitioned into distinct classes capturing complementary information.

Enabling Free On-line Access to UK Law Reports: The Copyright Problem

The history of publishing legal decisions (law reporting) in the UK has been that of a privatised system since its inception, and that history has encompassed several hundred years. The privatised nature of this has meant that the product (the law report) has been, except in limited cases, viewed as the property of the publisher, rather than the property of the court or public. BAILII is an open access legal database that came about in part because of the copyrighted, privatised nature of this legal information. In this paper, we will outline the problem of access to pre-2000 judgments in the UK and consider whether there are legal or other remedies which might enable BAILII to both develop a richer historic database and also to work in harmony, rather than in competition, with legal publishers. We argue that public access to case law is an essential requirement in a democratic common law system, and that BAILII should be seen as a potential step towards a National Law Library.

Molecular dynamics studies of the STAT3 homodimer:DNA complex: relationships between STAT3 mutations and protein-DNA recognition.

Signal Transducers and Activators of Transcription (STAT) proteins are a group of latent cytoplasmic transcription factors involved in cytokine signaling. STAT3 is a member of the STAT family and is expressed at elevated levels in a large number of diverse human cancers and is now a validated target for anticancer drug discovery.. Understanding the dynamics of the STAT3 dimer interface, accounting for both protein-DNA and protein-protein interactions, with respect to the dynamics of the latent unphosphorylated STAT3 monomer, is important for designing potential small-molecule inhibitors of the activated dimer. Molecular dynamics (MD) simulations have been used to study the activated STAT3 homodimer:DNA complex and the latent unphosphorylated STAT3 monomer in an explicit water environment. Analysis of the data obtained from MD simulations over a 50 ns time frame has suggested how the transcription factor interacts with DNA, the nature of the conformational changes, and ways in which function may be affected. Examination of the dimer interface, focusing on the protein-DNA interactions, including involvement of water molecules, has revealed the key residues contributing to the recognition events involved in STAT3 protein-DNA interactions. This has shown that the majority of mutations in the DNA-binding domain are found at the protein-DNA interface. These mutations have been mapped in detail and related to specific protein-DNA contacts. Their structural stability is described, together with an analysis of the model as a starting-point for the discovery of novel small-molecule STAT3 inhibitors.

Self-disclosure decision making based on intimacy and privacy

Autonomous agents may encapsulate their principals' personal data attributes. These attributes may be disclosed to other agents during agent interactions, producing a loss of privacy. Thus, agents need self-disclosure decision-making mechanisms to autonomously decide whether disclosing personal data attributes to other agents is acceptable or not. Current self-disclosure decision-making mechanisms consider the direct benefit and the privacy loss of disclosing an attribute. However, there are many situations in which the direct benefit of disclosing an attribute is a priori unknown. This is the case in human relationships, where the disclosure of personal data attributes plays a crucial role in their development. In this paper, we present self-disclosure decision-making mechanisms based on psychological findings regarding how humans disclose personal information in the building of their relationships. We experimentally demonstrate that, in most situations, agents following these decision-making mechanisms lose less privacy than agents that do not use them. (C) 2012 Elsevier Inc. All rights reserved.

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

The scheduling problem in distributed data-intensive computing environments has become an active research topic due to the tremendous growth in grid and cloud computing environments. As an innovative distributed intelligent paradigm, swarm intelligence provides a novel approach to solving these potentially intractable problems. In this paper, we formulate the scheduling problem for work-flow applications with security constraints in distributed data-intensive computing environments and present a novel security constraint model. Several meta-heuristic adaptations to the particle swarm optimization algorithm are introduced to deal with the formulation of efficient schedules. A variable neighborhood particle swarm optimization algorithm is compared with a multi-start particle swarm optimization and multi-start genetic algorithm. Experimental results illustrate that population based meta-heuristics approaches usually provide a good balance between global exploration and local exploitation and their feasibility and effectiveness for scheduling work-flow applications. © 2010 Elsevier Inc. All rights reserved.

Impact of the number of users on error probabilities in multiuser diversity systems

Multiuser diversity gain has been investigated well in terms of a system capacity formulation in the literature. In practice, however, designs on multiuser systems with nonzero error rates require a relationship between the error rates and the number of users within a cell. Considering a best-user scheduling, where the user with the best channel condition is scheduled to transmit per scheduling interval, our focus is on the uplink. We assume that each user communicates with the base station through a single-input multiple-output channel. We derive a closed-form expression for the average BER, and analyze how the average BER goes to zero asymptotically as the number of users increases for a given SNR. Note that the analysis of average BER even in SI SO multiuser diversity systems has not been done with respect to the number of users for a given SNR. Our analysis can be applied to multiuser diversity systems with any number of antennas.