首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3183篇
  免费   320篇
  国内免费   110篇
化学   829篇
晶体学   1篇
力学   180篇
综合类   109篇
数学   1602篇
物理学   892篇
  2024年   14篇
  2023年   33篇
  2022年   143篇
  2021年   127篇
  2020年   90篇
  2019年   83篇
  2018年   82篇
  2017年   157篇
  2016年   169篇
  2015年   92篇
  2014年   225篇
  2013年   186篇
  2012年   196篇
  2011年   213篇
  2010年   151篇
  2009年   160篇
  2008年   176篇
  2007年   172篇
  2006年   164篇
  2005年   168篇
  2004年   140篇
  2003年   100篇
  2002年   83篇
  2001年   60篇
  2000年   48篇
  1999年   41篇
  1998年   49篇
  1997年   51篇
  1996年   30篇
  1995年   27篇
  1994年   24篇
  1993年   23篇
  1992年   11篇
  1991年   20篇
  1990年   9篇
  1989年   11篇
  1988年   9篇
  1987年   9篇
  1986年   6篇
  1985年   8篇
  1984年   5篇
  1982年   7篇
  1981年   13篇
  1980年   6篇
  1979年   6篇
  1978年   4篇
  1977年   4篇
  1976年   2篇
  1972年   2篇
  1959年   1篇
排序方式: 共有3613条查询结果,搜索用时 31 毫秒
991.
We introduce a generalization of the BBGKY equation to define the equilibrium states for systems with long-range forces and study the properties of such states. We show that there are properties typical of short-range forces (shape independence, normal fluctuations, asymptotic behavior of correlation functions) and others which are typical of long-range forces (possible shape dependence, neutrality, sum rules and screening, abnormal fluctuations, boundedness of the internal electric field). If the force decreases at infinity faster than the Coulomb force, the properties will be those typical of short-range forces; on the other hand, if the force decreases at infinity as the Coulomb force or slower, the properties will be those typical of long-range forces.  相似文献   
992.
We discuss some problems obtained by truncating a cumulant hierarchy at ordern > 2. We show that such a truncation scheme is not consistent witha in its whole range of definition nonnegative probability function.  相似文献   
993.
Decision making is defined in terms of four elements: the set of decisions, the set of outcomes for each decision, a set-valued criterion function, and the decision maker's value judgment for each outcome. Various confidence structures are defined, which give the decision maker's confidence of a given decision leading to a particular outcome. The relation of certain confidence structures to Bayesian decision making and to membership functions in fuzzy set theory is established. A number of schemes are discussed for arriving atbest decisions, and some new types of domination structures are introduced.This research was partly supported by Project No. NR-047-021, ONR Contract No. N-00014-75-C-0569 with the Center for Cybernetic Studies, The University of Texas, Austin, Texas, and by ONR Contract No. N-00014-69-A-0200-1012 with the University of California, Berkeley, California.  相似文献   
994.
The error propagation is given for routine analysis by in situ evaluation in TLC using the methods with internal or external standard. The internal standard method will need four different measurements of peak height or area, while the external standard method uses only two measurements. Therefore in the latter case the error of the spotting volume will cause errors in the determined concentration. By error propagation it can be shown, that the internal standard method gives better results, if the error in measuring peak height or area is less than the error of the spotting volume.  相似文献   
995.
A term rewrite system is called simply terminating if its termination can be shown by means of a simplification ordering. According to a result of Weiermann, the derivation length function of any simply terminating finite rewrite system is eventually dominated by a Hardy function of ordinal less than the small Veblen ordinal. This bound had appeared to be of rather theoretical nature, because all known examples had had multiple recursive complexities, until recently Touzet constructed simply (and even totally) terminating examples with complexities beyond multiple recursion. This was established by simulating the Hydra battle for all ordinal segments below the proof-theoretic ordinal of Peano arithmetic. By extending this result to the small Veblen ordinal we prove the huge bound of Weiermann to be sharp. As a spin-off we can show that total termination allows for complexities as high as those of simple termination. This paper is part of the authors doctoral dissertation project (under the supervision of Professor A. Weiermann at the University of Münster).The work on this paper was supported by DFG grant WE 2178/2–1 Mathematics Subject Classification (2000): 03D20, 68Q15, 68Q42  相似文献   
996.
We consider a class of warped brane models with topology M 4 × × S1/Z 2, where is a D2-dimensional compact manifold, and two branes are placed at the orbifold fixed points. In a scenario where supersymmetry is broken not far below the cutoff scale, the hierarchy between the electroweak and the Planck scales is generated by a combination of the redshift and the large volume effects. We evaluate the effective potential induced by bulk scalar fields in these models and show that it can stabilize the moduli and the hierarchy without fine-tuning, provided that the internal space is flat. We also comment on the relation between these models and the five-dimensional scalar-tensor models that describe them classically when the compactification scale is small.  相似文献   
997.
Four Easy Ways to a Faster FFT   总被引:1,自引:0,他引:1  
The Fast Fourier Transform (FFT) was named one of the Top Ten algorithms of the 20th century , and continues to be a focus of current research. A problem with currently used FFT packages is that they require large, finely tuned, machine specific libraries, produced by highly skilled software developers. Therefore, these packages fail to perform well across a variety of architectures. Furthermore, many need to run repeated experiments in order to re-program their code to its optimal performance based on a given machine's underlying hardware. Finally, it is difficult to know which radix to use given a particular vector size and machine configuration. We propose the use of monolithic array analysis as a way to remove the constraints imposed on performance by a machine's underlying hardware, by pre-optimizing array access patterns. In doing this we arrive at a single optimized program. We have achieved up to a 99.6% increase in performance, and the ability to run vectors up to 8388608 elements larger, on our experimental platforms. Preliminary experiments indicate different radices perform better relative to a machine's underlying architecture.  相似文献   
998.
The action of various one-dimensional integral operators, discretized by a suitable quadrature method, can be compressed and accelerated by means of Chebyshev series approximation. Our approach has a different conception with respect to other well-known fast methods: its effectiveness rests on the smoothing effect of integration, and it works in linear as well as nonlinear instances, with both smooth and nonsmooth kernels. We describe a Matlab toolbox which implements Chebyshev-like compression of discrete integral operators, and we present several numerical tests, where the basic O(n 2) complexity is shown to be reduced to O(mn), with mn.  相似文献   
999.
This paper demonstrates a methodology for detecting cracks in a metal spindle, which is housed within a military vehicle wheel end assembly. A finite element model is used to estimate the undamped natural frequencies of the raw spindle. Additional mass and stiffness is then added to a simplified model of the spindle to simulate sources of variability within the assembly. Spindles are tested outside the wheel end assembly to compare the responses of undamaged and cracked spindles. A hypothesis testing approach is developed to detect the presence of a crack based on damage indices involving the summation and multiplication of spectral energies. Experiments on wheel assemblies mounted on a vehicle with the vehicle lifted off the ground are performed to demonstrate that the wheel assemblies can be nondestructively evaluated to identify cracks of varying depths despite sources of variability due to the presence of the brake drum, lack of repeatability in the sensor attachment, and other issues.  相似文献   
1000.
Through the Wronskian technique, a simple and direct proof is presented that the AKNS hierarchy in the bilinear form has generalized double Wronskian solutions. Moreover, by using a unified way, soliton solutions, rational solutions, Matveev solutions and complexitons in double Wronskian form for it are constructed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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