Generalized entropy optimization problems and the existence of their solutions

In the present study we have formulated a generalization of entropy optimization problems (GEOP), proposed sufficient conditions for the existence of solution. We have suggested also a new method based on a priori evaluations and Newton's methods for calculation of Langrange multipliers. Mentioned method allows calculating Langrange multipliers by starting from arbitrary initial point for Newton's approximations of constructed auxiliary equation. The solution of auxiliary equation is chosen as initial point for second constructed auxiliary equation. The recurring mentioned process for finite time leads to achieve an initial point for Newton's approximations of given equation and allows to find its unknown solution.     

JLab Hall-A上小角度GDH实验中的粒子鉴别及其效率

在JLab的A大厅上的小角度GDH实验中, 因为散射截面及截面不对称度的测量需要干净的电子样本和足够的事例统计, 径迹在簇射量能器和气体阈契仑柯夫探测器理的信息被用来完成粒子鉴别的任务. 通过优化粒子在两种探测器里的信息筛选条件, 可以得到较高的电子接收效率和π的去除能力. 因为探测器的分辨能力与粒子的动量等运动学参量有关, 所以对于不同的数据的粒子鉴别条件分别进行了优化, 并得到了对应的电子接收效率和π的去除能力.     

Growth kinetics of metastable (3 3 1) nanofacet on Au and Pt(1 1 0) surfaces

A theoretical epitaxial growth model with realistic barriers for surface diffusion is investigated by means of kinetic Monte Carlo simulations to study the growth modes of metastable (3 3 1) nanofacets on Au and Pt(1 1 0) surfaces. The results show that under experimental atomic fluxes, the (3 3 1) nanofacets grow by 2D nucleation at low temperature in the submonolayer regime. A metastable growth phase diagram that can be useful to experimentalists is presented and looks similar to the one found for the stationary growth of the bcc(0 0 1) surface in the kinetic 6-vertex model.     

Adaptive extremal optimization by detrended fluctuation analysis

Global optimization is one of the key challenges in computational physics as several problems, e.g. protein structure prediction, the low-energy landscape of atomic clusters, detection of community structures in networks, or model-parameter fitting can be formulated as global optimization problems. Extremal optimization (EO) has become in recent years one particular, successful approach to the global optimization problem. As with almost all other global optimization approaches, EO is driven by an internal dynamics that depends crucially on one or more parameters. Recently, the existence of an optimal scheme for this internal parameter of EO was proven, so as to maximize the performance of the algorithm. However, this proof was not constructive, that is, one cannot use it to deduce the optimal parameter itself a priori. In this study we analyze the dynamics of EO for a test problem (spin glasses). Based on the results we propose an online measure of the performance of EO and a way to use this insight to reformulate the EO algorithm in order to construct optimal values of the internal parameter online without any input by the user. This approach will ultimately allow us to make EO parameter free and thus its application in general global optimization problems much more efficient.     

A computational approach for eliminating error in the solution of the location set covering problem

The location set covering problem continues to be an important and challenging spatial optimization problem. The range of practical planning applications underscores its importance, spanning fire station siting, warning siren positioning, security monitoring and nature reserve design, to name but a few. It is challenging on a number of fronts. First, it can be difficult to solve for medium to large size problem instances, which are often encountered in combination with geographic information systems (GIS) based analysis. Second, the need to cover a region efficiently often brings about complications associated with the abstraction of geographic space. Representation as points can lead to significant gaps in actual coverage, whereas representation as polygons can result in a substantial overestimate of facilities needed. Computational complexity along with spatial abstraction sensitivity combine to make advances in solving this problem much needed. To this end, a solution framework for ensuring complete coverage of a region with a minimum number of facilities is proposed that eliminates potential error. Applications to emergency warning siren and fire station siting are presented to demonstrate the effectiveness of the developed approach. The approach can be applied to convex, non-convex and non-contiguous regions and is unaffected by arbitrary initial spatial representations of space.     

Boundary regularity for Maxwell's equations with applications to shape optimization

The dynamic Maxwell equations with a strictly dissipative boundary condition is considered. Sharp trace regularity for the electric and the magnetic field are established for both: weak and differentiable solutions. As an application a shape optimization problem for Maxwell's equations is considered. In order to characterize the shape derivative as a solution to a boundary value problem, the aforementioned sharp regularity of the boundary traces is critical.     

PORTFOLIO OPTIMIZATION TECHNIQUES FOR A MIXED‐GRAZING SCENARIO FOR AUSTRALIA'S RANGELANDS

Abstract Currently pastoralists in Australia view native mammal species as one of many variables that impact, usually negatively, on their productivity and therefore profitability. This does not necessarily have to be the case. The species with the largest impact, kangaroos, have a value that could be incorporated into their income stream as a method of both reducing risk and increasing biodiversity, and therefore increasing resilience. An investigation of the idea of optimally allocating stocking rates using techniques analogous to classical portfolio selection optimization is conducted. Using historical pricing data for beef, wool, and kangaroo meat, an efficient frontier is formed to analyze the best scenario dependent on an investors risk aversion. It is shown that there is a clear opportunity for pastoralists to benefit economically by the inclusion of kangaroos in a mixed‐grazing strategy for Australian rangelands.     

道路约束条件下的移动机器人跟踪

为提高移动机器人的位置估计精度和跟踪效果,提出一种基于道路约束条件下的移动机器人鲁棒约束H∞滤波(CHF)跟踪算法.首先,将机器人移动的道路网络作为跟踪的约束条件,并利用当前统计模型对机器人的运动进行建模.其次,将道路约束条件作为机器人跟踪的非线性状态约束,利用最小协方差估计推导了鲁棒CHF递推方程.通过拉格朗日乘子法对非线性约束优化估计问题进行求解,并利用约束信息对CHF算法的状态更新过程进行了改进.最后,通过对CHF算法和无约束的H∞滤波算法的跟踪性能进行了对比分析和验证.仿真结果表明,该算法可以实现机器人的跟踪,且跟踪精度优于HF算法.     

Initial guess by improved population-based intelligent algorithms for large inter-frame deformation measurement using digital image correlation

Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement.     

Distributive Products and Their Homology

We develop a theory of sets with distributive products (called shelves and multi-shelves) and of their homology. We relate the shelf homology to the rack and quandle homology.