Ein lösbarkeitskriterium für ein mehrstufen – mehrsorten – transportproblem

A variant for checking a solvability eriterion for multilevel multisort transportation problem is given.     

双向流固耦合作用下狭窄左冠状动脉内两相血流分析

基于血流与血管壁间双向流固耦合作用,将血液设为两相流体,运用计算流体力学方法对左冠状动脉内血流进行瞬态数值模拟.研究了一个心动周期内典型时刻下左冠状动脉内血流分布特性,并与Newton(牛顿)血液和两相血液模型对比,分析了两相血液和流固耦合作用对血流特性的影响.结果表明,左冠状动脉左回旋支远段和钝缘支近心端外侧分布了低速涡流区,该区域内壁面切应力和红细胞体积分数均较小,为动脉粥样硬化的形成与发展提供了合适的生理环境.左冠状动脉分叉处管壁形变量较大,引起管壁内膜功能发生紊乱,促进了粥样硬化斑块的形成.3种血液模型对比可知,红细胞的流动特性对血流速度及壁面切应力等血流动力学特性影响较大,双向流固耦合模型更符合真实的血液流动情况.     

Optimal error estimates of a decoupled scheme based on two-grid finite element for mixed Stokes–Darcy model

Although the numerical results suggest the optimal convergence order of the two-grid finite element decoupled scheme for mixed Stokes–Darcy model with Beavers–Joseph–Saffman interface condition in literatures, the numerical analysis only gets the optimal error order for porous media flow and a non-optimal error order that is half order lower than the optimal one in fluid flow. The purpose of this paper is to fill in the gap between the numerical results and the theoretical analysis.     

Macro‐hybrid mixed variational two‐phase flow through fractured porous media

Macro‐hybrid mixed variational models of two‐phase flow, through fractured porous media, are analyzed at the mesoscopic and macroscopic levels. The mesoscopic models are treated in terms of nonoverlapping domain decompositions, in such a manner that the porous rock matrix system and the fracture network interact across rock–rock, rock–fracture, and fracture–fracture interfaces, with flux transmission conditions dualized. Alternatively, the models are scaled to a macroscopic level via an asymptotic process, where the width of the fractures tends to zero, and the fracture network turns out to be an interface system of one less spatial dimension, with variable high permeability. The two‐phase flow is characterized by a fractional flow dual mixed variational model. Augmented two‐field and three‐field variational reformulations are presented for regularization, internal approximations, and macro‐hybrid mixed finite element implementation. Also abstract proximal‐point penalty‐duality algorithms are derived and analyzed for parallel computing. Copyright © 2016 John Wiley & Sons, Ltd.     

混合无等待流水线干扰管理调度方法研究

针对带分批约束的混合无等待流水加工环境中干扰事件的出现导致初始调度计划发生偏离的问题,研究如何运用干扰管理理论来应对工件变更扰动情况,建立了兼顾最小化工件完工时间加权和指标(初始调度目标)和最小化工件完工滞后时间加权和指标(偏离校正目标)的干扰管理调度模型,提出了双层微粒群优化策略与随机多邻域搜索机制相结合的混合求解算法。数值算例仿真实验结果表明,包含“插入-交换”大概率邻域搜索算子的混合微粒群优化算法求解本文所构建的干扰管理调度模型是有效的。     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

有预算限制的最大多种物资流问题

研究有预算限制的最大多种物资流问题,给出了这个问题的不依赖物资数k的全多项式时间近似算法,其算法复杂性是O~(-ε2m2).同时,利用有预算限制的最大多种物资流问题的研究结果,我们也得到了费用最小的最大多种物资流问题的近似算法和算法复杂性.     

Large Time Behavior of a Weak Solution for Non-Newtonian Flow

This paper concerns large time behavior of a regular weak solution for non-Newtonian flow equations. It is shown that the decay of the solution is of exponential type when the force term is equal to zero and the domain is bounded. Moreover, the ratio of the enstrophy over the energy has a limit as time tends to infinity, which is an eigenvalue of the Stokes operator.     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

Description of 2-integer continuous knapsack polyhedra

In this paper we discuss the polyhedral structure of several mixed integer sets involving two integer variables. We show that the number of the corresponding facet-defining inequalities is polynomial on the size of the input data and their coefficients can also be computed in polynomial time using a known algorithm [D. Hirschberg, C. Wong, A polynomial-time algorithm for the knapsack problem with two variables, Journal of the Association for Computing Machinery 23 (1) (1976) 147–154] for the two integer knapsack problem. These mixed integer sets may arise as substructures of more complex mixed integer sets that model the feasible solutions of real application problems.