基于重构规则的企业应用系统影响分析方法

企业应用系统需进行频繁重构以响应变化，如何保证重构的完备性和正确性是重构工程中需要解决的一个关键问题。重构需求作用于业务模型，进而映射为相应软件系统的变化。该文给出了基于业务规则的业务元模型与重构元模型，并基于该模型简要地描述了应用系统的统一重构过程。随之对重构操作进行了分类，定义了重构规则的表达形式，并给出了基于重构规则的影响分析方法。最后给出了应用实例。     

基于压缩感知的遥感成像稀疏重构性能分析

压缩感知是一种新型的信息论，打破了传统的Shannon-Nyquist采样定理，能够以少量数据完成信号采样。稀疏重构是压缩感知由理论到实际的关键环节，为了将压缩感知有效地应用于遥感成像领域，研究了稀疏重构对遥感成像过程的影响。针对稀疏重构理论模型，分析了重构误差的成因；同时，针对典型的凸优化类算法和贪婪类算法，利用峰值信噪比指标对遥感图像重构误差进行评价。在仿真实验中，定量考察遥感图像在不同压缩采样率、不同重构算法下的稀疏重构性能。结果表明，稀疏重构算法能够成功重构遥感图像，各算法在不同压缩采样率下均表现出了较好的重构质量，整体上能够满足遥感成像应用，验证了压缩感知稀疏重构方法在遥感成像中应用的可行性。     

可重构密码协处理器简介及其特性

可重构密码协处理器是采用可重构体系结构的思想和方法设计而成的，用于对数据进行加／解密处理的集成电路芯片，它能够灵活、快速地实现多种不同的密码算法。文章简要介绍了可重构密码协处理器的设计方法和使用方法，并对其灵活性、安全性、性能和规模进行了分析。     

诊断多智能体重构过程的系统描

在引入可重构故障诊断系统及诊断智能体单元组概念的基础上，提出了可重构故障诊断系统的体系结构和应用系统模型，探讨了被诊断问题的特征以及被诊断问题之间的相似性，构建了基于决策理论的多智能体诊断系统的评价方法．在分析诊断智能体重构过程的基础上，研究了可重构故障诊断系统的重构类型、重构层次和重构步骤．借鉴生物免疫中的调节理论，提出了一种重建故障诊断智能体的算法．最后分别就智能体单元组（AFDS）的物理重构和逻辑重构两种形式进行了举例说明．     

基于小波网络和证据理论的多源信息融合系统研究

在多源信息融合中，不确定、不完整和冗余现象普遍存在。为了解决这个复杂问题，本文首先利用相空间重构理论对输入的信息在相空间中进行重构，以充分提取相关信息。然后在重构相空间上，利用模糊理论、小波网络和遗传算法对上述重构信息进行了时间域信息融合。最后，利用D—S证据理论将时间域融合结果进行了空间域信息融合，并根据决策规则进行了决策。结果表明．据此形成的分布式多源信息融合系统具有良好的目标探测能力、抗干扰能力和容错能力。     

构件化可重构制造执行系统研究与实现

从软件重用角度对可重构MES体系结构及相关构件复用技术进行了研究。给出了开放、可扩展的可重构MES平台软件框架及构件获取技术；建立了可重构制造执行系统平台的功能层次结构；并对系统进行了设计和软件实现。该系统己在实际企业生产管理中试运行，结果表明，它提供的功能模块符合企业实际生产需要，并解决了传统制造执行系统适应性和可重构性差等问题。     

声全息重构卷积计算中混迭问题的研究

分析了实空间离散格林函数的特点和平面声全息重构卷积计算的特殊性，推导了在重构条件下二维循环卷积与重构卷积的关系。理论上证明了在全息重构中将二维全息声压序列补零使其成为原序列长度的两倍，而二维格林函数序列无需进行补零处理仍可由二维离散傅氏变换准确地得到全息重构卷积结果，而不会产生循环卷积中的混迭现象，即不存在所谓的重构“卷绕”误差。同时还证明了实空间格林函数的取值不确定性不会影响重构结果，并通过仿真算例进行了验证。     

软件重构技术综述

