全文获取类型
收费全文 | 11754篇 |
免费 | 1793篇 |
国内免费 | 432篇 |
专业分类
电工技术 | 255篇 |
技术理论 | 2篇 |
综合类 | 1023篇 |
化学工业 | 390篇 |
金属工艺 | 29篇 |
机械仪表 | 80篇 |
建筑科学 | 7141篇 |
矿业工程 | 138篇 |
能源动力 | 155篇 |
轻工业 | 785篇 |
水利工程 | 470篇 |
石油天然气 | 50篇 |
武器工业 | 25篇 |
无线电 | 1164篇 |
一般工业技术 | 313篇 |
冶金工业 | 253篇 |
原子能技术 | 18篇 |
自动化技术 | 1688篇 |
出版年
2024年 | 128篇 |
2023年 | 526篇 |
2022年 | 764篇 |
2021年 | 865篇 |
2020年 | 871篇 |
2019年 | 650篇 |
2018年 | 395篇 |
2017年 | 341篇 |
2016年 | 300篇 |
2015年 | 353篇 |
2014年 | 981篇 |
2013年 | 680篇 |
2012年 | 837篇 |
2011年 | 958篇 |
2010年 | 802篇 |
2009年 | 726篇 |
2008年 | 702篇 |
2007年 | 704篇 |
2006年 | 551篇 |
2005年 | 375篇 |
2004年 | 299篇 |
2003年 | 259篇 |
2002年 | 231篇 |
2001年 | 180篇 |
2000年 | 93篇 |
1999年 | 78篇 |
1998年 | 55篇 |
1997年 | 56篇 |
1996年 | 36篇 |
1995年 | 38篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 18篇 |
1989年 | 6篇 |
1988年 | 10篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 4篇 |
1972年 | 1篇 |
1963年 | 1篇 |
1959年 | 1篇 |
1954年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Corey Andrews Yiting Xu Michael Kirberger Jenny J. Yang 《International journal of molecular sciences》2021,22(1)
Calmodulin (CaM) is an important intracellular protein that binds Ca2+ and functions as a critical second messenger involved in numerous biological activities through extensive interactions with proteins and peptides. CaM’s ability to adapt to binding targets with different structures is related to the flexible central helix separating the N- and C-terminal lobes, which allows for conformational changes between extended and collapsed forms of the protein. CaM-binding targets are most often identified using prediction algorithms that utilize sequence and structural data to predict regions of peptides and proteins that can interact with CaM. In this review, we provide an overview of different CaM-binding proteins, the motifs through which they interact with CaM, and shared properties that make them good binding partners for CaM. Additionally, we discuss the historical and current methods for predicting CaM binding, and the similarities and differences between these methods and their relative success at prediction. As new CaM-binding proteins are identified and classified, we will gain a broader understanding of the biological processes regulated through changes in Ca2+ concentration through interactions with CaM. 相似文献
2.
伴随着我国社会经济的稳固发展,人们的生活质量逐渐有了明显改善,而在生态问题趋于严重使人们的环境保护意识显著提高的过程中,森林抚育对于森林生态系统的作用和价值愈发凸显。对此,文章针对森林抚育,从提高森林利用率、维持森林动植物生态平衡、增加可利用水资源等多个方面就其对森林生态系统的影响进行了分析,旨在给予相关森林保护工作者可行的帮助,并以此促进我国森林开发工作的可持续发展。 相似文献
3.
道教洞天福地作为中国名山风景的经典类型之一,在宗教山岳景观中占据独特地位。浙东天台山水神秀,历代高道以入山隐修为主要目的,形成了道教在区域山林的景观文化基础。从天台山“神仙之乡”的文化背景出发,从“想象与实践”的视角切入,梳理了天台山洞天福地的景观流变:分析其“不死之福庭”地域性景观的形成经历了“赤城→桐柏”的信仰转移过程;以天台山为坐标,洞天福地格局打破了区域“层级”分布特征,而呈现大范围“州郡”空间格局。作为“联结点”的天台山,洞天世界沟通了宇宙、山、人3个基本场域,由此衍生出“洞宫”式和“周回”式山岳空间营建典范。旨在挖掘洞天福地中典型案例的价值,为中国洞天福地体系的构建提供理论依据。 相似文献
4.
Simple Sequence Repeat Markers in Genetic Divergence and Marker-Assisted Selection of Rice Cultivars: A Review 总被引:2,自引:0,他引:2
Shubhneet Kaur Manab B. Bera Varinder Kaur 《Critical reviews in food science and nutrition》2015,55(1):41-49
Sequencing of rice genome has facilitated the understanding of rice evolution and has been utilized extensively for mining of DNA markers to facilitate marker-assisted breeding. Simple sequence repeat (SSR) markers that are tandemly repeated nucleotide sequence motifs flanked by unique sequences are presently the maker of choice in rice improvement due to their abundance, co-dominant inheritance, high levels of allelic diversity, and simple reproducible assay. The current level of genome coverage by SSR markers in rice is sufficient to employ them for genotype identification and marker-assisted selection in breeding for mapping of genes and quantitative trait loci analysis. This review provides comprehensive information on the mapping and applications of SSR markers in investigation of rice cultivars to study their genetic divergence and marker-assisted selection of important agronomic traits. 相似文献
5.
Ensemble pruning deals with the selection of base learners prior to combination in order to improve prediction accuracy and efficiency. In the ensemble literature, it has been pointed out that in order for an ensemble classifier to achieve higher prediction accuracy, it is critical for the ensemble classifier to consist of accurate classifiers which at the same time diverse as much as possible. In this paper, a novel ensemble pruning method, called PL-bagging, is proposed. In order to attain the balance between diversity and accuracy of base learners, PL-bagging employs positive Lasso to assign weights to base learners in the combination step. Simulation studies and theoretical investigation showed that PL-bagging filters out redundant base learners while it assigns higher weights to more accurate base learners. Such improved weighting scheme of PL-bagging further results in higher classification accuracy and the improvement becomes even more significant as the ensemble size increases. The performance of PL-bagging was compared with state-of-the-art ensemble pruning methods for aggregation of bootstrapped base learners using 22 real and 4 synthetic datasets. The results indicate that PL-bagging significantly outperforms state-of-the-art ensemble pruning methods such as Boosting-based pruning and Trimmed bagging. 相似文献
6.
To realize joint optimization of spatial diversity and equalization combining in the intersymbol interference (ISI) channel, an iterative equalization combining algorithm is proposed. The proposed algorithm uses the coefficients of Turbo equalization to calculate the combination weights without estimating the signal to noise ratio in each diversity branch. The equalized symbols from different diversity branches are combined, and the extrinsic information output from the decoder is fed back to the equalizers, so as to exchange soft information between the equalizers and the decoder. The performance of the proposed algorithm is analyzed using the extrinsic information transfer (EXIT) chart and verified by simulations. Results show that our approach fully exploits time domain information from the multipath channel and spatial domain information from multi receiving antennas, which efficiently improve the performance of the receiver in the severe ISI channel. 相似文献
7.
中国的菊花主题花展(菊花展览)是最重要的赏菊形式,对我国3种主要类型的菊花展览,即综合性菊花展览(中国菊花展览会、国际博览会菊花专项展和各级城市菊花展)、菊花专类园和菊花花田花海的发展现状进行了研究,并分析了菊花展览在促进菊花产业发展、弘扬菊花文化、服务生态文明及美丽乡村建设、加强菊花非物质文化遗产保护中的重要作用,为推动我国菊花展览水平的提高提供借鉴。 相似文献
8.
Activity-directed synthesis (ADS) is a structure-blind, functional-driven molecular discovery approach. In this Concept, four case studies highlight the general applicability of ADS and showcase its flexibility to support different medicinal chemistry strategies. ADS deliberately harnesses reactions with multiple possible outcomes, and allows many chemotypes to be evaluated in parallel. Resources are focused on bioactive molecules, which emerge in tandem with associated synthetic routes. Some of the future challenges for ADS are highlighted, including the realisation of an autonomous molecular discovery platform. The prospects for ADS to become a mainstream lead generation approach are discussed. 相似文献
9.
张居晓 《计算机技术与发展》2015,(1)
计算机录入编辑盲文是信息处理的特殊应用领域,是特殊教育中的重要研究课题。文中将盲文制作为特殊符号,通过制作字库,编写个性化码表,然后嵌入到主流输入法,从而实现盲文与汉字混排以及实现单手盲文输入。该系统具有易学易记性、盲文编码多样性、嵌入性强等优点,并通过实验证明输入盲文效率能提高5~6倍,在盲文出版、盲文印刷、盲文教学等领域有重要的应用价值。但盲文字符在不同平台(如智能手机)与不同操作系统兼容性问题还有待进一步研究开发。 相似文献
10.
Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem. 相似文献