Optimizing content placement in a peer-assisted VoD architecture

Recently, a new peer-assisted architecture to build content delivery systems has been presented. This architecture is based on the use of the storage capacity of end-users’ set-top boxes (STBs), connected in a peer-to-peer (P2P) manner in order to help the content servers in the delivery process. In these systems, the contents are usually split into a set of smaller pieces, called sub-streams, which are randomly injected at the STBs. The present paper is focused on Video on Demand (VoD) streaming and it is assumed that the STB-based content delivery system is deployed over the global Internet, where the clients are distributed over different ISP networks. In this scenario, three different strategies are studied for increasing the percentage of data uploaded by peers, in order to offload the content servers as much as possible. First of all, a new mechanism is presented which determines which sub-stream has to be placed at which STB by a Non-Linear Programming (NLP) formulation. A different strategy for reducing the content server load is to take advantage of the available bandwidth in the different ISP networks. In this sense, two new mechanisms for forwarding the VoD requests to different ISP networks are presented. Finally, the present paper also shows that in some situations the available uplink bandwidth is associated with STBs that do not have the required sub-streams. Regarding this concern, a new mechanism has been designed that dynamically re-allocates some streams, which are being transmitted from specific STBs, to different STBs, in order to find the necessary resources to start new streaming sessions.     

A kernel-based framework for image collection exploration

While search engines have been a successful tool to search text information, image search systems still face challenges. The keyword-based query paradigm used to search in image collection systems, which has been successful in text retrieval, may not be useful in scenarios where the user does not have the precise way to express a visual query. Image collection exploration is a new paradigm where users interact with the image collection to discover useful and relevant pictures. This paper proposes a framework for the construction of an image collection exploration system based on kernel methods, which offers a mathematically strong basis to address each stage of an image collection exploration system: image representation, summarization, visualization and interaction. In particular, our approach emphasizes a semantic representation of images using kernel functions, which can be seamlessly harnessed across all system components. Experiments were conducted with real users to verify the effectiveness and efficiency of the proposed strategy.     

Stabilization of One‐Dimensional Schrödinger Equation with Variable Coefficient under Delayed Boundary Output Feedback

This article considers stabilization of a one‐dimensional Schrödinger equation with variable coefficient and boundary observation which suffers from an arbitrary given time delay. We design an observer and predictor to stabilize the system. The state is estimated in the time span where the observation is available, and also predicted in the time interval where the observation is not available. It is shown that the estimated state feedback stabilizes the system exponentially. A numerical simulation is presented to illustrate the effect of the stabilizing controller.     

浅析电子商务中的安全问题

随着现今社会互联网、个人终端技术的飞越发展,电子商务越来越多的出现在人们的生活与工作中,这种全新的商务模式具有便捷、高效率、低成本的特点.同时,这种全新的商务模式对管理水平、信息传递技术都提出了更高的要求,其中安全的重要性尤为突出.     

Stereo-Based Stochastic Mapping for Robust Speech Recognition

We present a stochastic mapping technique for robust speech recognition that uses stereo data. The idea is based on constructing a Gaussian mixture model for the joint distribution of the clean and noisy features and using this distribution to predict the clean speech during testing. The proposed mapping is called stereo-based stochastic mapping (SSM). Two different estimators are considered. One is iterative and is based on the maximum a posteriori (MAP) criterion while the other uses the minimum mean square error (MMSE) criterion. The resulting estimators are effectively a mixture of linear transforms weighted by component posteriors, and the parameters of the linear transformations are derived from the joint distribution. Compared to the uncompensated result, the proposed method results in 45% relative improvement in word error rate (WER) for digit recognition in the car. In the same setting, SSM outperforms SPLICE and gives similar results to MMSE compensation of Huang A 66% relative improvement in word error rate (WER) is observed when applied in conjunction with multistyle training (MST) for large vocabulary English speech recognition in a real environment. Also, the combination of the proposed mapping with CMLLR leads to about 38% relative improvement in performance compared to CMLLR alone for real field data.     

卷草纹的艺术语言及其现代延展设计

卷草纹是中国传统装饰纹样之一,它的形成和发展记载了中国装饰艺术旺盛的生命力。本文分析了卷草纹的发展过程、形象构成以及艺术特征,并通过具体案例诠释了它在现代设计各个领域的延展和应用。旨在探索传统装饰纹样在现代设计中的传承与发展的方向。     

基于J2EE的地税网上申报系统的设计与实现

文章阐述了地税网上申报系统开发的背景和意义;介绍了基于J2EE的网上报税系统的结构、软件的主要功能及具体的实现方法和所用的关键技术;总结了所用技术的优势以及系统中难点的处理。     

An adaptive interference alignment scheme based on the dynamic selection of desired transmitters for unmanned ship network

Wireless Networks - In the unmanned ship networking scenario, the position of the unmanned ship changes continuously, leading to the result that the desired transmitters and the interference...     

Joint Classification and Regression for Visual Tracking with Fully Convolutional Siamese Networks

International Journal of Computer Vision - Visual tracking of generic objects is one of the fundamental but challenging problems in computer vision. Here, we propose a novel fully convolutional...