estimation of the mean of a multivariate normal distribution estimation of the means of independent normal random variables is considered using sum of squared errors as loss an unbiased estimate of risk is obtained for an arbitrary estimate and certain special classes of estimates are then discussed the results are applied to smoothing by use of moving averages and to trimmed analogs of the james stein estimate a suggestion is made for calculating approximate confidence sets for the mean vector centered at an arbitrary estimate

two disjoint cycle cover bipancyclicity of balanced hypercubes abstract a bipartite graph g is two disjoint cycle cover r1 r2 bipancyclic if for any even integer l satisfying r1 l r2 there exist two vertex disjoint cycles c1 and c2 in g such that v c 1 l and v c 2 v g l where v g denotes the number of vertices in g in this paper we study the two disjoint cycle cover bipancyclicity of the n dimensional balanced hypercube bhn which is a hypercube variant network and is superior to hypercube due to having a smaller diameter as a consequence we show that bhn is two disjoint cycle cover 4 2 2 n 1 bipancyclic for n 2

two node disjoint paths in balanced hypercubes the balanced hypercube bhn proposed by wu and huang is a variation of the hypercube it has been proved that the balanced hypercube is a node transitive and bipartite graph assume that the nodes are divided into two bipartite node sets x and y u and x are two different nodes in x and v and y are two different nodes in y in this paper we prove that there exist two node disjoint paths p x y and r u v in bhn and v p x y v r u v v bhn where n 1 the hamiltonian laceability of bhn which was proved by xu et al is also obtained from the corollary of our result

path embedding in star graphs abstract the star graph interconnection network has been introduced as an attractive alternative to the hypercube network in this paper we consider the path embedding problem in star graphs assume that n 4 we prove that paths of all even lengths from d x y to n 2 can be embedded between two arbitrary vertices x and y from the same partite set in the n dimensional star graph in addition paths of all odd lengths from d x y to n 1 can be embedded between two arbitrary vertices x and y from different partite sets in the n dimensional star graph except that if x and y are adjacent there is no path of length 3 between them the result is optimal in the sense that paths of all possible lengths are found in star graphs

sharp adaptation for inverse problems with random noise we consider a heteroscedastic sequence space setup with polynomially increasing variances of observations that allows to treat a number of inverse problems in particular multivariate ones we propose an adaptive estimator that attains simultaneously exact asymptotic minimax constants on every ellipsoid of functions within a wide scale that includes ellipoids with polynomially and exponentially decreasing axes and at the same time satisfies asymptotically exact oracle inequalities within any class of linear estimates having monotone non increasing weights the construction of the estimator is based on a properly penalized blockwise stein s rule with weakly geometically increasing blocks as an application we construct sharp adaptive estimators in the problems of deconvolution and tomography

conditional diagnosability of alternating group graphs let an be the alternating group of degree n with n 3 set s 1 2 i 1 i 2 3 i n the alternating group graph denoted by agn is defined as the cayley graph on an with respect to s jwo et al networks 23 1993 315 326 introduced alternating group graph agn as an interconnection network topology for computing systems conditional diagnosability a new measure of diagnosability introduced by lai et al ieee transactions on computers 54 2 2005 165 175 can better measure the diagnosability of regular interconnection networks this paper determines that under pmc model the conditional diagnosability of agn is 4 for n 4 and 6n 18 for each n 5

bipanconnectivity of balanced hypercubes the balanced hypercube proposed by wu and huang is a variant of the hypercube network in this paper paths of various lengths are embedded into balanced hypercubes a bipartite graph g is bipanconnected if for two arbitrary nodes x and y of g with distance d x y there exists a path of length l between x and y for every integer l with d x y l v g 1 and l d x y 0 mod 2 we prove that the n dimensional balanced hypercube bh n is bipanconnected for all n 1 this result is stronger than that obtained by xu et al which shows that the balanced hypercube is edge bipancyclic and hamiltonian laceable

