全文获取类型
收费全文 | 24350篇 |
免费 | 1713篇 |
国内免费 | 1101篇 |
专业分类
化学 | 1694篇 |
晶体学 | 38篇 |
力学 | 2551篇 |
综合类 | 300篇 |
数学 | 19675篇 |
物理学 | 2906篇 |
出版年
2024年 | 52篇 |
2023年 | 251篇 |
2022年 | 526篇 |
2021年 | 541篇 |
2020年 | 528篇 |
2019年 | 550篇 |
2018年 | 623篇 |
2017年 | 706篇 |
2016年 | 675篇 |
2015年 | 520篇 |
2014年 | 1066篇 |
2013年 | 1722篇 |
2012年 | 1257篇 |
2011年 | 1250篇 |
2010年 | 1142篇 |
2009年 | 1507篇 |
2008年 | 1565篇 |
2007年 | 1632篇 |
2006年 | 1374篇 |
2005年 | 1135篇 |
2004年 | 933篇 |
2003年 | 985篇 |
2002年 | 855篇 |
2001年 | 695篇 |
2000年 | 691篇 |
1999年 | 575篇 |
1998年 | 571篇 |
1997年 | 518篇 |
1996年 | 382篇 |
1995年 | 357篇 |
1994年 | 266篇 |
1993年 | 230篇 |
1992年 | 220篇 |
1991年 | 184篇 |
1990年 | 151篇 |
1989年 | 100篇 |
1988年 | 90篇 |
1987年 | 81篇 |
1986年 | 80篇 |
1985年 | 106篇 |
1984年 | 102篇 |
1983年 | 41篇 |
1982年 | 51篇 |
1981年 | 51篇 |
1980年 | 37篇 |
1979年 | 50篇 |
1978年 | 34篇 |
1977年 | 44篇 |
1976年 | 28篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Albo Carlos Cavalheiro 《Applications of Mathematics》2006,51(6):619-628
In the paper we study the equation L
u
= f, where L is a degenerate elliptic operator, with Neumann boundary condition in a bounded open set μ. We prove existence and uniqueness
of solutions in the space H(μ) for the Neumann problem. 相似文献
22.
23.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
24.
本文定义了二阶微分方程的弱 Carathéodory解 ,在不涉及紧型条件的情形下 ,直接用迭代法证明了 Banach空间二阶非线性常微分方程两点边值问题存在唯一解 ,并给出逼近解迭代序列的误差估计 ,对周期边值问题得到类似的结果 相似文献
25.
This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined. 相似文献
26.
Volker Elling. 《Mathematics of Computation》2006,75(256):1721-1733
A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.
27.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
28.
Maria Kordaki Athanasia Balomenou 《International Journal of Computers for Mathematical Learning》2006,11(1):99-135
This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment. 相似文献
29.
In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system
of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem
in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these
algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid
are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset
of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven. 相似文献
30.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献