Neural net versus classical models for the detection and localization of leaks in pipelines

Four models of a pipeline are compared in the paper: a nonlinear distributed-parameter model, a linear distributed-parameter model, a simplified lumped-parameter model and an extended neural-net-based model. The transcendental transfer function of the linearized model is obtained by a Laplace transformation and corresponding initial and boundary conditions. The lumped-parameter model is obtained by a Taylor series extension of the transencdental transfer function. Based on the experience of linear models the structure of the neural net model, as an addendum to the nonlinear distributed-parameter model, is obtained. All four models are tested on a real pipeline data with an artificially generated leak.     

A Network Approach to a Geometric Packing Problem

We investigate a geometric packing problem (derived from an industrial setting) that involves fitting patterns of regularly spaced disks without overlap. We first derive conditions for achieving a feasible placement of a given set of patterns and then construct a network formulation that facilitates the calculation of such a placement. A heuristic utilizing this network representation is also outlined. Additionally, we show a connection to the well-known Periodic Scheduling Problem.     

On the Monotonicity of Process Number

Graph searching games involve a team of searchers that aims at capturing a fugitive in a graph. These games have been widely studied for their relationships with tree-and path-decomposition of graphs. In order to define decompositions for directed graphs, similar games have been proposed in directed graphs. In this paper, we consider such a game that has been defined and studied in the context of routing reconfiguration problems in WDM networks. Namely, in the processing game, the fugitive is invisible, arbitrary fast, it moves in the opposite direction of the arcs of a digraph, but only as long as it has access to a strongly connected component free of searchers. We prove that the processing game is monotone which leads to its equivalence with a new digraph decomposition.     

Rock deformation equations and application to the study on slantingly installed disc cutter

At present the mechanical model of the interac- tion between a disc cutter and rock mainly concerns indentation experiment, linear cutting experiment and tunnel boring machine （TBM） on-site data. This is not in line with the actual rock-breaking movement of the disc cutter and impedes to some extent the research on the rock-breaking mechanism, wear mechanism and design theory. Therefore, our study focuses on the interaction between the slantingly installed disc cutter and rock, developing a model in accordance with the actual rock-breaking movement. Displacement equations are established through an analysis of the velocity vector at the rock-breaking point of the disc cutter blade; the func- tional relationship between the displacement parameters at the rock-breaking point and its rectangular coordinates is established through an analysis of micro-displacement vectors at the rock-breaking point, thus leading to the geometric equations of rock deformation caused by the slantingly installed disc cutter. Considering the basically linear relationship between the cutting force of disc cutters and the rock deformation before and after the leap break of rock, we express the constitutive relations of rock deformation as generalized Hooke＇s law and analyze the effect of the slanting installa- tion angle of disc cutters on the rock-breaking force. This will, as we hope, make groundbreaking contributions to the development of the design theory and installation practice of TBM.     

The Feynman path integral and its optical applications

There is a fruitful analogy between mechanics and optics. To describe the transition from quantum mechanics to classical mechanics, Feynman introduced the concept of an “integral over all paths”. The Feynman integral is used here to describe the transition from wave optics to geometrical optics. We suggest simple mathematical tools that allow use the Feynman integral and its approximation to calculate the radiation transport through an optically inhomogeneous layer and through an aperture in an infinite opaque screen.     

Control modeling of ash wood drying using process neural networks

For the control and system identification problems of the deceleration phase of the ash wood drying process, we propose a deceleration phase modeling method of ash wood drying using process neural networks with double hidden layers. This method applies time-varying characteristics of process neural networks and the ability to extract time-space cumulative effects. The time-varying characteristics of wood drying deceleration phase modeling under time series background are directly incorporated into the model. By comparison with traditional neural network modeling results, we prove that the model of process neural networks has better control accuracy, providing an idea to solve control and nonlinear system identification problems under a time series background.     

非下采样变换的红外与可见光图像融合

基于非下采样Contourlet变换（NSCT）,提出了一种红外和可见光图像融合算法。针对低频子带系数和各带通方向子带系数分别提出了基于图像物理特征的系数加权选择方式与基于区域能量匹配的系数选择方式,即低频基于区域梯度信息、高频基于区域特征因子的加权与选择结合的图像融合算法。实验结果表明：非下采样Contourlet变换具有较快的运算速度,且经非下采样变换后能量更加集中,可提供更多的图像信息。相对于基于像素的图像融合算法,本文的图像融合算法具有更高的融合性能,是一种更适合图像融合的多尺度几何分析（MGA）工具。     

Parity representations of posets

Parity representations, introduced in this paper, comprise a new method of representation of posets that yields insight into the combinatorics of the poset of all intervals of a poset. Results here generalize some results previously obtained for the face lattices of binary partition polytopes.     

The algebraic and geometric classification of nilpotent terminal algebras

We give algebraic and geometric classifications of 4-dimensional complex nilpotent terminal algebras. Specifically, we find that, up to isomorphism, there are 41 one-parameter families of 4-dimensional nilpotent terminal (non-Leibniz) algebras, 18 two-parameter families of 4-dimensional nilpotent terminal (non-Leibniz) algebras, 2 three-parameter families of 4-dimensional nilpotent terminal (non-Leibniz) algebras, complemented by 21 additional isomorphism classes (see Theorem 13). The corresponding geometric variety has dimension 17 and decomposes into 3 irreducible components determined by the Zariski closures of a one-parameter family of algebras, a two-parameter family of algebras and a three-parameter family of algebras (see Theorem 15). In particular, there are no rigid 4-dimensional complex nilpotent terminal algebras.