全文获取类型
收费全文 | 316429篇 |
免费 | 3079篇 |
国内免费 | 1236篇 |
专业分类
化学 | 152633篇 |
晶体学 | 4393篇 |
力学 | 16383篇 |
综合类 | 2篇 |
数学 | 57933篇 |
物理学 | 89400篇 |
出版年
2020年 | 1765篇 |
2019年 | 2037篇 |
2018年 | 12535篇 |
2017年 | 12300篇 |
2016年 | 9696篇 |
2015年 | 3386篇 |
2014年 | 4151篇 |
2013年 | 11397篇 |
2012年 | 11633篇 |
2011年 | 19995篇 |
2010年 | 11922篇 |
2009年 | 12249篇 |
2008年 | 15256篇 |
2007年 | 17429篇 |
2006年 | 8542篇 |
2005年 | 9025篇 |
2004年 | 8412篇 |
2003年 | 8063篇 |
2002年 | 7079篇 |
2001年 | 7411篇 |
2000年 | 5601篇 |
1999年 | 4331篇 |
1998年 | 3702篇 |
1997年 | 3689篇 |
1996年 | 3470篇 |
1995年 | 3240篇 |
1994年 | 3017篇 |
1993年 | 3085篇 |
1992年 | 3348篇 |
1991年 | 3391篇 |
1990年 | 3192篇 |
1989年 | 3155篇 |
1988年 | 3219篇 |
1987年 | 3084篇 |
1986年 | 2981篇 |
1985年 | 4032篇 |
1984年 | 4184篇 |
1983年 | 3435篇 |
1982年 | 3789篇 |
1981年 | 3684篇 |
1980年 | 3562篇 |
1979年 | 3596篇 |
1978年 | 3810篇 |
1977年 | 3625篇 |
1976年 | 3831篇 |
1975年 | 3405篇 |
1974年 | 3529篇 |
1973年 | 3842篇 |
1972年 | 2345篇 |
1971年 | 1793篇 |
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
881.
In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome
the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given.
The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an
lattice valued intuitionistic fuzzy set for which these are families of level sets.
The research supported by Serbian Ministry of Science and Technology, Grant No. 1227. 相似文献
882.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
883.
A. V. Alatortsev R. N. Kuz'min O. G. Provorova N. P. Savenkova 《Computational Mathematics and Modeling》2004,15(4):350-364
We model the electrolysis of aluminum in specific electrolysis baths. A model of the physical process is proposed, allowing for the specific bath design, including the state of the bottom surface. The mathematical model utilizes the information capabilities of the Navier–Stokes equations written for the metal and the electrolyte media. The multidimensional system of equations enables us to consider the magnetohydrodynamic processes in two media and the interaction of the media. The problem is solved numerically. The calculations simulate the interface dynamics and the distribution of velocities and currents in the middle layer in both media. The numerical results are compared with physical experiments. 相似文献
884.
Preconditioners based on various multilevel extensions of two‐level finite element methods (FEM) lead to iterative methods which have an optimal order computational complexity with respect to the size of the system. Such methods were first presented in Axelsson and Padiy (SIAM. J. Sci. Stat. Comp. 1990; 20 :1807) and Axelsson and Vassilevski (Numer. Math. 1989; 56 :157), and are based on (recursive) two‐level splittings of the finite element space. The key role in the derivation of optimal convergence rate estimates is played by the constant γ in the so‐called Cauchy–Bunyakowski–Schwarz (CBS) inequality, associated with the angle between the two subspaces of the splitting. It turns out that only existence of uniform estimates for this constant is not enough but accurate quantitative bounds for γ have to be found as well. More precisely, the value of the upper bound for γ∈(0,1) is part of the construction of various multilevel extensions of the related two‐level methods. In this paper, an algebraic two‐level preconditioning algorithm for second‐order elliptic boundary value problems is constructed, where the discretization is done using Crouzeix–Raviart non‐conforming linear finite elements on triangles. An important point to make is that in this case the finite element spaces corresponding to two successive levels of mesh refinements are not nested. To handle this, a proper two‐level basis is considered, which enables us to fit the general framework for the construction of two‐level preconditioners for conforming finite elements and to generalize the method to the multilevel case. The major contribution of this paper is the derived estimates of the related constant γ in the strengthened CBS inequality. These estimates are uniform with respect to both coefficient and mesh anisotropy. To our knowledge, the results presented in the paper are the first such estimates for non‐conforming FEM systems. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
885.
In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions. 相似文献
886.
Rafał Bocian Thorsten Holm Andrzej Skowroński 《Central European Journal of Mathematics》2004,2(1):67-75
Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation
type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation
dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have
representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically
closed fields having simply connected Galois coverings. 相似文献
887.
888.
R.J Hand 《Journal of Non》2003,315(3):276-287
Glass may be strengthened by epoxy coatings although the strengthening mechanisms remain unclear. Possible strengthening mechanisms are reviewed and are used to analyse strength data for both a solvent based and a water based coating system. The coatings either fill (solvent based coatings), or partially fill (water based coatings) surface cracks and it is shown that closure stresses arising from the thermal expansion mismatch of the coating within these cracks can account for the observed degrees of strengthening. It is also demonstrated that other suggested mechanisms such as flaw healing cannot fully account for the observed degree of strengthening. 相似文献
889.
Let Um be an m×m Haar unitary matrix and U[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq. 相似文献
890.
§ 1 IntroductionLetRn×mdenotetherealn×mmatrixspace ,Rn×mr itssubsetwhoseelementshaverankr ,ORn×nthesetofalln×northogonalmatrices,SRn×n(SRn×n≥ ,SRn×n>)thesetofalln×nrealsymmetric (symmetricpositivesemidefinite ,positivedefinite)matrices.ThenotationA>0 (≥ 0 ,<0 ,≤ 0 )m… 相似文献