检索结果-南通市图书馆

Structure-Based Deadlock Checking of Asynchronous Circuits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of computer Science & Technology 2011年第6期26卷 1031-1040页

作者：任洪广王志英 Doug Edwards school of computer National University of Defense Technology CCF ACM IEEE school of computer Science University of Manchester

It is important to verify the absence of deadlocks in asynchronous circuits. Much previous work relies on a reachability analysis of the circuits＇ states, with the use of binary decision diagrams （BDDs） or Petri nets to model the behaviors of circuits. This paper presents an alternative approach focusing on the structural properties of well-formed asynchronous circuits that will never suffer deadlocks. A class of data-driven asynchronous pipelines is targeted in this paper, which can be viewed as a network of basic components connected by handshake channels. The sufficient and necessary conditions for a component network consisting of Steer, Merge, Fork and Join are given. The slack elasticity of the channels is analyzed in order to introduce pipelining. As an application, a deadlock checking method is implemented in a syntax-directed asynchronous design tool Team The proposed method shows a great runtime advantage when compared against previous Petri net based verification tools.

关键词： asynchronous pipeline data-driven deadlock verification

CPL:Detecting Protein Complexes by Propagating Labels on Protein-Protein Interaction Network

在线全文

学校读者我要写书评

暂无评论

Journal of computer Science & Technology 2014年第6期29卷 1083-1093页

作者：代启国郭茂祖刘晓燕滕志霞王春宇 school of computer Science and Technology Harbin Institute of Technology school of Information and computer Engineering Northeast Forestry University

Proteins usually bind together to form complexes, which play an important role in cellular activities. Many graph clustering methods have been proposed to identify protein complexes by finding dense regions in protein-protein interaction networks. We present a novel framework （CPL） that detects protein complexes by propagating labels through interactions in a network, in which labels denote complex identifiers. With proper propagation in CPL, proteins in the same complex will be assigned with the same labels. CPL does not make any strong assumptions about the topological structures of the complexes, as in previous methods. Tile CPL algorithm is tested on several publicly available yeast protein-protein interaction networks and compared with several state-of-the-art methods. The results suggest that CPL performs better than the existing methods. An analysis of the functional homogeneity based on a gene ontology analysis shows that the detected complexes of CPL are highly biologically relevant.

关键词： protein complex detection label propagation protein-protein interaction graph clustering bioinformatics

LSTM-based argument recommendation for non-API methods

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第9期63卷 5-26页

作者： Guangjie LI Hui LIU Ge LI Sijie SHEN Hanlin TANG school of computer Science and Technology Beijing Institute of Technology school of Electronics Engineering and computer Science Peking University

Automatic code completion is one of the most useful features provided by advanced IDEs. Argument recommendation, as a special kind of code completion, is widely used as well. While existing approaches focus on argument recommendation for popular APIs, a large number of non-API invocations are requesting for accurate argument recommendation as well. To this end, we propose an LSTM-based approach to recommending non-API arguments instantly when method calls are typed in. With data collected from a large corpus of open-source applications, we train an LSTM neural network to recommend actual arguments based on identifiers of the invoked method, the corresponding formal parameter, and a list of syntactically correct candidate arguments. To feed these identifiers into the LSTM neural network, we convert them into fixed-length vectors by Paragraph Vector, an unsupervised neural network based learning algorithm. With the resulting LSTM neural network trained on sample applications, for a given call site we can predict which of the candidate arguments is more likely to be the correct one. We evaluate the proposed approach with tenfold validation on 85 open-source C applications. Results suggest that the proposed approach outperforms the state-of-the-art approaches in recommending non-API arguments. It improves the precision significantly from 71.46% to 83.37%.

关键词： argument recommendation LSTM deep learning non-API

Finger vein recognition based on deformation information

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第5期61卷 156-170页

作者： Xianjing MENG Xiaoming XI Gongping YANG Yilong YIN school of computer Science and Technology Shandong University of Finance and Economics school of computer Science and Technology Shandong University

The measurement of the vessel pattern in fingers is a superior method for identifying individuals owing to its convenience and the security it offers. We introduce in this paper a new perspective to accomplish finger vein recognition. This method, which regards deformations as discriminative information, is distinct from existing methods that attempt to prevent the influence of deformations. The proposed technique is based on the observation that regular deformation, which corresponds to a posture change, can only exist in genuine vein patterns. In terms of methodology, we incorporate optimized matching to generate pixelbased 2 D displacements that correspond to deformations. The texture of uniformity extracted from the displacement fields is taken as the final matching score. Evaluated on two publicly available databases,Poly U and SDU-MLA, extensive experiments demonstrated that the discriminability of the new feature derived from deformations is preferable. The equal error rate(EER) achieved is the lowest compared to that of state-of-the-art techniques.

关键词： finger vein recognition deformations optimized matching displacement texture of uniformity

Mobile crowd photographing: another way to watch our world

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第8期59卷 250-274页

作者： Huihui CHEN Bin GUO Zhiwen YU Xingshe ZHOU school of computer Science Northwestern Polytechnical University school of computer and Information Engineering Luoyang Institute of Science and Technology

People take and share pictures in the mobile network. Through collecting and computing pictures with built-in contexts, Mobile Crowd Photographing(MCP) can give us a new way to see this world. This paper focuses on participatory picture collection, which is one way of MCP. Three characteristic issues of MCP are proposed, and then our recent work to solve these issues will also be demonstrated.

关键词： mobile crowd photographing task-driven data collection task definition task assignment data selection

H_∞ couple-group consensus of stochastic multi-agent systems with fixed and Markovian switching communication topologies

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2019年第1期28卷 313-322页

