Effects of Fe concentration on microstructure and corrosion of Mg-6Al-1Zn-xFe alloys for fracturing balls applications

Mg-6Al-1Zn-xFe (x = 0, 1, 3, 5 and 7 wt%) alloys were prepared by powder metallurgy and followed by hot extrusion. Majority of Fe element exists as insoluble particles in the alloys. The as-extruded alloys showed higher degradable rates but less stable mechanical properties than as-annealed alloys. Corrosion rate of all the alloys increased with increasing Fe concentration, reaching 2.4 mL cm⁻² h^-1. 0.2% yield strength of all the alloys was higher than 150 MPa. In short, Mg-6Al-1Zn-xFe alloys have an attractive combination of corrosion and mechanical properties, which holds a bright future for fracturing balls applications.     

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.     

全固态裸露式Ag／AgCl参比电极的研制及应用

该文报道了一种树脂接界全固态裸露式Ag／Agcl参比电极,勿需电镀氯化,制备工艺简单,性能稳定,是对电解型Ag／AgCl参比电极的一大改进。可代替饱和甘汞电极作为通用型参比电极,同时可减少汞对环境所造成的二次污染,在温度大于75℃时仍能保持良好性能,突破了甘汞电极的局限。     

A comparative study of two techniques for improving power‐handling capability of CMOS T/R switches

This article proposes an asymmetric topology for transmit/receive (T/R) switches and more importantly presents a comparative study of both LC‐tuned and resistive body‐floating techniques for improving the power‐handling capability of the T/R switches in the same 0.18‐μm triple‐well CMOS. It is shown from simulations and measurements that the switches adopting either technique achieve comparable performances. For instance, the switch employing the LC‐tuned body‐floating technique exhibits insertion loss of 1.5 dB, isolation of 23.5 dB, and power‐handling capability of 22.5 dBm at 5.2 GHz, whereas the switch using the resistive body‐floating technique exhibits insertion loss of 1.3 dB, isolation of 24 dB, and power‐handling capability of 22.2 dBm, respectively. Therefore, one can conclude that the asymmetric topology with the resistive body‐floating technique is more suitable for designing T/R switches for wireless local area network applications as it consumes smaller silicon area. © 2010 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2010.     

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.     

Creating change and driving innovation in highly automated and lean organizations: The Temporal Think Tank™ (T3™)

This paper introduces the concept of the temporal think tank™ (T3™), a temporary in-house research center, based on case studies with a highly automated global manufacturer and in various small-sized manufacture (SME's). The T3™ brings individuals from across the organization together in a team setting in which they are charged to look at the future, develop their decision-making skills, and use entrepreneurial thinking to incubate new processes and/or products. After an appropriate time in the temporal think tank™, the individuals are asked to return to their regular positions to implement the best practices and best ideas and doing so spur the organization forward. At intervals, the temporal think tanks™ can be reconvened, or reconstituted with new participants. This approach prepares technology champions for the SME, who can return to the organization with a fresh outlook and renewed energy to keep the enterprise at the peak of efficiency and effectiveness.     

Analysis of microwave brightness temperature of lunar surface and inversion of regolith layer thickness:Primary results of Chang-E 1 multi-channel radiometer observation

In China’s first lunar exploration project, Chang-E 1 (CE-1), a multi-channel microwave radiometer was aboard the satellite, with the purpose of measuring microwave brightness temperature from lunar surface and surveying the global distribution of lunar regolith layer thickness. In this paper, the primary 621 tracks of swath data measured by Chang-E 1 microwave radiometer from November 2007 to February 2008 are collected and analyzed. Using nearest neighbor interpolation based on the sun incidence angle in ...     

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.