全文获取类型
收费全文 | 1108篇 |
免费 | 76篇 |
国内免费 | 115篇 |
专业分类
系统科学 | 705篇 |
丛书文集 | 20篇 |
教育与普及 | 6篇 |
理论与方法论 | 1篇 |
现状及发展 | 14篇 |
综合类 | 553篇 |
出版年
2023年 | 12篇 |
2022年 | 32篇 |
2021年 | 27篇 |
2020年 | 24篇 |
2019年 | 31篇 |
2018年 | 33篇 |
2017年 | 32篇 |
2016年 | 38篇 |
2015年 | 40篇 |
2014年 | 76篇 |
2013年 | 105篇 |
2012年 | 154篇 |
2011年 | 171篇 |
2010年 | 144篇 |
2009年 | 153篇 |
2008年 | 42篇 |
2007年 | 24篇 |
2006年 | 47篇 |
2005年 | 22篇 |
2004年 | 12篇 |
2003年 | 13篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1998年 | 8篇 |
1997年 | 13篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1980年 | 1篇 |
排序方式: 共有1299条查询结果,搜索用时 93 毫秒
41.
目的研究基于TV-Anytime规范的新一代智能个人数字媒体设备PDR的个性化服务关键技术。方法引入特征表示和相似度度量算法,提出用户个人喜好知识的学习和更新方法,研究了多个Agent之间的通信机制。结果提出PDR智能多Agent个性化服务的关键技术及主要算法和机制,给出验证系统的设计。结论提出的算法和机制为实现PDR智能多Agent个性化服务奠定了基础。 相似文献
42.
43.
44.
JIANGZheng-tao XUWen-li WANGYu-min 《武汉大学学报:自然科学英文版》2005,10(1):239-242
In this paper, we lower the upper bound of the number of solutions of oracle transformation polynomial F(x) over GF(q). So one can also recover all the secrete keys with fewer calls. We use our generalized ““““““““even-and-odd test““““““““ method to recover the least significant p-adic ‘bits‘ of representations of the Lucas Cryptosystem secret keys x. Finally, we analyze the Efficient Compact Subgroup Trace Representation (XTR) Diffie-Hellmen secrete keys and point out that if the order of XTR subgroup has a special form then all the bits of the secrete key of XTR can be recovered form any bit of the exponent x. 相似文献
45.
New field of cryptography: DNA cryptography 总被引:6,自引:1,他引:6
XIAO Guozhen LU Mingxin QIN Lei LAI Xuejia 《科学通报(英文版)》2006,51(12):1413-1420
The vast parallelism, exceptional energy efficiency and extraordinary information density inherent in DNA molecules are being explored for computing, data stor- age and cryptography. In such research area, novel computers, data storage and cryptography mi… 相似文献
46.
LI Fagen HU Yupu~ CHEN Jie Key Laboratory of Computer Networks Information Security Ministry of Education Xidian University Xi’an Shaanxi China 《武汉大学学报:自然科学英文版》2006,11(6):1653-1656
0 IntroductionIdentity-based (ID-based) cryptography[1]is rapidly emer-gingin recent years .The concept of the proxy signature scheme was first in-troduced by Mamboet al[2]in 1996 .The concept of thresholdproxy signature was proposed[3 ,4]. Apractical and secure (t,n) threshold proxy signature scheme should satisfy the secre-cy,the proxy protected,the unforgeability,the non-repudia-tion,the ti me constraint ,andthe known signers[5].In 2006 , Baoet al[6]proposed an ID-based thresholdproxy si… 相似文献
47.
ZHANG Jun KOU Weidong FAN Kai CAO Xuefei 《武汉大学学报:自然科学英文版》2006,11(6):1671-1674
A trusted third party introduced in watermarking protocols would decrease the security and affect the implementation of the protocols. In this paper, a new watermarking protocol with an un-trusted third party (UTTP) was proposed. Based on the idea of all-or-nothing disclosure of secret (ANDOS), all of the buyer, the seller and the third party didn't know the exact watermark, which was embedded in a digital content for tracing piracy. The proposed protocol provided mechanisms to trace piracy and protect customer's right. In addition, the problem that a seller colluded with UTTP to frame the buyer, namely, the conspiracy problem, could be avoided. 相似文献
48.
和谐,已经成为社会发展的主旋律。和谐校园应是其中的组成部分,而和谐的大学师生人际关系是促成大学校园和谐的有力切入点。人际关系和谐表达了一种心理和谐,这符合和谐社会的最终意义。大学师生人际关系构建的教育学意义的重新诠释及其具体途径探寻,可以作为对这一主题的建设性说明。 相似文献
49.
CAO Chunjie MA Jianfeng MOON Sangjae 《武汉大学学报:自然科学英文版》2007,12(1):41-45
Certificateless public key cryptography (CL-PKC) avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol. 相似文献
50.
LIU Jingwei SUN Rong KOU Weidong 《武汉大学学报:自然科学英文版》2007,12(1):181-184
0 Introduction The advent of E-commerce demands for a secure communication of digital information. It has been proven for years that this can be achieved by cryptography. Digital signature schemes are essential for E-commerce as they allow one to authoriz… 相似文献