Generation of partial orders for intervals by means of the slope function

Partial Orders in Non-commutative $$L^p$$ Spaces Associated with Semi-finite von Neumann Algebras

Bulletin of the Malaysian Mathematical Sciences Society ◽

10.1007/s40840-021-01145-4 ◽

2021 ◽

Author(s):

Xinhui Wang ◽

Guoxing Ji

Keyword(s):

Von Neumann Algebras ◽

Partial Orders ◽

Von Neumann ◽

Finite Von Neumann Algebras

Download Full-text

Partial orders on conjugacy classes in the Weyl group and on unipotent conjugacy classes

Advances in Mathematics ◽

10.1016/j.aim.2021.107688 ◽

2021 ◽

Vol 383 ◽

pp. 107688

Author(s):

Jeffrey Adams ◽

Xuhua He ◽

Sian Nie

Keyword(s):

Weyl Group ◽

Partial Orders ◽

Conjugacy Classes

Download Full-text

Dependence of Diffusion Paths on Thermodynamic Factors in Ternary Systems

Defect and Diffusion Forum ◽

10.4028/www.scientific.net/ddf.277.119 ◽

2008 ◽

Vol 277 ◽

pp. 119-124 ◽

Cited By ~ 5

Author(s):

Ü. Ugaste ◽

J. Priimets ◽

Tony Laas

Keyword(s):

Approximate Equation ◽

Ternary Systems ◽

Diffusion Path ◽

Tracer Diffusion ◽

Diffusion Paths ◽

Slope Function ◽

Experimental Values ◽

The Impact ◽

Tracer Diffusion Coefficients ◽

Thermodynamic Factors

The impact of thermodynamic factors on deviation from linearity of diffusion path in the ternary system Cu-Fe-Ni is analyzed. For that the slope function of the diffusion path for the diffusion couples 65Ni30Cu5Fe –29.5Ni16.5Cu54Fe, 49.5Ni50.5Fe – 51Ni49Cu and 84Cu16Ni – 50Ni50Fe, annealed at 1000°C for 196h, were calculated by an approximate equation using only thermodynamic data. Results of the calculation were compared with the values of the slope function obtained directly from experimental data. It is shown that despite of the fact that the tracer diffusion coefficients of the components in the system Cu-Fe-Ni are not equal the coincidence between the calculated and experimental values of the slope function is remarkable. This allows us to conclude that at least in this case the deviation of the diffusion path from linearity depends mainly on the thermodynamic properties of the system.

Download Full-text

THE NATURAL PARTIAL ORDER ON LINEAR SEMIGROUPS WITH NULLITY AND CO-RANK BOUNDED BELOW

Bulletin of the Australian Mathematical Society ◽

10.1017/s0004972714000793 ◽

2014 ◽

Vol 91 (1) ◽

pp. 104-115 ◽

Cited By ~ 1

Author(s):

SUREEPORN CHAOPRAKNOI ◽

TEERAPHONG PHONGPATTANACHAROEN ◽

PONGSAN PRAKITSRI

Keyword(s):

Semigroup Forum ◽

Partial Order ◽

Lower Bounds ◽

Partial Orders ◽

Natural Partial Order ◽

Linear Transformations ◽

Bounded Below

AbstractHiggins [‘The Mitsch order on a semigroup’, Semigroup Forum 49 (1994), 261–266] showed that the natural partial orders on a semigroup and its regular subsemigroups coincide. This is why we are interested in the study of the natural partial order on nonregular semigroups. Of particular interest are the nonregular semigroups of linear transformations with lower bounds on the nullity or the co-rank. In this paper, we determine when they exist, characterise the natural partial order on these nonregular semigroups and consider questions of compatibility, minimality and maximality. In addition, we provide many examples associated with our results.

Download Full-text

Modeling country risk ratings using partial orders

European Journal of Operational Research ◽

10.1016/j.ejor.2005.06.040 ◽

2006 ◽

Vol 175 (2) ◽

pp. 836-859 ◽

Cited By ~ 32

Author(s):

P.L. Hammer ◽

A. Kogan ◽

M.A. Lejeune

Keyword(s):

Country Risk ◽

Partial Orders

Download Full-text

Frequent Closed Partial Orders Mining in Sequences

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.846-847.1304 ◽

2013 ◽

Vol 846-847 ◽

pp. 1304-1307

Author(s):

Ye Wang ◽

Yan Jia ◽

Lu Min Zhang

Keyword(s):

Sequence Data ◽

Real Data ◽

Partial Orders ◽

Hard Problem ◽

Important Data ◽

Data Set ◽

Pruning Algorithm ◽

Equal Chance ◽

Np Hard Problem ◽

General Sequences

Mining partial orders from sequence data is an important data mining task with broad applications. As partial orders mining is a NP-hard problem, many efficient pruning algorithm have been proposed. In this paper, we improve a classical algorithm of discovering frequent closed partial orders from string. For general sequences, we consider items appearing together having equal chance to calculate the detecting matrix used for pruning. Experimental evaluations from a real data set show that our algorithm can effectively mine FCPO from sequences.

Download Full-text