Sparsity-inspired image reconstruction for electrical capacitance tomography

We present a new image reconstruction method for Electrical Capacitance Tomography (ECT). ECT image reconstruction is generally ill-posed because the number of measurements is small whereas the image dimensions are large. Here, we present a sparsity-inspired approach to achieve better ECT image reconstruction from the small number of measurements. Our approach for ECT image reconstruction is based on Total Variation (TV) regularization. We apply an efficient Split-Bregman Iteration (SBI) approach to solve the problem. We also propose three metrics to evaluate image reconstruction performance, i.e., a joint metric of positive reconstruction rate (PRR) and false reconstruction rate (FRR), correlation coefficient, and a shape and location metric. The results on both synthetic and real data show that the proposed TV-SBI method can better preserve the edges of images and better resolve different objects within reconstructed images, as compared to a representative state-of-the-art ECT image reconstruction algorithm, Projected Landweber Iteration with Linear Back Projection initialization (LBP-PLI).     

Projections and preconditioning for inconsistent least-squares problems

In this paper we describe two iterative algorithms for the numerical solution of linear least-squares problems. They are based on a combination between an extension of the classical Kaczmarzs projections method (Popa [5]) and an approximate orthogonalization technique due to Kovarik. We prove that both new algorithms converge to any solution of an inconsistent and rank-defficient least-squares problem (with respect to the choice of the initial approxi-mation), the convergence being much faster than for the classical Kaczmarz - like methods. Some numerical experiments on a first kind integral equation are described.     

New iterative method for model updating based on model reduction

Model reduction technique is usually employed in model updating process. Here, a new iterative method associating the model updating method with the model reduction technique is investigated. Using the traditional iterative method, the errors resulted from replacing the reduction matrix of the experimental model with that of the finite element (FE) model are not fully considered, which needs more iterations and computing time. In order to reduce the errors produced in the replacement, a new iterative method is proposed based on the traditional method, in which the correction term related to the errors is added. The comparisons between the traditional iterative method and the proposed iterative method are shown by model updating examples of solar panels and both of these two iterative methods combine the cross-model cross-mode (CMCM) method and the succession-level approximate reduction (SAR) technique. The results indicate that the convergence rate and the computing time of the new method are significantly superior to those of the traditional iterative method with or without noise.     

Matlab在化工原理教学中的应用

在化工原理理论教学过程中,各单元操作的操作型问题计算较困难,经常需要迭代试差计算,手算费时费力。本文探讨了工程计算软件Matlab用于化工原理操作型问题的计算,结果表明,Matlab易学易用,可有效解决化工原理计算问题。     

基于附加信号回波抵消的FPGA实现

针对基于附加信号回波抵消在硬件设计中出现的迭代误差累积导致信道估计不准确和耗费大量FPGA资源的问题,对算法进行了改进。从主径开始估计回波信道的方法,提高了信道估计精度和减少了FPGA资源消耗。然后,在FPGA平台上用硬件语言Verilog HDL对此回波抵消系统加以实现。仿真结果表明此设计在回波抵消方面具有良好的效果。     

SETL implementation:data structures,primitives, and storage management

In this paper the application of preconditioning is extended to block iterative methods and shown to yield improved convergence rates for linear systems derived from the generalised Dirichlet problem.     

Performance on agile teams: Relating iteration objectives and critical decisions to project management success factors

ContextWhile project management success factors have long been established via the golden triangle, little is known about how project iteration objectives and critical decisions relate to these success factors. It seems logical that teams’ iteration objectives would reflect project management success factors, but this may not always be the case. If not, how are teams’ objectives for iterations differing from the golden triangle of project management success factors?ObjectiveThis study identifies iteration objectives and the critical decisions that relate to the golden triangle of project management success factors in agile software development teams working in two-week iterations.MethodThe author conducted semi-structured interviews with members across three different agile software development teams using a hybrid of XP and Scrum agile methodologies. Iteration Planning and Retrospective meetings were also observed. Interview data was transcribed, coded and reviewed by the researcher and two independently trained research assistants. Data analysis involved organizing the data to identify iteration objectives and critical decisions to identify whether they relate to project management success factors.ResultsAgile teams discussed four categories of iteration objectives: Functionality, Schedule, Quality and Team Satisfaction. Two of these objectives map directly to two aspects of the golden triangle: schedule and quality. The agile teams’ critical decisions were also examined to understand the types of decisions the teams would have made differently to ensure success, which resulted in four categories of such decisions: Quality, Dividing Work, Iteration Amendments and Team Satisfaction.ConclusionThis research has contributed to the software development and project management literature by examining iteration objectives on agile teams and how they relate to the golden triangle of project management success factors to see whether these teams incorporate the golden triangle factors in their objectives and whether they include additional objectives in their iterations. What’s more, this research identified four critical decisions related to the golden triangle. These findings provide important insight to the continuing effort to better assess project management success, particularly for agile teams.     

一种空间飞行轨迹的大地坐标计算方法

针对弹道飞行器空间飞行轨迹的大地坐标计算,从弹道计算的地心球坐标出发,给出一种利用空间几何关系的迭代法,避免了地心直角坐标的转换过程。通过与传统算法的对比分析,验证了该算法的有效性,并进一步明确了该算法的迭代初值,分析了该算法在弹道飞行器空间飞行轨迹大地坐标计算中的适用性。     

分期围堰导流的迭代法求解

分期围堰是常用的导流方式，导流初期河床被围堰束狭，造成上游水位的壅高。水流流态随纵向围堰长度与水头之比，可分为宽顶堰流与明渠流。考虑到电脑的广泛应用，本文推荐采用迭代法求解正常水深ｈ０。临界水深ｈｋ及河糟缩窄后的水位壅高。     

基于MATLAB多自由度单向串联振动系统的计算分析

在工程振动问题中,固有特性(固有频率和主振型)是描述振动系统的主要参数。根据矩阵迭代法,利用MATLAB/GUI界面设计平台,提出了针对多自由度单向串联振动系统固有特性的计算方法,并通过算例求解和误差分析,完成了合理性验证,为复杂振动系统响应的初步解耦奠定了基础。