全文获取类型
收费全文 | 29877篇 |
免费 | 2633篇 |
国内免费 | 1511篇 |
专业分类
电工技术 | 1843篇 |
技术理论 | 2篇 |
综合类 | 2314篇 |
化学工业 | 4820篇 |
金属工艺 | 1694篇 |
机械仪表 | 1853篇 |
建筑科学 | 2391篇 |
矿业工程 | 928篇 |
能源动力 | 846篇 |
轻工业 | 1916篇 |
水利工程 | 533篇 |
石油天然气 | 1586篇 |
武器工业 | 286篇 |
无线电 | 3603篇 |
一般工业技术 | 3416篇 |
冶金工业 | 1345篇 |
原子能技术 | 395篇 |
自动化技术 | 4250篇 |
出版年
2024年 | 119篇 |
2023年 | 456篇 |
2022年 | 721篇 |
2021年 | 1001篇 |
2020年 | 806篇 |
2019年 | 803篇 |
2018年 | 818篇 |
2017年 | 893篇 |
2016年 | 786篇 |
2015年 | 1141篇 |
2014年 | 1405篇 |
2013年 | 1663篇 |
2012年 | 1777篇 |
2011年 | 1849篇 |
2010年 | 1758篇 |
2009年 | 1784篇 |
2008年 | 1733篇 |
2007年 | 1685篇 |
2006年 | 1680篇 |
2005年 | 1390篇 |
2004年 | 1197篇 |
2003年 | 1304篇 |
2002年 | 1566篇 |
2001年 | 1309篇 |
2000年 | 817篇 |
1999年 | 762篇 |
1998年 | 464篇 |
1997年 | 454篇 |
1996年 | 424篇 |
1995年 | 342篇 |
1994年 | 301篇 |
1993年 | 197篇 |
1992年 | 147篇 |
1991年 | 115篇 |
1990年 | 89篇 |
1989年 | 70篇 |
1988年 | 56篇 |
1987年 | 39篇 |
1986年 | 25篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 10篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
41.
Internet of Vehicles (IoV) applications integrating with edge computing will significantly drive the growth of IoV. However, the contradiction between the high-speed mobility of vehicles, the delay sensitivity of corresponding IoV applications and the limited coverage and resource capacity of distributed edge servers will pose challenges to the service continuity and stability of IoV applications. IoV application migration is a promising solution that can be supported by application containerization, a technology forseamless cross-edge-server application migration without user perception. Therefore, this paper proposes the container-based IoV edge application migration mechanism, consisting of three parts. The first is the migration trigger determination algorithm for cross-border migration and service degradation migration, respectively, based on trajectory prediction and traffic awareness to improve the determination accuracy. The second is the migration target decision calculation model for minimizing the average migration time and maximizing the average service time to reduce migration times and improve the stability and adaptability of migration decisions. The third is the migration decision algorithm based on the improved artificial bee colony algorithm to avoid local optimal migration decisions. Simulation results show that the proposed migration mechanism can reduce migration times, reduce average migration time, improve average service time and enhance the stability and adaptability of IoV application services. 相似文献
42.
43.
44.
Lum Angeline Su Lyn Chiew Thiam Kian Ng Chirk Jenn Lee Yew Kong Lee Ping Yein Teo Chin Hai 《Universal Access in the Information Society》2017,16(3):775-791
Universal Access in the Information Society - In recent years, researchers have attempted to shift patient decision aids (PDAs) from paper-based to web-based to increase its accessibility. Insulin... 相似文献
45.
46.
47.
In (J. Comput. Phys. 229: 8105–8129, 2010), Li and Qiu investigated the hybrid weighted essentially non-oscillatory (WENO) schemes with different indicators for Euler
equations of gas dynamics. In this continuation paper, we extend the method to solve the one- and two-dimensional shallow
water equations with source term due to the non-flat bottom topography, with a goal of obtaining the same advantages of the
schemes for the Euler equations, such as the saving computational cost, essentially non-oscillatory property for general solution
with discontinuities, and the sharp shock transition. Extensive simulations in one- and two-dimensions are provided to illustrate
the behavior of this procedure. 相似文献
48.
49.
Facial expression recognition using radial encoding of local Gabor features and classifier synthesis
Primarily motivated by some characteristics of the human visual cortex (HVC), we propose a new facial expression recognition scheme, involving a statistical synthesis of hierarchical classifiers. In this scheme, the input images of the database are first subjected to local, multi-scale Gabor-filter operations, and then the resulting Gabor decompositions are encoded using radial grids, imitating the topographical map-structure of the HVC. The codes are fed to local classifiers to produce global features, representing facial expressions. Experimental results show that such a hybrid combination of the HVC structure with a hierarchical classifier significantly improves expression recognition accuracy when applied to wide-ranging databases in comparison with the results in the literature. Furthermore, the proposed system is not only robust to corrupted data and missing information, but can also be generalized to cross-database expression recognition. 相似文献
50.
Qiu W Titley-Peloquin D Soleimani M 《Computer methods and programs in biomedicine》2012,108(2):669-678
Cone beam computed tomography (CBCT) enables volumetric image reconstruction from 2D projection data and plays an important role in image guided radiation therapy (IGRT). Filtered back projection is still the most frequently used algorithm in applications. The algorithm discretizes the scanning process (forward projection) into a system of linear equations, which must then be solved to recover images from measured projection data. The conjugate gradients (CG) algorithm and its variants can be used to solve (possibly regularized) linear systems of equations Ax=b and linear least squares problems minx∥b-Ax∥(2), especially when the matrix A is very large and sparse. Their applications can be found in a general CT context, but in tomography problems (e.g. CBCT reconstruction) they have not widely been used. Hence, CBCT reconstruction using the CG-type algorithm LSQR was implemented and studied in this paper. In CBCT reconstruction, the main computational challenge is that the matrix A usually is very large, and storing it in full requires an amount of memory well beyond the reach of commodity computers. Because of these memory capacity constraints, only a small fraction of the weighting matrix A is typically used, leading to a poor reconstruction. In this paper, to overcome this difficulty, the matrix A is partitioned and stored blockwise, and blockwise matrix-vector multiplications are implemented within LSQR. This implementation allows us to use the full weighting matrix A for CBCT reconstruction without further enhancing computer standards. Tikhonov regularization can also be implemented in this fashion, and can produce significant improvement in the reconstructed images. 相似文献