全文获取类型
收费全文 | 84篇 |
免费 | 0篇 |
国内免费 | 1篇 |
专业分类
化学 | 29篇 |
力学 | 5篇 |
数学 | 20篇 |
物理学 | 31篇 |
出版年
2021年 | 1篇 |
2020年 | 2篇 |
2016年 | 2篇 |
2013年 | 3篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2009年 | 3篇 |
2008年 | 6篇 |
2007年 | 5篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 4篇 |
2002年 | 4篇 |
2000年 | 7篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1877年 | 2篇 |
排序方式: 共有85条查询结果,搜索用时 15 毫秒
81.
82.
Conditions are given under which optimal controls are Lipschitz continuous, for dynamic optimization problems with functional inequality constraints. The linear independence condition on active state constraints, present in the earlier literature, can be replaced by a less restrictive, positive linear independence condition, that requires linear independence merely with respect to non-negative weighting parameters. Smoothness conditions on the data are also relaxed. A key part of the proof involves an analysis of the implications of first order optimality conditions in the form of a nonsmooth Maximum Principle. 相似文献
83.
Roberto Avanzi Waldyr Dias BenitsJr Steven D. Galbraith James McKee 《Designs, Codes and Cryptography》2011,61(1):71-89
Frobenius expansions are representations of integers to an algebraic base which are sometimes useful for efficient (hyper)elliptic
curve cryptography. The normal form of a Frobenius expansion is the polynomial with integer coefficients obtained by reducing
a Frobenius expansion modulo the characteristic polynomial of Frobenius. We consider the distribution of the coefficients
of reductions of Frobenius expansions and non-adjacent forms of Frobenius expansions (NAFs) to normal form. We give asymptotic
bounds on the coefficients which improve on naive bounds, for both genus one and genus two. We also discuss the non-uniformity
of the distribution of the coefficients (assuming a uniform distribution for Frobenius expansions). 相似文献
84.
P. Galbraith 《International Journal of Mathematical Education in Science & Technology》2013,44(3):277-290
This paper is concerned with identifying and assessing the impacts of various technologically enriched approaches to mathematics learning. Its purpose is to address the usefulness of emerging knowledge to enhance practice, and to contribute to theorizing about technology-based learning. Hence the main drivers are intentions to identify and elaborate on obstacles, errors, and unresolved problems on the one hand, and positives and insights on the other. The paper tells a cautionary tale about expectations of technology-enhanced learning, while simultaneously uncovering a rich base from which to theorize and test new appreciations of what is involved when students, technology, and mathematics connect in learning settings. A summary assessment is that this area still very much represents work in progress, but there is now a heightened realization, at least among those not transfixed by technological blindness, that the search for ultimate answers will require much greater exploration of machine–mathematics–learner relationships. 相似文献
85.
We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in groups. More precisely, we consider sampling coloured balls and placing them in urns, such that the distribution of assigning balls to urns depends on the colour of the ball. We determine the expected number of trials until two balls of different colours are placed in the same urn. As an aside we present an amusing “paradox” about birthdays. 相似文献