首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5188篇
  免费   628篇
  国内免费   363篇
电工技术   105篇
技术理论   1篇
综合类   674篇
化学工业   511篇
金属工艺   45篇
机械仪表   57篇
建筑科学   625篇
矿业工程   50篇
能源动力   74篇
轻工业   883篇
水利工程   207篇
石油天然气   45篇
武器工业   26篇
无线电   1163篇
一般工业技术   280篇
冶金工业   289篇
原子能技术   25篇
自动化技术   1119篇
  2024年   42篇
  2023年   131篇
  2022年   193篇
  2021年   242篇
  2020年   213篇
  2019年   218篇
  2018年   187篇
  2017年   219篇
  2016年   216篇
  2015年   232篇
  2014年   332篇
  2013年   349篇
  2012年   376篇
  2011年   401篇
  2010年   333篇
  2009年   349篇
  2008年   365篇
  2007年   364篇
  2006年   268篇
  2005年   209篇
  2004年   179篇
  2003年   159篇
  2002年   134篇
  2001年   85篇
  2000年   55篇
  1999年   62篇
  1998年   28篇
  1997年   35篇
  1996年   23篇
  1995年   31篇
  1994年   22篇
  1993年   19篇
  1992年   17篇
  1991年   13篇
  1990年   19篇
  1989年   6篇
  1988年   5篇
  1987年   6篇
  1985年   7篇
  1984年   6篇
  1981年   2篇
  1980年   4篇
  1979年   3篇
  1972年   2篇
  1966年   3篇
  1964年   2篇
  1960年   1篇
  1959年   1篇
  1955年   4篇
  1954年   1篇
排序方式: 共有6179条查询结果,搜索用时 0 毫秒
1.
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.  相似文献   
2.
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.  相似文献   
3.
The penalized calibration technique in survey sampling combines usual calibration and soft calibration by introducing a penalty term. Certain relevant estimates in survey sampling can be considered as penalized calibration estimates obtained as particular cases from an optimization problem with a common basic structure. In this framework, a case deletion diagnostic is proposed for a class of penalized calibration estimators including both design-based and model-based estimators. The diagnostic compares finite population parameter estimates and can be calculated from quantities related to the full data set. The resulting diagnostic is a function of the residual and leverage, as other diagnostics in regression models, and of the calibration weight, a singular feature in survey sampling. Moreover, a particular case, which includes the basic unit level model for small area estimation, is considered. Both a real and an artificial example are included to illustrate the diagnostic proposed. The results obtained clearly show that the proposed diagnostic depends on the calibration and soft-calibration variables, on the penalization term, as well as on the parameter to estimate.  相似文献   
4.
计算机录入编辑盲文是信息处理的特殊应用领域,是特殊教育中的重要研究课题。文中将盲文制作为特殊符号,通过制作字库,编写个性化码表,然后嵌入到主流输入法,从而实现盲文与汉字混排以及实现单手盲文输入。该系统具有易学易记性、盲文编码多样性、嵌入性强等优点,并通过实验证明输入盲文效率能提高5~6倍,在盲文出版、盲文印刷、盲文教学等领域有重要的应用价值。但盲文字符在不同平台(如智能手机)与不同操作系统兼容性问题还有待进一步研究开发。  相似文献   
5.
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.  相似文献   
6.
MC-CDMA在频域扩频时实际上是一种频率分集,对于频率分集重数的要求通常小于子载波的数目N,故扩频因子可以小于子载波数目。改进了这种MC-CDMA系统的结构,通过在频域引入交织器,使交织后频率分集各分量经历独立的哀落,从而提高了抗哀落能力。最后给出了用系统仿真软件SPW仿真的结果。  相似文献   
7.
生存能力技术及其实现案例研究   总被引:12,自引:1,他引:11  
生存能力技术谋求增强系统在面临攻击、失效等灾难情况下仍能继续提供服务的能力。本文提出了以多样化分布式动态备份技术和主动漂移机制为手段,以被保护目标的机动性和隐蔽性为目的的生存能力技术模型。提出了多样化体系理论及其实现案例,基于该理论设计并实现了自适应TOM方法。最后通过模拟和测试探讨了生存能力的评价方法,并验证了本文的结果。  相似文献   
8.
本文提出一种多输入多输出(MIMO)天线系统中简单的扩展空时块编码(SSTBC)分集技术,采用沃尔什码来区分各天线发送数据子流。采用这种方法,在系统带宽一定时,不降低发送信息速率,同时接收机简单。不同天线的发送信息经过了所有收一发天线对之间的空间子信道,获得了所有路径的部分空间分集增益,仿真结果表明,这种增益的获得不受限于接收分集阶数,并且随发射天线的增加以一定的线性关系增加。  相似文献   
9.
Self-adjusting the intensity of assortative mating in genetic algorithms   总被引:2,自引:2,他引:0  
Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.  相似文献   
10.
赵婧华  卢敏 《电子工程师》2004,30(11):37-39
空时分集技术的最大优点在于在不增加带宽的情况下可以提高系统的可靠性,是目前移动通信的研究热点.常模算法是一种性能优良的码分多址(CDMA)盲多用户检测技术,能确保判决信号与实际传送信号之间的差错较小,误码率性能良好.文中提出将标准线性受限常模算法(LCCMA)与空时分组码(STBC)相结合,设计出一种收敛快、能够改善系统性能的基于2-空时分组码的多用户接收机.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号