基于B/S的双CCD相机精度靶测控系统软件架构设计

上位机软件是双CCD相机精度靶测控系统中非常重要的一部分;针对精度靶测控系统软件存在后期功能拓展难、维护效率低、使用升级复杂等问题;先进行了对该类软件的调查研究,然后分析上位机测控软件功能需求,根据软件的需求分析,设计了一种基于B/S架构的精度靶测控系统上位机软件实现方案;软件架构采用了浏览器和服务器方式专有的三层结构,在中间层设计了TCP服务器,提高软件的功能拓展性,降低了实现代码的耦合性;采用了Netty通信技术框架及其非阻塞技术实现了TCP服务器底层,设计了专有的解码方法接收下位机数据及发送控制指令;通过模拟测试,能够满足下位机频繁发送数据,上位机稳定接收和可靠运行的功能需求,软件的结构设计合理,扩展性和维护性良好。     

基于AOP的Web系统事务管理的应用研究

面向方面的程序设计（Aspect—Oriented Programming,AOP）是在继承OOP基础之上进行改进而来的一种创新的软件设计方法,通过引入方面概念,将应用程序中的核心业务逻辑同其提供支持的通用服务分离开来,从而降低代码之间的耦合度,增加程序的灵活性和可重用性。通过简介AOP在事务处理中的应用,介绍了Spring框架和AOP相结合的事务处理方法。通过采用Spring的AOP框架,使系统的核心业务逻辑和事务管理逻辑分开,从而系统的藕合性大大降低且易于扩展,面向方面编程提高了系统的模块性。     

面向对象软件多态交互的测试

在面向对象软件测试领域,合理选择测试用例集合,覆盖复杂的多态交互情形,一直是软件测试研究的热点。该文基于pair-wise测试理论,提出一种选择测试用例的贪心算法,该算法可以有效地筛选测试用例,提高测试效率,降低测试成本。并介绍了在多态交互的单元测试框架中使用装饰型设计模式,有效地提高了测试代码的效率。     

Artistic QR Code Embellishment

A QR code is a two‐dimensional barcode that encodes information. A standard QR code contains only regular black and white squares, and thus is unattractive. This paper proposes a novel framework for embellishing a standard QR code, to make it both attractive and recognizable by any human while maintaining its scanability. The proposed method is inspired by artistic methods. A QR code is typically embellished by stylizing the squares and embedding images into it. In the proposed framework, the regular squares are reshaped using a binary examplar, to make their local appearances resemble the example shape. Additionally, an error‐aware warping technique for deforming the embedded image is proposed; it minimizes the error in the QR code that is generated by the embedding of the image to optimize the readability of the code. The proposed algorithm yields lower data error than previous global transformation techniques because the warping can locally deform the embedded image to conform to the squares that surround it. The proposed framework was examined by using it to embellish an extensive set of QR codes and to test the readability with various commercial QR code readers.     

Parallelizing implicit algorithms for time-dependent problems by parabolic domain decomposition

Applications of the multidomain Local Fourier Basis method [1], for the solution of PDEs on parallel computers are described. The present approach utilizes, in an explicit way, the rapid (exponential) decay of the fundamental solutions of elliptic operators resulting from semi-implicit discretizations of parabolic time-dependent problems. As a result, the global matching relations for the elemental solutions are decoupled into local interactions between pairs of solutions in neighboring domains. Such interactions require only local communications between processors with short communication links. Thus the present algorithm overcomes the global coupling, inherent both in the use of the spectral Fourier method and implicit time discretization scheme.This research is supported partly by a grant from the French-Israeli Binational Foundation for 1991–1992.     

Nonlinear Dimensionality Reduction with Local Spline Embedding

