全文获取类型
收费全文 | 94627篇 |
免费 | 9429篇 |
国内免费 | 5326篇 |
专业分类
电工技术 | 7337篇 |
技术理论 | 7篇 |
综合类 | 7305篇 |
化学工业 | 14033篇 |
金属工艺 | 6281篇 |
机械仪表 | 6472篇 |
建筑科学 | 7096篇 |
矿业工程 | 2853篇 |
能源动力 | 3053篇 |
轻工业 | 6264篇 |
水利工程 | 2235篇 |
石油天然气 | 4986篇 |
武器工业 | 1163篇 |
无线电 | 10897篇 |
一般工业技术 | 10099篇 |
冶金工业 | 4499篇 |
原子能技术 | 1168篇 |
自动化技术 | 13634篇 |
出版年
2024年 | 319篇 |
2023年 | 1249篇 |
2022年 | 2413篇 |
2021年 | 3601篇 |
2020年 | 2740篇 |
2019年 | 2193篇 |
2018年 | 2460篇 |
2017年 | 2872篇 |
2016年 | 2712篇 |
2015年 | 3832篇 |
2014年 | 4872篇 |
2013年 | 5870篇 |
2012年 | 7091篇 |
2011年 | 7407篇 |
2010年 | 6970篇 |
2009年 | 6678篇 |
2008年 | 6529篇 |
2007年 | 6200篇 |
2006年 | 5850篇 |
2005年 | 4874篇 |
2004年 | 3609篇 |
2003年 | 3326篇 |
2002年 | 3432篇 |
2001年 | 2960篇 |
2000年 | 2049篇 |
1999年 | 1723篇 |
1998年 | 1116篇 |
1997年 | 913篇 |
1996年 | 814篇 |
1995年 | 649篇 |
1994年 | 515篇 |
1993年 | 354篇 |
1992年 | 262篇 |
1991年 | 199篇 |
1990年 | 170篇 |
1989年 | 111篇 |
1988年 | 101篇 |
1987年 | 75篇 |
1986年 | 47篇 |
1985年 | 38篇 |
1984年 | 36篇 |
1983年 | 27篇 |
1982年 | 22篇 |
1981年 | 18篇 |
1980年 | 21篇 |
1979年 | 14篇 |
1978年 | 6篇 |
1975年 | 5篇 |
1959年 | 7篇 |
1951年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 296 毫秒
921.
922.
This paper addresses a multi-supplier, multi-affected area, multi-relief, and multi-vehicle relief allocation problem in disaster relief logistics. A multi-objective optimisation model based on disaster scenario information updates is proposed in an attempt to coordinate efficiency and equity through timely and appropriate decisions regarding issues such as vehicle routing and relief allocation. An optimal stopping rule is also proposed to determine the optimum period of delay before responding to disaster, because decision making requires accurate disaster information. The main contribution of this paper is solving relief allocation problem in a novel way by correlating operational research with statistical decision making and Bayesian sequential analysis. Finally, a case is presented based on the post-disaster rescue in Eastern China after supertyphoon Saomai to test the applicability and show the potential advantages of the proposed model. 相似文献
923.
For hyperspectral target detection, it is usually the case that only part of the targets pixels can be used as target signatures, so can we use them to construct the most proper background subspace for detecting all the probable targets? In this paper, a dynamic subspace detection (DSD) method which establishes a multiple detection framework is proposed. In each detection procedure, blocks of pixels are calculated by the random selection and the succeeding detection performance distribution analysis. Manifold analysis is further used to eliminate the probable anomalous pixels and purify the subspace datasets, and the remaining pixels construct the subspace for each detection procedure. The final detection results are then enhanced by the fusion of target occurrence frequencies in all the detection procedures. Experiments with both synthetic and real hyperspectral images (HSI) evaluate the validation of our proposed DSD method by using several different state-of-the-art methods as the basic detectors. With several other single detectors and multiple detection methods as comparable methods, improved receiver operating characteristic curves and better separability between targets and backgrounds by the DSD methods are illustrated. The DSD methods also perform well with the covariance-based detectors, showing their efficiency in selecting covariance information for detection. 相似文献
924.
925.
926.
927.
企业管理的国际化要求企业的管理与国际管理相接轨,做到科学有效,提高产品的竞争力。企业认证则为企业提供了国际先进的管理模式,二者结合,使企业在管理中不断发展和完善。 相似文献
928.
This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm. 相似文献
929.
930.