军校图书馆发挥思想政治教育功能实现途径探析

图书馆是军队院校思想政治教育的重要阵地。分析论证了图书馆在军校思想政治教育中具有的转化功能、强化功能和内化功能,并从强化阵地意识、注重阅读引导、提高服务水平、营造环境氛围四个方面,就如何发挥军校图书馆在思想政治教育中的功能作用进行了探讨。     

计算机科学与技术专业课程体系的建设与实践

计算机科学与技术专业是一门随着社会、经济、科技的飞速发展而不断更新的学科,为了培养具有开拓、创新、适应社会发展的高素质工程应用型人才,我们必须不断加强计算机科学与技术专业的课程体系建设。本文结合我校计算机科学与技术专业教学和应用现状,通过建立良好的课程体系,使课程教学能更系统、更具目的性;同时将实践教学摆到了重要的位置,注重课程体系的组织与学生能力培养和素质提高的密切结合。     

民汉大学生自主性学习对比研究——以新疆财经大学民汉学生为例

自主学习是大学生除课堂学习之外最主要的学习形式,也是提高大学生自身素质的重要手段。新疆是多民族聚居地区,民汉大学生学习融合成为新疆教育的一大特色。在学习融合的过程中,民汉学生的自主性学习是否存在差异,成为关注的内容。本文通过调查问卷的形式,对民汉大学生的自主性学习的现状与影响因素进行了对比研究,发现民汉大学生自主学习差异不大,根据问卷调查的情况,提出了加强民汉大学生自主学习的建议。     

大学生思想政治教育中的“沉默螺旋”现象

"沉默的螺旋"理论是20世纪70年代德国社会学家诺尔诺依曼基于历史和传播的角度提出的关于舆论形成的理论假设,是现今学界研究受众反应的经典理论之一。本文就沉默螺旋理论在当代大学生思政传播中的存在性进行了论证,并分析了其对大学生思想政治教育可能产生的影响,结合实际,探讨了降低其负面影响的对策。     

边疆多民族地区大学生主流文化认同的调查与分析——以新疆高校为例

公本文从社会主义核心价值体系认同、执政党认同、理论认同、民族认同四个维度对大学生主流文化认同进行调查分析,结果显示,大学生主流文化认同总体是积极向上的,但也存在不平衡性和差异,主流文化认同面临严峻挑战。加强对大学生群体主流文化认同教育,引导大学生树立正确的国家观、民族观、文化观,对边疆多民族地区未来发展和国家安全十分重要。     

兵团高校大学生赴基层单位就业现状分析——以石河子大学为例

党的十八大和十八届三中全会提出"健全鼓励高校毕业生到基层工作的服务保障机制"的工作任务,基层就业成为大学生就业的重要渠道之一。为深入了解兵团高校大学生赴到兵团基层单位就业的状况,以石河子大学为个案,通过分析和梳理石河子大学毕业生到兵团基层就业情况及存在问题,尝试构建高校毕业生到兵团基层单位就业新机制,以期更好的为兵团基层发展提供智力支持和人才保障。     

对成像雷达的脉冲分段排序转发干扰

多假目标图像欺骗是目前宽带雷达干扰的难点。针对宽带雷达中常用的线性调频(Linear Frequency Modulated,LFM)信号,提出一种脉冲分段排序转发干扰方法。结合散射波信号模型,推导了合成干扰信号二维成像输出形式,讨论了假目标图像个数、分辨率与分段数以及转发次序之间的关系,并进行了仿真实验。结果表明该干扰方法可较便捷地产生多个沿距离向分布的假目标图像。结果对于成像雷达图像欺骗干扰具有理论指导意义。     

Inventory control and replenishment with flexible delivery‐time upgrade

We consider a capacitated inventory model with flexible delivery upgrades, in which the seller allocates its on‐hand inventory to price‐ and delivery‐time‐sensitive customers. The seller has two decisions: inventory commitment and replenishment. The former addresses how the on‐hand inventories are allocated between the two classes of customers within an inventory cycle. The latter addresses how the inventory is replenished between inventory cycles. We develop optimal inventory allocation, upgrade, and replenishment policies and demonstrate that the optimal policy can be characterized by a set of switching curves. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 418–426, 2014     

Assessing the value of demand sharing in supply chains

We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014