Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations

A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.     

裂齿矩形翅片板翅式换热器优化设计的分析

对裂齿矩形翅片板翅式换热器中的裂齿矩形翅片的传热效率作了分析,并以单位质量材耗的换热能力最大为目标函数,分析研究了在不同雷诺数(Re)的操作条件下裂齿矩形翅片间角度、翅片厚、长度、宽度及极厚之间的关系。结果表明:在气体换热的场合下,当Re在某一范围时翅片可有效地起到强化传热的作用。当板厚为5mm,翅片厚为3mm,翅片间夹角为45°～70°,Re为2×10~3～8×10~3,最佳翅片纵向间距与翅片长度和翅片厚度乘积的平方根的比为1.5～2.5,最佳翅片尺寸系数为3～5时,传热强化效果较好。     

Anisotropic mesh adaption by metric‐driven optimization

We describe a Gauss–Seidel algorithm for optimizing a three‐dimensional unstructured grid so as to conform to a given metric. The objective function for the optimization process is based on the maximum value of an elemental residual measuring the distance of any simplex in the grid to the local target metric. We analyse different possible choices for the objective function, and we highlight their relative merits and deficiencies. Alternative strategies for conducting the optimization are compared and contrasted in terms of resulting grid quality and computational costs. Numerical simulations are used for demonstrating the features of the proposed methodology, and for studying some of its characteristics. Copyright © 2004 John Wiley & Sons, Ltd.     

VaR and ES for linear portfolios with mixture of elliptic distributions risk factors

In this paper, we generalize the Linear VaR method from portfolios with normally distributed risk factors to portfolios with mixture of elliptically distributed ones. We treat both the Expected Shortfall and the Value-at-Risk of such portfolios. Special attention is given to the particular case of a mixture of multivariate t-distributions. This is a part of J. SADEFO-KAMDEM PhD Thesis[12] of the Université de Reims, France . It has been presented at the workshop on modelling and computation in Financial Engineering at Bad Herrenalb, Germany May 6-8, 2003. The author is an associate professor at the Department of mathematics, université d’Evry Val d’Essonne.     

油气集输系统新增产能建设拓扑优化方法研究

在油气集输新增产能建设中,为充分利用已建管网系统的处理能力,达到降低投资,提高经济效益的目的,进行了油气集输新增产能建设布局优化方法的研究。针对新建集输管网为树状结构的情况,建立了油气集输系统新增产能建设拓扑优化的数学模型,讨论了计算复杂性问题。根据模型的特点,将问题分解为拓扑级优化和几何级优化两个子问题,并通过它们之间的迭代进行求解。实例计算表明,所建立的数学模型正确,求解方法可行,能用于工程实际设计。     

Serial deployment of attention during visual search.

This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Using internal fibre geometry to improve the performance of pin-loaded holes in composite materials

The anisotropic nature of fibre reinforced composites leads to large stress concentrations around pin-loaded holes through standard weave cloths. Proper understanding of how this anisotropic nature affects the load distribution around holes can be utilised to reduce these concentrations if sufficient thought is given to the internal fibre geometry near to the hole. Such local reinforcements need not be highly complex and can be readily produced without excessive effort, producing significant improvements in performance.     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996     

Response level crossing rate of a linear system excited by a partially specified Gaussian load process

The problem of determining the maximum mean response level crossing rate of a linear system driven by a partially specified Gaussian load process has been considered. The partial specification of the load is given only in terms of its total average energy. The critical input power spectral (PSD) function, which maximizes the mean response level crossing rate, is obtained. The critical input PSD turns out to be highly narrow-banded which fails to capture the erratic nature of the excitation. Consequently, the trade-off curve between the maximum mean response level crossing rate and the maximum disorder in the input process, quantified in terms of its entropy rate, has been generated. The method of Pareto optimization is used to tackle the conflicting objectives of the simultaneous maximization of the mean response level crossing rate and the input entropy rate. The non-linear multi-objective optimization has been carried out using a recently developed multi-criteria genetic algorithm scheme. Illustrative example of determining the critical input of an axially vibrating rod, excited by a partially specified stationary Gaussian load process, has been considered.     

Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.