首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9335篇
  免费   434篇
  国内免费   27篇
化学   6596篇
晶体学   61篇
力学   135篇
数学   1132篇
物理学   1872篇
  2023年   69篇
  2022年   101篇
  2021年   133篇
  2020年   246篇
  2019年   208篇
  2018年   96篇
  2017年   133篇
  2016年   325篇
  2015年   296篇
  2014年   360篇
  2013年   444篇
  2012年   583篇
  2011年   631篇
  2010年   361篇
  2009年   319篇
  2008年   465篇
  2007年   465篇
  2006年   415篇
  2005年   360篇
  2004年   327篇
  2003年   271篇
  2002年   265篇
  2001年   163篇
  2000年   151篇
  1999年   138篇
  1998年   104篇
  1997年   112篇
  1996年   114篇
  1995年   128篇
  1994年   145篇
  1993年   116篇
  1992年   125篇
  1991年   104篇
  1990年   81篇
  1989年   89篇
  1988年   67篇
  1987年   68篇
  1986年   59篇
  1985年   75篇
  1984年   64篇
  1983年   66篇
  1982年   65篇
  1981年   63篇
  1980年   71篇
  1979年   66篇
  1978年   60篇
  1977年   63篇
  1976年   48篇
  1974年   49篇
  1973年   51篇
排序方式: 共有9796条查询结果,搜索用时 15 毫秒
1.
Several promising approaches for hexahedral mesh generation work as follows: Given a prescribed quadrilateral surface mesh they first build the combinatorial dual of the hexahedral mesh. This dual mesh is converted into the primal hexahedral mesh, and finally embedded and smoothed into the given domain. Two such approaches, the modified whisker weaving algorithm by Folwell and Mitchell, as well as a method proposed by the author, rely on an iterative elimination of certain dual cycles in the surface mesh. An intuitive interpretation of the latter method is that cycle eliminations correspond to complete sheets of hexahedra in the volume mesh.

Although these methods can be shown to work in principle, the quality of the generated meshes heavily relies on the dual cycle structure of the given surface mesh. In particular, it seems that difficulties in the hexahedral meshing process and poor mesh qualities are often due to self-intersecting dual cycles. Unfortunately, all previous work on quadrilateral surface mesh generation has focused on quality issues of the surface mesh alone but has disregarded its suitability for a high-quality extension to a three-dimensional mesh.

In this paper, we develop a new method to generate quadrilateral surface meshes without self-intersecting dual cycles. This method reuses previous b-matching problem formulations of the quadrilateral mesh refinement problem. The key insight is that the b-matching solution can be decomposed into a collection of simple cycles and paths of multiplicity two, and that these cycles and paths can be consistently embedded into the dual surface mesh.

A second tool uses recursive splitting of components into simpler subcomponents by insertion of internal two-manifolds. We show that such a two-manifold can be meshed with quadrilaterals such that the induced dual cycle structure of each subcomponent is free of self-intersections if the original component satisfies this property. Experiments show that we can achieve hexahedral meshes with a good quality.  相似文献   

2.
We study correlations in the exclusive reaction at rest with complete reconstruction of the kinematics for each event. The inclusive distribution is fairly flat at small invariant mass of the pion pair while a small enhancement in the double differential distribution is observed for small invariant masses of both pion pairs. Dynamical models with resonances in the final state are shown to be consistent with the data while the stochastic HBT mechanism is not supported by the present findings. Received: 26 February 2002 / Revised version: 22 July 2002 / Published online: 30 August 2002  相似文献   
3.
4.
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (UbV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.  相似文献   
5.
The contributions to the coefficient functions of the quark and the mixed quark-gluon condensate to mesonic correlators are calculated for the first time to all orders in the quark masses, and to lowest order in the strong coupling constant. Existing results on the coefficient functions of the unit operator and the gluon condensate are reviewed. The proper factorization of short- and long-distance contributions in the operator product expansion is discussed in detail. It is found that to accomplish this task rigorously the operator product expansion has to be performed in terms ofnon-normal-ordered condensates. The resulting coefficient functions are improved with the help of the renormalization group. The scale invariant combination of dimension 5 operators, including mixing with the mass operator, which is needed for the renormalization group improvement, is calculated in the leading order.Supported by the German Bundesministerium für Forschung und Technologie, under the contract 06 TM 761  相似文献   
6.
We derive a moderate deviation principle for the lower tail probabilities of the length of a longest increasing subsequence in a random permutation. It refers to the regime between the lower tail large deviation regime and the central limit regime. The present article together with the upper tail moderate deviation principle in Ref. 12 yields a complete picture for the whole moderate deviation regime. Other than in Ref. 12, we can directly apply estimates by Baik, Deift, and Johansson, who obtained a (non-standard) Central Limit Theorem for the same quantity.  相似文献   
7.
 Let kn be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001  相似文献   
8.
In recent years there has emerged significant interest in low pressure radio frequency (rf) glow discharges which are used widely particulary in IC fabrication. Various parameters of the rf glow discharge have been found to be useful for its electrical characterization; however, there is no uniformity and agreement. Extensive experimental investigations on various discharge systems have shown, that the self-bias on the rf driven electrode, the complex conductivity and the breakdown characteristic are preferable parameters of rf discharges. Advantageously the self-bias and the complex conductivity should be presented in dependence on the pressure and the applied rf voltage. The discharge current cannot be measured quite accurately due to currents via leaky capacitors and the deviations from a sinusoidal form of the current due to nonlinearities.  相似文献   
9.
Hans Weber 《Order》2007,24(4):249-276
We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.  相似文献   
10.
We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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