Heterogeneities of grain boundary arrangement in polycrystals

Data on mutual arrangements of different types of grain boundaries in polycrystals are presented. The heterogeneity in grain boundary distribution, namely, the effect of gathering low-angle or special tilt grain boundaries is found in pure aluminum thin films, in sheets of Fe-3% Si alloy and in Al₂O₃ doped with MgO or MgO and Y ₂O₃. The local texture, i.e., formation of colonies or clusters of close-oriented grains is considered as a reason of this heterogeneity. The influences of grain boundary gathering on the transport properties of polycrystals and on the crack propagation are discussed. A new concept of effective grain size is suggested to analyze the relationship between material microstructures and material properties.     

Concurrent stochastic methods for global optimization

The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation. This paper presents a new parallel algorithm for the global optimization problem. The algorithm is a stochastic method related to the multi-level single-linkage methods of Rinnooy Kan and Timmer for sequential computers. Concurrency is achieved by partitioning the work of each of the three main parts of the algorithm, sampling, local minimization start point selection, and multiple local minimizations, among the processors. This parallelism is of a coarse grain type and is especially well suited to a local memory multiprocessing environment. The paper presents test results of a distributed implementation of this algorithm on a local area network of computer workstations. It also summarizes the theoretical properties of the algorithm.Research supported by AFOSR grant AFOSR-85-0251, ARO contract DAAG 29-84-K-0140, NSF grant DCR-8403483, and NSF cooperative agreement DCR-8420944.     

Multiple local solutions to nonlinear control processes

We use the topological tool of Nielsen fixed-point theory to study the controllability of perturbed linear control processes whose control space can be reduced to a finite-dimensional one. These methods produce a lower bound on the number of controls that achieve a given target. We concentrate particularly on the case where the perturbation has sublinear growth, and we exhibit examples of multiple controls of various types that are detected by the Nielsen theory method.This research was partly supported by the Research Grant Teoria del Controllo dei Sistemi Dinamici, Ministero della Pubblica Istruzione, Roma, Italy.     

Service stage Petri net models with product form solution

A class of service stage Petri net models whose equilibrium probabilities satisfy local balance equations is presented. Examples of their applicability include bus oriented multiprocessor interconnections, the classical dining philosophers problem and the alternating bit protocol. The natural topological space for embedding the state transition lattice for this class of SSPN is shown to be a multidimensional toroidal manifold.     

基于改进U-Net的量子点STM图像分割

为提升量子点图像分割精度,降低特征识别误差,提出一种基于改进U-Net的量子点图像分割方法.首先,在预处理阶段,设计了以色彩通道为权值的灰度化算法,以提升后续分割效果.其次,在STM图像分割部分,在原始U-Net结构上引入中间过渡层以均衡网络各层特征.而后,建立数据集,并通过实验对比不同分割算法的精确度、召回率、F-measure.最后,将分割算法应用于量子点的特征识别,并测试了不同分割方式对应用的影响.实验结果显示,改进灰度化方法保留细节信息丰富,明显提升了量子点分割精度;改进U-Net的平均精确率、召回率、F-measure相较原始网络分别提升了13.83%、2.16%、8.13%.同时,实验数据表明由于分割精度的提升,量子点数量、纵横比等特征参数的识别更加精确.     

Symmetry of the Barochronous Motions of a Gas

We study the system of nonlinear differential equations which expresses the constancy of the algebraic invariants of the Jacobian matrix for smooth vector fields in three-dimensional space. This system is equivalent to the equations of gas dynamics which describe the barochronous motions of a gas (the pressure and density depend only on the time). We present the results of computation of the admissible local Lie group and construction of the general solution of the system. We mention a few new problems that arise here.     

An Incremental Algorithm for the Maximum Flow Problem

An incremental algorithm may yield an enormous computational time saving to solve a network flow problem. It updates the solution to an instance of a problem for a unit change in the input. In this paper we have proposed an efficient incremental implementation of maximum flow problem after inserting an edge in the network G. The algorithm has the time complexity of O((n)² m), where n is the number of affected vertices and m is the number of edges in the network. We have also discussed the incremental algorithm for deletion of an edge in the network G.     

Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant

District heating plants are becoming more common in European cities. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts having the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion performances. In order to amortize the costs throughout the year, the system often includes a combined heat and power (CHP) plant, to exploit the energy during the summer as well, when the demand for warm water decreases. A linear programming model for the optimal resource management of such a plant is presented and some results for a real case are reported. A distribution network design problem is also addressed and solved by means of mixed integer linear programming.     

A Tabu-Search Hyperheuristic for Timetabling and Rostering

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.     

Permeability of Clustered Fiber Networks: Modeling of the Unit Cell

The paper is focused on estimating the permeability of a clustered fiber network by variational methods. First, a laminar flow in ducts is considered by using polynomial trial functions. Then, a longitudinal flow through a square array is described by expanding the flow-rate field in trigonometric and Laurent series. Finally, a formal scheme for estimating the longitudinal permeability in a cluster with an irregular distribution of fibers is given. The irregular distribution is modeled by setting an individual effective radius for each fiber and then letting this fiber reach its minimum gravitational energy. The results obtained here form a basis for future predictions of the permeability of fibrous reinforcements.