Godoel逻辑系统中F(S)的一个分划及其应用

将王国俊教授于1997年以来在逻辑系统W、W、Wk中引入的广义重言式理论加以扩充、推广,引入α-矛盾式等概念并应用于Godel逻辑系统G、G、Gn中,得到了(1)在逻辑系统G、G中,重言式不可能由对非重言式进行有限次升级算法得到;(2)在逻辑系统Gn中,对任一公式最多进行n-1次升级算法即可得到重言式;(3)在逻辑系统Gn中,是F(S)的一个关于-同余的分划;在逻辑系统G中,是F(S)的一个关于-同余的分划.(4)在[0]-T(R)(R∈|G,G,Gn|)中引入了一种降级算法并讨论了其性质.     

Gdel逻辑系统中F(S)的一个分划及其应用

将王国俊教授于 1997年以来在逻辑系统 W、W、Wk中引入的广义重言式理论加以扩充、推广 ,引入α 矛盾式等概念并应用于G¨odel逻辑系统 G、G、Gn中 ,得到了 (1)在逻辑系统 G、G 中 ,重言式不可能由对非重言式进行有限次升级算法得到 ;(2 )在逻辑系统Gn中 ,对任一公式最多进行n - 1次升级算法即可得到重言式 ;(3)在逻辑系统Gn 中 ,C(Gn) ,in- 1-C(Gn) ,in- 1-T(Gn) ,T(Gn) ｜i∈ { 1,2 ,… ,n- 2 }是F(S)的一个关于同余的分划 ;在逻辑系统 G中 ,C( G) ,(12 ) - -C( G) ,12 -C( G) ,[1- ]-C( G) ,[0 +]-T( G) ,12 -T( G) ,(12 ) +-T( G) ,T( G)是F(S)的一个关于同余的分划。 (4)在 [0 ]-T(R) (R ∈ { G ,G ,Gn} )中引入了一种降级算法并讨论了其性质     

泛圈的K1.3—Free图

在n阶的2-连通的K_(1.3)-Free中,若对任何3个相互无关的独立点{x,y,z)总有:d(x)+d(y)+d(z)≥n-2.则除去某些小阶的例外图之外,G是泛围图。     

基于KL变换和TV模型的彩色图像修复算法

在图像修复中,传统的全变分(TV)模型因其能有效地对小面积破损区域进行修复而被广泛地使用。但若将其直接应用于彩色图像的修复,往往会因彩色图像中各分量(R,G和B)之间的相关性而给修复的结果带来伪彩色。为了解决这一问题,本文在TV模型的基础上提出了一种基于KL变换的彩色图像修复算法(KLTV算法)。该算法首先采用KL变换将彩色图像中R、G、B三个分量的相关性去除以得到三个独立的图像分量,然后运用TV模型对这三个独立分量分别进行修复。实验结果表明,相较于传统的修复算法,KLTV算法不仅可以确保图像修复后的视觉效果,而且可以确保图像修复后的图像质量。     

生成锁(P)〈G,X,X'〉和它的中央加密系统

利用数据生成技术,提出生成锁(P)〈G,X,X'〉的概念和由(P)〈G,X,X'〉构成的中央加密系统.这些系统是:生成锁(P)〈G,X,X'〉与单齿中央加密系统,生成锁(P)〈G,X,X'〉与多齿中央加密系统.给出单齿加密-解密算法,多齿加密-解密算法,多齿静态加密-解密算法,多齿动态加密-解密算法,中央加密系统的结构特性.研究指出:任意两个秘密通讯的双方A和B,它们各自选择无规则分布的正整数集合XA={z1,x2,…,xn},XB={x1,x2,…,zm},m,n≥4,XA≠XB,利用(P)〈G,X,X'〉完成双方之间的秘密通讯.研究结果表明,所提出的方法具有良好的应用性,安全性.     

AMD推出全新G系列QPU，同时宣布平台支持期限延长至2O17年

AMD日前推出了一款全新的G系列APU，这款G—T16R和之前的G系列产品相比功耗更低，平均只有2．3W，TDP功耗也只有4．5W。它的尺寸很小，适合在机顶盒、医疗设备、工业控制装置上使用。G—T16R采用了多核x86CPU加GPU的配置，确保了对技术的兼容性。另外AMD同时也宣布对G系列APU平台的支持期限将延长至2017年（比原来增加了5年），这样许多老用户在接下来的5年里也就不用担心啦。     

图中具有分数(g,f)-因子的若干充分条件

设g和f分别是定义在图G的顶点集合V(G)上的整数值函数且对每个x∈V(G)有0≤g(x)≤f(x)。本文给出了一个图有分数(g,f)-因子的若干充分条件。     

生成锁 和它的中央加密系统

