全文获取类型
收费全文 | 120篇 |
免费 | 0篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 14篇 |
建筑科学 | 1篇 |
轻工业 | 1篇 |
无线电 | 10篇 |
一般工业技术 | 3篇 |
冶金工业 | 22篇 |
自动化技术 | 67篇 |
出版年
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2013年 | 1篇 |
2012年 | 14篇 |
2011年 | 6篇 |
2010年 | 9篇 |
2009年 | 4篇 |
2008年 | 1篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 1篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 8篇 |
1997年 | 3篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1986年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 5篇 |
1975年 | 2篇 |
排序方式: 共有120条查询结果,搜索用时 234 毫秒
1.
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 相似文献
2.
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. 相似文献
3.
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 相似文献
4.
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).] 相似文献
5.
This paper shows that shared-coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Bracha and Rachman (1991) [10] and of Aspnes and Waarts (1996) [7], this yields a shared-coin algorithm, and hence, a randomized consensus algorithm, with O(nlog2n) individual work and O(n2logn) total work, using single-writer registers. This improves upon each of the above shared coins (where the former has a high cost for individual work, while the latter reduces it but pays in the total work), and is currently the best for this model. 相似文献
6.
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.
7.
Murdoch J. Gabbay 《Theoretical computer science》2009,410(12-13):1159-1189
Fraenkel–Mostowski (FM) set theory delivers a model of names and alpha-equivalence. This model, now generally called the ‘nominal’ model, delivers inductive datatypes of syntax with alpha-equivalence — rather than inductive datatypes of syntax, quotiented by alpha-equivalence.The treatment of names and alpha-equivalence extends to the entire sets universe. This has proven useful for developing ‘nominal’ theories of reasoning and programming on syntax with alpha-equivalence, because a sets universe includes elements representing functions, predicates, and behaviour.Often, we want names and alpha-equivalence to model capture-avoiding substitution. In this paper we show that FM set theory models capture-avoiding substitution for names in much the same way as it models alpha-equivalence; as an operation valid for the entire sets universe which coincides with the usual (inductively defined) operation on inductive datatypes.In fact, more than one substitution action is possible (they all agree on sets representing syntax). We present two distinct substitution actions, making no judgement as to which one is ‘right’ — we suspect this question has the same status as asking whether classical or intuitionistic logic is ‘right’. We describe the actions in detail, and describe the overall design issues involved in creating any substitution action on a sets universe.Along the way, we think in new ways about the structure of elements of FM set theory. This leads us to some interesting mathematical concepts, including the notions of planes and crucial elements, which we also describe in detail. 相似文献
8.
Summary Thesnapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to thelattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an implementation of a snapshot object. The overhead cost of this transformation is only a linear number of read and write operations on atomic single-writer multi-reader registers. The transformation uses an unbounded amount of shared memory. We present a deterministic algorithm for lattice agreement that usedO (log2
n) operations on 2-processorTest & Set registers, plusO (n) operations on atomic single-writer multi-reader registers. The shared objects are used by the algorithm in adynamic mode, that is, the identity of the processors that access each of the shared objects is determined dynamically during the execution of the algorithm. By a randomized implementation of 2-processorsTest & Set registers from atomic registers, this algorithm implies a randomized algorthm for lattice agreement that uses an expected number ofO (n) operations on (dynamic) atomic single-writer multi-reader registers. Combined with our transformation this yields implementations of atomic snapshots with the same complexity.Cambridge Research Laboratory, Digital Equipment Corporation
Hagit Attiya received the B.Sc. degreeiin Mathematics and Computer Science from the Hebrew University of Jerusalem, in 1981, the M.Sc. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem, in 1983 and 1987, respectively. She is presently a senior lecturer at the departtment of Computer Science at the Technion, Israel Institute of Technology. Prior to this, she has been a post-doctoral research associate at the Laboratory for Computer Science at M.I.T. Her general research interests are distributed computation and theoretical computer science. More specific interests include fault-tolerance, timing-based and asynchronous algorithms.
Maurice Herlihy received the A.B. degree in Mathematics from Harvard University, and the M.S. and the Ph.D. degrees in Computer Science from M.I.T. From 1984 to 1989 he was a faculty member in the Computer Science Department at Carnegie Mellon University in Pittsburgh, PA. In 1989 he joined the research staff at the Digital Equipment Corporation's Cambridge Research Laboratory in Cambridge MA. Since 1994, he has been on the faculty at the Computer Science Department at Brown University. Dr. Herlihy's research interests encompass practical and theoretical aspects of distributed and concurrent computation.
Ophir achman received a B.A. in computer science from the Technion, Haifa, Israel in 1989 and M.Sc. in computer science from the Technion, Haifa, Israel, in 1992. He is now studying for a D.Sc. in computer science at the Technion. His currentarea of research is distributed computing, and in particular, asynchronous shared memory systems.This work appeared in preliminary form in proceedings ofthe 6th International Workshop on Distributed Algorithms [12]. This research was partially supported by grant No. 92-0233 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Technion V.P.R. funds — B. and G. Greenberg Research Fund (Ottawa), and the fund for the promotion of research in the TechnionPart of the work of this author was performed while visiting DEC Cambridge Research Laboratory 相似文献
9.
We study the message complexity of the problem of distributively electing a leader in chordal rings. Such networks consist of a basic ring with additional links, the extreme cases being the oriented ring and the complete graph with a full sense of direction. We present a general election algorithm for these networks, and prove its optimality. As a corollary, we show thatO(logn) chords at each processor suffice to obtain an algorithm that uses at mostO(n) messages; this improves and extends a previous work, where an algorithm, also usingO(n) messages, was suggested for the case where alln-1 chords exist (the oriented complete network). 相似文献
10.
Oxygen Vacancy Relaxation and Domain Wall Hysteresis Motion in Cobalt-Doped Barium Titanate Ceramics
Bo Lin Cheng Tim W. Button Maurice Gabbay Gilbert Fantozzi Mario Maglione 《Journal of the American Ceramic Society》2005,88(4):907-911
Mechanical and dielectric loss measurements were carried out in the BaTiO3 ceramics doped with Co at frequencies between 0.01 Hz and 1 MHz as a function of temperature from −150° to 150°C. The relaxation peak observed in the ferroelectric phase with an activation energy of 0.27 eV is assumed to be related to the motion of oxygen vacancies. This peak could be because of the reorientation of an electrical dipole made of oxygen vacancies and Co3+ ions in the lattice. Furthermore, another loss peak located just below the Curie temperature T c could be interpreted as hysteretic motion of the domain walls in a regime where the domain wall density is changing. 相似文献