全文获取类型
收费全文 | 11326篇 |
免费 | 975篇 |
国内免费 | 791篇 |
专业分类
电工技术 | 570篇 |
综合类 | 975篇 |
化学工业 | 191篇 |
金属工艺 | 121篇 |
机械仪表 | 624篇 |
建筑科学 | 205篇 |
矿业工程 | 65篇 |
能源动力 | 160篇 |
轻工业 | 60篇 |
水利工程 | 79篇 |
石油天然气 | 44篇 |
武器工业 | 63篇 |
无线电 | 1000篇 |
一般工业技术 | 924篇 |
冶金工业 | 147篇 |
原子能技术 | 28篇 |
自动化技术 | 7836篇 |
出版年
2024年 | 50篇 |
2023年 | 88篇 |
2022年 | 131篇 |
2021年 | 130篇 |
2020年 | 230篇 |
2019年 | 202篇 |
2018年 | 175篇 |
2017年 | 292篇 |
2016年 | 303篇 |
2015年 | 382篇 |
2014年 | 527篇 |
2013年 | 806篇 |
2012年 | 696篇 |
2011年 | 802篇 |
2010年 | 536篇 |
2009年 | 789篇 |
2008年 | 836篇 |
2007年 | 876篇 |
2006年 | 766篇 |
2005年 | 630篇 |
2004年 | 572篇 |
2003年 | 507篇 |
2002年 | 450篇 |
2001年 | 354篇 |
2000年 | 294篇 |
1999年 | 234篇 |
1998年 | 223篇 |
1997年 | 212篇 |
1996年 | 145篇 |
1995年 | 122篇 |
1994年 | 105篇 |
1993年 | 83篇 |
1992年 | 84篇 |
1991年 | 52篇 |
1990年 | 42篇 |
1989年 | 44篇 |
1988年 | 46篇 |
1987年 | 28篇 |
1986年 | 23篇 |
1985年 | 36篇 |
1984年 | 47篇 |
1983年 | 28篇 |
1982年 | 21篇 |
1981年 | 21篇 |
1980年 | 18篇 |
1979年 | 13篇 |
1978年 | 7篇 |
1977年 | 13篇 |
1976年 | 11篇 |
1975年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 19 毫秒
81.
A fast digital Radon transform based on recursively defined digital straight lines is described, which has the sequential complexity of N2 log N additions for an N × N image. This transform can be used to evaluate the Hough transform to detect straight lines in a digital image. Whilst a parallel implementation of the Hough transform algorithm is difficult because of global memory access requirements, the fast digital Radon transform is vectorizable and therefore well suited for parallel computation. The structure of the fast algorithm is shown to be quite similar to the FFT algorithm for decimation in frequency. It is demonstrated that even for sequential computation the fast Radon transform is an attractive alternative to the classical Hough transform algorithm. 相似文献
82.
本文首先根据三角模概念,定义了一类新的更具普遍意义的广义AND/OR图.根据新定义的启发式函数h(n,x)以及广义AND/OR图的最佳解树之所有子树亦是最佳子解树的原理,提出了广义AND/OR图的自底向上的启发式搜索算法BHAO.文中证明了算法BHAO的可采纳性.本文还提出了两类新的启发式函数的单调限制概念,并据此研究了算法BHAO的单调限制性质,研究了两个BHAO算法间的比较性质. 相似文献
83.
Young 《Algorithmica》2002,33(3):371-383
Abstract. Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified
size and retrieval cost , maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache
and pay the retrieval cost, and remove other files from the cache so that the total size of files remaining in the cache is
at most k . This problem generalizes previous paging and caching problems by allowing objects of arbitrary size and cost, both important attributes when caching files for world-wide-web browsers, servers, and proxies.
We give a simple deterministic on-line algorithm that generalizes many well-known paging and weighted-caching strategies,
including least-recently-used, first-in-first-out, flush-when-full, and the balance algorithm. On any request sequence, the
total cost incurred by the algorithm is at most k/(k-h+1) times the minimum possible using a cache of size h ≤ k .
For any algorithm satisfying the latter bound, we show it is also the case that for most choices of k , the retrieval cost is either insignificant or at most a constant (independent of k ) times the optimum. This helps explain why competitive ratios of many on-line paging algorithms have been typically observed
to be constant in practice. 相似文献
84.
Guang R. Gao 《Parallel Computing》1987,4(3):305-321
A new method of classification for numerical stability of parallel algorithms is proposed based on the theoretical foundation of forward error analysis. It partitions the algorithms according to their asymptotic stability—a measure introduced to relate the limiting behavior of the stability to the size of the problem. Using this method, the stability aspect of the pipelined solution technique for first-order and second-order linear recurrences—the core of a tridiagonal linear equation solver—is studied. In particular, it shows that the pipelined solution method of the first-order linear recurrences has the same degree of stability as the commonly used sequential evaluation algorithms. The stability problems of sequential and pipelined solution methods of the second-order linear recurrences are also studied. 相似文献
85.
Fast parallel Preconditioned Conjugate Gradient algorithms for robot manipulator dynamics simulation
In this paper fast parallel Preconditioned Conjugate Gradient (PCG) algorithms for robot manipulator forward dynamics, or dynamic simulation, problem are presented. By exploiting the inherent structure of the forward dynamics problem, suitable preconditioners are devised to accelerate the iterations. Also, based on the choice of preconditioners, a modified dynamic formulation is used to speedup both serial and parallel computation of each iteration. The implementation of the parallel algorithms on two interconnected processor arrays is discussed and their computation and communication complexities are analyzed. The simulation results for a Puma Arm are presented to illustrate the effectiveness of the proposed preconditioners. With a faster convergence due to preconditioning and a faster computation of iterations due to parallelization, the developed parallel PCG algorithms represent the fastest alternative for parallel computation of the problem withO(n) processors. 相似文献
86.
We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112. 相似文献
87.
On-Line Shape recognition with incremental training using binary synaptic weights algorithm 总被引:2,自引:0,他引:2
Recognition of hand drawn shapes is beneficial in drawing packages and automated sketch entry in handheld computers. In this paper, we propose a new approach to on-line geometric shape recognition with incremental training function, which utilizes a heuristic function to reduce noise and a neural network for classification and on-line training. Instead of recognizing segments of a drawing and then performing syntactical analysis to match with a predefined shape, which is weak in terms of generalization and dealing with noise, we examine the shape as a whole. The main concept of the recognition method is derived from the fact that internal angles are very important in the perceived shape of outlines. Our application's aim is to recognize elliptic, rectangular, and triangular shapes in a way similar to human cognition of these shapes. Human beings recognize such basic shapes regardless of the variations in size, noise on the shape border, rotation and in the case of triangles, regardless of the type of the triangle. The key concept is that the neural network learns the relationships between the internal angles of a shape and its classification, therefore only a few training samples which represent the class of the shape are sufficient. Fast meremental training, which is performed on-line, is accomplished by the use of the Binary Synaptic Weights algorithm, a one pass, feedforward neural network training algorithm. Incremental training offers the advantage of adjusting the recognition capability of the system to the user's drawings. the results are very successful, such that the neural network correctly classified shapes that did not have any resemblance to the shapes in the initial training set. 相似文献
88.
文章提出了一种利用无线传感器网络无线信号接收强度(RSSI)和移动锚节点轨迹来获得待定节点位置的算法。该算法在有多个可移动锚节点的情况下,定位将会更加高效。在定位阶段,通过RSSI测得锚节点到待定节点的距离,并利用三个以上移动锚节点的坐标(包括三个)来求解圆的方程,计算出待定节点的位置。 相似文献
89.
网页信息提取方法中的启发式规则,是识别网页标签信息、利用网页节点分析结果、针对网页不同内容、完成信息提取的重要手段。本研究在对现有启发式规则进行研究分析的基础上,提出了几种优化的启发式规则,实现对网页标题、发布时间、来源以及正文内容等元素信息的精准提取。本研究进一步提出了运用编辑距离算法实现正文内容提取准确率的判定,并提出阙值优化方法,克服了正文提取中噪声节点多、内容识别不完全的缺陷,大大提高了提取的准确度。 相似文献
90.
云计算资源管理系统是用于接收来自云计算用户的资源请求,并且把特定的资源封装为服务提供给资源请求者。在云计算环境下,如何为资源请求者选择合适的资源是一个值得研究的课题。文中通过对云计算下现有的资源提供策略的分析,同时根据不同云提供者提供的计算资源的成本不同的特点,综合考虑资源的计算能力、可靠性和单位成本三点因素,提出了云计算下基于CRP算法的资源提供策略。这种资源提供策略既能提供满足用户资源请求的服务,也能降低云服务提供者的运营成本,从而获得更大收益。 相似文献