This paper presents a new algorithm for Nonlinear Dimensionality Reduction (NLDR). Our algorithm is developed under the conceptual framework of compatible mapping. Each such mapping is a compound of a tangent space projection and a group of splines. Tangent space projection is estimated at each data point on the manifold, through which the data point itself and its neighbors are represented in tangent space with local coordinates. Splines are then constructed to guarantee that each of the local coordinates can be mapped to its own single global coordinate with respect to the underlying manifold. Thus, the compatibility between local alignments is ensured. In such a work setting, we develop an optimization framework based on reconstruction error analysis, which can yield a global optimum. The proposed algorithm is also extended to embed out of samples via spline interpolation. Experiments on toy data sets and real-world data sets illustrate the validity of our method.     

Technologies for ubiquitous supercomputing: a Java interface to the Nexus communication system

We use the term ubiquitous supercomputing to refer to systems that integrate low- and mid-range computing systems, advanced networks and remote high-end computers with the goal of enhancing the computational power accessible from local environments. Such systems promise to enable new applications in areas as diverse as smart instruments and collaborative environments. However, they also demand tools for transporting code between computers and for establishing flexible, dynamic communication structures. In this article, we propose that these requirements be satisfied by introducing Java classes that implement the global pointer and remote service request mechanisms defined by a communication library called Nexus. Java supports transportable code; Nexus provides communication support and represents the core communication framework for Globus, a project building infrastructure for ubiquitous supercomputing. We explain how this NexusJava library is implemented and illustrate its use with examples. © 1997 John Wiley & Sons, Ltd.     

Methods and software tools to support combined binary code analysis

Methods and tools for binary code analysis developed in the Institute of System Programming, Russian Academy of Sciences, and their applications in algorithm and data format recovery are considered. The executable code of various general-purpose CPU architectures is analyzed. The analysis is performed given no source codes, debugging information, and specific OS version requirements. The approach implies collecting a detailed machine instruction level execution trace; a method for successively increasing presentation level; extraction of algorithm’s code followed by structuring of both code and data formats it processes. Important results are obtained, viz. an intermediate representation is developed that allows carrying out most preliminary processing tasks and algorithm code extraction without having to focus on specifics of a given machine; and a method and software tool are developed for automated recovery of network message and file formats. The tools are integrated into the unified analysis platform that supports their combined use. The architecture behind the platform is also described. Examples of its application to real programs are given.     

Resource management for multimedia applications,distributed in open and heterogeneous home networks

The home network is an open, heterogeneous and distributed environment with quality of service requirement. Existing resource reservation strategies modify devices and applications and do not consider heterogeneity.This paper presents a non-intrusive and adaptable resource management framework, developed upon an architecture customized for the actual devices. It uses global components, delegating to local components the management of local resources. These components rely on the resource reservation mechanisms provided by Linux.The framework has been implemented on real devices. The evaluations show that reservations are guaranteed even with noise on the resources, which also guarantees the expected quality of service.     

面向星载计算机的双重索引数据压缩方法

随着星载计算机系统功能的日益复杂,程序规模也在快速扩大.在存储资源极其受限的背景下,需要稳定、有效的代码压缩功能来保障星载软件的正常存储与运行.混合压缩算法是目前无损数据压缩的主流算法,具有压缩率高、代码规模和计算资源需求大的特点.然而,在航天星载计算机等嵌入式系统中,由于其运行环境特殊,需要较高的可靠性和抗干扰能力,无法实现混合压缩算法应有的效果.同时,单一压缩模型压缩率较低.针对以上问题,在LZ77算法代码体积和内存消耗优势的基础上提出了改进方法:为压缩过程设计一种新的匹配记录表以存储高价值数据索引来辅助压缩,实现了原算法局部性优势与高价值数据全局分布的互补,更大程度上减少了数据冗余;结合动态填充、变长编码等进一步优化编码结构,降低存储需求;最终,设计并实现了一种更加适合航天嵌入式环境的无损数据压缩算法(LZRC).实验结果表明:(1)新算法在比LZ77算法代码体积仅多出3.5 KB的条件下,对软件代码的平均压缩比提高了17%;(2)新算法的运行内存需求仅为混合压缩算法的12%,代码体积也减少了84%,更加适合星载计算机系统.     