本文在介绍重构概念的基础上,对重构形式、重构操作、源码重构、重构工具、模型重构等方面的研究现状和发展方向、以及重构相关的技术及其关系进行论述,最后对有待解决的问题进行了讨论。     

一种基于模板的面向方面重构框架的研究

面向方面编程是一种新的编程范型，而面向方面重构则是当前面向方面软件开发中的一个研究热点。首先对面向方面重构进行了分类研究，然后引入基于角色的横切关注点重构方法，最后在此基础上提出一种基于模版的面向方面重构框架。     

OpenGL在逆向工程三维重构中的应用研究

研究了在MFC中运用OpenGL进行编程，重构三维物体的方法，对于逆向工程三维重构的杂乱离散点云，在进行排序重组和三角网格化后，运用OpenGL对三角网格进行消隐，设定法线，光照和材质的处理，重构原始物体，具体的应用实例说明了所提方法的有效性。     

面向并发的C＋＋程序重构模式研究

在多核时代,为了发挥多核处理器最大性能,软件维护人员的一个重要任务是对代码进行面向并发重构,即将顺序代码重构为并发代码和将并发代码重构更优为并发代码。针对C＋＋语言的三种并发设施：POSIX Pthread、Open MP、C＋＋0x并发库,详细阐述了C＋＋面向并发重构的三类重构模式,以及每种模式的重构方法。     

一种基于横切特征分析的软件体系结构自动重构方法

软件体系结构中的横切关注点增加了软件体系结构的复杂性,从而加剧了体系结构演化与维护的困难.这种设计问题可以通过体系结构层面的重构来进行改善.在已有的横切特征分析方法基础上,提出了一种面向横切特征分析的体系结构自动重构方法.该方法首先基于特征与构件之间的追踪关系分析横切特征,然后将与横切特征有直接追踪关系的构件从初始体系结构中提取出来,实现方面构件,完成体系结构重构.在面向方面体系结构描述语言AO-ADL基础上开发了相应的体系结构重构工具,并针对一个业务系统进行了体系结构重构实验.实验结果表明,该方法能有效地实现体系结构横切特征的自动化重构.     

基于面向对象技术重构遗留系统

针对目前正在运行中的部分遗留系统,通过面向对象的分析和设计方法,将其由面向过程的设计和实现重构改造成面向对象的实现,运用POSIX线程模式来取代遗留系统中的进程模式,以提升系统的功能、性能以及系统的可维护性,节省研发和维护成本。     

Analysing refactoring dependencies using graph transformation

Refactoring is a widely accepted technique to improve the structure of object-oriented software. Nevertheless, existing tool support remains restricted to automatically applying refactoring transformations. Deciding what to refactor and which refactoring to apply still remains a difficult manual process, due to the many dependencies and interrelationships between relevant refactorings. In this paper, we represent refactorings as graph transformations, and we propose the technique of critical pair analysis to detect the implicit dependencies between refactorings. The results of this analysis can help the developer to make an informed decision of which refactoring is most suitable in a given context and why. We report on several experiments we carried out in the AGG graph transformation tool to support our claims.     

Refactoring software packages via community detection in complex software networks

An intrinsic property of software in a real-world environment is its need to evolve, which is usually accompanied by the increase of software complexity and deterioration of software quality, making software maintenance a tough problem. Refactoring is regarded as an effective way to address this problem. Many refactoring approaches at the method and class level have been proposed. But the research on software refactoring at the package level is very little. This paper presents a novel approach to refactor the package structures of object oriented software. It uses software networks to represent classes and their dependencies. It proposes a constrained community detection algorithm to obtain the optimized community structures in software networks, which also correspond to the optimized package structures. And it finally provides a list of classes as refactoring candidates by comparing the optimized package structures with the real package structures. The empirical evaluation of the proposed approach has been performed in two open source Java projects, and the benefits of our approach are illustrated in comparison with the other three approaches.     

Refactoring reusable business components

Object evangelists have long heralded software reuse as a bonus for applying object-oriented analysis, design, and programming techniques, but the benefits have been less dramatic than anticipated. Designing reusable software systems is difficult because a complete understanding of the software under consideration is only available toward the project's end. An appropriate alternative, then, is to refactor for reuse, restructure the completed system without modifying or adding to its behavior. We describe a refactoring effort undertaken at a Delaware-Valley-based financial firm. This firm sought to reuse components from a large Web-based system.     

Using model transformation to refactor use case models based on antipatterns

Use Case modeling is a popular technique for documenting functional requirements of software systems. Refactoring is the process of enhancing the structure of a software artifact without changing its intended behavior. Refactoring, which was first introduced for source code, has been extended for use case models. Antipatterns are low quality solutions to commonly occurring design problems. The presence of antipatterns in a use case model is likely to propagate defects to other software artifacts. Therefore, detection and refactoring of antipatterns in use case models is crucial for ensuring the overall quality of a software system. Model transformation can greatly ease several software development activities including model refactoring. In this paper, a model transformation approach is proposed for improving the quality of use case models. Model transformations which can detect antipattern instances in a given use case model, and refactor them appropriately are defined and implemented. The practicability of the approach is demonstrated by applying it on a case study that pertains to biodiversity database system. The results show that model transformations can efficiently improve quality of use case models by saving time and effort.     

Supporting asynchronization in OpenMP for event-driven programming

The event-driven programming pattern is pervasive in a wide range of modern software applications. Unfortunately, it is not easy to achieve good performance and responsiveness when developing event-driven applications. Traditional approaches require a great amount of programmer effort to restructure and refactor code, to achieve the performance speedup from parallelism and asynchronization. Not only does this restructuring require a lot of development time, it also makes the code harder to debug and understand. We propose an asynchronous programming model based on the philosophy of OpenMP, which does not require code restructuring of the original sequential code. This asynchronous programming model is complementary to the existing OpenMP fork-join model. The coexistence of the two models has potential to decrease developing time for parallel event-driven programs, since it avoids major code refactoring. In addition to its programming simplicity, evaluations show that this approach achieves good performance improvements consistent with more traditional event-driven parallelization.     

Reusable model transformations

Model transformations written for an input metamodel may often apply to other metamodels that share similar concepts. For example, a transformation written to refactor Java models can be applicable to refactoring UML class diagrams as both languages share concepts such as classes, methods, attributes, and inheritance. Deriving motivation from this example, we present an approach to make model transformations reusable such that they function correctly across several similar metamodels. Our approach relies on these principal steps: (1) We analyze a transformation to obtain an effective subset of used concepts. We prune the input metamodel of the transformation to obtain an effective input metamodel containing the effective subset. The effective input metamodel represents the true input domain of transformation. (2) We adapt a target input metamodel by weaving it with aspects such as properties derived from the effective input metamodel. This adaptation makes the target metamodel a subtype of the effective input metamodel. The subtype property ensures that the transformation can process models conforming to the target input metamodel without any change in the transformation itself. We validate our approach by adapting well known refactoring transformations (Encapsulate Field, Move Method, and Pull Up Method) written for an in-house domain-specific modeling language (DSML) to three different industry standard metamodels (Java, MOF, and UML).     

MMRUC3: A recommendation approach of move method refactoring using coupling,cohesion, and contextual similarity to enhance software design

Placement of methods is one of the most important design activities for any object‐oriented application in terms of coupling and cohesion. Due to method misplacement, the application becomes tightly coupled and loosely cohesive, reflecting inefficient design. Therefore, a feature envy code smell emerges from the application, as many methods use more features of other classes than its current class. Hence, development and maintenance time, cost, and effort are increased. To refactor the code smell and enhance the design quality, move method refactoring plays a significant role through grouping similar behaviors of methods. This is because the manual refactoring process is infeasible due to the necessity of huge time and most of the existing techniques consider only coupling‐based and/or cohesion‐based information of nonstatic entities (methods and attributes) for the recommendation. However, this article proposes an approach that uses contextual information, based on information retrieval techniques, along with dependency (coupling and cohesion)‐based information of the application for the recommendation. In addition, the approach incorporates both static and nonstatic entities in the recommendation process. For validation, the approach is applied on seven well‐known open source projects. The results of the experimental evaluation indicate that the proposed approach provides better results with an average precision of 18.91%, a recall of 69.91%, and an F‐measure of 29.77% than the JDeodorant tool (a widely used eclipse plugin for refactorings). Moreover, this article establishes several relationships between the accuracy of the approach and project standards and sizes.