首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   732篇
  免费   45篇
  国内免费   22篇
化学   52篇
力学   230篇
综合类   1篇
数学   364篇
物理学   152篇
  2023年   2篇
  2022年   8篇
  2021年   6篇
  2020年   10篇
  2019年   11篇
  2018年   10篇
  2017年   19篇
  2016年   18篇
  2015年   25篇
  2014年   37篇
  2013年   70篇
  2012年   45篇
  2011年   53篇
  2010年   48篇
  2009年   46篇
  2008年   45篇
  2007年   36篇
  2006年   45篇
  2005年   30篇
  2004年   31篇
  2003年   20篇
  2002年   29篇
  2001年   22篇
  2000年   17篇
  1999年   19篇
  1998年   23篇
  1997年   7篇
  1996年   12篇
  1995年   12篇
  1994年   9篇
  1993年   3篇
  1992年   6篇
  1991年   1篇
  1990年   3篇
  1989年   4篇
  1988年   2篇
  1987年   1篇
  1985年   4篇
  1984年   1篇
  1983年   3篇
  1982年   2篇
  1981年   1篇
  1980年   1篇
  1979年   1篇
  1977年   1篇
排序方式: 共有799条查询结果,搜索用时 15 毫秒
111.
112.
We prove a common fixed point theorem for discontinuous,noncompatible mappings on noncomplete intuitionistic fuzzy metric spaces by using a new commutativity condition.We validate our main result by an example.  相似文献   
113.
利用完备分配格L上的s-模定义格L上的矩阵运算,给出这些运算的一些基本性质,并且定义格L上的s-幂零矩阵,给出一些全新的结果.  相似文献   
114.
Assume that G=(V,E) is an undirected graph, and CV. For every vV, we denote by I(v) the set of all elements of C that are within distance one from v. If all the sets I(v) for vV?C are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be .  相似文献   
115.
For a positive integer k, a k-packing in a graph G is a subset A of vertices such that the distance between any two distinct vertices from A is more than k. The packing chromatic number of G is the smallest integer m such that the vertex set of G can be partitioned as V1,V2,…,Vm where Vi is an i-packing for each i. It is proved that the planar triangular lattice T and the three-dimensional integer lattice Z3 do not have finite packing chromatic numbers.  相似文献   
116.
This note shows that solving fully fuzzy linear programming (FFLP) model presented by Kumar et al. [A. Kumar, J. Kaur, P. Singh, A new method for solving fully fuzzy linear programming problems, Appl. Math. Model. 35 (2011) 817–823] needs some corrections to make the model well in general. A new version is provided in this note. A simple example is also presented to demonstrate the new form.  相似文献   
117.
Let Tn (F) be the algebra of all n×n upper triangular matrices over an arbitrary field F. We first characterize those rank-one nonincreasing mappings ψ: Tn (F)→Tm (F)n?m such that ψ(In ) is of rank n. We next deduce from this result certain types of singular rank-one r-potent preservers and nonzero r-potent preservers on Tn (F). Characterizations of certain classes of homomorphisms and semi-homomorphisms on Tn (F) are also given.  相似文献   
118.
119.
120.
Curved geometries and the corresponding near-surface fields typically require a large number of linear computational elements. High-order numerical solvers have been primarily used with low-order meshes. There is a need for curved, high-order computational elements. Typical near-surface meshes consist of hexahedral and/or prismatic elements. The present work studies the employment of quadratic meshes that are relatively coarse for field simulations. Directionally quadratic high-order elements are proposed for the near-surface field regions. The quadratic meshes are compared with the conventional low-order ones in terms of accuracy and efficiency. The cases considered include closed surface volume calculations, as well as computation of gradients of several analytic fields. A special method of adaptive local quadratic meshes is proposed and evaluated. Truncation error analysis for quadratic grids yields comparison with the conventional linear hexahedral/prismatic meshes, which are subject to typical distortions such as stretching, skewness, and torsion.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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