Tackling Complexity in High Performance Computing Applications

We present a software framework that supports the specification of user-definable configuration options in HPC applications independently of the application code itself. Such options include model parameter values, the selection of numerical algorithm, target platform etc. and additional constraints that prevent invalid combinations of options from being made. Such constraints, which are capable of describing complex cross-domain dependencies, are often crucial to the correct functioning of the application and are typically either completely absent from the code or a hard to recover from it. The framework uses a combination of functional workflows and constraint solvers. Application workflows are built from a combination of functional components: higher-order co-ordination forms and first-order data processing components which can be either concrete or abstract, i.e. without a specified implementation at the outset. A repository provides alternative implementations for these abstract components. A constraint solver, written in Prolog, guides a user in making valid choices of parameters, implementations, machines etc. for any given context. Partial designs can be stored and shared providing a systematic means of handling application use and maintenance. We describe our methodology and illustrate its application in two classes of application: a data intensive commercial video transcoding example and a numerically intensive incompressible Navier–Stokes solver.     

A Pattern-Based Framework for Software Anomaly Detection

This paper presents a pattern-based framework for developing tool support to detect software anomalies. The use of a pattern-based approach is important because it provides the flexibility needed to address domain-specific needs, with respect to the types of problems the tools detect and the strategies used to inspect and adapt the code. Patterns can be used to detect a variety of problems, ranging from simple syntactic issues to difficult semantic problems requiring global analysis. Patterns can also be used to describe transformations of the software, used to rectify problems detected through software inspection, and to support interactive inspection and adaptation when full automation is impractical. This paper describes a part of the Knowledge Centric Software (KCS) framework that embodies the pattern-based approach and provides capabilities for addressing different languages and different application domains. While only the part of the framework relevant to code inspections is addressed in this paper, in future, we also expect to address UML analysis and design models. As an application of the research, we present an overview of an inspection tool being developed for high assurance software for avionics systems.     

Programming with C++ concepts

This paper explores the definition, applications, and limitations of concepts and concept maps in C++, with a focus on library composition. We also compare and contrast concepts to adaptation mechanisms in other languages.Efficient, non-intrusive adaptation mechanisms are essential when adapting data structures to a library’s API. Development with reusable components is a widely practiced method of building software. Components vary in form, ranging from source code to non-modifiable binary libraries. The Concepts language features, slated to appear in the next version of C++, have been designed with such compositions in mind, promising an improved ability to create generic, non-intrusive, efficient, and identity-preserving adapters.We report on two cases of data structure adaptation between different libraries, and illustrate best practices and idioms. First, we adapt GUI widgets from several libraries, with differing APIs, for use with a generic layout engine. We further develop this example to describe the run-time concept idiom, extending the applicability of concepts to domains where run-time polymorphism is required. Second, we compose an image processing library and a graph algorithm library, by making use of a transparent adaptation layer, enabling the efficient application of graph algorithms to the image processing domain. We use the adaptation layer to realize a few key algorithms, and report little or no performance degradation.     

基于WPF心理检测系统的设计与实现

通过微软最新推出的用户界面框架WPF平台和数据库技术设计开发了一套心理检测系统。该系统首先搭建了由菜单栏、工具栏和导航栏三部分组成的心理检测软件的界面框架,进而使用XAML标记语言实现用户界面设计代码与程序逻辑代码的分离;结合类的创建和数据绑定方法实现了软件功能的定制,提高了数据的存储及管理效率;最后,简要介绍了系统开发中的一些关键技术,即通过AES加密算法实现MySql数据库和Sql Server数据库之间的数据共享,保证了数据传输过程中的安全性和可靠性,以及通过事务实现了数据存储的完整性,并给出了部分实现代码。结果表明,基于WPF编程技术不仅能提高系统的交互性、降低模块间的耦合性,还能使软件界面具有统一的风格样式,增强了界面的渲染效果,提高了系统的开发效率。该系统界面友好,功能丰富,可以跨平台使用。     

基于多样信息素的蚁群算法

