Dependence analysis for UML class diagrams

Though Unified Modeling Language (UML) has been widely used in software development, the major problems confronted lie in comprehension and testing. Dependence analysis is an important approach to analyze, understand, test and maintain programs. A new kind of dependence analysis method for UML class diagrams is developed. A set of dependence relations is definedcorresponding to the relations among classes. Thus, the dependence graph of UML class diagram can be constructed from these dependence relations. Based on this model, both slicing and measurement coupling are further given as its two applications.     

基于UML状态图的类状态测试

在介绍UML状态图的基础上,以面向对象软件的类作为基本测试单元,研究了基于UML状态图的类状态测试技术,并在Eclipse平台上结合Java工具用手工选择测试数据进行了实例测试.     

基于超网络理论的军事通信网络复杂性度量方法

针对军事通信网络的结构和功能特点,在建立军事通信超网络描述模型的基础上,定义了超网络邻接矩阵、节点分类连接矩阵、类型匹配指数、超网络模体、模体核和模体熵等概念;通过分析超网络模体的特点,提出使用超网络模体熵来度量网络复杂性,给出了具体的计算方法;最后以某舰艇编队通信网络为例,对比分析了已有网络结构复杂性指标和超网络模体熵所度量的网络特征,说明在网络结构确定的情况下,超网络模体熵可以度量网络的功能复杂性.     

二元周期序列的线性复杂率与k-错复杂度的关系

k-错复杂度是指改变序列一个周期段中k个或少于k个符号后所得序列的最小线性复杂度。该文讨论了周期为2~pq(q为奇素数,2是模q~2的本原根)的二元序列线性复杂度与k的关系,这里k是满足LC_k(S~N)相似文献   

Measuring web page complexity by analyzing TCP flows and HTTP headers

To understand website complexity deeply, a web page complexity measurement system is developed. The system measures the complexity of a web page at two levels: transport-level and content-level, using a packet trace-based approach rather than server or client logs. Packet traces surpass others in the amount of information contained. Quantitative analyses show that different categories of web pages have different complexity characteristics. Experimental results show that a news web page usually loads much more elements at more accessing levels from much more web servers within diverse administrative domains over much more concurrent transmission control protocol (TCP) flows. About more than half of education pages each only involve a few logical servers, where most of elements of a web page are fetched only from one or two logical servers. The number of content types for web game traffic after login is usually least. The system can help web page designers to design more efficient web pages, and help researchers or Internet users to know communication details.     

Low complexity codebook search method in massive MIMO system

In Massive MIMO systems for 5G networks,precoding technology is one of the key technologies.Aiming at user side codebook search method of the discrete Fourier transform (DFT) rotation codebook,a low complexity search algorithm was proposed.In this algorithm,all horizontal and vertical codebooks were grouped separately according to the characteristics that the precoding vectors with the same column of DFT rotation codebooks had the smallest chordal distance and the smaller chordal distance have the stronger correlation,and then the optimal horizontal and vertical codewords with maximum channel gain were obtained to form 3D precoding code-books.The simulation results indicate that the searching complexity of the proposed method is significantly reduced under conditions of insuring the system performance,moreover,this advantage becomes greater with the number of antennas increasing.     

Synthesis of optical circuits using binary decision diagrams

The advances in silicon photonics motivated the consideration of optical circuits as a new and emerging circuit technology. In particular for ultra-fast interconnects, optical circuits may provide a suitable alternative since it avoids the conversion of signals from the optical to the electrical domain. Accordingly, design automation of this kind of circuits received significant attention. In this work, we consider synthesis of optical circuits based on Binary Decision Diagrams (BDDs). Although BDDs allow for a direct mapping of the function representation to an optical circuit (and, hence, a scalable synthesis), they have their shortcomings with respect to dedicated cost metrics. In this work, we investigate this issue and provide an overview of the BDD-based synthesis schemes which are available thus far. Afterwards, we propose new solutions based on a dedicated BDD optimization which aim for addressing the known shortcomings. Experimental results confirm the benefits of the proposed approach.     

