一种新的基于极大似然估计的系统辨识方法

进化计算是一种基于自然选择和自然变异机制的并行随机优化算法。由于递推极大似然估计法难以实现性能指标函数的全局寻优，所以本文提出了将改进的进化计算用于系统参数辨识的方法。计算机仿真结果表明，该算法能够实现似然函数的全局寻优。     

Software tools for micro-analysis of programs

The paper proposes and describes several tools enabling their user to estimate the efficiency of Pascal or C-like programs. The approach consists of generating symbolic formulas expressing the efficiency of the programs being analyzed. The formulas are applicable to a variety of compiler-machine configurations. The actual numeric values of the variables in the symbolic formula are determined using linear programming techniques. The proposed approach reduces considerably the amount of benchmarking needed to analyze programs. Several examples are presented showing the applicability of the tools. The effort necessary to implement them is considerably reduced by the combined usage of Prolog and a symbolic formula manipulation package (Maple).     

卫星广播调度的鲁棒生长方法

本文提出基于果蝇刚毛分化自组织机理的卫星广播调度新方法，该方法生长出了这种问题的优化解。为增加自组织计算的鲁棒性引入了随机竞争排序技术，对不同大小问题的计算测试表明该方法能快速一致地产生有好的结果。     

横流均匀环境中三维线源型正负浮力射流特性研究

本文利用混合有限分析法及交错网格。对横流均匀环境中三维线源型正负浮力射流及负浮力射流的特性进行研究，分析了不同工况下流速，温度和湍动能在断面上的分布及影响射流轨迹线的因素，讨论了轨迹线上温度的变化及浮力射流的贴壁现象。对三维长线源型负浮力射流，分析了流速比，喷口弗汝德数对负浮力射流的影响。     

单模光纤的传输衰减随温度变化的研究

本文从实验上测量了单模石英光纤在－50～120℃范围内的损耗。随着温度升高，光纤的损耗随之降低，在常温附近达到最小。其后损耗随着温度的继续升高而增加。损耗的变化主要是由于杂质的吸收和微弯损耗。本文对杂质的吸收以及微弯损耗进行了数值模拟，并且从理论上定性地解释了损耗对温度的依赖关系。     

Mesh‐independent p‐orthotropic enrichment using the generalized finite element method

This paper is aimed at presenting a simple yet effective procedure to implement a mesh‐independent p‐orthotropic enrichment in the generalized finite element method. The procedure is based on the observation that shape functions used in the GFEM can be constructed from polynomials defined in any co‐ordinate system regardless of the underlying mesh or type of element used. Numerical examples where the solution possesses boundary or internal layers are solved on coarse tetrahedral meshes with isotropic and the proposed p‐orthotropic enrichment. Copyright © 2002 John Wiley & Sons, Ltd.     

Asymptotic stress intensity factor density profiles for smeared-tip method for cohesive fracture

The paper presents a computational approach and numerical data which facilitate the use of the smeared-tip method for cohesive fracture in large enough structures. In the recently developed K-version of the smeared tip method, the large-size asymptotic profile of the stress intensity factor density along a cohesive crack is considered as a material characteristic, which is uniquely related to the softening stress-displacement law of the cohesive crack. After reviewing the K-version, an accurate and efficient numerical algorithm for the computation of this asymptotic profile is presented. The algorithm is based on solving a singular Abel's integral equation. The profiles corresponding to various typical softening stress-displacement laws of the cohesive crack model are computed, tabulated and plotted. The profiles for a certain range of other typical softening laws can be approximately obtained by interpolation from the tables. Knowing the profile, one can obtain with the smeared-tip method an analytical expression for the large-size solution to fracture problems, including the first two asymptotic terms of the size effect law. Consequently, numerical solutions of the integral equations of the cohesive crack model as well as finite element simulations of the cohesive crack are made superfluous. However, when the fracture process zone is attached to a notch or to the body surface and the cohesive zone ends with a stress jump, the solution is expected to be accurate only for large-enough structures.     

Converting interpreters into compilers

There is an effective and quite general method of manually deriving compilers from programming-language interpreters without dealing directly with machine language. The method is an implementation of the largely theoretical and under-appreciated concept of partial computation, but can be understood on its own terms. It involves the translation of a source program's intermediate form into the interpreter's implementation language. This paper shows how the method can be used to transform both a sample iterative interpreter and a sample recursive interpreter into compilers. The result can be a large gain in program execution speed. Other advantages of the method, including the ease and practicality of applying it, are discussed.     

Partitioning multiple objective optimal solutions with applications in radiotherapy design

The optimal partition for linear programming is induced by any strictly complementary solution, and this partition is important because it characterizes the optimal set. However, constructing a strictly complementary solution in the presence of degeneracy was not practical until interior point algorithms became viable alternatives to the simplex algorithm. We develop analogs of the optimal partition for linear programming in the case of multiple objectives and show that these new partitions provide insight into the optimal set (both pareto optimality and lexicographic ordering are considered). Techniques to produce these optimal partitions are provided, and examples from the design of radiotherapy plans show that these new partitions are useful. A. Holder. Research conducted at Trinity University, TX, and The University of Mississippi, MS. This research was partially supported by ONR Grant N00014-01-1-0917.     

Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place. In particular, this is true for the whole body of work of secure multi-party protocols in the case that a third or more of the parties are corrupted. This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement. We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever a third or more of the parties are corrupted. In this paper we show that this folklore is false. We present a mild relaxation of the definition of secure computation allowing abort. Our new definition captures all the central security issues of secure computation, including privacy, correctness and independence of inputs. However, the novelty of the definition is in decoupling the issue of agreement from these issues. We then show that this relaxation suffices for achieving secure computation in a point-to-point network. That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted pre-processing phase as required for running authenticated Byzantine agreement). Furthermore, this is achieved by just replacing the broadcast channel in known protocols with a very simple and efficient echo-broadcast protocol. An important corollary of our result is the ability to obtain multi-party protocols that remain secure under composition, without assuming a broadcast channel.