首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10163篇
  免费   1098篇
  国内免费   717篇
化学   256篇
晶体学   40篇
力学   4037篇
综合类   132篇
数学   5818篇
物理学   1695篇
  2024年   5篇
  2023年   107篇
  2022年   110篇
  2021年   178篇
  2020年   286篇
  2019年   250篇
  2018年   280篇
  2017年   322篇
  2016年   356篇
  2015年   239篇
  2014年   415篇
  2013年   827篇
  2012年   468篇
  2011年   538篇
  2010年   480篇
  2009年   549篇
  2008年   512篇
  2007年   565篇
  2006年   559篇
  2005年   571篇
  2004年   489篇
  2003年   474篇
  2002年   440篇
  2001年   405篇
  2000年   380篇
  1999年   364篇
  1998年   342篇
  1997年   275篇
  1996年   220篇
  1995年   164篇
  1994年   136篇
  1993年   94篇
  1992年   114篇
  1991年   98篇
  1990年   75篇
  1989年   44篇
  1988年   30篇
  1987年   33篇
  1986年   30篇
  1985年   39篇
  1984年   29篇
  1983年   26篇
  1982年   14篇
  1981年   9篇
  1980年   7篇
  1979年   6篇
  1978年   3篇
  1977年   6篇
  1973年   4篇
  1957年   3篇
排序方式: 共有10000条查询结果,搜索用时 343 毫秒
41.
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.  相似文献   
42.
Montgomery Multiplication in GF(2k)   总被引:8,自引:0,他引:8  
We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.  相似文献   
43.
In this paper, we provide numerical means to compute the quasi-stationary (QS) distributions inM/GI/1/K queues with state-dependent arrivals andGI/M/1/K queues with state-dependent services. These queues are described as finite quasi-birth-death processes by approximating the general distributions in terms of phase-type distributions. Then, we reduce the problem of obtaining the QS distribution to determining the Perron-Frobenius eigenvalue of some Hessenberg matrix. Based on these arguments, we develop a numerical algorithm to compute the QS distributions. The doubly-limiting conditional distribution is also obtained by following this approach. Since the results obtained are free of phase-type representations, they are applicable for general distributions. Finally, numerical examples are given to demonstrate the power of our method.  相似文献   
44.
Let G be a graph with a nonempty edge set, and with rank rk(G), term rank Rk(G), and chromatic number χ(G). We characterize Rk(G) as being the maximum number of colors in certain proper colorings of G. In particular, we observe that χ(G)Rk(G), with equality holding if and only if (besides isolated vertices) G is either complete or a star. For a twin-free graph G, we observe the bound and we show that this bound is sharp.  相似文献   
45.
The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper.  相似文献   
46.
李锐 《数学季刊》2006,21(2):236-241
The aim of this paper is to present construction of finite element multiscaling function with three coefficients. In order to illuminate the result, two examples are given finally.  相似文献   
47.
介绍浅水中污染物扩散分析中的有限元法.分析包括两个部分:1)流场速度、水面高度的计算;2)根据扩散模型计算污染物浓度场.联合使用了自适应网格技术以期提高解的精度,同时减少计算时间和计算机内存的消耗.通过几个有已知解的实例验证了有限元公式和计算机程序.最后,使用这种联合方法分析泰国Chao Phraya河附近海湾中的污染物扩散.  相似文献   
48.
Modal solutions of planar photonic crystal waveguides with rectangular air-holes are presented by using a rigorous full-vectorial finite element-based approach. The effective indices, mode field profiles, spot-sizes, power confinements, modal hybridness, beat lengths and group velocity dispersions are shown for the fundamental and higher order modes of the quasi-TE and TM polarizations.  相似文献   
49.
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p m) (any positive integer m) with the period 3n (n and p m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p m) with the period 3n (n and p m − 1 are coprime) more efficiently.  相似文献   
50.
This article deals with an expanded mixed finite element formulation, based on the Hu‐Washizu principle, for a nonlinear incompressible material in the plane. We follow our related previous works and introduce both the stress and the strain tensors as further unknowns, which yields a two‐fold saddle point operator equation as the corresponding variational formulation. A slight generalization of the classical Babu?ka‐Brezzi's theory is applied to prove unique solvability of the continuous and discrete formulations, and to derive the corresponding a priori error analysis. An extension of the well‐known PEERS space is used to define an stable associated Galerkin scheme. Finally, we provide an a posteriori error analysis based on the classical Bank‐Weiser approach. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 105–128, 2002  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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