首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1783篇
  免费   85篇
  国内免费   133篇
化学   196篇
力学   75篇
综合类   16篇
数学   1424篇
物理学   290篇
  2023年   13篇
  2022年   35篇
  2021年   36篇
  2020年   39篇
  2019年   43篇
  2018年   35篇
  2017年   39篇
  2016年   51篇
  2015年   39篇
  2014年   78篇
  2013年   151篇
  2012年   63篇
  2011年   87篇
  2010年   71篇
  2009年   117篇
  2008年   115篇
  2007年   125篇
  2006年   103篇
  2005年   80篇
  2004年   83篇
  2003年   52篇
  2002年   65篇
  2001年   52篇
  2000年   42篇
  1999年   54篇
  1998年   33篇
  1997年   35篇
  1996年   31篇
  1995年   23篇
  1994年   27篇
  1993年   18篇
  1992年   17篇
  1991年   15篇
  1990年   6篇
  1989年   15篇
  1988年   10篇
  1987年   9篇
  1986年   5篇
  1985年   14篇
  1984年   15篇
  1983年   7篇
  1982年   6篇
  1981年   6篇
  1980年   5篇
  1979年   11篇
  1978年   5篇
  1977年   3篇
  1976年   3篇
  1974年   3篇
  1973年   7篇
排序方式: 共有2001条查询结果,搜索用时 305 毫秒
61.
In this article, we derive expressions for conditional expectations in terms of regular expectations without conditioning but involving some weights. For this purpose, we apply two approaches: the conditional density method and the Malliavin method. We use these expressions for the numerical estimation of the price of American options and their deltas in a Lévy and jump-diffusion setting. Several examples of applications to financial and energy markets are given including numerical examples.  相似文献   
62.
The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.  相似文献   
63.
A procedure is presented by which the integration of a function such as cos n (x) or sin n (x) with n = 1, 2, 3, 4 … is facilitated.  相似文献   
64.
For a general renewal process N (allowing delay, defect and multiple simultaneous arrivals) the independence of the first renewal epochs of the marked processes got from N by Bernoulli 0/1 thinning is characterized. This independence is well-known to hold true in the case of homogeneous Poisson processes; by way of corollary one obtains the interesting observation that, when coupled with some minimal extra conditions, it in fact already identifies them. The proof is analytic in character.  相似文献   
65.
We prove that in a group without the independence property a nilpotent subgroup is always contained in a definable nilpotent subgroup of the same nilpotency class. The analogue for the soluble case is also shown when the subgroup is normal in the ambient group.  相似文献   
66.
Testing the validity of the conditional capital asset pricing model(CAPM) is a puzzle in the finance literatureLewellen and Nagel[14]find that the variation in betas and in the equity premium would have to be implausibly large to explain important asset-pricing anomaliesUnfortunately, they do not provide a rigorous test statisticBased on a simulation study, the method proposed in Lewellen and Nagel[14]tends to reject the null too frequently.We develop a new test procedure and derive its limiting distribution under the null hypothesis.Also, we provide a Bootstrap approach to the testing procedure to gain a good finite sample performanceBoth simulations and empirical studies show that our test is necessary for making correct inferences with the conditional CAPM.  相似文献   
67.
Abstract

The suitability of HPLC (normal and reversed phase adsorption) with UV or post-column reaction detection for the analysis of organomercurials was investigated systematically. The separation of organomercurials is best carried out on a reversed phase system with a C-8 bonded phase material as the stationary phase and acetonitrile-aqueous sodium bromide mixtures as the mobile phase.

The precision and detection limit of the method and the efficiency of the extraction procedure were established. For the alkylmercury compounds the lowest limit of detection (80ppb) was obtained with the dithizone reaction detection and for the phenylmercury compounds with UV detection (60ppb). A chromatogram of a spiked fish (2ppmHg) and a river water sample (50ppbHg) is shown.  相似文献   
68.
针对机载设备的状态健康评估问题,采用隐马尔科夫模型(HMM)对其进行性能退化程度的评估。首先引入状态条件概率矢量对HMM进行不确定性改进,并推导了其表达式;其次以状态条件概率比值为基础,给出了机载设备状态等级量化分值的计算方法,并据此设计了机载设备状态健康评估流程。最后以飞机发动机温控放大器为例进行仿真验证,结果表明上述方法能够给出直观、准确的状态评估结果。  相似文献   
69.
鉴于条件风险价值CVaR具有风险度量的合理性以及两基金分离定理对证券投资的重要意义,以CVaR作为风险度量研究两基金分离定理.在组合收益率服从正态分布的假设下,分别就投资组合含有或没有无风险资产的情形提出并证明了两基金分离定理;放开方差-协方差矩阵为非奇异这一通常假设,证明了CVaR风险度量下的两基金分离定理依然成立.  相似文献   
70.
We study in this paper the Q‐symmetry and conditional Q‐symmetries of Drinfel'd–Sokolov–Wilson equations. The solutions which we obtain in this paper take the form of convergent power series with easily computable components. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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