Organic mesh template-based laminated object manufacturing to fabricate ceramics with regular micron scaled pore structures

A new aqueous slurry-based laminated object manufacturing process for porous ceramics is proposed: firstly, an organic mesh sheet is pre-paved as a pore-forming template before slurry layer scraping; secondly, the 2D pattern is built with laser outline cutting of the dried mesh–ceramic composite layer; finally, the pore structure is formed after degreasing and sintering. Alumina parts with porosities of 51.5 %, round hole diameters of 80 ± 5 μm were fabricated using 70 wt. % solid content slurry and 100 mesh nylon net. Using an organic mesh as the framework and template not only reduces the risk of damage of the green body but also ensures the regularity, uniformity and connectivity of the micron scaled pore network. The layer-by-layer drying method avoids the delamination phenomenon and improves the paving density. The new method can realize the flexible design of the pore structure by using various organic mesh templates.     

规整填料和新型塔板设计参数选取的质疑及分析

笔者指出了目前规整填料和新型塔板设计计算中若干尚未完全解决的、有争议或值得进一步完善的设计参数。如:规整填料的每米理论板数、最小液体喷淋密度、最小气体空塔动能因子、新型塔板开孔率等,并提出了具体的设计方案供与同行切磋。     

On regular drawn symbolic picture languages

Drawn symbolic pictures are an extension of drawn pictures obtained by associating a symbol from an alphabet to each point of the picture. In the paper we will address some new interesting issues derived from the introduction of the symbols and we will identify the conditions, which ensure the preservation of properties holding for drawn pictures in the setting of the proposed extension.     

On the computation of conjugacy classes of Chevalley groups

In this paper an algorithm is presented to determine the number of semisimple conjugacy classes for a given centralizertype for the Chevalley groupsSL _n(q) andSU _n(q). Moreover we give the exact number of regular semisimple classes of this groups and a summary of results on the generic classnumber of exceptional Chevalley groups of adjoint type.The first author acknowledges financial support by a grant of the Deutsche Forschungsgemeinschaft     

Influence of numerical and viscous dissipation on shock wave reflections in supersonic steady flows

Numerical simulations are investigated to describe precisely the shock wave reflections in supersonic steady air flow field. The main objectives are to study the influence of the wedge trailing edge corner angle, of the numerical methods and of the viscous effects on the shock wave reflections and on the hysteresis behavior. The computations are done with different MUSCL-TVD finite volume schemes and the corresponding results are compared. The flow viscosity is also taken into account and comparisons are made between inviscid and viscous flow simulations. The results display the non-negligible influence of the numerical scheme accuracy on the results, mainly on the position and height of the Mach stem, and the relatively weak influence of the flow viscosity on these parameters. Comparisons between numerical results and experimental data have also been done and a good agreement is only observed for small wedge angles mainly due to the three-dimensional effects in the experimental setup.     

Obtaining shorter regular expressions from finite-state automata

We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping.     

正则模糊神经网络对一类连续模糊值函数的普遍近似性

本文讨论了正则模糊神经网络于对定义于区间［０，Ｔ０］上连续可减模糊值函数的普遍近似性，在此基础上，证明了［０，Ｔ０］上取值为三角形模糊连续递增函数可用正则模糊神经网络逼近到任意精度。     

由有穷自动机构造正则表达式的新算法

本文借助图论的理论，通过识别回路和不包含回路的由起始状态到终止状态的路径的方法，提出一种构造给定有穷自动机对应的正则表达式的新算法，并给出具体实例。     

Concurrent reading while writing revisited

A modification is proposed to Peterson's construction of 1-writern-reader multivalued atomic shared variableusingn+2 multivalued safe variables and some boolean atomic variables. The resulting construction is elegant and is simpler than the original one. K. Vidyasankar received B.E. (Elec. Engg.) from Thiagarajar College of Engineering, Madurai, M. Tech. from I.I.T. Kanpur, India, and Ph.D. in Computer Science from University of Waterloo, Canada. He is now an Associate Professor in Computer Science at Memorial University of Newfoundland, Canada. His research interests include concurrency control and recovery in database systems, concurrency in interprocess communication, design and analysis of algorithms, and graph theory.A prelininary version of this paper, under the title Improving Peterson's Construction of 1-Writern-Reader Multivalued Atomic Register, appears in the Proc. 26th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois at Urbana Champaign, September 1988, pp 693–700     

How to find Steiner minimal trees in euclideand-space

This paper has two purposes. The first is to present a new way to find a Steiner minimum tree (SMT) connectingN sites ind-space,d >- 2. We present (in Appendix 1) a computer code for this purpose. This is the only procedure known to the author for finding Steiner minimal trees ind-space ford > 2, and also the first one which fits naturally into the framework of backtracking and branch-and-bound. Finding SMTs of up toN = 12 general sites ind-space (for anyd) now appears feasible.We tabulate Steiner minimal trees for many point sets, including the vertices of most of the regular and Archimedeand-polytopes with <- 16 vertices. As a consequence of these tables, the Gilbert-Pollak conjecture is shown to be false in dimensions 3–9. (The conjecture remains open in other dimensions; it is probably false in all dimensionsd withd 3, but it is probably true whend = 2.)The second purpose is to present some new theoretical results regarding the asymptotic computational complexity of finding SMTs to precision .We show that in two-dimensions, Steiner minimum trees may be found exactly in exponential time O(C ^N ) on a real RAM. (All previous provable time bounds were superexponential.) If the tree is only wanted to precision , then there is an (N/)^O(N)-time algorithm, which is subexponential if 1/ grows only polynomially withN. Also, therectilinear Steiner minimal tree ofN points in the plane may be found inN ^O(N) time.J. S. Provan devised an O(N ⁶/⁴)-time algorithm for finding the SMT of a convexN-point set in the plane. (Also the rectilinear SMT of such a set may be found in O(N ⁶) time.) One therefore suspects that this problem may be solved exactly in polynomial time. We show that this suspicion is in fact true—if a certain conjecture about the size of Steiner sensitivity diagrams is correct.All of these algorithms are for a real RAM model of computation allowing infinite precision arithmetic. They make no probabilistic or other assumptions about the input; the time bounds are valid in the worst case; and all our algorithms may be implemented with a polynomial amount of space. Only algorithms yielding theexact optimum SMT, or trees with lengths (1 + ) × optimum, where is arbitrarily small, are considered here.