全文获取类型
收费全文 | 10512篇 |
免费 | 681篇 |
国内免费 | 535篇 |
专业分类
电工技术 | 462篇 |
综合类 | 825篇 |
化学工业 | 165篇 |
金属工艺 | 118篇 |
机械仪表 | 594篇 |
建筑科学 | 195篇 |
矿业工程 | 61篇 |
能源动力 | 157篇 |
轻工业 | 74篇 |
水利工程 | 70篇 |
石油天然气 | 44篇 |
武器工业 | 59篇 |
无线电 | 1047篇 |
一般工业技术 | 790篇 |
冶金工业 | 44篇 |
原子能技术 | 28篇 |
自动化技术 | 6995篇 |
出版年
2024年 | 33篇 |
2023年 | 62篇 |
2022年 | 98篇 |
2021年 | 102篇 |
2020年 | 159篇 |
2019年 | 145篇 |
2018年 | 116篇 |
2017年 | 227篇 |
2016年 | 250篇 |
2015年 | 328篇 |
2014年 | 477篇 |
2013年 | 674篇 |
2012年 | 605篇 |
2011年 | 695篇 |
2010年 | 471篇 |
2009年 | 694篇 |
2008年 | 768篇 |
2007年 | 790篇 |
2006年 | 720篇 |
2005年 | 597篇 |
2004年 | 558篇 |
2003年 | 499篇 |
2002年 | 423篇 |
2001年 | 330篇 |
2000年 | 288篇 |
1999年 | 227篇 |
1998年 | 228篇 |
1997年 | 209篇 |
1996年 | 139篇 |
1995年 | 114篇 |
1994年 | 101篇 |
1993年 | 77篇 |
1992年 | 76篇 |
1991年 | 46篇 |
1990年 | 37篇 |
1989年 | 42篇 |
1988年 | 48篇 |
1987年 | 27篇 |
1986年 | 23篇 |
1985年 | 34篇 |
1984年 | 47篇 |
1983年 | 29篇 |
1982年 | 22篇 |
1981年 | 22篇 |
1980年 | 19篇 |
1979年 | 13篇 |
1978年 | 7篇 |
1977年 | 14篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 187 毫秒
111.
基于模糊数据挖掘和遗传算法的网络入侵检测技术 总被引:2,自引:0,他引:2
文章通过开发一套新的网络入侵检测系统来证实应用模糊逻辑和遗传算法的数据挖掘技术的有效性;这个系统联合了基于模糊数据挖掘技术的异常检测和基于专家系统的滥用检测,在开发异常检测的部分时,利用模糊数据挖掘技术来从正常的行为存储模式中寻找差异,遗传算法用来调整模糊隶属函数和选择一个合适的特征集合,滥用检测部分用于寻找先前行为描述模式,这种模式很可能预示着入侵,网络的通信量和系统的审计数据被用做两个元件的输入;此系统的系统结构既支持异常检测又支持滥用检测、既适用于个人工作站又可以适用于复杂网络。 相似文献
112.
《Optimization methods & software》2012,27(4):573-585
Interior point (IP) algorithms for Min Cost Flow (MCF) problems have been shown to be competitive with combinatorial approaches, at least on some problem classes and for very large instances. This is in part due to availability of specialized crossover routines for MCF; these allow early termination of the IP approach, sparing it with the final iterations where the Karush Kuhn-Tucker (KKT) systems become more difficult to solve. As the crossover procedures are nothing but combinatorial approaches to MCF that are only allowed to perform few iterations, the IP algorithm can be seen as a complex ‘multiple crash start’ routine for the combinatorial ones. We report our experiments of allowing one primal-dual combinatorial algorithm to MCF to perform as many iterations as required to solve the problem after being warm-started by an IP approach. Our results show that the efficiency of the combined approach critically depends on the accurate selection of a set of parameters among very many possible ones, for which designing accurate guidelines appears not to be an easy task; however, they also show that the combined approach can be competitive with the original combinatorial algorithm, at least on some ‘difficult’ instances. 相似文献
113.
Motivated by both distributed computation and decentralized control applications, we studied the distributed linear iterative algorithms with memory. Specifically, we showed that the system of linear equations G x = b can be solved through a distributed linear iteration for arbitrary invertible G using only a single memory element at each processor. Further, we demonstrated that the memoried distributed algorithm can be designed to achieve much faster convergence than a memoryless distributed algorithm. Two small simulation examples were included to illustrate the results. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
114.
Biogeography-based optimization (BBO) is a new evolutionary optimization method inspired by biogeography. In this paper, BBO is extended to a multi-objective optimization, and a biogeography-based multi-objective optimization (BBMO) is introduced, which uses the cluster attribute of islands to naturally decompose the problem. The proposed algorithm makes use of nondominated sorting approach to improve the convergence ability effciently. It also combines the crowding distance to guarantee the diversity of Pareto optimal solutions. We compare the BBMO with two representative state-of-the-art evolutionary multi-objective optimization methods, non-dominated sorting genetic algorithm-II (NSGA-II) and archive-based micro genetic algorithm (AMGA) in terms of three metrics. Simulation results indicate that in most cases, the proposed BBMO is able to find much better spread of solutions and converge faster to true Pareto optimal fronts than NSGA-II and AMGA do. 相似文献
115.
Over the last few decades, many different evolutionary algorithms have been introduced for solving constrained optimization problems. However, due to the variability of problem characteristics, no single algorithm performs consistently over a range of problems. In this paper, instead of introducing another such algorithm, we propose an evolutionary framework that utilizes existing knowledge to make logical changes for better performance. The algorithmic aspects considered here are: the way of using search operators, dealing with feasibility, setting parameters, and refining solutions. The combined impact of such modifications is significant as has been shown by solving two sets of test problems: (i) a set of 24 test problems that were used for the CEC2006 constrained optimization competition and (ii) a second set of 36 test instances introduced for the CEC2010 constrained optimization competition. The results demonstrate that the proposed algorithm shows better performance in comparison to the state-of-the-art algorithms. 相似文献
116.
A parallel micro evolutionary algorithm for heterogeneous computing and grid scheduling 总被引:1,自引:0,他引:1
This work presents a novel parallel micro evolutionary algorithm for scheduling tasks in distributed heterogeneous computing and grid environments. The scheduling problem in heterogeneous environments is NP-hard, so a significant effort has been made in order to develop an efficient method to provide good schedules in reduced execution times. The parallel micro evolutionary algorithm is implemented using MALLBA, a general-purpose library for combinatorial optimization. Efficient numerical results are reported in the experimental analysis performed on both well-known problem instances and large instances that model medium-sized grid environments. The comparative study of traditional methods and evolutionary algorithms shows that the parallel micro evolutionary algorithm achieves a high problem solving efficacy, outperforming previous results already reported in the related literature, and also showing a good scalability behavior when facing high dimension problem instances. 相似文献
117.
Pattern recognition techniques have been widely used in a variety of scientific disciplines including computer vision, artificial intelligence, biology, and so forth. Although many methods present satisfactory performances, they still have several weak points, thus leaving a lot of space for further improvements. In this paper, we propose two performance-driven subspace learning methods by extending the principal component analysis (PCA) and the kernel PCA (KPCA). Both methods adopt a common structure where genetic algorithms are employed to pursue optimal subspaces. Because the proposed feature extractors aim at achieving high classification accuracy, enhanced generalization ability can be expected. Extensive experiments are designed to evaluate the effectiveness of the proposed algorithms in real-world problems including object recognition and a number of machine learning tasks. Comparative studies with other state-of-the-art techniques show that the methods in this paper are capable of enhancing generalization ability for pattern recognition systems. 相似文献
118.
Chien-Feng Huang 《Applied Soft Computing》2012,12(2):807-818
In the areas of investment research and applications, feasible quantitative models include methodologies stemming from soft computing for prediction of financial time series, multi-objective optimization of investment return and risk reduction, as well as selection of investment instruments for portfolio management based on asset ranking using a variety of input variables and historical data, etc. Among all these, stock selection has long been identified as a challenging and important task. This line of research is highly contingent upon reliable stock ranking for successful portfolio construction. Recent advances in machine learning and data mining are leading to significant opportunities to solve these problems more effectively. In this study, we aim at developing a methodology for effective stock selection using support vector regression (SVR) as well as genetic algorithms (GAs). We first employ the SVR method to generate surrogates for actual stock returns that in turn serve to provide reliable rankings of stocks. Top-ranked stocks can thus be selected to form a portfolio. On top of this model, the GA is employed for the optimization of model parameters, and feature selection to acquire optimal subsets of input variables to the SVR model. We will show that the investment returns provided by our proposed methodology significantly outperform the benchmark. Based upon these promising results, we expect this hybrid GA-SVR methodology to advance the research in soft computing for finance and provide an effective solution to stock selection in practice. 相似文献
119.
LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:
相似文献
1. | There exists a family of cyclic nonconstant boolean functions which can be evaluated with expected complexity bits by arandomized algorithm forR. |
2. | Anynondeterministic algorithm forR which evaluates any cyclic nonconstant function has communication complexity bits. |
120.
Given a planar setS ofn points,maxdominance problems consist of computing, for everyp S, some function of the maxima of the subset ofS that is dominated byp. A number of geometric and graph-theoretic problems can be formulated as maxdominance problems, including the problem of computing a minimum independent dominating set in a permutation graph, the related problem of finding the shortest maximal increasing subsequence, the problem of enumerating restricted empty rectangles, and the related problem of computing the largest empty rectangle. We give an algorithm for optimally solving a class of maxdominance problems. A straightforward application of our algorithm yields improved time bounds for the above-mentioned problems. The techniques used in the algorithm are of independent interest, and include a linear-time tree computation that is likely to arise in other contexts.The research of this author was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.This author's research was supported by the National Science Foundation under Grant DCR-8506361. 相似文献