首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   226076篇
  免费   3961篇
  国内免费   1634篇
化学   120373篇
晶体学   3324篇
力学   10586篇
综合类   50篇
数学   22666篇
物理学   74672篇
  2022年   1529篇
  2021年   1684篇
  2020年   1845篇
  2019年   1801篇
  2018年   1905篇
  2017年   1830篇
  2016年   3469篇
  2015年   2847篇
  2014年   3746篇
  2013年   10349篇
  2012年   8802篇
  2011年   10885篇
  2010年   7020篇
  2009年   7150篇
  2008年   9923篇
  2007年   9677篇
  2006年   9247篇
  2005年   8441篇
  2004年   7590篇
  2003年   6579篇
  2002年   6359篇
  2001年   8468篇
  2000年   6352篇
  1999年   4851篇
  1998年   3633篇
  1997年   3578篇
  1996年   3410篇
  1995年   3010篇
  1994年   2828篇
  1993年   2613篇
  1992年   3212篇
  1991年   3159篇
  1990年   2790篇
  1989年   2679篇
  1988年   2683篇
  1987年   2679篇
  1986年   2469篇
  1985年   3567篇
  1984年   3476篇
  1983年   2711篇
  1982年   2867篇
  1981年   2742篇
  1980年   2636篇
  1979年   2710篇
  1978年   2820篇
  1977年   2797篇
  1976年   2637篇
  1975年   2541篇
  1974年   2463篇
  1973年   2499篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
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.  相似文献   
72.
73.
A finite element solution of the Navier-Stokes equations for steady flow under the magnetic effect through a double-branched two-dimensional section of a three-dimensional model of the canine aorta is discussed. The numerical scheme involves transforming the physical co-ordinates to a curvilinear boundary-fitted co-ordinate system. The shear stress at the wall is calculated for a Reynolds number of 1000 with the branch-to-main aortic flow rate ratio as a parameter. The results are compared with earlier works involving experimental data and found to be in reasonable qualitative agreement. The steady flow, shear stress and branch flow under the effect of a magnetic field have been discussed in detail.  相似文献   
74.
75.
We consider the method of Poincaré to investigate thelocal index of vector fields in the plane. If m is the degreeof the first non-zero jet, Xm, of the vector field X at an isolatedzero, we explore the geometry of the pencil generated by thecoordinate functions of Xm when the absolute value of the indexof X, |ind (X)|, is m. We also find necessary and sufficientconditions for |ind (X)| to be m.  相似文献   
76.
A.C.C. Coolen  D. Sherrington 《Physica A》1993,200(1-4):602-607
We present results for the determination of the equilibrium microstate probability distribution of a class of strongly interacting systems obeying stochastic dynamics but without the necessity of detailed balance. The specific case of Ising systems is highlighted, with applications to non-symmetric synaptic neural networks and more general recurrent Boolean networks.  相似文献   
77.
Sr incorporation in the molecules of amorphous calcium phosphate, apatitic tricalcium phosphate, hydroxyapatite, octacalcium phosphate and dicalcium phosphate dihydrate was investigated. The concentration of Sr ranged from 225 to 1010 μ g / g, i.e. it overlapped with the physiological range of Sr concentrations in human bone. The leading experimental technique was extended X-ray absorption fine structure (EXAFS) at the Sr K edge. Results of these studies demonstrated the following: (1) Sr incorporation in the calcium phosphates is compound-dependent, (2) the coordination of incorporated Sr atoms in the Ca-P molecules is similar to that of Ca atoms, but interatomic distances are ≈0.015 nm larger, (3) in apatitic tricalcium phosphate, hydroxyapatite and octacalcium phosphate lattices Sr atoms may occupy selected Ca sites, which was not the case for dicalcium phosphate dihydrate, (4) in the apatite lattice Sr atoms are coordinated by 6 PO4 tetrahedrals and (5) EXAFS spectra at the K edge of the incorporated Sr may be used to distinguish the structures of amorphous calcium phosphate, dicalcium phosphate dihydrate as well as apatite and its derivatives (apatitic tricalcium phosphate, octacalcium phosphate).  相似文献   
78.
The authors study concentration profiles of solutes undergoingequilibrium absorption in the vicinity of a water well. Forthe case of a contamination event, the limit problem of vanishingwell radius, which is of self-similar nature, is analysed indetail. Existence, uniqueness, and qualitative properties ofsolutions of the corresponding ordinary differential equationsare shown. Some numerical examples are also presented.  相似文献   
79.
Experiments for the determination of mono-, di and tri-butyltin (MBT, DBT and TBT) by hydride generation/gas chromatography/atomic absorption spectrometry in various matrices (sediment, suspended matter, mussel, algae and water) have revealed that poor butyltin recoveries are obtained in sediments displaying high sulphur and hydrocarbon contents; very poor recoveries were also observed for TBT in sediments with high chlorophyll pigment contents as well as in algal samples. It was however not clear whether the hydride generatin was inhibited by these infering compounds, as was previously assumed in the case of hydrocarbons, or whether interferences affected the atomization rate. Further studies were performed to solve this problem in order to validate this method in the case of analyses of, for example, oil-contaminated sediment and algae. This paper presents the results obtained. It is concluded here that the poor recoveries were due to an inhibition of hydride generation rather than to interference at the atomization stage.  相似文献   
80.
We investigate the dynamics and methods of computation for some nonlinear finite difference systems that are the discretized equations of a time-dependent and a steady-state reaction–diffusion problem. The formulation of the discrete equations for the time-dependent problem is based on the implicit method for parabolic equations, and the computational algorithm is based on the method of monotone iterations using upper and lower solutions as the initial iterations. The monotone iterative method yields improved upper and lower bounds of the solution in each iteration, and the sequence of iterations converges monotonically to a solution for both the time-dependent and the steady-state problems. An important consequence of this method is that it leads to a bifurcation point that determines the dynamic behavior of the time-dependent problem in relation to the corresponding steady-state problem. This bifurcation point also determines whether the steady-state problem has one or two non-negative solutions, and is explicitly given in terms of the physical parameters of the system and the type of boundary conditions. Numerical results are presented for both the time-dependent and the steady-state problems under various boundary conditions, including a test problem with known analytical solution. These numerical results exhibit the predicted dynamic behavior of the time-dependent solution given by the theoretical analysis. Also discussed are the numerical stability of the computational algorithm and the convergence of the finite difference solution to the corresponding continuous solution of the reaction–diffusion problem. © 1993 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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