全文获取类型
收费全文 | 23438篇 |
免费 | 1695篇 |
国内免费 | 1339篇 |
专业分类
电工技术 | 1861篇 |
综合类 | 2412篇 |
化学工业 | 1048篇 |
金属工艺 | 686篇 |
机械仪表 | 1797篇 |
建筑科学 | 628篇 |
矿业工程 | 336篇 |
能源动力 | 604篇 |
轻工业 | 255篇 |
水利工程 | 399篇 |
石油天然气 | 245篇 |
武器工业 | 184篇 |
无线电 | 1855篇 |
一般工业技术 | 1955篇 |
冶金工业 | 260篇 |
原子能技术 | 126篇 |
自动化技术 | 11821篇 |
出版年
2024年 | 46篇 |
2023年 | 169篇 |
2022年 | 305篇 |
2021年 | 349篇 |
2020年 | 439篇 |
2019年 | 521篇 |
2018年 | 423篇 |
2017年 | 651篇 |
2016年 | 693篇 |
2015年 | 787篇 |
2014年 | 1270篇 |
2013年 | 1692篇 |
2012年 | 1303篇 |
2011年 | 1573篇 |
2010年 | 1171篇 |
2009年 | 1399篇 |
2008年 | 1431篇 |
2007年 | 1558篇 |
2006年 | 1383篇 |
2005年 | 1167篇 |
2004年 | 1024篇 |
2003年 | 933篇 |
2002年 | 801篇 |
2001年 | 648篇 |
2000年 | 587篇 |
1999年 | 535篇 |
1998年 | 487篇 |
1997年 | 437篇 |
1996年 | 385篇 |
1995年 | 336篇 |
1994年 | 324篇 |
1993年 | 250篇 |
1992年 | 218篇 |
1991年 | 189篇 |
1990年 | 146篇 |
1989年 | 138篇 |
1988年 | 124篇 |
1987年 | 74篇 |
1986年 | 81篇 |
1985年 | 66篇 |
1984年 | 75篇 |
1983年 | 45篇 |
1982年 | 58篇 |
1981年 | 32篇 |
1980年 | 33篇 |
1979年 | 32篇 |
1978年 | 15篇 |
1977年 | 24篇 |
1976年 | 15篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
王厚峰 《计算机研究与发展》1994,31(6):14-18
在对英文排版时,我们既应考虑单词之间的间隔,以便清晰可读,又应考虑节省版面,以便降低费用,本文通过详细地讨论两种算法可以解决这一矛盾。 相似文献
92.
Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(nk ) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L1 monotonic calculation. This procedure is highly efficient, requiring at most O(kn2 ) computer operations and O(n) best L1 monotonic calculations to subranges of data for a global minimum. 相似文献
93.
Brian J. Ross 《Formal Aspects of Computing》1997,9(3):331-348
Imperative programs can be inverted directly from their forward-directed program code with the use of logical inference. The relational semantics of imperative computations treats programs as logical relations over the observable state of the environment, which is taken to be the state of the variables in memory. Program relations denote both forward and backward computations, and the direction of the computation depends upon the instantiation pattern of arguments in the relation. This view of inversion has practical applications when the relational semantics is treated as a logic program. Depending on the logic programming inference scheme used, execution of this relational program can compute the inverse of the imperative program. A number of nontrivial imperative computations can be inverted with minimal logic programming tools. 相似文献
94.
This paper presents an efficient method which provides the optimal generation mix and the optimal generation construction process. The approximation method in which the dynamic programming technique and gradient method are combined is applied to determine the optimal generation mix with hydropower generation technologies. The successive approximations dynamic programming (SADP) technique, which is very suitable for high-dimensional multistage decision process problems, is used for obtaining the optimal generation construction process. The effectiveness and feasibility of the developed technique are demonstrated on a practical power system model which has five types of generation technologies including a hydropower generation technology. 相似文献
95.
96.
Jiang Taihui 《电子科学学刊(英文版)》1996,13(4):325-332
In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients. 相似文献
97.
Reorganisation and evolution of class hierarchies is important for object-oriented system development and has received considerable attention in the literature. The contributions of this paper are: (1) a formal study of a set of extension relations and transformations on class hierarchies; (2) a presentation of a small set of primitive transformations which form a minimal and complete basis for the extension relations; and (3) an analysis of the impact of these transformations at the object level.The study leads to a better understanding of evolution and reuse of object-oriented software and class hierarchies. It also provides a terminology and a means of classification for design reuse. The theory presented in this paper is based on the Demeter data model, which gives a concise mathematical foundation for classes and their inheritance and part-of relationships. Parts of the theory have been implemented in the Demeter System
TM
C++, a CASE tool for object-oriented design and programming. 相似文献
98.
V. A. Zheligovsky 《Journal of scientific computing》1993,8(1):41-68
The article discusses computational aspects of the kinematic problem of magnetic field generation by a Beltrami flow in a sphere. Galerkin's method is applied with a functional basis consisting of Laplace operator eigenfunctions. Dominant eigenvalues of the magnetic induction operator and associated magnetic eigenmodes are obtained numerically for a certain Beltrami flow for magnetic Reynolds numbers up to 100. The eigenvalue problem is solved by a highly optimized iterative procedure, which is quite general and can be applied to numerical treatment of arbitrary linear stability problems. 相似文献
99.
The present paper demonstrates the applicability of population based search optimization method, namely, Differential Evolution
(DE) to a case study of Mahi Bajaj Sagar Project (MBSP), India. Ten different strategies of DE are employed to assess the
ability of DE for solving higher dimensional problems as an alternative methodology for irrigation planning. The parameters
considered in DE are population size, crossover constant and weighting factor. Linear Programming (LP) is utilized as a comparative
approach to assess the ability of DE. Comparison of results of LP and the 10 DE strategies for the given parameters indicated
that both the results are comparable even for high dimensional problems. Extensive sensitivity analysis studies, performed
for 3,600 combinations of above parameters for the 10 DE strategies suggested that DE/rand-to-best/1/bin strategy is the best
strategy giving maximum benefits taking minimum CPU time. It is concluded that DE can be utilized for efficient planning of
any irrigation system with suitable modifications. 相似文献
100.
陈金强 《数字社区&智能家居》2007,(9):1460-1461
中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。 相似文献