全文获取类型
收费全文 | 16274篇 |
免费 | 270篇 |
国内免费 | 24篇 |
专业分类
电工技术 | 209篇 |
综合类 | 25篇 |
化学工业 | 3284篇 |
金属工艺 | 572篇 |
机械仪表 | 742篇 |
建筑科学 | 264篇 |
矿业工程 | 4篇 |
能源动力 | 627篇 |
轻工业 | 1407篇 |
水利工程 | 58篇 |
石油天然气 | 19篇 |
武器工业 | 1篇 |
无线电 | 2963篇 |
一般工业技术 | 3484篇 |
冶金工业 | 1092篇 |
原子能技术 | 164篇 |
自动化技术 | 1653篇 |
出版年
2024年 | 255篇 |
2023年 | 218篇 |
2022年 | 296篇 |
2021年 | 506篇 |
2020年 | 400篇 |
2019年 | 434篇 |
2018年 | 470篇 |
2017年 | 473篇 |
2016年 | 618篇 |
2015年 | 499篇 |
2014年 | 683篇 |
2013年 | 1064篇 |
2012年 | 1000篇 |
2011年 | 1275篇 |
2010年 | 889篇 |
2009年 | 907篇 |
2008年 | 759篇 |
2007年 | 659篇 |
2006年 | 546篇 |
2005年 | 493篇 |
2004年 | 425篇 |
2003年 | 392篇 |
2002年 | 327篇 |
2001年 | 283篇 |
2000年 | 286篇 |
1999年 | 249篇 |
1998年 | 470篇 |
1997年 | 262篇 |
1996年 | 238篇 |
1995年 | 173篇 |
1994年 | 143篇 |
1993年 | 132篇 |
1992年 | 94篇 |
1991年 | 77篇 |
1990年 | 69篇 |
1989年 | 67篇 |
1988年 | 47篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 28篇 |
1984年 | 33篇 |
1983年 | 30篇 |
1982年 | 26篇 |
1981年 | 19篇 |
1980年 | 24篇 |
1979年 | 12篇 |
1977年 | 15篇 |
1976年 | 22篇 |
1974年 | 12篇 |
1971年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Kwon Soonho Kim Daeoh Lee Jihye Moon Sangmi Chu Myeonghun Bae Sara You Cheolwoo Liu Huaping Kim Jeong-Ho Kim Dae Jin Park Hosung Kim Jin Young Kim Cheol-Sung Hwang Intae 《Wireless Personal Communications》2018,102(1):507-526
Wireless Personal Communications - Generally, a ground telemetry station for a launch vehicle (LV) includes a tracking function only; therefore, position measurements for LV depend on received... 相似文献
992.
993.
Yang S. Cho D.-H. Ryu M. K. Park S.-H. K. Hwang C.-S. Jang J. Jeong J. K. 《Electron Device Letters, IEEE》2010,31(2):144-146
994.
Jung Hee Cheon 《Journal of Cryptology》2010,23(3):457-476
Let g be an element of prime order p in an abelian group, and let α∈? p . We show that if g,g α , and \(g^{\alpha^{d}}\) are given for a positive divisor d of p?1, the secret key α can be computed deterministically in \(O(\sqrt{p/d}+\sqrt{d})\) exponentiations by using \(O(\max\{\sqrt{p/d},\sqrt{d}\})\) storage. If \(g^{\alpha^{i}}\) (i=0,1,2,…,2d) is given for a positive divisor d of p+1, α can be computed in \(O(\sqrt{p/d}+d)\) exponentiations by using \(O(\max\{\sqrt{p/d},\sqrt{d}\})\) storage. We also propose space-efficient but probabilistic algorithms for the same problem, which have the same computational complexities with the deterministic algorithm.As applications of the proposed algorithms, we show that the strong Diffie–Hellman problem and related problems with public \(g^{\alpha},\ldots,g^{\alpha^{d}}\) have computational complexity up to \(O(\sqrt{d}/\log p)\) less than the generic algorithm complexity of the discrete logarithm problem when p?1 (resp. p+1) has a divisor d≤p 1/2 (resp. d≤p 1/3). Under the same conditions for d, the algorithm is also applicable to recovering the secret key in \(O(\sqrt{p/d}\cdot \log p)\) for Boldyreva’s blind signature scheme and the textbook ElGamal scheme when d signature or decryption queries are allowed. 相似文献
995.
This paper proposes a simple method that equips UMTS-based telecom companies with a mechanism to prove the records on mobile
users’ phone bills. In the history of mobile phone communication, we have seen countless unsettled disputes where the mobile
user disagrees with the telecom company either on the calling time or on the duration, or even on whether or not a call was
actually made. In this paper, a provable billing protocol will be presented that can effectively solve disagreements between
the two parties. Equipped with a non-repudiation function, the proposed protocol enables the service provider to hold on to
the solid proofs as to exactly when and to which number a mobile phone user made a call so that the mobile user cannot deny;
at the same time, the mobile user also gets to have his/her own share of proofs as to when and how the mobile services were
accessed, so that the bill can be double checked to make sure nothing goes wrong. And, to make it even better, this new protocol
is perfectly compatible with the standard UMTS protocol and is therefore readily applicable to the current mobile phone communication
environments. 相似文献
996.
We report large-area synthesis of few-layer graphene films by chemical vapor deposition (CVD) in a cold-wall reactor. The
key feature of this method is that the catalytic metal layers on the SiO2/Si substrates are self-heated to high growth temperature (900°C to 1000°C) by high-current Joule heating. Synthesis of high-quality
graphene films, whose structural and electrical characteristics are comparable to those grown by hot-wall CVD systems, was
confirmed by transmission electron microscopy images, Raman spectra, and current–voltage analysis. Optical transmittance spectra
of the graphene films allowed us to estimate the number of graphene layers, which revealed that high-temperature exposure
of Ni thin layers to a carbon precursor (CH4) was critical in determining the number of graphene layers. In particular, exposure to CH4 for 20 s produces very thin graphene films with an optical transmittance of 93%, corresponding to an average layer number
of three and a sheet resistance of ~600 Ω/square. 相似文献
997.
998.
Thi Minh-Thuyen Radwan Amr Huynh Thong Hwang Won-Joo 《Wireless Personal Communications》2019,109(4):2289-2303
Wireless Personal Communications - In the formulating of power control for wireless networks, the radio channel is commonly formulated using static models of optimization or game theory. In these... 相似文献
999.
Pronouns are frequently dropped in Korean sentences, especially in text messages in the mobile phone environment. Restoring dropped pronouns can be a beneficial preprocessing task for machine translation, information extraction, spoken dialog systems, and many other applications. In this work, we address the problem of dropped pronoun recovery by resolving two simultaneous subtasks: detecting zero-pronoun sentences and determining the type of dropped pronouns. The problems are statistically modeled by encoding the sentence and classifying types of dropped pronouns using a recurrent neural network (RNN) architecture. Various RNN-based encoding architectures were investigated, and the stacked RNN was shown to be the best model for Korean zero-pronoun recovery. The proposed method does not require any manual features to be implemented; nevertheless, it shows good performance. 相似文献