高速航空燃油泵水力设计及两相流场数值模拟

为了满足下一代飞机发动机燃料供给的需求,根据供油系统的性能指标,确定燃油泵结构型式,基于速度系数法计算燃油泵的主要结构参数,完成高速燃油泵水力设计,建立其三维模型并进行网格划分.借助ANSYS-CFX仿真软件,基于RNG k-ε湍流模型及Zwart空化模型,实现燃油泵非空化及空化状态下的内流场数值模拟,分析其外特性变化趋势及压力、速度分布规律并预测其空化性能.结果表明:高速燃油泵扬程、效率、功率随流量的变化符合离心泵性能变化规律,且在设计点附近达到最高效率82.76％;有效汽蚀余量较大时,燃油泵扬程基本不发生变化,当有效汽蚀余量减小到一定值,扬程开始缓慢下降而后急剧减小,扬程下降3％对应的临界汽蚀余量为12.7m.     

一种新型镍基高温合金组织及性能的研究

GH4742(俄ЭП742)合金属于典型的高合金化难变形镍基高温合金涡轮盘材料，本文通过调整Al、Ti、Nb的成分对GH4742合金进行改进，发明了一种新型镍基高温合金。利用JMatPro模拟得到平衡相图，再利用光学金相显微镜和场发射扫描电镜对合金的晶粒组织、碳化物以及γ′相分布情况进行观察，同时对力学性能进行了检测。结果表明：平衡状态下的合金从1 400 ℃到300 ℃的冷却过程中相转变可概括为L → L+γ → L+γ+MC →γ+MC+γ′ → γ+γ′+MC+μ → γ+γ′+μ+MC+M23C6 → γ+γ′+μ+MC+M23C6+σ，780 ℃下析出γ′相的质量分数为40.88%；锻造变形工艺为γ+γ′双相区变形，1 120 ℃固溶后经过标准双时效处理(850 ℃/6 h/AC＋780 ℃/6 h/AC)后的显微组织明显可见两种不同尺寸晶粒，小晶粒(13 μm)呈项链状分布于大晶粒(100 μm)周围；该合金中的碳化物主要为大尺寸、不规则形状的MC(NbC、TiC、VC)，断续穿晶和沿晶分布；强化相γ′相的分布状态也有大小两种不同尺寸，γ′I相平均直径为600 nm，γ′II相平均直径为150 nm，两种尺寸γ′相强化的良好匹配，使得该合金在具有较高强度的同时又具有较高的塑性，力学性能优异，室温抗拉强度1 478 MPa，尤其是650 ℃/863 MPa下的持久性能为194 h，远远超过GH4742合金650 ℃/823 MPa持久下50 h的标准。     

焊接质量的在线控制与预测研究现状及发展趋势

由于影响焊接质量的因素很多，焊接产品的质量难以保证，开展焊接质量的在线控制与预测具有极其重要的意义，为促进国内焊接质量的在线控制与预测研究工作，介绍了国内外焊接质量的在线控制与预测方面的研究进展，同时分析了未来焊接质量的在线控制与预测研究的发展趋势。     

激光近成形金属零件过程中涂覆层的组织及性能

利用激光近成形技术，在1Cr18Ni9Ti不锈钢基体上采用镍基合金和钴基合金粉末进行单道涂覆烧结试验，获得具有快速凝固组织特征的激光涂覆层，并分析了影响涂覆层组织和质量的激光参数和工艺参数。     

锌再生利用及发展对策探讨

本文简述了我国锌工业生产、消费和再生锌工业发展的现状,指出了我国再生锌工业发展缓慢,技术装备水平低,企业生产规模小等问题。提出了建立规范化的管理制度,在政策上鼓励发展废锌材料的回收利用,加速我国废锌材料的回收利用程度。     

一种基于节点位置和密度的非均匀分簇路由算法

分析了现有分簇路由算法,提出了基于节点位置和密度的非均匀分簇路由算法。簇头选举阶段,考虑了节点的剩余能量,并引入竞争机制进行簇头选择;成簇阶段,综合考虑节点与基站的距离、节点密度以进行非均匀分簇,达到节点能耗均衡的效果,同时解决路由热区问题;簇间路由阶段,通过设立通信簇头节点,使簇间数据转发任务从簇头中分离,簇头节点只负责簇内的数据收集和融合,而通信簇头节点负责簇间数据传输,减少了簇头的能量消耗。实验结果表明,改进后的路由算法能够有效地均衡网络负载,并显著地延长网络的生命周期。     

基于预分类的逆变异分类器算法

遗传算法已经在许多领域得到了成功的应用,在解决模式识别问题时,由于遗传中的变异过程的存在导致了模式差异,如果能够减少这种差异性,就可以提高模式分类的正确率。针对这种情况,本文提出了在预分类基础上的一种逆变异算法,该算法采用遗传算法中变异过程的逆过程,来减少模式的差异性,达到提高模式分类正确率的目的。在ORL人脸库上的实验结果表明,该分类器的模式识别率明显高于传统的分类器算法及遗传算法。     

Exploring cell tower data dumps for supervised learning-based point-of-interest prediction (industrial paper)

Exploring massive mobile data for location-based services becomes one of the key challenges in mobile data mining. In this paper, we investigate a problem of finding a correlation between the collective behavior of mobile users and the distribution of points of interest (POIs) in a city. Specifically, we use large-scale cell tower data dumps collected from cell towers and POIs extracted from a popular social network service, Weibo. Our objective is to make use of the data from these two different types of sources to build a model for predicting the POI densities of different regions in the covered area. An application domain that may benefit from our research is a business recommendation application, where a prediction result can be used as a recommendation for opening a new store/branch. The crux of our contribution is the method of representing the collective behavior of mobile users as a histogram of connection counts over a period of time in each region. This representation ultimately enables us to apply a supervised learning algorithm to our problem in order to train a POI prediction model using the POI data set as the ground truth. We studied 12 state-of-the-art classification and regression algorithms; experimental results demonstrate the feasibility and effectiveness of the proposed method.     

Game‐Based Valley‐Fill Charging Coordination for Large‐Population Plug‐in Electric Vehicles

Charging coordination of large‐population autonomous plug‐in electric vehicles (PEVs) in the power grid can be formulated as a class of constrained optimization problems. To overcome the computational complexity, a game‐based method is proposed for the charging problems of the PEV population, which is composed of homogeneous subpopulations, such that individuals update their best charging strategies simultaneously with respect to a common electricity price determined by the total demand. To mitigate the oscillation behavior caused by the greedy behavior for the cheap electricity by individuals, a deviation cost is introduced to penalize against the deviation of the individual strategy from the average value of the homogeneous subpopulation. By adopting a proper deviation cost and following a best strategy update mechanism, the game systems may converge to the socially optimal valley‐fill Nash equilibrium. Simulation examples are studied to illustrate the results.