Website traffic varies through time in consistent and predictable ways, with highest traffic in the middle of the day. When providing media content to visitors, it is important to present repeat visitors with new content so that they keep coming back. In this paper we present an algorithm to balance the need to keep a website fresh with new content with the desire to present the best content to the most visitors at times of peak traffic. We formulate this as the media scheduling problem, where we attempt to maximize total clicks, given the overall traffic pattern and the time varying click-through rates of available media content. We present an efficient algorithm to perform this scheduling under certain conditions and apply this algorithm to real data obtained from server logs, showing evidence of significant improvements in traffic from our algorithmic schedules. Finally, we analyze the click data, presenting models for why and how the click-through rate for new content declines as it ages.

Within the limitations of this study, it was found that the sagittal inclination of the mounted maxillary cast achieved with Hanau articulator was closer to the cephalometric occlusal cant as compared to that of the Girrbach articulator. Among the two articulators and face-bow systems, the steepness of sagittal inclination was greater on Girrbach semi-adjustable articulator. Different face-bow/articulator systems could result in different orientation of the maxillary cast, resulting in variation in stability, cuspal inclines and cuspal heights.

No abstract

How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider the problem of automatically generating link-titles for URLs and propose a general statistical framework for solving this problem. The framework is based on using information from a diverse collection of sources, each of which can be thought of as contributing one or more candidate link-titles for the URL. It can also incorporate the context in which the link-title will be used, along with constraints on its length. Our framework is applicable to several scenarios: obtaining succinct titles for displaying quicklinks, obtaining titles for URLs that lack a good title, constructing succinct sitemaps, etc. Extensive experiments show that our method is very effective, producing results that are at least 20% better than non-trivial baselines.

Optical Burst Switching (OBS) is a promising paradigm for high speed transmission of data. In OBS, a key problem is to schedule bursts with minimum loss. Single method is not sufficient to improve performance. So, our performance model includes some feasible methods to improve OBS performance without increasing the implementation complexity. The methods include adding fiber delay lines (optical buffers), increasing offset time randomly, channel scheduling and Burst Delay Feedback scheduling (BDFS). FDLs are used only to compensate the node processing time. The random offset time approach does not require additional hardware components in the nodes. Channel scheduling in a window based manner provides better channel utilization capability when FDLs are used in the nodes. Finally Burst Delay Feedback scheduling in addition with these methods can significantly improve OBS throughput and reduce loss rate.