全文获取类型
收费全文 | 234篇 |
免费 | 1篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 10篇 |
轻工业 | 3篇 |
石油天然气 | 1篇 |
无线电 | 2篇 |
一般工业技术 | 4篇 |
冶金工业 | 172篇 |
自动化技术 | 41篇 |
出版年
2021年 | 1篇 |
2019年 | 1篇 |
2012年 | 11篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2008年 | 1篇 |
2007年 | 1篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 38篇 |
1997年 | 20篇 |
1996年 | 37篇 |
1995年 | 13篇 |
1994年 | 14篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 7篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 5篇 |
1976年 | 8篇 |
1975年 | 2篇 |
排序方式: 共有235条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
Spheroidal wave functions (SWF) and the spectral-domain method (SDM) are used to compute the effective dielectric constant for microstrip. The authors explore the ability of the SWF to change shape as a function of a parameter, e.g. frequency, while maintaining orthogonality, completeness, edge condition, and aperture limit. The authors introduce the SDM equations, provide a brief overview of the SWF, and study the effective dielectric constant as a function of frequency for several commonly used basis functions. A single-term expansion for the vector current density provides excellent results over a broad spectrum (1-100 GHz). Numerical results compare favorably with other commonly used techniques 相似文献
7.
In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics. 相似文献
8.
A New Approach to Abstract Syntax with Variable Binding 总被引:1,自引:1,他引:0
The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions
of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of formal
systems involving variable-binding operations. Inductively defined FM-sets involving the name-abstraction set former (together
with Cartesian product and disjoint union) can correctly encode syntax modulo renaming of bound variables. In this way, the
standard theory of algebraic data types can be extended to encompass signatures involving binding operators. In particular,
there is an associated notion of structural recursion for defining syntax-manipulating functions (such as capture avoiding
substitution, set of free variables, etc.) and a notion of proof by structural induction, both of which remain pleasingly
close to informal practice in computer science.
Received October 2000 / Accepted in revised form April 2001 相似文献
9.
Serena Villata Guido Boella Dov M. Gabbay Leendert van der Torre Joris Hulstijn 《Annals of Mathematics and Artificial Intelligence》2012,66(1-4):199-230
In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung??s abstract argumentation frameworks. We distinguish three kinds of decision problems for argumentation verification, called extension verification, framework verification, and specification verification respectively. For example, given a political requirement like ??if the argument to increase taxes is accepted, then the argument to increase services must be accepted too,?? we can either verify an extension of acceptable arguments, or all extensions of an argumentation framework, or all extensions of all argumentation frameworks satisfying a framework specification. We introduce the logic of argumentation verification to specify such requirements, and we represent the three verification problems of argumentation as model checking and theorem proving properties of the logic. Moreover, we recast the logic of argumentation verification in a modal framework, in order to express multiple extensions, and properties like transitivity and reflexivity of the attack relation. Finally, we introduce a logic of meta-argumentation where abstract argumentation is used to reason about abstract argumentation itself. We define the logic of meta-argumentation using the fibring methodology in such a way to represent attack relations not only among arguments but also among attacks. We show how to use this logic to verify the requirements of argumentation frameworks where higher-order attacks are allowed [A preliminary version of the logic of argumentation compliance was called the logic of abstract argumentation?(2005).] 相似文献
10.
We consider conditionals of the form A ? B where A depends on the future and B on the present and past. We examine models for such conditional arising in Talmudic legal cases. We call such conditionals contrary to time conditionals. Three main aspects will be investigated:
- Inverse causality from future to past, where a future condition can influence a legal event in the past (this is a man made causality).
- Comparison with similar features in modern law.
- New types of temporal logics arising from modelling the Talmudic examples.