全文获取类型
收费全文 | 406261篇 |
免费 | 40699篇 |
国内免费 | 35351篇 |
专业分类
电工技术 | 50183篇 |
技术理论 | 30篇 |
综合类 | 37617篇 |
化学工业 | 49990篇 |
金属工艺 | 15306篇 |
机械仪表 | 30209篇 |
建筑科学 | 26866篇 |
矿业工程 | 11071篇 |
能源动力 | 13897篇 |
轻工业 | 19121篇 |
水利工程 | 8672篇 |
石油天然气 | 10724篇 |
武器工业 | 5638篇 |
无线电 | 54307篇 |
一般工业技术 | 31801篇 |
冶金工业 | 11069篇 |
原子能技术 | 5405篇 |
自动化技术 | 100405篇 |
出版年
2024年 | 1750篇 |
2023年 | 5358篇 |
2022年 | 10023篇 |
2021年 | 11998篇 |
2020年 | 12015篇 |
2019年 | 9918篇 |
2018年 | 9243篇 |
2017年 | 12766篇 |
2016年 | 14391篇 |
2015年 | 16523篇 |
2014年 | 22957篇 |
2013年 | 23997篇 |
2012年 | 30110篇 |
2011年 | 32966篇 |
2010年 | 24451篇 |
2009年 | 24372篇 |
2008年 | 25690篇 |
2007年 | 30770篇 |
2006年 | 28483篇 |
2005年 | 24862篇 |
2004年 | 20595篇 |
2003年 | 17572篇 |
2002年 | 13445篇 |
2001年 | 10806篇 |
2000年 | 8990篇 |
1999年 | 7413篇 |
1998年 | 5799篇 |
1997年 | 4696篇 |
1996年 | 3996篇 |
1995年 | 3362篇 |
1994年 | 2900篇 |
1993年 | 2058篇 |
1992年 | 1687篇 |
1991年 | 1274篇 |
1990年 | 1066篇 |
1989年 | 833篇 |
1988年 | 621篇 |
1987年 | 362篇 |
1986年 | 285篇 |
1985年 | 353篇 |
1984年 | 305篇 |
1983年 | 232篇 |
1982年 | 267篇 |
1981年 | 168篇 |
1980年 | 146篇 |
1979年 | 67篇 |
1978年 | 52篇 |
1977年 | 53篇 |
1976年 | 38篇 |
1959年 | 39篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms. 相似文献
12.
In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations. 相似文献
13.
The study presents the preparation of the new magnetic nanocomposite based on PLGA and magnetite. The PLGA used to obtain the magnetic nanocomposites was synthesized by the copolymerization of lactic acid with glycolic acid, in the presence of tin octanoate [Sn(Oct)2] as catalyst, by polycondensation procedure. Magnetite was obtained by co-precipitation from aqueous salt solutions FeCl2/FeCl3. The particles size of magnetite was 420 nm, and the saturation magnetization 62.78 emu/g, while the PLGA/magnetite nanocomposite size was 864 nm and the saturation magnetization 39.44 emu/g. The magnetic nanocomposites were characterized by FT-IR, DLS technique, SEM, VSM and simultaneous thermal analyses (TG–FTIR–MS). The polymer matrix PLGA acts as a shell and carrier for the active component, while magnetite is the component which makes targeting possible by external magnetic field manipulation. Based on the gases resulted by thermal degradation of PLGA copolymer, using the simultaneous analysis TG–FTIR–MS, a possible degradation mechanism was proposed. 相似文献
14.
Characteristics and formation mechanism of porosities in CFRP during laser joining of CFRP and steel
An experimental investigation on the mechanism of porosity formation during the laser joining of carbon fiber reinforced polymer (CFRP) and steel is presented. The porosity morphology and distribution were characterized by optical and scanning electron microscopy, and the thermal pyrolysis behaviors were investigated by thermal analysis and designed back-side cooling experiments. The results show that there are two types of porosities in CFRP. Porosity I only appears when the heat input is more than 77.8 J/mm. It has a smooth inner wall and distributes near the bonding interface between CFRP and steel at the central area of melted zone, which is caused by gaseous products such as CO2, NH3, H2O, and hydrocarbons produced by the pyrolysis of CFRP. Porosity II can be seen under all joining conditions. It has a rough inner wall and distributes far away from the bonding interface, concentrating at the final solidification locations. Porosity II is caused by the shrinkage of melted CFRP during solidification stage. 相似文献
15.
对鞍钢股份无缝钢管厂连轧机前毛管坯横移装置存在的设计缺陷进行了分析,并提出改进方案,将原横移装置由高架轨道横移机构及上下升降链传动装置,改进为地面轨道横移系统及同步旋转臂实现取管、放管过程。实施后消除了生产故障,缩短了轧制周期,降低生产成本。 相似文献
16.
This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency. 相似文献
17.
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. 相似文献
18.
王学鹏 《电子制作.电脑维护与应用》2015,(6)
CAN-BUS系统自问世以来,已将近30年,当代各品牌车辆纷纷采用,但大部分技术人员对CAN总线系统既熟悉又陌生。经常能听到,但具体操作又显得有些力不从心。本文通过对奇瑞A3品牌轿车CAN总线的巧妙应用,引导大家进一步理解和应用CAN总线。 相似文献
19.
A method for simultaneous measurement of the thickness and density for Glass Fiber-Reinforced Polymer (GFRP) laminate plates with ultrasonic waves in C-Scan mode is presented in the form of maps. The method uses three different signals in immersion pulse-echo C-Scan mode. The maps obtained based on the density show the heterogeneity of the material at high resolution at the pixel level (1 × 1 mm2) and therefore they represent an efficient tool to assess and evaluate the damage of the composite structures after manufacturing and after an applied mechanical loading. 相似文献
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. 相似文献