Numerical study on thermal performance of TiO2, Fe3O4 and NiCr/engine oil in an inclined wavy pip

The essential intention of the existing article is to illustrate the effect of wall properties on flow and thermal behavior, through a sinusoidal inclined wavy pipe. To succeed this phenomena we assume a sinusoidal pipe consist of wavy surface, whose walls traveling down to its borders and located at an inclined position, moreover titanium dioxide (TiO₂), ferrosoferric oxide (Fe₃O₄) and nichrome (80% Ni and 20% Cr) are considered as nano-particles and unused engine oil is assumed as a base fluid. The arising mathematical equations for thermal and flow ratio with wall slip impact are solved by mathematica. Also, evaluate graphically the thermal and flow behavior of nanofluids for multi values of solid volume fractions (η), rigidity parameter (M₁), stiffness parameter (M₂), viscous damping parameter (M₃), Grashof number (G_r), slip parameter (β) and heat generation parameter (H) also discuss the streamlines for different values of solid volume fraction.     

煤直接液化油中混合酚的分离研究

利用分子筛择形特点，对煤直接液化油中的混合酚实施高效分离。本研究选取间甲酚和对甲酚作为分离煤直接液化油馏分段混合酚的模型化合物，采用化学液相沉积法对HZSM-5吸附剂的孔口结构进行改变，分析分子筛硅铝比及颗粒粒径对模型化合物间甲酚和对甲酚吸附分离性能的影响，以获得高性能固相吸附剂，并将其应用于180-190℃馏分段混合酚分离。结果表明，当分子筛硅铝比为25、粒径为3-5 μm时，分子筛的孔口结构调节效果最优；当正硅酸乙酯的最小用量为0.2 mL/g时，固相吸附剂的吸附量为0.03 g/g，对甲酚选择性高于95%。由于外表面沉积物对吸附剂的孔口结构变化，导致对甲酚选择性的提高。进一步采用HZSM-5（1）吸附剂对真实煤直接液化油混合酚的分离中发现，苯酚和对甲酚的选择性均达到100%。     

Morphologically controlled synthesis of 1-dimensional selenium dioxide and study of its application as catalyst for diesel fuel additive

In this research work, selenium dioxide (SeO₂) nanorods have been prepared by a solvothermal method in which a strong reducing agent (NaBH₄) was used to reduce precursor salt into SeO₂ nanorods. X-ray diffraction (XRD) technique was applied to observe the crystal structure which confirmed its tetragonal geometry. Moreover, morphology and particle size were studied by scanning electron microscopy (SEM). SEM fully described the 1-dimensional morphology of SeO₂ nanorods which then arranged themselves to create a 3-dimensional flower-like structure with an average particle size of 50 nm. Also, the catalytic activity of SeO₂ nanorods as diesel-additive was studied by defining different parameters such as fire and flash points, calorific value, cloud and pour points, specific gravity, and kinematic viscosity. Subsequently, SeO₂ nanorods proved to be an excellent diesel additive due to higher total heat content and lower value of kinematic viscosity which enhances the better performance of the diesel engine.     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。     

一种基于图论与熵的专家判断客观可信度的确定方法

本文给出一种群决策中确定专家判断可信度的方法，其主要思路是首先通过图论中最小生成树的方法提取专家判断矩阵的全部信息，其次，使用相对熵指标确定获得专家判断的最终结果，并同时衡量专家自身判断的统一程度，从而确定专家判断的相对客观可信度。最后，文章给出一个典型的算例以说明该方法的可行性和有效性。     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.