利用数据生成技术,提出生成锁 的概念和由 构成的中央加密系统。这些系统是：生成锁 与单齿中央加密系统,生成锁 与多齿中央加密系统。给出单齿加密-解密算法,多齿加密-解密算法,多齿静态加密-解密算法,多齿动态加密-解密算法,中央加密系统的结构特性。研究指出：任意两个秘密通讯的双方A和B,它们各自选择无规则分布的正整数集合XA={x1,x2,…,xn},XB={x1,x2,…,xm},m,n≥……所提出的方法具有良好的应用性,安全性。     

AMD推出全新G系列APU,同时宣布平台支持期限延长至2017年

AMD日前推出了一款全新的G系列APU,这款G-T16R和之前的G系列产品相比功耗更低,平均只有2.3W,TDP功耗也只有4.5W。它的尺寸很小,适合在机顶盒、医疗设备、工业控制装置上使用。G-T16R采用了多核x86CPU加GPU的配置,确保了对技术的兼容性。另外AMD同时也宣布对G系列APU平台的支持期限将延长至2017年(比原来增加了5年),这样许多老用户在接下来的5年里也就不用担心啦。     

生成锁P〈G,X,X′〉和它的中央加密系统

利用数据生成技术,提出生成锁P〈G,X,X′〉的概念和由P〈G,X,X′〉构成的中央加密系统。这些系统是:生成锁P〈G,X,X′〉与单齿中央加密系统,生成锁P〈G,X,X′〉与多齿中央加密系统。给出单齿加密—解密算法,多齿加密—解密算法,多齿静态加密—解密算法,多齿动态加密—解密算法,中央加密系统的结构特性。研究指出:任意两个秘密通讯的双方A和B,它们各自选择无规则分布的正整数集合XA={x1,x2,…,xn},XB={x1,x2,…,xm},m,n≥4,XA≠XB,利用P〈G,X,X′〉完成双方之间的秘密通讯。研究结果表明,所提出的方法具有良好的应用性,安全性。     

Prefix-Rewriting on Context-Free Groups

 A class of groups that has received much attention is the class of context-free groups. This class of groups can be characterized algebraically as well as through some language-theoretical properties as well as through certain combinatorial properties of presentations. Here we use the fact that a finitely generated group is context-free if and only if it admits a finite complete presentation of a certain form that we call a virtually free presentation. It is known that the generalized word problem for context-free groups is decidable. Here we show how prefix-rewriting systems can be used to solve this problem. In fact, we show that the Knuth-Bendix completion procedure always terminates when applied to prefix-rewriting systems on virtually free presentations of context-free groups. In addition, we present a specialized completion algorithm for prefix-rewriting systems on virtually free presentations which has polynomial-time complexity. Thus, the uniform generalized word problem for virtually free presentations of context-free groups is decidable in polynomial-time. Since finitely generated subgroups of context-free groups are again context-free, they admit presentations of the same form. We present a polynomial-time algorithm that, given a virtually free presentation of a context-free group G and a finite subset U of G as input, computes a virtually free presentation for the subgroup of G that is generated by U. Received: January 13, 1995; revised version: June 24, 1996     

Analysis of the performance of a wireless optical multi-input to multi-output communication system

We investigate robust optical wireless communication in a highly scattering propagation medium using multielement optical detector arrays. The communication setup consists of synchronized multiple transmitters that send information to a receiver array and an atmospheric propagation channel. The mathematical model that best describes this scenario is multi-input to multi-output communication through stochastic slow changing channels. In this model, signals from m transmitters are received by n receiver-detectors. The channel transfer function matrix is G, and its size is n x m. G(i,j) is the transfer function from transmitter i to detector j, and m > or = n. We adopt a quasi-stationary approach in which the channel time variation has a negligible effect on communication performance over a burst. The G matrix is calculated on the basis of the optical transfer function of the atmospheric channel (composed of aerosol and turbulence elements) and the receiver's optics. In this work we derive a performance model using environmental data, such as documented turbulence and aerosol models and noise statistics. We also present the results of simulations conducted for the proposed detection algorithm.     

Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets

To overcome the limitations of context-free and context-sensitive grammars, regulated grammars have been proposed. In this paper, an algorithm is proposed for the recognition of faulty strings in regulated grammar. Furthermore, depending on the errors and certainty, it is decided whether the string belongs to the language or not based on string membership value. The time complexity of the proposed algorithm is O(|G _R ² |·|w|), where |G_R| represents the number of production rules and |w| is the length of the input string, w. The reader is provided with numerical examples by applying the algorithm to regularly controlled and matrix grammar. Finally, the proposed algorithm is applied in the Hindi language for the recognition of faulty strings in regulated grammar as a real-life application.     

A comprehensive two-dimensional retention time alignment algorithm to enhance chemometric analysis of comprehensive two-dimensional separation data

