Yang D.,University of Foreign Languages
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014
The previous studies on the causative alternation can be divided into the derivational and non-derivational approaches. The cross-linguistic facts show that the former fails to provide an adequate account of the relationship between the causative and unaccusative alternates. However, the latter approach also faces some problems. In this paper we abandon the former and make a revision to the latter based on the theory proposed by Huang et al.(2009). We argue that the causative and unaccusative variants share one and the same root which conceptualizes different types of events and selects different eventive light verbs, resulting in two lexical items with different ways of argument realization. © Springer International Publishing Switzerland 2014
Liu Q.,National University of Defense Technology |
Zhao G.-S.,University of Foreign Languages |
Wang X.-D.,National University of Defense Technology |
Zhou X.-M.,National University of Defense Technology
Ruan Jian Xue Bao/Journal of Software | Year: 2014
Cognitive radio technology is regarded as the most promising technique to solve the problem of ultra-low utilization efficiency of wireless spectrum resources. Based on this technology, cognitive radio networks (CRNs) effectively improve utilization efficiency of licensed spectrum through dynamic spectrum access. However, the resultant dynamic channel availability significantly increases the difficulty in networking for CRNs. Rendezvous aims at providing common media for communication between users, which is the foundation of networking in wireless networks. This paper introduces the basic concept and characteristics of rendezvous in CRNs and dissect the challenges and concerned performance metrics in design of rendezvous schemes. According to the proposed classification criteria and system models, the related research work on rendezvous schemes are analyzed in depth. Finally, open problems in rendezvous schemes design are discussed to point out future research trends and focuses. © Copyright 2014, Institute of Software, the Chinese Academy of Science. All rights reserved.
Wang Y.,University of Foreign Languages |
Ding L.,University of Foreign Languages |
Ren Q.,University of Foreign Languages |
Yang C.,National University of Defense Technology
Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology | Year: 2015
The algorithm of extracting quadratic expressions in the pre-processing phase of cube attack with quadratic test was enhanced to optimize the attack efficiency. The variation of secret keys was introduced into cube attack, which makes the model much more flexible. At the same time, with the help of the trade-off between time and space, the complexity of extracting quadratic terms was reduced by storing the results of the constant and linear terms. The improved method was applied to the simplified PRESENT and Trivium algorithms and it turns out that the attack efficiency is enhanced obviously. ©, 2015, National University of Defense Technology. All right reserved.
Zhang F.,University of Foreign Languages |
Liu W.,University of Foreign Languages |
Liu W.,National University of Defense Technology |
Bi Y.,University of Foreign Languages
International Journal on Smart Sensing and Intelligent Systems | Year: 2013
The problem of WordNet-based ontology construction was widely investigated and many effective methods have been proposed in China. The utilizations of the hierarchy structure of WordNet, the digraph structure of WordNet and auxiliary resources are main measures in the methods. Usually, the methods are facing three fundamental difficulties, the computation of semantic similarity, the construction of core ontology and the development of auxiliary resources. Through our reviews of previous researches, we find several inadequacies such as low utilization ratio of WordNet and the lack of standardized evaluation and give some suggestions for future works.
Zhao G.-S.,University of Foreign Languages |
Cheng Q.-F.,University of Foreign Languages |
Sun Y.-L.,National University of Defense Technology
Tongxin Xuebao/Journal on Communications | Year: 2015
To construst a minimum-cost network hardening (MCNH) scheme in large-scale network, a stochastic loose optimize strategy based algorithm (MCNHA-SLOS) was proposed, and its effectiveness was analyzed. MCNHA-SLOS was a near-optimal approximation algorithm, which could achieve iterative computations in the array of sparse spaces of the whole plan space, so that the near-optimal scheme must exist in the low cost plan space. Instantiation analysis and experimental results show that the MCNHA-SLOS algorithm to be efficient, precision controllable and asymptotically optimal, and thus very applicable for large-scale network. ©, 2015, Editorial Board of Journal on Communications. All right reserved.