首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10377篇
  免费   1943篇
  国内免费   681篇
化学   2273篇
晶体学   87篇
力学   950篇
综合类   167篇
数学   4914篇
物理学   4610篇
  2024年   9篇
  2023年   97篇
  2022年   228篇
  2021年   302篇
  2020年   316篇
  2019年   350篇
  2018年   333篇
  2017年   436篇
  2016年   453篇
  2015年   376篇
  2014年   539篇
  2013年   919篇
  2012年   612篇
  2011年   665篇
  2010年   585篇
  2009年   622篇
  2008年   694篇
  2007年   619篇
  2006年   552篇
  2005年   504篇
  2004年   438篇
  2003年   454篇
  2002年   410篇
  2001年   341篇
  2000年   303篇
  1999年   270篇
  1998年   216篇
  1997年   224篇
  1996年   170篇
  1995年   147篇
  1994年   111篇
  1993年   76篇
  1992年   76篇
  1991年   66篇
  1990年   61篇
  1989年   48篇
  1988年   37篇
  1987年   38篇
  1986年   40篇
  1985年   52篇
  1984年   34篇
  1983年   22篇
  1982年   27篇
  1981年   27篇
  1980年   13篇
  1979年   22篇
  1978年   15篇
  1977年   14篇
  1976年   11篇
  1973年   7篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.  相似文献   
22.
Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
23.
This paper deals with positive solutions of degenerate and quasilinear parabolic systems not in divergence form: ut=up(Δu+av), vt=vq(Δv+bu), with null Dirichlet boundary conditions and positive initial conditions, where p, q, a and b are all positive constants. The local existence and uniqueness of classical solution are proved. Moreover, it will be proved that all solutions exist globally if and only if ab?λ12, where λ1 is the first eigenvalue of −Δ in Ω with homogeneous Dirichlet boundary condition.  相似文献   
24.
结合Liapunov泛函,研究了具连续时滞Lienard方程概周期解的存在唯一性和安全一致渐进稳定性。  相似文献   
25.
FJZ-250型高速分幅相机时间测量不确定度分析   总被引:2,自引:1,他引:1  
FJZ-250型高速转镜分幅相机因转镜速度的不可重复性,光机结构的构造原理和控制系统各路高压触发时间的漂移,导致了时间测量的不确定度。为此,须对相机测量数据进行校正。阐述了校正方法、提供了逐幅校正位置误差的修正系数。若以预置转速对应的名义周期值去处理测量结果,则相机的时间测量合成小确定度将达1%,对名义周期值和名义幅间间隔时间值进行修正后,则可降至0.3%。  相似文献   
26.
We derived the WKB wave function for the general time-dependent quadratic Hamiltonian system using a unitary transformation method. We applied our research to sinusodially drived Caldirola–Kanai oscillator and confirmed that the time evolution of our approximated WKB wave function is similar to that of the exact one. This wave function can be used to analyze the interference between the probability amplitudes contributed by the area of overlap in phase space of quantum states.  相似文献   
27.
薛明皋  龚朴 《经济数学》2004,21(4):283-295
本文把数学和管理科学有机结合,为数学应用提出问题,得出新结果,推广了J.Michel Harrison(1985)[1]第43页的命题27,并给出了在金融中的应用.  相似文献   
28.
A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.  相似文献   
29.
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.  相似文献   
30.
利用激光溅射 分子束的技术 ,结合反射飞行时间质谱计 ,研究了Cu+、Ag+、Au+与乙硫醇的气相化学反应。结果显示这三种金属离子与 (CH3 CH2 SH) n 反应形成一系列团簇离子M+(CH3 CH2 SH) n,且团簇离子尺寸不一样。Ag+、Au+与乙硫醇的反应还生成了 (CH3 CH2 SH) +n ,由此推测Cu+、Ag+、Au+与乙硫醇团簇的反应存在两种通道 ,一种通道是生成M+(CH3 CH2 SH) n,另一种是生成 (CH3 CH2 SH) +n 。Cu+、Au+与乙硫醇的反应还生成了M+(H2 S) (M =Cu、Au) ,但是实验中没有观察到Ag+(H2 S) ,理论计算表明Ag+(H2 S)很不稳定。另外 ,分析产物离子M+(CH3 CH2 SH) n 的强度发现 ,n =1~ 2之间存在明显的强度突变现象  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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