谈奥巴马时代美国的联合国政策

奥巴马对联合国政策的调整,反映出奥巴马政府全球外交和安全战略的需要,体现了实用主义外交风格。较之于其前任,奥巴马将更加重视联合国维和行动,并让联合国更多地参与解决包括伊拉克和阿富汗在内的热点问题。奥巴马的联合国政策面临挑战,联合国仅仅是奥巴马实现美国国家利益的手段之一。     

改革开放以来党对军队绝对领导的理论与实践

坚持党对军队的绝对领导是人民军队建军治军的根本原则和根本制度.伴随改革开放伟大历史进程的不断推进,党的历代领导集体毫不动摇地坚持党对军队的绝对领导,并在各个历史时期的国防和军队建设中丰富发展了这一根本原则的理论与实践.改革开放初期,党对军队绝对领导原则在拨乱反正中得以强调和坚持;改革深化时期,党对军队绝对领导原则在继承发扬中得以丰富和发展;新世纪新阶段,党对军队绝对领导原则在开拓创新中得以巩固和完善.     

“和声”词义的历史辨析

“和声学”作为音乐专业的骨干理论课程,涉及到音乐的各个领域。本文从音乐发展的不同时期,探讨“和声”词义的演变过程及具体内涵。     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

卫星激光防护技术

从两方面探讨轨道卫星激光防护技术.介绍卫星光电探测器激光防护设计原理及新型防护技术.对提高卫星结构材料的抗激光损伤能力提出几种实用方法.     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

宋代商标及其使用研究

宋代商业分工细致,竞争激烈,商人为了招揽顾客,推销自家商品,开始用“新颖”、“文雅”的名称命名自家商品,逐渐形成文字、图形或实物等不同类别的商品标识。宋代商标的使用,既维护了生产者和经营者的利益,也有利于商业经济的正常秩序;既提高了商品的信誉,保证了商品的质量,又扩大了商品服务的范围,增加了商品在市场中的竞争力。     

雪域高原的伟大变革——纪念西藏民主改革50周年

旧西藏实行的是政教合一、僧侣贵族专政的封建农奴制度,严重阻碍了生产力的发展,社会变革势所必然.西藏和平解放后,中央肯定了西藏在条件成熟时进行社会改革的必要性,同时规定:"有关西藏的各项改革事宜,中央不加强迫,西藏地方政府应自动进行改革".但是,西藏上层反动集团妄图永远维持封建农奴制度不变,勾结帝国主义,于1959年3月,公开撕毁<十七条协议>,发动了全面叛乱.中央决定在平息叛乱的同时实行民主改革.民主改革的胜利,摧毁了延续千年的封建农奴制度,实现了西藏民族社会历史的大飞跃.