全文获取类型
收费全文 | 721篇 |
免费 | 59篇 |
国内免费 | 60篇 |
专业分类
化学 | 98篇 |
力学 | 15篇 |
综合类 | 8篇 |
数学 | 616篇 |
物理学 | 103篇 |
出版年
2024年 | 2篇 |
2023年 | 14篇 |
2022年 | 25篇 |
2021年 | 11篇 |
2020年 | 30篇 |
2019年 | 21篇 |
2018年 | 17篇 |
2017年 | 27篇 |
2016年 | 21篇 |
2015年 | 12篇 |
2014年 | 28篇 |
2013年 | 51篇 |
2012年 | 25篇 |
2011年 | 34篇 |
2010年 | 36篇 |
2009年 | 35篇 |
2008年 | 56篇 |
2007年 | 45篇 |
2006年 | 55篇 |
2005年 | 31篇 |
2004年 | 39篇 |
2003年 | 34篇 |
2002年 | 29篇 |
2001年 | 32篇 |
2000年 | 20篇 |
1999年 | 20篇 |
1998年 | 15篇 |
1997年 | 25篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有840条查询结果,搜索用时 78 毫秒
1.
We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices. 相似文献
2.
We consider some Sobolev-type spaces and obtain a necessary and sufficient condition for their embedding in a Lebesgue space. 相似文献
3.
《Chemphyschem》2006,7(5):1149-1150
4.
Nikolaos S. PAPAGEORGIOU Nikolaos YANNAKAKIS 《数学学报(英文版)》2005,21(5):977-996
This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x(t) and x(t). In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 (T, H). Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 (T, H) to the solutions of the original convex problem (strong relaxation). An example of a nonlinear hyperbolic optimal control problem is also discussed. 相似文献
5.
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure
of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered
under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some
of these along with some other recent advances on graph minors are surveyed.
Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number
16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists
Supported in part by the Research Grant P1–0297 and by the CRC program
On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia 相似文献
6.
7.
Howel Tong 《应用数学学报(英文版)》2002,18(2):177-184
Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series. 相似文献
8.
为实现书籍扫描图像的畸变自动校正,提出用多项式来描述各像素的理论灰度g(zi)与页面上对应点到扫描仪工作平面距离zi二者之间的关系。为确立该多项式,在畸变参数已知条件下扫描一幅图像,根据已知畸变参数求出zi,即可按最小二乘法原理由各像素灰度的实际值求出多项式的各个系数。实验证明,采用4阶多项式已能满足一般要求,并求出了各系数。对任意扫描图像,自动计算畸变参数的方法为:首先利用扫描图像上页边空白处各像素的灰度,对畸变参数进行估计,并求出zi的估计值;然后代入所确立的多项式,可求得g(zi);通过调整各畸变参数的估计值,直到g(zi)与gi最为接近,即得最佳畸变参数。用于图像校正实验,获得了较好的校正效果,最大误差由不校正时的41%下降到了6.9%。这使得无需用户测量并输入有关畸变参数即可进行自动校正。 相似文献
9.
Piotr W. Nowak 《Journal of Functional Analysis》2007,243(1):323-344
We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory. 相似文献
10.
Brenda J. Latka 《Journal of Graph Theory》2003,42(3):165-192
A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N5 on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N5 by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T1,…,Tk} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T1,…,Tk is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003 相似文献