全文获取类型
收费全文 | 10394篇 |
免费 | 649篇 |
国内免费 | 531篇 |
专业分类
电工技术 | 448篇 |
综合类 | 824篇 |
化学工业 | 163篇 |
金属工艺 | 112篇 |
机械仪表 | 549篇 |
建筑科学 | 180篇 |
矿业工程 | 57篇 |
能源动力 | 155篇 |
轻工业 | 50篇 |
水利工程 | 68篇 |
石油天然气 | 44篇 |
武器工业 | 48篇 |
无线电 | 886篇 |
一般工业技术 | 786篇 |
冶金工业 | 50篇 |
原子能技术 | 31篇 |
自动化技术 | 7123篇 |
出版年
2024年 | 34篇 |
2023年 | 59篇 |
2022年 | 97篇 |
2021年 | 95篇 |
2020年 | 157篇 |
2019年 | 146篇 |
2018年 | 119篇 |
2017年 | 224篇 |
2016年 | 249篇 |
2015年 | 323篇 |
2014年 | 457篇 |
2013年 | 670篇 |
2012年 | 575篇 |
2011年 | 703篇 |
2010年 | 450篇 |
2009年 | 727篇 |
2008年 | 776篇 |
2007年 | 794篇 |
2006年 | 711篇 |
2005年 | 569篇 |
2004年 | 532篇 |
2003年 | 482篇 |
2002年 | 415篇 |
2001年 | 320篇 |
2000年 | 279篇 |
1999年 | 212篇 |
1998年 | 227篇 |
1997年 | 201篇 |
1996年 | 137篇 |
1995年 | 107篇 |
1994年 | 109篇 |
1993年 | 77篇 |
1992年 | 74篇 |
1991年 | 45篇 |
1990年 | 39篇 |
1989年 | 44篇 |
1988年 | 49篇 |
1987年 | 32篇 |
1986年 | 24篇 |
1985年 | 36篇 |
1984年 | 49篇 |
1983年 | 32篇 |
1982年 | 22篇 |
1981年 | 23篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 10篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
Joel 《Journal of Parallel and Distributed Computing》2005,65(12):1601-1606
Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results. 相似文献
82.
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. 相似文献
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.
文章提出了一种利用无线传感器网络无线信号接收强度(RSSI)和移动锚节点轨迹来获得待定节点位置的算法。该算法在有多个可移动锚节点的情况下,定位将会更加高效。在定位阶段,通过RSSI测得锚节点到待定节点的距离,并利用三个以上移动锚节点的坐标(包括三个)来求解圆的方程,计算出待定节点的位置。 相似文献
88.
This paper addresses the problem of approximating parameter dependent nonlinear systems in a unified framework. This modeling has been presented for the first time in the form of parameter dependent piecewise affine systems. In this model, the matrices and vectors defining piecewise affine systems are affine functions of parameters. Modeling of the system is done based on distinct spaces of state and parameter, and the operating regions are partitioned into the sections that we call ’multiplied simplices’. It is proven that this method of partitioning leads to less complexity of the approximated model compared with the few existing methods for modeling of parameter dependent nonlinear systems. It is also proven that the approximation is continuous for continuous functions and can be arbitrarily close to the original one. Next, the approximation error is calculated for a special class of parameter dependent nonlinear systems. For this class of systems, by solving an optimization problem, the operating regions can be partitioned into the minimum number of hyper-rectangles such that the modeling error does not exceed a specified value. This modeling method can be the first step towards analyzing the parameter dependent nonlinear systems with a uniform method. 相似文献
89.
云计算资源管理系统是用于接收来自云计算用户的资源请求,并且把特定的资源封装为服务提供给资源请求者。在云计算环境下,如何为资源请求者选择合适的资源是一个值得研究的课题。文中通过对云计算下现有的资源提供策略的分析,同时根据不同云提供者提供的计算资源的成本不同的特点,综合考虑资源的计算能力、可靠性和单位成本三点因素,提出了云计算下基于CRP算法的资源提供策略。这种资源提供策略既能提供满足用户资源请求的服务,也能降低云服务提供者的运营成本,从而获得更大收益。 相似文献
90.
使用无源时差(TDOA)定位技术确定无人机等小型辐射源目标的位置是当前研究的热点,针对时差定位算法较为复杂的实际情况,推导了时差双曲线的几何解,并提出了一种基于自适应无迹粒子滤波(AUPF)技术的移动目标定位跟踪方法。通过仿真对该方法在不同场景的应用效果进行了验证,进一步比较分析了算法的定位精度。结果表明,基于自适应无迹粒子滤波的时差几何定位跟踪算法可以在多种情况下较好地拟合出目标真实运动轨迹,实现对运动目标的定位跟踪,同时拥有更低的定位误差和更高的轨迹包容度,使用该方法可以显著提高对非合作移动辐射源目标的位置估计性能。 相似文献