全文获取类型
收费全文 | 27776篇 |
免费 | 3798篇 |
国内免费 | 3101篇 |
专业分类
化学 | 9400篇 |
晶体学 | 211篇 |
力学 | 2158篇 |
综合类 | 527篇 |
数学 | 9593篇 |
物理学 | 12786篇 |
出版年
2024年 | 50篇 |
2023年 | 257篇 |
2022年 | 523篇 |
2021年 | 640篇 |
2020年 | 752篇 |
2019年 | 668篇 |
2018年 | 617篇 |
2017年 | 730篇 |
2016年 | 837篇 |
2015年 | 801篇 |
2014年 | 1222篇 |
2013年 | 2075篇 |
2012年 | 1342篇 |
2011年 | 1738篇 |
2010年 | 1604篇 |
2009年 | 1938篇 |
2008年 | 1986篇 |
2007年 | 2026篇 |
2006年 | 1810篇 |
2005年 | 1550篇 |
2004年 | 1311篇 |
2003年 | 1311篇 |
2002年 | 1153篇 |
2001年 | 1018篇 |
2000年 | 917篇 |
1999年 | 858篇 |
1998年 | 699篇 |
1997年 | 628篇 |
1996年 | 512篇 |
1995年 | 412篇 |
1994年 | 382篇 |
1993年 | 301篇 |
1992年 | 299篇 |
1991年 | 242篇 |
1990年 | 156篇 |
1989年 | 164篇 |
1988年 | 126篇 |
1987年 | 124篇 |
1986年 | 75篇 |
1985年 | 138篇 |
1984年 | 97篇 |
1983年 | 61篇 |
1982年 | 107篇 |
1981年 | 70篇 |
1980年 | 58篇 |
1979年 | 81篇 |
1978年 | 40篇 |
1977年 | 44篇 |
1976年 | 31篇 |
1973年 | 37篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
131.
Wen-junSun 《应用数学学报(英文版)》2003,19(1):143-156
This paper deals with the existence and nonexistence of global positive solution to a semilinear reaction-diffusion system with nonlinear boundary conditions.For the heat diffusion case,the necessary and sufficient conditions on the global existence of all positive solutions are obtained.For the general fast diffusion case,we get some conditions on the global existence and nonexistence of positive solutions.The results of this paper fill the some gaps which were left in this field. 相似文献
132.
Zheng-qiu Zhang Xian-wu Zeng Zhi-cheng WangCollege of Mathematics Wuhan University Wuhan . China College of Mathematics. Hunan University Changsha China 《应用数学学报(英文版)》2003,19(4):691-702
Abstract By using the continuation theorem of coincidence degree theory,the existence of a positive periodicsolution for a nonautonomous diffusive food chain system of three species. dx_1(t)/dt=x_1(t)[r_1(t)-a_(11)(t)x_1(t)-a_(12)(t)x_2(t)]+D_1(t)[y(t)-x_1(t)], dx_2(t)/dt=x_2(t)[-r_2(t)+a_(21)(t)x_1(t-r_1)-a_(22)(t)x_2(t)-a_(23)(t)x_3(t)], dx_3(t)/dt=x_3(t)[-r_3(t)+a_(32)(t)x_2(t-r_2)-a_(33)(t)x_3(t)], dy(t)/dt=y(t)[r_4(t)-a_(44)(t)y(t)]+D_2(t)[x_1(t)-y(t)]+D_2(t)[x_1(t)-y(t)],is established,where,r_i(t),a_(ii)(t)(i=1,2,3,4),D_i(t)(i=1,2),a_(12)(t),a_(21)(t),a_(23)(t)and a_(32)(t) are all positiveperiodic continuous functions with period w>0,T_i(i=1,2)are positive constants. 相似文献
133.
We develop a notion of an n-fold monoidal category and show that it corresponds in a precise way to the notion of an n-fold loop space. Specifically, the group completion of the nerve of such a category is an n-fold loop space, and free n-fold monoidal categories give rise to a finite simplicial operad of the same homotopy type as the classical little cubes operad used to parametrize the higher H-space structure of an n-fold loop space. We also show directly that this operad has the same homotopy type as the n-th Smith filtration of the Barratt-Eccles operad and the n-th filtration of Berger's complete graph operad. Moreover, this operad contains an equivalent preoperad which gives rise to Milgram's small model for when n=2 and is very closely related to Milgram's model of for n>2. 相似文献
134.
Guoen Hu 《Journal of Mathematical Analysis and Applications》2003,283(2):351-361
boundedness is considered for the commutator of higher-dimensional Marcinkiewicz integral. Some conditions implying the and the boundedness for the commutator of the Marcinkiewicz integral are obtained. 相似文献
135.
John Michael Rassias Matina John Rassias 《Journal of Mathematical Analysis and Applications》2003,281(2):516-524
In 1941 Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 Bourgin was the second author to treat this problem for additive mappings. In 1982-1998 Rassias established the Hyers-Ulam stability of linear and nonlinear mappings. In 1983 Skof was the first author to solve the same problem on a restricted domain. In 1998 Jung investigated the Hyers-Ulam stability of more general mappings on restricted domains. In this paper we introduce additive mappings of two forms: of “Jensen” and “Jensen type,” and achieve the Ulam stability of these mappings on restricted domains. Finally, we apply our results to the asymptotic behavior of the functional equations of these types. 相似文献
136.
Monika Budzynska 《Proceedings of the American Mathematical Society》2003,131(9):2771-2777
If is the open unit ball in the Cartesian product furnished with the -norm , where and , then a holomorphic self-mapping of has a fixed point if and only if for some
137.
In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003 相似文献
138.
Hiroshi Sato 《Journal of Theoretical Probability》1992,5(2):349-353
The aim of this paper is to characterize the nuclearity of an integral operator, defined by a continuous non-negative definite square integrable kernel on a separable metric space, in terms of the integrability of the trace of the kernel function. Nuclearity here plays a role forU-statistics. 相似文献
139.
Summary A tool for analyzing spatio-temporal complex physical phenomena was recently proposed by the authors, Aubry et al. [5]. This
tool consists in decomposing a spatially and temporally evolving signal into orthogonal temporal modes (temporal “structures”)
and orthogonal spatial modes (spatial “structures”) which are coupled. This allows the introduction of a temporal configuration
space and a spatial one which are related to each other by an isomorphism. In this paper, we show how such a tool can be used
to analyze space-time bifurcations, that is, qualitative changes in both space and time as a parameter varies. The Hopf bifurcation
and various spatio-temporal symmetry related bifurcations, such as bifurcations to traveling waves, are studied in detail.
In particular, it is shown that symmetry-breaking bifurcations can be detected by analyzing the temporal and spatial eigenspaces
of the decomposition which then lose their degeneracy, namely their invariance under the symmetry. Furthermore, we show how
an extension of the theory to “quasi-symmetries” permits the treatment of nondegenerate signals and leads to an exponentially
decreasing law of the energy spectrum. Examples extracted from numerically obtained solutions of the Kuramoto-Sivashinsky
equation, a coupled map lattice, and fully developed turbulence are given to illustrate the theory. 相似文献
140.
Unconstrained and constrained global optimization of polynomial functions in one variable 总被引:1,自引:0,他引:1
In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated. 相似文献