A comprehensive two-dimensional (2D) retention time alignment algorithm was developed using a novel indexing scheme. The algorithm is termed comprehensive because it functions to correct the entire chromatogram in both dimensions and it preserves the separation information in both dimensions. Although the algorithm is demonstrated by correcting comprehensive two-dimensional gas chromatography (GC x GC) data, the algorithm is designed to correct shifting in all forms of 2D separations, such as LC x LC, LC x CE, CE x CE, and LC x GC. This 2D alignment algorithm was applied to three different data sets composed of replicate GC x GC separations of (1) three 22-component control mixtures, (2) three gasoline samples, and (3) three diesel samples. The three data sets were collected using slightly different temperature or pressure programs to engender significant retention time shifting in the raw data and then demonstrate subsequent corrections of that shifting upon comprehensive 2D alignment of the data sets. Thirty 12-min GC x GC separations from three 22-component control mixtures were used to evaluate the 2D alignment performance (10 runs/mixture). The average standard deviation of first column retention time improved 5-fold from 0.020 min (before alignment) to 0.004 min (after alignment). Concurrently, the average standard deviation of second column retention time improved 4-fold from 3.5 ms (before alignment) to 0.8 ms (after alignment). Alignment of the 30 control mixture chromatograms took 20 min. The quantitative integrity of the GC x GC data following 2D alignment was also investigated. The mean integrated signal was determined for all components in the three 22-component mixtures for all 30 replicates. The average percent difference in the integrated signal for each component before and after alignment was 2.6%. Singular value decomposition (SVD) was applied to the 22-component control mixture data before and after alignment to show the restoration of trilinearity to the data, since trilinearity benefits chemometric analysis. By applying comprehensive 2D retention time alignment to all three data sets (control mixtures, gasoline samples, and diesel samples), classification by principal component analysis (PCA) substantially improved, resulting in 100% accurate scores clustering.     

Solution for the nonuniformity correction of infrared focal plane arrays

Based on the S-curve model of the detector response of infrared focal plan arrays (IRFPAs), an improved two-point correction algorithm is presented. The algorithm first transforms the nonlinear image data into linear data and then uses the normal two-point algorithm to correct the linear data. The algorithm can effectively overcome the influence of nonlinearity of the detector's response, and it enlarges the correction precision and the dynamic range of the response. A real-time imaging-signal-processing system for IRFPAs that is based on a digital signal processor and field-programmable gate arrays is also presented. The nonuniformity correction capability of the presented solution is validated by experimental imaging procedures of a 128 x 128 pixel IRFPA camera prototype.     

Submatrix Constrained Inverse Eigenvalue Problem involving Generalised Centrohermitian Matrices in Vibrating Structural Model Correction

Generalised centrohermitian and skew-centrohermitian matrices arise in a variety of applications in different fields. Based on the vibrating structure equation $M$$\ddot{x}$+$(D+G)$$\dot{x}$+$Kx$=$f(t)$ where $M$, $D$, $G$, $K$ are given matrices with appropriate sizes and x is a column vector, we design a new vibrating structure mode. This mode can be discretised as the left and right inverse eigenvalue problem of a certain structured matrix. When the structured matrix is generalised centrohermitian, we discuss its left and right inverse eigenvalue problem with a submatrix constraint, and then get necessary and sufficient conditions such that the problem is solvable. A general representation of the solutions is presented, and an analytical expression for the solution of the optimal approximation problem in the Frobenius norm is obtained. Finally, the corresponding algorithm to compute the unique optimal approximate solution is presented, and we provide an illustrative numerical example.     

Synthesis of the measurement system on the machine tool

The design methodology of a 2½-dimensional measurement and inspection system realized on a machine tool using a touch trigger probe and measuring G codes is studied in this paper. The reliability of measuring results, the agility of measurement, and user friendliness are synthesized in the design process. Algorithms for calibration and compensation of measuring errors are proposed to ensure the measuring accuracy by using a laser interferometer and ring gauges. Classification of probing feedrates and a collision-check algorithm can reduce measuring time and implement stylus-fracture-free measurements. To improve the previous onmachine measurement processes, all functions required for measurement and inspection processes are constructed as measuring G codes with similar forms of machining G codes. The interactive measuring program generating tool, which can automatically generate measuring G codes, is developed and potted in a ROM of a CNC, and can be called to perform an operation by the CNC without interfacing with personal computers. The validity and effectiveness of the developed system are verified on a horizontal machining centre with a Fanuc 15MA.     

Shock compaction of cubic boron nitride powders

C-BN powders with different grain sizes were dynamically compacted by explosive shock loading using approximate peak pressures from 33 to 77G Pa. The density and the microhardness of the resulting c-BN compacts were strongly dependent upon the grain size of the c-BN powders used as the starting materials. The best c-BN compacts, with 98% of the theoretical density and microhardness of 51.3G Pa, were obtained from the coarse c-BN powder (40 to 60m). In the compacted fine c-BN powder (2 to 4m) conversion of the c-BN to low density forms of BN at a residual temperature degraded the interparticle bonding significantly. X-ray line-broadening analysis of the compacted c-BN powders indicated that the residual lattice strain increased with the increase in grain size of the starting powder, while the crystallite size was independent of the grain size.