孤独的儒者——论傅雷的人格

本文从"人格"的角度入手,分析研究傅雷的人格孤独,从人生经历、儒家影响、对艺术的追求等角度,分析了傅雷孤独的深沉内涵,以及对傅雷文艺观的影响。     

发动机平均值模型的开发与检验

建立了一个车用增压柴油机工作过程仿真的平均值模型.这个模型重在描述发动机状态变量的时间平均值,结构紧凑,使用方便,实例计算结果与试验值符合较好,适合于电控柴油机硬件在环仿真系统应用.     

KDM 智能车的数学模型研究

本文确定了对载车数学模型构造方法,并试图以KDM-1移动机器人作为实例,用非完整系统力学当作分析工具,通过实验获得模型数据,并由实车行驶进行检验,几个重要参数由仿真试验校核。数学模型的仿真与室内的行车试验相对比的结果比较一致。对同类载车数学模型的建立提供了有效的方法。     

防空导弹制导系统一体化仿真系统框架

介绍了一种采用现代先进仿真技术思想、支持面向对象的建模与仿真、用于防空导弹全弹道飞行动态仿真的一体化仿真系统框架 ,详细说明了它的主要特点、构成及各部分的功能     

无信息先验下几种不同Bayes估计的比较

讨论了在二项分布场合关于成功率的不同无信息先验分布下的Bayes估计 ,并从Bayse风险的角度对它们进行了比较     

鱼雷雷体特性对其惯性深控系统阶跃响应的影响

分析、对比了两种鱼雷雷体特性对惯性深控系统阶跃响应的影响 ,从中找出对鱼雷定深航行稳定性有较大影响的雷体参数 ,可以为鱼雷总体优化设计提供一定的参考     

双连杆机构发动机运动学分析

对双连杆机构的运动学进行了理论分析,推导出了活塞的位移、速度和加速度公式及活塞侧连杆和曲轴侧连杆摆角公式,并且针对一实例进行了计算,与相同结构尺寸的传统曲柄连杆机构发动机作了比较分析.     

Linux虚拟文件系统层的路径检索加速

为解决 Linux 内核传统路径检索日益凸显的开销问题,提出Staged Lookup以加速路径检索,通过动态缓存热目录来减少文件访问的时延。Staged Lookup的核心在于缓存频繁使用的目录项,从而避免从根节点重复遍历路径。不同于从根结点开始的检索操作, Staged Lookup扩展了搜索策略,允许从最近缓存的目录项向后或向前进行路径检索。在Linux内核版本3.14和5.4上部署Staged Lookup的原型,并开展实际系统测试。实验数据显示,相比于传统的路径检索方式,Staged Lookup能实现高达46.9%的性能提升。     

如何利用MS PROXY2.0实现代理服务

目前比较流行的代理服务器软件有很多,但是代理服务的机理大同小异.本文以 Microsoft Proxy Sery-er2.0为例,介绍一下代理服务器的实现.     

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