VC快速处理图像的一种方法

介绍在Ｍｉｃｒｏｓｏｆｔ的可视化平台Ｖｉｓｕａｌ Ｓｔｕｄｉｏｓ下,如何为图像申请内存、如何将图像读入内存以及如何快速显示内存中的图像等。这些均是软件开发工作者在进行图像处理或编写应用软件时经常面对的问题。通过ＶＣ较好地解决了这一问题。     

A transference method in quantum probability

Working with a rather general notion of independence, we provide a transference method which allows to compare the p-norm of sums of independent copies with the p-norm of sums of free copies. Our main technique is to construct explicit operator space Lp embeddings preserving independence to reduce the problem to L₁, where some recent results by the first-named author can be used. We find applications on noncommutative Khintchine/Rosenthal type inequalities and on noncommutative Lp embedding theory.     

Degree-bounded factorizations of bipartite multigraphs and of pseudographs

For d≥1, s≥0 a (d,d+s)-graph is a graph whose degrees all lie in the interval {d,d+1,…,d+s}. For r≥1, a≥0 an (r,r+a)-factor of a graph G is a spanning (r,r+a)-subgraph of G. An (r,r+a)-factorization of a graph G is a decomposition of G into edge-disjoint (r,r+a)-factors. A graph is (r,r+a)-factorable if it has an (r,r+a)-factorization.We prove a number of results about (r,r+a)-factorizations of (d,d+s)-bipartite multigraphs and of (d,d+s)-pseudographs (multigraphs with loops permitted). For example, for t≥1 let β(r,s,a,t) be the least integer such that, if d≥β(r,s,a,t) then every (d,d+s)-bipartite multigraph G is (r,r+a)-factorable with x(r,r+a)-factors for at least t different values of x. Then we show that

     

On symmetric graphs of valency five

A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and G_v the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and G_v is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that G_v is isomorphic to the cyclic group Z₅, the dihedral group D₁₀ or the dihedral group D₂₀ for s=1, the Frobenius group F₂₀ or F₂₀×Z₂ for s=2, or F₂₀×Z₄ for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .     

Linear maps preserving the minimum and reduced minimum moduli

We describe linear maps from a C^∗-algebra onto another one preserving different spectral quantities such as the minimum modulus, the surjectivity modulus, and the reduced minimum modulus.     

On semi-R-boundedness and its applications

R-Boundedness is a randomized boundedness condition for sets of operators which in recent years has found many applications in the maximal regularity theory of evolution equations, stochastic evolution equations, spectral theory and vector-valued harmonic analysis. However, in some situations additional geometric properties such as Pisier's property (α) are required to guaranty the R-boundedness of a relevant set of operators. In this paper we show that a weaker property called semi-R-boundedness can be used to avoid these geometric assumptions in the context of Schauder decompositions and the H^∞-calculus. Furthermore, we give weaker conditions for stochastic integrability of certain convolutions.     

Infinitely many homoclinic orbits for the second order Hamiltonian systems with general potentials

In this paper we study the following nonperiodic second order Hamiltonian systems

     

Resilience and reliability analysis of P2P network systems

This paper conducts resilience and reliability analysis of P2P network by studying the isolation probability and the durable time of a single user. The network with user’s lifetime having stronger NWUE property is proved to be more resilient. Further, both graphical and nonparametric methods are developed to test the NWUE order between two data sets.     

Multiplicity of solutions for a class of elliptic systems with critical Sobolev exponent

In this paper we consider systems of p-q-Laplacian elliptic equations with critical Sobolev exponent. The existence and multiplicity results of solutions are obtained by a limit index method.