A novel image steganography scheme with high embedding capacity and tunable visual image quality based on a genetic algorithm

Steganography is knowledge and art of hiding secret data into information which is largely used in information security systems. Various methods have been proposed in the literature which most of them are not capable of both preventing visual degradation and providing a large embedding capacity. In this paper, we propose a tunable visual image quality and data lossless method in spatial domain based on a genetic algorithm (GA). The main idea of the proposed technique is modeling the steganography problem as a search and optimization problem. Experimental results, in comparison with other currently popular steganography techniques, demonstrate that the proposed algorithm not only achieves high embedding capacity but also enhances the PSNR of the stego image.     

Credit rating with a monotonicity-constrained support vector machine model

Deciding whether borrowers can fulfill their obligations is a major issue for financial institutions, and while various credit rating models have been developed to help achieve this, they cannot reflect the domain knowledge of human experts. This paper proposes a new rating model based on a support vector machine with monotonicity constraints derived from the prior knowledge of financial experts. Experiments conducted on real-world data sets show that the proposed method, not only data driven but also domain knowledge oriented, can help correct the loss of monotonicity in data occurring during the collecting process, and performs better than the conventional counterpart.     

一种混合的领域概念分类体系自动构建算法

领域概念分类体系自动构建在人工智能、自然语言处理和信息检索等领域具有重要作用,但现有研究较多关注通用知识,面向特定领域的研究较少,且存在领域概念间关系抽取准确率以及自动构建算法效率较低等问题。为此,提出一种混合的领域概念分类体系自动构建算法,该算法主要包括领域概念间关系抽取模块和分类体系构建模块。领域概念间关系抽取模块设计考虑中文自身的特点,采取句法树和基于规则相结合的方法,以提高抽取领域概念间关系的查准率和查全率;分类体系构建模块设计采取改进的BRT算法,从而在降低算法复杂度的同时,提高领域分类体系构建的查准率。在通信、金融和计算机领域的实验结果均表明,与BRT算法相比,该算法的构建效果较好,查准率最高可达到89.3%。     

基于FDR原理的自动灌溉系统设计

利用土壤的介电特性测量土壤含水量是一种快速、简便、可靠的方法。根据频域反射(FDR)法测量原理,电磁波在土壤中的传播频率可用来测试土壤的介电常数,从而得到土壤容积含水率,设计出了一种基于FDR原理的自动灌溉系统,介绍了FDR测量原理,阐述了自动灌溉系统的软硬件构成,土壤水分传感器测得的土壤水分含量信息,经信号处理,输出为0~5V电压信号,经A/D转换送至AT89S52单片机进行判断处理,根据输出数值的大小控制电磁阀的通断时间,从而实现自动灌溉和节水灌溉的目的。试验表明:该系统工作稳定,控制准确,反应灵敏,满足自动灌溉要求。     

基于LabVIEW的虚拟精细化频谱分析仪

LabVIEW是虚拟仪器领域中最具代表性的图形化编程开发平台,利用该平台设计了信号产生与分析系统,并从信号发生器、时域及频域测量三方面展开阐述,其中包括波形产生,时域参数测量,频谱分析,信号ZoomFFT分析等。频域分析系统除了基本频谱分析外,具体阐述了细化频谱ZoomFFT算法的原理,使得该频谱系统能够更实时高效的处理分析频谱密集型信号。     

智能电网的安全可控性

计算机与信息技术在电力系统中的广泛应用提高了电网的自动化、智能化水平,同时也将传统IT领域的众多安全隐患引入了电网。智能电网是社会域、信息域、物理域多域交互、渗透形成的大规模新型融合网络,其安全威胁具有多域渗透、跨域攻击的特点。文中描述了智能电网基本安全需求及其与传统IT安全需求的不同;分析了智能电网中多域渗透攻击并且对信息-物理安全威胁进行分类;基于分域防护、多域协同、边界防护的思想提出了智能电网多域协同安全防护模型。     

MULTIVARIATE WALSH-FOURIER ANALYSIS

Abstract. In this paper we establish a statistical methodology for the spectral analysis of stationary multivariate time series via the Walsh-Fourier transform. Theoretical results pertaining to the definition and estimation of the Walsh-Fourier spectral matrix and functions of that matrix including cross-spectra, coherency and phase are given. An example of the statistical techniques developed in this paper is given; in particular, the methodologies are applied to neonatal sleep data collected from a study of the effect of maternal substance use during pregnancy.     

A parametric frequency response method for non-linear time-varying systems

A new parametric frequency response algorithm is introduced to investigate linear and non-linear dynamic systems with time-varying parameters. In the new algorithm the time-varying parameters are regarded as additional inputs of the systems and the non-linear generalised frequency response functions for multi-input-single-output systems are then employed to obtain Zadeh's system functions from a differential equation representation. The parametric frequency response method reveals how the time-varying parameters affect the behaviour of the systems through a time-varying term. The new method can be applied to both linear and non-linear time-varying systems.     

Designing multilayered wire‐grid polarizers using a monochromatic recursive convolution finite‐difference time‐domain algorithm

Multilayered wire‐grid polarizers (WGP) find application as low‐reflection polarizers in projection‐type liquid crystal display devices. A multilayered WGP is formed by adding thin layers on top of the metal ridges of an ordinary WGP. The ordinary WGP consists of a periodic array of parallel metal ridges, where the period of the array and the width of any individual metal ridge are typically less than the wavelength of the incident light. Such WGPs are often used as efficient polarizers. However, in certain applications, it is important to reduce the reflection from the WGP while preserving the polarization efficiency. One of the ways to achieve this goal is to add thin layers on top of the metal ridges of the ordinary WGP. The reduction in reflection from the multilayered WGP depends on the number and material of these additional layers. In this paper, we describe a design method for multilayered WGPs based on an effective medium theory, thin‐film computation method and a monochromatic recursive convolution finite‐difference time‐domain algorithm. The goal of design process is to identify suitable materials and thicknesses for the additional thin layers needed to lower the reflection appreciably. The design method is explained with the help of bilayered WGPs.     

Total curvature variation fairing for medial axis regularization

We present a new fairing method for planar curves, which is particularly well suited for the regularization of the medial axis of a planar domain. It is based on the concept of total variation regularization. The original boundary (given as a closed B-spline curve or several such curves for multiply connected domains) is approximated by another curve that possesses a smaller number of curvature extrema. Consequently, the modified curve leads to a smaller number of branches of the medial axis. In order to compute the medial axis, we use the state-of-the-art algorithm from [1] which is based on arc spline approximation and a domain decomposition approach. We improve this algorithm by using a different decomposition strategy that allows to reduce the number of base cases from 13 to only 5. Moreover, the algorithm reduces the number of conic arcs in the output by approx. 50%.