首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   614篇
  免费   30篇
  国内免费   1篇
化学   39篇
力学   4篇
数学   570篇
物理学   32篇
  2023年   4篇
  2022年   5篇
  2021年   1篇
  2020年   1篇
  2019年   39篇
  2018年   39篇
  2017年   15篇
  2016年   9篇
  2015年   17篇
  2014年   27篇
  2013年   48篇
  2012年   14篇
  2011年   46篇
  2010年   42篇
  2009年   65篇
  2008年   49篇
  2007年   54篇
  2006年   25篇
  2005年   23篇
  2004年   24篇
  2003年   16篇
  2002年   15篇
  2001年   1篇
  2000年   2篇
  1999年   4篇
  1998年   8篇
  1997年   4篇
  1996年   4篇
  1995年   3篇
  1994年   2篇
  1993年   2篇
  1991年   2篇
  1990年   2篇
  1989年   16篇
  1988年   2篇
  1986年   3篇
  1985年   4篇
  1984年   1篇
  1983年   3篇
  1981年   1篇
  1978年   1篇
  1977年   2篇
排序方式: 共有645条查询结果,搜索用时 15 毫秒
11.
利用密度泛函理论(DFT)研究了一种新颖的准球形纳米团簇B92.经过结构优化和频率分析,这一准球形笼状团簇的直径为0.968 nm,其结构满足Eoustani提出的"Aufbau principle".团簇B92的平均结合能、能隙(HOMO-LUMO gap)、垂直电离势(VIP)及垂直电子亲和势(VEA)分别为5.28 eV,1.19 eV,5.47eV及2.45 eV.计算所得到的红外谱(IR)上有一个明显的峰在895 Cm-1处.此谱将有助于从实验上确定本文所提出的团簇B92的结构,团簇B92的电荷分布表明,其有望成为未来纳米电子学中的一种电容器,另外,作为比较,本文也给出了其他一些笼状硼团簇的性质.  相似文献   
12.
Free-space quantum key distribution (QKD) has attracted considerable attention due to its lower channel loss and link flexibility. It allows two participants share theoretical unconditional secure keys, and can potentially be applied to air-to-ground quantum communication to establish a global quantum network. Free-space QKD using modulating retro-reflectors (MRR-QKD) significantly reduces the pointing requirement and simplifies the structure of the mobile terminal, therefore making it suitable for lightweight aircraft such as unmanned aerial vehicle and Cubesat, etc. Based on intensity modulation of two non-orthogonal states and the B92 protocol, we proposed a scheme to improve the previous work (Optics Express 2018, 26, 11331). Our scheme simplifies the optical structure and shows more robustness in equipment imperfection. The analysis and simulation show that the number of multiple quantum well modulators needed in our scheme decreases from eight to three with similar performance. Additionally, while the previous scheme cannot work due to low modulator extinction ratio or high optical misalignment, our scheme can still operate.  相似文献   
13.
This paper examines a system of reaction-diffusion equations arising from a flowing water habitat. In this habitat, one or two microorganisms grow while consuming two growth-limiting, complementary (essential) resources. For the single population model, the existence and uniqueness of a positive steady-state solution is proved. Furthermore, the unique positive solution is globally attracting for the system with regard to nontrivial nonnegative initial values. Mathematical analysis for the two competing populations is carried out. More precisely, the long-time behavior is determined by using the monotone dynamical system theory when the semi-trivial solutions are both unstable. It is also shown that coexistence solutions exist by using the fixed point index theory when the semi-trivial solutions are both (asymptotically) stable.  相似文献   
14.
In this paper we consider ecoepidemic models in which the basic demographics is represented by predator-prey interactions, with the disease modeled by an SEI system. At first we consider a basic Lotka-Volterra type of interaction. Then we also introduce competition for resources among individuals of the prey population. Several variations of the model are presented, in which the prey intra-specific population pressure assumes different forms, depending on the virulence of the disease. Indeed, the latter may affect the exposed and infected individuals so much that they may not be able to compete with the sound ones for resources. A further distinguishing feature of this investigation lies in the way in which the predator actively selects the prey for hunting. For instance in some cases predators may discard the diseased ones, as less palatable, while in other situations they would instead search expressly for the infected, since these are weaker individuals and thus easier to hunt. The equilibria of the systems are analyzed, showing that in some cases bifurcations arise, contrary to what happens to similar classical Holling type I ecoepidemic models. These persistent oscillations seem to be triggered by the number of subpopulations present in the system, which is larger than those introduced in the former models, counting also the latent class. Furthermore, adding predation to an SEI epidemic model has profound effects on the stability of its equilibria. In particular, once the predators are introduced into an SEI epidemic at a stable endemic equilibrium, their presence destabilizes this equilibrium making the previous stable conditions unrecoverable.  相似文献   
15.
M. Syed Ali 《Physics letters. A》2008,372(31):5159-5166
In this Letter, by utilizing the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, we analyze the global asymptotic stability of uncertain stochastic fuzzy Bidirectional Associative Memory (BAM) neural networks with time-varying delays which are represented by the Takagi-Sugeno (TS) fuzzy models. A new class of uncertain stochastic fuzzy BAM neural networks with time varying delays has been studied and sufficient conditions have been derived to obtain conservative result in stochastic settings. The developed results are more general than those reported in the earlier literatures. In addition, the numerical examples are provided to illustrate the applicability of the result using LMI toolbox in MATLAB.  相似文献   
16.
17.
18.
In protein threading, one is given a protein sequence, together with a database of protein core structures that may contain the natural structure of the sequence. The object of protein threading is to correctly identify the structure(s) corresponding to the sequence. Since the core structures are already associated with specific biological functions, threading has the potential to provide biologists with useful insights about the function of a newly discovered protein sequence. Statistical tests for threading results based on the theory of extreme values suggest several combinatorial problems. For example, what is the number of waysm′=# t {L i >x i } i =0n of choosing a sequence {X i } i =1n from the set {1, 2, ...,t}, subject to the difference constraints {L i =X i+1?X i >x i } i =0n , whereX 0=0,X n+1=t+1, and {x i } i =0n is an arbitrary sequence of integers? The quantitym′ has many attractive combinatorial interpretations and reduces in special continuous limits to a probabilistic formula discovered by the Finetti. Just as many important probabilities can be derived from de Finetti's formula, many interesting combinatorial quantities can be derived fromm′. Empirical results presented here show that the combinatorial approach to threading statistics appears promising, but that structural periodicities in proteins and energetically unimportant structure elements probably introduce statistical correlations that must be better understood.  相似文献   
19.
We prove the existence of a continuous family of positive and generally nonmonotone travelling fronts for delayed reaction-diffusion equations , when gC2(R+,R+) has exactly two fixed points: x1=0 and x2=K>0. Recently, nonmonotonic waves were observed in numerical simulations by various authors. Here, for a wide range of parameters, we explain why such waves appear naturally as the delay h increases. For the case of g with negative Schwarzian, our conditions are rather optimal; we observe that the well known Mackey-Glass-type equations with diffusion fall within this subclass of (∗). As an example, we consider the diffusive Nicholson's blowflies equation.  相似文献   
20.
We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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