首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   652756篇
  免费   6230篇
  国内免费   2123篇
化学   334609篇
晶体学   9254篇
力学   31347篇
综合类   19篇
数学   98787篇
物理学   187093篇
  2021年   4862篇
  2020年   5434篇
  2019年   5961篇
  2018年   17422篇
  2017年   17106篇
  2016年   17009篇
  2015年   7840篇
  2014年   11202篇
  2013年   26692篇
  2012年   23382篇
  2011年   34067篇
  2010年   22572篇
  2009年   22681篇
  2008年   28767篇
  2007年   30632篇
  2006年   21394篇
  2005年   20254篇
  2004年   18871篇
  2003年   17355篇
  2002年   16296篇
  2001年   17163篇
  2000年   13290篇
  1999年   10282篇
  1998年   8698篇
  1997年   8453篇
  1996年   8185篇
  1995年   7128篇
  1994年   7080篇
  1993年   6972篇
  1992年   7628篇
  1991年   7788篇
  1990年   7404篇
  1989年   7228篇
  1988年   7249篇
  1987年   7097篇
  1986年   6748篇
  1985年   8766篇
  1984年   9034篇
  1983年   7179篇
  1982年   7469篇
  1981年   7345篇
  1980年   6857篇
  1979年   7383篇
  1978年   7665篇
  1977年   7506篇
  1976年   7454篇
  1975年   6944篇
  1974年   6918篇
  1973年   7034篇
  1972年   4889篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
For any two points p and q in the Euclidean plane, define LUNpq = { v | vR2, dpv < dpq and dqv < dpq}, where duv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUNpq(V) = V ∩ LUNpq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,qV, (p,q) is an edge of RNG(V) if and only if LUNpq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,qV, (p,q) is an edge of kRNG(V) if and only if | LUNpq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn2) time. Let Ec = {epq| pV and qV}. Then Gc = (V,Ec) is a complete graph. For any subset F of Ec, define the maximum distance of F as maxepqFdpq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph Gc whose maximum distance is the minimum among all Hamiltonian cycles in graph Gc. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.  相似文献   
992.
A time-dependent model corresponding to an Oldroyd-B viscoelastic fluid is considered, the convective terms being disregarded. Global existence in time is proved in Banach spaces provided the data are small enough, using the implicit function theorem and a maximum regularity property for a three fields Stokes problem. A finite element discretization in space is then proposed. Existence of the numerical solution is proved for small data, so as a priori error estimates, using again an implicit function theorem. Supported by the Swiss National Science Foundation. Fellowship PBEL2–114311.  相似文献   
993.
This article describes a professional development course intended to improve the content understanding of middle school mathematics teachers. The design of the course included three professional learning strategies: problem solving, examination of student thinking, and discussion of research. The concepts studied in the course included multi‐digit subtraction, multi‐digit multiplication, operations with fractions, and concepts of area and perimeter. Results from pre‐ and post‐tests administered to the nineteen participants indicate a significant increase in the mean score for each concept and document growth in the teachers' content understanding. In particular, their solutions moved from primarily procedural to more conceptual. Responses to an open‐ended survey indicate other important aspects of the professional development. Examples of teachers' work and comments are included.  相似文献   
994.
We carry out a detailed analysis of the existence, asymptotics, and stability problems for periodic solutions that bifurcate from the zero equilibrium state in systems with large delay. The account is based on a specific meaningful example given by a certain scalar nonlinear second-order differential-difference equation that is a mathematical model of a single-circuit RCL oscillator with delay in a feedback loop.  相似文献   
995.
We prove the existence of separating points for every countable family of nonatomic σ-additive modular measures on a σ-complete lattice ordered effect algebra.   相似文献   
996.
This paper deals with the study of the MHD flow of non-Newtonian fluid on a porous plate. Two exact solutions for non-torsionally generated unsteady hydromagnetic flow of an electrically conducting second order incompressible fluid bounded by an infinite non-conducting porous plate subjected to a uniform suction or blowing have been analyzed. The governing partial differential equation for the flow has been established. The mathematical analysis is presented for the hydromagnetic boundary layer flow neglecting the induced magnetic field. The effect of presence of the material constants of the second order fluid on the velocity field is discussed.  相似文献   
997.
A predictor–corrector (P-C) scheme is applied successfully to a nonlinear method arising from the use of rational approximants to the matrix-exponential term in a three-time level recurrence relation. The resulting nonlinear finite-difference scheme, which is analyzed for local truncation error and stability, is solved using a P-C scheme, in which the predictor and the corrector are explicit schemes of order 2. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. The behaviour of the P-C/MPC schemes is tested numerically on the Boussinesq equation already known from the bibliography free of boundary conditions. The numerical results are derived for both the bad and the good Boussinesq equation and conclusions from the relevant known results are derived.   相似文献   
998.
999.
A base of the universal multiplicative envelope of the free Malcev superalgebra ℳ on one odd generator is constructed. Some corollaries for skew-symmetric functions and central elements in free Malcev and free alternative algebras are obtained. Moreover, a base of the Poisson-Malcev superalgebra of ℳ is constructed. As a corollary, a set of elements that spans the free alternative superalgebra on one odd generator is obtained. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 4, pp. 97–106, 2004.  相似文献   
1000.
In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号