全文获取类型
收费全文 | 82篇 |
免费 | 0篇 |
国内免费 | 1篇 |
专业分类
化学 | 37篇 |
晶体学 | 7篇 |
力学 | 1篇 |
数学 | 7篇 |
物理学 | 31篇 |
出版年
2019年 | 1篇 |
2017年 | 1篇 |
2016年 | 1篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 5篇 |
2010年 | 1篇 |
2009年 | 3篇 |
2008年 | 1篇 |
2007年 | 2篇 |
2006年 | 1篇 |
2005年 | 1篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1973年 | 1篇 |
1961年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有83条查询结果,搜索用时 15 毫秒
1.
2.
Rajnikant D. Watkin G. Tranter 《Acta Crystallographica. Section C, Structural Chemistry》1995,51(10):2071-2073
3.
4.
5.
Richard Ian Cooper David John Watkin Howard D. Flack 《Acta Crystallographica. Section C, Structural Chemistry》2016,72(4):261-267
A study of post‐refinement absolute structure determination using previously published data was carried out using the CRYSTALS software package. We show that absolute structure determination may be carried out optimally using the analyses available in CRYSTALS, and that it is not necessary to have the separate procedures absolute structure determination and no interest in absolute structure as proposed by Flack [Chimia (2014), 68 , 26–30]. 相似文献
6.
We introduce optimal learning with a neural network, which we define as building a network with a minimal expectation generalisation error. This procedure may be analysed exactly in idealized problems by exploiting the relationship between sampling a space of hypotheses and the replica method of statistical physics. We find that the optimally trained spherical perceptron may learn a linearly separable rule as well as any possible computer, and present simulation results supporting our conclusions. Optimal learning of a well-known unlearnable problem, the “mismatched weight” problem, gives better asymptotic learning than conventional techniques, and may be simulated more easily. Unlike many other perceptron learning schemes, optimal learning extends to more general networks learning more complex rules. 相似文献
7.
8.
9.
10.
A new, vectorial approach to fast correlation attacks on binary memoryless combiners is proposed. Instead of individual input sequences or their linear combinations, the new attack is targeting subsets of input sequences as a whole thus exploiting the full correlation between the chosen subset and the output sequence. In particular, the set of all the input sequences can be chosen as the target. The attack is based on a novel iterative probabilistic algorithm which is also applicable to general memoryless combiners over finite fields or finite rings. To illustrate the effectiveness of the introduced approach, experimental results obtained for random balanced combining functions are presentedMost of this work was done while he was with Rome CryptoDesign Center, Gemplus, Italy 相似文献