全文获取类型
收费全文 | 262篇 |
免费 | 25篇 |
国内免费 | 18篇 |
专业分类
化学 | 8篇 |
力学 | 25篇 |
综合类 | 2篇 |
数学 | 193篇 |
物理学 | 77篇 |
出版年
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 7篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 5篇 |
2014年 | 11篇 |
2013年 | 13篇 |
2012年 | 11篇 |
2011年 | 14篇 |
2010年 | 13篇 |
2009年 | 19篇 |
2008年 | 19篇 |
2007年 | 18篇 |
2006年 | 16篇 |
2005年 | 13篇 |
2004年 | 20篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 11篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 2篇 |
排序方式: 共有305条查询结果,搜索用时 31 毫秒
31.
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds 总被引:1,自引:0,他引:1
Ideas of a simplicial variable dimension restart algorithm to approximate zero points onR
n
developed by the authors and of a linear complementarity problem pivoting algorithm are combined to an algorithm for solving
the nonlinear complementarity problem with lower and upper bounds. The algorithm can be considered as a modification of the2n-ray zero point finding algorithm onR
n
. It appears that for the new algorithm the number of linear programming pivot steps is typically less than for the2n-ray algorithm applied to an equivalent zero point problem. This is caused by the fact that the algorithm utilizes the complementarity
conditions on the variables.
This work is part of the VF-program “Equilibrium and Disequilibrium in Demand and Supply,” which has been approved by the
Netherlands Ministry of Education and Sciences. 相似文献
32.
Walter Schempp 《Acta Appl Math》1997,48(2):185-234
Due to its unequalled advantages, the magnetic resonance imaging (MRI) modality has truly revolutionized the diagnosis and evaluation of pathology. Because many morphological anatomic details that may not be visualized by other high tech imaging methods can now be readily shown by diagnostic MRI, it has already become the standard modality by which all other clinical imaging techniques are measured. The unique quantum physical basis of the MRI modality combined with the imaging capabilities of current computer technology has made this imaging modality a target of interdisciplinary interest for clinicians, physicists, biologists, engineers, and mathematicians. Due to the fact that MRI scanners perform corticomorphic processing, this modality is by far more complex than all the other high tech clinical imaging techniques. The purpose of this paper is to outline a phase coherent wavelet approach to Fourier transform MRI. It is based on distributional harmonic analysis on the Heisenberg nilpotent Lie group G and the associated symplectically invariant symbol calculus of pseudodifferential operators. The contour and contrast resolution of MRI scans which is controlled by symplectic filter bank processing gives the noninvasive MRI modality superiority over X-ray computed tomography (CT) in soft tissue differentiation. 相似文献
33.
Michael Nast 《Journal of Global Optimization》1996,9(1):65-93
In this article, our primary concern is the classical problem of minimizing globally a concave function over a compact polyhedron (Problem (P)). We present a new simplicial branch and bound approach, which combines triangulations of intersections of simplices with halfspaces and ideas from outer approximation in such a way, that a class of finite algorithms for solving (P) results. For arbitrary compact convex feasible sets one obtains a not necessarily finite but convergent algorithm. Theoretical investigations include determination of the number of simplices in each applied triangulation step and bounds on the number of iterations in the resulting algorithms. Preliminary numerical results are given, and additional applications are sketched. 相似文献
34.
A tutorial outline of the polyhedral theory that underlies linear programming (LP)-based combinatorial problem solving is given. Design aspects of a combinatorial problem solver are discussed in general terms. Three computational studies in combinatorial problem solving using the polyhedral theory developed in the past fifteen years are surveyed: one addresses the symmetric traveling salesman problem, another the optimal triangulation of input/output matrices, and the third the optimization of large-scale zero-one linear programming problems. 相似文献
35.
《Journal of Graph Theory》2018,87(4):475-491
A Grünbaum coloring of a triangulation G is a map c : such that for each face f of G, the three edges of the boundary walk of f are colored by three distinct colors. By Four Color Theorem, it is known that every triangulation on the sphere has a Grünbaum coloring. So, in this article, we investigate the question whether each even (i.e., Eulerian) triangulation on a surface with representativity at least r has a Grünbaum coloring. We prove that, regardless of the representativity, every even triangulation on a surface has a Grünbaum coloring as long as is the projective plane, the torus, or the Klein bottle, and we observe that the same holds for any surface with sufficiently large representativity. On the other hand, we construct even triangulations with no Grünbaum coloring and representativity , and 3 for all but finitely many surfaces. In dual terms, our results imply that no snark admits an even map on the projective plane, the torus, or the Klein bottle, and that all but finitely many surfaces admit an even map of a snark with representativity at least 3. 相似文献
36.
一类分层三角剖分下三次样条空间的维数 总被引:1,自引:0,他引:1
本文定义了平面单连通多边形域的一类较任意的三角剖分-分层三角剖分,并通过分析二元样条的积分协调条件,确定了分层三角剖分卜三次C1作条函数空间的维数. 相似文献
37.
38.
39.
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution hypothesis for the input. In this paper we analyse a new deterministic planar navigation algorithm with constant spanning ratio (w.r.t the Euclidean distance) which follows vertex adjacencies in the Delaunay triangulation. We call this strategy cone walk. We prove that given n uniform points in a smooth convex domain of unit area, and for any start point z and query point q; cone walk applied to z and q will access at most sites with complexity with probability tending to 1 as n goes to infinity. We additionally show that in this model, cone walk is ‐memoryless with high probability for any pair of start and query point in the domain, for any positive ξ. We take special care throughout to ensure our bounds are valid even when the query points are arbitrarily close to the border. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 95–136, 2016 相似文献
40.
空间编码与灰度投影相结合实现高效3-D形貌测量的研究 总被引:2,自引:1,他引:1
介绍了一种结合空间编码与灰度投影来实现高效三维形貌测量的方法。用空间编码完成对被测空间的粗略编码,用灰度投影完成精确编码,将它们结合起来得到被测物体表面丰富的编码信息,作为一种基于三角法的三维形貌测量方法,能够在物体表面非常不连续和外部光照造成的背景光强分布不确定的情况下工作良好。同时,与传统的空间编码方法相比,它大大提高了空间编码的效率。实验表明,该方法用5 幅图像取得了与灰度码10幅图像相当的测量结果。 相似文献