全文获取类型
收费全文 | 17338篇 |
免费 | 1401篇 |
国内免费 | 1083篇 |
专业分类
电工技术 | 1590篇 |
综合类 | 2134篇 |
化学工业 | 711篇 |
金属工艺 | 459篇 |
机械仪表 | 1196篇 |
建筑科学 | 480篇 |
矿业工程 | 278篇 |
能源动力 | 439篇 |
轻工业 | 161篇 |
水利工程 | 378篇 |
石油天然气 | 204篇 |
武器工业 | 134篇 |
无线电 | 1144篇 |
一般工业技术 | 1418篇 |
冶金工业 | 242篇 |
原子能技术 | 48篇 |
自动化技术 | 8806篇 |
出版年
2024年 | 52篇 |
2023年 | 149篇 |
2022年 | 237篇 |
2021年 | 287篇 |
2020年 | 378篇 |
2019年 | 428篇 |
2018年 | 346篇 |
2017年 | 512篇 |
2016年 | 547篇 |
2015年 | 625篇 |
2014年 | 924篇 |
2013年 | 1326篇 |
2012年 | 1000篇 |
2011年 | 1097篇 |
2010年 | 853篇 |
2009年 | 977篇 |
2008年 | 1051篇 |
2007年 | 1128篇 |
2006年 | 1004篇 |
2005年 | 861篇 |
2004年 | 741篇 |
2003年 | 671篇 |
2002年 | 610篇 |
2001年 | 513篇 |
2000年 | 453篇 |
1999年 | 405篇 |
1998年 | 325篇 |
1997年 | 338篇 |
1996年 | 286篇 |
1995年 | 247篇 |
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条查询结果,搜索用时 0 毫秒
31.
32.
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. 相似文献
33.
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 相似文献
34.
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. 相似文献
35.
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. 相似文献
36.
37.
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. 相似文献
38.
陈金强 《数字社区&智能家居》2007,(9):1460-1461
中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。 相似文献
39.
模糊规划在炼油厂生产计划优化中的应用 总被引:7,自引:1,他引:6
生产计划的编制是炼油化工企业生产经营管理中的一个关键环节,然而由于市场变化的不确定性,使得企业的长远规划制定受到限制,笔者将模糊数学应用于炼厂生产计划的编制,通过模糊规划对炼油企业生产计划进行优化,使编得的生产计划在一定程度上反映市场的变化并使企业的生产效益最优,为企业管理决策者进行长期规划给予指导,给出了实例来说明该方法的可行性。 相似文献
40.
杨怀义 《数字社区&智能家居》2006,(14)
网格袋布局管理器是java布局中最有用、最灵活、最复杂、最难掌握的一种布局管理器,实际上,如果我们明白了在布局时它利用了单元格相对坐标定位这一点,以及各个约束条件在布局中的作用,网格袋布局也会变得很轻松。 相似文献