全文获取类型
收费全文 | 153篇 |
免费 | 2篇 |
专业分类
化学工业 | 7篇 |
能源动力 | 1篇 |
轻工业 | 2篇 |
无线电 | 34篇 |
一般工业技术 | 8篇 |
冶金工业 | 20篇 |
自动化技术 | 83篇 |
出版年
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 2篇 |
2014年 | 3篇 |
2013年 | 9篇 |
2012年 | 6篇 |
2011年 | 2篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 6篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 11篇 |
1997年 | 5篇 |
1996年 | 6篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1976年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有155条查询结果,搜索用时 31 毫秒
1.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
2.
We show how to construct pseudo-random permutations that satisfy a certain cycle restriction, for example that the permutation
be cyclic (consisting of one cycle containing all the elements) or an involution (a self-inverse permutation) with no fixed
points. The construction can be based on any (unrestricted) pseudo-random permutation. The resulting permutations are defined
succinctly and their evaluation at a given point is efficient. Furthermore, they enjoy a fast forward property, i.e. it is possible to iterate them at a very small cost.
Received 10 August 2000 and revised 30 September 2000 Online publication 9 April 2001 相似文献
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.
Ronen Gradwohl Moni Naor Benny Pinkas Guy N. Rothblum 《Theory of Computing Systems》2009,44(2):245-268
We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss
methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle,
without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution
to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the
verifier.
In this paper we consider several protocols that achieve these goals. Broadly speaking, the protocols are either cryptographic
or physical. By a cryptographic protocol we mean one in the usual model found in the foundations of cryptography literature.
In this model, two machines exchange messages, and the security of the protocol relies on computational hardness. By a physical
protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In
particular, our physical protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just
simple playing cards.
The cryptographic protocols are direct and efficient, and do not involve a reduction to other problems. The physical protocols
are meant to be understood by “lay-people” and implementable without the use of computers.
Research of R. Gradwohl was supported by US-Israel Binational Science Foundation Grant 2002246.
Research of M. Naor was supported in part by a grant from the Israel Science Foundation.
Research of B. Pinkas was supported in part by the Israel Science Foundation (grant number 860/06).
Research of G.N. Rothblum was supported by NSF grant CNS-0430450 and NSF grant CFF-0635297. 相似文献
6.
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.
Pham TC Fells JI Osborne DA North EJ Naor MM Parrill AL 《Journal of molecular graphics & modelling》2008,26(8):1189-1201
Computational modeling and its application in ligand screening and ligand receptor interaction studies play important roles in structure-based drug design. A series of sphingosine 1-phosphate (S1P) receptor ligands with varying potencies and receptor selectivities were docked into homology models of the S1P(1-5) receptors. These studies provided molecular insights into pharmacological trends both across the receptor family as well as at single receptors. This study identifies ligand recognition features that generalize across the S1P receptor family, features unique to the S1P(4) and S1P(5) receptors, and suggests significant structural differences of the S1P(2) receptor. Docking results reveal a previously unknown sulfur-aromatic interaction between the S1P(4) C5.44 sulfur atom and the phenyl ring of benzimidazole as well as pi-pi interaction between F3.33 of S1P(1,4,5) and aromatic ligands. The findings not only confirm the importance of a cation-pi interaction between W4.64 and the ammonium of S1P at S1P(4) but also predict the same interaction at S1P(5). S1P receptor models are validated for pharmacophore development including database mining and new ligand discovery and serve as tools for ligand optimization to improve potency and selectivity. 相似文献
9.
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. 相似文献
10.
Optimized temporal monitors for SystemC 总被引:1,自引:1,他引:0
SystemC is a modeling language built as an extension of C++. Its growing popularity and the increasing complexity of designs have motivated research efforts aimed at the verification of SystemC models using assertion-based verification (ABV), where the designer asserts properties that capture the design intent in a formal language such as PSL or SVA. The model then can be verified against the properties using runtime or formal verification techniques. In this paper we focus on automated generation of runtime monitors from temporal properties. Our focus is on minimizing runtime overhead, rather than monitor size or monitor-generation time. We identify four issues in monitor generation: state minimization, alphabet representation, alphabet minimization, and monitor encoding. We conduct extensive experimentation and identify a combination of settings that offers the best performance in terms of runtime overhead. 相似文献