全文获取类型
收费全文 | 73456篇 |
免费 | 14514篇 |
国内免费 | 10757篇 |
专业分类
电工技术 | 8920篇 |
技术理论 | 3篇 |
综合类 | 9476篇 |
化学工业 | 1541篇 |
金属工艺 | 1336篇 |
机械仪表 | 5580篇 |
建筑科学 | 1338篇 |
矿业工程 | 1040篇 |
能源动力 | 1496篇 |
轻工业 | 919篇 |
水利工程 | 1184篇 |
石油天然气 | 896篇 |
武器工业 | 1242篇 |
无线电 | 12977篇 |
一般工业技术 | 4495篇 |
冶金工业 | 455篇 |
原子能技术 | 277篇 |
自动化技术 | 45552篇 |
出版年
2024年 | 508篇 |
2023年 | 1380篇 |
2022年 | 2663篇 |
2021年 | 2881篇 |
2020年 | 3179篇 |
2019年 | 2661篇 |
2018年 | 2683篇 |
2017年 | 3131篇 |
2016年 | 3591篇 |
2015年 | 4252篇 |
2014年 | 5444篇 |
2013年 | 5244篇 |
2012年 | 6565篇 |
2011年 | 6921篇 |
2010年 | 5614篇 |
2009年 | 5730篇 |
2008年 | 5982篇 |
2007年 | 6467篇 |
2006年 | 4968篇 |
2005年 | 4060篇 |
2004年 | 3218篇 |
2003年 | 2544篇 |
2002年 | 1878篇 |
2001年 | 1455篇 |
2000年 | 1231篇 |
1999年 | 962篇 |
1998年 | 754篇 |
1997年 | 594篇 |
1996年 | 471篇 |
1995年 | 319篇 |
1994年 | 276篇 |
1993年 | 209篇 |
1992年 | 195篇 |
1991年 | 98篇 |
1990年 | 132篇 |
1989年 | 91篇 |
1988年 | 67篇 |
1987年 | 26篇 |
1986年 | 34篇 |
1985年 | 40篇 |
1984年 | 31篇 |
1983年 | 29篇 |
1982年 | 31篇 |
1981年 | 16篇 |
1980年 | 25篇 |
1979年 | 14篇 |
1978年 | 12篇 |
1977年 | 11篇 |
1975年 | 9篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
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.
为了更加准确地检测出图像中的显著性目标,提出了多先验融合的显著性目标检测算法。针对传统中心先验对偏离图像中心的显著性目标会出现检测失效的情况,提出在多颜色空间下求显著性目标的最小凸包交集来确定目标的大致位置,以凸包区域中心计算中心先验。同时通过融合策略将凸包区域中心先验、颜色对比先验和背景先验融合并集成到特征矩阵中。最后通过低秩矩阵恢复模型生成结果显著图。在公开数据集MSRA1000和ESSCD上的仿真实验结果表明,MPLRR能够得到清晰高亮的显著性目标视觉效果图,同时F,AUC,MAE等评价指标也比现有的许多方法有明显提升。 相似文献
14.
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). 相似文献
15.
Zhijiang Li Yingping Zheng Liqin Cao Lei Jiao Yanfei Zhong Caiyi Zhang 《Color research and application》2020,45(4):656-670
Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results. 相似文献
16.
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. 相似文献
17.
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. 相似文献
18.
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. 相似文献
19.
针对互联网中恶意域名攻击事件频发,现有域名检测方法实时性不强的问题,提出一种基于词法特征的恶意域名快速检测算法。该算法根据恶意域名的特点,首先将所有待测域名按照长度进行正则化处理后赋予权值;然后利用聚类算法将待测域名划分成多个小组,并利用改进的堆排序算法按照组内权值总和计算各域名小组优先级,根据优先级降序依次计算各域名小组中每一域名与黑名单上域名之间的编辑距离;最后依据编辑距离值快速判定恶意域名。算法运行结果表明,基于词法特征的恶意域名快速检测算法与单一使用域名语义和单一使用域名词法的恶意域名检测算法相比,准确率分别提高1.7%与2.5%,检测速率分别提高13.9%与6.8%,具有更高的准确率和实时性。 相似文献
20.
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. 相似文献