Camouflage texture evaluation using a saliency map

Multimedia Systems - Camouflage effect evaluation and examination is an important procedure in digital camouflage pattern design as it is helpful in improving the objectivity and effectiveness...     

Image inpainting algorithm based on TV model and evolutionary algorithm

With the development of modern image processing techniques, the numbers of images increase at a high speed in network. As a new form of visual communication, image is widely used in network transmission. However, the image information would be lost after transmission. In view of this, we are motivated to restore the image to make it complete in an effective and efficient way in order to save the network bandwidth. At present, there are two main methods for digital image restoration, texture-based method and non-textured-based method. In the texture-based method, Criminisi algorithm is a widely used algorithm. However, the inaccurate completion order and the inefficiency in searching matching patches are two main limitations of Criminisi algorithm. To overcome these shortcomings, in this paper, an exemplar image completion based on evolutionary algorithm is proposed. In the non-textured-based method, total variation method is a typical algorithm. An improved total variation algorithm is proposed in this paper. In the improved algorithm, the diffusion coefficients are defined according to the distance and direction between the damaged pixel and its neighborhood pixel. Experimental results show that the proposed algorithms have better general performance in image completion. And these two new algorithms could improve the experience of network surfing and reduce the network communication cost.     

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.     

浅析《计算机网络》课程实验环境架构

本文针对当前贫穷地区高职高专计算机网络实验教学的特点,结合学校和本地实际情况,从实验课程教学内容及形式方法等方面探讨了计算机网络实验环境架构的有关问题.对计算机网络实验的环境构架存在的不足,给出了解决方案.     

Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

一种分布式拒绝服务攻击的检测方法

该文提出和实现了一种基于网络异常流量特征的检测模型。通过将多条链路或多个流的流量信号作为一个整体进行研究,构建了网络异常流量监控的系统模型。该模型包括了数据采集、分析、异常判断和警告等功能,并综合了异常信息融合及警告信息关联性分析技术。通过实验证明,该套系统模型对短时间段内的突发流量能提供有效的检测和报警服务。     

Diffractive-phase-element design that implements several optical functions

A scheme for the design of diffractive phase elements (DPE's) that integrates several optical functions is presented in a consistent sense based on the general theory of amplitude-phase retrieval and the Yang-Gu algorithm [Appl. Opt. 33, 209 (1994)]. We extend the original Yang-Gu algorithm to treat a system illuminated by a beam of incident light whose components are at different wavelengths, and a set of equations for determining the phase distribution of the DPE is derived. The profile of a surface-relief DPE can be designed with an iterative algorithm. Numerical simulations are carried out for the design of one-dimensional DPE's capable of both demultiplexing different wavelength components and focusing each partial wave at predetermined positions. The influence of the extension of sampling points in the DPE's from ideal geometric points to physical spots on design results is also investigated. The numerical simulation results show that the new algorithm can be used successfully to design the desired DPE's. It is therefore expected to be useful in the design of DPE's for micro-optical systems.     

催化裂化装置龟甲网双层衬里的改进

通过对催化裂化装置老的龟甲网双层社里使用情况的调查研究以及对存在问题的分析,提出了改进措施。经近几年的实际应用考核证明,改进措施是行之有效的。在此基础上制订了院标“ＢＬ型隔热耐磨衬里施工技术要求”。