超声逆散射成像问题中的截断完全最小二乘法

在超声逆散射成像问题中,由于要反复迭代求物体内部的全场与未知函数,使得方程组的系数矩阵与数据项均存在误差,将同时考虑系数矩阵和数据项均存在误差的截断完全最小二乘正则化方法运用于超声逆散射成像问题中．数值仿真结果显示,截断完全最小二乘法与传统的Tikhanov的正则化方法相比,可以提高数据的拟合程度,也即提高了成像的质量．     

Low-Complexity Bit-Parallel Multiplier over GF(2$^m$) Using Dual Basis Representation

Recently, cryptographic applications based on finite fields have attracted much attention. The most demanding finite field arithmetic operation is multiplication. This investigation proposes a new multiplication algorithm over GF（2^m） using the dual basis representation. Based on the proposed algorithm, a parallel-in parallel-out systolic multiplier is presented, The architecture is optimized in order to minimize the silicon covered area （transistor count）. The experimental results reveal that the proposed bit-parallel multiplier saves about 65% space complexity and 33% time complexity as compared to the traditional multipliers for a general polynomial and dual basis of GF（2^m）.     

Research of assembling optimized classification algorithm by neural network based on Ordinary Least Squares (OLS)

A new optimized classification algorithm assembled by neural network based on Ordinary Least Squares (OLS) is established here. While recognizing complex high-dimensional data by neural network, the design of network is a challenge. Besides, single network model can hardly get satisfying recognition accuracy. Firstly, feature dimension reduction is carried on so that the design of network is more convenient. Take Elman neural network algorithm based on PCA as sub-classifier I. The recognition precision of this classifier is relatively high, but the convergence rate is not satisfying. Take RBF neural network algorithm based on factor analysis as sub-classifier II. The convergence rate of the classifier algorithm is fast, but the recognition precision is relatively low. In order to make up for the deficiency, by carrying on ensemble learning of the two sub-classifiers and determining optimal weights of each sub-classifier by OLS principle, assembled optimized classification algorithm is obtained, so to some extent, information loss caused by dimensionality reduction in data is made up. In the end, validation of the model can be tested by case analysis.     

A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)

Constructing normal bases of GF(qⁿ) over GF (q) can be done by probabilistic methods as well as deterministic ones. In the following paper we consider only deterministic constructions. As far as we know, the best complexity for probabilistic algorithms is O(n² log⁴n log² (log n) + n log n log (log n) log q ) (see von zur Gathen and Shoup, 1992). For deterministic constructions, some prior ones, e.g. Lueneburg (1986), do not use the factorization of Xⁿ - 1 over GF(q). As analysed by Bach, Driscoll and Shallit (1993), the best complexity (from Lueneburg, 1986) is O(n³ log n log(log n) + n² log n log(log n) log q). For other deterministic constructions, which need such a factorization, the best complexities are O(n^3,376 + n² log n log(log n) log q) (von zur Gathen and Giesbrecht, 1990), or O(n³ log q); see Augot and Camion (1993). Here we propose a new deterministic construction that does not require the factorization of Xⁿ - 1. Its complexity is reduced to O (n³ + n log n log(log n) log q ).     

一个常微分方程的整体解存在性

该文研究了常微分方程(d2u/dx2)+K(x)2n=0在(-1,1)上整体解的存在性,此问题源于H2上的预定保角高斯曲率问题,证明了一个存在定理,解释了其几何意义.     

杂合型全局优化法优化Sr2+(H2O)n团簇

以半经验的势能函数描述H_2O-H_2O之间和Sr~(2 )-H_2O间的相互作用,采用杂合型全局优化法(fast hybrid global optimiza- tion algorithm,FHGOA)搜索Sr~(2 )(H_2O)_n(n=1-30)团簇的最优结构。结果表明：当n=1-8时,团簇为n_1 0结构,其中,在n_1=5-7时,优化出的团簇结构与实验结果相吻合;当n=9-19时,团簇结构为8 n_2结构;当n=20-30,团簇结构为9 n_2结构。根据实验结果推断：在Sr~(2 )水溶液中,Sr~(2 )的水化数为9,此结果和MC模拟的结果是一致的。     

基于频域最小距离的SPOT(Pan)图像纹理分类算法

为了将频谱对纹理特性的表征能力应用于遥感图像分类提出了基于频域最小距离遥感图像纹理分类算法。将模板图像和适当窗口大小的待判别图像分别进行傅立叶变换,计算两者的频域距离,距离最小者即判别窗口中心像元为该类别的地物。运用该方法对SPOT(Pan)图像进行纹理分类试验,结果表明窗口大小为3×3时分类效果最好,总体分类精度达到80.4%。     

(n+1)维空间Cn[a,b]上规范B基存在的充要条件

