全文获取类型
收费全文 | 4434篇 |
免费 | 462篇 |
国内免费 | 414篇 |
专业分类
电工技术 | 175篇 |
综合类 | 399篇 |
化学工业 | 40篇 |
金属工艺 | 70篇 |
机械仪表 | 432篇 |
建筑科学 | 75篇 |
矿业工程 | 44篇 |
能源动力 | 19篇 |
轻工业 | 28篇 |
水利工程 | 25篇 |
石油天然气 | 12篇 |
武器工业 | 59篇 |
无线电 | 218篇 |
一般工业技术 | 182篇 |
冶金工业 | 254篇 |
原子能技术 | 5篇 |
自动化技术 | 3273篇 |
出版年
2024年 | 14篇 |
2023年 | 43篇 |
2022年 | 83篇 |
2021年 | 79篇 |
2020年 | 72篇 |
2019年 | 78篇 |
2018年 | 60篇 |
2017年 | 61篇 |
2016年 | 106篇 |
2015年 | 129篇 |
2014年 | 177篇 |
2013年 | 221篇 |
2012年 | 217篇 |
2011年 | 232篇 |
2010年 | 220篇 |
2009年 | 268篇 |
2008年 | 308篇 |
2007年 | 311篇 |
2006年 | 360篇 |
2005年 | 312篇 |
2004年 | 263篇 |
2003年 | 252篇 |
2002年 | 214篇 |
2001年 | 179篇 |
2000年 | 159篇 |
1999年 | 122篇 |
1998年 | 123篇 |
1997年 | 96篇 |
1996年 | 88篇 |
1995年 | 79篇 |
1994年 | 76篇 |
1993年 | 67篇 |
1992年 | 55篇 |
1991年 | 59篇 |
1990年 | 27篇 |
1989年 | 34篇 |
1988年 | 20篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1979年 | 3篇 |
1975年 | 2篇 |
1964年 | 1篇 |
1962年 | 2篇 |
1961年 | 2篇 |
1959年 | 1篇 |
1957年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有5310条查询结果,搜索用时 0 毫秒
71.
基于消点法的几何自动推理系统实现 总被引:5,自引:2,他引:3
为了实现几何自动推理的可读性证明,并提高推理效率,介绍了一个基于消点法的可构造性几何命题自动推理系统的设计与实现。该系统提供作图的方式接受用户的几何命题前提条件的输入,可以对初等几何中的大部分可构造性几何问题进行自动证明和求解,并生成可读的证明步骤,大大方便了初高等几何教育和相关研究者的需要。 相似文献
72.
ADL and the State-Transition Model of Action 总被引:1,自引:0,他引:1
73.
74.
Seifert Colleen M. Hammond Kristian J. Johnson Hollyn M. Converse Timothy M. McDougal Thomas F. Vanderstoep Scott W. 《Machine Learning》1994,16(1-2):37-56
Interest in psychological experimentation from the Artificial Intelligence community often takes the form of rigorous post-hoc evaluation of completed computer models. Through an example of our own collaborative research, we advocate a different view of how psychology and AI may be mutually relevant, and propose an integrated approach to the study of learning in humans and machines. We begin with the problem of learning appropriate indices for storing and retrieving information from memory. From a planning task perspective, the most useful indices may be those that predict potential problems and access relevant plans in memory, improving the planner's ability to predict and avoid planning failures. This predictive features hypothesis is then supported as a psychological claim, with results showing that such features offer an advantage in terms of the selectivity of reminding because they more distinctively characterize planning situations where differing plans are appropriate.We present a specific case-based model of plan execution, RUNNER, along with its indices for recognizing when to select particular plans—appropriateness conditions—and how these predictive indices serve to enhance learning. We then discuss how this predictive features claim as implemented in the RUNNER model is then tested in a second set of psychological studies. The results show that learning appropriateness conditions results in greater success in recognizing when a past plan is in fact relevant in current processing, and produces more reliable recall of the related information. This form of collaboration has resulted in a unique integration of computational and empirical efforts to create a model of case-based learning. 相似文献
75.
陈家发 《计算机研究与发展》1994,(4)
本文提出的判别树是一种既系统又直观地描述判别思路的模型,寄生树是一种用来判定判别树中结点的子特征的判别树。在专家系统的研究中,应用本模型有三个优点:①可有条理地描述、整理复杂的分类判别知识;②易于转换出相应的产生式规则或框架形式的知识库;③能清晰直观地指导设计高效的判别推理机。 相似文献
76.
T. Schaub 《Journal of Automated Reasoning》1995,15(1):95-165
We present a new approach to query answering in default logics. The basic idea is to treat default rules as classical implications along with some qualifying conditions restricting the use of such rules while query answering. We accomplish this by taking advantage of the conception of structure-oriented theorem proving provided by Bibel's connection method. We show that the structure-sensitive nature of the connection method allows for an elegant characterization of proofs in default logic. After introducing our basic method for query answering in default logics, we present a corresponding algorithm and describe its implementation. Both the algorithm and its implementation are obtained by slightly modifying an existing algorithm and an existing implementation of the standard connection method. In turn, we give a couple of refinements of the basic method that lead to conceptually different algorithms. The approach turns out to be extraordinarily qualified for implementations by means of existing automated theorem proving techniques. We substantiate this claim by presenting implementations of the various algorithms along with some experimental analysis.Even though our method has a general nature, we introduce it in the first part of this paper with the example of constrained default logic. This default logic is tantamount to a variant due to Brewka, and it coincides with Reiter's default logic and a variant due to ukaszewicz on a large fragment of default logic. Accordingly, our exposition applies to these instances of default logic without any modifications. 相似文献
77.
78.
P. Bison C. Ferrari E. Pagello L. Stocchiero 《Journal of Intelligent and Robotic Systems》1995,13(1):45-74
This paper presents the core of a software system able to determine a good grasp configuration on 3D objects for a three-fingered hand. The grasp planning problem has been studied considering both the constraints due to the stability and accessibility conditions, and the ones related to functionality. Physical, geometrical, spatial and task-related knowledge for solving the grasp planning problem have been properly modelled to support a heuristic-based reasoning process. A series of heuristic rules and geometric tests are used to scan the solution space, searching for a good grasp. In fact, when considering the three-dimensional case, a purely analytical and exhaustive approach appears too complex because of the dimension of the search space. This approach results in an incremental and modular model of grasp reasoning, that has been implemented using the Flex expert system shell. This work has been developed and demonstrated within the Esprit 2 project CIM-PLATO No. 2202. 相似文献
79.
知识推理是人工智能的核心领域,旨在研究如何从已知(知识库和推理规则)推理出未知,以帮助智能体做出科学决策.而智能体所处的环境存在不可观性和不确定性,因此知识库通常不仅包含确定性知识,还包含不确定性知识,而且推理过程需要两类知识紧密协作.然而,目前的推理方法无法将两类知识统一表示,常常将两者对应的推理过程割裂进行.基于此,为了实现在统一的模型架构下完成确定性和不确定性联合推理,给出了一种知识Petri网推理方法.首先,定义了一种新的知识Petri网,使其不仅能够描述确定性的知识规范,也可以描述先验概率知识;其次,根据知识Petri网的网结构,给出了一种知识Petri网概率独立剪枝算法,能够指数级地降低不确定性推理的计算复杂性;最后,利用知识Petri网及其概率独立剪枝算法,给出了一种新型推理算法,实现了确定性和不确定性的联合推理,并利用Wumpus世界进行了演示和验证. 相似文献
80.
将语义数据流处理引擎与知识图谱嵌入表示学习相结合,可以有效提高实时数据流推理查询性能,但是现有的知识表示学习模型更多关注静态知识图谱嵌入,忽略了知识图谱的动态特性,导致难以应用于实时动态语义数据流推理任务。为了使知识表示学习模型适应知识图谱的在线更新并能够应用于语义数据流引擎,建立一种基于改进多嵌入空间的动态知识图谱嵌入模型PUKALE。针对传递闭包等复杂推理场景,提出3种嵌入空间生成算法。为了在进行增量更新时更合理地选择嵌入空间,设计2种嵌入空间选择算法。基于上述算法实现PUKALE模型,并将其嵌入数据流推理引擎CSPARQL-engine中,以实现实时语义数据流推理查询。实验结果表明,与传统的CSPARQL和KALE推理相比,PUKALE模型的推理查询时间分别约降低85%和93%,其在支持动态图谱嵌入的同时能够提升实时语义数据流推理准确率。 相似文献