全文获取类型
收费全文 | 33660篇 |
免费 | 4407篇 |
国内免费 | 1344篇 |
专业分类
化学 | 2140篇 |
晶体学 | 58篇 |
力学 | 1951篇 |
综合类 | 453篇 |
数学 | 9481篇 |
物理学 | 6641篇 |
无线电 | 18687篇 |
出版年
2024年 | 110篇 |
2023年 | 392篇 |
2022年 | 649篇 |
2021年 | 777篇 |
2020年 | 855篇 |
2019年 | 788篇 |
2018年 | 803篇 |
2017年 | 1110篇 |
2016年 | 1354篇 |
2015年 | 1386篇 |
2014年 | 2255篇 |
2013年 | 2381篇 |
2012年 | 2197篇 |
2011年 | 2481篇 |
2010年 | 1742篇 |
2009年 | 2149篇 |
2008年 | 2384篇 |
2007年 | 2452篇 |
2006年 | 2100篇 |
2005年 | 1761篇 |
2004年 | 1500篇 |
2003年 | 1331篇 |
2002年 | 1130篇 |
2001年 | 903篇 |
2000年 | 808篇 |
1999年 | 616篇 |
1998年 | 571篇 |
1997年 | 501篇 |
1996年 | 411篇 |
1995年 | 291篇 |
1994年 | 223篇 |
1993年 | 179篇 |
1992年 | 162篇 |
1991年 | 88篇 |
1990年 | 92篇 |
1989年 | 67篇 |
1988年 | 87篇 |
1987年 | 51篇 |
1986年 | 43篇 |
1985年 | 47篇 |
1984年 | 45篇 |
1983年 | 19篇 |
1982年 | 31篇 |
1981年 | 22篇 |
1980年 | 11篇 |
1979年 | 11篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1959年 | 5篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
3.
Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient. 相似文献
4.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost. 相似文献
5.
Tatiana Monaretto Andre Souza Tiago Bueno Moraes Victor Bertucci-Neto Corinne Rondeau-Mouro Luiz Alberto Colnago 《Magnetic resonance in chemistry : MRC》2019,57(9):616-625
The traditional way to enhance signal-to-noise ratio (SNR) of nuclear magnetic resonance (NMR) signals is to increase the number of scans. However, this procedure increases the measuring time that can be prohibitive for some applications. Therefore, we have tested the use of several post-acquisition digital filters to enhance SNR up to one order of magnitude in time domain NMR (TD-NMR) relaxation measurements. The procedures were studied using continuous wave free precession (CWFP-T1) signals, acquired with very low flip angles that contain six times more noise than the Carr–Purcell–Meiboom–Gill (CPMG) signal of the same sample and experimental time. Linear (LI) and logarithmic (LO) data compression, low-pass infinity impulse response (LP), Savitzky–Golay (SG), and wavelet transform (WA) post-acquisition filters enhanced the SNR of the CWFP-T1 signals by at least six times. The best filters were LO, SG, and WA that have high enhancement in SNR without significant distortions in the ILT relaxation distribution data. Therefore, it was demonstrated that these post-acquisition digital filters could be a useful way to denoise CWFP-T1, as well as CPMG noisy signals, and consequently reducing the experimental time. It was also demonstrated that filtered CWFP-T1 method has the potential to be a rapid and nondestructive method to measure fat content in beef and certainly in other meat samples. 相似文献
6.
以焦炉上升管内壁结焦炭层块为研究对象,采用X射线荧光光谱仪(XRF)、X射线衍射仪(XRD)、傅里叶红外光谱仪(FTIR)和激光共聚焦拉曼光谱仪(Raman)对结焦炭层的元素组成,以及各结焦炭层的矿物组成、组成结构和分子结构进行测试。分析从结焦炭层块外表面向内表面过渡的各结焦炭层的差异性,揭示焦炉上升管内壁结焦机理。结果表明焦炉上升管内粉尘中Fe,S和Cr极易催化荒煤气中蒽、萘等稠环芳烃化合物成炭,在焦炉上升管内壁形成炭颗粒沉积,为焦油凝结挂壁提供载体,在荒煤气温度降至结焦温度时易结焦积碳。结焦炭层均含有芳香层结构,随着结焦炭层从外表面向内表面过渡,各结焦炭层的面层间距(d002)逐渐降低、层片直径(La)先降低后增加、层片堆砌高度(Lc)和芳香层数(N)先稳定后增加。结焦炭层石墨化过程是由结焦炭层内表面向外表面进行,主要包括其片层外缘的羧基和部分C-O结构的降解剥离,从而形成高度规整的共轭结构。结焦炭层块中C元素是以结晶碳与无定型碳的混合物形式存在。以上研究为解决焦炉上升管内壁结焦及腐蚀问题,提高换热器换热效率,有效回收焦炉荒煤气显热,降低焦化企业能耗提供实验基础和理论依据。 相似文献
7.
8.
Namyong Kim 《ETRI Journal》2006,28(2):155-161
In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance. 相似文献
9.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
10.
论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。 相似文献