edge pancyclicity and hamiltonian laceability of the balanced hypercubes abstract the balanced hypercube bh n is a variant of the hypercube q n huang and wu proved that bh n has better properties than q n with the same number of links and processors in particularly they showed that there exists a cycle of length 2 l in bh n for all l 2 l 2 n in this paper we improve this result by showing that bh n is edge pancyclic which means that for arbitrary edge e there exists a cycle of even length from 4 to 2 2 n containing e in bh n we also show that the balanced hypercubes are hamiltonian laceable

fault tolerant cycle embedding in alternating group graphs abstract cycle embedding is an important issue in evaluating the efficiency of interconnection networks and is also an extension of the theoretical research on hamiltonicity in this paper we study the fault tolerant hamiltonicity of alternating group graphs which were recently proposed as interconnection topologies for parallel and distributed systems a cycle of length l is said to be an l cycle let f be a set of faulty vertices in an n dimensional alternating group graph ag n and let m be the number of vertices in ag n f a previous result in j m chang j s yang y l wang y cheng panconnectivity fault tolerant hamiltonicity and hamiltonian connectivity in alternating group graphs networks 44 2004 302 310 showed that for n 4 ag n f is hamiltonian i e ag n f possesses a hamiltonian cycle if f n 2 and ag n f is hamiltonian connected i e every two vertices of ag n f are connected by a hamiltonian path if f n 3 in this paper we show the following results i ag n f is pancyclic i e ag n f contains an l cycle for each l with 3 l m if f n 2 ii ag n f is vertex pancyclic i e every vertex of ag n f is contained in an l cycle for each l with 3 l m if f n 3 and iii ag n f is edge 4 pancyclic i e every edge of ag n f is contained in an l cycle for each l with 4 l m if f n 4 the first result is an improvement over the previous one and the last two results are new characterization of fault tolerant pancyclicity on ag n all the results we achieved are the best possible in the sense that the number of faulty vertices cannot be increased

the balanced hypercube a cube based system for fault tolerant applications in this paper we present an interconnection structure called the balanced hypercube which is a variation of the standard hypercube with desirable properties of strong connectivity regularity and symmetry the proposed structure is a special type of load balanced graph designed to tolerate processor failure in balanced hypercubes each processor has a backup matching processor that shares the same set of neighboring nodes therefore tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration other properties of balanced hypercubes are examined it is also shown that odd dimensional balanced hypercubes have smaller diameters than that of standard hypercubes as an application of balanced hypercubes we show a fault tolerant embedding of rings in balanced hypercubes

convergence rates of general regularization methods for statistical inverse problems and applications previously the convergence analysis for linear statistical inverse problems has mainly focused on spectral cut off and tikhonov type estimators spectral cut off estimators achieve minimax rates for a broad range of smoothness classes and operators but their practical usefulness is limited by the fact that they require a complete spectral decomposition of the operator tikhonov estimators are simpler to compute but still involve the inversion of an operator and achieve minimax rates only in restricted smoothness classes in this paper we introduce a unifying technique to study the mean square error of a large class of regularization methods spectral methods including the aforementioned estimators as well as many iterative methods such as nu methods and the landweber iteration the latter estimators converge at the same rate as spectral cut off but require only matrix vector products our results are applied to various problems in particular we obtain precise convergence rates for satellite gradiometry l 2 boosting and errors in variable problems

conditional fault tolerant edge bipancyclicity of hypercubes with faulty vertices and edges let f be a faulty set in an n dimensional hypercube q n such that in q n f each vertex is incident to at least two edges and let f v f e be the numbers of faulty vertices and faulty edges in f respectively in this paper we consider the fault tolerant edge bipancyclicity of hypercubes it is shown that each edge in q n f for n 3 lies on a fault free cycle of any even length from 6 to 2 n 2 f v if f v f e 2 n 5 this gives an answer for a problem proposed by yang et al 2016 33 consider hypercubes with mixed faulty edges and faulty vertices under conditional fault model improve the previous results about the fault tolerant edge bipancyclicity of hypercubes give an affirmative answer for a problem proposed by yang et al 2016

fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs the arrangement graph a sub n k is a generalization of the star graph there are some results concerning fault hamiltonicity and fault hamiltonian connectivity of the arrangement graph however these results are restricted in some particular cases and thus are less completed we improve these results and obtain a stronger and simpler statement let n k spl ges 2 and f spl sube v a sub n k spl cup e a sub n k we prove that a sub n k f is hamiltonian if f spl les k n k 2 and a sub n k f is hamiltonian connected if f spl les k n k 3 these results are optimal

hamiltonian cycle embedding for fault tolerance in balanced hypercubes abstract the balanced hypercube bh n defined by wu and huang is a variant of the hypercube network yang proposed that fault tolerance of balanced hypercube bh n is an important issue in parallel computing which needs further study yang 2010 24 in this paper we prove that there exists a fault free hamiltonian path between any two adjacent vertices in bh n with 2 n 2 faulty edges as a corollary we derive that for any fault free edge e there exists a fault free hamiltonian cycle containing e in bh n with 2 n 2 faulty edges which is optimal in the sense of the number of faulty edges

statistical inverse estimation in hilbert scales the recovery of signals from indirect measurements blurred by random noise is considered under the assumption that prior knowledge regarding the smoothness of the signal is avialable for greater flexibility the general problem is embedded in an abstract hilbert scale in the applications sobolev scales are used for the construction of estimators we employ preconditioning along with regularized operator inversion in the appropriate inner product where the operator is bounded but not necessarily compact a lower bound to certain minimax rates is included and it is shown that in generic examples the proposed estimators attain the asymptotic minimax rate examples include errors in variables deconvolution and indirect nonparametric regression special instances of the latter are estimation of the source term in a differential equation and the estimation of the initial state in the heat equation

cohomology of conformal algebras the notion of a conformal algebra encodes an axiomatic description of the operator product expansion of chiral fields in conformal field theory on the other hand it is an adequate tool for the study of infinite dimensional lie algebras satisfying the locality property the main examples of such lie algebras are those based on the punctured complex plane such as the virasoro algebra and loop lie algebras in the present paper we develop a cohomology theory of conformal algebras with coefficients in an arbitrary module it possesses standards properties of cohomology theories for example it describes extensions and deformations we offer explicit computations for the most important examples

symmetric property and reliability of balanced hypercube huang and wu in ieee transactions on computers 46 1997 484 490 introduced the balanced hypercube bh n as an interconnection network topology for computing systems and they proved that bh n is vertex transitive however some other symmetric properties say edge transitivity and arc transitivity of bh n remained unknown in this paper we solve this problem and prove that bh n is an arc transitive cayley graph using this we also investigate some reliability measures including super connectivity cyclic connectivity etc in bh n first we prove that every minimum edge cut of bh n n ge 2 isolates a vertex and every minimum vertex cut of bh n n ge 3 isolates a vertex this is stronger than that obtained by wu and huang which shows the connectivity and edge connectivity of bh n are 2n second yang applied mathematics and computation 219 2012 970 975 proved that for n ge 2 the super connectivity of bh n is 4n 4 and the super edge connectivity of bh n is 4n 2 in this paper we proved that bh n n ge 2 is super lambda prime but not super kappa prime that is every minimum super edge cut of bh n n ge 2 isolates an edge but the minimum super vertex cut of bh n n ge 2 does not isolate an edge third we also obtain that for n ge 2 the cyclic connectivity of bh n is 4n 4 and the cyclic edge connectivity of bh n is 4 2n 2 that is to become a disconnected graph which has at least two components containing cycles we need to remove at least 4n 4 vertices resp 4 4n 2 edges from bh n n ge 2

edge fault tolerant bipanconnectivity of hypercubes this paper shows that for any two distinct vertices u and v with distance d in the hypercube q n n 3 with at most 2n 5 faulty edges and each vertex incident with least two fault free edges there exist fault free uv paths of length in q n for every with d 4 2 n 1 and d 0 mod2 this result improves some known results on edge fault bipanconnectivity of hypercubes the proof is based on the recursive structure of q n

