全文获取类型
收费全文 | 190篇 |
免费 | 1篇 |
国内免费 | 3篇 |
专业分类
化学 | 3篇 |
力学 | 4篇 |
数学 | 177篇 |
物理学 | 10篇 |
出版年
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 1篇 |
2016年 | 6篇 |
2015年 | 1篇 |
2014年 | 7篇 |
2013年 | 6篇 |
2012年 | 6篇 |
2011年 | 10篇 |
2010年 | 13篇 |
2009年 | 21篇 |
2008年 | 14篇 |
2007年 | 8篇 |
2006年 | 10篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有194条查询结果,搜索用时 0 毫秒
91.
Sequential selection has been solved in linear time by Blum et al. [M.B. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (4) (1972) 448–461]. Running this algorithm on a problem of size N with N>M, the size of the main-memory, results in an algorithm that reads and writes O(N) elements, while the number of comparisons is also bounded by O(N). This is asymptotically optimal, but the constants are so large that in practice sorting is faster for most values of M and N.This paper provides the first detailed study of the external selection problem. A randomized algorithm of a conventional type is close to optimal in all respects. Our deterministic algorithm is more or less the same, but first the algorithm builds an index structure of all the elements. This effort is not wasted: the index structure allows the retrieval of elements so that we do not need a second scan through all the data. This index structure can also be used for repeated selections, and can be extended over time. For a problem of size N, the deterministic algorithm reads N+o(N) elements and writes only o(N) elements and is thereby optimal to within lower-order terms. 相似文献
92.
Tatsuya Akutsu 《Computational Geometry》1998,9(4):247-256
This paper considers the following problem: given two point sets A and B (|A| = |B| = n) in d dimensional Euclidean space, determine whether or not A is congruent to B. This paper presents an O(n(d−1)/2 log n) time randomized algorithm. The birthday paradox, which is well-known in combinatorics, is used effectively in this algorithm. Although this algorithm is Monte-Carlo type (i.e., it may give a wrong result), this improves a previous O(nd−2 log n) time deterministic algorithm considerably. This paper also shows that if d is not bounded, the problem is at least as hard as the graph isomorphism problem in the sense of the polynomiality. Several related results are described too. 相似文献
93.
The numerical stability of barycentric Lagrange interpolation 总被引:10,自引:0,他引:10
The Lagrange representation of the interpolating polynomialcan be rewritten in two more computationally attractive forms:a modified Lagrange form and a barycentric form. We give anerror analysis of the evaluation of the interpolating polynomialusing these two forms. The modified Lagrange formula is shownto be backward stable. The barycentric formula has a less favourableerror analysis, but is forward stable for any set of interpolatingpoints with a small Lebesgue constant. Therefore the barycentricformula can be significantly less accurate than the modifiedLagrange formula only for a poor choice of interpolating points.This analysis provides further weight to the argument of Berrutand Trefethen that barycentric Lagrange interpolation shouldbe the polynomial interpolation method of choice. 相似文献
94.
Yumiharu Nakano 《Journal of Mathematical Analysis and Applications》2004,293(1):345-354
The idea of efficient hedging has been introduced by Föllmer and Leukert. They defined the shortfall risk as the expectation of the shortfall weighted by a loss function, and looked for strategies that minimize the shortfall risk under a capital constraint. In this paper, to measure the shortfall risk, we use the coherent risk measures introduced by Artzner, Delbaen, Eber and Heath. We show that, for a given contingent claim H, the optimal strategy consists in hedging a modified claim ?H for some randomized test ?. This is an analogue of the results by Föllmer and Leukert. 相似文献
95.
96.
Gerald Kuba 《Acta Mathematica Hungarica》2002,95(1-2):115-124
For a positive real parameter t, real numbers , , and
, we consider sums
, where
is the rounding error function, i.e.\
. Generalizing and improving the main result of Part I of the paper we show that there exists an absolute constant
such that
for all
, and all
. Further, we give applications concerning the circle problem with linear, polynomial, and general weight. 相似文献
97.
本文在文 [1 ]的基础上定义了关键因子的概念 ,提出了一次同余组的关键因子求解算法 ,并给出了解的舍入误差估计 .通过实例说明了该算法的求解过程 ,分析了该算法在计算机求解时相对于传统解法的优点 . 相似文献
98.
We consider a generalized class of location–allocation problems, in which N new facilities are to be located in the plane with respect to M objects. Each object is associated with a convex cost function, specifying the expenses for serving the object from any location in the plane. 相似文献
99.
The use of pumps as turbines in different applications has been gaining importance in the recent years, but the subject of hydraulic optimization still remains an open research problem. One of these optimization techniques that include rounding of the sharp edges at the impeller periphery (or turbine inlet) has shown tendencies of performance enhancement.In order to understand the effect of this hydraulic optimization, the paper introduces an analytical model in the pump as turbine control volume and brings out the functionalities of the internal variables classified under control variables consisting of the system loss coefficient and exit relative flow direction and under dependent variables consisting of net tangential flow velocity, net head and efficiency.The paper studies the effects of impeller rounding on a combination of radial flow and mixed flow pumps as turbines using experimental data. The impeller rounding is seen to have positive impact on the overall efficiency in different operating regions with an improvement in the range of 1-3%. The behaviour of the two control variables have been elaborately studied in which it is found that the system loss coefficient has reduced drastically due to rounding effects, while the extent of changes to the exit relative flow direction seems to be limited in comparison. The reasons for changes to these control variables have been physically interpreted and attributed to the behaviour of the wake zone at the turbine inlet and circulation within the impeller control volume.The larger picture of impeller rounding has been discussed in comparison with performance prediction models in pumps as turbines. The possible limitations of the analytical model as well as the test setup are also presented. The paper concludes that the impeller rounding technique is very important for performance optimization and recommends its application on all pump as turbine projects. It also recommends the standardization of the rounding effects over wide range of pump shapes including axial pumps. 相似文献
100.
Abraham MJ 《Journal of computational chemistry》2011,32(9):2041-2046
Several improvements to the previously optimized GROMACS BlueGene inner loops that evaluate nonbonded interactions in molecular dynamics simulations are presented. The new improvements yielded an 11% decrease in running time for both PME and other kinds of GROMACS simulations that use nonbonded table look-ups. Some other GROMACS simulations will show a small gain. 相似文献