给出(n 1)维空间C^n[a,b]上规范B基存在的充要条件,并就摆线的规范B基的非退化表示进行讨论,得到了函数空间Pl＝span{l,t,cost,sint}中摆线的非退化规范B基表示．     

(X+K)mod2n和X(+)K相容程度分析

"与K模2n加"-Y=(X+K)mod2n是密码算法中一个常用的基本编码环节,这里的K表示一个固定的常数.该环节具有较好的非线性性质,在许多分组密码、流密码算法以及杂凑函数中都有着广泛的应用.研究了(X+K)mod2n和X(+)K的相容程度,给出了噪声函数N(x)=(X+K)mod2nX(+)K在各点概率的计算公式以及在各点概率值平方和的一些性质.     

Rational Zoom of Bit Maps Using B-Spline Interpdation in Computerized 2-D Animation

This paper describes the application of B-spline interpolation to the problem of rational transformation in computerized 2-D animation. The technique described herewith can also be applied to the resolution independence problem which arises when the same production workstation is used to produce animation series to be recorded on variable film sizes This article fully explains our solution to the problem of rational zoom. An algorithm has been written to speed up computations by spreading the computing load among similar technical workstations hooked up in a network. Large magnifications of professional quality can be achieved in very little time and very smooth animation effects can be obtained by applying rational zooms with magnification coefficients that are a time function.     

A method for exact reliability of consecutive2-out-of-(r, r)-from-(n, n):F systems

A new reliability model, consecutive 2‐out‐of‐(r, r)‐from‐(n, n):F model, is proposed. The consecutive 2‐out‐of‐(r, r)‐from‐(n, n):F system consists of a square grid of side n (containing n² components) such that the system fails if and only if there is at least one square of side r which includes among them at least two failed components. For i.i.d. case an algorithm is given for computing the reliability of the system. The reliability function can be expressed by the number of 0–1 matrices having no two or more 0s at any square of side r.     

New (n, r)-arcs in PG(2, 17), PG(2, 19), and PG(2, 23)

An (n, r)-arc is a set of n points of a projective plane such that some r but no r+1 of them are collinear. The maximum size of an (n, r)-arc in PG(2, q) is denoted by m _r (2, q). In this paper a new (95, 7)-arc, (183, 12)-arc, and (205, 13)-arc in PG(2, 17) are constructed, as well as a (243, 14)-arc and (264, 15)-arc in PG(2, 19). Likewise, good large (n, r)-arcs in PG(2, 23) are constructed and a table with bounds on m _r (2, 23) is presented. In this way many new 3-dimensional Griesmer codes are obtained. The results are obtained by nonexhaustive local computer search.     

AnO(n 2) incremental algorithm for modular decomposition of graphs and 2-structures

This paper gives anO(n ²) incremental algorithm for computing the modular decomposition of 2-structures [1], [2]. A 2-structure is a type of edge-colored graph, and its modular decomposition is also known as the prime tree family. Modular decomposition of 2-structures arises in the study of relational systems. The modular decomposition of undirected graphs and digraphs is a special case, and has applications in a number of combinatorial optimization problems. This algorithm generalizes elements of a previousO(n ²) algorithm of Muller and Spinrad [3] for the decomposition of undirected graphs. However, Muller and Spinrad's algorithm employs a sophisticated data structure that impedes its generalization to digraphs and 2-structures, and limits its practical use. We replace this data structure with a scheme that labels each edge with at most one node, thereby obtaining an algorithm that is both practical and general to 2-structures.     

Ab initio study of mono-layer 2-D insulators (X-(OH)2 and h-BN) and their use in MTJ memory device

The paper presents an ab initio study of the 2-D insulators and their effect on the performance of a magnetic tunnel junction memory (MTJ) device. MTJ devices has been considered as an alternate to the charge based data storage cells due to its spin-polarised operation and high scaling probability. The use of 2-D insulators like X-(OH)₂ (X: Ca and Mg) and h-BN (hexagonal-Boron Nitride) in such device would be interesting. The authors have calculated the band structures, density of states and effective mass of electrons and holes for the mono-layer of these three non-conventional 2-D insulators using the first principle calculations in density functional theory framework using Quantumwise ATK tool. The ab initio calculation yielded band gap (E_g) of 4.633, 4.685 and 4.249 eV for h-BN, Ca(OH)₂ and Mg(OH)₂, respectively. The effective mass of electrons was calculated as 0.621, 0.604 and 0.478 for single layer h-BN, Ca(OH)₂ and Mg(OH)₂, respectively. While for holes it is 0.834, 0.446 and 0.407, respectively for h-BN, Ca(OH)₂ and Mg(OH)₂. The MTJ device properties as tunneling-magneto resistance, differential TMR, parallel and anti-parallel resistance, differential resistance and spin transfer torque components (in-plane and out-of-plane) with these materials as composite dielectric has been reported in this paper using MTJ Lab tool. The performance of MTJ memory device with h-BN based composite dielectric is found better.

     

