全文获取类型
收费全文 | 85篇 |
免费 | 10篇 |
专业分类
化学 | 3篇 |
力学 | 27篇 |
综合类 | 3篇 |
数学 | 21篇 |
物理学 | 41篇 |
出版年
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 3篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 8篇 |
2012年 | 3篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1986年 | 1篇 |
排序方式: 共有95条查询结果,搜索用时 15 毫秒
1.
Matthew J. Katz 《Computational Geometry》1997,8(6):299-316
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).
We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm. 相似文献
2.
Man Young Kim Seung Wook Baek 《Journal of Quantitative Spectroscopy & Radiative Transfer》2005,90(3-4):377-388
Radiative heat transfer in an axisymmetric enclosure with absorbing, emitting, and scattering medium is studied here by using the different methods such as MDOM, FVM, and MFVM with emphasis on the treatment of angular derivative term, which appears in curvilinear coordinates due to angular redistribution. After final discretization equation for MFVM is introduced by using the step scheme and directional weights, the present approach is validated by applying it to three different benchmarking problems with absorbing, emitting, and scattering medium. All of the results presented here support its accuracy as well as moderate efficiency. Finally, the present approaches are applied to a truncated cone-shaped enclosure as a body-fitted geometry case. 相似文献
3.
S.K. Mahapatra B.K. Dandapat 《Journal of Quantitative Spectroscopy & Radiative Transfer》2006,102(2):277-292
The current study addresses the mathematical modeling aspects of coupled conductive and radiative heat transfer in the presence of absorbing, emitting and isotropic scattering gray medium within two-dimensional square enclosure. A blended method where the concepts of modified differential approximation employed by combining discrete ordinate method and spherical harmonics method, has been developed for modeling the radiative transport equation. The gray participating medium is bounded by isothermal walls of two-dimensional enclosure which are considered to be opaque, diffuse and gray. The effect of various influencing parameters i.e., radiation-conduction parameter, surface emissivity, single scattering albedo and optical thickness has been illustrated. The adaptability of the present method has also been addressed. 相似文献
4.
Shinya Miyajima 《Numerical Linear Algebra with Applications》2015,22(3):548-563
Fast algorithms for enclosing the minimum norm least squares solution of the matrix equation AXB = C are proposed. To develop these algorithms, theories for obtaining error bounds of numerical solutions are established. The error bounds obtained by these algorithms are verified in the sense that all the possible rounding errors have been taken into account. Techniques for accelerating the enclosure and obtaining smaller error bounds are introduced. Numerical results show the properties of the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
5.
6.
In this paper, we consider the automatic computation of slope enclosures for continuous real functions given by two or more
branches, such as piecewise defined nonsmooth functions. We show that a commonly used formula found in the literature does
not always provide a slope enclosure for such functions. Furthermore, we prove a similar formula that always holds.
AMS subject classification (2000) 65G20 相似文献
7.
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in
or
. Our planar structures are actually fitted for a more general class of objects – (β,δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor. 相似文献
8.
Vy khoi Le 《Czechoslovak Mathematical Journal》2008,58(2):541-560
The paper is about a sub-supersolution method for the prescribed mean curvature problem. We formulate the problem as a variational
inequality and propose appropriate concepts of sub-and supersolutions for such inequality. Existence and enclosure results
for solutions and extremal solutions between sub-and supersolutions are established. 相似文献
9.
In this paper, we formulate two classes of problems, the colored range query problems and the colored point enclosure query problems to model multi-dimensional range and point enclosure queries in the presence of categorical information. Many of these problems are difficult to solve using traditional data structural techniques. Based on a new framework of combining sketching techniques and traditional data structures, we obtain two sets of results in solving the problems approximately and efficiently. In addition, the framework can be employed to attack other related problems by finding the appropriate summary structures. 相似文献
10.