基于实时UML的雷达软件设计

实时统一建模语言（UML）和面向对象的建模技术代表着雷达软件设计的一个发展方向。文中介绍了使用UML的用例图、状态图、顺序图等进行系统分析、设计、实现和测试，并讨论了如何选择UML工具与实时框架以及实时性分析等问题。     

给定线性复杂度谱的序列的条数

对给定长为n的单调递增非负整数序列(L1,L2,…,Ln),给出了有限域GF(q)上长度为n的线性复杂度谱为(L1,L2,…,Ln)的序列的计数。进一步对长为n的给定线性复杂度及其最大跳跃幅度的序列进行了计数。     

pmqn周期q元序列线性复杂度与k错复杂度的关系

研究了q元周期序列线性复杂度和k错复杂度之间的关系,给出了k错复杂度严格小于线性复杂度的一个充要条件.当周期为N=pqn时,给出了使得LC(S+E)＜LC(S)成立的错误多项式EN(x)的确切表达式,以及使得LCk(S)＜LC(S)成立的最小的k值,即minerror(S)的值,结果表明minerror(S)与线性复杂度的重量密切相关;当周期为N=pmqn时,给出了使得LC(S+E)＜LC(S)成立的用错误多项式EN(x)表达的一个充分条件.这里P为奇素数,q是素数且是一个模p2的本原根.     

序列k-错线性复杂度算法

本文给出了一个测量流密码序列稳定性的重要指标Ｋ－错线性复杂度的算法,即求ＧＦ（ｑ）上（ｑ＝ｐ＾ｍ,ｐ：素数）周期为Ｎ＝ｐ＾ｎ序列的Ｋ－错线性复杂度的快速算法。在这里对广义ＧａｍｅｓＣｈａｎ算法－ＧＦ（ｑ）上ｐ＾ｎ序列线性复杂度算法进行了简化,并给出了ＧＦ（ｑ）上ｐ＾ｎ序列Ｋ－错线性复杂度算法及其证明。     

单圈 T-函数的 2-adic 复杂度和 1-错 2-adic 复杂度

研究了由 上单圈T-函数所导出权位序列的2-adic复杂度,设 为整数, 。结论表明,第 权位序列2-adic复杂度的上界为 。另外,讨论了与所有单圈 T-函数所导出第 权位序列相对应的2-adic整数的分布,分布情况说明这个上界是可以达到的。最后,研究了权位序列的1-错2-adic复杂度。研究结果表明对所有 ,权位序列 的1-错2-adic 复杂度都与其2-adic复杂度相同。     

Computing the k-error joint linear complexity of binary periodic multisequences

Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.     

一种用于降低版图复杂度的新的反向光刻算法

随着光刻系统被驱动用来生产65nm以下的器件时,反向光刻技术（ILT）的应用前景变得越来越广阔。不过,采用反向光刻技术得到的版图通常很难制造,限制了反向光刻技术的使用领域。在这篇文章里提出了一个新的复杂度惩罚项,文章里面称为全局小波惩罚项。通过在版图上进行了四个独特的小波变换,之后选择了一个版图高频成分含量最高的方向作为优化的小波变换方向,全局小波惩罚项对于版图的高频分量能进行更加深入的分析。在这之后,文章中提出了一个新的基于梯度法的反向光刻算法,新算法里面通过将全局小波惩罚项作为它的第一阶段复杂度惩罚项,能更好的降低版图复杂度。实验证明,基于90nm的光学条件和三个典型的65nm的flash阵列版图,相比于采用文章中称为局部小波惩罚项作为复杂度惩罚项的梯度算法,新算法得到的三个版图结果,总的顶点数目分别下降了12.89%,12.63%和12.64%,与此同时精确度保持在同一个水平上。     

