慢刀伺服加工环曲面的刀具路径规划方法

如何规划刀具路径、进而获得高质量的数控加工代码,是应用慢刀伺服技术加工环曲面的关键技术之一。提出了基于等距面规划刀位点轨迹的刀具路径规划方法,推导了外凸环曲面的面形方程及其等距面方程,对比分析了两种导动曲线及两种数据点离散方法,优选了刀具路径规划方案,应用VB.net语言编写了慢刀伺服加工环曲面用数控代码生成软件,在Vericut平台上对数控代码进行了仿真验证,直观地展示了虚拟加工面相对理论曲面的残留区域,仿真结果验证了方法的可行性。结果表明:将外凸环曲面方程中的非一次常数项a变为a+r_d,即得到外凸环曲面的等距面方程;所提刀具路径规划方法适用于慢刀伺服加工外凸环曲面;该方法对应用慢刀伺服技术加工其他面型的光学镜面具有借鉴价值。     

Path planning for moving target tracking by fixed-wing UAV

For the automatic tracking of unknown moving targets on the ground, most of the commonly used methods involve circling above the target. With such a tracking mode, there is a moving laser spot on the target, which will bring trouble for cooperative manned helicopters. In this paper, we propose a new way of tracking, where an unmanned aerial vehicle (UAV) circles on one side of the tracked target. A circular path algorithm is developed for monitoring the relative position between the UAV and the target considering the real-time range and the bearing angle. This can determine the center of the new circular path if the predicted range between the UAV and the target does not meet the monitoring requirements. A transition path algorithm is presented for planning the transition path between circular paths that constrain the turning radius of the UAV. The transition path algorithm can generate waypoints that meet the flight ability. In this paper, we analyze the entire method and detail the scope of applications. We formulate an observation angle as an evaluation index. A series of simulations and evaluation index comparisons verify the effectiveness of the proposed algorithms.     

深入学习贯彻习主席重要论述 全面推进军队院校军事理论研究创新发展【将军论坛】

科学的军事理论就是战斗力。在新起点上全面推进军队院校军事理论研究创新发展,必须深入学习贯彻习主席关于军事理论创新的重要论述,着力提高站位、谋篇布局、形成拳头,进一步加强标准统筹、导向统筹、力量统筹和机制统筹,努力为强军兴军实践提供科学理论支撑。     

海上编队传感器管理架构研究

在信息化海战场,获取信息优势是保障作战胜利的基础之一,海上编队传感器管理是提升传感器探测整体效能,从而达成信息优势的关键环节.首先分析了海上编队传感器管理需求,包括组成结构、作用以及编队、平台、传感器各层级的管理需求;其次研究了海上编队传感器管理的总体架构,提出采用混合式的体系结构,设计了事前规划与实时调度2个方面的处...     

多进制多维信号集信道容量分析及其计算

描述了信道容量的一般概念 ,具体就波形信道 ,连续信道及离散输入连续输出无记忆信道进行了分析 ,分别导出了它们的信道容量公式。结合几种常见的多进制多维调制技术MPSK、MQAM、L正交信号及其星座分析 ,给出了它们信道容量的Monte Carlo模拟以及数值积分模拟 ,同时分析了由于信号集扩展而带来的编码增益     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

白炽灯对棉质材料的引燃性能研究

通过对不同功率白炽灯引燃100％棉质材料的研究,分析了白炽灯引燃棉质材料引发火灾的危险性。利用半导体点温计分别对不同功率白炽灯表面及棉布的温度进行记录,根据温度随时间的变化情况、可燃物被引燃情况,分析了不同功率白炽灯对棉布的引燃性能。     

基于科学发展观视角下的会计教学改革

随着高等教育的大众化,社会对会计人才需求呈现出多层次的特点,现代会计教育已进入素质教育的新阶段。注重学生创造性思维的培养,注重学生能力与素质的提高应成为各高校今后会计教学改革的方向。本文从科学发展观的视角,在分析了会计本科教学现状的基础上,理性地提出了要实现会计教学培养目标,必须转变教育观念,适应科学发展观的要求,推动会计教学改革。     

调运问题中基于栅格模型的快速路径规划方法

针对调运路径规划这一问题,采用栅格模型表示环境地图,通过设定路径搜索方向权重,剔除不必要的搜索区域,提高了搜索效率.仿真结果表明,该算法能有效地提高路径搜索效率,并能搜索到最优路径.     

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