基于神经网络的线图数据处理模型

提出了一种能够一次处理一组线图数据的新方法,基于神经网络的基本原理,建立了能够处理线图数据的神经网络模型,并且详细的讨论了径向基函数神经网络的具体应用。成为处理线图数据尤其是多线图数据的有利工具。处理过程主要分成三步:(1)采集数据,建立输入、输出矩阵,(2)训练网络模型,(3)检验误差。文中给出了应用实例及误差分析。

Low-dimensional multi-spectral space for color reproduction based on nonnegative constrained principal component analysis

In order to overcome the shortcomings that the reconstructed spectral reflectance may be negative when using the classic principal component analysis （PCA）to reduce the dimensions of the multi-spectral data, a nonnegative constrained principal component analysis method is proposed to construct a low-dimensional multi-spectral space and accomplish the conversion between the new constructed space and the multispectral space. First, the reason behind the negative data is analyzed and a nonnegative constraint is imposed on the classic PCA. Then a set of nonnegative linear independence weight vectors of principal components is obtained, by which a lowdimensional space is constructed. Finally, a nonlinear optimization technique is used to determine the projection vectors of the high-dimensional multi-spectral data in the constructed space. Experimental results show that the proposed method can keep the reconstructed spectral data in [ 0, 1 ]. The precision of the space created by the proposed method is equivalent to or even higher than that by the PCA.

Prediction of Demand and Tendency of the Book Market in China

The prediction model of the demand of the book market in China from the quantitative angle is established,and the total demand of the books for years from 2002 to 2004 is predicted.The effects of the gross domestic product,household consumption,price and population on the demand of books are also analyzed.In the end,it is summarized that the acceleration of the development of Chinese book industry,the refinement of the books,the innovation of the advertisement,the series of the structure and the steady increase of the price will become the remarkable characteristics of the book market.

CEE-Gr:A Global Router with Performance Optimization Under Multi-Constraints

A global routing algorithm with performance optimization under multi constraints is proposed,which studies RLC coupling noise,timing performance,and routability simultaneously at global routing level.The algorithm is implemented and the global router is called CEE Gr.The CEE Gr is tested on MCNC benchmarks and the experimental results are promising.

Hypergraph High-Dimension Clustering Algorithm for Optimized Cooperative Wireless Multicast

In order to guarantee the wireless multicast throughput at a minimum cost, we propose a layered hypergraph high-dimension clustering algorithm (LayerHC) considering the channels and statistical locations of mobile members. The algorithm can achieve a minimum multicast spanning tree to obtain a minimum number of relays and effective cooperative areas with low computational complexity.

Imaging technologies in oilfield applications

In this paper, we describe some recent imaging technologies developed by Schlumberger for oilfield downhole mul- tiphase flow production logging (PL) and cross-well electromagnetic (EM) survey applications. FloScan Imager (FSITM) has been introduced as a 3-phase oil/gas/water flow PL tool for deviated and horizontal wells. FSI sensors can map fluid velocity and holdup profiles along a vertical diameter of the wellbore at every survey depth, enabling a robust estimate of the individual phase flow rates in complex flow regimes. The cross-well EM survey is based on cross-borehole induction logging technique and provides resistivity distribution at a reservoir scale. It is a useful tool for reservoir management and is most effective in dynamic fields where fluid saturations are variable in time and space. The tool can be used to identify (water or steam) flooded and bypassed regions. By monitoring changes in the resistivity spatial distribution with time, cross-well EM survey is very effective at mapping inter-well temperature and structure. Some field examples are shown for both FloScan Imager PL tool and cross-well resistivity imaging survey.

PROJECTION BASED STATISTICAL FEATURE EXTRACTION WITH MULTISPECTRAL IMAGES AND ITS APPLICATIONS ON THE YELLOW RIVER MAINSTREAM LINE DETECTION

Mainstream line is significant for the Yellow River situation forecasting and flood control.An effective statistical feature extraction method is proposed in this paper.In this method, a between-class scattering matrix based projection algorithm is performed to maximize between-class differences, obtaining effective component for classification;then high-order statistics are utilized as the features to describe the mainstream line in the principal component obtained.Experiments are performed to verify the applicability of the algorithm.The results both on synthesized and real scenes indicate that this approach could extract the mainstream line of the Yellow River automatically, and has a high precision in mainstream line detection.

On k-Star Arboricity of Graphs

A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.

Local curve fitting based Lagrange multiplier selection for Id-slice in multi-view video coding

The rate and distortion of Id-slice do not fit the globally linear relationship on a logarithmic scale. Lagrange multiplier selection methods based on the globally linear approximate relationship are neither efficient nor optimal for multi-view video coding (MVC). To improve the coding efficiency of MVC, a local curve fitting based Lagrange multiplier selection method is proposed in this paper, where Lagrange multipliers are selected according to the local slopes of the approximate curves. Experi-mental results showed that the proposed method improves the coding efficiency. Up to 2.5 dB gain was achieved at low bitrates.

A fake projective plane constructed from an elliptic surface with multiplicities (2,4)

Given any (2,4)-elliptic surface with nine smooth rational curves,eight (2)-curves and one (3)-curve,forming a Dynkin diagram of type [2,2][2,2][2,2][2,2,3],we show that a fake projective plane can be constructed from it by taking a degree 3 cover and then a degree 7 cover.We also determine the types of singular fibres of such a (2,4)-elliptic surface.

Self-assembly and chemical processing of block copolymers:A roadmap towards a diverse array of block copolymer nanostructures

Block copolymers can yield a diverse array of nanostructures.Their assembly structures are influenced by their inherent structures,and the wide variety of structures that can be prepared especially becomes apparent when one considers the number of routes available to prepare block copolymer assemblies.Some examples include self-assembly,directed assembly,coupling,as well as hierarchical assembly,which can yield assemblies having even higher structural order.These assembly routes can also be complemented by processing techniques such as selective crosslinking and etching,the former technique leading to permanent structures,the latter towards sculpted and the combination of the two towards permanent sculpted structures.The combination of these pathways provides extremely versatile routes towards an exciting variety of architectures.This review will attempt to highlight destinations reached by LIU Guojun and coworkers following these pathways.

An efficient algorithm for factoring polynomials over algebraic extension field

An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its CrSbner basis, no extra Grbbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.