全文获取类型
收费全文 | 10386篇 |
免费 | 919篇 |
国内免费 | 759篇 |
专业分类
化学 | 716篇 |
晶体学 | 13篇 |
力学 | 1022篇 |
综合类 | 191篇 |
数学 | 8451篇 |
物理学 | 1671篇 |
出版年
2024年 | 11篇 |
2023年 | 103篇 |
2022年 | 146篇 |
2021年 | 167篇 |
2020年 | 249篇 |
2019年 | 251篇 |
2018年 | 263篇 |
2017年 | 285篇 |
2016年 | 308篇 |
2015年 | 224篇 |
2014年 | 459篇 |
2013年 | 1025篇 |
2012年 | 465篇 |
2011年 | 575篇 |
2010年 | 502篇 |
2009年 | 662篇 |
2008年 | 656篇 |
2007年 | 671篇 |
2006年 | 598篇 |
2005年 | 520篇 |
2004年 | 450篇 |
2003年 | 485篇 |
2002年 | 403篇 |
2001年 | 365篇 |
2000年 | 341篇 |
1999年 | 324篇 |
1998年 | 300篇 |
1997年 | 235篇 |
1996年 | 187篇 |
1995年 | 124篇 |
1994年 | 116篇 |
1993年 | 84篇 |
1992年 | 83篇 |
1991年 | 72篇 |
1990年 | 41篇 |
1989年 | 26篇 |
1988年 | 23篇 |
1987年 | 27篇 |
1986年 | 17篇 |
1985年 | 41篇 |
1984年 | 38篇 |
1983年 | 22篇 |
1982年 | 30篇 |
1981年 | 29篇 |
1980年 | 19篇 |
1979年 | 8篇 |
1978年 | 11篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 421 毫秒
61.
A. S. Kholodov Ya. A. Kholodov 《Computational Mathematics and Mathematical Physics》2006,46(9):1560-1588
Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations. 相似文献
62.
Alex Hellsten 《Archive for Mathematical Logic》2006,45(6):705-714
We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal. 相似文献
63.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
64.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献
65.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
66.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献
67.
本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性. 相似文献
68.
Masanobu Haraguchi David F. P. Pile Toshihiro Okamoto Masuo Fukui Dmitri K. Gramotnev 《Optical Review》2006,13(4):228-230
We have numerically shown the existence of coupled wedge plasmons (CWPs) which propagates along a nano gap of a twin metal
wedge. The CWPs are formed by wedge plasmons which can interact with each other. The dispersion relations of the wavenumber,
propagation distance, and beam area of CWPs, are described and show that the characteristics of CWPs are similar to those
of wedge plasmons and of gap plasmons. We also propose a new plasmon waveguide composed of twin metal wedges with a nano gap. 相似文献
69.
对覆盖广义Rough集中的隶属关系、隶属函数进行了定义,并利用隶属函数定义了集合的Rough包含与Rough相等,得到一些与Pawlak的Rough集不同的性质。 相似文献
70.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献