论公安现役本科院校基础课改革

教育改革应当以课程改革为先导。根据培养目标的内在要求,注重师资队伍建设,发挥教师的主体作用,积极参与基础课程改革,落实基础课职称岗位制度。     

计算机导论课的教学研究与实践

本文在分析课程改革的基础上 ,结合计算机基础教学在提高教学质量上所起的重要作用 ,对计算机导论课在近两年来所采取的教学改革手段和实践方法进行了详细论述     

An MX/G/1 queueing system with disasters and repairs under a multiple adapted vacation policy

We consider a queueing system with batch Poisson arrivals subject to disasters which occur independently according to a Poisson process but affect the system only when the server is busy, in which case the system is cleared of all customers. Following a disaster that affects the system, the server initiates a repair period during which arriving customers accumulate without receiving service. The server operates under a Multiple Adapted Vacation policy. The stationary regime of this process is analyzed using the supplementary variables method. We obtain the probability generating function of the number of customers in the system, the fraction of customers who complete service, and the Laplace transform of the system time of a typical customer in stationarity. The stability condition for the system and the Laplace transform of the time between two consecutive disasters affecting the system is obtained by analyzing an embedded Markov renewal process. The statistical characteristics of the batches that complete service without being affected by disasters and those of the partially served batches are also derived. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 171–189, 2015     

基于改进C-均值聚类算法的空中目标分类

空中目标的正确分类对防空作战效果有着重要的影响。在分析了空中目标类型和目标的表征方法之后,构建了动态聚类中的一种分类算法———改进C-均值算法。该算法改变了以前算法中只用一个聚类中心作为一类的代表的做法,而采用的是类核函数代替类心的方法。类核函数较一个聚类中心更能够表现出某一类的分布信息,从而提高分类的正确率。     

中美外语课堂教学差异比较研究

中国和美国在教育理念和教学方式方面存在着较大差异,从中美教师在外语课堂上对学生的培养方式、培养重点和评价标准以及课堂的教学方式方法、教学手段等诸多方面进行比较,发现中美外语教学中的差异,进而找出我国现行外语课堂教学的不足,并有针对性地提出了几点改进建议,希望能对我国外语教学质量的提高起到抛砖引玉的作用。     

On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

相控阵天线阵面两级备件优化配置模型

针对相控阵天线阵面备件配置存在的冗余性强、批量送修、多级维修等现实问题,综合考虑备件费用、维修能力以及库存策略之间的关系,建立了基于定期补给的两级备件优化配置模型。给出了系统的故障件维修周转过程和维修备件的定期补给过程,在分析备件、库存、维修能力之间关系的基础上,结合成批到达的排队理论,建立了系统的供应可用度模型。以备件配置费用最小为目标、以系统供应可用度为约束条件,建立了系统的备件优化配置模型,并通过边际效益分析法对模型进行了求解。通过算例仿真与分析对模型进行了验证。结果表明:构建的备件配置能够较好地解决相控阵天线阵面的备件配置问题,具有一定的优越性。     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

常规导弹作战批量测试优化研究

短时间内测试大批量合格的常规导弹是未来作战的客观要求.结合导弹部队的作战实际情况,分析了当前技术阵地测试所面临的问题,提出了一些改革的方法.改造技术阵地测试设备,提高操作人员的熟练程度,采用并行技术和关键路技术优化导弹测试流程,同时建立战时应急状态下的测试流程,特别是导弹批量测试技术的提出,将极大地提高导弹测试速度,缩短测试时间,为将来技术阵地的建设提供了建议,同时也对将来常规导弹的设计和研制提出了更高的要求.     

正确认识和走出CAI的误区

CAI能解决很多传统课堂教学中没有解决的问题,但应该正确认识和使用CAI,CAI是手段而不是目的,应该防止走入CAI的误区。