全文获取类型
收费全文 | 6491篇 |
免费 | 1371篇 |
国内免费 | 939篇 |
专业分类
电工技术 | 237篇 |
技术理论 | 1篇 |
综合类 | 986篇 |
化学工业 | 98篇 |
金属工艺 | 56篇 |
机械仪表 | 213篇 |
建筑科学 | 138篇 |
矿业工程 | 70篇 |
能源动力 | 29篇 |
轻工业 | 60篇 |
水利工程 | 23篇 |
石油天然气 | 74篇 |
武器工业 | 85篇 |
无线电 | 2237篇 |
一般工业技术 | 241篇 |
冶金工业 | 77篇 |
原子能技术 | 9篇 |
自动化技术 | 4167篇 |
出版年
2024年 | 29篇 |
2023年 | 75篇 |
2022年 | 146篇 |
2021年 | 131篇 |
2020年 | 170篇 |
2019年 | 149篇 |
2018年 | 120篇 |
2017年 | 220篇 |
2016年 | 231篇 |
2015年 | 270篇 |
2014年 | 423篇 |
2013年 | 418篇 |
2012年 | 621篇 |
2011年 | 672篇 |
2010年 | 584篇 |
2009年 | 594篇 |
2008年 | 632篇 |
2007年 | 755篇 |
2006年 | 566篇 |
2005年 | 488篇 |
2004年 | 354篇 |
2003年 | 312篇 |
2002年 | 214篇 |
2001年 | 161篇 |
2000年 | 147篇 |
1999年 | 88篇 |
1998年 | 73篇 |
1997年 | 40篇 |
1996年 | 33篇 |
1995年 | 23篇 |
1994年 | 18篇 |
1993年 | 10篇 |
1992年 | 4篇 |
1991年 | 7篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1966年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有8801条查询结果,搜索用时 0 毫秒
91.
92.
93.
张慧 《计算机应用与软件》2011,28(1)
针对Wang等人提出的前向安全代理签名方案进行了改进,并结合提名思想和代理多重签名理论,构造了一类新的基于前向安全性质的提名代理多重签名方案。新方案不仅满足前向安全性,还满足可验证性、不可伪造性等性质。 相似文献
94.
Shangping Wang Rui MaYaling Zhang Xiaofeng Wang 《Computers & Mathematics with Applications》2011,62(10):3973-3979
The ring signature scheme is an important cryptographic primitive that enables a user to sign a message on behalf of a group in authentic and anonymous way, i.e. the recipient of the message is convinced that the message is valid and it comes from one of the group members, but does not know who the actual signer is. Currently, all the existing ring signatures are based on traditional cryptosystems. However, the rapid advances in the field of quantum computing indicate a growing threat to traditional cryptosystems. Multivariate public key cryptosystems (MPKCs) is one of the promising alternatives which may resist future quantum computing attacks. In this work, we propose a novel ring signature scheme based on multivariate polynomials with the security model for the first time. Our ring signature scheme has a great advantage in efficiency compared to many existing ring signature schemes, and currently it seems to be immune to quantum computing attacks. 相似文献
95.
A property-based attestation protocol for TCM 总被引:1,自引:0,他引:1
This paper presents a property attestation protocol for the security chip TCM (trusted cryptographic module) via analyzing the problems of the current property attestation, which is built on the property attestation model with the online trust third party. In the protocol the prover utilizes the zero-knowledge proof by the attribute certificates, configuration commitment and TCM signature, and attests its configuration and status which are compliant with the declarative security property. The protocol is ch... 相似文献
96.
CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles 总被引:1,自引:0,他引:1
DENG Robert 《中国科学:信息科学(英文版)》2010,(3):593-606
Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi... 相似文献
97.
98.
Pei-Yu Lin Author Vitae Jung-San Lee Author Vitae Author Vitae 《Pattern recognition》2009,42(5):886-91
The (t, n)-threshold has been extended to secret image sharing due to its practicability. In this article, we provide a novel version that employs the modulus operator to embed the secret share into a host image. The simulator shows that the modulus operator is useful for decreasing shadow image distortion. Using Rabin's signature cryptosystem, participants can detect if a cheater exists in the cooperation. In particular, the new mechanism permits involved members to restore a lossless secret image and to reconstruct a distortion-free host image. 相似文献
99.
Design of DL-based certificateless digital signatures 总被引:1,自引:0,他引:1
Public-key cryptosystems without requiring digital certificates are very attractive in wireless communications due to limitations imposed by communication bandwidth and computational resource of the mobile wireless communication devices. To eliminate public-key digital certificate, Shamir introduced the concept of the identity-based (ID-based) cryptosystem. The main advantage of the ID-based cryptosystem is that instead of using a random integer as each user’s public key as in the traditional public-key systems, the user’s real identity, such as user’s name or email address, becomes the user’s public key. However, all identity-based signature (IBS) schemes have the inherent key escrow problem, that is private key generator (PKG) knows the private key of each user. As a result, the PKG is able to sign any message on the users’ behalf. This nature violates the “non-repudiation” requirement of digital signatures. To solve the key escrow problem of the IBS while still taking advantage of the benefits of the IBS, certificateless digital signature (CDS) was introduced. In this paper, we propose a generalized approach to construct CDS schemes. In our proposed CDS scheme, the user’s private key is known only to the user himself, therefore, it can eliminate the key escrow problem from the PKG. The proposed construction can be applied to all Discrete Logarithm (DL)-based signature schemes to convert a digital signature scheme into a CDS scheme. The proposed CDS scheme is secure against adaptive chosen-message attack in the random oracle model. In addition, it is also efficient in signature generation and verification. 相似文献
100.
Partial 3D Shape Retrieval by Reeb Pattern Unfolding 总被引:2,自引:0,他引:2
This paper presents a novel approach for fast and efficient partial shape retrieval on a collection of 3D shapes. Each shape is represented by a Reeb graph associated with geometrical signatures. Partial similarity between two shapes is evaluated by computing a variant of their maximum common sub-graph.
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts. 相似文献
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts. 相似文献