全文获取类型
收费全文 | 10983篇 |
免费 | 1416篇 |
国内免费 | 593篇 |
学科分类
数理化 | 12992篇 |
出版年
2024年 | 13篇 |
2023年 | 133篇 |
2022年 | 257篇 |
2021年 | 376篇 |
2020年 | 479篇 |
2019年 | 340篇 |
2018年 | 323篇 |
2017年 | 449篇 |
2016年 | 538篇 |
2015年 | 424篇 |
2014年 | 579篇 |
2013年 | 710篇 |
2012年 | 651篇 |
2011年 | 588篇 |
2010年 | 491篇 |
2009年 | 625篇 |
2008年 | 618篇 |
2007年 | 595篇 |
2006年 | 598篇 |
2005年 | 516篇 |
2004年 | 442篇 |
2003年 | 406篇 |
2002年 | 356篇 |
2001年 | 302篇 |
2000年 | 306篇 |
1999年 | 249篇 |
1998年 | 231篇 |
1997年 | 179篇 |
1996年 | 145篇 |
1995年 | 171篇 |
1994年 | 113篇 |
1993年 | 99篇 |
1992年 | 88篇 |
1991年 | 71篇 |
1990年 | 57篇 |
1989年 | 49篇 |
1988年 | 49篇 |
1987年 | 39篇 |
1986年 | 38篇 |
1985年 | 52篇 |
1984年 | 39篇 |
1983年 | 20篇 |
1982年 | 35篇 |
1981年 | 14篇 |
1980年 | 36篇 |
1979年 | 32篇 |
1978年 | 13篇 |
1977年 | 24篇 |
1976年 | 20篇 |
1975年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
This article studies the inshore-offshore fishery model with impulsive diffusion. The existence and global asymptotic stability of both the trivial periodic solution and the positive periodic solution are obtained. The complexity of this system is also analyzed. Moreover, the optimal harvesting policy are given for the inshore subpopulation, which includes the maximum sustainable yield and the corresponding harvesting effort. 相似文献
72.
73.
Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp. 相似文献
74.
We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel. 相似文献
75.
In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc. 相似文献
76.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献
77.
Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation 总被引:2,自引:0,他引:2
Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points. 相似文献
78.
David M. Evans 《组合设计杂志》2004,12(6):459-465
For all ‘reasonable’ finite t, k, and s, we construct a t‐(?0, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2‐(?0, 4, 1) design with a block‐transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a by‐product of a new way of looking at a model‐theoretic construction of E. Hrushovski. © 2004 Wiley Periodicals, Inc. 相似文献
79.
Marianne Gerny Burkhard Alpers 《International Journal of Computers for Mathematical Learning》2004,9(1):25-57
In this article we describe a mathematical microworld for investigating car motion on a racing course and its use with a group of grade 12 students. The microworld is concerned with the mathematical construction of courses and functions which describe car motion. It is implemented in the computer algebra system, Maple®, which provides the means to represent courses and functions symbolically and graphically. We describe the learning opportunities offered by the microworld in relation to the research literature on functions. Various facets and layers of the function concept are addressed in the microworld, and we suggest how work in the microworld might help in overcoming some well-known misconceptions.This revised version was published online in September 2005 with corrections to the Cover Date. 相似文献
80.
加速牛顿迭代收敛的新方法 总被引:2,自引:0,他引:2
提出了加速牛顿迭代收敛的新思想,构造出一类加权牛顿迭代格式,通过选取最优加权因子,使得该格式具有高阶收敛性和较小的渐近误差常数。 相似文献