具有早期储备可修复收入系统的谱分析

研究了具有早期储备可修复系统,首先给出了该系统的预解式,对δ>0,γ=a+bi,固定a1,a2,满足-μ+δ相似文献   

典型實照函數的最小?妥钚∑

<正> 1.如果函數f(z)在包含實軸土某一區間的區域B中是正則的,f(z)在此實軸區間上取實值.在區域B的其餘地方f(z)與(z)同符號;即     

BMO ESTIMATES FOR MULTILINEAR FRACTIONAL INTEGRALS

In this paper,the authors prove that the multilinear fractional integral operator T A 1,A 2 ,α and the relevant maximal operator M A 1,A 2 ,α with rough kernel are both bounded from L p (1 p ∞) to L q and from L p to L n/(n α),∞ with power weight,respectively,where T A 1,A 2 ,α (f)(x)=R n R m 1 (A 1 ;x,y)R m 2 (A 2 ;x,y) | x y | n α +m 1 +m 2 2 (x y) f (y)dy and M A 1,A 2 ,α (f)(x)=sup r0 1 r n α +m 1 +m 2 2 | x y | r 2 ∏ i=1 R m i (A i ;x,y)(x y) f (y) | dy,and 0 α n, ∈ L s (S n 1) (s ≥ 1) is a homogeneous function of degree zero in R n,A i is a function defined on R n and R m i (A i ;x,y) denotes the m i t h remainder of Taylor series of A i at x about y.More precisely,R m i (A i ;x,y)=A i (x) ∑ | γ | m i 1 γ ! D γ A i (y)(x y) r,where D γ (A i) ∈ BMO(R n) for | γ |=m i 1(m i 1),i=1,2.     

Functional Equations and Distribution Functions

We consider the functional equation $$f(t)={1\over b}{\mathop \sum^{b-1}\limits_{\nu=0}}f\Bigg({t-\beta_{\nu}\over a}\Bigg)\ \ \ {\rm for\ all}\ t\in {\rm R},$$ where 0 < a < 1, b in ? {1} and ?1 = β ₀ ≤ β₁ ≤ … ≤ β_{b? 1} =1 are given parameters, ?: ? → ? is the unknown. We show that there is a unique bounded function ? which solves (F) and satisfies ?(t) = 0 for t < ～-1/(1 ? a), ?(t) = 1 for t > 1/(1 ? a). This solution can be interpreted as the distribution function of a certain random series. It is known to be either singular or absolutely continuous, but the problem for which parameters it is absolutely continuous is largely open. We collect some previously established partial answers and generalize them. We also point out an interesting connection to the so-called Schilling equation.     

A Multiplicity Result for a Singular and Nonhomogeneous Elliptic Problem in Rn

We establish sufficient conditions under which the quasilinear equation $$-div(|∇u|^{n-2}∇u)+V(x)|u|^{n-2}u=\frac{f(x,u)}{|x|^β}+εh(x) in \mathbb{R}^n,$$ has at least two nontrivial weak solutions in $W^{1,n} (\mathbb{R}^n)$ when ε > 0 is small enough, 0≤β < n, V is a continuous potential, f(x,u) behaves like $exp{γ|u|^{n/(n-1)}}$ as $|u|→∞$ for some γ > 0 and h≢ 0 belongs to the dual space of $W^{1,n} (\mathbb{R}^n)$.     

基于微分博弈的区域经济合作行为分析

针对区域经济合作行为问题,构建微分博弈模型,将区域合作情况分为弱弱型拮抗博弈、强弱型主从博弈、强强型协同博弈三类,并考察其最优努力策略、最优收益与联盟总体收益变化.研究结果显示:①地区间经济合作努力程度随着合作成本系数、产出漏损系数的上升而下降,随着边际努力产出系数、边际努力收益系数、产出影响系数的上升而上升;②"激励因子"作为一种激励机制,可提高地区间合作努力度、最优收益及联盟整体收益;③三种类型中,强强性协同博弈最优策略及整体最优收益均严格优于其他两种情形.但这种协同合作需要确定联盟整体收益分配系数的取值范围.     

一类特殊的有限循环环

证明了一类n阶(n=P_1P_2…p_m,p_i(i=1,2,…,m)互异为素数)环是有限循环环,并讨论了他们的结构及相关性质,最后给出了这类n阶环有零因子或有子域的充要条件.主要结果:P_1P_2…P_m阶环共有2^m个,它们是(p_(1m个,它们是(p_(1^k_1) p_(2k_1) p_(2^k_2)…p_(mk_2)…p_(m^k_m)Z)/(p_(1k_m)Z)/(p_(1^k_1+1)p_(2k_1+1)p_(2^k_2+1)…p_(mk_2+1)…p_(m^k_m+1)Z),其中k_i=0或1,1≤i≤m;阶是n=P_1P_2…p_m的环R可唯一分解为m个素数阶理想的直和,即R=〈α〉=(?);含pi(1≤i≤m)阶子域的P_1P_2…P_m阶环共有2k_m+1)Z),其中k_i=0或1,1≤i≤m;阶是n=P_1P_2…p_m的环R可唯一分解为m个素数阶理想的直和,即R=〈α〉=(?);含pi(1≤i≤m)阶子域的P_1P_2…P_m阶环共有2^(m-1)个,它们是p_(1(m-1)个,它们是p_(1^k_1) p_(2k_1) p_(2^k_2)…p_(mk_2)…p_(m^k_m)Z)/(p_(1k_m)Z)/(p_(1^k_1+1)p_(2k_1+1)p_(2^k_2+1)…p_(mk_2+1)…p_(m^k_m+1)Z),其.中k_i=0,k_j=0或1,1≤j≤m,j≠i.     

