全文获取类型
收费全文 | 33914篇 |
免费 | 3794篇 |
国内免费 | 3204篇 |
专业分类
电工技术 | 3322篇 |
综合类 | 4932篇 |
化学工业 | 1475篇 |
金属工艺 | 624篇 |
机械仪表 | 2247篇 |
建筑科学 | 2219篇 |
矿业工程 | 467篇 |
能源动力 | 804篇 |
轻工业 | 309篇 |
水利工程 | 800篇 |
石油天然气 | 460篇 |
武器工业 | 348篇 |
无线电 | 3586篇 |
一般工业技术 | 3868篇 |
冶金工业 | 371篇 |
原子能技术 | 149篇 |
自动化技术 | 14931篇 |
出版年
2024年 | 154篇 |
2023年 | 400篇 |
2022年 | 562篇 |
2021年 | 659篇 |
2020年 | 976篇 |
2019年 | 1000篇 |
2018年 | 908篇 |
2017年 | 1209篇 |
2016年 | 1326篇 |
2015年 | 1312篇 |
2014年 | 1801篇 |
2013年 | 2669篇 |
2012年 | 2270篇 |
2011年 | 2288篇 |
2010年 | 1778篇 |
2009年 | 1988篇 |
2008年 | 2097篇 |
2007年 | 2368篇 |
2006年 | 2027篇 |
2005年 | 1806篇 |
2004年 | 1498篇 |
2003年 | 1318篇 |
2002年 | 1139篇 |
2001年 | 1067篇 |
2000年 | 993篇 |
1999年 | 794篇 |
1998年 | 647篇 |
1997年 | 667篇 |
1996年 | 532篇 |
1995年 | 454篇 |
1994年 | 416篇 |
1993年 | 310篇 |
1992年 | 289篇 |
1991年 | 227篇 |
1990年 | 178篇 |
1989年 | 140篇 |
1988年 | 117篇 |
1987年 | 62篇 |
1986年 | 64篇 |
1985年 | 43篇 |
1984年 | 68篇 |
1983年 | 37篇 |
1982年 | 48篇 |
1981年 | 32篇 |
1980年 | 39篇 |
1979年 | 39篇 |
1978年 | 20篇 |
1977年 | 30篇 |
1976年 | 15篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
81.
“汇编语言程序设计”的比较教学法 总被引:3,自引:1,他引:2
基于比较教学法的优势,文章从数据安排、数据处理、流程控制、子程序结构等程序设计的基本方面对汇编语言和高级语言中的相关机制作了对比分析,提出了"汇编语言程序设计"比较教学的基本思路。 相似文献
82.
In this paper we introduce a goal programming formulation for the multi-group classification problem. Although a great number of mathematical programming models for two-group classification problems have been proposed in the literature, there are few mathematical programming models for multi-group classification problems. Newly proposed multi-group mathematical programming model is compared with other conventional multi-group methods by using different real data sets taken from the literature and simulation data. A comparative analysis on the real data sets and simulation data shows that our goal programming formulation may suggest efficient alternative to traditional statistical methods and mathematical programming formulations for the multi-group classification problem. 相似文献
83.
This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(N×TDN)have been developed for solving the model, where N is the number of planning periods and TDN is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient. 相似文献
84.
Víctor Blanco 《Journal of Symbolic Computation》2011,46(5):511-533
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the past few years. However, the polynomial case has not been studied in detail due to its theoretical and computational difficulties. This paper presents an algebraic approach for solving these problems. We propose a methodology based on transforming the polynomial optimization problem to the problem of solving one or more systems of polynomial equations and we use certain Gröbner bases to solve these systems. Different transformations give different methodologies that are theoretically stated and compared by some computational tests via the algorithms that they induce. 相似文献
85.
In this paper, we propose a general optimization-based model for classification. Then we show that some well-known optimization-based methods for classification, which were developed by Shi et al. [Data mining in credit card portfolio management: a multiple criteria decision making approac. In: Koksalan M, Zionts S, editors. Multiple criteria decision making in the new millennium. Berlin: Springer; 2001. p. 427–36] and Freed and Glover [A linear programming approach to the discriminant problem. Decision Sciences 1981; 12: 68–79; Simple but powerful goal programming models for discriminant problems. European Journal of Operational Research 1981; 7: 44–60], are special cases of our model. Moreover, three new models, MCQP (multi-criteria indefinite quadratic programming), MCCQP (multi-criteria concave quadratic programming) and MCVQP (multi-criteria convex programming), are developed based on the general model. We also propose algorithms for MCQP and MCCQP, respectively. Then we apply these models to three real-life problems: credit card accounts, VIP mail-box and social endowment insurance classification. Extensive experiments are done to compare the efficiency of these methods. 相似文献
86.
阐述面向对象的非线性有限元软件框架设计,在前人成果的基础上,力求软件框架更灵活、更完善。采用模型分析方法与有限元模型分离的方式,明确描述各类之间的依赖关系以及相互之间的传递消息过程,建立非线性有限元软件的框架结构。增加有限元软件的模块化、代码的重用性和易扩展性,解决长期以来存在于非线性有限元开发的一个重要难题。 相似文献
87.
安钢中板厂的炉号跟踪系统中,冷金属检测器CMD用来检测冷床区钢坯的运动,但是CMD只能检测出辊道上是否有钢坯经过,而不能判断钢坯在冷床区具体上到哪个冷床,因此,目前冷床部分的钢坯跟踪是靠人工手动完成的.针对该问题,提出一种新的运用数字图像处理技术完成冷床区钢坯自动跟踪的方法.该方法利用运动目标检测方法检测出辊道上有钢坯运动,然后经过最佳阈值分割、改进的区域生长算法、质心标记、数据库程序等步骤完成钢坯运动轨迹的标记,实现自动跟踪. 相似文献
88.
Ahmad Sadhiqin Mohd Isira Zhengtao Ding 《International journal of systems science》2016,47(16):3772-3781
This paper deals with the leader-follower consensus problem of Lipschitz nonlinear systems under fixed directed communication networks. Both state and output feedback control are proposed based on state and output measurements of neighbouring agents, respectively. Laplacian matrix features are explored for the stability analysis, and the sufficient conditions are derived to solve the consensus problem. Finally, simulation results are included to demonstrate the effectiveness of the output-based consensus controller. 相似文献
89.
Microsoft office系列软件在日常工作中应用广泛。我单位在工程项目中大量使用Office软件进行数据处理及交换,对这些原始数据采取适当的方法分析挖掘,可以极大地缩短设计与试验周期、降低成本。由于项目产生的临时数据常以不同格式存放在各种办公软件中,且数量巨大,所以需要一个可以控制Office系列办公软件的程序来完成原始信息的收集及输出。给出了通过使用基于C++的Qt框架并结合COM、ODBC技术获取、处理数据,并输出至数据库或XML文档的实现方法。 相似文献
90.
Tien-Fu Liang 《Information Sciences》2011,181(4):842-854
In the real-world manufacturing/distribution planning decision (MDPD) integration problems in supply chains, the environmental coefficients and parameters are normally imprecise due to incomplete and/or unavailable information. This work presents a fuzzy linear programming approach based on the possibility theory. It applies this approach to solve multi-product and multi-time period MDPD problems with imprecise goals and forecast demand by considering the time value of money of related operating cost categories. The proposed approach attempts to minimize the total manufacturing and distribution costs by considering the levels of inventory, subcontracting and backordering, the available machine capacity and labor levels at each source, forecast demand and available warehouse space at each destination. This study utilizes an industrial case study to demonstrate the feasibility of applying the proposed approach to practical MDPD problems. The primary contribution of this paper is a fuzzy mathematical programming methodology for solving the MDPD integration problems in uncertain environments. 相似文献