作者： Muyun Fang Cancan Zhou Xin Huang Xiao Li Jianping Zhou school of computer Science and Technology Anhui University of Technology school of computer Science and Technology Huaibei Normal University

The paper addresses the issue of H_∞ couple-group consensus for a class of discrete-time stochastic multi-agent systems via output-feedback control. Both fixed and Markovian switching communication topologies are considered. By employing linear transformations, the closed-loop systems are converted into reduced-order systems and the H_∞ couplegroup consensus issue under consideration is changed into a stochastic H_∞ control problem. New conditions for the mean-square asymptotic stability and H_∞ performance of the reduced-order systems are proposed. On the basis of these conditions, constructive approaches for the design of the output-feedback control protocols are developed for the fixed communication topology and the Markovian switching communication topologies, respectively. Finally, two numerical examples are given to illustrate the applicability of the present design approaches.

关键词： multi-agent system couple-group consensus output feedback control switching topologies

Partition-Based Online Aggregation with Shared Sampling in the Cloud

在线全文

学校读者我要写书评

暂无评论

Journal of computer Science & Technology 2013年第6期28卷 989-1011页

作者：王宇翔罗军舟宋爱波东方 school of computer Science and Engineering Southeast University CCF ACM IEEE school of computer Science and EngineeringSoutheast University

Online aggregation is an attractive sampling-based technology to response aggregation queries by an estimate to the final result, with the confidence interval becoming tighter over time. It has been built into a MapReduce-based cloud system for big data analytics, which allows users to monitor the query progress, and save money by killing the computation early once sufficient accuracy has been obtained. However, there are several limitations that restrict the performance of online aggregation generated from the gap between the current mechanism of MapHeduce paradigm and the requirements of online aggregation, such as： 1） the low sampling efficiency due to the lack of consideration of skewed data distribution for online aggregation in MapReduce, and 2） the large redundant I/O cost of online aggregation caused by the independent job execution mechanism of MapReduce. In this paper, we present OLACloud, a MapReduce-based cloud system to well support online aggregation for different data distributions and large-scale concurrent query processing. We propose a content-aware repartition method with a fair-allocation block placement strategy to increase the sampling efficiency and guarantee the storage and computation load balancing simultaneously. We also develop a shared sampling method to share the sampling opportunities among multiple queries to reduce redundant I/O cost. We also implement OLACloud in Hadoop, and conduct an extensive experimental study on the TPC-H benchmark for skewed data distribution. Our results demonstrate the efficiency and effectiveness of OLACloud.

关键词： cloud MapReduce partition online aggregation shared sampling

Cryptanalysis of Public Key Cryptosystems Based on Non-Abelian Factorization Problems

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2016年第3期21卷 344-351页

作者： Jinhui Liu Aiwan Fan Jianwei Jia Huanguo Zhang Houzhen Wang Shaowu Mao computer school of Wuhan University Wuhan 430072China computer school of Pingdingshan University Pingdingshan 467001China

Advances in quantum computers threaten to break public-key cryptosystems （e.g., RSA, ECC, and EIGamal）, based on the hardness of factoring or taking a discrete logarithm. However, no quantum algorithms have yet been found for solving certain mathematical problems in non-commutative algebraic structures. Recently, two novel public-key encryption schemes, BKT-B cryptosystem and BKT-FO cryptosystem, based on factorization problems have been proposed at Security and Communication Networks in 2013. In this paper we show that these two schemes are vulnerable to structural attacks and linearization equations attacks, and that they only require polynomial time complexity to obtain messages from associated public keys. We conduct a detailed analysis of the two attack methods and show corresponding algorithmic descriptions and efficiency analyses. In addition, we provide some improvement suggestions for the two public-key encryption schemes.

关键词： cryptography post-quantum cryptography public key encryption cryptanalysis linear equations

Cryptanalysis of an MOR cryptosystem based on a finite associative algebra

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第3期59卷 137-145页

作者： Wanqing WU Huanguo ZHANG Houzhen WANG Shaowu MAO Shuomei WU Haiqing HAN computer school of Wuhan University computer Department Shijiazhuang University school of Mathematics and Physics Hubei Polytechnic University

The Shor algorithm is effective for public-key cryptosystems based on an abelian group. At CRYPTO 2001, Paeng（2001） presented a MOR cryptosystem using a non-abelian group, which can be considered as a candidate scheme for post-quantum attack. This paper analyses the security of a MOR cryptosystem based on a finite associative algebra using a quantum algorithm. Specifically, let L be a finite associative algebra over a finite field F. Consider a homomorphism φ : Aut（L） → Aut（H） × Aut（I）, where I is an ideal of L and H ■ L/*** compute dim Im（φ） and dim Ker（φ）, and combine them by dim Aut（L） = dim Im（φ） + dim Ker（φ）. We prove that Im（φ） = Stab Comp（H,I）(μ + B;（H, I）) and Ker（φ）■ Z;（H, I）. Thus, we can obtain dim Im（φ）, since the algorithm for the stabilizer is a standard algorithm among abelian hidden subgroup algorithms. In addition,Z;（H, I） is equivalent to the solution space of the linear equation group over the Galois fields GF（p）, and it is possible to obtain dim Ker（φ） by the enumeration theorem. Furthermore, we can obtain the dimension of the automorphism group Aut（L）. When the map ? ∈ Aut（L）, it is possible to effectively compute the cyclic group ? and recover the private key a. Therefore, the MOR scheme is insecure when based on a finite associative algebra in quantum computation.

关键词： MOR cryptosystem cryptanalysis quantum algorithm finite associative algebra hidden subgroup problem stabilizer