全文获取类型
收费全文 | 72607篇 |
免费 | 13535篇 |
国内免费 | 9329篇 |
专业分类
电工技术 | 9257篇 |
技术理论 | 2篇 |
综合类 | 9190篇 |
化学工业 | 1999篇 |
金属工艺 | 1599篇 |
机械仪表 | 5535篇 |
建筑科学 | 2194篇 |
矿业工程 | 1738篇 |
能源动力 | 2014篇 |
轻工业 | 1073篇 |
水利工程 | 1331篇 |
石油天然气 | 1028篇 |
武器工业 | 1276篇 |
无线电 | 12422篇 |
一般工业技术 | 4524篇 |
冶金工业 | 883篇 |
原子能技术 | 297篇 |
自动化技术 | 39109篇 |
出版年
2024年 | 580篇 |
2023年 | 1358篇 |
2022年 | 2574篇 |
2021年 | 2796篇 |
2020年 | 3093篇 |
2019年 | 2578篇 |
2018年 | 2503篇 |
2017年 | 2940篇 |
2016年 | 3399篇 |
2015年 | 3995篇 |
2014年 | 5217篇 |
2013年 | 4948篇 |
2012年 | 6271篇 |
2011年 | 6504篇 |
2010年 | 5325篇 |
2009年 | 5445篇 |
2008年 | 5673篇 |
2007年 | 6179篇 |
2006年 | 4910篇 |
2005年 | 4007篇 |
2004年 | 3238篇 |
2003年 | 2541篇 |
2002年 | 1901篇 |
2001年 | 1513篇 |
2000年 | 1291篇 |
1999年 | 990篇 |
1998年 | 796篇 |
1997年 | 624篇 |
1996年 | 498篇 |
1995年 | 351篇 |
1994年 | 319篇 |
1993年 | 226篇 |
1992年 | 210篇 |
1991年 | 122篇 |
1990年 | 137篇 |
1989年 | 95篇 |
1988年 | 63篇 |
1987年 | 24篇 |
1986年 | 31篇 |
1985年 | 31篇 |
1984年 | 24篇 |
1983年 | 24篇 |
1982年 | 25篇 |
1981年 | 14篇 |
1980年 | 21篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1975年 | 9篇 |
1959年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances. 相似文献
12.
目前管道泄漏检测方法可有效检测突发泄漏,对于缓慢泄漏则存在检测灵敏度低、定位不准确等问题。基于此,提出了一种基于信号增强的缓慢泄漏检测方法。通过信号压缩(抽取及移位)克服缓慢泄漏压力信号下降平缓的缺点;根据声波信号具有波形尖锐突出、对突发泄漏敏感的优点,通过建立以压力为输入、虚拟声波为输出的声波信号变送器模型,将压力信号转换为声波信号,克服了泄漏压力信号容易被淹没在管道压力波动及背景噪声中的缺点,实现了缓慢泄漏信号的增强;利用临近插值方法重构虚拟声波信号,基于延时互相关分析实现了缓慢泄漏的准确定位。实验结果表明,该方法具有显著的信号增强效果和定位精度,实现了缓慢泄漏的准确检测。 相似文献
13.
Optimal power flow with generation reallocation is a suitable method for better utilization of the existing system. In recent years, Flexible AC Transmission System (FACTS) devices, have led to the development of controllers that provide controllability and flexibility for power transmission. Out of the FACTS devices unified power flow controller (UPFC) is a versatile device, capable of controlling the power system parameters like voltage magnitude, phase angle and line impedance individually or simultaneously. The main aim of this paper is to minimize real power losses in a power system using BAT search algorithm without and with the presence of UPFC. Minimization of real power losses is done by considering the power generated by generator buses, voltage magnitudes at generator buses and reactive power injection from reactive power compensators. The proposed BAT algorithm based Optimal Power Flow (OPF) has been tested on a 5 bus test system and modified IEEE 30 bus system without and with UPFC. The results of the system with and without UPFC are compared in terms of active power losses in the transmission line using BAT algorithm. The obtained results are also compared with Genetic algorithm (GA). 相似文献
14.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献
15.
This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation. 相似文献
16.
We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately. 相似文献
17.
Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks. 相似文献
18.
Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed. 相似文献
19.
The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods. 相似文献
20.
Creating an intelligent system that can accurately predict stock price in a robust way has always been a subject of great interest for many investors and financial analysts. Predicting future trends of financial markets is more remarkable these days especially after the recent global financial crisis. So traders who access to a powerful engine for extracting helpful information throw raw data can meet the success. In this paper we propose a new intelligent model in a multi-agent framework called bat-neural network multi-agent system (BNNMAS) to predict stock price. The model performs in a four layer multi-agent framework to predict eight years of DAX stock price in quarterly periods. The capability of BNNMAS is evaluated by applying both on fundamental and technical DAX stock price data and comparing the outcomes with the results of other methods such as genetic algorithm neural network (GANN) and some standard models like generalized regression neural network (GRNN), etc. The model tested for predicting DAX stock price a period of time that global financial crisis was faced to economics. The results show that BNNMAS significantly performs accurate and reliable, so it can be considered as a suitable tool for predicting stock price specially in a long term periods. 相似文献