另一类线性传热时热漏和有限热源对两热源热机最优构型的影响

在一类存在热漏和有限高温热源的两热源热机的基础上，考虑传热服从另一类线性定律Ｑ∝△（Ｔ－１），寻求其给定循环周期下的最优构型．结果表明，对无限热容热源情形，热漏的存在不改变循环的最优构型；对有限热容热源情形，无热漏使循环构型成为某种“广义卡诺循环”，而存在热漏时，循环的构型则完全不同．同时，给出了各种不同情况下热机的最佳功率效率关系．     

基于热力学第二定律的直喷式柴油机性能分析

这项研究的目的是发展用热力学第二定律分析柴油机在不同运行工况性能的能力.研究是针对一台12150L型柴油机进行的,以发动机气缸内部压缩、燃烧、膨胀、瞬时传热和换气过程的理论模拟模型为基础,应用热力学第二定律分析,度量各种能量品质的优劣和不可逆损失值,并且与热力学第一定律的能量平衡进行了比较.分别改变循环喷油量、燃烧开始角、燃烧持续期及燃烧品质指数.研究了参数变化对缸内可用能和热力学第一定律效率和第二定律效率的影响.     

Q∝T~n时不可逆卡诺热泵的最优性能

非线性传热条件下的内可逆卡诺热机最优性能有了一些讨论,本文将导出不可逆卡诺热泵工作于非线性传热 Q■条件下,最佳供热系数д与泵热率π的关系。据此可确定任意泵热率时所对应的供热系数界限。最后,讨论了这一关系的一些应用,所得结果包含了经典热力学及内可逆线性传热情况下的有关结论,为实际热泵设计提供新的理论依据。     

怎样判断密闭气体内能的变化

气体的内能是指气体内所有分子的动能和势能的总和.是个状态量,由气体物质的量、温度、体积等因素决定.改变气体内能的物理过程有热传递和做功两种,它们在改变气体内能的效果上是等效的,但本质是不同的.导致判断密闭气体内能变化的方法灵活多变,成为学生解题的难点.同时此知识点是高中物理热学部分的重点.     

内可逆卡诺热泵的生态学优化性能

本文导出了内可逆卡诺热泵的供热量、供热率和供热系数的耗散量,以反映热泵供热率π与其耗散φ_cT_Lσ,即热泵熵产率σ、低温热源温度T_L和可逆供热系数φ_c乘积之间最佳折衷的“生态学”性能E=π-φ_cT_Lσ为目标,基于牛顿和线性唯象传热定律,研究内可逆卡诺热泵的优化问题,得到最大E性能时的供热系数界限及相应的供热率和熵产率。     

有限时间制冷机生态学的优化性能

本文研究非线性传热Ｑｏ∝（△Ｔ）￣ｎ条件下的内可逆卡诺制冷机,给出可逆与不可逆循环的制冷量之间的关系式,由此建立了制冷机生态学的优化目标Ｆ,并求得Ｆ与制冷系数的最优关系,最后讨论制冷机生态学的工作优域,为更有效地利用能量和保护自然资源提供新的依据。     

负绝对温度状态的热力学特性

本文评述了可能出现负绝对温度的条件;阐述包含负绝对温度时热力学第二定律的改述、热力学循环、卡诺定理以及平衡问题;还讨论了T=±∞和T=±0的态的熵、内能和热容量的性质、功热转换特性和T=±0不能达到问题。     

线性唯象传热规律下热机内可逆热经济学研究

对符合线性唯象传热规律(q∝Δ(T-1))的热机内可逆热经济学做了进一步研究,导出了在给定条件下Novikov热机的最优利润解析式,并得到了最优利润和相应的效率同其它参数间的关系.     

成都双流国际机场二跑道膨胀土改性试验分析

膨胀土的工程性质受周围环境及气候的影响较大,而膨胀土的判定没有统一的标准,特别是针对机场跑道膨胀土的判定.膨胀土与水作用时,随着含水量的增加其体积将明显增大,显示了强烈的膨胀性,当这种膨胀性受到限制时,必然产生膨胀力.针对成都双流国际机场跑道路段的地质条件和设计要求,确定出机场跑道膨胀土的判定标准,并根据该标准对不同土层的膨胀土填料进行改性实验,并通过不同施工工艺结果继续比较,以确定最佳的改良膨胀土,为土石方工程施工提供主要控制参数.通过大量的试验分析,最后得出符合实际情况的合理的施工工艺和技术参数.     

