全文获取类型
收费全文 | 199篇 |
免费 | 3篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 21篇 |
机械仪表 | 1篇 |
建筑科学 | 2篇 |
能源动力 | 1篇 |
轻工业 | 21篇 |
石油天然气 | 3篇 |
无线电 | 4篇 |
一般工业技术 | 21篇 |
冶金工业 | 78篇 |
原子能技术 | 1篇 |
自动化技术 | 48篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 4篇 |
2014年 | 3篇 |
2013年 | 3篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2010年 | 6篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 5篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 7篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 24篇 |
1997年 | 19篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 5篇 |
1987年 | 3篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 6篇 |
1976年 | 7篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 1篇 |
1965年 | 1篇 |
排序方式: 共有202条查询结果,搜索用时 15 毫秒
1.
Schechter M 《Food management》1991,26(4):118-21, 124-6, 128
Each of the five conference centers featured here displays the best its parent organization has to offer. Take a tour through Herman Miller, Inc.'s Marigold Lodge; UCLA Conference Center/Bruin Woods Family Resort, S.C. Johnson & Son, Inc.'s The Council House; Aetna Institute for Corporate Education; & Eastwood (Medical Center) Conference Center & discover conference dining's multifaceted mission. 相似文献
2.
Schechter ME 《Food management》1990,25(5):112-5, 120-4, 243-4
3.
Orna Kupferman Giuseppe Perelli Moshe Y. Vardi 《Annals of Mathematics and Artificial Intelligence》2016,78(1):3-20
Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. The environment often consists of agents that have objectives of their own. Thus, it makes sense to soften the universal quantification on the behavior of the environment and take the objectives of its underlying agents into an account. Fisman et al. introduced rational synthesis: the problem of synthesis in the context of rational agents. The input to the problem consists of temporal logic formulas specifying the objectives of the system and the agents that constitute the environment, and a solution concept (e.g., Nash equilibrium). The output is a profile of strategies, for the system and the agents, such that the objective of the system is satisfied in the computation that is the outcome of the strategies, and the profile is stable according to the solution concept; that is, the agents that constitute the environment have no incentive to deviate from the strategies suggested to them. In this paper we continue to study rational synthesis. First, we suggest an alternative definition to rational synthesis, in which the agents are rational but not cooperative. We call such problem strong rational synthesis. In the strong rational synthesis setting, one cannot assume that the agents that constitute the environment take into account the strategies suggested to them. Accordingly, the output is a strategy for the system only, and the objective of the system has to be satisfied in all the compositions that are the outcome of a stable profile in which the system follows this strategy. We show that strong rational synthesis is 2ExpTime-complete, thus it is not more complex than traditional synthesis or rational synthesis. Second, we study a richer specification formalism, where the objectives of the system and the agents are not Boolean but quantitative. In this setting, the objective of the system and the agents is to maximize their outcome. The quantitative setting significantly extends the scope of rational synthesis, making the game-theoretic approach much more relevant. Finally, we enrich the setting to one that allows coalitions of agents that constitute the system or the environment. 相似文献
4.
Randal E. Bryant Orna Grumberg Joseph Sifakis Moshe Y. Vardi 《Formal Methods in System Design》2010,36(3):195-197
The 2009 CAV (Computer-Aided Verification) award was presented to seven individuals who made major advances in creating high-performance
Boolean satisfiability solvers. This annual award recognizes a specific fundamental contribution or series of outstanding
contributions to the CAV field. 相似文献
5.
In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions. 相似文献
6.
Orna Grumberg Moshe Y. Vardi Joseph Sifakis Rajeev Alur 《Formal Methods in System Design》2012,40(2):117-120
The 2010 CAV (Computer-Aided Verification) award was awarded to Kenneth L. McMillan of Cadence Research Laboratories for a
series of fundamental contributions resulting in significant advances in scalability of model checking tools. The annual award
recognizes a specific fundamental contribution or a series of outstanding contributions to the CAV field. 相似文献
7.
Antony Cyril Arulrajan Palaniappan Subramanian Ramesh Kumar Singh Alex Schechter 《Israel journal of chemistry》2020,60(5-6):563-569
Developing Pt-free catalysts for hydrogen oxidation reaction (HOR) in alkaline solution is becoming a key challenge in the development of anion exchange membrane fuel cells and electrochemical reactors. Herein, we present the preparation, HOR activity, and stability of Pd-decorated tungsten (Pd-d-W) catalysts. The Pd-d-W catalysts were prepared by the chemically activated surface of tungsten nanoparticles by Pd ions. The resultant bimetallic catalysts consisted of crystalline phases of both Pd and W nanoparticles. The CO stripping voltammograms and H-desorption (Hdes) peak potential of hydrogen desorption in Pd suggests that the enhancement of HOR catalytic activity observed in Pd-d-W catalyst can be ascribed to the modification of electronic property of Pd and availability of OHad near-surface Pd atoms. 相似文献
8.
Luboš Brim Orna Grumberg 《International Journal on Software Tools for Technology Transfer (STTT)》2005,7(1):1-3
This special section is devoted to a selection of contributions originally presented at the 1st International Workshop on Parallel and Distributed Model Checking (PDMC 2002), which took place in Brno, Czech Republic in September 2002 as a satellite event of the 13th conference on concurrency theory (CONCUR 2002). The growing importance of automated formal verification in industry is driving a growing interest in those aspects that have a direct impact on its applicability to real-world problems. One of the main technical challenges is in devising tools that allow one to handle large state spaces. In the last several years numerous approaches to solving this problem have been developed. Recently there has been increasing interest in parallelizing and distributing verification techniques. Papers that appear in this special section provide an interesting sampling of typical approaches in this direction. 相似文献
9.
In implementation verification, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program's implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the sequential case. Thus, as in the model-checking verification methodology, the state-explosion problem cannot be avoided. 相似文献
10.
Tamir Heyman Danny Geist Orna Grumberg Assaf Schuster 《Formal Methods in System Design》2002,21(3):317-338
This paper presents a scalable method for parallelizing symbolic reachability analysis on a distributed-memory environment of workstations. We have developed an adaptive partitioning algorithm that significantly reduces space requirements. The memory balance is maintained by dynamically repartitioning the state space throughout the computation. A compact BDD representation allows coordination by shipping BDDs from one machine to another. This representation allows for different variable orders in the sending and receiving processes. The algorithm uses a distributed termination protocol, with none of the memory modules preserving a complete image of the set of reachable states. No external storage is used on the disk. Rather, we make use of the network, which is much faster.We implemented our method on a standard, loosely-connected environment of workstations, using a high-performance model checker. Initial performance evaluation of several large circuits shows that our method can handle models too large to fit in the memory of a single node. The partitioning algorithm achieves reduction in space, which is linear in the number of workstations employed. A corresponding decrease in space requirements is measured throughout the reachability analysis. Our results show that the relatively slow network does not become a bottleneck, and that computation time is kept reasonably small. 相似文献