检索结果-南通市图书馆

complexity theory, Emergence, and Translation： Educating Translators as Agents of Human Interaction in a Complex Society

在线全文

学校读者我要写书评

暂无评论

Sino-US English Teaching 2013年第9期10卷 725-735页

作者： Kobus Marais University of the Free State Bloemfontein South Africa

This paper sets out to argue the relevance for translation studies of complexity theory. It endeavours to argue, though briefly, that translation can be conceptualized as an emergent concept. It then indicates how theories of emergence in social studies provide new scope to theorise agency. Lastly, it considers the implications of the conceptualization for translator education. The arguments put forward in this paper lay the foundation for a philosophy of translation, i.e., a meta-theory of translation in which translation is viewed both as emerging from particular complex human interactions such as language and as being co-determined by complex contextual factors.

关键词： translation studies complexity theory emergence translator pedagogy translator agency

A complexity theory Perspective on the Dynamics of Second Language Learning Strategies and the Theoretical Implications

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

海外英语 2021年第7期 269-271页

作者：黄智广江思华杨晓焱卢家惠罗嫦奔何小清五邑大学外国语学院五邑大学

This paper presents a qualitative study to investigate the dynamics in second language(L2)learning strategies under the guidance of the complexity theory.A group of Chinese undergraduate students studying at an international university in Thailand were selected as the research *** instruments include interviews,observations,records of participants’on-line chat and posts,and a research *** research findings indicate that the changes in the participants’strategies for learning English exhibit typical features of the complex *** study will provide implications for probing into the nature of L2 strategy and for applying complexity theory to future researches on L2 strategies.

关键词： second language learning strategies complexity theory complex system dynamics

The Constitute Mechanism of Shipping System Based on the theory of complexity

在线全文

学校读者我要写书评

暂无评论

The Constitute Mechanism of Shipping System Based on the The...

A complexity measure approach based on forbidden patterns and correlation degree

作者： WANG Hongzhi Qingdao Ocean Shipping Mariners College

The research for complexity of shipping transport system is an effective method to ensure the shipping transport *** complexity of shipping transport system is analyzed in the view of system theory and the system stru... 详细信息

关键词： shipping transport system coordination complexity theory

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Chinese Physics B 2010年第6期19卷 177-183页

作者：王福来 Department of Mathematics and Statistics Zhejiang University of Finance and Economics

Based on forbidden patterns in symbolic dynamics, symbolic subsequences are classified and relations between forbidden patterns, correlation dimensions and complexity measures are studied. A complexity measure approach is proposed in order to separate deterministic （usually chaotic） series from random ones and measure the complexities of different dynamic systems. The complexity is related to the correlation dimensions, and the algorithm is simple and suitable for time series with noise. In the paper, the complexity measure method is used to study dynamic systems of the Logistic map and the Henon map with multi-parameters.

关键词： complexity theory forbidden words symbolic dynamics correlation dimensions

Efficient self-testing system for quantum computations based on permutations

在线全文

学校读者我要写书评

暂无评论

Chinese Physics B 2021年第4期30卷 61-73页

作者： Shuquan Ma Changhua Zhu Min Nie Dongxiao Quan State Key Laboratory of Integrated Services Networks Xidian UniversityXi'an 710071China Shaanxi Key Laboratory of Information Communication Network and Security Xi'an University of Posts&TelecommunicationsXi'an 710121China School of Communications and Information Engineering Xi'an University of Posts&TelecommunicationsXi'an 710121China

Verification in quantum computations is crucial since quantum systems are extremely vulnerable to the ***,verifying directly the output of a quantum computation is difficult since we know that efficiently simulating a large-scale quantum computation on a classical computer is usually thought to be *** overcome this difficulty,we propose a self-testing system for quantum computations,which can be used to verify if a quantum computation is performed correctly by *** basic idea is using some extra ancilla qubits to test the output of the *** design two kinds of permutation circuits into the original quantum circuit:one is applied on the ancilla qubits whose output indicates the testing information,the other is applied on all qubits(including ancilla qubits) which is aiming to uniformly permute the positions of all *** show that both permutation circuits are easy to *** this way,we prove that any quantum computation has an efficient self-testing *** the end,we also discuss the relation between our self-testing system and interactive proof systems,and show that the two systems are equivalent if the verifier is allowed to have some quantum capacity.

关键词： quantum computation verification self-testing systems complexity theory

A public key cryptosystem based on data complexity under quantum environment

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2015年第11期58卷 48-58页

