全文获取类型
收费全文 | 294篇 |
免费 | 5篇 |
专业分类
电工技术 | 5篇 |
化学工业 | 34篇 |
金属工艺 | 1篇 |
机械仪表 | 1篇 |
建筑科学 | 22篇 |
能源动力 | 8篇 |
轻工业 | 14篇 |
水利工程 | 2篇 |
石油天然气 | 2篇 |
无线电 | 79篇 |
一般工业技术 | 37篇 |
冶金工业 | 47篇 |
原子能技术 | 1篇 |
自动化技术 | 46篇 |
出版年
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 4篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 4篇 |
2013年 | 14篇 |
2012年 | 10篇 |
2011年 | 10篇 |
2010年 | 11篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 11篇 |
2000年 | 6篇 |
1999年 | 2篇 |
1998年 | 17篇 |
1997年 | 13篇 |
1996年 | 5篇 |
1995年 | 11篇 |
1994年 | 5篇 |
1993年 | 10篇 |
1992年 | 5篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1973年 | 2篇 |
1972年 | 5篇 |
1970年 | 4篇 |
1969年 | 2篇 |
1965年 | 1篇 |
排序方式: 共有299条查询结果,搜索用时 15 毫秒
1.
The transformation is defined to leave a given bi-isotropic medium invariant, whence it is self-dual in this transformation. It is shown that duality transformations always exist in pairs, labeled as left-hand and right-hand transformations. Self-dual fields are seen to be generalizations of the wave fields E± applied in the analysis of reciprocal chiral media. It is demonstrated that plane wave propagation and reflection problems in bi-isotropic media can be solved easily in terms of self-dual field decompositions. Nonreciprocity is seen to give rise to effects like polarization rotation in reflection, which cannot be interpreted in terms of reciprocal chiral media 相似文献
2.
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) 相似文献
3.
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. 相似文献
4.
5.
The uniaxial bianisotropic medium is a generalisation of the bi-isotropic and chiral media which recently have been subject to intensive research. Such a medium results, for example, when microscopic helices with parallel axes are positioned in a host dielectric in random locations. Plane wave propagation in such a medium is studied and a simple solution for the dispersion equation is found. Numerical examples for the wave number surfaces of the medium are given.<> 相似文献
6.
Privacy Preserving Data Mining 总被引:4,自引:0,他引:4
7.
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. 相似文献
8.
9.
10.
We address the question of the weakest failure detector to circumvent the impossibility of $(2n-2)$ -renaming in a system of up to $n$ participating processes. We derive that in a restricted class of eventual failure detectors there does not exist a single weakest oracle, but a weakest family of oracles $\zeta _n$ : every two oracles in $\zeta _n$ are incomparable, and every oracle that allows for solving renaming provides at least as much information about failures as one of the oracles in $\zeta _n$ . As a by product, we obtain one more evidence that renaming is strictly easier to solve than set agreement. 相似文献