基于新课程的地理教师专业技能及结构

随着新课程改革的逐步实施,人们逐渐意识到,在新课程环境下促使教师理念与行为的变革,将是课程改革取得成功的前提和保证。本文以新课程理念为指导,以地理课程的特殊性质和功能为基础,阐述了当代地理教师从事地理教育教学应该具备的专业技能,构建了基于新课程的地理教师专业结构。探讨在新课程标准下教师专业技能发展,对于改革师范教育,优化培养模式,加强教师队伍的现代化建设和提高质量具有重要意义。     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Free riding in a multi‐channel supply chain

Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

论如何推进当代大学生的马克思主义大众化

当代大学生作为中国特色社会主义事业的接班人,其价值观、人生观、世界观的培养,与推进大学生的马克思主义大众化密切相关。因此,大学生的马克思主义大众化何以必要、何以可为、应以何为成为推进大学生马克思主义大众化亟待解决的重大问题。     

兵器工业产品失效分析工作浅论

本文主要阐述了失效分析的重要性,并结合实际例举了一些实例,提出了如何开展失效分析工作,以及对兵器行业开展失效分析工作提出了建设性的建议。     

一类广义二重积分

首先利用一个收敛级数构造了R上的一个特殊开集G,然后利用平面点集可求面积的充要条件,在平面上引入了一个有界的不可求面积的积分区域Ω,最后在Ω上定义了一个取正值的分段函数,并证明了其在Ω上的广义二重积分存在。     

军事欺骗战法分析的数学方法-应用*

针对军事欺骗战法定量分析困难的问题,采用基于贝叶斯统计推断和博弈均衡分析的数学方法,在理论上为解决此难题提供了一种可行的方法.该方法首先定义基本概率矩阵,然后根据贝叶斯原理为交战双方构造用于统计推断的主观概率矩阵,并在由两个主观概率矩阵元素构成的偏序链与实施军事欺骗机会之间建立对应关系,再将此关系推广到基本概率矩阵,即是否存在实施军事欺骗的机会将由基本概率矩阵元素构成的偏序链决定.对理论成果的初步应用表明:通过分析由战场情报信息构成的基本概率矩阵的偏序链,可以科学地运用军事欺骗和反军事欺骗战法.     

人民空军院校建设的历程、特点及启示

60多年来,人民空军院校建设始终紧贴空军建设发展和军事斗争准备实际,坚持用科学理论和先进教育理念引领各项工作,培养了一批又一批高素质人才,创造了一项又一项高水平成果,为人民空军的建设与发展提供了强有力的人才和智力支撑。