全文获取类型
收费全文 | 4788篇 |
免费 | 556篇 |
国内免费 | 533篇 |
专业分类
电工技术 | 390篇 |
综合类 | 546篇 |
化学工业 | 137篇 |
金属工艺 | 49篇 |
机械仪表 | 198篇 |
建筑科学 | 263篇 |
矿业工程 | 71篇 |
能源动力 | 108篇 |
轻工业 | 36篇 |
水利工程 | 229篇 |
石油天然气 | 145篇 |
武器工业 | 69篇 |
无线电 | 573篇 |
一般工业技术 | 278篇 |
冶金工业 | 74篇 |
原子能技术 | 37篇 |
自动化技术 | 2674篇 |
出版年
2024年 | 16篇 |
2023年 | 63篇 |
2022年 | 57篇 |
2021年 | 84篇 |
2020年 | 97篇 |
2019年 | 121篇 |
2018年 | 85篇 |
2017年 | 130篇 |
2016年 | 131篇 |
2015年 | 159篇 |
2014年 | 217篇 |
2013年 | 259篇 |
2012年 | 273篇 |
2011年 | 332篇 |
2010年 | 273篇 |
2009年 | 328篇 |
2008年 | 350篇 |
2007年 | 433篇 |
2006年 | 340篇 |
2005年 | 311篇 |
2004年 | 251篇 |
2003年 | 229篇 |
2002年 | 192篇 |
2001年 | 138篇 |
2000年 | 130篇 |
1999年 | 120篇 |
1998年 | 103篇 |
1997年 | 114篇 |
1996年 | 98篇 |
1995年 | 71篇 |
1994年 | 90篇 |
1993年 | 60篇 |
1992年 | 39篇 |
1991年 | 45篇 |
1990年 | 18篇 |
1989年 | 23篇 |
1988年 | 19篇 |
1987年 | 13篇 |
1986年 | 4篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1962年 | 2篇 |
排序方式: 共有5877条查询结果,搜索用时 15 毫秒
81.
Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time. 相似文献
82.
针对图像的Legendre正交矩计算量大和矩值求解过程中存在离散近似误差等问题,提出一种新的高精度快速计算图像Legendre矩方法.文中首先提出一种最大块优先分块策略,然后在此基础上,根据图像像素灰度值的取值特征将图像进行分块表示,以每个图像块为单位计算图像的Legendre矩.实验结果表明,与现有的快速算法相比,文中方法在保证矩值高精确的前提下,有效地减少了算术运算的次数,降低了计算复杂度,具有较快的计算速度. 相似文献
83.
84.
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant separately and then combines them into a global Smith form, whereas other algorithms apply a sequence of unimodular row and column operations to the original matrix. The performance of the algorithm in exact arithmetic is reported for several test cases. 相似文献
85.
fKenzo (=friendly Kenzo) is a graphical user interface providing a user-friendly front-end for the Kenzo system, a Common Lisp program devoted to Algebraic Topology. The fKenzo system provides the user interface itself, an XML intermediary generator-translator and, finally the Kenzo kernel. We describe in this paper the main points of fKenzo, and we explain also the advantages and limitations of fKenzo with respect to Kenzo itself. The text is separated into two parts, trying to cover both the user and the developer perspectives. 相似文献
86.
A new hybrid differential evolution algorithm, in which an ant system is used to select the optimal base vector of mutation operation, named the ant system differential evolution (ASDE), is proposed. In ASDE, each dimension in the feasible solution space is divided into several subspaces evenly, and each subspace is marked with the same initial intensity of pheromone trails. The probability of choosing an individual as the base vector is influenced by the visibility and pheromone quantity of the individual. The trail of the selected base vector’s location subspaces will be reinforced with some pheromones, when the offspring is better than its parent. The experimental results show that the ASDE generally outperforms the other differential evolution algorithms for nine benchmark functions. Furthermore, the ASDE is applied to develop the global kinetic model for SO2 oxidation on the Cs-Rb-V catalyst, and satisfactory results are obtained. 相似文献
87.
Antonio Fernández-CaballeroAuthor Vitae María T. LópezAuthor Vitae Enrique J. CarmonaAuthor VitaeAna E. DelgadoAuthor Vitae 《Neurocomputing》2011,74(8):1175-1181
Certainly, one of the prominent ideas of Professor José Mira was that it is absolutely mandatory to specify the mechanisms and/or processes underlying each task and inference mentioned in an architecture in order to make operational that architecture. The conjecture of the last fifteen years of joint research has been that any bottom-up organization may be made operational using two biologically inspired methods called “algorithmic lateral inhibition”, a generalization of lateral inhibition anatomical circuits, and “accumulative computation”, a working memory related to the temporal evolution of the membrane potential. This paper is dedicated to the computational formulation of both methods. Finally, all of the works of our group related to this methodological approximation are mentioned and summarized, showing that all of them support the validity of this approximation. 相似文献
88.
Xiao-Juan Luo Triantafyllos Stylianopoulos Victor H. Barocas Mark S. Shephard 《Engineering with Computers》2009,25(1):87-95
The mechanical function of soft collagenous tissues is inherently multiscale, with the tissue dimension being in the centimeter
length scale and the underlying collagen network being in the micrometer length scale. This paper uses a volume averaging
multiscale model to predict the collagen gel mechanics. The model is simulated using a multiscale component toolkit that is
capable of dealing with any 3D geometries. Each scale in the multiscale model is treated as an independent component that
exchanges the deformation and average stress information through a scale-linking operator. An arterial bifurcation was simulated
using the multiscale model, and the results demonstrated that the mechanical response of the soft tissues is strongly sensitive
to the network orientation and fiber-to-fiber interactions. 相似文献
89.
Existing Global Data Computation (GDC) protocols for asynchronous systems are round-based algorithms designed for fully connected networks. In this paper, we discuss GDC in asynchronous chordal rings, a non-fully connected network. The virtual links approach to solve the consensus problem may be applied to GDC for non-fully connected networks, but it incurs high message overhead. To reduce the overhead, we propose a new non-round-based GDC protocol for asynchronous chordal rings with perfect failure detectors. The main advantage of the protocol is that there is no notion of rounds. Every process creates two messages initially, with one message traversing in a clockwise direction and visiting each and every process in the chordal ring. The second message traverses in a counterclockwise direction. When there is direct connection between two processes, a message is sent directly. Otherwise, the message is sent via virtual links. When the two messages return, the process decides according to the information maintained by the two messages. The perfect failure detector of a process need only detect the crash of neighboring processes, and the crash information is disseminated to all other processes. Analysis and comparison with two virtual links approaches show that our protocol reduces message complexity significantly. 相似文献
90.
Given a list of n items and a function defined over sub-lists, we study the space required for computing the function for arbitrary sub-lists in constant time.For the function mode we improve the previously known space bound O(n2/logn) to O(n2loglogn/log2n) words.For median the space bound is improved to O(n2loglog2n/log2n) words from O(n2⋅log(k)n/logn), where k is an arbitrary constant and log(k) is the iterated logarithm. 相似文献