全文获取类型
收费全文 | 1489篇 |
免费 | 83篇 |
国内免费 | 41篇 |
专业分类
化学 | 54篇 |
力学 | 160篇 |
综合类 | 7篇 |
数学 | 1163篇 |
物理学 | 229篇 |
出版年
2024年 | 4篇 |
2023年 | 37篇 |
2022年 | 56篇 |
2021年 | 65篇 |
2020年 | 98篇 |
2019年 | 44篇 |
2018年 | 43篇 |
2017年 | 64篇 |
2016年 | 60篇 |
2015年 | 88篇 |
2014年 | 121篇 |
2013年 | 112篇 |
2012年 | 85篇 |
2011年 | 105篇 |
2010年 | 82篇 |
2009年 | 98篇 |
2008年 | 48篇 |
2007年 | 75篇 |
2006年 | 67篇 |
2005年 | 32篇 |
2004年 | 21篇 |
2003年 | 22篇 |
2002年 | 22篇 |
2001年 | 34篇 |
2000年 | 10篇 |
1999年 | 41篇 |
1998年 | 24篇 |
1997年 | 12篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 1篇 |
1993年 | 7篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 5篇 |
1984年 | 1篇 |
1977年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有1613条查询结果,搜索用时 15 毫秒
101.
102.
《Discrete Mathematics》2007,307(3-5):386-392
In a series of papers, we have classified the complexity of list homomorphism problems. Here, we investigate the effect of restricting the degrees of the input graphs. It turns out that the complexity does not change (except when the degree bound is two). We obtain similar results on restricting the size of the lists.We contrast these results with facts about variants of the list homomorphism problem, where restricting the degrees can have an important effect on the complexity. 相似文献
103.
《Chaos, solitons, and fractals》2005,23(2):421-430
Both exponential stability and periodic solutions are considered for a class of bi-directional associative memory (BAM) neural networks with delays and reaction–diffusion terms by constructing suitable Lyapunov functional and some analysis techniques. The general sufficient conditions are given ensuring the global exponential stability and existence of periodic solutions of BAM neural networks with delays and reaction–diffusion terms. These presented conditions are in terms of system parameters and have important leading significance in the design and applications of globally exponentially stable and periodic oscillatory neural circuits for BAM with delays and reaction–diffusion terms. 相似文献
104.
Guo-xin Liu 《Journal of Global Optimization》2007,37(4):631-646
This paper presents a homotopy interior point method for solving a semi-infinite programming (SIP) problem. For algorithmic
purpose, based on bilevel strategy, first we illustrate appropriate necessary conditions for a solution in the framework of
standard nonlinear programming (NLP), which can be solved by homotopy method. Under suitable assumptions, we can prove that
the method determines a smooth interior path
from a given interior point
to a point w
*, at which the necessary conditions are satisfied. Numerical tracing this path gives a globally convergent algorithm for the
SIP. Lastly, several preliminary computational results illustrating the method are given. 相似文献
105.
106.
设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。 相似文献
107.
A two parameter asymptotic analysis is employed to investigate some unusual long wave dispersion phenomena in respect of symmetric motion in a nearly incompressible elastic plate. The plate is not subject to the usual classical traction free boundary conditions, but rather has its faces fixed, precluding any displacement on the boundary. The abnormal long wave behaviour results in the derivation of non-local approximations for symmetric motion, giving frequency as a function of wave number. Motivated by these approximations, the asymptotic forms of displacement components established and long wave asymptotic integration is carried out. 相似文献
108.
RNA-seq data are challenging existing omics data analytics for its volume and complexity. Although quite a few computational models were proposed from different standing points to conduct differential expression (D.E.) analysis, almost all these methods do not provide a rigorous feature selection for high-dimensional RNA-seq count data. Instead, most or even all genes are invited into differential calls no matter they have real contributions to data variations or not. Thus, it would inevitably affect the robustness of D.E. analysis and lead to the increase of false positive ratios.In this study, we presented a novel feature selection method: nonnegative singular value approximation (NSVA) to enhance RNA-seq differential expression analysis by taking advantage of RNA-seq count data's non-negativity. As a variance-based feature selection method, it selects genes according to its contribution to the first singular value direction of input data in a data-driven approach. It demonstrates robustness to depth bias and gene length bias in feature selection in comparison with its five peer methods. Combining with state-of-the-art RNA-seq differential expression analysis, it contributes to enhancing differential expression analysis by lowering false discovery rates caused by the biases. Furthermore, we demonstrated the effectiveness of the proposed feature selection by proposing a data-driven differential expression analysis: NSVA-seq, besides conducting network marker discovery. 相似文献
109.
Motivated by applications in many economic environments, Bochet et al. (2010) generalize the classic rationing model (Sprumont 1991) as follows: there is a moneyless market, in which a non-storable, homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary bipartite graph. Information about individual preferences is private, and so is information about feasible links: an agent may unilaterally close one of her links if it is in her interest to do so. For this problem they propose the egalitarian transfer solution, which equalizes the net transfers of rationed agents as much as permitted by the bilateral constraints. Furthermore, they show that the egalitarian mechanism elicits a truthful report of both preferences and links. In the variant where demanders are not strategic but demands need to be exactly met Bochet et al. (2013), they propose a similar mechanism for which truthfully reporting the peaks is a dominant strategy, but truthful reporting of links is not.The key contribution of the paper is a comprehensive study of the egalitarian mechanism with respect to manipulation by a coalition of agents. Our main result is that the egalitarian mechanism is group strategyproof : no coalition of agents can (weakly) benefit from jointly misreporting their peaks. Furthermore, we show that the egalitarian mechanism cannot be manipulated – by misreporting links or by misreporting peaks – by any coalition of suppliers (or any coalition of demanders) in the model where both the suppliers and demanders are agents. Our proofs shed light on the structure of the two models and simplify some of the earlier proofs of strategyproofness. An implication of our results is that the well known algorithm of Megiddo (1977) to compute a lexicographically optimal flow in a network is group strategyproof with respect to the source capacities and sink capacities. 相似文献
110.