Broadband excitation pulses for high‐field solid‐state nuclear magnetic resonance spectroscopy

In nuclear magnetic resonance spectroscopy, experimental limits due to the radiofrequency transmitter and/or coil means that conventional radiofrequency pulses (“hard pulses”) are sometimes not sufficiently powerful to excite magnetization uniformly over a desired range of frequencies. Effects due to nonuniform excitation are most frequently encountered at high magnetic fields for nuclei with a large range of chemical shifts. Using optimal control theory, we have designed broadband excitation pulses that are suitable for solid‐state samples under magic‐angle‐spinning conditions. These pulses are easy to implement, robust to spinning frequency variations, and radiofrequency inhomogeneities, and only four times as long as a corresponding hard pulse. The utility of these pulses for uniformly exciting ¹³C nuclei is demonstrated on a 900 MHz (21.1 T) spectrometer. Copyright © 2012 John Wiley & Sons, Ltd.     

Properties of ε-value functions for a two person differential game

We consider the problem of approximate minimax for the Bolza problem of optimal control. Starting from the method of dynamic programming (Bellman) we define the ?-value function to be the approximation for the value function being a solution to the Hamilton–Jacobi equation.     

A note on commutators of Hardy operators

Fu and Lu et al. 7 showed that the commutator $\mathcal {H}_{\beta ,b}$ generated by the fractional Hardy operator and a locally integrable function b is bounded on the homogenous Herz spaces if and only if b is a central bounded mean oscillation function. We show that their result is optimal by giving a counterexample.     

A variational problem determined by probability measures

ABSTRACT

An optimization problem of maximizing an integral of a function over a family of probability measures is considered. The problem is a generalization of a well-studied variational problem in mathematical economics, concerning optimal allocations. The specific generalization that we examine arises also in the limit of singularly perturbed optimal control problems. We examine the mathematical problem and allude to the singular perturbation motivation.     

Coexistence and harvesting control policy in a food chain model with mutual defense of prey

A model is proposed to understand the dynamics in a food chain (one predator‐two prey). Unlike many approaches, we consider mutualism (for defense against predators) between the two groups of prey. We investigate the conditions for coexistence and exclusion. Unlike Elettreby's (2009) results, we show that prey can coexist in the absence of predators (as expected since there is no competition between prey). We also show the existence of Hopf bifurcation and limit cycle in the model, and numerically present bifurcation diagrams in terms of mutualism and harvesting. When the harvest is practiced for profit making, we provide the threshold effort value that determines the profitability of the harvest. We show that there is zero profit when the constant effort is applied. Below (resp. above) , there will always be gain (resp. loss). In the case of gain, we provide the optimal effort and optimal steady states that produce maximum profit and ensure coexistence. Recommendations for resource managers As a result of our investigation, we bring the following to the attention of management:

• 1. In the absence of predators, different groups of prey can coexist if they mutually help each other (no competition among them).
• 2. There is a maximal effort to invest in order to gain profit from the harvest. Above , the investment will result in a loss.
• 3. In the case of profit from harvest, policy makers should recommend the optimal effort to be applied and the optimal stock to harvest. This will guarantee maximum profit while ensuring sustainability of all species.

     

σ2 Hessian方程的Pogorelov型C2 内估计及应用

提出利用拉格朗日乘子法重新证明σ2算子的最优凹性,并定义了一个凸锥Γ3?=λ=(λ1,λ2,?,λn)∈Rn:σ1(λ)>0,σ2(λ|i)>0,1≤i≤n。利用σ2算子的最优凹性，给出了σ2Hessian方程Pogorelov型C2内估计，进而证明了σ2(D2u(x))=1,x∈Rn的满足二次多项式增长条件的Γ3?-凸整解为二次多项式。     

Free boundary problem for a fully nonlinear and degenerate parabolic equation in an angular domain

This paper concerns with the problem of how to running an insurance company to maximize his total discounted expected dividends. In our model, the dividend rate is limited in $[0,M]$ and the company is allowed to transfer any proportion of risk by reinsuring. So there are two strategies which we call dividend strategy and reinsurance strategy. The objective function and the corresponding optimal two strategies are the solution and the two free boundaries of the following Barenblatt parabolic equation

$v_t?\underset{0\le a\le 1}{\max }?(\frac{1}{2}{a}^2{\sigma }^2{v}_{xx}+a\mu v_x)+cv?\underset{0\le l\le M}{\max }?[(1?v_x)l]=0$

under certain boundary conditions on an angular domain

$Q_T=\{(x,t)|0<x<Mt,0<t\le T\}.$

The main effort is to analyze the properties of the solution and the free boundaries to show the optimal decision for the insurance company.     

Asymptotic analysis for multi-objective sequential stochastic assignment problems

ABSTRACT

We provide an asymptotic analysis of multi-objective sequential stochastic assignment problems (MOSSAP). In MOSSAP, a fixed number of tasks arrive sequentially, with an n-dimensional value vector revealed upon arrival. Each task is assigned to one of a group of known workers immediately upon arrival, with the reward given by an n-dimensional product-form vector. The objective is to maximize each component of the expected reward vector. We provide expressions for the asymptotic expected reward per task for each component of the reward vector and compare the convergence rates for three classes of Pareto optimal policies.     

航空器供油问题中完全逆序类中的多项式时间可解类

航空器供油问题是一类非线性组合优化问题,其目标函数为分式形式,该问题目前不存在多项式时间算法,也未被证明是NP完全问题。一般可以用置换来刻画n架飞机的一个供油顺序。该问题中有一类实例被称为“完全逆序类”,“完全逆序类”用动态规划算法求解计算时间为O(n2ⁿ),具有指数时间复杂度。本文通过对该“完全逆序类”问题做进一步分析,发现在“完全逆序类”中也存在着多项式时间可解的情况。定理1研究一类一次可解的情况,若问题满足定理1的条件,则求解一次即可找到其最优解;定理2研究一类多项式时间可解的情况,当问题满足定理2的条件时,其最优解可在多项式时间内获得。