Computation of the complexity of vector quantizers by affine modeling

Several methods for evaluation of the complexity of data compression systems and for including complexity measures in the traditional rate-distortion analysis have been published in recent works. In this work, we indicate that the relationship between rate-distortion performance and complexity for some practical coding schemes—entropy-constrained vector quantization (ECVQ) and interpolative vector quantization (IVQ)—can be represented by affine models. For the same rate-distortion performance, the complexity of an interpolative vector quantizer is known to be significantly smaller than the complexity of a full-search entropy constrained vector quantizer, and this complexity difference is a suitable illustration for the rate-distortion-complexity framework. We use high-resolution theory arguments to derive the affine models for ECVQ and IVQ. The proposed affine complexity modeling successfully predicts the cost of vector quantizers designed from data sets that were not used to generate the models.     

2-adic complexity of SLCE sequence

Aiming at the 2-adic complexity of Sidelnikov-Lempel-Cohn-Eastman sequences,autocorrelation function value of this kind of sequence was obtained by using the cyclotomic number.Based on the relationship between 2-adic complexity and autocorrelation function,properties of 2-adic complexity value were analyzed.According to the greatest common divisor between the autocorrelation function value and the period of SLCE sequence,the condition that the 2-adic complexity of a SLCE sequence reaches its maximum value was given.The results show that 2-adic complexity of SLCE sequence on many finite field can reach the maximum value.     

Linear complexity of quaternary sequences with odd period and low autocorrelation

Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.     

Solution chemical constraints in the chemical-mechanical polishing of copper: Aqueous stability diagrams for the Cu-H2O and Cu-NH3-H2O systems

A general graphical approach to the solution chemistry of chemical mechanical polishing is presented with the aid of a variety of aqueous stability diagrams, such as Eh-pH (Pourbaix), log Metal-pH, and log Ligand-pH diagrams. The common thermodynamic origin of these diagrams is highlighted. The important role played by concentration gradients in effecting chemical mechanical polishing is stressed and illustrated with the aid of stability diagrams generated for the Cu-H₂O and Cu-NH₃-H₂O model systems. It is demonstrated that chemical mechanical polishing is feasible when the following two conditions are satisfied simultaneously: (a) at the metal surface dissolved metal concentration is high and/or ligand concentration is low (this favors oxide film formation), and (b) in the bulk aqueous phase the metal concentration is low and/or the ligand concentration is high (this favors the dissolution of film fragments).     

On the communication complexity of zero-knowledge proofs

The fact that there are zero-knowledge proofs for all languages in NP (see [15], [6], and [5]) has, potentially, enormous implications to cryptography. For cryptographers, the issue is no longer “which languages in NP have zeroknowledge proofs” but rather “which languages in NP have practical zeroknowledge proofs.” Thus, the concrete complexity of zero-knowledge proofs for different languages must be established. In this paper we study the concrete complexity of the known general methods for constructing zero-knowledge proofs. We establish that circuit-based methods, which can be applied in either the GMR or the BCC model, have the potential of producing proofs which can be used in practice. Then we introduce several techniques which greatly reduce the concrete complexity of circuit-based proofs, and we show that these techniques lead to zero-knowledge proofs of knowledge. Finally, we show how to combine the techniques of Kilian, Micali, and Ostrovsky, for designing zero-knowledge proofs with only two envelopes, with some of our techniques for reducing the number of bits which the prover must commit to. Supported in part by NSA Grant No. MDA90488-H-2006. Supported in part by NSF Grant No. CCR-8909657.     

通信软件可维护性的一种计算方法

软件可维护性的量化和波动效应的示踪是软件维护工程中的两大难题，本文基于ＣＣＩＴＴ推荐的ＳＤＬ语言和关于波动效应分析理论的研究成果，构造了一个量化通信软件系统可维护性的计算模型，并实现了一个相应的自动工具。