信息流中的隐形信息提取和还原技术研究

提出基于变化域的信息隐藏检测算法和基于彩色静止数字图像的信息隐藏提取算法,将小波变换的放大信息与显示隐藏信息及其相反过程的功效挖掘出来,基于信息隐藏对载体特性影响的模型,建立通用的隐藏信息提取的数学模型和面向"信息隐藏对载体特性影响"集合的正变换函数和逆变换函数,对信息进行标识、分析、提取和还原,使之能破除还原隐藏信息,达到较好的信息识别与分析效果,从而实现快速提取隐藏数据电子证据.     

社会转型期思想政治理论课教学效果提升研究

社会转型期使大学生在接受马克思主义思想政治理论课教学的过程中有了新的特点和诉求,在这一变化下提高马克思主义政治理论课的教学效果,必须从教师自身的教学理念、专业素质等方面予以考虑,也要从教学组织、教学方式方法、课内实践、学校教育多部门的协调等方面综合考虑。     

关于不定方程x3=Dy2+1

本文对方程x3=Dy2+1中一般情形的D进行了讨论,对0相似文献   

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

直杆塑性动力屈曲的能量准则和特征参数解

提出弹塑性应力波作用下直杆动力屈曲的定量求解方法,将临界应力和惯性指数作为一对特征参数求解.由相平衡邻位形准则得出屈曲控制方程和边界条件,由所导出的能量转换和守恒准则得出压缩波阵面上的附加约束方程,由此得出了问题的完备定解条件,从而提出了求解直杆塑性动力屈曲的特征参数方法.     

临近空间拦截弹最优弹道跟踪制导律

针对拦截临近空间高超声速飞行器的弹道跟踪过程,基于线性二次型调节器理论和高斯伪谱法设计一种跟踪制导律。为了对标称弹道进行精确跟踪,考虑线性二次型跟踪问题,应用最优控制理论推导最优解的充要条件,得到带时变增益的线性状态反馈控制量的表达式;基于高斯伪谱法,在离散的勒让德-高斯点上利用标称弹道数据计算差分矩阵和系数矩阵,求得状态扰动反馈控制律。仿真结果表明,与基于求解矩阵黎卡提方程的方法相比,该方法选取较少的节点即可获得高精度的反馈控制量,且运算效率大幅提高,满足在线实施要求。     

函数变换提高灰色预测模型精度的条件

指出选择函数变换来提高模型精度主要与三个方面的因素有关：提高数据序列的光滑比、调整数据序列的级比和确保凸凹性。在调整级比方面，扩充了级比压缩变换的相关定理，并讨论了几种常用的函数变换在上述三个方面的关系。最后结合实例提出，对于变换后的数据序列若不满足这三方面的要求可以再进行函数变换以达到提高模型精度的目的。     

基于改进整型遗传算法的稀疏矩形平面阵列优化

为了降低固定稀疏率、固定孔径的稀疏矩形阵列的峰值旁瓣电平,提出一种改进整型遗传算法。该算法在整型遗传算法的基础上,提出了等间隔采样的交叉策略、多点变异策略以及优良基因重组的策略。采取等间隔采样的基因交叉方式,可以有效发挥整型编码的优势,从而提高算法的运行效率;为了提高种群的多样性,防止算法陷入局部最优,采用了多点变异策略;采用优良基因重组技术,加快了算法的收敛速度。仿真结果表明,相比传统的二进制和实数编码,整型编码更为直接高效;与用于稀疏矩形阵列优化的相关算法相比,本文所提算法获得了更优的旁瓣电平,证实了算法的有效性和优越性。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

无人驾驶汽车视觉导航中车道线检测的研究

为了提高无人驾驶汽车视觉导航系统中车道线检测的准确性和实时性,在对车道线检测技术进行深入研究的基础上,提出一种能快速准确检测出车道线的新算法。首先采用分块思想将RGB图像中与道路无关的区域去除,以缩短数据处理时间。然后对余下的RGB图像进行灰度化处理,接着用中值滤波法消除随机噪声,再用最大类间方差法(Otsu法)初步得到二值图像。最后对二值图像利用数学形态学进一步边缘细化,使位于车道线上的每个像素行只有一个像素特征点,再采用Hough变换检测出车道线。Matlab仿真结果表明,此算法能够快速准确地检测出车道线,较传统检测算法具有更强准确性和实时性。