schrodinger invariance and strongly anisotropic critical systems the extension of strongly anisotropic or dynamical scaling to local scale invariance is investigated for the special case of an anisotropy or dynamical exponent z 2 the group of local scale transformation considered is the schrodinger group which can be obtained as the nonrelativistic limit of the conformal group the requirement of schrodinger invariance determines the two point function in the bulk and reduces the three point function to a scaling form of a single variable scaling forms are also derived for the two point function close to a free surface which can be either spacelike or timelike these results are reproduced in several exactly solvable statistical systems namely the kinetic ising model with glauber dynamics lattice diffusion lifshitz points in the spherical model and critical dynamics of the spherical model with a nonconserved order parameter for generic values of evidence from higher order lifshitz points in the spherical model and from directed percolation suggests a simple scaling form of the two point function

risk bounds for model selection via penalization performance bounds for criteria for model selection are devel oped using recent theory for sieves the model selection criteria are based on an empirical loss or contrast function with an added penalty term moti vated by empirical process theory and roughly proportional to the number of parameters needed to describe the model divided by the number of ob servations most of our examples involve density or regression estimation settings and we focus on the problem of estimating the unknown density or regression function we show that the quadratic risk of the minimum penal ized empirical contrast estimatoris bounded by an index of the accuracy of the sieve this accuracy index quanties the trade off among the candidate models between the approximation error and parameter dimension relative to sample size if we choose a list of models which exhibit good approximation prop erties with respect to different classes of smoothness the estimator can be simultaneously minimax rate optimal in each of those classes this is what is usually called adaptation the type of classes of smoothness in which one gets adaptation depends heavily on the list of models if too many models are involved in order to get accurate approximation of many wide classes of functions simultaneously it may happen that the estimator is only approx

edge fault tolerant edge bipancyclicity of balanced hypercubes abstract the balanced hypercube bh n is a variant of hypercube q n hao et al 2014 showed that there exists a fault free hamiltonian path between any two adjacent vertices in bh n with 2 n 2 faulty edges cheng et al 2015 proved that bh n is 6 edge bipancyclic after 2 n 3 faulty edges occur for all n 2 in this paper we improve these two results by demonstrating that bh n is 6 edge bipancyclic even when there exist 2 n 2 faulty edges for all n 2 our result is optimal with respect to the maximum number of tolerated edge faults

oracle inequalities for inverse problems we consider a sequence space model of statistical linear inverse problems where we need to estimate a function f from indirect noisy observations let a finite set a of linear estimators be given our aim is to mimic the estimator in a that has the smallest risk on the true f under general conditions we show that this can be achieved by simple minimization of an unbiased risk estimator provided the singular values of the operator of the inverse problem decrease as a power law the main result is a nonasymptotic oracle inequality that is shown to be asymptotically exact this inequality can also be used to obtain sharp minimax adaptive results in particular we apply it to show that minimax adaptation on ellipsoids in the multivariate anisotropic case is realized by minimization of unbiased risk estimator without any loss of efficiency with respect to optimal nonadaptive procedures

hamiltonian paths passing through prescribed edges in balanced hypercubes abstract the balanced hypercube was proposed as a novel interconnection network for large scale parallel systems it is known that the balanced hypercube is edge bipancyclic given a set of edges p with p n 1 and two vertices x and y in different bipartite sets we show that there exists a hamiltonian path from x to y passing through p in b h n if and only if p is a linear forest and neither x nor y is an internal vertex of p and x and y are not end vertices of a component of p simultaneously consequently the balanced hypercube contains a hamiltonian cycle passing through a set p of at most n prescribed edges if and only if p is a linear forest moreover our result improves some known results

classification of finite irreducible conformal modules over some lie conformal algebras related to the virasoro conformal algebra in this paper we classify all finite irreducible conformal modules over a class of lie conformal algebras w b with b related to the virasoro conformal algebra explicitly any finite irreducible conformal module over w b is proved to be isomorphic to m with 0 or 0 if b 0 or m with 0 if b 0 as a byproduct all finite irreducible conformal modules over the heisenberg virasoro conformal algebra and the w 2 2 lie conformal algebra are classified finally the same thing is done for the schrodinger virasoro conformal algebra

