首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6947篇
  免费   586篇
  国内免费   629篇
化学   809篇
晶体学   15篇
力学   1259篇
综合类   105篇
数学   4538篇
物理学   1436篇
  2024年   15篇
  2023年   92篇
  2022年   171篇
  2021年   143篇
  2020年   225篇
  2019年   214篇
  2018年   189篇
  2017年   229篇
  2016年   226篇
  2015年   179篇
  2014年   282篇
  2013年   516篇
  2012年   330篇
  2011年   448篇
  2010年   370篇
  2009年   530篇
  2008年   484篇
  2007年   455篇
  2006年   407篇
  2005年   366篇
  2004年   279篇
  2003年   277篇
  2002年   237篇
  2001年   192篇
  2000年   201篇
  1999年   174篇
  1998年   192篇
  1997年   154篇
  1996年   112篇
  1995年   62篇
  1994年   58篇
  1993年   48篇
  1992年   55篇
  1991年   36篇
  1990年   26篇
  1989年   22篇
  1988年   24篇
  1987年   19篇
  1986年   18篇
  1985年   13篇
  1984年   19篇
  1983年   7篇
  1982年   10篇
  1981年   12篇
  1980年   9篇
  1979年   9篇
  1978年   10篇
  1975年   2篇
  1974年   3篇
  1972年   3篇
排序方式: 共有8162条查询结果,搜索用时 15 毫秒
11.
Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP(ξ^κ)] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given.  相似文献   
12.
For 1 ≤ dk, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which ij if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005  相似文献   
13.
考虑一个奇异摄动罗宾问题在Bakhvalov-Shishkin网格上的迎风差分策略,得到在改进的Shishkin网格上迎风策略是关于ε一致的一阶L∞模收敛的.数值实验证实了此理论结果,显示估计是稳健的.  相似文献   
14.
A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
15.
This paper presents an evaluation of the capability of turbulence models available in the commercial CFD code FLUENT 6.0 for their application to hydrofoil turbulent boundary layer separation flow at high Reynolds numbers. Four widely applied two‐equation RANS turbulence models were assessed through comparison with experimental data at Reynolds numbers of 8.284×106 and 1.657×107. They were the standard k–εmodel, the realizable k–εmodel, the standard k–ωmodel and the shear‐stress‐transport (SST) k–ωmodel. It has found that the realizable k–εturbulence model used with enhanced wall functions and near‐wall modelling techniques, consistently provides superior performance in predicting the flow characteristics around the hydrofoil. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
16.
A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd.  相似文献   
17.
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].  相似文献   
18.
复数域上线性系统x=A(t)x,当A(t)=(aij(t))n×n具有(n,N,r) 差异性质且rn时,解的特征数j有估计λj-limt→∞1t∫tt0Reaj(τ)dτn-1r+1-nlimt→∞1t∫tt0A(τ)dτ,j=1,2,…,n,其中A(t)=max{|aij(t)|:i,j=1,2,…,n,i≠j.}  相似文献   
19.
The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.  相似文献   
20.
The analysis of mechanical structures using the Finite Element Method in the framework of large elastoplastic strain, needs frequent remeshing of the deformed domain during computation. Indeed, the remeshing is due to the large geometrical distortion of finite elements and the adaptation to the physical behavior of the solution. This paper gives the necessary steps to remesh a mechanical structure during large elastoplastic deformations with damage. An important part of this process is constituted by geometrical and physical error estimates. The proposed method is integrated in a computational environment using the ABAQUS/Explicit solver and the BL2D-V2 adaptive mesher. To cite this article: H. Borouchaki et al., C. R. Mecanique 330 (2002) 709–716.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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