Independence and hamiltonicity in 3-domination-critical graphs

Let δ, γ, i and α be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-γ-critical if γ = 3 and the addition of any edge decreases γ by 1. It was conjectured that any connected 3-γ-critical graph satisfies i = γ, and is hamiltonian if δ ≥ 2. We show here that every connected 3-γ-critical graph G with γ ≥ 2 satisfies α ≤ δ + 2; if α = δ + 2 then i = γ; while if α ≤ δ + 1 then G is hamiltonian. © 1997 Wiley & Sons, Inc. J Graph Theory 25: 173–184, 1997     

Analyse locale des droites discrètes. Généralisation et application à la connexité des plans discrets

When studying a Reveillès digital straight line defined by a doubleinequality (I): γ ≤ ax + by < γ + Γ with (a,b,Γ)∈ℕ^*3 and γ∈ℤ, we are naturally led to study fibers from a digital plane P of ℤ³. Local results concerning the existence of connectivity paths between neighbouring legos provide a construction of a special infinite graph G with finite period. The deterministic algorithm for recognizing connectivity of infinite graphs we give below also permits us to know the connectivity of P using G.     

关于数值数学的一个典型问题

<正> Collatz L.在综述性文章[1]和[2]中就数值数学的典型问题归纳为五类,第一类是方程Tu=φ或Tu=u的解.关于这类问题主要是寻找解的存在性定理和解的存在区间以及唯一性定理等等. 如所周知,由初始元u_o出发,经过迭代     

基于非对称成本的设计竞赛博弈模型及奖金设置

论从项目业主的角度出发，利用博弈论和信息经济学理论和方法，在竞赛参与人成本不对称条件下，建立了一个项目业主和多个设计竞赛参与人组成的设计竞赛博弈模型；并在竞赛参与人成本函数分别为线性函数、凹函数和凸函数的条件下，研究对项目业主最优的竞赛奖金设置，研究表明：对于项目业主最优的奖金设置是单项奖金的方式。     

The solution of Lyumkis energy transport model in semiconductor science

The existence and uniqueness of solution to Lyumkis energy transport model is discussed for N+2<p≤q<∞ and 1≤N≤3. Copyright © 2003 John Wiley & Sons, Ltd.     

The Maximal Riesz, Fejér, and Cesàro Operators on Real Hardy Spaces

We prove that the maximal Riesz operator $\sigma^{\alpha,\gamma}_*$ is of strong type from $L^1(\R) \cap H^p$ $ (\R)$ to $L^p (\R)$ for $\alpha, \gamma>0$ and $1/(1+\alpha) < p \le 1$, it is of weak type for $\alpha,\gamma>0$ and $1/(1+\alpha) = p$, and these results are best possible. The proofs are based on sharp estimates of the derivatives of the Riesz kernel. We characterize the real Hardy space $H^p(\R)$ in terms of $\sigma^{\alpha,1}_*$ for $1/(1+ \alpha) < p \le 1$, and draw consequences for real Hardy spaces on $\R^2$, as well. For example, an integrable function $f$ belongs to $H^1(\R)$ if and only if the maximal Fej\er operator $\sigma^{1,1}_*$ applied to $f$ belongs to $L^1(\R)$. We also establish analogous results for real Hardy spaces on $\T$ and $\T^2$.     

分数次积分在局部Hardy空间上的有界性质

证明了当0<αn/(n-α)时,分数次积分Iα是局部Hardy空间hp(Rn)到空间hp(Rn)+Lq(Rn)的一个线性映射.     

經驗分佈之比的極限分佈

<正> §1.引言 令x為一隨機變數,其分佈函數為F(x).對於x作n次相互獨立的试驗,便得n個結果x_1,x_2,…,x_n.我們也可以把x_1,x_2,…,x_n看作是遵循同一個分佈函數F(x)的相互獨立隨機變數.現在把x_1,x_2,…,x_n依其值由小到大的次序排列,我們得到     

Meromorphic Functions with Finite Growth Index on Complex Discs Sharing Values or Pairs of Values

Analysis Mathematica - We study the finiteness and the uniqueness of families of meromorphic functions with finite growth index on a complex disc Δ(R) (0 &lt; R ≤ + ∞) sharing...     

