数字图像复数不变矩构造及稳定性分析

为系统性地给出数字图像不变矩一般性构造方法及对不变矩稳定性进行分析,通过采用复数矩作为描述数字图像识别特征量的方法,研究了复数不变矩所具有不变性的约束条件及其与几何不变矩间的关系,推导出了复数不变矩构造定理,并以在工程应用中的低阶复数不变矩为例对复数不变矩的稳定性进行了分析。研究结果表明:采用复数不变矩构造数字图像特征量具有很好普适性和稳定性,对于图像目标识别特征的描述有较好的效果。     

核心力量训练在手榴弹立姿投掷中的应用

核心力量训练作为现代体能训练的重要内容,近年来引起了国内许多体育界研究者的高度重视,已取得了一定的研究成果。但是,在部队的手榴弹立姿投掷训练课目中尚未引入这一训练理念。本文通过阐述与核心力量训练相关的概念、手榴弹立姿投掷核心力量训练的作用,总结出适用于部队实际、开展手榴弹立姿投掷核心力量训练的方法和原则。     

中国近代编辑出版工作者的矛盾心理分析

中国近代编辑出版是在旧制度已经衰败、新制度尚未建立的历史背景下发展起来的。西方文明与中国古老文明的冲突、旧思想与新思想的较量、公共利益与个体利益的矛盾必然存在。中国近代编辑出版工作者面对西学与中学、雅文化与俗文化、社会效益与经济效益的选择时,存在着矛盾心理,并为中国文化的近代化作出了贡献。     

对新形势下新疆高校跨越式发展的思考

党的十八届三中全会指出要深化教育领域综合改革,健全促进就业创业体制机制:提出"三个进一步解放",即进一步解放思想、进一步解放和发展生产力、进一步解放和增强社会活力。这一新形势下,为确保社会和谐稳定、推进区域发展和教育公平,实现新疆高校跨越式发展显得尤为重要。本文对此形势下实现这一目标进行探讨。     

高师生社会支持与信息焦虑的关系研究

目的:研究高师生社会支持与信息焦虑的相关关系,旨在找出能够用社会支持改善信息焦虑状况的办法。方法:采用信息焦虑量表和领悟社会支持量表238名高师生进行测查。结果:1高师生社会支持的整体水平有极其显著性差异(F=6.083,P0.05)。2信息搜索与选择焦虑维度上存在显著的性别差异(T=4.218,P0.05)。在信息搜索和选择焦虑、信息饥渴焦虑上存在显著的年级差异(F=3.231,P0.05)。3湖北师范学院高师生信息焦虑和社会支持各因子间呈显著负相关(R=-0.153,P0.05)。通过回归分析,社会支持对信息焦虑程度具有预测作用(F=4.617,P0.01)。结论:通过增加社会支持来缓解高师生的信息焦虑。     

Some aging properties of parallel and series systems with a random number of components

In this article, we study aging properties of parallel and series systems with a random number of components. We show that the decreasing likelihood ratio property is closed under the formation of random minima. We also show, by counterexamples, that other aging properties are not closed under the formation of random minima or maxima. Some mistakes in the literature are corrected. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 238–243, 2014     

正规形法在弹箭非线性运动分析中的应用

非线性气动力对弹箭运动特性具有重要影响,而其复杂性和有效分析工具的缺乏往往制约了弹箭非线性运动理论的发展.为探索正规形方法在弹箭非线性运动分析中的应用,构造了考虑二次非线性阻尼和七次非线性静力矩下攻角方程的正规形,进而求得攻角的通用解析解,通过数值积分验证了其在较大攻角范围内的有效性,该解析解也同样适用于无阻尼角运动和...     

面向体系的目标选择形式化描述及分析

针对信息化条件下各类目标相互作用反制作战能力倍增的特点,进行面向体系目标选择的相关问题分析。通过分析目标体系的概念和层次结构,建立目标选择的概念模型,并进行目标选择的形式化描述与分析,提供了一种研究军事概念模型的思路和方法,有助于目标选择决策支持系统的开发与验证。     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment

The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011