全文获取类型
收费全文 | 23090篇 |
免费 | 1703篇 |
国内免费 | 956篇 |
专业分类
电工技术 | 2381篇 |
技术理论 | 6篇 |
综合类 | 1948篇 |
化学工业 | 289篇 |
金属工艺 | 467篇 |
机械仪表 | 1747篇 |
建筑科学 | 9472篇 |
矿业工程 | 360篇 |
能源动力 | 466篇 |
轻工业 | 86篇 |
水利工程 | 795篇 |
石油天然气 | 124篇 |
武器工业 | 229篇 |
无线电 | 994篇 |
一般工业技术 | 1131篇 |
冶金工业 | 348篇 |
原子能技术 | 50篇 |
自动化技术 | 4856篇 |
出版年
2024年 | 115篇 |
2023年 | 315篇 |
2022年 | 530篇 |
2021年 | 614篇 |
2020年 | 704篇 |
2019年 | 532篇 |
2018年 | 461篇 |
2017年 | 674篇 |
2016年 | 705篇 |
2015年 | 833篇 |
2014年 | 1805篇 |
2013年 | 1994篇 |
2012年 | 1421篇 |
2011年 | 1622篇 |
2010年 | 1322篇 |
2009年 | 1468篇 |
2008年 | 1328篇 |
2007年 | 1550篇 |
2006年 | 1361篇 |
2005年 | 1141篇 |
2004年 | 901篇 |
2003年 | 746篇 |
2002年 | 670篇 |
2001年 | 591篇 |
2000年 | 477篇 |
1999年 | 360篇 |
1998年 | 264篇 |
1997年 | 228篇 |
1996年 | 166篇 |
1995年 | 167篇 |
1994年 | 149篇 |
1993年 | 106篇 |
1992年 | 79篇 |
1991年 | 73篇 |
1990年 | 53篇 |
1989年 | 36篇 |
1988年 | 30篇 |
1987年 | 26篇 |
1986年 | 8篇 |
1985年 | 36篇 |
1984年 | 24篇 |
1983年 | 26篇 |
1982年 | 15篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1963年 | 1篇 |
1962年 | 1篇 |
1958年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
把拍卖和市场理念引入到生产计划的求解过程中,结合多Agent理论,对大规模生产系统按生产单元建立分布式模型.各个生产单元看作相对独立核算的经济实体,其目标是实现自身利益最大化.当生产能力足够时,按照需求进行生产;当生产能力不足以完全满足需求时,紧缺生产资源的持有者按照单位能力获得最大收益的原则进行生产竞价与拍卖,实现了各个生产单元的分布式自主协商决策,并设计了求解算法.算例研究证明该方法的可操作性和求解的有效性. 相似文献
12.
The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output. 相似文献
13.
Argyris G. Kagiannas Thanassis Didis Dimitris Th. Askounis John Psarras 《国际能源研究杂志》2003,27(2):173-186
The needs that an energy supply system must meet are constantly changing, due to technological, social and political reasons. Effective energy planning is a dynamic process that is repeated periodically and adjusts to changing conditions. Energy decision makers and planners are no longer able to rely on inductive decision making since they have to investigate the effect of various decision parameters and possible future changes. To help in this process, models have been developed where estimates of future load growth, candidate power plants, fuels and other key factors can be introduced, from which the planners can evaluate decision parameters and the available alternatives. The paper presents the different methodologies and practices that are used by 11 energy models for energy demand forecasting, supply side management and generation expansion planning, demand side management and integrated resource planning. The paper concludes to the presentation of a strategic appraisal of the examined energy models appropriate for energy planning in Mozambique. Three models are proposed for conducting demand forecasting, generation expansion planning and demand side management. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
14.
15.
Although the gas metal arc welding (GMAW) process is widely used for joining metals, its planning is still a cumbersome task. The planning procedure involves many complex interrelationships among the process variables and depends heavily on empirical knowledge. Therefore, a solution method that allows a convenient way to represent the domain knowledge and evaluate the process variable relationships is needed. Further, the lack of a strong domain theory to quantify these interrelationships is a deficiency in the planning of the GMAW process. This paper presents a solution method that overcomes this deficiency and introduces a convenient knowledge representation scheme. The solution method considers the planning procedure to be a constraint satisfaction problem (CSP). The AC-4 algorithm is used to obtain arc consistency among nodes in the constraint network and the PC-4 algorithm is applied to obtain path consistency in the network. A modified version of the AC-4 algorithm is developed to reduce the search space and correspondingly reduce the computation time. An example is presented to demonstrate the capability of the method and its potential to reduce lead time. 相似文献
16.
Edwin P. D. Pednault 《Computational Intelligence》1988,4(3):356-372
This paper presents a method of solving planning problems that involve actions whose effects change according to the situations in which they are performed. The approach is an extension of the conventional planning methodology in which plans are constructed through an iterative process of scanning for goals that are not yet satisfied, inserting actions to achieve them, and introducing subgoals to these actions. This methodology was originally developed under the assumption that one would be dealing exclusively with actions that produce the same effects in every situation. The extension involves introducing additional subgoals to actions above and beyond the preconditions of execution normally introduced. These additional subgoals, called secondary preconditions, ensure that the actions are performed in contexts conducive to producing the effects we desire. This paper defines and analyzes secondary preconditions from a mathematically rigorous standpoint and demonstrates how they can be derived from regression operators. 相似文献
17.
David E. Wilkins 《Computational Intelligence》1988,4(3):373-380
Reasoning about actions necessarily involves tracking the truth of assertions about the world over time. The SIPE planning system retains the efficiency of the STRIPS assumption for this while enhancing expressive power by allowing the specification of a causl theory. Separation of knowledge about causality from knowledge about actions relieves operators of much of their representational burden and allows them to be applicable in a wide range of contexts. The implementation of causal theories is described, together with examples and evaluations of the system's expressive power and efficiency. 相似文献
18.
Diane J. Cook 《Applied Intelligence》1991,1(2):133-144
Analogical planning provides a means of solving engineering problems where other machine learning methods fail. Unlike many machine learning paradigms, analogy does not require numerous previous examples or a rich domain theory. Instead, analogical planners adapt knowledge of solved problems in similar domains to the current problem. Unfortunately, the analogical planning task is an expensive one. While the process of forming correspondences between a known problem and a new problem is complex, the problem of selecting a base case for the analogy is virtually intractable.This paper addresses the issue of efficiently forming analogical plans. The Anagram planning system is described, which takes advantage of the massively parallel architecture of the Connection Machine to perform base selection and map formation. Anagram provides a tractable solution to analogical planning, with a complexity that is sublinear in the size of the plans.This paper describes the Anagram system and its parallel algorithms. The paper also presents theoretical analyses and empirical results of testing the system on a large database of plans from the domain of automatic programming. 相似文献
19.
Text planning is traditionally done as a separate process, independent of linguistic realization. However, I show in this paper that it is essential for a text planner to know the linguistic consequences of its actions. The choice of how to realize an element affects how much information is conveyed (e.g., “Floyd arrived safely in Boston” vs. “Floyd landed safely at Logan”) and what other information can be added (e.g., “Peter was deciding for an hour” vs. *“Peter made a decision for an hour”). The choice of realization also affects how the relative salience of the elements being expressed will be perceived (e.g., “The green car is in the garage” vs. “The car in the garage is green”). I have defined an intermediate level of representation for text planning, called the Text Structure. It is an abstract linguistic level that reflects germane linguistic constraints while abstracting away from syntactic detail. This representation allows the text planner to have greater control over the decisions, so that it can take advantage of the expressiveness of language to convey subtleties of meaning. More importantly, the Text Structure allows the generation process overall to be incremental, since it ensures that the text plan being composed will always be expressible in the language. La planification de textes est habituellement réalisée séparément, sans tenir compte de la réalisation linguistique. Cependant, ľauteur demontre dans cet article qu'il est essentiel à un planificateur de textes de connai̊tre les conséquences linguistiques de ses actions. Le choix de la méhode de réalisation ?un élément influe sur la quantité?informations qui est transmise (par ex.: 〈〈 Floyd est arrivé sain et sauf à Boston 〉〉 et 〈〈 Floyd a atterri sain et sauf àľaéroport Logan 〉〉) et sur quelle autre information peut ětre ajoutée. Le choix de la méthode de réalisation influe également sur la façon dont les caractères saillants des ééments qui sont exprimés seront perçus (par ex.: 〈〈 la voiture verte est dans le garage 〉〉 et 〈〈 la voiture dans le garage est verte 〉〉). L'auteur a défini un niveau intérmediaire de représentation pour la planification de textes qu'il a appelé structure de texte. Il; s'agit ?'un niveau linguistique abstrait qui refléte les contraintes linguistiques appropriées tout en s'éloignant du détail syntaxique. Cette représentation permet au planificateur de textes ?avoir un meilleur contrǒle des décisions, et done de tirer profit de la force ?expression du langage afin de tenir compte des subtiliés de sens. Plus important encore, la structure de texte permet au processus de génération ?ětre incrémentiel, car elle s'assure que le plan de texte en voie de composition soit toujours exprimable dans le langage. 相似文献
20.
求解机械装配规划的新方法 总被引:6,自引:0,他引:6
本文提出一个求解机械装配规划的算法,其计算量~O(sN~2),其中s是零件所有可能装配方向的个数,N是工件的零件数(一般s~O(N)).而现行的求机械装配规划的算法,其计算量均随N的增加按指数律增加. 相似文献