全文获取类型
收费全文 | 1127篇 |
免费 | 38篇 |
国内免费 | 35篇 |
专业分类
化学 | 78篇 |
力学 | 15篇 |
综合类 | 37篇 |
数学 | 808篇 |
物理学 | 262篇 |
出版年
2023年 | 51篇 |
2022年 | 29篇 |
2021年 | 40篇 |
2020年 | 18篇 |
2019年 | 25篇 |
2018年 | 15篇 |
2017年 | 22篇 |
2016年 | 22篇 |
2015年 | 18篇 |
2014年 | 37篇 |
2013年 | 91篇 |
2012年 | 44篇 |
2011年 | 45篇 |
2010年 | 51篇 |
2009年 | 77篇 |
2008年 | 85篇 |
2007年 | 81篇 |
2006年 | 70篇 |
2005年 | 39篇 |
2004年 | 42篇 |
2003年 | 43篇 |
2002年 | 33篇 |
2001年 | 32篇 |
2000年 | 22篇 |
1999年 | 22篇 |
1998年 | 22篇 |
1997年 | 12篇 |
1996年 | 16篇 |
1995年 | 16篇 |
1994年 | 10篇 |
1993年 | 11篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有1200条查询结果,搜索用时 31 毫秒
1.
Haifeng Yang Guangming XieTianguang Chu Long Wang 《Nonlinear Analysis: Theory, Methods & Applications》2006
In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching. 相似文献
2.
一种新的WDM光网中的共享链路保护策略 总被引:2,自引:2,他引:0
研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率. 相似文献
3.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
4.
Hadi Mohammadi Bidhandi 《Annals of Operations Research》2006,143(1):237-250
This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this
formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous
and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables,
and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach
based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared
by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared
by several numerical examples. Computational experience with these data shows the superiority of the new approach. 相似文献
5.
Elias Zafiris 《International Journal of Theoretical Physics》2004,43(1):265-298
We develop a relativistic perspective on structures of quantum observables, in terms of localization systems of Boolean coordinatizing charts. This perspective implies that the quantum world is comprehended via Boolean reference frames for measurement of observables, pasted together along their overlaps. The scheme is formalized categorically, as an instance of the adjunction concept. The latter is used as a framework for the specification of a categorical equivalence signifying an invariance in the translational code of communication between Boolean localizing contexts and quantum systems. Aspects of the scheme semantics are discussed in relation to logic. The interpretation of coordinatizing localization systems, as structure sheaves, provides the basis for the development of an algebraic differential geometric machinery suited to the quantum regime. 相似文献
6.
关于可达矩阵的求法探讨 总被引:6,自引:0,他引:6
在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 . 相似文献
7.
J. M. Kumpula J. Saramäki K. Kaski J. Kertész 《The European Physical Journal B - Condensed Matter and Complex Systems》2007,56(1):41-45
According to Fortunato and Barthélemy, modularity-based community detection
algorithms have a resolution threshold such that small communities in a large
network are invisible. Here we generalize their work and show that the q-state
Potts community detection method introduced by Reichardt and Bornholdt
also has a resolution threshold. The model contains a parameter by which this threshold can be tuned, but no a priori principle
is known to select the proper value.
Single global optimization criteria do not seem capable for detecting all
communities if their size distribution is broad. 相似文献
8.
A mistake concerning the ultra LI-ideal of a lattice implication algebra is pointed out, and some new sufficient and necessary conditions for an LI-ideal to be an ultra LI-ideal are given. Moreover, the notion of an LI-ideal is extended to MTL-algebras, the notions of a (prime, ultra, obstinate, Boolean) LI-ideal and an ILI-ideal of an MTL-algebra are introduced, some important examples are given, and the following notions are proved to be equivalent in MTL-algebra: (1) prime proper LI-ideal and Boolean LI-ideal, (2) prime proper LI-ideal and ILI-ideal, (3) proper obstinate LI-ideal, (4) ultra LI-ideal.
This work was supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. Y605389) and K. C. Wong
Magna Fund in Ningbo University. 相似文献
9.
10.
The reference [4] proved the consistency of S1 and S2 among Lewis' five strict implication systems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S3, S4 and S5 in Lewis' five strict implication systems is not decided. This paper makes use of the properties: (1) the equivalence of the modal systems S3 and P3, S4 and P4; (2) the modal systems P3 and P4 all contained the modal axiom T(□p → p); (3) the modal axiom T is correspondence to the reflexive property in VB. Hence, the paper proves: (a) ‖As31‖ = 1; (b) ‖AS41‖ = 1; (c) ‖AS5l‖ = 1 in the model (where B is a complete Boolean algebra, R is reflexive property in VB). Therefore, the paper finally proves that the Boolean-valued model VB of the ZFC axiom system in set theory is also a Boolean-valued model of Lewis' the strict implication system S3, S4 and S5. 相似文献