混沌权值变异的Huffman树图像加密算法

提出一种采用混沌权值变异的Huff man树的图像加密算法.此算法在熵编码过程中,以基本的Huffman树为标准,利用双耦合混沌序列1对DC系数进行树的结构未变异、路径值变异的加密;再利用双耦合混沌序列2对AC系数进行码字序号的加密.论文对算法进行了仿真,并对安全性、计算复杂度、压缩比性能进行了分析.实验结果表明,该算法基本上不影响压缩效率,且计算复杂度低、安全性高和实时性好,可用于网络上的图像服务.     

Nanotextured superhydrophobic micromesh

A superhydrophobic micromesh covered with nanoprotrusions has been introduced and its applicability to a waterproof mobile phone speaker has been evaluated. The nanotextured superhydrophobic micromesh showed excellent water repellency, self-cleaning and waterproofing performances. In a waterproof speaker test using the fabricated nanotextured micromesh, the micromesh did not lose its waterproof function at 2 m water depth and did not form a remnant water film after being removed from the water. The packaged speaker showed almost the same sound quality before and after dipping at a 2 m water depth. These results demonstrate that the superhydrophobic nanotextured micromesh could be directly applicable for various products that need to resist water penetration, yet allow the transmission of gases and sound/light waves.     

A belief-rule-based inventory control method under nonstationary and uncertain demand

This paper is devoted to investigating inventory control problems under nonstationary and uncertain demand. A belief-rule-based inventory control (BRB-IC) method is developed, which can be applied in situations where demand and demand-forecast-error (DFE) do not follow certain stochastic distribution and forecasting demand is given in single-point or interval styles. The method can assist decision-making through a belief-rule structure that can be constructed, initialized and adjusted using both manager’s knowledge and operational data. An extended optimal base stock (EOBS) policy is proved for initializing the belief-rule-base (BRB), and a BRB-IC inference approach with interval inputs is proposed. A numerical example and a case study are examined to demonstrate potential applications of the BRB-IC method. These studies show that the belief-rule-based expert system is flexible and valid for inventory control. The case study also shows that the BRB-IC method can compensate DFE by training BRB using historical demand data for generating reliable ordering policy.     

A divide-and-conquer hole-filling method for handling disocclusion in single-view rendering

Large holes are unavoidably generated in depth image based rendering (DIBR) using a single color image and its associated depth map. Such holes are mainly caused by disocclusion, which occurs around the sharp depth discontinuities in the depth map. We propose a divide-and-conquer hole-filling method which refines the background depth pixels around the sharp depth discontinuities to address the disocclusion problem. Firstly, the disocclusion region is detected according to the degree of depth discontinuity, and the target area is marked as a binary mask. Then, the depth pixels located in the target area are modified by a linear interpolation process, whose pixel values decrease from the foreground depth value to the background depth value. Finally, in order to remove the isolated depth pixels, median filtering is adopted to refine the depth map. In these ways, disocclusion regions in the synthesized view are divided into several small holes after DIBR, and are easily filled by image inpainting. Experimental results demonstrate that the proposed method can effectively improve the quality of the synthesized view subjectively and objectively.     

Dual graph regularized NMF model for social event detection from Flickr data

In this work, we aim to discover real-world events from Flickr data by devising a three-stage event detection framework. In the first stage, a multimodal fusion (MF) model is designed to deal with the heterogeneous feature modalities possessed by the user-shared data, which is advantageous in computation complexity. In the second stage, a dual graph regularized non-negative matrix factorization (DGNMF) model is proposed to learn compact feature representations. DGNMF incorporates Laplacian regularization terms for the data graph and base graph into the objective, keeping the geometry structures underlying the data samples and dictionary bases simultaneously. In the third stage, hybrid clustering algorithms are applied seamlessly to discover event clusters. Extensive experiments conducted on the real-world dataset reveal the MF-DGNMF-based approaches outperform the baselines.     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

Testbed results of an opportunistic routing for multi-robot wireless networks

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.