Mod (2p+1)-orientations in line graphs

Jaeger in 1984 conjectured that every $(4p)$-edge-connected graph has a mod $(2p+1)$-orientation. It has also been conjectured that every $(4p+1)$-edge-connected graph is mod $(2p+1)$-contractible. In [Z.-H. Chen, H.-J. Lai, H. Lai, Nowhere zero flows in line graphs, Discrete Math. 230 (2001) 133–141], it has been proved that if G has a nowhere-zero 3-flow and the minimum degree of G is at least 4, then $L(G)$ also has a nowhere-zero 3-flow. In this paper, we prove that the above conjectures on line graphs would imply the truth of the conjectures in general, and we also prove that if G has a mod $(2p+1)$-orientation and $\delta (G)?4p$, then $L(G)$ also has a mod $(2p+1)$-orientation, which extends a result in Chen et al. (2001) [2].     

Intrafullerene electron transfers in Sm-containing metallofullerenes: Sm@C2n (74 < or = 2n < or = 84)

The electronic properties of Sm-containing metallofullerenes, Sm@C74, Sm@C76 (I, II), Sm@C78, Sm@C80, Sm@C82 (I, II, III) and Sm@C84 (I, II, III), are characterized by UV-Vis-NIR absorption spectroscopy and electron energy-loss spectroscopy (EELS). The UV-Vis-NIR absorption spectra of Sm@C74, Sm@C80, Sm@C82 (I, II, III) and Sm@C84 (I, II) are quite similar to those of the corresponding Ca, Sr, Ba, Eu, Tm, Yb-based metallofullerenes. In contrast, the absorption spectra of Sm@C76 (I, II), Sm@C78 and Sm@C84(III) show a novel feature: the onset for Sm@C78 is observed approximately 2600 nm, which corresponds to a small band gap (approximately 0.5 eV). Furthermore, the oxidation states of Sm atom in the various fullerene cages are investigated by EELS, which reveals that the Sm atom takes +2 oxidation state in the fullerene cages. A probable rationale for the tendency to have the Sm2+ state is presented based on a simple thermochemical cycle model.     

模型直升机垂直通道的改进最小二乘辨识方法

分析了模型直升机悬停时垂直方向的位移与总距输入之间的关系,建立了一个参数化模型,设计进行了试验并采集得到了用于辨识的输入输出数据。针对所建参数化模型的特殊性,采用了一种改进的最小二乘法进行参数辨识,得出了解析化的关系式,为进一步分析模型直升机垂直通道的特性和飞行控制系统设计提供了基础。     

碳原子簇Cn(n=2-20)的结构优化及构型转换

将并行快速退火演化算法结合Brenner势能函数用于小碳原子簇Cn(n=2—20)的结构优化,得到了最稳定构型：C2-C4为线型结构;C5-C17,为单环;C18和C19为类富勒烯的笼状结构;C30为最小的富勒烯。在Brenner势中使用了关于键级的修正项Fij以考虑成键轨道的非正常重叠和非、局域效应,研究了Fij项对碳原子簇键级以及结构转变产生的影响和原因,结果表明该修正项可以降低多环碳原子簇的键级,使得原子簇C18和C20的最稳定结构发生从多环到笼状的转变。     

用集合映射构造NF~2中的新依赖

1.引言 NF~2的一个公开问题是如何表示关系.我们认为数据依赖是一种很好的表示方法由依赖表示的数据库模式具有最小数据冗余、上佳分解、高效查询     

On Semidefinite Programming Relaxations of (2+p)-SAT

Recently, de Klerk, van Maaren and Warners [10] investigated a relaxation of 3-SAT via semidefinite programming. Thus a 3-SAT formula is relaxed to a semidefinite feasibility problem. If the feasibility problem is infeasible then a certificate of unsatisfiability of the formula is obtained. The authors proved that this approach is exact for several polynomially solvable classes of logical formulae, including 2-SAT, pigeonhole formulae and mutilated chessboard formulae. In this paper we further explore this approach, and investigate the strength of the relaxation on (2+p)-SAT formulae, i.e., formulae with a fraction p of 3-clauses and a fraction (1–p) of 2-clauses. In the first instance, we provide an empirical computational evaluation of our approach. Secondly, we establish approximation guarantees of randomized and deterministic rounding schemes when the semidefinite feasibility problem is feasible, and also present computational results for the rounding schemes. In particular, we do a numerical and theoretical comparison of this relaxation and the stronger relaxation by Karloff and Zwick [15].