On the stress singularities and boundary layer in moderately thick functionally graded sectorial plates

In this paper, the stress analysis of moderately thick functionally graded sector plate is developed for studying the singularities in vicinity of the vertex and effects of boundary layer. Based on the first-order shear deformation plate theory, the governing partial differential equations are obtained. Using an analytical method, the stretching and bending equilibrium equations are decoupled. Also, introducing a function, called boundary layer function, the three bending equations are converted into two decoupled equations. These equations are solved analytically and the effects of boundary layer function on stress components are shown. Also, the singularities of shear force, moment resultants and boundary layer function are discussed for both salient (α?180)$(\alpha ?180)$ and re-entrant (α>180)$(\alpha >180)$ sectorial plates. In order to verify the accuracy of the results, the governing equations are also solved using differential quadrature method (DQM). By comparing the results of exact method with DQM, a good agreement can be seen.     

Lagrangean duals and exact solution to the capacitated p-center problem

In this work, we address the capacitated p-center problem (CpCP). We study two auxiliary problems, discuss their relation to CpCP, and analyze the lower bounds obtained with two different Lagrangean duals based on each of these auxiliary problems. We also compare two different strategies for solving exactly CpCP, based on binary search and sequential search, respectively. Various data sets from the literature have been used for evaluating the performance of the proposed algorithms.     

顾客为子树结构的树上反中心选址问题

顾客为子树结构的树上反中心选址问题是在树T上寻找一点(位于顶点处或在边的内部),使得该点与子树结构的顾客之间的最小赋权带加数距离尽可能地大.给出了该问题的一个有效算法,其时间复杂度为O(cn+sum from j=1 to m n_j),其中n_j为各子树T_j的顶点个数,c为不同的子树权重个数,n为树的顶点数.     

潜水器开孔耐压壳半球封头极限承载力分析

为了使潜水器能够在水下完成各种操作项目,必须为潜水器配置适当的设备以及电缆,这就决定了必须在耐压壳两侧的封头上设置各种大小不同的开孔,开孔处需要安装各类接插件.耐压半球封头上开孔的设置导致了应力的增加和壳体强度的减弱;同时,由于结构的连续性被破坏,这将产生较大的附加弯曲应力.本文利用ANSYS有限元分析软件对开孔半球封头的承载力问题进行了非线性有限元分析,计算了开孔的各项参数变化对耐压封头极限承载力的影响.计算结果表明,随着个数和孔径的增大和围壁厚度的减小其极限承载力呈下降趋势.     

A bibliography for some fundamental problem categories in discrete location science

Following a brief taxonomy of the broad field of facility location modeling, this paper provides an annotated bibliography of recent papers in two branches of discrete location theory and modeling. In particular, we review papers related to (1) the median and plant location models and (2) to center and covering models. We show how the contributions of the papers we review are embedded in the field. A summary and outlook conclude the paper.     

Segregation of Solutes in Two-Phase Mixtures

Fractions of indium solutes in each phase of a mixture of two binary phases were measured using perturbed angular correlation of gamma rays. Measurements of phase fractions were made on Pd₃Ga₇–PdGa, PdGa–Pd₅Ga₃, and FeAl₂–FeAl mixtures as a function of composition. The phase fractions were analyzed using a thermodynamic model that takes into account differences between energies of solute atoms in the two phases. From the model, segregation coefficients were obtained for the systems studied. Also, earlier measurements on Ni₂Al₃–NiAl were reanalyzed. Large differences are found among the segregation coefficients. This revised version was published online in September 2006 with corrections to the Cover Date.     

Numerical analysis for smoothing of CW multimode beam transformed by time-varying random phase plate

The numerical analysis of CW multimode laser beam transformed by time-varying random phase plate is presented in this paper. The method is based on diffraction integral formula. The dependence of the intensity distribution on the element size, changing frequency and duty ratio is discussed in detail. The numerical results account for the experimental results satisfactorily.     

A co-opetitive framework for the hub location problems in transportation networks

In this paper, we present the first model of co-opetition for a Hub Location Problem between two logistics service provider (LSPs) companies where the mother company is the owner of infrastructure. The LSPs would like to cooperate with each other by establishing joint edges with limited capacities connecting their service networks. Such services are in form of pendulum services (a direct service between two points) between nodes of different networks. Additional market can be generated as a result of joining the two networks. At the same time, a competition is taking place between the two operators to increase their share from the additional market generated. In order to solve this problem, we propose a matheuristic approach combining a local search algorithm and a Lagrangian relaxation-based approach. In our matheuristic algorithm, the neighbourhood solutions are evaluated using a Lagrangian relaxation-based approach. Numerical results of applying the proposed algorithm on a real case study of the problem are presented.     

On Center Cycles in Grid Graphs

Finding good cycles in graphs is a problem of great interest in graph theory as well as in locational analysis. We show that the center and median problems are NP-hard in general graphs. This result holds both for the variable cardinality case (i.e., all cycles of the graph are considered) and the fixed cardinality case (i.e., only cycles with a given cardinality p are feasible). Hence it is of interest to investigate special cases where the problem is solvable in polynomial time. In grid graphs, the variable cardinality case is, for instance, trivially solvable if the shape of the cycle can be chosen freely. If the shape is fixed to be a rectangle one can analyze rectangles in grid graphs with, in sequence, fixed dimension, fixed cardinality, and variable cardinality. In all cases a complete characterization of the optimal cycles and closed form expressions of the optimal objective values are given, yielding polynomial time algorithms for all cases of center rectangle problems. Finally, it is shown that center cycles can be chosen as rectangles for bounded cardinalities such that the center cycle problem in grid graphs is in these cases completely solved.     

一类具约束选址模型的组合算法

针对一般具闭凸集约束的单址选址模型,提出具全局收敛性的组合算法．算法在迭代中先采用信赖域技巧,当出现“内循环”时,则改用不做线搜索的梯度法．该算法既具有信赖域算法的优越性,又避免了出现“内循环”时速成的隐迭代．同时,该算法通常不需进行线搜索,较之其它组合算法更加简捷实用．