全文获取类型
收费全文 | 14288篇 |
免费 | 913篇 |
国内免费 | 594篇 |
专业分类
电工技术 | 460篇 |
技术理论 | 4篇 |
综合类 | 1878篇 |
化学工业 | 272篇 |
金属工艺 | 137篇 |
机械仪表 | 538篇 |
建筑科学 | 1701篇 |
矿业工程 | 80篇 |
能源动力 | 155篇 |
轻工业 | 305篇 |
水利工程 | 105篇 |
石油天然气 | 49篇 |
武器工业 | 48篇 |
无线电 | 895篇 |
一般工业技术 | 1617篇 |
冶金工业 | 583篇 |
原子能技术 | 26篇 |
自动化技术 | 6942篇 |
出版年
2024年 | 119篇 |
2023年 | 243篇 |
2022年 | 295篇 |
2021年 | 261篇 |
2020年 | 378篇 |
2019年 | 275篇 |
2018年 | 246篇 |
2017年 | 330篇 |
2016年 | 344篇 |
2015年 | 425篇 |
2014年 | 741篇 |
2013年 | 894篇 |
2012年 | 874篇 |
2011年 | 988篇 |
2010年 | 730篇 |
2009年 | 946篇 |
2008年 | 951篇 |
2007年 | 999篇 |
2006年 | 910篇 |
2005年 | 743篇 |
2004年 | 673篇 |
2003年 | 575篇 |
2002年 | 511篇 |
2001年 | 388篇 |
2000年 | 307篇 |
1999年 | 219篇 |
1998年 | 219篇 |
1997年 | 207篇 |
1996年 | 136篇 |
1995年 | 112篇 |
1994年 | 98篇 |
1993年 | 73篇 |
1992年 | 77篇 |
1991年 | 45篇 |
1990年 | 43篇 |
1989年 | 43篇 |
1988年 | 50篇 |
1987年 | 31篇 |
1986年 | 27篇 |
1985年 | 37篇 |
1984年 | 51篇 |
1983年 | 31篇 |
1982年 | 22篇 |
1981年 | 22篇 |
1980年 | 19篇 |
1979年 | 13篇 |
1978年 | 7篇 |
1977年 | 12篇 |
1976年 | 9篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 17 毫秒
51.
A genetic algorithm for the optimisation of assembly sequences 总被引:6,自引:0,他引:6
This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product. 相似文献
52.
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a greedy heuristic. 相似文献
53.
Volker Turau 《Information Processing Letters》2007,103(3):88-93
This paper presents distributed self-stabilizing algorithms for the maximal independent and the minimal dominating set problems. Using an unfair distributed scheduler the algorithms stabilizes in at most max{3n−5,2n} resp. 9n moves. All previously known algorithms required O(n2) moves. 相似文献
54.
We present a new post processing method of simulating depth of field based on accurate calculations of circles of confusion. Compared to previous work, our method derives actual scene depth information directly from the existing depth buffer, requires no specialized rendering passes, and allows easy integration into existing rendering applications. Our implementation uses an adaptive, two‐pass filter, producing a high quality depth of field effect that can be executed entirely on the GPU, taking advantage of the parallelism of modern graphics cards and permitting real time performance when applied to large numbers of pixels. 相似文献
55.
The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP).
An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as
a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment
and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
The study was supported by INTAS (Project 06-1000017-8909).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007. 相似文献
56.
Ilan Gronau 《Information Processing Letters》2007,104(6):205-210
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’). 相似文献
57.
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a two-dimensional discrete radiation intensity matrix using a device called a multileaf collimator (MLC). Mathematically, the delivery of an intensity matrix using an MLC can be viewed as the problem of representing a non-negative integral matrix (i.e., the intensity matrix) by a linear combination of certain special non-negative integral matrices called segments, where each such segment corresponds to one of the allowed states of the MLC. The problem of representing the intensity matrix with the minimum number of segments is known to be NP-complete. In this paper, we present two approximation algorithms for this matrix representation problem. To the best of our knowledge, these are the first algorithms to achieve non-trivial performance guarantees for multi-row intensity matrices. 相似文献
58.
Real-time homogenous translucent material editing 总被引:4,自引:0,他引:4
This paper presents a novel method for real-time homogenous translucent material editing under fixed illumination. We consider the complete analytic BSSRDF model proposed by Jensen et al. [ [JMLH01] ], including both multiple scattering and single scattering. Our method allows the user to adjust the analytic parameters of BSSRDF and provides high-quality, real-time rendering feedback. Inspired by recently developed Precomputed Radiance Transfer (PRT) techniques, we approximate both the multiple scattering diffuse reflectance function and the single scattering exponential attenuation function in the analytic model using basis functions, so that re-computing the outgoing radiance at each vertex as parameters change reduces to simple dot products. In addition, using a non-uniform piecewise polynomial basis, we are able to achieve smaller approximation error than using bases adopted in previous PRT-based works, such as spherical harmonics and wavelets. Using hardware acceleration, we demonstrate that our system generates images comparable to [ [JMLH01] ]at real-time frame-rates. 相似文献
59.
An actor-critic type reinforcement learning algorithm is proposed and analyzed for constrained controlled Markov decision processes. The analysis uses multiscale stochastic approximation theory and the envelope theorem' of mathematical economics. 相似文献
60.
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. 相似文献