全文获取类型
收费全文 | 17674篇 |
免费 | 1579篇 |
国内免费 | 1093篇 |
专业分类
电工技术 | 1590篇 |
综合类 | 2231篇 |
化学工业 | 714篇 |
金属工艺 | 459篇 |
机械仪表 | 1201篇 |
建筑科学 | 631篇 |
矿业工程 | 416篇 |
能源动力 | 439篇 |
轻工业 | 161篇 |
水利工程 | 392篇 |
石油天然气 | 218篇 |
武器工业 | 134篇 |
无线电 | 1184篇 |
一般工业技术 | 1440篇 |
冶金工业 | 242篇 |
原子能技术 | 48篇 |
自动化技术 | 8846篇 |
出版年
2024年 | 54篇 |
2023年 | 149篇 |
2022年 | 241篇 |
2021年 | 288篇 |
2020年 | 381篇 |
2019年 | 437篇 |
2018年 | 370篇 |
2017年 | 548篇 |
2016年 | 617篇 |
2015年 | 680篇 |
2014年 | 964篇 |
2013年 | 1404篇 |
2012年 | 1016篇 |
2011年 | 1137篇 |
2010年 | 888篇 |
2009年 | 1001篇 |
2008年 | 1057篇 |
2007年 | 1129篇 |
2006年 | 1004篇 |
2005年 | 862篇 |
2004年 | 742篇 |
2003年 | 673篇 |
2002年 | 611篇 |
2001年 | 513篇 |
2000年 | 453篇 |
1999年 | 407篇 |
1998年 | 372篇 |
1997年 | 362篇 |
1996年 | 286篇 |
1995年 | 249篇 |
1994年 | 252篇 |
1993年 | 185篇 |
1992年 | 174篇 |
1991年 | 141篇 |
1990年 | 106篇 |
1989年 | 98篇 |
1988年 | 89篇 |
1987年 | 52篇 |
1986年 | 52篇 |
1985年 | 36篇 |
1984年 | 51篇 |
1983年 | 30篇 |
1982年 | 36篇 |
1981年 | 23篇 |
1980年 | 23篇 |
1979年 | 29篇 |
1978年 | 11篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
The Lambda Library (LL) adds a form of lambda functions to C++, which are common in functional programming languages. The LL is implemented as a template library using standard C++; thus no language extensions or preprocessing is required. The LL consists of a rich set of tools for defining unnamed functions. In particular these unnamed functions work seamlessly with the generic algorithms in the C++ Standard Library. The LL offers significant improvements, in terms of generality and ease of use, compared to the current tools in the C++ Standard Library. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
52.
The goal of the PMS project is to produce an environment in which the intelligent online assessment of the design for large-scale ADA programming projects is provided. The focus is on the representation of knowledge about the design process for an individual module. Changes in pseudocode complexity are measured in terms of partial metrics. These metrics can take the designers inferences about the pseudocode program structure into account when assessing module complexity. Next, a model of the stepwise refinement process is given which demonstrates how pseudocode elaboration decisions can be modelled in partial metric terms. Finally, the decisions associated with each refinement step for 17 example refinements taken from the computer science literature are described using partial metrics. 相似文献
53.
In this article, linear programming and fuzzy optimization models are developed for planning and management of available land-water-crop system of Mahanadi-Kathajodi delta in eastern India. The models are used to optimize the economic return, production and labour utilization, and to search the related cropping patterns and intensities with specified land, water, fertilizer and labour availability, and water use pattern constraints. Due to extreme backwardness of the study area, it has been decided to keep all the three objectives of the linear programming models at the same priority level to obtain the compromised solution in a fuzzy environment that incorporates the imprecision in fuzzy goals and fuzzy constraints. These non-structural models facilitate the conjunctive use of available surface water and groundwater resources. A comparative evaluation along with the benefit-cost ratios of the existing and proposed farming systems is also presented. 相似文献
54.
55.
We present our machine learning system, that uses inductive logic programming techniques to learn how to identify transmembrane
domains from amino acid sequences. Our system facilitates the use of operators such as ‘contains’, that act on entire sequences,
rather than on individual elements of a sequence. The prediction accuracy of our new system is around 93%, and this compares
favourably with earlier results.
This work was carried out with the support of a research grant from ISIS, Fujitsu Laboratories. 相似文献
56.
This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity. 相似文献
57.
This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented. 相似文献
58.
在基于单片机的智能化重力加速度测试仪中采用C语言编程简化了程序设计任务,对于汇编语言难于处理的浮点数运算及汉字打印输出可通过C语言编译器的内部库函数调用实现,介绍了一种专为8051系列单片机设计的C语言编译器Frankilin C51,它具有代码优化功能,能产生极高效率的机器码,并且提供了丰富的内部函数库。描述了C51函数库所支持的IEEE标准浮点数的内存格式以及采用sprintf()函数处理包括 相似文献
59.
J. Dingel 《Formal Aspects of Computing》2002,14(2):123-197
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to
the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists.
Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these
problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus
allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The
calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction
of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are
independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated.
Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification
notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus
rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement
relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality.
The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing
program and vice versa.
Received July 2001 / Accepted in revised form May 2002 相似文献
60.
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. 相似文献