THE BOUNDEDNESS OF OPERATORS ON WEIGHTED MULTI-PARAMETER LOCAL HARDY SPACES

Though atomic decomposition is a very useful tool for studying the boundedness on Hardy spaces for some sublinear operators,untill now,the boundedness of operators on weighted Hardy spaces in a multi-parameter setting has been established only by almost orthogonality estimates.In this paper,we mainly establish the boundedness on weighted multi-parameter local Hardy spaces via atomic decomposition.

The Interpolation of Operators between Weighted Hardy Spaces and Weighted L^p Spaces

The paper is given the interpolation of operators between weighted Hardy spaces and weighted L p spaces when w∈A 1 by Calderon Zygmund decomposition.

WEIGHTED NORM INEQUALITIES FOR THE COMMUTATORS OF MULTILINEAR SINGULAR INTEGRAL OPERATORS

In this paper, the authors consider the weighted estimates for the commutators of multilinear Calderón-Zygmund operators.By introducing an operator which shifts the commutation, and establishing the weighted estimates for this new operator, the authors prove that, if p_1 ∈ （1,∞）, p_2,…,p_m ∈（1,∞], p ∈ （0,∞） with 1/p =Σ1≤k≤ m 1/pk, then for any weight w, the commutators of m-linear Galderón-Zygmund operator are bounded from L P1（R n,M_l（logL） σw）× p2（Rn,M~w）×...×Lpm（Rn,Mw） to Lp（Rn,w）with σ to be a constant depending only on p_1 and the order of commutator

WEIGHTED ESTIMATES WITH GENERAL WEIGHTS FOR MULTILINEAR CALDER N-ZYGMUND OPERATORS

In this paper, some weighted estimates with general weights are established for the m-linear Calderon-Zygmund operator and the corresponding maximal operator. It is proved that, ifp1,…,pm ∈ [1, ∞] and p ∈ （0, ∞） with 1/p = ∑k=1^m 1/pk, then for any weight w, integer l with 1 〈 e 〈 m,

Method for obtaining high-resolution velocity spectrum based on weighted similarity

Seismic wave velocity is one of the most important processing parameters of seismic data,which also determines the accuracy of imaging.The conventional method of velocity analysis involves scanning through a series of equal intervals of velocity,producing the velocity spectrum by superposing energy or similarity coefficients.In this method,however,the sensitivity of the semblance spectrum to change of velocity is weak,so the resolution is poor.In this paper,to solve the above deficiencies of conventional velocity analysis,a method for obtaining a high-resolution velocity spectrum based on weighted similarity is proposed.By introducing two weighting functions,the resolution of the similarity spectrum in time and velocity is improved.Numerical examples and real seismic data indicate that the proposed method provides a velocity spectrum with higher resolution than conventional methods and can separate cross reflectors which are aliased in conventional semblance spectrums;at the same time,the method shows good noise-resistibility.

Strongly Cyclic and Strongly Irreducible Decomposition

Let W be an injective unilateral weighted shift, and let W(n) be the orthogonal direct sum of n copies of W. In this paper, we prove that, if the commutant of W is strictly cyclic, then W(n) has a unique (SI) decomposition with respect to similarity for every natural number n.

DECOMPOSITION FOR BERS-ORLICZ SPACES

In this paper some decomposition theorems for classical weighted Orlicz spaces and Bers-Orlicz spaces are established. As applications of these decomposition theorems some estimates about the growth of the Taylor coefficients of the functions in Bers-Orlicz spaces are given.

A New Estimate for Bochner–Riesz Operators at the Critical Index on Weighted Hardy Spaces

Let w be a Muckenhoupt weight and Hwp （JRn） be the weighted Hardy space. In this paper, by using the atomic decomposition of Hwp（Rn）, we will show that the Bochner-Riesz operators TRδ are bounded from Hwp（Rn） to the weighted weak Hardy spaces WHwp （Rn） for 0 〈 p 〈 1 and δ = n/p- （n ＋ 1）/2. This result is new even in the unweighted case.

The Direct Sum Decomposition of Type G_2 Lie Algebra

This article mainly discusses the direct sum decomposition of type G_2 Lie algebra, which, under such decomposition, is decomposed into a type A_1 simple Lie algebra and one of its modules. Four theorems are given to describe this module,which could be the direct sum of two or three irreducible modules, or the direct sum of weight modules and trivial modules, or the highest weight module.

Criteria for Weighted Moving-Mean Method

The moving-mean method is one of the conventional approaches for trend-extraction from a data set. It is usually applied in an empirical way. The smoothing degree of the trend depends on the selections of window length and weighted coefficients, which are associated with the change pattern of the data. Are there any uniform criteria for determining them? The present article is a reaction to this fundamental problem. By investigating many kinds of data, the results show that: 1) Within a certain range, the more points which participate in moving-mean, the better the trend function. However, in case the window length is too long, the trend function may tend to the ordinary global mean. 2) For a given window length, what matters is the choice of weighted coefficients. As the five-point case concerned, the local-midpoint, local-mean and global-mean criteria hold. Among these three criteria, the local-mean one has the strongest adaptability, which is suggested for your usage.

Simultaneous (M,N) Singular Value Decomposition of Matrices

A necessary and sufficient condition for the existence of simultaneous (M,N)singular value decomposition of matrices is given.Some properties about the weighted partial ordering are discussed with the help of the decomposition.

Decomposition of Mathematical Programming Models for Aircraft Wing Design Facilitating the Use of Dynamic Programming Approach

