全文获取类型
收费全文 | 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条查询结果,搜索用时 343 毫秒
21.
This paper focus on the event-triggered sliding mode controller design for discrete-time switched genetic regulatory networks (GRNs) with persistent dwell time (PDT) switching. Firstly, the observation error dynamics of switched GRNs with PDT is constructed in the light of event-triggered sliding mode control (SMC) scheme. Next, sufficient conditions are derived to ensure the exponential stability of the augmented plant. Moreover, an event-triggered SMC law is synthesized to impel the system trajectories onto the sliding surface in a finite time. Finally, a verification example is provided to illustrate the effectiveness and potential of the proposed method. 相似文献
22.
Two Fraenkel-Mostowski models are constructed in which the Boolean Prime Ideal Theorem is true. In both models, AC for countable sets is true, but AC for sets of cardinality 2 and the 2m = m principle are both false. The Principle of Dependent Choices is true in the first model, but false in the second. Mathematics Subject Classification: 03E25, 03E35, 04A25. 相似文献
23.
The purpose of this paper is to present a new primal extreme point algorithm for solving assignment problems which both circumvents and exploits degeneracy. The algorithm is based on the observation that the degeneracy difficulties of the simplex method result from the unnecessary inspection of alternative basis representations of the extreme points. This paper characterizes a subsetQ of all bases that are capable of leading to an optimal solution to the problem if one exists. Using this characterization, an extreme point algorithm is developed which considers only those bases inQ. Computational results disclose that the new algorithm is substantially more efficient than previously developed primal and primal-dual extreme point (simplex) methods for assignment problems. 相似文献
24.
A primal transportation algorithm is devised via post-optimization on the costs of a modified problem. The procedure involves altering the costs corresponding to the basic cells of the initial (primal feasible) solution so that it is dual feasible as well. The altered costs are then successively restored to their true values with appropriate changes in the optimal solution by the application of cell or area cost operators discussed elsewhere. The cell cost operator algorithm converges to optimum within (2T – 1) steps for primal nondegenerate transportation problems and [(2T + 1) min (m, n)] – 1 steps for primal degenerate transportation problems, whereT is the sum of the (integer) warehouse availabilities (also the sum of the (integer) market requirements) andm andn denote the number of warehouses and markets respectively. For the area cost operator algorithm the corresponding bounds on the number of steps areT and (T + 1) min (m, n) respectively.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie—Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with the U.S. Office of Naval Research. 相似文献
25.
A general approach to information correction and fusion for belief functions is proposed, where not only may the information items be irrelevant, but sources may lie as well. We introduce a new correction scheme, which takes into account uncertain metaknowledge on the source’s relevance and truthfulness and that generalizes Shafer’s discounting operation. We then show how to reinterpret all connectives of Boolean logic in terms of source behavior assumptions with respect to relevance and truthfulness. We are led to generalize the unnormalized Dempster’s rule to all Boolean connectives, while taking into account the uncertainties pertaining to assumptions concerning the behavior of sources. Eventually, we further extend this approach to an even more general setting, where source behavior assumptions do not have to be restricted to relevance and truthfulness. We also establish the commutativity property between correction and fusion processes, when the behaviors of the sources are independent. 相似文献
26.
《Optimization》2012,61(4):635-639
First it is shown that the implementation of the algorithm proposed in the considered paper may cause some problems if no further specification is made as to one of its steps. Secondly, such a specification is suggested. 相似文献
27.
Nonlinear filter generators are commonly used as keystream generators in stream ciphers. A nonlinear filter generator utilizes a nonlinear filtering function to combine the outputs of a linear feedback shift register (LFSR) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits. Although the known algebraic attacks only require polynomial time complexity of computations, all have their own constraints. This paper uses the linearization of nonlinear filter generators to cryptanalyze LFSR-based stream ciphers. Such a method works for any nonlinear filter generators. Viewing a nonlinear filter generator as a Boolean network that evolves as an automaton through Boolean functions, we first give its linearization representation. Compared to the linearization representation in Limniotis et al. (2008), this representation requires lower spatial complexity of computations in most cases. Based on the representation, the key recoverability is analyzed via the observability of Boolean networks. An algorithm for key recovery is given as well. Compared to the exhaustive search to recover the key, using this linearization representation requires lower time complexity of computations, though it leads to exponential time complexity. 相似文献
28.
29.
30.