14371676
On the Formation of Peer-to-Peer Networks: Self-Organized Sharing and Groups
In this paper, we investigate the formation of peer-to-peer (P2P) networks with rational participating agents (active peers). In the absence of a central planner, peers choose their own utility-maximizing strategies for coalition and peer formation. P2P networks evolve dynamically through the activities of interactions among individual nodes and group units. We propose a framework for multilevel formation dynamics, including an individual level (content sharing decision and group selection) and a group level (membership admission). The respective utilities of the individual node and the collective player are formulated as functions of operational performance metrics such as expected content availability, search delay, transmission delay, and download delay. We study the impacts of various system parameters on the emergence of self-organized P2P network configuration features such as free-riding level and group size. Furthermore, we investigate the stability and efficiency of P2P networks and propose internal transfer mechanisms that force stable networks to become efficient.
14496219
Optimal Processing Policies for an e-Commerce Web Server
The explosive growth in online shopping has provided online retailers impressive opportunities to extend revenue and profit. However, retailers may lose considerable online business from slow response times at electronic shopping sites. Although increasing server capacity may improve response time, the resources needed to do so are clearly not free. In this study, we propose a scheme that can improve a server's performance with no more than its current capacity. This scheme is based on priority processing, where the priority assigned to a customer depends on the potential revenue that is likely to be generated from the customer. The results for single-period analysis show that the benefit from priority processing increases as the server becomes more heavily utilized. 
 
We have also modeled a multiperiod version of the problem, where the demand in a period depends on the quality of service (QoS) that buyers receive in the previous period. In the multiperiod problem, both the server capacity and the processing policy in each period are determined optimally. Here, it may be optimal for the retailer to sacrifice profit and increase QoS in initial periods in order to increase demand (and revenue) in later periods. Thus, the processing policy of the server evolves from an emphasis on QoS in initial periods, to one on profit in subsequent periods.
10154529
Comparing uniform and flexible policies for software maintenance and replacement
The importance of software maintenance in managing the life-cycle costs of a system cannot be overemphasized. Beyond a point, however, it is better to replace a system rather than maintain it. We derive model and operating policy that reduces the sum of maintenance and replacement costs in the useful life of a software system. The main goal is to compare uniform (occurring at fixed time intervals) versus flexible (occurring at varying, planned time intervals) polices for maintenance and replacement. The model draws from the empirical works of earlier researchers to consider 1) inclusion of user requests for maintenance, 2) scale economies in software maintenance, 3) efficiencies derived from replacing old software technology with new software technology, and 4) the impact of software reuse on replacement and maintenance. Results from our model show that the traditional practice of maintaining or replacing a software system at uniform time intervals may not be optimal. We also find that an increase in software reuse leads to more frequent replacement, but the number of maintenance activities is not significantly impacted.
27936359
A new content-based hybrid video transcoding method
Many video transcoding architectures have been proposed to reduce the bitrates of compressed video bitstreams. Requantization of transformed coefficients (such as DCT coefficients), spatial resolution down-sampling, and temporal resolution down-sampling are the three transcoding tools which are commonly used to reduce compressed video bitrates. We propose a new video transcoding method that combines the use of different transcoding tools to transcode compressed video bit streams to various target bitrates while maintaining good subjective/objective video quality. The transcoding tools are selected based on the video content, which is characterized by two video content descriptors inferring the video spatial and motion activities, respectively. These two content descriptors can be readily computed from the compressed video bit streams without full decompression. Experimental results show that the proposed method can provide better video quality than other existing transcoders that make use of a single transcoding tool.
27733167
An unsupervised approach to dominant video scene clustering
In this paper, we propose an unsupervised approach for dominant scene clustering in sports video. By adopting a customized peer group filtering (PGF) to identify prototypes for k-means clustering, dominant scenes can be clustered based on shot color histogram (SCH). Meanwhile, the number of clusters can automatically be determined by estimating the time coverage of dominant scenes. To improve the computational efficiency and clustering accuracy, principal component analysis (PCA) and linear discriminant analysis (LDA) are used to project SCH into reduced dimensional spaces. The prototypes obtained by PGF can also be served as sufficient and representative training data for LDA. Such good training data ensures LDA outperforms PCA with better clustering performance in more reduced feature dimension.
30616381
Constructive Default Logic and the Control of defeasible reasoning
21500667
Efficient block-matching motion estimation based on Integral frame attributes
Block-based motion estimation is widely used in video compression for exploiting video temporal redundancy. Although effective, the process is arguably the most computationally intensive part of a typical video encoder. To speed up the process, a large number of fast block-matching algorithms (BMAs) have been proposed for motion estimation by limiting the number of search locations or simplifying the measure of match between the two blocks under comparison. In this paper we propose a new BMA that measures the match by using such features as block sum and block variance, which can be easily computed using integral frame attributes. Experimental results show that the proposed BMA can reduce the computational complexity notably and achieve compression performance very close to that of existing BMAs using conventional block-matching measures.
181942
Search engine driven author disambiguation
In scholarly digital libraries, author disambiguation is an important task that attributes a scholarly work with specific authors. This is critical when individuals share the same name. We present an approach to this task that analyzes the results of automatically-crafted Web searches. A key observation is that pages from rare Web sites are stronger source of evidence than pages from common Web sites, which we model as inverse host frequency (IHF). Our system is able to achieve an average accuracy of 0.836