全文获取类型
收费全文 | 13343篇 |
免费 | 2587篇 |
国内免费 | 1677篇 |
专业分类
电工技术 | 1093篇 |
综合类 | 1554篇 |
化学工业 | 619篇 |
金属工艺 | 460篇 |
机械仪表 | 764篇 |
建筑科学 | 494篇 |
矿业工程 | 236篇 |
能源动力 | 475篇 |
轻工业 | 209篇 |
水利工程 | 478篇 |
石油天然气 | 176篇 |
武器工业 | 248篇 |
无线电 | 2077篇 |
一般工业技术 | 1624篇 |
冶金工业 | 421篇 |
原子能技术 | 69篇 |
自动化技术 | 6610篇 |
出版年
2024年 | 127篇 |
2023年 | 414篇 |
2022年 | 588篇 |
2021年 | 701篇 |
2020年 | 671篇 |
2019年 | 615篇 |
2018年 | 534篇 |
2017年 | 631篇 |
2016年 | 699篇 |
2015年 | 761篇 |
2014年 | 970篇 |
2013年 | 1028篇 |
2012年 | 1072篇 |
2011年 | 1134篇 |
2010年 | 898篇 |
2009年 | 963篇 |
2008年 | 905篇 |
2007年 | 975篇 |
2006年 | 771篇 |
2005年 | 669篇 |
2004年 | 494篇 |
2003年 | 418篇 |
2002年 | 272篇 |
2001年 | 207篇 |
2000年 | 199篇 |
1999年 | 156篇 |
1998年 | 121篇 |
1997年 | 90篇 |
1996年 | 75篇 |
1995年 | 72篇 |
1994年 | 61篇 |
1993年 | 42篇 |
1992年 | 51篇 |
1991年 | 36篇 |
1990年 | 36篇 |
1989年 | 24篇 |
1988年 | 23篇 |
1987年 | 13篇 |
1986年 | 15篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1977年 | 4篇 |
1975年 | 2篇 |
1955年 | 1篇 |
1951年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
2.
3.
在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。 相似文献
4.
5.
6.
In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources. 相似文献
7.
8.
This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations. 相似文献
9.
Paul-Baptiste Rubio François Louf Ludovic Chamoin 《International journal for numerical methods in engineering》2019,120(4):447-472
The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. First, the proper generalized decomposition (PGD) is used to reduce the computational evaluation of the posterior density in the online phase. Second, Transport Map sampling is used to build a deterministic coupling between a reference measure and the posterior measure. The determination of the transport maps involves the solution of a minimization problem. As the PGD model is quasi-analytical and under a variable separation form, the use of gradient and Hessian information speeds up the minimization algorithm. Eventually, uncertainty quantification on outputs of interest of the model can be easily performed due to the global feature of the PGD solution over all coordinate domains. Numerical examples highlight the performance of the method. 相似文献
10.
Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers 下载免费PDF全文
Youssouf Ould‐Cheikh‐Mouhamedou 《International Journal of Communication Systems》2015,28(9):1572-1579
The knowledge of turbo code's minimum Hamming distance (dmin) and its corresponding codeword multiplicity (Amin) is of a great importance because the error correction capability of a code is strongly tied to the values of dmin and Amin. Unfortunately, the computational complexity associated with the search for dmin and Amin can be very high, especially for a turbo code that has high dmin value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of dmin and Amin values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd. 相似文献