Growth and morphology of nanometer LiMn2O4 powder

The growth of Li_1+xMn₂O₄ via detonation reaction was investigated with respect to the presence of an energetic precursor, such as the metallic nitrate and the degree of confinement of the explosive charge. The detonation products were characterized by scanning electron microscopy. Powder X-ray diffraction and transmission electron microscopy were used to characterize the products. Li_1+xMn₂O₄ with 1-2 μm spherical morphology and more uniform secondary particles, but with smaller primary particles of diameters from 20 to 60 nm and a variety of morphologies were found. The oxides produced by this cheap method affirmed the validity of detonation synthesis of nano-size powders.     

透过节能减排政策和制度看中国节能减排

随着世界人口的增长、现代工业的高速发展,不可再生资源遭到掠夺式开采、能源消耗几何级增长、环境污染程度大大超出了生态系统的承受能力。如何解决能源短缺与污染严重对经济和社会发展的影响已经成为世界性的难题,我国同样如此。因此,加强对节能减排体系的研究,对我国节能减排工作的开展具有非常重要的意义。对我国节能减排的政策和制度进行剖析,指出了我国节能减排政策、制度以及做法中存在的问题,并提出解决的方法。     

Lattice-based key exchange on small integer solution problem

In this paper, we propose a new hard problem, called bilateral inhomogeneous small integer solution （Bi-ISIS）, which can be seen as an extension of the small integer solution problem on lattices. The main idea is that, instead of choosing a rectangle matrix, we choose a square matrix with small rank to generate Bi-ISIS problem without affecting the hardness of the underlying SIS problem. Based on this new problem, we present two new hardness problems： computational Bi-ISIS and decisional problems. As a direct application of these problems, we construct a new lattice-based key exchange （KE） protocol, which is analogous to the classic Diffie- Hellman KE protocol. We prove the security of this protocol and show that it provides better security in case of worst-case hardness of lattice problems, relatively efficient implementations, and great simplicity.     

Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks

In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.     

The method of fundamental solutions for problems in static thermo-elasticity with incomplete boundary data

An inverse problem in static thermo-elasticity is investigated. The aim is to reconstruct the unspecified boundary data, as well as the temperature and displacement inside a body from over-specified boundary data measured on an accessible portion of its boundary. The problem is linear but ill-posed. The uniqueness of the solution is established but the continuous dependence on the input data is violated. In order to reconstruct a stable and accurate solution, the method of fundamental solutions is combined with Tikhonov regularization where the regularization parameter is selected based on the L-curve criterion. Numerical results are presented in both two and three dimensions showing the feasibility and ease of implementation of the proposed technique.     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

Distributed Symbolic Bounded Property Checking

In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifies larger models and returns results faster than the sequential version.The core algorithm distributes partitions of the state set to computation nodes after reaching a threshold size. The nodes proceed with image computation on the nodes asynchronously. The main scalability problem of this scheme is the overlap of state set partitions. We present static and dynamic overlap reduction techniques.     

Solution of impulsive boundary value problems on infinite intervals

In this paper, the upper and lower solution method and monotone iterative technique are employed to study the boundary value problem for a class of first-order impulsive ordinary differential equations with Carathéodory condition on infinite intervals. Several existence theorems are obtained.     

工程机械中液压管路件常见故障原因分析及解决办法

液压管路件作为液压系统的一个重要组成部分,在实际应用中经常会产生诸如渗漏、开裂等故障,就工程机械中常见液压管路件的故障产生原因进行了分析,并提出相应的解决办法。     

Starting solutions for some unsteady unidirectional flows of a second grade fluid

Exact solutions corresponding to the motions of a second grade fluid, due to the cosine and sine oscillations of an infinite flat plate as well as those induced by an oscillating pressure gradient are determined by means of the Fourier sine transforms. These solutions, presented as sum of the steady-state and transient solutions, satisfy both the governing equations and all associate initial and boundary conditions. In the special case when α₁ → 0, they reduce to those for a Navier-Stokes fluid.