Impact analysis and change propagation in service-oriented enterprises: A systematic review

ContextThe adoption of Service-oriented Architecture (SOA) and Business Process Management (BPM) is fairly recent. The major concern is now shifting towards the maintenance and evolution of service-based business information systems. Moreover, these systems are highly dynamic and frequent changes are anticipated across multiple levels of abstraction. Impact analysis and change propagation are identified as potential research areas in this regard.ObjectiveThe aim of this study is to systematically review extant research on impact analysis and propagation in the BPM and SOA domains. Identifying, categorizing and synthesizing relevant solutions are the main study objectives.MethodThrough careful review and screening, we identified 60 studies relevant to 4 research questions. Two classification schemes served to comprehend and analyze the anatomy of existing solutions. BPM is considered at the business level for business operations and processes, while SOA is considered at the service level as deployment architecture. We focused on both horizontal and vertical impacts of changes across multiple abstraction layers.ResultsImpact analysis solutions were mainly divided into dependency analysis, traceability analysis and history mining. Dependency analysis is the most frequently adopted technique followed by traceability analysis. Further categorization of dependency analysis indicates that graph-based techniques are extensively used, followed by formal dependency modeling. While considering hierarchical coverage, inter-process and inter-service change analyses have received considerable attention from the research community, whereas bottom-up analysis has been the most neglected research area. The majority of change propagation solutions are top-down and semi-automated.ConclusionsThis study concludes with new insight suggestions for future research. Although, the evolution of service-based systems is becoming of grave concern, existing solutions in this field are less mature. Studies on hierarchical change impact are scarce. Complex relationships of services with business processes and semantic dependencies are poorly understood and require more attention from the research community.     

A scheme for LR(k) parsing with error recovery part II: error recovery

The paper is the second in a series of three papers devoted to a detailed study of LR(k) parsing with error recovery and correction. Error recovery in LR(k) parsing of a context-free grammar is formalized by extending an LR(k) parser of the grammar such that it accepts all strings over the terminal vocabulary. The parse produced by this extension for a terminal string is a right parse if the string is in the language. In the case of a string not in the language the parse produced by the extension contains so-called error productions which represent the error recovery actions performed by the extension. The treatment is based on the formalization of LR(k) parsing presented in the first paper in the series and it covers practically all error recovery methods designed for LR(k) parsing.     

SLR算法在MRI中的模拟方法与实验研究

在磁共振成像中,运用Shinnar-Le Roux算法设计射频脉冲,不仅可以避免Bloch方程引起的非线性问题,而且能有效地抑制旁瓣激发,以获得理想的激发带宽.首先介绍了SLR脉冲设计思想,然后基于密度矩阵理论,应用计算机模拟方法对所设计脉冲的激发带宽进行模拟.最后,给出了测量射频脉冲激发带宽曲线的脉冲序列,并用MRI实验加以验证.     

Incremental generation of LR parsers

Implementation of a new compiler usually requires making frequent adjustments to grammar definitions. An incremental technique for updating the parser tables after a monor change to the grammer could potentially save much computational effort. More importantly, debugging a grammar is made easier if the grammar is re-checked for correctness after each small change to the grammar. The basic design philosophy of an incremental parser generator, and incremental algorithms for LR(0), SLR(1) and LALR(1) parser generation are discussed in this paper. Some of these algorithms have been incorporated into an implementation of an incremental LALR(1) parser generator.     

Characteristics of sludge developed under different loading conditions during UASB reactor start-up and granulation

Sludge characteristics available inside the reactor are of vital importance to maximize advantages of UASB reactor. The organic loading rate and sludge loading rate applied during start-up are among the important parameters to govern the sludge characteristics. Effects of these loading rates on the characteristics of the sludge developed are evaluated in six laboratory scale UASB reactors. The sludge characteristics considered are VSS/SS ratio of the sludge, sludge volume index, specific gravity, settling velocity and metal contents of the sludge developed under different loading rates. The experimental results indicate that, for developing good characteristics sludge, during primary start-up from flocculent inoculum sludge, organic loading rate and sludge loading rate should be in the range of 2.0-4.5 kg COD/m3 d and 0.1-0.25 kg COD/kg VSS d, respectively (chemical oxygen demand, COD). Proper sludge granulation and higher COD removal efficiency will be achieved by these loading rates.     

卫星激光测距中接收光路光机结构设计

在卫星激光测距过程中,需要在跟踪卫星的同时完成激光测距,为了能实现全天候的测距工作,白天卫星激光测距的探索具有重要的意义.对中、高轨卫星测距时,反射同来的激光能量非常少,因此必须采用大口径的望远镜进行接收.在研制某型号卫星激光测距的项目中,为了保证MEO、GEO和IGSO的成功测距,选用口径为φ1000 mm的主光系统,在第一像面前采用分光棱镜光谱分光的形式,实现了跟踪卫星和激光测距任务的同时完成,并且扩展了白天光束监测光路,使系统具备了全天候测距功能.实践证明,光学系统成像质量良好,机械结构设计合理、紧凑,成功地实现了对中、高轨卫星的测距.     

基于统计线性回归的粒子滤波方法

针对非线性、非高斯系统的状态估计问题,该文提出了一种基于统计线性回归的粒子滤波算法。在该算法中,首先对非线性函数基于统计线性回归展开,并利用高斯积分估计回归系数,依此产生重要性密度函数。该密度函数融入了最新的观测信息,扩大了与系统真实后验密度的重叠区域。理论分析和实验结果表明,该算法具有较高的估计精度,与一般的粒子滤波算法相比,有较好的稳定性和较低的计算量。     

Parallel construction of SLR (1) and LALR (1) parsers

The generation of an LR parser consists of constructing a parse table, with one row per state (in a push-down automaton), and one column per terminal symbol. Traditionally, this is carried out row by row, with the computation of one row depending (potentially) on all the others. We present a technique for carrying out the lookahead computation of SLR (1) and LALR (1) parsers in a completely parallel fashion. Our technique performs the computation by column, rather than by row. We show that the computation is totally independent for each column, making it ideal for parallelization. The speedup factor of the technique is min (N, T), whereN is the number of processors andT is the number of terminal symbols in the user's grammar.     

数码单反相机的成像原理

本文阐述了传统单反照相机、数码单反照相机和单镜头电子取景数码照相机的结构、特性、工作原理和发展历程，对比了其各自的功能和性价比，并指出了：由于单镜头电子取景数码照相机在拍摄时记录下的景物与取景器上观察的景物完全是相同的，不存在任何时间差，而且相机结构相对较为紧凑、轻便，性价比较高，因此有可能取代数码单反照相机成为今后高档数码照相机的发展方向。