根据蚁群算法信息素更新的特性,提出了求解旅行商问题的多样信息素的蚁群算法。把蚁群的三种不同的信息素更新方式混合在一起,既利用了局部信息,又考虑了整体信息,将局部搜索和全局搜索相结合,使收敛性得到提高。针对旅行商问题的仿真实验结果,表明了该混合算法的有效性。     

基于逻辑回归的多任务域快速分类学习算法

多任务学习通过寻找并共享不同任务域之间的共性特征来完成学习,利用知识迁移加速不同任务域的学习为每个任务域构建一个分类器。提出了一种基于罗杰斯特回归模型的多任务学习方法MTC-LR（Multi-task Coupled Logistic Regression）。“罗杰斯特回归模型”已经被成功应用于单任务分类器上,该模型被众多实验证明是有效的,正是这种方法给人们带来了启示。从理论上证明了通过构造多任务分类器的“开销函数”和“差异性度量函数”,MTC-LR算法可以提高多任务分类器的各自分类精度。相比传统的基于SVM的多任务学习方法,MTC-LR并不依赖于核方法而是通过共轭梯度下降法寻找各个分类器的最优参数。同时MTC-LR与采用“罗杰斯特回归模型”的快速算法CDdual更容易结合,可扩展至大样本的多任务分类学习。正是基于上述发现,为了充分高效利用大样本的多任务域数据,满足大样本的快速运算,在MTC-LR算法的基础上,结合最新的CDdual（The Dual Coordinate Descent Method）算法,提出了MTC-LR的快速算法MTC-LR-CDdual,并对该算法进行了相关的理论分析。将该算法在人工数据集和真实数据集上进行了验证,实验结果表明该算法有着较高的识别率、快速的识别速度和较好的鲁棒性。     

基于Memetic框架和改进DFP局部搜索的改进差分进化算法

为提高差分进化(DE)算法对性连续优化问题的求解能力、增强算法的适应性,提出了一种基于局部快速收敛算法的Memetic进化算法。改进了Davidon-Fletcher-Powell方法,得到了具有强搜索能力的局部搜索算法——NDFP。当进化过程中出现具有优秀特质的个体时,NDFP可以使该个体沿着局部最优解的方向快速进化。为综合NDFP和DE的优势,提出局部搜索的执行策略来平衡全局搜索和局部搜索的关系,使得NDFP对DE的优化具有更为广泛的适应性。在CEC2005和CEC2013 Benchmark的53个测试函数上的实验结果表明,同DE/current-to-best/1、SaDE和EPSDE算法相比,NDFP-DE进化算法具有更高的求解精度和稳定性。     

基于.NET分布式系统的模式研究

在分布式系统设计中,针对B/S和C/S架构在实际应用中的不足,提出了基于.NET框架N层架构模式.根据N层体系架构的特性,利用设计模式,针对数据访问层提出了服务提供者模式.该模式是一种能提高软件扩展性的设计模式,它的特性在于可以不必更改核心代码而改变核心功能.最后利用.NET反射技术结合工厂方法,通过实现模式得以实现,使其在数据访问方面具备了更好的扩展性.     

基于探测目标的自适应航路规划算法产品化实现方法

为将基于探测目标的自适应航路规划算法进行产品化,采用基于模型的设计方法以及自动代码生成技术,使算法模型快速、健壮地转化为软件产品。软件产品由核心算法和外设驱动组成,核心算法采用基于模型设计思想进行设计,仿真验证后自动生成目标语言代码,考虑到IO访问方式的复杂性,外设驱动模块采用代码自动生成与手动编码相结合的方式实现,核心代码与外设驱动模块组成的完整工程下载到硬件板卡,通过试验验证软件产品与初始设计模型的一致性,实现算法的产品化。经过实践,所提出的算法产品化实现方法能够提高设算法设计效率和各阶段中间产品继承性,降低各阶段调试复杂性,实现产品开发的敏捷性和健壮性,可作为复杂算法工程实现的参考。