高波数Helmholtz 方程的内罚有限元方法

本文考虑二维和三维区域上高波数Helmholtz 散射问题的线性内罚有限元方法. 该散射问题的边界条件取为一阶吸收边界条件. 本文证明了, 如果加罚参数γ-γ_r+iγ_i 的虚部 γ_i 大于零, 那么内罚有限元方法是绝对稳定的, 即对任意k,h,R > 0 都存在唯一解. 这里k 是波数, h 为网格尺寸, R是区域的直径. 进一步地, 如果|γ_r|≤γ_i≤1, 那么存在与k,h,γ,R 无关的常数C₀;C₁;C₂, 使得当k³h²R ≤ C₀ 时, 该方法的H¹ 误差界为(C₁kh + C₂k³h²R)RM(f, g), 当k³h²R > C₀ 且kh 有界时,H¹ 误差界为(C₁kh + C₂/γ_i)RM(f, g), 其中M(f, g) := (‖f‖_L²(Ω) + R^-1/2‖g‖_L²(Γ)) + R^-1|g|_H^1/2(Γ). 另外, 本文还推导了L² 误差估计. 注意到γ = 0 时内罚有限元方法就是经典的有限元方法, 通过取加罚参数为iγ_>i 并令γ_i 趋于0+, 本文还在k³h²R ≤ C₀ 的条件下, 得到了有限元方法的稳定性和误差估计.作者以前的工作只考虑了加罚参数为纯虚数的情形并且没有考虑对R 的依赖关系.     

Embracing the giant component

Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large as possible. This game is in the spirit of recent papers on avoiding a giant component, but here we embrace it. We analyze this game in the offline and online setting, for arbitrary and random instances, which provides for interesting comparisons. For arbitrary instances, we find that the competitive ratio (the best possible solution value divided by best possible online solution value) is large. For “sparse” random instances the competitive ratio is also large, with high probability (whp); If the instance has ¼(1 + ε)n random edge pairs, with 0 < ε ≤ 0.003, then any online algorithm generates a component of size O((log n)^3/2) whp , while the optimal offline solution contains a component of size Ω(n) whp . For “dense” random instances, the average‐case competitive ratio is much smaller. If the instance has ½(1 ? ε)n random edge pairs, with 0 < ε ≤ 0.015, we give an online algorithm which finds a component of size Ω(n) whp . © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005     

A systematic analysis of the N‐person chicken game

We report computer simulation experiments based on our agent‐based simulation tool to model the multiperson Chicken dilemma game for the case when the agents are greedy simpletons who imitate the action of that of their neighbors who received the highest payoff for its previous action. The individual agents may cooperate with each other for the collective interest or may defect, i.e., pursue their selfish interests only. After a certain number of iterations the proportion of cooperators stabilizes to either a constant value or oscillates around such a value. The payoff (reward/penalty) functions are given as two straight lines: one for the cooperators and another for the defectors. The payoff curves are functions of the ratio of cooperators to the total number of agents. Even for linear payoff functions, we have four free parameters that determine the payoff functions that have the following properties: (1) Both payoff functions increase with the increasing number of cooperators. (2) In the region of low cooperation the cooperators have a higher reward than the defectors. (3) When the cooperation rate is high, there is a higher payoff for defecting behavior than for cooperating behavior. (4) As a consequence, the slope of the D function is greater than that of the C function and the two payoff functions intersect. (5) All agents receive a lower payoff if all defect than if all cooperate. We have investigated the behavior of the agents systematically. The results show that the solutions have predictable tendencies but they are nontrivial and quite irregular. The solutions show drastic changes in the parameter ranges 0.6 ≤ R ≤ 0.65 for all values of S and 0 ≤ S ≤ 0.2 when R < 0.6 (R is the reward for mutual cooperation and S is the sucker's payoff to a lonely cooperator). © 2010 Wiley Periodicals, Inc. Complexity, 2010     

A d-dimensional model of the canonical ensemble of open strings

We propose a d-dimensional model of the canonical ensemble of open self-avoiding strings. We consider the model of a solitary open string in the d-dimensional Euclidean space ? ^d, 2 ≤ d < 4, where the string configuration is described by the arc length L and the distance R between string ends. The distribution of the spatial size of the string is determined only by its internal physical state and interaction with the ambient medium. We establish an equation for a transformed probability density W(R,L) of the distance R similar to the known Dyson equation, which is invariant under the continuous group of renormalization transformations; this allows using the renormalization group method to investigate the asymptotic behavior of this density in the case where R→∞ and L→∞. We consider the model of an ensemble of M open strings with the mean string length over the ensemble given by \(\bar L\) , and we use the Darwin-Fowler method to obtain the most probable distribution of strings over their lengths in the limit as M →∞. Averaging the probability density W(R,L) over the canonical ensemble eventually gives the sought density 〈W(R, \(\bar L\) )〉.