THERMODYNAMICS AND PHASE EQUILIBRIUM OF Cu－Y－O，Cu－Y－S，Cu－Y－O－S LIQUID SOLUTIONS

ＴＨＥＲＭＯＤＹＮＡＭＩＣＳＡＮＤＰＨＡＳＥＥＱＵＩＬＩＢＲＩＵＭＯＦＣｕ－Ｙ－Ｏ，Ｃｕ－Ｙ－Ｓ，Ｃｕ－Ｙ－Ｏ－ＳＬＩＱＵＩＤＳＯＬＵＴＩＯＮＳ￥Ｄｕ，Ｔｉｎｇ；Ｌｉ，Ｇｕｏｄｏｎｇ（ＣｅｎｔｒａｌＩｒｏｎａｎｄＳｔｅｅｌＲｅｓｅａｒｃｈｉｎｓｔｉｔ...     

Intermetallic phase formation in directionally solidified Al−Si−Fe alloy

The present study has been undertaken to better understand the solidification behavior of Al−Si−Fe alloys containing 7wt.% Si and 0.9wt.% Fe, with particular regard to the formation of phase during controlled solidification and influence of growth rates on intermetallic phase selection. The alloys studied were Al-7Si-0.9Fe alloys, which were produced by a modified Bridgman solidification arrangement. These alloys were solidified unidirectionally with different growth rates (1–30mm/min). The solidified microstructure of these alloys consists of the growth of primary aluminum and multiple second phase reactions.     

Direct 5-axis tool-path generation from point cloud input using 3D biarc fitting

In reverse engineering, geometrical information of a product is obtained directly from a physical shape by a digitizing device. To fabricate the product, manufacturing information (usually tool-path) must be generated from a CAD model. The data digitized must be processed and in most cases, a surface model is constructed from them using some of the surface fitting technologies. However, these technologies are usually complicated and the process for constructing a surface patch from a massive digitizing data is time-consuming. To simplify the process for getting tool-path information, a simple algorithm is proposed in this paper. The algorithm is used to generate a 5-axis machining tool-path. Instead of implementing any complicated surface fitting techniques, a direct method is proposed for constructing three-dimensional (3D) triangular mesh from the digitizing data with the mesh points considered as the tool contact locations. Depending on the locations of the points digitized, a decimation procedure is applied such that some of the digitizing data will be filtered out. Then, the tool axis orientations which must be determined in 5-axis tool-path are calculated and the tool center locations are determined accordingly. A 3D biarc fitting technique is applied for all the tool center locations so that a complete 5-axis tool-path is obtained.     

Effects of the Si/Al atomic ratio on the activity of Cu-ZSM-5 catalysts for nitric oxide decomposition

A review of literature data for nitric oxide decomposition over Cu-ZSM-5 catalysts leads us to conclude that the turnover frequency depends on the Si/Al atomic ratio in a way opposite to the trend suggested by Iwamoto and co-workers and considered correct by Shelef in a recent letter published in this Journal. In particular we show that the turnover frequency increases with the number of Al atoms per unit cell (i.e. decreasing the Si/Al atomic ratio). This result suggests that the most active sites for NO decomposition over Cu-ZSM-5 catalysts may contain two close copper ions.     

Ship detection based on multi-scale weighted fusion

Ship surveillance plays an important role in ensuring the safety of maritime transportation and navigation. Due to the influence of factors such as waves and special weather, the existing detection methods still cannot balance the accuracy, speed and the parameters of the model in the changeable and complex marine environment. To solve this problem, this paper proposes an improved real-time method based on YOLOv5, which has few parameters and achieves high detection accuracy with little memory and computation cost. Collaborative Attention (CA) mechanism is added to the network structure, which enables the model to more accurately locate and identify target regions. We also design a Spatial Pyramid Pooling module (SPP) and a weighted pyramid network called Bidirectional Feature Pyramid Network (BiFPN) based on the characteristics of the ships to better fuse feature information. Transformer encoder is introduced to capture long-distance dependencies and preserve global and local features to the greatest extent. Furthermore, the ability of our proposed structure to localize objects at each stage is improved through integrating the output of multiple modules. The experimental results show that, the comprehensive performance of this method is better than the existing technology in ship detection on different evaluation criteria.     

Production of perovskite-like La1−xCaxMnO3+δ ferromagnetic thin films by electrochemical reduction

Ferromagnetic and perovskite-like thin films (<1m) of La1–xCaxMnO3+ have been routinely prepared by heat treatment of an amorphous La–Ca–Mn precursor. The precursor was electrodeposited cathodically in the absence of oxygen and water onto polished silver substrates from a nonaqueous solution of the components' nitrates. Analysis by X-ray diffraction and SQUID magnetometry shows these materials exhibit the appropriate structural and magnetic phases indicative of colossal magnetoresistance.     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Necessary optimality conditions for fuzzy variational problems

The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets.