全文获取类型
收费全文 | 11656篇 |
免费 | 1970篇 |
国内免费 | 1458篇 |
专业分类
电工技术 | 661篇 |
综合类 | 1057篇 |
化学工业 | 309篇 |
金属工艺 | 232篇 |
机械仪表 | 883篇 |
建筑科学 | 196篇 |
矿业工程 | 207篇 |
能源动力 | 214篇 |
轻工业 | 190篇 |
水利工程 | 52篇 |
石油天然气 | 414篇 |
武器工业 | 219篇 |
无线电 | 2851篇 |
一般工业技术 | 721篇 |
冶金工业 | 244篇 |
原子能技术 | 59篇 |
自动化技术 | 6575篇 |
出版年
2024年 | 69篇 |
2023年 | 165篇 |
2022年 | 376篇 |
2021年 | 372篇 |
2020年 | 393篇 |
2019年 | 374篇 |
2018年 | 377篇 |
2017年 | 488篇 |
2016年 | 541篇 |
2015年 | 623篇 |
2014年 | 868篇 |
2013年 | 779篇 |
2012年 | 992篇 |
2011年 | 948篇 |
2010年 | 862篇 |
2009年 | 883篇 |
2008年 | 880篇 |
2007年 | 895篇 |
2006年 | 746篇 |
2005年 | 661篇 |
2004年 | 489篇 |
2003年 | 460篇 |
2002年 | 326篇 |
2001年 | 260篇 |
2000年 | 216篇 |
1999年 | 182篇 |
1998年 | 167篇 |
1997年 | 145篇 |
1996年 | 83篇 |
1995年 | 80篇 |
1994年 | 72篇 |
1993年 | 51篇 |
1992年 | 39篇 |
1991年 | 29篇 |
1990年 | 32篇 |
1989年 | 23篇 |
1988年 | 18篇 |
1987年 | 6篇 |
1986年 | 13篇 |
1985年 | 12篇 |
1984年 | 18篇 |
1983年 | 17篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
981.
《中国工程学刊》2012,35(1):101-113
Changes of the cartilage morphology over time can tell the progression of osteoarthritis (OA) and show particular promise for evaluating the efficacy of disease-modifying OA drugs. Hence, cartilage matching is required prior to cartilage morphology comparison. An accurate cartilage matching allows one to ensure longitudinal focal and local changes of cartilage morphology due to OA. The method described in this article meets this need. The proposed method consists of three steps. First, the knee femur surfaces are aligned, using the principal axes transformation to correct for different knee joint positions and orientations in the magnetic resonance (MR) scanner. Second, we present a global registration algorithm based on Lipschitz optimization theory for accurately identifying the corresponding points of the knee femur surface. Third, the rigid transformation of the knee femur surface registration is applied to the cartilage surface. Our registration algorithm is efficient and robust, and its performance is evaluated on MR images of pig knees. 相似文献
982.
983.
984.
《国际计算机数学杂志》2012,89(11):1201-1209
In [5] a new iterative method is given for the linear system of equations Au=b , where A is large, sparse and nonsymmetrical and A^{\rm T}+A is symmetric and positive definite (SPD) or equivalently A is positive real. The new iterative method is based on a mixed-type splitting of the matrix A and is called the mixed-type splitting iterative method. The iterative method contains an auxiliary matrix D_1 that is restricted to be symmetric. In this note, the auxiliary matrix is allowed to be more general and it is shown that by proper choice of D 1 , the new iterative method is still convergent. It is also shown that by special choice of D_{1} , the new iterative method becomes the well-known (point) accelerated overrelaxation (AOR) [1] method. Hence, it is shown that the (point) AOR method applied to the positive real system is convergent under the proper choice of the overrelaxation parameters y and . 相似文献
985.
Integer Programming (IP) has been used to model educational timetabling problems since the very early days of Operations Research. It is well recognized that these IP models in general are hard to solve, and this area of research is dominated by heuristic solution approaches. In this paper a Two-Stage Decomposition of an IP model for a practical case of high school timetabling is shown. This particular timetabling problem consists of assigning lectures to both a timeslot and a classroom, which is modeled using a very large amount of binary variables. The decomposition splits this model into two separate problems (Stage I and Stage II) with far less variables. These two separate problems are solved in sequence, such that the solution for the Stage I model is given as input to the Stage II model, implying that irreversible decisions are made in Stage I. However, the objective of the Stage II model is partly incorporated in the Stage I model by exploiting that Stage II can be seen as a minimum weight maximum matching problem in a bipartite graph. This theoretically strengthens the decomposition in terms of global optimality. The approach relies on Hall's theorem for the existence of matchings in bipartite graphs, which in its basic form yields an exponential amount of constraints in the Stage I model. However, it is shown that only a small subset of these constraints is needed, making the decomposition tractable in practice for IP solvers. To evaluate the decomposition, 100 real-life problem instances from the database of the high school ERP system Lectio are used. Computational results show that the decomposition performs significantly better than solving the original IP, in terms of both found solutions and bounds. 相似文献
986.
本文首先运用SolidWorks软件对某升压水泵房的蜗壳和肘型引水流道结构进行三维整体建模;其次,采用ANSYS软件对模型进行网格剖分及有限元方法分析;最后,针对肘型引水流道结构的计算结果,对该结构进行了主筋选配设计。 相似文献
987.
以三都隧道出口施工机械化配套为例,介绍了机械化配套施工方案,对隧道开挖、喷射混凝土、仰拱等施工机械配套技术进行了阐述,以加快施工进度,确保施工安全及质量。 相似文献
988.
This paper aims to evaluate the impacts of speed limit enforcement cameras on reducing road accidents in the UK by accounting for both confounding factors and the selection of proper reference groups. The propensity score matching (PSM) method is employed to do this. A naïve before and after approach and the empirical Bayes (EB) method are compared with the PSM method. A total of 771 sites and 4787 sites for the treatment and the potential reference groups respectively are observed for a period of 9 years in England. Both the PSM and the EB methods show similar results that there are significant reductions in the number of accidents of all severities at speed camera sites. It is suggested that the propensity score can be used as the criteria for selecting the reference group in before-after control studies. Speed cameras were found to be most effective in reducing accidents up to 200 meters from camera sites and no evidence of accident migration was found. 相似文献
989.
This letter considers how to approximately reconstruct a cascade system from a given unstructured system estimate. Many system identification methods, including subspace methods, provide reliable but generally unstructured black-box models. The problem we consider is how to find cascade systems that are close to such black-box models. For this, we use model matching techniques and optimal weighted Hankel-norm approximation to obtain accurate low-order cascade systems. We show that it is possible to bound the reconstruction error in terms of an error tolerance parameter and weighted Hankel singular values. The suggested methods are illustrated on both a numerical example and a real double tank system with experimental data. 相似文献
990.