全文获取类型
收费全文 | 170篇 |
免费 | 4篇 |
国内免费 | 6篇 |
专业分类
综合类 | 7篇 |
化学工业 | 1篇 |
金属工艺 | 5篇 |
建筑科学 | 25篇 |
能源动力 | 2篇 |
轻工业 | 5篇 |
水利工程 | 2篇 |
无线电 | 8篇 |
一般工业技术 | 6篇 |
冶金工业 | 3篇 |
自动化技术 | 116篇 |
出版年
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2018年 | 2篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 8篇 |
2013年 | 9篇 |
2012年 | 11篇 |
2011年 | 11篇 |
2010年 | 5篇 |
2009年 | 8篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 12篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 7篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1960年 | 1篇 |
排序方式: 共有180条查询结果,搜索用时 0 毫秒
1.
2.
A major motivation of proof-planning is to bridge the gap between high-level, cognitively adequate reasoning for specific domains, and calculus-level reasoning to ensure soundness. For high reasoning levels the cognitive adequacy of representation and reasoning techniques is a major issue, while for lower reasoning levels the adequacy wrt. the modelled domain is important. Furthermore, proof construction is an engineering task and there is a need to support the design and application of proof-search engineering methods. To this end we present a framework to explicitly support different reasoning levels. To structure reasoning levels the framework allows for an explicit representation of abstractions and proof-search refinement techniques. In order to ensure soundness within a reasoning level, we use techniques developed in the context of matrix characterisation relying on the notion of indexed formulas. Furthermore, we introduce a uniform concept for contextual reasoning, and sketch basic tacticals for the definition of tactics to organise the overall proof-search inside and across different reasoning levels. 相似文献
3.
Real robots should be able to adapt autonomously to various environments in order to go on executing their tasks without breaking
down. They achieve this by learning how to abstract only useful information from a huge amount of information in the environment
while executing their tasks. This paper proposes a new architecture which performs categorical learning and behavioral learning
in parallel with task execution. We call the architectureSituation Transition Network System (STNS). In categorical learning, it makes a flexible state representation and modifies it according to the results of behaviors.
Behavioral learning is reinforcement learning on the state representation. Simulation results have shown that this architecture
is able to learn efficiently and adapt to unexpected changes of the environment autonomously.
Atsushi Ueno, Ph.D.: He is a research associate in the Artificial Intelligence Laboratory at the Graduate School of Information Science at the
Nara Institute of Science and Technology (NAIST). He received the B.E., the M.E., and the Ph.D. degrees in aeronautics and
astronautics from the University of Tokyo in 1991, 1993, and 1997 respectively. His research interest is robot learning and
autonomous systems. He is a member of Japan Association for Artificial Intelligence (JSAI).
Hideaki Takeda, Ph.D.: He is an associate professor in the Artificial Intelligence Laboratory at the Graduate School of Information Science at the
Nara Institute of Science and Technology (NAIST). He received his Ph.D. in precision machinery engineering from the University
of Tokyo in 1991. He has conducted research on a theory of intelligent computer-aided design systems, in particular experimental
study and logical formalization of engineering design. He is also interested in multiagent architectures and ontologies for
knowledge base systems. 相似文献
4.
Mutation Testing in the Refinement Calculus 总被引:2,自引:0,他引:2
Bernhard K. Aichernig 《Formal Aspects of Computing》2003,15(2-3):280-295
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalisation of mutation testing techniques is presented to be applied to contracts ranging from formal specifications to programs. It is demonstrated that refinement and its dual abstraction are the key notions leading to a precise and yet simple theory of mutation testing. The refinement calculus of Back and von Wright is used to express concepts like contracts, useful mutations, test cases and test coverage. 相似文献
5.
YUVAL SHAHAR 《人工智能实验与理论杂志》2013,25(1):123-144
Temporal interpolation is the task of bridging gaps between time-oriented concepts in a context-sensitive manner. It is a subtask important for solving the temporal-abstraction task-abstraction of interval-based, higher-level concepts from time-stamped data. We present a knowledge-based approach to the temporal-interpolation task and discuss in detail the precise knowledge required by that approach, its theoretical foundations, and the implications of the approach. The temporal-interpolation computational mechanism we discuss relies, among other knowledge types, on a temporal-persistence model. The temporal-persistence model employs local temporal-persistence functions that are temporally bidirectional (i.e. extend a belief measure in a predicate both into the future and into the past) and global, maximal-gap temporal-persistence functions that bridge gaps between interval-based predicates. We investigate the quantitative and qualitative properties implied by both types of persistence functions. We have implemented our approach in the RÉSUMÉ program and evaluated it in several different medical and engineering domains. We discuss the implications of our conceptual and computational methodology for acquisition, maintenance, reuse, and sharing of temporal-abstraction knowledge. 相似文献
6.
曾如松 《湖南工业大学学报》1994,(3)
本文从符号性、规范性、严密性、抽象性四个方面阐述了高等数学的特点。并针对学生学习高等数学所遇到的问题和数学自身的规律性,笔者提出了几种解决的办法:注意数学语言训练、注意运算方法的分类归纳、教学中强调数学来源于实践应用于实践。 相似文献
7.
The use of abstraction in the context of abstract data types, is investigated. Properties to be checked are formulas in a first order logic under Kleene's 3-valued interpretation. Abstractions are defined as pairs consisting of a congruence and a predicate interpretation. Three types of abstractions are considered,∀∀, ∀∃ and ∃0,1∀, and for each of them corresponding property preservation results are established. An abstraction refinement property is also obtained. It shows how one can pass from an existing abstraction to a (less) finer one. Finally, equationally specified abstractions in the context of equationally specified abstract data types are discussed and exemplified.On leave from the Department of Computer Science, “Al. I. Cuza” University, Iaşi 740083, RomaniaThe research reported in this paper was partially supported by the program ECO-NET 08112WJ/2004-2005 and by the National University Research Council of Romania, grants CNCSIS 632(28)/2004 and CNCSIS 632(50)/2005. 相似文献
8.
In computer graphics we use techniques from different areas of mathematics. Mathematical models are used to simulate real-world objects, as well as natural phenomena. In order to understand these models and pose relevant problems in each particular field of this area, it is important to create levels of abstraction. These levels encapsulate common properties of the different models and allow us to have a global, conceptual view of the methods and techniques in each field. In this paper we study a paradigm for creating abstraction levels that can also be used to characterize more general problems in computational applied mathematics. We apply this paradigm to different areas of computer graphics: modeling, animation, illumination, color theory, image processing and human-computer interface. 相似文献
9.
Abstraction in Computer Science 总被引:1,自引:0,他引:1
We characterize abstraction in computer science by first comparing the fundamental nature of computer science with that of
its cousin mathematics. We consider their primary products, use of formalism, and abstraction objectives, and find that the
two disciplines are sharply distinguished. Mathematics, being primarily concerned with developing inference structures, has
information neglect as its abstraction objective. Computer science, being primarily concerned with developing interaction patterns, has information hiding as its abstraction objective. We show that abstraction through information hiding is a primary factor in computer science
progress and success through an examination of the ubiquitous role of information hiding in programming languages, operating
systems, network architecture, and design patterns. 相似文献
10.
Nathaniel Charlton 《Formal Aspects of Computing》2007,19(3):375-399
In this paper we propose and argue for a modular framework for interprocedural program analysis, where multiple program analysis
tools are combined in order to exploit the particular advantages of each. This allows for “plugging together” such tools as
required by each verification task and makes it easy to integrate new analyses. Our framework automates the sharing of information
between plugins using a first order logic with transitive closure, in a way inspired by the open product of Cortesi et al.
We describe a prototype implementation of our framework, which performs static assertion checking on a simple language for
heap-manipulating programs. This implementation includes plugins for three existing approaches—predicate abstraction, 3-valued
shape analysis and a decidable pointer analysis—and for a simple type system. We demonstrate through a detailed example the
increase in precision that our approach can provide. Finally we discuss the design decisions we have taken, in particular
the tradeoffs involved in the choice of language by which the plugins communicate, and identify some future directions for
our work.
R. Lazic, R. Nagarajan and J. C. P. Woodcock 相似文献