全文获取类型
收费全文 | 65394篇 |
免费 | 9245篇 |
国内免费 | 5737篇 |
专业分类
电工技术 | 8143篇 |
技术理论 | 3篇 |
综合类 | 6711篇 |
化学工业 | 5136篇 |
金属工艺 | 2183篇 |
机械仪表 | 6209篇 |
建筑科学 | 2856篇 |
矿业工程 | 2124篇 |
能源动力 | 3080篇 |
轻工业 | 3723篇 |
水利工程 | 1700篇 |
石油天然气 | 2653篇 |
武器工业 | 842篇 |
无线电 | 5613篇 |
一般工业技术 | 5443篇 |
冶金工业 | 1941篇 |
原子能技术 | 310篇 |
自动化技术 | 21706篇 |
出版年
2024年 | 603篇 |
2023年 | 1551篇 |
2022年 | 2648篇 |
2021年 | 2793篇 |
2020年 | 3114篇 |
2019年 | 2645篇 |
2018年 | 2356篇 |
2017年 | 2920篇 |
2016年 | 3191篇 |
2015年 | 3555篇 |
2014年 | 5021篇 |
2013年 | 4791篇 |
2012年 | 5432篇 |
2011年 | 5482篇 |
2010年 | 3808篇 |
2009年 | 4016篇 |
2008年 | 3650篇 |
2007年 | 4111篇 |
2006年 | 3406篇 |
2005年 | 2852篇 |
2004年 | 2346篇 |
2003年 | 1929篇 |
2002年 | 1616篇 |
2001年 | 1296篇 |
2000年 | 1107篇 |
1999年 | 753篇 |
1998年 | 644篇 |
1997年 | 550篇 |
1996年 | 411篇 |
1995年 | 373篇 |
1994年 | 289篇 |
1993年 | 216篇 |
1992年 | 185篇 |
1991年 | 159篇 |
1990年 | 136篇 |
1989年 | 108篇 |
1988年 | 73篇 |
1987年 | 31篇 |
1986年 | 29篇 |
1985年 | 17篇 |
1984年 | 24篇 |
1983年 | 25篇 |
1982年 | 21篇 |
1981年 | 10篇 |
1980年 | 19篇 |
1979年 | 16篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1959年 | 5篇 |
1951年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
针对远程信息监测系统中数据的实时采集更新问题,将AJAX和CGI应用到嵌入式Web服务器的设计中,实现了服务器与浏览器之间的动态信息交互。本文首先分析了uIP协议栈,并在协议栈之上设计了Web服务器,然后利用CGI服务程序处理来自客户端的XMLHttpRequest对象请求,实现动态Web功能。现场实验结果表明,嵌入式Web服务器降低了服务器端的资源开销,提高了响应速度。 相似文献
92.
Simulation‐based optimization has become an important design tool in microwave engineering. However, using electromagnetic (EM) solvers in the design process is a challenging task, primarily due to a high‐computational cost of an accurate EM simulation. In this article, we present a review of EM‐based design optimization techniques exploiting response‐corrected physically based low‐fidelity models. The surrogate models created through such a correction can be used to yield a reasonable approximation of the optimal design of the computationally expensive structure under consideration (high‐fidelity model). Several approaches using this idea are reviewed including output space mapping, manifold mapping, adaptive response correction, and shape‐preserving response prediction. A common feature of these methods is that they are easy to implement and computationally efficient. Application examples are provided. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012. 相似文献
93.
This article presents an optimization technique for the design of substrate‐integrated waveguide (SIW) filters using knowledge‐embedded space mapping. An effective coarse model is proposed to represent the SIW filter. The proposed coarse model can be analyzed in the available commercial software ADS. The embedded knowledge includes not only formulas but also extracted design curves, which help to build the mapping between the coarse and fine models. The effectiveness of the proposed method is demonstrated through a design example of a six‐pole SIW filter. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012. 相似文献
94.
The kernelized fuzzy c-means algorithm uses kernel methods to improve the clustering performance of the well known fuzzy c-means algorithm by mapping a given dataset into a higher dimensional space non-linearly. Thus, the newly obtained dataset is more likely to be linearly seprable. However, to further improve the clustering performance, an optimization method is required to overcome the drawbacks of the traditional algorithms such as, sensitivity to initialization, trapping into local minima and lack of prior knowledge for optimum paramaters of the kernel functions. In this paper, to overcome these drawbacks, a new clustering method based on kernelized fuzzy c-means algorithm and a recently proposed ant based optimization algorithm, hybrid ant colony optimization for continuous domains, is proposed. The proposed method is applied to a dataset which is obtained from MIT–BIH arrhythmia database. The dataset consists of six types of ECG beats including, Normal Beat (N), Premature Ventricular Contraction (PVC), Fusion of Ventricular and Normal Beat (F), Artrial Premature Beat (A), Right Bundle Branch Block Beat (R) and Fusion of Paced and Normal Beat (f). Four time domain features are extracted for each beat type and training and test sets are formed. After several experiments it is observed that the proposed method outperforms the traditional fuzzy c-means and kernelized fuzzy c-means algorithms. 相似文献
95.
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. 相似文献
96.
Cagdas Hakan Aladag Ufuk Yolcu Erol Egrioglu Ali Z. Dalar 《Applied Soft Computing》2012,12(10):3291-3299
In the analysis of time invariant fuzzy time series, fuzzy logic group relationships tables have been generally preferred for determination of fuzzy logic relationships. The reason of this is that it is not need to perform complex matrix operations when these tables are used. On the other hand, when fuzzy logic group relationships tables are exploited, membership values of fuzzy sets are ignored. Thus, in defiance of fuzzy set theory, fuzzy sets’ elements with the highest membership value are only considered. This situation causes information loss and decrease in the explanation power of the model. To deal with these problems, a novel time invariant fuzzy time series forecasting approach is proposed in this study. In the proposed method, membership values in the fuzzy relationship matrix are computed by using particle swarm optimization technique. The method suggested in this study is the first method proposed in the literature in which particle swarm optimization algorithm is used to determine fuzzy relations. In addition, in order to increase forecasting accuracy and make the proposed approach more systematic, the fuzzy c-means clustering method is used for fuzzification of time series in the proposed method. The proposed method is applied to well-known time series to show the forecasting performance of the method. These time series are also analyzed by using some other forecasting methods available in the literature. Then, the results obtained from the proposed method are compared to those produced by the other methods. It is observed that the proposed method gives the most accurate forecasts. 相似文献
97.
Nowadays, various imitations of natural processes are used to solve challenging optimization problems faster and more accurately. Spin glass based optimization, specifically, has shown strong local search capability and parallel processing. But, spin glasses have a low rate of convergence since they use Monte Carlo simulation techniques such as simulated annealing (SA). Here, we propose two algorithms that combine the long range effect in spin glasses with extremal optimization (EO-SA) and learning automata (LA-SA). Instead of arbitrarily flipping spins at each step, these two strategies aim to choose the next spin and selectively exploiting the optimization landscape. As shown in this paper, this selection strategy can lead to faster rate of convergence and improved performance. The resulting two algorithms are then used to solve portfolio selection problem that is a non-polynomial (NP) complete problem. Comparison of test results indicates that the two algorithms, while being very different in strategy, provide similar performance and reach comparable probability distributions for spin selection. Furthermore, experiments show there is no difference in speed of LA-SA or EO-SA for glasses with fewer spins, but EO-SA responds much better than LA-SA for large glasses. This is confirmed by tests results of five of the world's major stock markets. In the last, the convergence speed is compared to other heuristic methods such as Neural Network (NN), Tabu Search (TS), and Genetic Algorithm (GA) to approve the truthfulness of proposed methods. 相似文献
98.
A new hybrid approach for dynamic optimization problems with continuous search spaces is presented. The proposed approach hybridizes efficient features of the particle swarm optimization in tracking dynamic changes with a new evolutionary procedure. In the proposed dynamic hybrid PSO (DHPSO) algorithm, the swarm size is varied in a self-regulatory manner. Inspired from the microbial life, the particles can reproduce infants and the old ones die. The infants are especially reproduced by high potential particles and located near the local optimum points, using the quadratic interpolation method. The algorithm is adapted to perform in continuous search spaces, utilizing continuous movement of the particles and using Euclidian norm to define the neighborhood in the reproduction procedure. The performance of the new proposed approach is tested against various benchmark problems and compared with those of some other heuristic optimization algorithms. In this regard, different types of dynamic environments including periodic, linear and random changes are taken with different performance metrics such as real-time error, offline performance and offline error. The results indicate a desirable better efficiency of the new algorithm over the existing ones. 相似文献
99.
In this article, we consider the project critical path problem in an environment with hybrid uncertainty. In this environment, the duration of activities are considered as random fuzzy variables that have probability and fuzzy natures, simultaneously. To obtain a robust critical path with this kind of uncertainty a chance constraints programming model is used. This model is converted to a deterministic model in two stages. In the first stage, the uncertain model is converted to a model with interval parameters by alpha-cut method and distribution function concepts. In the second stage, the interval model is converted to a deterministic model by robust optimization and min-max regret criterion and ultimately a genetic algorithm with a proposed exact algorithm are applied to solve the final model. Finally, some numerical examples are given to show the efficiency of the solution procedure. 相似文献
100.
C. Christopher ColumbusAuthor Vitae K. Chandrasekaran Author VitaeSishaj P. Simon Author Vitae 《Applied Soft Computing》2012,12(1):145-160
This paper proposes a nodal ant colony optimization (NACO) technique to solve profit based unit commitment problem (PBUCP). Generation companies (GENCOs) in a competitive restructured power market, schedule their generators with an objective to maximize their own profit without any regard for system social benefit. Power and reserve prices become important factors in decision process. Ant colony optimization that mimics the behavior of ants foraging activities is suitably implemented to search the UCP search space. Here a search space consisting of optimal combination of binary nodes for unit ON/OFF status is represented for the movement of the ants to maintain good exploration and exploitation search capabilities. The proposed model help GENCOs to make decisions on the quantity of power and reserve that must be put up for sale in the markets and also to schedule generators in order to receive the maximum profit. The effectiveness of the proposed technique for PBUCP is validated on 10 and 36 generating unit systems available in the literature. NACO yields an increase of profit, greater than 1.5%, in comparison with the basic ACO, Muller method and hybrid LR-GA. 相似文献