作者： WU WanQing ZHANG HuanGuo WANG HouZhen MAO ShaoWu JIA JianWei LIU JinHui Computer School Wuhan University

Since the Shor algorithm showed that a quantum algorithm can efficiently calculate discrete logarithms and factorize integers, it has been used to break the RSA, EIGamal, and ECC classical public key cryptosystems. This is therefore a significant issue in the context of ensuring communication security over insecure channels. In this paper, we prove that there are no polynomial-size quantum circuits that can compute all Boolean functions(of which there are 22ncases) in the standard quantum oracle model. Based on this,we propose the notion of data complexity under a quantum environment and suggest that it can be used as a condition for post-quantum computation. It is generally believed that NP-complete problems cannot be solved in polynomial time even with quantum computers. Therefore, a public key cryptosystem and signature scheme based on the difficulty of NP-complete problems and the notion of data complexity are presented here. Finally,we analyze the security of the proposed encryption and signature schemes.

关键词： public key cryptography information security NP-complete problem complexity theory quantum computation

The Exchange Attack and the Mixture Differential Attack Revisited: From the Perspective of Automatic Evaluation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 19-29页

作者： Kexin QIAO Zhiyu ZHANG Zhongfeng NIU Liehuang ZHU School of Cyberspace Science and Technology Beijing Institute of Technology State Key Laboratory of Cryptology Institute of Information Engineering Chinese Academy of Sciences School of Cryptography University of Chinese Academy of Sciences

Recent results show that the differential properties within quadruples boom as a new inspiration in cryptanalysis of Advanced Encryption Standard(AES)-like constructions. These methods include the exchange attack proposed in Asiacrypt'19, the mixture differential attack proposed in To SC'18, etc., where the essential properties are obtained by manually scrutinizing the structures of the AES-like constructions. This paper presents a novel framework and an automatic tool based on mixed integer linear programming to search for mixture differential distinguishers for general constructions. This framework considers what equality patterns among quadruples can make a distinguisher and traces how the patterns propagate through cipher components with accurate probability *** this tool, a 5-round AES distinguishing attack with lower complexity and more 6-round distinguishing attacks in the chosen plaintext scenarios are deduced. We prove that no exchange-type or mixture differential distinguisher exists for 7 and above rounds AES if the details of the Sbox and Mix Columns matrix are not taken into account.

关键词： Ciphers Estimation Encryption Mixed integer linear programming complexity theory Standards

Reasoning and predicting POMDP planning complexity via covering numbers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2016年第4期10卷 726-740页

作者： Zongzhang ZHANG Qiming FU Xiaofang ZHANG Quan LIU School of Computer Science and Technology Soochow University Suzhou 215000 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000 China School of Electronic and Information Engineering Suzhou University of Science and Technology Suzhou 215000 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Partially observable Markov decision processes （POMDPs） provide a rich mathematical framework for planning tasks in partially observable stochastic environments. The notion of the covering number, a metric of capturing the search space size of a POMDP planning problem, has been proposed as a complexity measure of approximate POMDP planning. Existing theoretical results are based on POMDPs with finite and discrete state spaces and measured in the l1- metric space. When considering heuristics, they are assumed to be always admissible. This paper extends the theoretical results on the covering numbers of different search spaces, including the newly defined space reachable under inadmissible heuristics, to the ln-metric spaces. We provide a simple but scalable algorithm for estimating covering numbers. Experimentally, we provide estimated covering numbers of the search spaces reachable by following different policies on several benchmark problems, and analyze their abilities to predict the runtime of POMDP planning algorithms.

关键词： POMDP planning complexity theory covering number search space

SAT-Based Automatic Searching for Differential and Linear Trails: Applying to CRAX

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 72-79页

作者： Yiyi HAN Caibing WANG Zhongfeng NIU Lei HU State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences

Boolean satisfiability problem（SAT） is now widely applied in differential cryptanalysis and linear cryptanalysis for various cipher *** generated many excellent results for some ciphers,for example,*** this research,we study the differential and linear propagations through the operations of addition,rotation and XOR（ARX）,and construct the SAT *** apply the models to CRAX to search differential trails and linear trails *** this sense,our contnbution can be broadly divided into two *** give the bounds for differential and linear cryptanalysis of Alzette both up to 12 steps,by which we present a 3-round differential attack and a 3-round linear attack for *** construct a 4-round key-recovery attack for CRAX with time complexity289times of 4-round encryption and data complexity 225.

关键词： Ciphers Encryption complexity theory Time complexity