论国民政府战时关金政策的演变--兼论抗日战争期间中日财政金融的争斗

1930年南京国民政府在海关进口税计征中实施关金政策,确保了关税收入的持续增长,稳定了政府的财政,促进了国民政府的巩固.抗战爆发后,国民政府不断调整关金政策,将原本专用于关税缴纳的特殊票据关金券用于公债募集,并用作市面流通的货币,从而极大地发挥了关金政策的抗战功用.     

试论孙中山的军事伦理思想

本文扼要论述了孙中山的慎战思想、“以德服人,非以武力服人”的军事道德观念,“救国救民,勇于牺牲,甘于奉献”的军人人生观、军人“须具忠、智、仁、勇和决心”的军人道德规范以及“知难行易,身体力行”的军人道德修养观。     

论战后日本军事战略的依附性

二战结束后,日本在国际社会的监督下被迫进行了非军事化改造,“国家永远放弃拥有军队和交战权”的条款被写入日本国宪法。然而,日本在战败后不久就开始了重整军备的步伐,特别是在冷战结束后,其军事实力的发展更是咄咄逼人。这不能不引起人们对日本军事战略的关注和对其依附性的研究。     

应急作战装备物资供应链研究

把供应链管理理论应用到应急作战装备物资供应中,抛弃传统的管理模式,从应急作战装备物资供应链的内涵、应急作战装备物资供应链管理内容、应急作战装备物资供应链管理方法和应急作战装备物资供应链实施策略4个方面进行阐述,旨在提高应急作战条件下装备物资供应保障效率。     

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.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 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     

基于LUT的双正交小波滤波器VHDL模型设计

VHDL是EDA领域中电路设计必不可少的工具。它具有良好的结构化设计和行为建模能力。首先,利用VHDL对双正交小波滤波器复杂算法电路建立结构模型。然后,利用算法建模和数据流建模相结合的混合建模方法建立行为模型。最后,利用仿真软件对模型进行波形仿真,并根据仿真结果对模型进行修改以达到设计要求。     

关于消防执法几个问题的探讨

在消防执法中出现的问题给消防法律法规的贯彻落实带来了相当难度。论述公安消防机构办理“两案”值得商榷、强制性技术规范没有充分保障、火灾统计没有行之有效的监督措施等问题 ,以提高消防执法水平。