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.     

Spectrocolorimetric and microscopic techniques for the evaluation of plasticized PVC cleaning: a case study applicable to three-dimensional objects at museums

For the validation of a cleaning method in conservation, the examination of the object's surface after the cleaning and the quantification of the cleaning efficiency are significant steps. In this study, several cleaning solutions were tested on a plasticized poly(vinyl chloride) object whose surface was characterized before and after cleaning by optical microscopy and noncontact profilometry. In addition, different methods to quantify the cleaning efficiency based on spectrocolorimetric and microscopic techniques were provided. The results showed that noncontact profilometry supported by optical microscopy and spectrocolorimetry was very useful for the characterization of the plasticized poly(vinyl chloride) surface before and after the cleaning and also for the determination of the cleaners' efficiency.     

Window annealing for pixel-labeling problems

The pixel labeling problems in computer vision are often formulated as energy minimization tasks. Algorithms such as graph cuts and belief propagation are prominent; however, they are only applicable for specific energy forms. For general optimization, Markov Chain Monte Carlo (MCMC) based simulated annealing can estimate the minima states very slowly.This paper presents a sampling paradigm for faster optimization. First, in contrast to previous MCMCs, the role of detailed balance constraint is eliminated. The reversible Markov chain jumps are essential for sampling an arbitrary posterior distribution, but they are not essential for optimization tasks. This allows a computationally simple window cluster sample. Second, the proposal states are generated from combined sets of local minima which achieve a substantial increase in speed compared to uniformly labeled cluster proposals. Third, under the coarse-to-fine strategy, the maximum window size variable is incorporated along with the temperature variable during simulated annealing. The proposed window annealing is experimentally shown to be many times faster and capable of finding lower energy compared to the previous Gibbs and Swendsen-Wang cut (SW-cut) sampler. In addition, the proposed method is compared with other deterministic algorithms like graph cut, belief propagation, and spectral method in their own specific energy forms. Window annealing displays competitive performance in all domains.     

COACH: COllaborative certificate stAtus CHecking mechanism for VANETs

Vehicular Ad Hoc Networks (VANETs) require mechanisms to authenticate messages, identify valid vehicles, and remove misbehaving vehicles. A public key infrastructure (PKI) can be used to provide these functionalities using digital certificates. However, if a vehicle is no longer trusted, its certificates have to be revoked and this status information has to be made available to other vehicles as soon as possible. In this paper, we propose a collaborative certificate status checking mechanism called COACH to efficiently distribute certificate revocation information in VANETs. In COACH, we embed a hash tree in each standard Certificate Revocation List (CRL). This dual structure is called extended-CRL. A node possessing an extended-CRL can respond to certificate status requests without having to send the complete CRL. Instead, the node can send a short response (less than 1 kB) that fits in a single UDP message. Obviously, the substructures included in the short responses are authenticated. This means that any node possessing an extended-CRL can produce short responses that can be authenticated (including Road Side Units or intermediate vehicles). We also propose an extension to the COACH mechanism called EvCOACH that is more efficient than COACH in scenarios with relatively low revocation rates per CRL validity period. To build EvCOACH, we embed an additional hash chain in the extended-CRL. Finally, by conducting a detailed performance evaluation, COACH and EvCOACH are proved to be reliable, efficient, and scalable.     

Securing DSR against wormhole attacks in multirate ad hoc networks

A wormhole attack is one of the hardest problems to detect whereas it can be easily implanted in any type of wireless ad hoc network. A wormhole attack can easily be launched by the attacker without having knowledge of the network or compromising any legitimate nodes. Most existing solutions either require special hardware devices or make strong assumptions in order to detect wormhole attacks which limit the usability of these solutions. In this paper, we present a security enhancement to dynamic source routing (DSR) protocol against wormhole attacks for ad hoc networks which relies on calculation of round trip time (RTT). Our protocol secures DSR against a wormhole attack in ad hoc networks for multirate transmissions. We also consider the processing and queuing delays of each participating node in the calculation of RTTs between neighbors which to date has not been addressed in the existing literature. This work provides two test cases that show that not taking multirate transmission into consideration results in miss identifying a wormhole attack.     

Image Compression and Video Segmentation Using Hierarchical Self-Organization

Both image compression based on color quantization and image segmentation are two typical tasks in the field of image processing. Several techniques based on splitting algorithms or cluster analyses have been proposed in the literature. Self-organizing maps have been also applied to these problems, although with some limitations due to the fixed network architecture and the lack of representation in hierarchical relations among data. In this paper, both problems are addressed using growing hierarchical self-organizing models. An advantage of these models is due to the hierarchical architecture, which is more flexible in the adaptation process to input data, reflecting inherent hierarchical relations among data. Comparative results are provided for image compression and image segmentation. Experimental results show that the proposed approach is promising for image processing, and the powerful of the hierarchical information provided by the proposed model.     

软件工程中体系结构的构建

软件体系结构是软件工程中的一个新兴的领域,它与软件工程技术的发展有着相当密切的关系,本文从软件工程技术的发展谈到了软件体系构建的必然性,并且在文章的最后对软件工程的发展现状和未来前景做出了总结.     

基于CMOS图像传感器的皮卫星成像系统设计

为满足皮卫星对成像系统的特殊要求,设计了基于CMOS图像传感器的成像系统。简单阐述了系统设计方案,详细说明了系统关键模块包括对CMOS相机的控制以及图像传输等在FPGA中的实现过程,并从器件选型、TMR技术应用等方面讨论了系统的可靠性。该系统应用于皮卫星样机中,通过了高低温试验、温度冲击试验、粒子辐照试验等,验证了其可行性。     

加权SUSAN算法与遥感图像矢量化

本文对经典SUSAN算法进行了改进,提出了WSUSAN,即加权SUSAN的概念,与经典算法相比,WSUSAN角点的检出精度大幅提高,而运算复杂度和运算量仍保持在原数量级。作为WSUSAN的应用,本文进行了基于WSUSAN角点的遥感图像矢量化的研究,主要研究的内容包括过检出角点的筛选、角点排序和矢量化等。经过仿真测试,证明该算法有很好的鲁棒性。     

Parameter augmentation and the q-Gosper algorithm

We develop a method for deriving new basic hypergeometric identities from old ones by parameter augmentation. The main idea is to introduce a new parameter and use the q-Gosper algorithm to find out a suitable form of the summand. By this method, we recover some classical formulas on basic hypergeometric series and find extensions of the Rogers–Fine identity and Ramanujan’s summation formula. Moreover, we derive an identity for a summation.