高校中国现当代文学教学模式研究

为适应社会发展与人才需求,高校中国现当代文学课程必须从单一、僵化的、传统式教学模式向研究式、实践应用、刺激动机、学习指导、考核评价等教学模式转变,以利创新精神与创新理念人才的培养。     

正交小波包分析在遥感图像融合中的应用

小波变换具有优良的时频局部特性,但由于其尺度是按二进制变化的,存在“高频低分辨”这一缺陷.正交小波包分析能够将信号(图像)频带进行多层次划分,对多分辨分析没有细分的高频部分进一步分解,从而提高了频率分辨率,能有效地提取特定的频率成分.推导了小波包分析的基本原理,给出了基于正交小波包分析的遥感图像融合算法.最后,通过实例说明正交小波包分析的有效性和优越性.     

星载铷钟的故障模式及影响分析

星载铷钟在许多空间系统中起着重要作用,要求其具有高的可靠性。阐述了故障模式及影响分析在星载铷钟可靠性设计中的重要作用,介绍了星载铷钟的基本原理和结构简图,依据星载铷钟的功能将其划分为6个子系统,在此基础上进行了故障模式及影响分析,并给出了物理泵体子系统的部分FMEA结果。     

空间信息栅格体系与服务聚合技术

空间信息应用中存在的数据海量、分布异构、处理复杂、计算密集等问题制约了空间数据和信息的广泛共享和应用。空间信息栅格(SIG)以Grid和WebServices技术为核心,共享并汇集地理上分布的海量空间信息资源,实现动态整合与集成。在构建开放性SIG七层应用体系的基础上,重点研究SIG服务聚合技术,基于Petri网和图论提出了一种新的服务聚合流程模型(服务/资源网),同时构建了可扩展的服务动态选择模型(SISM),实现服务聚合过程中的动态服务选择。结合国家地质调查业务应用,通过地下水资源评价应用实例对SIG的实用性和有效性进行了验证。     

振动矩形机翼非线性绕流数值研究

发展了可用于模拟包含运动边界的非定常流动的数值方法。该方法采用非结构动网格技术并构造了一种MUSCL类型有限体积格式,求解考虑了动网格效应的三维非定常Euler方程。非结构网格的变形运动由弹簧近似技术实现。用上述方法计算了作正弦振动的矩形机翼非线性绕流,计算结果与实验结果吻合,得到了流体运动与固体运动耦合的非线性流动特性。计算表明,该数值方法具有较好的精度和可靠性,完全可用于气动弹性或其他流固耦合问题的数值模拟。     

松耦合设计在计算机脆弱性测评系统中的应用

运用松耦合设计思想,对计算机脆弱性测评系统中两个子系统的组成和实现进行了研究。提出多准则测评子系统的Web数据库实现和CVE测评子系统的多层MAS实现方法,并对其实现算法和技术要点进行了论述。     

舰载指火控系统人机界面信息显示研究

阐述了现海军舰载指火控系统信息显示界面的不足,列举了界面信息显示的普遍原则.以对海作战为例对舰载指火控系统进行作战的分层显示以及编队、联合和协同作战的显示内容进行了研究.针对现海军舰载指火控系统信息显示界面的不足,提出了以虚拟环境为主页面,从舰载指火控系统的的操作信息、状态信息和过程信息三个方面对信息显示进行了充分的描述.最后呼应不足,提出了11条舰载指火控系统信息显示的原则.     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005