Aircraft designers strive to achieve optimal weight-reliability tradeoffs while designing an aircraft. Since aircraft wing skins account for more than fifty percent of their structural weight, aircraft wings must be designed with utmost care and attention in terms of material types and thickness configurations. In particular, the selection of thickness at each location of the aircraft wing skin is the most consequential task for aircraft designers. To accomplish this, we present discrete mathematical programming models to obtain optimal thicknesses either to minimize weight or to maximize reliability. We present theoretical results for the decomposition of these discrete mathematical programming models to reduce computer memory requirements and facilitate the use of dynamic programming for design purposes. In particular, a decomposed version of the weight minimization problem is solved for an aircraft wing with thirty locations (or panels) and fourteen thickness choices for each location to yield an optimal minimum weight design.

The <i>H</i>-Decomposition Problem for Graphs

The concept of H-decompositions of graphs was first introduced by Erd?s, Goodman and Pósa in 1966, who were motivated by the problem of representing graphs by set intersections. Given graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. Let Ф(n,H) be the smallest number Ф, such that, any graph of order n admits an H-decomposition with at most Ф parts. The exact computation of Ф(n,H) for an arbitrary H is still an open problem. Recently, a few papers have been published about this problem. In this survey we will bring together all the results about H-decompositions. We will also introduce two new related problems, namely Weighted H-Decompositions of graphs and Monochromatic H-Decom- positions of graphs.

基于点权的混合K-shell关键节点识别方法

复杂网络中,评估节点的重要性对于研究网络结构和传播过程有着重要意义.通过节点的位置,K-shell分解算法能够很好地识别关键节点,但是这种算法导致很多节点具有相同的K-shell(Ks)值.同时,现有的算法大都只考虑局部指标或者全局指标,导致评判节点重要性的因素单一.为了更好地识别关键节点,提出了EKSDN(Extended K-shell and Degree of Neighbors)算法,该算法综合考虑了节点的全局指标加权核值以及节点的局部指标度数.与SIR(Susceptible-Infectious-Recovered)模型在真实复杂网络中模拟结果相比,EKSDN算法能够更好地识别关键节点.

Weighted Polar Decomposition

In this paper,a new matrix decomposition called the weighted polar decomposition is considered.Two uniqueness theorems of weighted polar decomposition are presented,and the best approximation property of weighted unitary polar factor and perturbation bounds for weighted polar decomposition are also studied.

Atomic decomposition characterizations of weighted multiparameter Hardy spaces

Let w E Am. In this paper, we introduce weighted-（p,q） atomicHardy spaces Hwp,q（Rn × Rm） for 0 〈 p ≤ 1, q 〉 qw and show that the weighted Hardy space Hwp（Rn × Rm） defined via Littlewood-Paley square functions coincides with Hwp,q（Rn × Rm） for 0 〈 p ≤ 1, q 〉 qw. As applications, we get a general principle on the Hwp（Rn × Rm to Lwp（Rn × Rm） boundedness and a boundedness criterion for two parameter singular integrals on the weighted Hardy spaces.

The CalderSn-Zygmund Decomposition and Interpolation on Weighted Hardy Spaces

We apply discrete Littlewood Paley Stein theory, developed by Han and Lu, to establish Calderon Zygmund decompositions and interpolation theorems on weighted Hardy spaces Hp for w C A∞ in both the one-parameter and two-parameter cases.

Rapid determination of thiabendazole in orange extract using excitation-emission matrix fluorescence and second-order calibration based on alternating trilinear decomposition/alternating normalization-weighted error algorithms

A novel approach is proposed for direct quantitative analysis of thiabendazole in the orange extract by using excitation-emission matrix fluorescence coupled with second-order calibration methods based on the alternating trilinear decomposition(ATLD) and the alternating normalization-weighted error(ANWE) algorithms,respectively. The average recoveries of thiabendazole in the orange extract by using ATLD and ANWE with an estimated component number of two were 99.7 ± 3.3% and 103.5 ± 4.1%,respectively. Furthermore,the accuracy of the two algorithms was also evaluated through elliptical joint confidence region(EJCR) tests as well as figures of merit,such as sensitivity(SEN),selectivity(SEL) and limit of detection(LOD). The experimental results demonstrate that both algorithms have been satisfactorily applied to the determination of thiabendazole in orange extract,and the perform-ance of ANWE is slightly better than that of ATLD.

Extremum Principle for Very Weak Solutions of A-Harmonic Equation with Weight

Extremum principle for very weak solutions of A-harmonic equation div A(x,▽u)=0 is obtained, where the operator A:Ω × Rn→Rnsatisfies some coercivity and controllable growth conditions with Mucken-houpt weight.

Two Modifications of Weight Calculation of the Non-Local Means Denoising Method

The non-local means (NLM) denoising method replaces each pixel by the weighted average of pixels with the sur-rounding neighborhoods. In this paper we employ a cosine weighting function instead of the original exponential func-tion to improve the efficiency of the NLM denoising method. The cosine function outperforms in the high level noise more than low level noise. To increase the performance more in the low level noise we calculate the neighborhood si-milarity weights in a lower-dimensional subspace using singular value decomposition (SVD). Experimental compari-sons between the proposed modifications against the original NLM algorithm demonstrate its superior denoising per-formance in terms of peak signal to noise ratio (PSNR) and histogram, using various test images corrupted by additive white Gaussian noise (AWGN).