SPIHT静止图像压缩技术研究

JPEG2000的静止图像压缩算法具有很多优良特性,其核心算法是EBCOT,构造复杂、硬件实现难度大。而基于SPIHT算法的图像压缩效率接近EBCOT,但结构简单、易于硬件实现。通过对SPIHT和JPEG2000算法进行融合,提出了一套压缩比高、可实现由有损到无损、码流渐进传输的静止图像编码方案,并对SPIHT算法与(9,7)小波提升算法的融合方法进行分析研究,所构造系统性能与JPEG2000算法接近,具有较好的应用前景。     

基于攻击树的协同入侵攻击建模

由于现代入侵方法从单步入侵转变到协同入侵,文章在传统攻击树基础上,提出了分层次攻击树,并用模块化的方法为协同攻击建模,以IP-spoofing攻击为例说明了建模方法。     

A Basis for the Top Homology of a Generalized Partition Lattice

For a fixed positive integer k, consider the collection of all affine hyperplanes in n-space given by xi – xj = m, where i, j [n], i j, and m {0, 1,..., k}. Let Ln,k be the set of all nonempty affine subspaces (including the empty space) which can be obtained by intersecting some subset of these affine hyperplanes. Now give Ln,k a lattice structure by ordering its elements by reverse inclusion. The symmetric group Gn acts naturally on Ln,k by permuting the coordinates of the space, and this action extends to an action on the top homology of Ln,k. It is easy to show by computing the character of this action that the top homology is isomorphic as an Gn-module to a direct sum of copies of the regular representation, CGn. In this paper, we construct an explicit basis for the top homology of Ln,k, where the basis elements are indexed by all labelled, rooted, (k + 1)-ary trees on n-vertices in which the root has no 0-child. This construction gives an explicit Gn-equivariant isomorphism between the top homology of Ln,k and a direct sum of copies of CGn.     

The boson gas on a Cayley tree

We analyze the free boson gas on a Cayley tree using two alternative methods. The spectrum of the lattice Laplacian on a finite tree is obtained using a direct iterative method for solving the associated characteristic equation and also using a random walk representation for the corresponding fermion lattice gas. The existence of the thermodynamic limit for the pressure of the boson lattice gas is proven and it is shown that the model exhibits boson condensation into the ground state. The random walk representation is also used to derive an expression for the Bethe approximation to the infinite-volume spectrum. This spectrum turns out to be continuous instead of a dense point spectrum, but there is still boson condensation in this approximation.     

Almost sure quasilocality fails for the random-cluster model on a tree

We study the random-cluster model on a homogeneous tree, and show that the following three conditions are equivalent for a random-cluster measure: quasilocality, almost sure quasilocality, and the almost sure nonexistence of infinite clusters. As a consequence of this, we find that the plus measure for the Ising model on a tree at sufficiently low temperatures can be mapped, via a local stochastic transformation, into a measure which fails to be almost surely quasilocal.     

Spanning network games

We study fundamental properties of monotone network enterprises which contain public vertices and have positive and negative costs on edges and vertices. Among the properties studied are the nonemptiness of the core, characterization of nonredundant core constraints, ease of computation of the core and the nucleolus, and cases of decomposition of the core and the nucleolus. Received December 1994/Final version March 1998     

Spectra of Some Interesting Combinatorial Matrices Related to Oriented Spanning Trees on a Directed Graph

The Laplacian of a directed graph G is the matrix L(G) = O(G) –, A(G) where A(G) is the adjaceney matrix of G and O(G) the diagonal matrix of vertex outdegrees. The eigenvalues of G are the eigenvalues of A(G). Given a directed graph G we construct a derived directed graph D(G) whose vertices are the oriented spanning trees of G. Using a counting argument, we describe the eigenvalues of D(G) and their multiplicities in terms of the eigenvalues of the induced subgraphs and the Laplacian matrix of G. Finally we compute the eigenvalues of D(G) for some specific directed graphs G. A recent conjecture of Propp for D(H _n ) follows, where H _n stands for the complete directed graph on n vertices without loops.     

通信网中节点重要性的评价方法

提出了一种对通信网中节点重要性进行评价的方法,并给出了简洁的归一化解析表达式。通过比较生成树的数目,可以判断图中任意数目的两组节点的相对重要性。从图中去掉节点以及相关联的链路后,所得到的图对应的生成树数目越少,则表明该组节点越重要。实验结果表明,该方法计算简单,更为精确地反映基于网络拓扑的节点重要性。     

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms cannot guarantee to generate a CDS of small size. Their message complexities can be as high as O(n ²), and their time complexities may also be as large as O(n ²) and O(n ³). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O(n) time complexity and O(nlogn) message complexity. By establishing the (nlogn) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.     

Phase diagram of the Ising Model on a Cayley tree in the presence of competing interactions and magnetic field

We study the phase diagram for the Ising Model on a Cayley tree with competing nearest-neighbor interactionsJ ₁ and next-nearest-neighbor interactionsJ ₂ andJ ₃ in the presence of an external magnetic field. To perform this study, an iterative scheme similar to that appearing in real space renormalization group frameworks is established; it recovers, as particular cases, previous works by Vannimenus and by Inawashiroet al. At vanishing temperature, the phase diagram is fully determined, for all values and signs ofJ ₂/J ₁ andJ ₃/J ₂; in particular, we verify that values ofJ ₃/J ₂ high enough favor the paramagnetic phase. At finite temperatures, several interesting features (evolution of reentrances, separation of the modulated region into two disconnected pieces, etc.) are exhibited for typical values ofJ ₂/J ₁ andJ ₃/J ₂.Partially supported by the Brazilian Agencies CNPq and FINEP.