the principle of penalized empirical risk in severely ill posed problems we study a standard method of regularization by projections of the linear inverse problem y ax e where e is a white gaussian noise and a is a known compact operator it is assumed that the eigenvalues of aa converge to zero with exponential decay such behavior of the spectrum is typical for inverse problems related to elliptic differential operators as model example we consider recovering of unknown boundary conditions in the dirichlet problem for the laplace equation on the unit disk by using the singular value decomposition of a we construct a projection estimator of x the bandwidth of this estimator is chosen by a data driven procedure based on the principle of minimization of penalized empirical risk we provide non asymptotic upper bounds for the mean square risk of this method and we show in particular that this approach gives asymptotically minimax estimators in our model example

matching preclusion for balanced hypercubes matching preclusion is a measure of robustness in the event of edge failure in interconnection networks the matching preclusion number of a graph g is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching and the conditional matching preclusion number of g is the minimum number of edges whose deletion leaves the resulting graph with no isolated vertices and without a perfect matching or an almost perfect matching in this paper we consider balanced hypercubes we obtain that an n dimension balanced hypercube bh n has the matching preclusion number 2n and mainly prove that for the balanced hypercube bh n each matching preclusion set of cardinality 2n is trivial and the conditional matching preclusion number of balanced hypercube is 4n 2 whenever n 2

fault tolerant ring embedding in de bruijn networks a method of embedding a ring in a d ary de bruijn multiprocessor network in the event of multiple node processor failures is presented in particular the algorithm guarantees that a 2 sup n n 1 node ring will be found in a binary de bruijn network with a single faulty node where 2 sup n is the total number of nodes in the network it is also shown that a d sup n 1 node ring can always be found in the presence of d 1 link failures when d is a prime power and the network contains d sup n nodes the latter is accomplished by constructing d 1 edge disjoint cycles each of length d sup n 1 a modification of the graph that allows it to admit a hamiltonian cycle in the event of d 1 edge failures is also discussed

embedding of cycles in arrangement graphs arrangement graphs have been proposed as an attractive interconnection topology for large multiprocessor systems the authors study these graphs by proving the existence of hamiltonian cycles in any arrangement graph they also prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph they show that an arrangement graph can be decomposed into node disjoint cycles in many different ways

speed of estimation in positron emission tomography and related inverse problems we study a continuous idealization of the image reconstruction problem in positron emission tomography considered as an example of bivariate density estimation based on indirect observations given a large sample of indirect observations we consider the size of the equivalent sample of observations whose original exact positions would allow equally accurate estimation of the image of interest both for indirect and for direct observations we establish exact minimax rates of convergence of estimation for all possible estimators over suitable smoothness classes of functions the approach of the paper is applicable to a wide class of linear inverse problems

on the optimal rates of convergence for nonparametric deconvolution problems deconvolution problems arise in a variety of situations in statistics an interesting problem is to estimate the density f of a random variable x based on n i i d observations from y x varepsilon where varepsilon is a measurement error with a known distribution in this paper the effect of errors in variables of nonparametric deconvolution is examined insights are gained by showing that the difficulty of deconvolution depends on the smoothness of error distributions the smoother the harder in fact there are two types of optimal rates of convergence according to whether the error distribution is ordinary smooth or supersmooth it is shown that optimal rates of convergence can be achieved by deconvolution kernel density estimators

risk hull method and regularization by projections of ill posed inverse problems we study a standard method of regularization by projections of the linear inverse problem y af where is a white gaussian noise and a is a known compact operator with singular values converging to zero with polynomial decay the unknown function f is recovered by a projection method using the singular value decomposition of a the bandwidth choice of this projection regularization is governed by a data driven procedure which is based on the principle of risk hull minimization we provide nonasymptotic upper bounds for the mean square risk of this method and we show in particular that in numerical simulations this approach may substantially improve the classical method of unbiased risk estimation

schrodinger virasoro lie conformal algebra we first construct two new nonsimple conformal algebras associated with the schrodinger virasoro lie algebra and the extended schrodinger virasoro lie algebra respectively then we study conformal derivations and free nontrivial rank one conformal modules of these two conformal algebras also we provide a computation of their universal central extensions