全文获取类型
收费全文 | 73063篇 |
免费 | 13556篇 |
国内免费 | 9881篇 |
专业分类
电工技术 | 9015篇 |
技术理论 | 1篇 |
综合类 | 9035篇 |
化学工业 | 1511篇 |
金属工艺 | 1324篇 |
机械仪表 | 5814篇 |
建筑科学 | 1267篇 |
矿业工程 | 1003篇 |
能源动力 | 1505篇 |
轻工业 | 673篇 |
水利工程 | 1284篇 |
石油天然气 | 784篇 |
武器工业 | 1227篇 |
无线电 | 12860篇 |
一般工业技术 | 5014篇 |
冶金工业 | 512篇 |
原子能技术 | 263篇 |
自动化技术 | 43408篇 |
出版年
2024年 | 507篇 |
2023年 | 1310篇 |
2022年 | 2515篇 |
2021年 | 2691篇 |
2020年 | 3022篇 |
2019年 | 2519篇 |
2018年 | 2504篇 |
2017年 | 2978篇 |
2016年 | 3420篇 |
2015年 | 4048篇 |
2014年 | 5312篇 |
2013年 | 5466篇 |
2012年 | 6367篇 |
2011年 | 6535篇 |
2010年 | 5286篇 |
2009年 | 5517篇 |
2008年 | 5832篇 |
2007年 | 6254篇 |
2006年 | 4934篇 |
2005年 | 4108篇 |
2004年 | 3289篇 |
2003年 | 2588篇 |
2002年 | 1942篇 |
2001年 | 1501篇 |
2000年 | 1274篇 |
1999年 | 1012篇 |
1998年 | 806篇 |
1997年 | 650篇 |
1996年 | 493篇 |
1995年 | 356篇 |
1994年 | 305篇 |
1993年 | 224篇 |
1992年 | 222篇 |
1991年 | 117篇 |
1990年 | 136篇 |
1989年 | 96篇 |
1988年 | 63篇 |
1987年 | 22篇 |
1986年 | 39篇 |
1985年 | 40篇 |
1984年 | 34篇 |
1983年 | 28篇 |
1982年 | 24篇 |
1981年 | 15篇 |
1980年 | 23篇 |
1979年 | 11篇 |
1978年 | 12篇 |
1977年 | 9篇 |
1975年 | 12篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 437 毫秒
81.
An Improved Immune Genetic Algorithm for Solving the Optimization Problems of Computer Communication Networks 总被引:4,自引:0,他引:4
1 IntroductionIndesigningacomputercommunicationnet work ,thenetworkaveragedelayisanimportantpa rameterinthenetworkperformance .Inthispaper,weonlyconsiderM /M/1networks,whichmeansthatthemessageprocessingtimeisaprobabilisticdensityfunctionwithnegativepower,thegroupar rivalandsendingisofPoissiondistributionwithasinglequeue .Supposethatthenetworktopologicalstructureandtheestimatesoftheexternaltrafficrequirementsaregiven ,howtoselecttheoptimalroutestobeusedbythecommunicatingnodesinthenetworksoast… 相似文献
82.
Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems 总被引:1,自引:1,他引:0
Romano Fantacci Giovanni Giambene Francesco Petiti 《Wireless Personal Communications》2003,24(3):363-388
Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD. 相似文献
83.
84.
A. Kaveh V. Kalatjari 《International journal for numerical methods in engineering》2003,58(5):771-791
In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
85.
86.
In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel. 相似文献
87.
88.
89.
改进型遗传算法在加载天线设计中的运用 总被引:5,自引:2,他引:3
遗传算法是一种全新的优化搜索方法,可以用来解决各种复杂的实际问题。针对简单型遗传算法的一些不足之处,介绍了一种改进型的遗传算法,并阐述了其在短波宽带集总加载天线优化设计中的运用。 相似文献
90.
Erik Jan Marinissen 《Journal of Electronic Testing》2002,18(4-5):435-454
Modular testing is an attractive approach to testing large system ICs, especially if they are built from pre-designed reusable embedded cores. This paper describes an automated modular test development approach. The basis of this approach is that a core or module test is dissected into a test protocol and a test pattern list. A test protocol describes in detail how to apply one test pattern to the core, while abstracting from the specific test pattern stimulus and response values. Subsequent automation tasks, such as the expansion from core-level tests to system-chip-level tests and test scheduling, all work on test protocols, thereby greatly reducing the amount of compute time and data involved. Finally, an SOC-level test is assembled from the expanded and scheduled test protocols and the (so far untouched) test patterns. This paper describes and formalizes the notion of test protocols and the algorithms for test protocol expansion and scheduling. A running example is featured throughout the paper. We also elaborate on the industrial usage of the concepts described. 相似文献