传热规律对卡诺热泵有限时间(火用)经济最优性能的影响

本文导出了一种较为普遍的传热规律 q∝△(T~n)时内可逆卡诺热泵的最佳供热系数、利润率关系,并藉此讨论了几种传热规律时内可逆卡诺热泵的有限时间(火用)经济最优性能,得到了一些新的普适结果。     

Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种新的雷达抗干扰技术

提出了一种新的雷达抗干扰技术,即波形选择处理技术,指的是从接收的回波中分析出哪些脉冲未受干扰或受干扰程度较小,从而可以有选择地将这些脉冲信号进行相应的信号处理。分析结果表明,通过对回波进行波形选择处理,可以进一步增强雷达的抗干扰能力。     

Concavity and monotonicity properties in a groundwater management model

We consider a discrete‐time groundwater model in which the cost of pumping takes a slightly different form to that which has been traditional in the research literature to date. This enables us to prove that (a) the optimal pumping quantity is nondecreasing in the ground water stock, (b) the stock level remaining after each period's pumping is also nondecreasing in the groundwater stock, (c) the optimal decision is determined by maximizing a concave function, and finally (d) the optimal pumping quantity is nonincreasing in the number of periods to go. We show that (a)–(c), while intuitive, do not hold under traditional modeling assumptions. We also explain the connections between our results and similar ones for some classic problems of operations research. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2011     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

载人飞船返回段的最优控制

本文介绍空间飞船再入段最优制导方法。纵向制导采用二次型性能指标最优的线性系统,得到最优控制规律。侧向制导利用庞特里亚金最小原理,得到最优开关曲线。结果表明,这些控制规律优于Rodney C.所介绍的制导方法。     

一类随机差分方程的解序列的最优停止规则

设报酬序列{x_(?),(?),n≥0}满足随机差分方程x_(n+1)=x_n+a_n+b_nε_(n+1)(ε_1,ε_2,…为白噪声序列)。本文讨论了用有限情形{x_n,0≤n≤N}的Snell包逼近无限情形{x_n,n≥0)的Snell包的条件,得到了x_n=E(x_n|(?))((?)=σ{ε_0,ε_1,…,ε_n},ε_0=0)的Snell包r_n的分解形式和最优停时存在的条件。最后讨论了最优停止规则的迭代计算法,并得出了迭代过程在有限步停止的充分条件。     

搜索路径给定时的搜索对策问题及其应用

搜索路径给定时的最优搜索方案问题,也可以理解为是关于搜索者和目标的二人对策问题,主要讨论了当搜索路径给定时的单个搜索者和单个目标的搜索对策问题。首先根据问题的特点,利用动态规划和迭代的方法,确定关于目标逃逸路径混合策略的最优分区,证明该分区是多面体凸集;针对目标不同逃逸路径的分区,求出搜索者的最大期望收益,再将问题转化为二人有限零和对策,计算出搜索者的支付矩阵,确定最优搜索策略。最后结合海军护航行动,对我舰载直升机搜索小型海盗船进行分析和计算,说明搜索路径给定时的最优搜索对策对于双方的资源分配和提高搜索效率具有一定的应用价值。     

A search game on a cyclic graph

There is a finite cyclic graph. The hider chooses one of all nodes except the specified one, and he hides an (immobile) object there. At the beginning the seeker is at the specified node. After the seeker chooses an ordering of the nodes except the specified one, he examines each nodes in that order until he finds the object, traveling along edges. It costs an amount when he moves from a node to an adjacent one and also when he checks a node. While the hider wishes to maximize the sum of the traveling costs and the examination costs which are required to find the object, the seeker wishes to minimize it. The problem is modeled as a two‐person zero‐sum game. We solve the game when unit costs (traveling cost + examination cost) have geometrical relations depending on nodes. Then we give properties of optimal strategies of both players. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011