全文获取类型
收费全文 | 20060篇 |
免费 | 1761篇 |
国内免费 | 1585篇 |
专业分类
电工技术 | 945篇 |
技术理论 | 1篇 |
综合类 | 2945篇 |
化学工业 | 1195篇 |
金属工艺 | 328篇 |
机械仪表 | 1158篇 |
建筑科学 | 1632篇 |
矿业工程 | 408篇 |
能源动力 | 460篇 |
轻工业 | 472篇 |
水利工程 | 547篇 |
石油天然气 | 447篇 |
武器工业 | 121篇 |
无线电 | 1417篇 |
一般工业技术 | 2457篇 |
冶金工业 | 818篇 |
原子能技术 | 122篇 |
自动化技术 | 7933篇 |
出版年
2024年 | 56篇 |
2023年 | 157篇 |
2022年 | 257篇 |
2021年 | 334篇 |
2020年 | 439篇 |
2019年 | 479篇 |
2018年 | 453篇 |
2017年 | 574篇 |
2016年 | 710篇 |
2015年 | 652篇 |
2014年 | 1338篇 |
2013年 | 1382篇 |
2012年 | 1545篇 |
2011年 | 1382篇 |
2010年 | 1145篇 |
2009年 | 1336篇 |
2008年 | 1385篇 |
2007年 | 1416篇 |
2006年 | 1259篇 |
2005年 | 1154篇 |
2004年 | 877篇 |
2003年 | 811篇 |
2002年 | 622篇 |
2001年 | 624篇 |
2000年 | 541篇 |
1999年 | 413篇 |
1998年 | 327篇 |
1997年 | 277篇 |
1996年 | 220篇 |
1995年 | 192篇 |
1994年 | 172篇 |
1993年 | 143篇 |
1992年 | 121篇 |
1991年 | 98篇 |
1990年 | 92篇 |
1989年 | 100篇 |
1988年 | 72篇 |
1987年 | 40篇 |
1986年 | 21篇 |
1985年 | 20篇 |
1984年 | 13篇 |
1983年 | 17篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 8篇 |
1979年 | 8篇 |
1975年 | 8篇 |
1964年 | 8篇 |
1963年 | 9篇 |
1961年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs. 相似文献
52.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
53.
Inverse surface design problems from light transport behavior specification usually represent extremely complex and costly processes, but their importance is well known. In particular, they are very interesting for lighting and luminaire design, in which it is usually difficult to test design decisions on a physical model in order to avoid costly mistakes. In this survey, we present the main ideas behind these kinds of problems, characterize them, and summarize existing work in the area, revealing problems that remain open and possible areas of further research. 相似文献
54.
陈金强 《数字社区&智能家居》2007,(9):1460-1461
中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。 相似文献
55.
Donguk Kim Author Vitae Author Vitae Kokichi Sugihara Author Vitae 《Computer aided design》2006,38(1):14-21
The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust. 相似文献
56.
Mulcahy Nicholas J.; Call Josep; Dunbar Robin I. M. 《Canadian Metallurgical Quarterly》2005,119(1):23
Two important elements in problem solving are the abilities to encode relevant task features and to combine multiple actions to achieve the goal. The authors investigated these 2 elements in a task in which gorillas (Gorilla gorilla) and orangutans (Pongo pygmaeus) had to use a tool to retrieve an out-of-reach reward. Subjects were able to select tools of an appropriate length to reach the reward even when the position of the reward and tools were not simultaneously visible. When presented with tools that were too short to retrieve the reward, subjects were more likely to refuse to use them than when tools were the appropriate length. Subjects were proficient at using tools in sequence to retrieve the reward. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
57.
Yahia Lebbah 《Artificial Intelligence》2002,139(1):109-132
Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper1 we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis. 相似文献
58.
Larry Wos 《Journal of Automated Reasoning》1987,3(4):433-435
This article is the fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research focuses on finding criteria that would enable an automated reasoning program to expand or contract definitions wisely. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38. 相似文献
59.
P. I. Stetsyuk 《Cybernetics and Systems Analysis》2006,42(1):54-64
New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found
by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the
models proposed. Recommendations on how to develop its strengthened analogs are given.
This study is partially sponsored from the grant UM2-2574-KV-03 (CRDF Cooperative Grants Program).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 63—75, January–February 2006. 相似文献
60.
An optimal control problem with nonsmooth performance criterion described by a system of ordinary differential equations is considered. Necessary first-order optimality conditions are obtained. 相似文献