通信对抗软件复杂度

本文着重介绍了软件复杂度的历史，现状及测试方法。特别提到了McCabe复杂度，Halstead复杂度，Line Count复杂度的原理、优点及应用。     

基于圈复杂度的软件测试方法研究

圈复杂度是一种代码复杂度的衡量标准。在软件测试中,圈复杂度可以用来衡量一个模块判定结构的复杂程度,数量上表现为独立路径条数,即合理的预防错误所需测试的最少路径条数。圈复杂度计算为软件流程测试用例的生成起到极大的辅助作用,并便于对软件质量进行度量。实践经验表明,圈复杂度与程序中存在的缺陷数量有着很大的相关性,本文就圈复杂度在实际项目中的应用进行了探讨。     

软件度量指标研究及实现

本文依照传统软件度量方法及面向对象软件度量方法,对代码行数、圈复杂度、类加权方法数这些度量指标的产生和发展进行分类研究。揭示了其适用范围、优缺点,以及计算方法,并通过伪代码实现。对理论研究进行了实践上的补充和改进。     

软件构件标准概述

阐述了软件构件技术及构件标准的发展情况,重点介绍了我国在软件构件标准制定方面的工作.     

软件无线电概述

软件无线电是最近几年提出的一种实现无线通信新的体系结构,其基本概念是把硬件作为无线通信的基本平台,而把尽可能多的无线及个人通信功能用软件实现。 作为一种新的无线通信概念和体制,软件无线电在国内外受到广泛重视。本文将介绍软件无线电的发展简史、研究机关、应用范围、技术难点。     

软件无线电台概述

本简要地叙述了软件无线电台的基本概念,通过对软件无线电台关键技术的分析,给出了现阶段实用的软件无线电台基本结构组成。由于软件无线电台具有许多传统无线电台所没有的优点,如操作使用灵活、对工作环境的适应能力强、升级换代快捷简便且成本低廉以及抗干扰性能好等,所以,在军事通信和民用通信领域特别是移动通信领域（包括蜂窝、个人和卫星）得到了越来越广泛的应用。     

手机协议软件概述

介绍了手机协议软件的结构及其各个模块提供的主要功能。     

On modification of the relative complexity metric

Software reliability and software complexity are closely related issues in software development. An elegant definition of relative complexity was proposed in [1,2]. The definition given in [1,2] needs modification. Depending on how many factor loadings are used in the factor analysis different complexity results are obtained. Hence the definition of relative complexity given in those papers is subjective. The object of this paper is to suggest a modified definition of relative complexity. Different measures based on the magnitude of the eigenvalues obtained from the correlation matrix are suggested in this paper. The relative complexity of 27 programs given in [3] has been calculated using different factor loadings.     

Software complexity: An aid to software maintainability

Recent estimates that 40–70% of software cost is being spent after the software has been tested and delivered by the development contractor, makes the area of post-delivery maintenance of software a prime candidate for major technological effort with potentially high return on investment. Maintenance is most affected by software complexity, and if complexities could somehow be identified, then maintenance procedures could be adjusted accordingly. What is needed is some method of pin-pointing the characteristics of a computer program that are difficult to maintain and measuring the degree of their presence (or lack of it). This paper discusses a number of software complexity metrics reported in the last few years and examines the applicability of these complexity metrics to form a software maintainability point of view.     

Software radio architecture with smart antennas: a tutorial onalgorithms and complexity

There has been considerable interest in using antenna arrays in wireless communication networks to increase the capacity and decrease the cochannel interference. Adaptive beamforming with smart antennas at the receiver increases the carrier-to-interference ratio (CIR) in a wireless link. This paper considers a wireless network with beamforming capabilities at the receiver which allows two or more transmitters to share the same channel to communicate with the base station. The concrete computational complexity and algorithm structure of a base station are considered in terms of a software radio system model, initially with an omnidirectional antenna. The software radio computational model is then expanded to characterize a network with smart antennas. The application of the software radio smart antenna is demonstrated through two examples. First, traffic improvement in a network with a smart antenna is considered, and the implementation of a hand-off algorithm in the software radio is presented. The blocking probabilities of the calls and total carried traffic in the system under different traffic policies are derived. The analytical and numerical results show that adaptive beamforming at the receiver reduces the probability of blocking and forced termination of the calls and increases the total carried traffic in the system. Then, a joint beamforming and power control algorithm is implemented in a software radio smart antenna in a CDMA network. This shows that, by using smart antennas, each user can transmit with much lower power, and therefore the system capacity increases significantly     

The similarity metric

A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new "normalized information distance," based on the noncomputable notion of Kolmogorov complexity, and show that it is in this class and it minorizes every computable distance in the class (that is, it is universal in that it discovers all computable similarities). We demonstrate that it is a metric and call it the similarity metric . This theory forms the foundation for a new practical tool. To evidence generality and robustness, we give two distinctive applications in widely divergent areas using standard compression programs like gzip and GenCompress. First, we compare whole mitochondrial genomes and infer their evolutionary history. This results in a first completely automatic computed whole mitochondrial phylogeny tree. Secondly, we fully automatically compute the language tree of 52 different languages.     

Bound for Minkowski metric or quadratic metric applied to VQcodeword search

A bound for a Minkowski metric based on L_p distortion measure is proposed and evaluated as a means to reduce the computation in vector quantisation. This bound provides a better criterion than the absolute error inequality (AEI) elimination rule on the Euclidean distortion measure. For the Minkowski metric of order n, this bound contributes the elimination criterion from the L₁ metric to L _n metric. This bound can also be an extended quadratic metric which can be a hidden Markov model (HMM) with a Gaussian mixture probability density function (PDF). In speech recognition, the HMM with the Gaussian mixture VQ codebook PDF has been shown to be a promising method     

A metric for ARMA processes

Autoregressive-moving-average (ARMA) models seek to express a system function of a discretely sampled process as a rational function in the z-domain. Treating an ARMA model as a complex rational function, we discuss a metric defined on the set of complex rational functions. We give a natural measure of the “distance” between two ARMA processes. The paper concentrates on the mathematics behind the problem and shows that the various algebraic structures endow the choice of metric with some interesting and remarkable properties, which we discuss. We suggest that the metric can be used in at least two circumstances: (i) in which we have signals arising from various models that are unknown (so we construct the distance matrix and perform cluster analysis) and (ii) where there are several possible models M_i, all of which are known, and we wish to find which of these is closest to an observed data sequence modeled as M     

Flash memory complexity

Driven by the demand for more versatile personal electronic devices such as cellular phones and handheld computers, flash memory has advanced rapidly to higher volume density and performance levels. Today, semiconductor manufacturers find a growing opportunity for more advanced flash memories delivered either as standalone flash devices; embedded as cores with logic in single-chip devices; or packaged as stacked dice with microcontrollers, logic, or static RAM. For flash manufacturers, however, success in these highly competitive markets requires tight control over the cost of test, despite rising device complexity. As flash memory grows in size, speed, and complexity, manufacturers are seeking more cost-effective, single-insertion test solutions capable of addressing resulting test challenges. With the development of new test architectures, manufacturers can more efficiently address emerging flash complexity using cost-effective, next-generation test platforms.