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).     

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

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

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

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

一种结合知识挖掘的进化规划算法

进化规划是一种进化计算方法。进化规划主要使用随机化技术来实现优化过程。与其它进化算法相比,进化规划只有变异操作,而没有交叉操作,因此变异操作的有效性对进化规划算法的成功至关重要。在传统进化规划算法中,进化规划的变异操作具有完全的随机性,这虽然有利于避免局部极值,但却导致较大的计算量。在本文算法中,将知识挖掘技术引入进化规划之中。知识挖掘技术主要用于发现规则,然后利用发现的规则指导变异操作过程,提高变异操作的效率。最终加快了进化规划算法的速度,而计算效果没有明显下降。通过知识挖掘技术的引入,进化规划算法有了初步的智能特性。将本文所介绍的新算法应用于视频编码的运动估计实验中,结果表明新算法有良好的计算速度和计算精确性。     

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.     

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.     

Almost k-wise independence versus k-wise independence

We say that a distribution over {0,1}ⁿ is (ε,k)-wise independent if its restriction to every k coordinates results in a distribution that is ε-close to the uniform distribution. A natural question regarding (ε,k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exist (ε,k)-wise independent distributions whose statistical distance is at least n^O(k)·ε from any k-wise independent distribution. In addition, we show that for any (ε,k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is n^O(k)·ε.     

Optimal biocompatible solvent design for a two-stage extractive fermentation process with cell recycling

In this study, crisp and fuzzy multiple-goal optimization approaches are respectively introduced to design an optimal biocompatible solvent to a two-stage extractive fermentation with cell recycling for ethanol production. When designing a biocompatible solvent for the extractive fermentation process, many issues, such as extractive efficiency, conversion, amount of solvent utilized and so on, have to be considered. An interactive multiple-goal design procedure is introduced to determine a trade-off result in order to satisfy such contradicted goals. Both approaches could be iterated to solve the interactive multiple-goal design problem in order to yield a trade-off result. However, the crisp optimization design is a tedious task that requires the designer to provide various pairs of the upper bounds for the design problem to obtain the corresponding solution. The fuzzy optimization approach is able to be trade-off several goals simultaneously and to yield the overall satisfactory grade for the product/process design problem.     

A fast evolutionary pursuit algorithm based on linearly combining vectors

In this paper, we propose a fast Evolutionary pursuit algorithm. It searches for optimal discriminant vectors through linearly combining standard bases. Experiments on the Yale and ORL databases verify its effectiveness and enhanced efficiency.