近代中国留日陆军士官生人数考究

据笔者所看到的资料,关于近代中国留日陆军士官生的人数,常出现不一致,而留日陆军士官生在近代中国的地位与作用日益得到学术界的关注。所以,本文拟从相关史料的来源、人数统计所要说明的一些特殊情况和其人数变化所反映的中日关系等方面进行梳理与考证。     

新式整军运动的历史考察及启示

随着人民解放战争进入战略进攻阶段,部队中出现了一些新情况新问题.为了解决这些问题,1947年冬至1948年夏,人民解放军利用作战间隙,结合土改和整党运动,开展了以诉苦和三查(查阶级、查工作、查斗志)三整(整顿组织、整顿思想、整顿作风)为主要内容的新式整军运动.通过新式整军运动,人民解放军官兵的精神面貌焕然一新,部队战斗力有了很大提高,为取得解放战争的胜利奠定了坚实的基础.     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

LabWindows／CVI环境下虚拟仪器驱动程序的开发

IVI仪器驱动程序消除了虚拟仪器系统中的测试冗余 ,提高了测试速度和测试系统中同类仪器的互换性。研究了IVI仪器驱动程序的结构、特点和工作机制 ,提出了在LabWindows/CVI环境下开发IVI仪器驱动程序的方法和步骤。     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

无线传感器网络中基于有限反馈的协同MISO传输方案

为解决无线传感器网络中节点能量受限,文中提出一种基于有限反馈的协同M ISO传输方案,此方案通过接收端反馈给簇头节点的信道增益比值来调整簇头节点和协同节点的发射功率。通过联合优化传输速率和协同节点数,使得网络总能耗最小。分析和仿真结果表明,此方案能有效降低网络的总能耗。     

一种防空导弹无线分布式信息共享系统

以PCI04嵌入式工控机为核心设计主控单元,以嵌入式单片机为核心设计从属单元,并应用GPS OEM接收板、AMAI)4550无线通信模块等,构建无线主从分布式信息共享系统.在该系统的支持下,大型防空导弹武器系统和若十便携式防空导弹间可以进行信息共享和交互,集成为一个以大型防空导弹武器系统为中心的防空作战体系,通过优势互补和邯同作战,能够实现作战效能的倍增.     

遥控引信技术反导应用

随着中口径舰炮发射率和系统射击精度的提高,以及弹药技术的发展,尤其是高技术引信的应用为提高中口径舰炮武器系统的反导效能提供了一条有效技术途径。针对水面舰艇防御反舰导弹的作战需求,基于中口径舰炮武器系统现有技术状态,提出了应用遥控引信技术提高系统反导效能的技术方案。通过仿真计算和对比分析,阐述了该方案的可行性和有效性,并进一步探讨了系统的相关技术指标和技术实现途径。     

Retailer's rationale to refuse consumer returns in supply chains

While accepting consumer returns has long been proposed as a solution to resolve the consumer valuation uncertainty problem, there are still a sizable portion of retailers who insist on a “no return” policy. In this article, we offer an economic rationale for these seemingly unreasonable strategies in a supply chain context. We demonstrate when and why the retailer may benefit from refusing consumer returns, even though offering consumer returns allows the supply chain to implement the expostmarket segmentation. Granting the retailer the right to refuse consumer returns may sometimes improve supply chain efficiency: it eliminates the manufacturer's attempt to induce inefficient consumer returns and bring the equilibrium back to that in the vertically integrated benchmark. We also find that the refund and the retail price can move in the opposite directions when product reliability varies, and consumer returns have a nontrivial impact on the quality choice. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 686–701, 2015     

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