模糊概念格与模糊推理

基于伽罗瓦连接,分别在交换伴随对与对合剩余格条件下,讨论了模糊概念格的四种定义形式。并证明了在对合剩余格上,对偶性成立,四种模糊算子将具有与经典意义下一致的相互关系。最后我们提出了一种基于模糊概念格的模糊推理规则,并证明了其还原性。     

A contribution to the ternary phase diagram Co-Sb-Te

The melting behaviour, some phase boundaries and the lattice parameters in the region of the NiAs-type phase in the ternary system cobalt-antimony-tellurium have been determined by differential thermal analysis and X-ray diffraction. A projection of the liquidus surface and the phase relationships in different sections with constant antimony/tellurium ratios are presented. The peculiar variation of the lattice parameters with the composition of the nonstoichiometric NiAs-type phase is discussed in terms of the defect structure.Dedicated to Prof. K. L. Komarek on the occasion of his 65th birthday     

A kinetic Monte Carlo method on super-lattices for the study of the defect formation in the growth of close packed structures

A modified Kinetic Lattice Monte Carlo model has been developed to predict growth rate regimes and defect formation in the case of the homo-epitaxial growth of close packed crystalline structures. The model is an improvement over standard Monte Carlo algorithms, which usually retain fixed atom positions and bond partners indicative of perfect crystal lattices. Indeed, we extend the concepts of Monte Carlo growth simulations on super-lattices containing additional sites (defect sites) with respect to those of the reference material. This extension implies a reconsideration of the energetic mapping, which is extensively presented, and allows to describe a complex phenomenology that is out of accessibility of standard stochastic approaches. Results obtained using the Kawasaki and the Bond-Counting rules for the transition probability of the Monte Carlo event are discussed in details. These results demonstrate how the defect types (local or extended), the formation mechanisms and the defect generation regimes can be characterized using our approach.     

SCDA for 3D lattice gases with repulsive interaction

The selfconsistent diagram approximation (SCDA) is generalized for three-dimensional lattice gases with nearest neighbor repulsive interactions. The free energy is represented in a closed form through elementary functions. Thermodynamical (phase diagrams, chemical potential and mean square fluctuations), structural (order parameter, distribution functions) as well as diffusional characteristics are investigated. The calculation results are compared with the Monte Carlo simulation data to demonstrate high precision of the SCDA in reproducing the equilibrium lattice gas characteristics. It is shown that similarly to two-dimensional systems the specific statistical memory effects strongly influence the lattice gas diffusion in the ordered states. Received 7 August 2002 / Received in final form 22 January 2003 Published online 24 April 2003     

Note on André's reflection principle

This note generalizes André's reflection principle to give a new combinatorial proof of a formula for the number of lattice paths lying within certain trapezoids.     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

多元整系数多项式因式分解的一种理论和算法

本文将ｔ（ｔ是大于２的整数）元整系数多项式看成为系数为ｔ－２元整系数多项式的二元多项式，建立了多元整系数多项式因式分解的一种新理论，进而得到了分解多元整系数多项式的一个有力的算法。     

A Characterization of the Optimal p-sum Labellingsof Unit Interval Graphs

1.IntroductionGraphsconsideredinthispaperarefiniteandsimple.FOragraphG,V(G)andE(G)denoteitssetofvenicesandedges,respectively.AbijectionwillbecalledalabellingofG.Letpbeapositiverealnumber.ForagivenlabellingTofagraphG,definethegndiscrepencya.(G,ac)ofTasTheobjectiveoftheminimum-p--sumproblemistofindalabelling7ofagraphGsuchthatac(G,T)isassmallaspossible.ThelabellingTminimizinga.(G,7)iscalledanoptimalHsumlabellingofG.Theminimumvalueiscalledtheminimum-psumofG.ItisshowninI31thattheminimum-…     

Complete Surjections and Complete Epimorphisms over Completely Distributive Lattices

Generators and lattice properties of the poset of complete homomorphisic images of a completely distributive lattice are exploited via the localic methods. Some intrinsic and extrinsic conditions about this poset to be a completely distributive lattice are given. It is shown that the category of completely distributive lattices is co-well-powered,and complete epimorphisms on completely distributive lattice are not necessary to be surjections. Finally, some conditions about complete epimorphisms to be surjections are given.