No abstract

The success of online advertising depends on the degree of customer acceptance and corresponding click-through rate (CTR). The coverage of traditional online advertising is wide, but the CTR of display advertisements delivered by firms is relatively lower. Whereas targeted advertising can deliver appropriate advertisements to customers based on their traits (disturbance avoidance), advertisements can leverage the power of social influence to improve the degree of acceptance of advertisements. In this paper, by utilizing the power of social influence and context embellishment, we propose a personalized social context endorsement mechanism to enhance the effectiveness of advertisements. According to the results of an experiment conducted on Facebook, the proposed mechanism outperforms other benchmark approaches to improving the CTR and user impressions. This research effectively incorporates the theories of preference similarity, social influence, and moral sentiments and provides advertising sponsors and social media providers with a powerful system to conduct successful advertising campaigns.

No abstract

No abstract

Broadcast disk technology has become a popular method for data dissemination in wireless information systems. However, factors such as intentional periodic disconnection by the mobile hosts (MH) result in further needs for managing access modes so as to let the mobile hosts procure highest benefit through the disconnections. We address this issue in this paper and propose solutions for the MH to retrieve the broadcast data. Our performance results show that the proposed algorithms indeed achieve almost the optimal performance, but require only 5-30% of the cost of an algorithm that is otherwise designed.

In recent years, the research community introduced various methods for processing spatio-temporal queries. Continuous Within query (and CWQ) is an important type of spatiotemporal queries with many real applications. A CWQ can be used to find the moving objects whose distances to the moving query object are less than or equal to a user-given distance dε at each time instant. In this paper, we study how to efficiently process the CWQ in road networks, where the criterion for determining the CWQ result is the road distance between objects. We propose an efficient algorithm, namely the continuous within query (CWQ) algorithm, combined with a road distance model to answer the CWQ. Extensive experiments using real road network dataset demonstrate the effectiveness and the efficiency of the proposed algorithm.

No abstract

No abstract