全文获取类型
收费全文 | 14223篇 |
免费 | 1435篇 |
国内免费 | 915篇 |
专业分类
电工技术 | 469篇 |
技术理论 | 1篇 |
综合类 | 1276篇 |
化学工业 | 2239篇 |
金属工艺 | 314篇 |
机械仪表 | 1325篇 |
建筑科学 | 577篇 |
矿业工程 | 473篇 |
能源动力 | 356篇 |
轻工业 | 1527篇 |
水利工程 | 132篇 |
石油天然气 | 426篇 |
武器工业 | 102篇 |
无线电 | 1003篇 |
一般工业技术 | 2459篇 |
冶金工业 | 292篇 |
原子能技术 | 105篇 |
自动化技术 | 3497篇 |
出版年
2024年 | 60篇 |
2023年 | 241篇 |
2022年 | 412篇 |
2021年 | 556篇 |
2020年 | 613篇 |
2019年 | 469篇 |
2018年 | 486篇 |
2017年 | 497篇 |
2016年 | 561篇 |
2015年 | 632篇 |
2014年 | 920篇 |
2013年 | 1272篇 |
2012年 | 1000篇 |
2011年 | 1008篇 |
2010年 | 726篇 |
2009年 | 819篇 |
2008年 | 723篇 |
2007年 | 872篇 |
2006年 | 795篇 |
2005年 | 710篇 |
2004年 | 658篇 |
2003年 | 520篇 |
2002年 | 400篇 |
2001年 | 326篇 |
2000年 | 256篇 |
1999年 | 213篇 |
1998年 | 142篇 |
1997年 | 121篇 |
1996年 | 93篇 |
1995年 | 90篇 |
1994年 | 61篇 |
1993年 | 59篇 |
1992年 | 52篇 |
1991年 | 45篇 |
1990年 | 36篇 |
1989年 | 26篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 18篇 |
1984年 | 15篇 |
1983年 | 12篇 |
1982年 | 10篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1975年 | 1篇 |
1963年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
Joel 《Journal of Parallel and Distributed Computing》2005,65(12):1601-1606
Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results. 相似文献
32.
事物未来的状态仅仅受事物现状的影响,而与过去的状态无关,也就是具有马尔可夫性。用马尔可夫链的理论与方法,对具有马尔可夫性产品的可靠性进行预测,既为产品的可靠性设计和产品售后服务的经济性分析提供了参考,也为马尔可夫模型的实际应用拓广了范围。通过实例说明在数学软件的帮助下这种预测方法的简单可行性。 相似文献
33.
34.
35.
从供应商受益角度研究国际供应链合作关系 总被引:11,自引:1,他引:10
首先指出从供应商受益角度对国际供应链合作关系进行研究的重要意义,接着对国际供应链合作关系的起源及其概念界定进行了综合分析;其次对国际供应链战略伙伴关系下的供应商受益进行了相关研究结论的综合,并对我国供应商参与国际供应链合作的实际受益进行分析,然后将两者进行了比较,最后综合全文探讨得出本文研究的结论。 相似文献
36.
新岭大桥转体施工技术 总被引:1,自引:0,他引:1
新岭大桥采用有平衡重的平面转体法施工 ,这在我省尚属首例。施工中因地制宜采用拉链葫芦滑轮组进行牵引 ,仅用 3小时就使拱肋平稳、安全地转体就位 ,牵引施工获得成功 ,为我省的桥梁施工积累了经验 ,具有推广价值 相似文献
37.
针对战时装备供应链的特点,以远程精确打击、敌特后方袭扰和恶劣天气等三个因素为主要风险指标,运用修正的模糊信息熵权对TOPSIS法进行改进,提出了一种新的战时装备供应链风险评估方法。首先利用原始数据产生的模糊信息熵权进行客观赋权,并引入专家因素对权重进行主观修正,利用逼近理想解排序方法进行运算,最后通过实例计算与分析,验证该评估方法简便易行,结论合理,有效降低了指挥员决策的主观随意性。 相似文献
38.
The automated fare collection(AFC) system,also known as the transit smart card(SC) system,has gained more and more popularity among transit agencies worldwide.Compared with the conventional manual fare collection system,an AFC system has its inherent advantages in low labor cost and high efficiency for fare collection and transaction data archival.Although it is possible to collect highly valuable data from transit SC transactions,substantial efforts and methodologies are needed for extracting such data because most AFC systems are not initially designed for data collection.This is true especially for the Beijing AFC system,where a passenger’s boarding stop(origin) on a flat-rate bus is not recorded on the check-in scan.To extract passengers’ origin data from recorded SC transaction information,a Markov chain based Bayesian decision tree algorithm is developed in this study.Using the time invariance property of the Markov chain,the algorithm is further optimized and simplified to have a linear computational complexity.This algorithm is verified with transit vehicles equipped with global positioning system(GPS) data loggers.Our verification results demonstrated that the proposed algorithm is effective in extracting transit passengers’ origin information from SC transactions with a relatively high accuracy.Such transit origin data are highly valuable for transit system planning and route optimization. 相似文献
39.
Simulation is capable to cope with the uncertain and dynamic nature of industrial value chains. However, in-depth system expertise is inevitable for mapping objects and constraints from the real world to a virtual model. This knowledge-intensity leads to long development times of respective projects, which contradicts the need for timely decision support. Since more and more companies use industrial knowledge graphs and ontologies to foster their knowledge management, this paper proposes a framework on how to efficiently derive a simulation model from such semantic knowledge bases. As part of the approach, a novel Simulation Ontology provides a standardized meta-model for hybrid simulations. Its instantiation enables the user to come up with a fully parameterized formal simulation model. Newly developed Mapping Rules facilitate this process by providing guidance on how to turn knowledge from existing ontologies, which describe the system to be simulated, into instances of the Simulation Ontology. The framework is completed by a parsing procedure for an automated transformation of this conceptual model into an executable one. This novel modeling approach makes model development more efficient by reducing its complexity. It is validated in a use case implementation from semiconductor manufacturing, where cross-domain knowledge was required in order to model and simulate the impacts of the COVID-19 pandemic on a global supply chain network. 相似文献
40.