全文获取类型
收费全文 | 128850篇 |
免费 | 21520篇 |
国内免费 | 15584篇 |
专业分类
电工技术 | 13519篇 |
技术理论 | 10篇 |
综合类 | 15183篇 |
化学工业 | 3115篇 |
金属工艺 | 2213篇 |
机械仪表 | 9261篇 |
建筑科学 | 3508篇 |
矿业工程 | 2531篇 |
能源动力 | 2249篇 |
轻工业 | 1573篇 |
水利工程 | 2451篇 |
石油天然气 | 3699篇 |
武器工业 | 2132篇 |
无线电 | 22166篇 |
一般工业技术 | 7436篇 |
冶金工业 | 1726篇 |
原子能技术 | 1580篇 |
自动化技术 | 71602篇 |
出版年
2024年 | 852篇 |
2023年 | 2340篇 |
2022年 | 4650篇 |
2021年 | 5214篇 |
2020年 | 5317篇 |
2019年 | 4246篇 |
2018年 | 3993篇 |
2017年 | 4748篇 |
2016年 | 5504篇 |
2015年 | 6460篇 |
2014年 | 9152篇 |
2013年 | 8596篇 |
2012年 | 10463篇 |
2011年 | 10980篇 |
2010年 | 8740篇 |
2009年 | 8858篇 |
2008年 | 9530篇 |
2007年 | 10530篇 |
2006年 | 8576篇 |
2005年 | 7410篇 |
2004年 | 6127篇 |
2003年 | 5005篇 |
2002年 | 3766篇 |
2001年 | 2878篇 |
2000年 | 2450篇 |
1999年 | 1870篇 |
1998年 | 1468篇 |
1997年 | 1210篇 |
1996年 | 947篇 |
1995年 | 751篇 |
1994年 | 629篇 |
1993年 | 472篇 |
1992年 | 375篇 |
1991年 | 280篇 |
1990年 | 291篇 |
1989年 | 197篇 |
1988年 | 144篇 |
1987年 | 101篇 |
1986年 | 108篇 |
1985年 | 122篇 |
1984年 | 83篇 |
1983年 | 93篇 |
1982年 | 103篇 |
1981年 | 66篇 |
1980年 | 42篇 |
1979年 | 42篇 |
1978年 | 22篇 |
1977年 | 28篇 |
1976年 | 17篇 |
1959年 | 19篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
In the first critical assessment of knowledge economy dynamic paths in Africa and the Middle East, but for a few exceptions, we find overwhelming support for diminishing cross-country disparities in knowledge-based economy dimensions. The paper employs all the four components of the World Bank's Knowledge Economy Index (KEI): economic incentives, innovation, education, and information infrastructure. The main finding suggests that sub-Saharan African (SSA) and the Middle East and North African (MENA) countries with low levels of KE dynamics and catching-up their counterparts of higher KE levels. We provide the speeds of integration and time necessary to achieve full (100%) integration. Policy implications are also discussed. 相似文献
32.
利用计算机实现自动、准确的秀丽隐杆线虫(C.elegans)的各项形态学参数分析,至关重要的是从显微图像上分割出线虫体态,但由于显微镜下的图像噪声较多,线虫边缘像素与周围环境相似,而且线虫的体态具有鞭毛和其他附着物需要分离,多方面因素导致设计一个鲁棒性的C.elegans分割算法仍然面临着挑战。针对这些问题,提出了一种基于深度学习的线虫分割方法,通过训练掩模区域卷积神经网络(Mask R-CNN)学习线虫形态特征实现自动分割。首先,通过改进多级特征池化将高级语义特征与低级边缘特征融合,结合大幅度软最大损失(LMSL)损失算法改进损失计算;然后,改进非极大值抑制;最后,引入全连接融合分支等方法对分割结果进行进一步优化。实验结果表明,相比原始的Mask R-CNN,该方法平均精确率(AP)提升了4.3个百分点,平均交并比(mIOU)提升了4个百分点。表明所提出的深度学习分割方法能够有效提高分割准确率,在显微图像中更加精确地分割出线虫体。 相似文献
33.
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). 相似文献
34.
35.
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. 相似文献
36.
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. 相似文献
37.
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. 相似文献
38.
39.
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. 相似文献
40.
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. 相似文献