有限体积KFVS方法在二维溃坝中的应用

本文采用了基于KFVS格式的有限体积方法 (FVM)求解了控制水流运动的二维浅水方程 ,建立了二维水坝瞬间溃坝的洪水演进模型 .并应用此模型模拟了二维非对称溃坝和对称溃坝情形下坝左下角有障碍物时的洪水波演进过程 .模拟结果表明该数学模型对二维浅水运动的模拟很有效 .     

Towards a new framework for evaluating systemic problem structuring methods

Operational researchers and social scientists often make significant claims for the value of systemic problem structuring and other participative methods. However, when they present evidence to support these claims, it is usually based on single case studies of intervention. There have been very few attempts at evaluating across methods and across interventions undertaken by different people. This is because, in any local intervention, contextual factors, the skills of the researcher and the purposes being pursued by stakeholders affect the perceived success or failure of a method. The use of standard criteria for comparing methods is therefore made problematic by the need to consider what is unique in each intervention. So, is it possible to develop a single evaluation approach that can support both locally meaningful evaluations and longer-term comparisons between methods? This paper outlines a methodological framework for the evaluation of systemic problem structuring methods that seeks to do just this.     

A competitive (dual) simplex method for the assignment problem

Where there is abundance of mystery and confusion in every direction, the truth seldom remains hidden for long. It's a matter of having plenty of angles to go at it from. Only the utterly simple crimes - the simplex crimes, you may say - have the trick of remaining baffling. - Sir John (from Michael Innes,The Open House (A Sir John Appleby Mystery), Penguin Books, 1974).A dual simplex method for the assignment problem leaves open to choice the activity (i,j) of rowi and columnj that is to be dropped in pivoting so long asx _ij < 0. A choice (i,j) over columnsj having at least 3 basic activities that minimizesx _ij is shown to converge in at most ( ₂ ^n-1 ) pivots, and at most O(n ³) time, and it is argued that on average the number of pivots is at mostn logn. Dedicated with affection to George B. Dantzig on the occasion of his seventieth birthday.     

Positive Solutions for Semipositone ( p,n − p ) Right Focal Boundary Value Problems

We consider the ( p , n m p ) right focal boundary value problem: $${\matrix{{(- 1)^{n - p} u^{(n)} \! = \lambda \;f(t, u), } \hfill & \ {{\rm for }\ 0 \lt t \lt 1, } \hfill \cr \quad \quad \,{u^{(i)} (0) = 0, } \hfill & {0 \le i \le p - 1, } \hfill \cr \quad \quad \,{u^{(i)} (1) = 0, } \hfill & {p \le i \le n - 1, } \hfill \cr}} $$ where 1 h p h n m 1 is fixed and u > 0. Using a fixed point theorem for operators on a cone, we develop criteria for the existence of positive solutions of the boundary value problem for u on a suitable interval.     

大型反倾库岸岩体变形过程及破坏机制数值模拟

随着边坡地质结构、地层岩性和诱发因素的不同,反倾岩体的主控变形破坏模式都会发生改变。金沙江龙蟠边坡岩体主要为反倾向千板岩和砂岩互层状结构,坡脚河床深厚覆盖层构成了边坡的软弱支座。本文运用离散单元法模拟了大型反倾库岸岩体在漫长的地质历史时期中的变形演化过程,并基于反倾岩体变形的时效性观点,引入强度折减法分析边坡在不同阶段的剪切屈服区扩展情况及相应的稳定性状态。结论表明龙蟠边坡变形岩体是重力弯曲蠕变为主导的成因机制,并归纳提出了软基效应和互层效应共同作用下的大规模反倾岩体的累进性剪切破坏模式,俗称“龙蟠模式”。     

A General Vehicle Routing Problem

In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles. The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement approaches based on the idea of changing the neighbourhood structure during the search.     

Making decisions in the absence of clear facts

Bennis and O’Toole [Bennis, W.G., O’Toole, J., 2005. How business schools lost their way. Harvard Business Review 83, 96–104] have recently argued that decision makers need guidance in ‘making decisions in the absence of clear facts’. As such, decision makers must be able to resourcefully use whatever limited information is available and advantageously portray its implications. Based on recently published theory which directly addresses this requirement, this paper demonstrates, through a practical example, how decision makers can make systemic decisions in situations characterized by extremely limited information and, furthermore, what form such decisions can take. Evidence is provided, therefore, that operational research can effectively address what appears to be a gap in management training.     

Lehmer's problem for compact Abelian groups

We formulate Lehmer's Problem concerning the Mahler measure of polynomials for general compact abelian groups, introducing a Lehmer constant for each such group. We show that all nontrivial connected compact groups have the same Lehmer constant and conjecture the value of the Lehmer constant for finite cyclic groups. We also show that if a group has infinitely many connected components, then its Lehmer constant vanishes.

     

A facility location and installation of resources model for level of repair analysis

The Level of Repair Analysis – LORA – is an analytic methodology aimed at determining: (i) the optimal location of facilities that compose a maintenance structure; (ii) the quantity of required resources in each facility; and (iii) the best repair policies, i.e., rules that determine if a given component should be discarded or repaired, and where those actions should take place. This work presents a mixed-integer programming model for LORA that is more comprehensive than others in the literature, being suitable to many practical situations. The model was applied to 15 substantial real world problems, and considering distinct maintenance policies to some of them, resulted in 22 different solutions, all of which could be achieved by a commercial Mixed-Integer Programming (MIP) solver in reasonable times.