空气源热泵机组结霜问题的实验分析

基于空气源热泵在低温寒冷地区运行中遇到的结霜问题,对不同风速工况下,结霜过程中设备性能的变化进行分析,以换热量、换热系数为指标对不同翅型换热器的换热特性进行研究.实验结果显示:换热器结霜过程中,换热过程主要分为初始增加段、换热平稳段、缓慢衰减段、后期平稳等四段,结晶体在增加空气湍流度强化换热的同时,也增加了换热热阻使换...     

一维热传导方程热源反问题基于最小二乘法的正则化方法

研究一维热传导方程热源反问题.给出基于最小二乘支持向量机（LS-SVM）求解的半解析表达式,此外还给出一种参数调节方法以及算法稳定性的证明.数值实验表明该方法具有较高的数值精度和稳定性.     

On the regularization method of the first kind of Fredholm integral equation with a complex kernel and its application

The regularized integrodifferential equation for the first kind of Fredholm integral equation with a complex kernel is derived by generalizing the Tikhonov regularization method and the convergence of approximate regularized solutions is discussed. As an application of the method, an inverse problem in the two-demensional wave-making problem of a flat plate is solved numerically, and a practical approach of choosing optimal regularization parameter is given. Project supported by the National Natural Science Foundation, of China     

Meshless acoustic analysis using a weakly singular Burton-Miller boundary integral formulation

The Burton-Miller boundary integral formulation is solved by a complex variable boundary element-free method (CVBEFM) for the boundary-only meshless analysis of acoustic problems with arbitrary wavenumbers. To regularize both strongly singular and hypersingular integrals and to avoid the computation of the solid angle and its normal derivative, a weakly singular Burton-Miller formulation is derived by considering the normal derivative of the solid angle and adopting the singularity subtraction procedures. To facilitate the implementation of the CVBEFM and the approximation of gradients of the boundary variables, a stabilized complex variable moving least-square approximation is selected in the meshless discretization procedure. The results show the accuracy and efficiency of the present CVBEFM and reveal that the method can produce satisfactory results for all wavenumbers, even for extremely large wavenumbers such as k = 10 000.     

Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions

We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups – those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial feasible integer solution, we generate logic cuts based on our analysis before solving the problem with branch and bound. Computational testing, including the set of problems in the OR-library and our own set of difficult problems, shows our approach helps to solve difficult problems in a reasonable amount of time and, in most cases, with a fewer number of nodes in the search tree than leading commercial software.     

Existence and uniqueness results for a fractional two‐times evolution problem with constraints of purely integral type

This paper deals with a fractional two‐times evolution equation associated with initial and purely boundary integral conditions. The existence and uniqueness of generalized solution are proved. The classical functional method based on a priori estimates and density used by many authors in the case of nonfractional differential equations is applied for the time fractional case. Copyright © 2015 John Wiley & Sons, Ltd.     

Challenging Students to View the Concept of Area in Triangles in a Broad Context: Exploiting the Features of Cabri-II

This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment.     

考虑路径风险的需求不确定应急物流定位-路径问题

针对自然灾害对路网造成的破坏性和受灾点物资需求量的不确定性,综合考虑应急物流路径风险和物资分配的时间公平性,将路径风险定量化为路径通行能力风险、路径损毁风险和路径复杂性,基于鲁棒优化理论,以最小化车辆最长配送时间和应急物流系统总成本为目标,建立了双目标多物资定位-路径优化模型,采用遗传算法对其求解,以汶川地震应急救援相关数据为例进行了数据仿真实验。实验结果的对比分析表明:在考虑路径风险下,随着控制系数的增加,系统总成本和最长配送时间目标值均呈现增大的趋势;受灾点的物资需求扰动越大,构建应急物流系统的总成本越高。算例结果也验证了鲁棒优化方法在处理不确定需求方面的有效性,为解决自然灾害后应急设施点的开设和救援物资的安全及时准确配送提供了有效的方法。     

体上右线性方程组的反问题

设Ｆ，Ｋ，Ω分别表示一个任意的体、一个具有对合反自同构的体和一个实四元数体，Ｆ^ｎ表示Ｆ上的ｎ维右向量空间．本文推广和改进了实线性方程组的反问题及一系列结果，解决了Ｆ上右线性方程组更具一般性的反问题（简称ＩＰＳ）：给定ｂ∈Ｆ^s和α_ｉ∈Ｆ^ｎ（ｉ＝１，…，ｍ≤ｎ）满足ｒａｎｋ［α₁，…，α_m］＝ｍ，求所有的ｓ×ｎ矩阵Ａ使Ａα_ｉ＝ｂ（ｉ＝１，…，ｍ）．当ｓ＝ｎ时     

Iterative patching and the asymmetric traveling salesman problem

Although Branch-and-Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. In this paper, we investigate iterative patching, a technique in which a fixed patching procedure is applied at each node of the BnB search tree for the Asymmetric Traveling Salesman Problem. Computational experiments show that iterative patching results in general in search trees that are smaller than the classical BnB trees, and that solution times are lower for usual random and sparse instances. Furthermore, it turns out that, on average, iterative patching with the Contract-or-Patch procedure of Glover, Gutin, Yeo and Zverovich (2001) and the Karp–Steele procedure are the fastest, and that ‘iterative’ Modified Karp–Steele patching generates the smallest search trees.