全文获取类型
收费全文 | 238篇 |
免费 | 5篇 |
专业分类
化学工业 | 34篇 |
机械仪表 | 1篇 |
建筑科学 | 15篇 |
能源动力 | 8篇 |
轻工业 | 9篇 |
石油天然气 | 2篇 |
无线电 | 32篇 |
一般工业技术 | 28篇 |
冶金工业 | 35篇 |
原子能技术 | 1篇 |
自动化技术 | 78篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 7篇 |
2016年 | 10篇 |
2015年 | 3篇 |
2014年 | 2篇 |
2013年 | 12篇 |
2012年 | 14篇 |
2011年 | 9篇 |
2010年 | 9篇 |
2009年 | 10篇 |
2008年 | 7篇 |
2007年 | 9篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 1篇 |
1998年 | 13篇 |
1997年 | 10篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1972年 | 5篇 |
1971年 | 1篇 |
1970年 | 4篇 |
1969年 | 2篇 |
1965年 | 1篇 |
排序方式: 共有243条查询结果,搜索用时 31 毫秒
1.
Rattok Jack; Ross Barbara; Ben-Yishay Yehuda; Ezrachi Ora; Silver Saralyn; Lakin Phyllis; Vakil Eli; Piasetsky Eugene; Zide Ellen; Diller Leonard 《Canadian Metallurgical Quarterly》1992,6(4):395
Within a clinical demonstration program, 59 traumatically brain-injured patients were treated with 1 of 3 mixes of treatment. Mix 1 included cognitive remediation (CGR), small-group interpersonal (SGI) communication training, therapeutic community activities, and personal counseling. Mix 2 was similar to Mix 1 but stressed SGI exercises and eliminated CGR. Mix 3 emphasized CGR and eliminated SGI exercises. The efficacy of the treatment mixes was evaluated with performance on neuropsychological tests, improved independence in functional activities, measures of intra- and interpersonal functioning, and vocational outcome. Ss' participation in the program, irrespective of treatment mix, yielded improvements in (1) self-image, (2) quality of interpersonal relatedness and interaction, (3) involvement with others in naturalistic settings, and (4) vocational outcome. Overall, data point to the superiority of the balanced mix (Mix 1) over Mixes 2 and 3. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
2.
It has recently been shown that authenticated Byzantine agreement,
in which more than a third of the parties are corrupted, cannot be
securely realized under concurrent or parallel (stateless)
composition. This result puts into question any usage of
authenticated Byzantine agreement in a setting where many
executions take place. In particular, this is true for the whole
body of work of secure multi-party protocols in the case that a
third or more of the parties are corrupted. This is because these
protocols strongly rely on the extensive use of a broadcast
channel, which is in turn realized using authenticated Byzantine
agreement. We remark that it was accepted folklore that the use of
a broadcast channel (or authenticated Byzantine agreement) is
actually essential for achieving meaningful secure multi-party
computation whenever a third or more of the parties are corrupted.
In this paper we show that this folklore is false. We present a
mild relaxation of the definition of secure computation allowing
abort. Our new definition captures all the central security issues
of secure computation, including privacy, correctness and
independence of inputs. However, the novelty of the definition is
in decoupling the issue of agreement from these issues. We
then show that this relaxation suffices for achieving secure
computation in a point-to-point network. That is, we show that
secure multi-party computation for this definition can be achieved
for any number of corrupted parties and without a
broadcast channel (or trusted pre-processing phase as required for
running authenticated Byzantine agreement). Furthermore, this is
achieved by just replacing the broadcast channel in known
protocols with a very simple and efficient echo-broadcast
protocol. An important corollary of our result is the ability to
obtain multi-party protocols that remain secure under composition,
without assuming a broadcast channel. 相似文献
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.
Yoad Lustig Moshe Y. Vardi 《International Journal on Software Tools for Technology Transfer (STTT)》2013,15(5-6):603-618
Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is always assumed the system is “constructed from scratch” rather than “composed” from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial system, either in hardware or in software system, relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. In this work, we define and study the problem of LTL synthesis from libraries of reusable components. We define two notions of composition: data-flow composition, for which we prove the problem is undecidable, and control-flow composition, for which we prove the problem is 2EXPTIME-complete. As a side benefit, we derive an explicit characterization of the information needed by the synthesizer on the underlying components. This characterization can be used as a specification formalism between component providers and integrators. 相似文献
5.
6.
Yehuda Afek Eli Gafni Sergio Rajsbaum Michel Raynal Corentin Travers 《Distributed Computing》2010,22(3):185-195
This paper introduces and investigates the k-simultaneous consensus task: each process participates at the same time in k independent consensus instances until it decides in any one of them. It is shown that the k-simultaneous consensus task is equivalent to the k-set agreement task in the wait-free read/write shared memory model, and furthermore k-simultaneous consensus possesses properties that k-set does not. In particular we show that the multivalued version and the binary version of the k-simultaneous consensus task are wait-free equivalent. These equivalences are independent of the number of processes. Interestingly, this provides us with a new characterization of the k-set agreement task that is based on the fundamental binary consensus problem. 相似文献
7.
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. 相似文献
8.
9.
10.
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. 相似文献