Distribution characteristics of soil organic matter and total nitrogen on the Yajiageng vertical belt,Gongga Mountain around the Dadu River banks

Distribution characteristics of soil organic matter（SOM） and total nitrogen（TN） were studied in different plant communities of the Yajiageng vertical belt in Gongga Mountain around the Dadu River banks. The results show： （1） the contents of SOM and TN of the plant communities gradually decreased with the following order： subalpine coniferous forest （3 027 m）, subalpine meadow （3 873 m）, coniferous broadleaved mixed forest（2 737 m）, subalpine shrub（3 565 m） and treeline（3 564 m）. （2） With soil profile depth increasing, the contents of SOM and TN gradually decreased. For different vegetation types, the contents of SOM and TN in sub-alpine coniferous forest were higher than that of other vegetational types. （3）The ratio of the content of carbon to the content of total nitrogen （Cc/CTN）WaS 13.5-27.6, which was relatively lower than the appropriate Cc/CTN of 25-30, and indicated that the soil in favor of the organic matter decomposed and nutrients released. Cc/CTN in the soil had no correlation with sea level altitude. However, its distribution in the soil x, aried with different vegetation types. （4） Nitrogen in SOM existed mainly in the form of organic nitrogen, and Cc/CTN in the soil was not obvious correlated with SOM and TN.     

Query expansion based on semantics and statistics in Chinese question answering system

In Chinese question answering system, because there is more semantic relation in questions than that in query words, the precision can be improved by expanding query while using natural language questions to retrieve documents. This paper proposes a new approach to query expansion based on semantics and statistics Firstly automatic relevance feedback method is used to generate a candidate expansion word set. Then the expanded query words are selected from the set based on the semantic similarity and seman- tic relevancy between the candidate words and the original words. Experiments show the new approach is effective for Web retrieval and out-performs the conventional expansion approaches.     

Formal analysis on an extended security model for database systems

In order to develop highly secure database systems to meet the requirements for class B2, the BLP （Bell-LaPudula） model is extended according to the features of database systems. A method for verifying security model for database systems is pro- posed. According to this method, an analysis by using Coq proof assistant to ensure the correctness and security of the extended model is introduced. Our formal security model has been verified secure. This work demonstrates that our verification method is effective and sufficient.     

EXISTENCE AND UNIQUENESS AND STABILITY OF SOLUTIONS FOR STOCHASTIC IMPULSIVE SYSTEMS

This paper studies the existence, uniqueness, and stability of solutions for stochastic impulsive systems. By employing Lyapunov-like functions, some sufficient conditions of the global existence, uniqueness, and stability of solutions for stochastic impulsive systems are established. Furthermore, the results are specialized to the case of linear stochastic impulsive systems. Finally, some examples are given to illustrate the applications of our theory.     

A novel approach of hybrid genetic optimization with elite ant colony: Application in the modulation recognition

A novel approach (HGO-EAC) for hybrid genetic op-timization (GO) with elite ant colony (EAC) is proposed for the automatic modulation recognition of communication signals,through which we improve the basic ant colony algorithms by referencing elite strategy and present a new fusion strategy for genetic optimization and elite ant colony. This approach is used to train the neural networks as the classifier for modulation. Simula-tion results indicate good performance on an additive white Gaus-sian noise (AWGN) channel,with recognition rate reaching to 70% especially for CW even at signal-to-noise ratios as low as 5 dB. This approach can achieve a high recognition rate for the typical modulations such as CW,4ASK,4FSK,BPSK,and QAM16. Test result shows that it has better performance than BP algorithm and basic ant colony algorithms by achieving faster training and stronger robustness.     

Soundness analysis of compositional model of time-based petri nets

Workflow management systems are widely used in improving the efficiency of business processes.To develop a workflow management system is the key to workflow modeling.In this paper,the compositional time net is presented to model workflow processes on the basis of the analyzing methods of time Petri nets and workflows,and to describe the static relationships and the dynamic semantics of the task of multiple workflow composition.The paper puts more emphasis on checking the soundness of composed workflow,at the same time,combinational problems of non-conditional structure of the compositional time net are introduced and analyzed.A sufficient and necessary condition for determining the soundness of compositional nets is obtained.     

A new process and framework for direct anonymous attestation based on symmetric bilinear maps

For the problem of the original direct anonymous attestation (DAA) scheme’s complexity and great time consumption, a new DAA scheme based on symmetric bilinear pairings is presented, which gives a practical solution to ECC-based TPM in protecting the privacy of the TPM. The scheme still includes five procedures or algorithms: Setup, Join, Sign, Verify and Rogue tagging, but gets rid of zero-knowledge proof and takes on a new process and framework, of which the main operations are addition, scalar multiplication and bilinear maps on supersingular elliptic curve systems. Moreover, the scheme adequately utilizes the properties of bilinear maps as well as the signature and verification of the ecliptic curve system itself. Compared with other schemes, the new DAA scheme not only satisfies the same properties, and shows better simplicity and high efficiency. This paper gives not only a detailed security proof of the proposed scheme, but also a careful performance analysis by comparing with the existing DAA schemes.     

Research of technique for synthesizing carbonyl diethyl malonate

Diethyl malonate being an initial raw material,processed with chlorination-replacement-desalination-vacuum rectification,is used to produce carbonyl diethyl malonate.An experiment for optimization determines that the best reaction condition was:① reaction for 7 h at 10 ℃ with mole-ratio being 2.4︰1 between chloride and raw material(diethyl malonate);② reaction for 4.5 h at 118 ℃ with mole-ratio being 1.2︰1 between the anhydrous sodium acetate and intermediate Ⅰ.The final product carbonyl diethyl malonate recovery ratio reaches up to as high as 79.12% with a purity of 96.4%,which meets the market requirement.This synthesis technique has the advantages of simple process,moderate reaction conditions,high yield and low cost,being suitable for industrial scale production.     

A representation of sl(2;C) on clifford algebra of even dimension

Under the foundation of Hermitean Clifford setting,we define the fundamental operators for complex Clifford algebra valued functions,obtain some properties of these operators,and discuss a representation of sl(2;C) on Clifford algebra of even dimension.     

Activity sequence modes for Web services and verifications

Behavior requirement expression and its satisfiability verification for composite Web services is one of the ongoing issues in service computing.In this paper,the concept of behavior specifications based on activity sequence is proposed to express one kind of behavioral requirements for composite Web services.Its basic element is activity sequence.The method to express such behavioral requirements by behavioral modes is presented.Five behavioral modes used in this method are adopted.Through mapping modes to Labeled Transition Systems(LTSs),these modes are encoded with exact operation semantics.Then,the sufficient and necessary conditions as well as the checking algorithm for satisfiability of behavioral modes are given.Finally,an example analysis is presented.The result indicates that the behavioral requirements based on activity sequence are more suitable for the case of composite Web service than those based on activity or scenario.The behavioral modes expressions are concise and the satisfiability checking is effective by the given algorithm.