Automated synthesis of multiple analog circuits using evolutionary computation for redundancy-based fault-tolerance

Analog circuits are one of the most important parts of modern electronic systems and the failure of electronic hardware presents a critical threat to the completion of modern aircraft, spacecraft, and robot missions. Compared to digital circuits, designing fault-tolerant analog circuits is a difficult and knowledge-intensive task. A simple but powerful method for robustness is a redundancy approach to use multiple circuits instead of single one. For example, if component failures occur, other redundant components can replace the functions of broken parts and the system can still work. However, there are several research issues to make the redundant system automatically. In this paper, we used evolutionary computation to generate multiple analog circuits automatically and then we combined the solutions to generate robust outputs. Evolutionary computation is a natural way to produce multiple redundant solutions because it is a population-based search. Experimental results on the evolution of the low-pass, high-pass and band-stop filters show that the combination of multiple evolved analog circuits produces results that are more robust than those of the best single circuit.     

Two new characteristic parameters for runoff computation

A method capable of estimating the hydrograph from a prescribed storm for a practical mild slope upstream catchment is proposed. This method makes use of two new characteristic parameters, andS, in conjunction with the kinematic wave equation to compute lateral inflows of the main stream of the catchment. The depth profile of overland flow at any instant within the catchment and hydrograph at any location can be easily found. Lag times for individual lateral inflows are then considered and are linearly combined to obtain the hydrograph at the outlet of the catchment or depth profile of the main stream at any instant. The validity of the excess rainfall-surface runoff linear relationship in this study has also been verified with Tatsunokuchiyama catchment, and it shows good results for this computed runoff.     

Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time

This paper extends the algorithms which were developed in Part I to cases in which there is no affine schedule, i.e. to problems whose parallel complexity is polynomial but not linear. The natural generalization is to multidimensional schedules with lexicographic ordering as temporal succession. Multidimensional affine schedules, are, in a sense, equivalent to polynomial schedules, and are much easier to handle automatically. Furthermore, there is a strong connection between multidimensional schedules and loop nests, which allows one to prove that a static control program always has a multidimensional schedule. Roughly, a larger dimension indicates less parallelism. In the algorithm which is presented here, this dimension is computed dynamically, and is just sufficient for scheduling the source program. The algorithm lends itself to a divide and conquer strategy. The paper gives some experimental evidence for the applicability, performances and limitations of the algorithm.     

On problem transformability in VLSI

The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT ² andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT²=(n ²log² n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT ² andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.     

针对无网格并行计算的基于模糊均值聚类的分区方法*

针对国际上普遍采用的基于回归几何二分的分区方法的缺陷,提出了基于模糊均值聚类的均匀模糊均值聚类分区算法。采用该方法对不同类型的无网格几何模型进行了分区,并根据分区信息对三维实体模型进行了并行计算。通过与基于回归几何二分法的比较,充分验证该算法的有效性和可行性。     

轴流式转轮三元粘性流动数值计算

为进一步提高轴流式转轮的设计精度与性能,采用时均Navier-Stokes控制方程,标准k-ε湍流模型及SIMPLEC算法,对一轴流定浆式水轮机转轮内三元粘性流动进行了数值模拟。提出了水力损失计算方法,获得了转轮的预测效率。分析了转轮内部流场分布规律,建立了叶片表面压力在包角范围内的变化曲线,有助于认识转轮内真实流动现象,为改善设计提供可视化数据支持。     

FracSym: Automated symbolic computation of Lie symmetries of fractional differential equations

In this paper, we present an algorithm for the systematic calculation of Lie point symmetries for fractional order differential equations (FDEs) using the method as described by Buckwar & Luchko (1998) and Gazizov, Kasatkin & Lukashchuk (2007, 2009, 2011). The method has been generalised here to allow for the determination of symmetries for FDEs with n$n$ independent variables and for systems of partial FDEs. The algorithm has been implemented in the new MAPLE package FracSym (Jefferson and Carminati 2013) which uses routines from the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati, 2012) and ASP (Jefferson and Carminati, 2013). We introduce FracSym by investigating the symmetries of a number of FDEs; specific forms of any arbitrary functions, which may extend the symmetry algebras, are also determined. For each of the FDEs discussed, selected invariant solutions are then presented.     

化学反应蚁群优化算法

针对化学反应优化对反馈信息利用不足导致后期求解效率低的问题,提出化学反应蚁群优化算法.该算法利用化学反应优化生成较优解,通过信息素转换策略将较优解转换为蚁群算法的初始信息素,最后由蚁群算法累积更新信息素得到最优解.以TSP为例进行仿真,结果表明,与化学反应优化、蚁群算法、模拟退火算法相比,所提算法具有更高的寻优能力、收敛效率和计算效率.     

Computer Algebra Derivation of the Bias of Linear Estimators of Autoregressive Models

Abstract. A symbolic method which can be used to obtain the asymptotic bias and variance coefficients to order O(1/n) for estimators in stationary time series is discussed. Using this method, the large‐sample bias of the Burg estimator in the AR(p) for p = 1, 2, 3 is shown to be equal to that of the least squares estimators in both the known and unknown mean cases. Previous researchers have only been able to obtain simulation results for the Burg estimator's bias because this problem is too intractable without using computer algebra. The asymptotic bias coefficient to O(1/n) of Yule–Walker as well as least squares estimates is also derived in AR(3) models. Our asymptotic results show that for the AR(3), just as in the AR(2), the Yule–Walker estimates have a large bias when the parameters are near the nonstationary boundary. The least squares and Burg estimates are much better in this situation. Simulation results confirm our findings.