全文获取类型
收费全文 | 2926篇 |
免费 | 321篇 |
国内免费 | 190篇 |
专业分类
化学 | 387篇 |
晶体学 | 10篇 |
力学 | 178篇 |
综合类 | 34篇 |
数学 | 1357篇 |
物理学 | 654篇 |
无线电 | 817篇 |
出版年
2024年 | 6篇 |
2023年 | 32篇 |
2022年 | 71篇 |
2021年 | 108篇 |
2020年 | 95篇 |
2019年 | 69篇 |
2018年 | 67篇 |
2017年 | 86篇 |
2016年 | 107篇 |
2015年 | 105篇 |
2014年 | 142篇 |
2013年 | 184篇 |
2012年 | 156篇 |
2011年 | 201篇 |
2010年 | 135篇 |
2009年 | 184篇 |
2008年 | 188篇 |
2007年 | 202篇 |
2006年 | 174篇 |
2005年 | 142篇 |
2004年 | 109篇 |
2003年 | 111篇 |
2002年 | 93篇 |
2001年 | 84篇 |
2000年 | 104篇 |
1999年 | 70篇 |
1998年 | 65篇 |
1997年 | 61篇 |
1996年 | 41篇 |
1995年 | 27篇 |
1994年 | 44篇 |
1993年 | 30篇 |
1992年 | 19篇 |
1991年 | 21篇 |
1990年 | 15篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 13篇 |
1985年 | 15篇 |
1984年 | 14篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1976年 | 1篇 |
排序方式: 共有3437条查询结果,搜索用时 0 毫秒
91.
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. 相似文献
92.
A contact metric manifold is said to be H-contact, if its characteristic vector field is harmonic. We prove that the unit tangent bundle of a Riemannian manifold M equipped with the standard contact metric structure is H-contact if and only if M is 2-stein. 相似文献
93.
J. Galen Buckwalter Brian Castellani Bruce Mcewen Arun S. Karlamangla Albert A. Rizzo Bruce John Kyle O'donnell Teresa Seeman 《Complexity》2016,21(Z1):291-306
Allostatic load (AL) is a complex clinical construct, providing a unique window into the cumulative impact of stress. However, due to its inherent complexity, AL presents two major measurement challenges to conventional statistical modeling (the field's dominant methodology): it is comprised of a complex causal network of bioallostatic systems, represented by an even larger set of dynamic biomarkers; and, it is situated within a web of antecedent socioecological systems, linking AL to differences in health outcomes and disparities. To address these challenges, we employed case‐based computational modeling (CBM), which allowed us to make four advances: (1) we developed a multisystem, 7‐factor (20 biomarker) model of AL's network of allostatic systems; (2) used it to create a catalog of nine different clinical AL profiles (causal pathways); (3) linked each clinical profile to a typology of 23 health outcomes; and (4) explored our results (post hoc) as a function of gender, a key socioecological factor. In terms of highlights, (a) the Healthy clinical profile had few health risks; (b) the pro‐inflammatory profile linked to high blood pressure and diabetes; (c) Low Stress Hormones linked to heart disease, TIA/Stroke, diabetes, and circulation problems; and (d) high stress hormones linked to heart disease and high blood pressure. Post hoc analyses also found that males were overrepresented on the High Blood Pressure (61.2%), Metabolic Syndrome (63.2%), High Stress Hormones (66.4%), and High Blood Sugar (57.1%); while females were overrepresented on the Healthy (81.9%), Low Stress Hormones (66.3%), and Low Stress Antagonists (stress buffers) (95.4%) profiles. © 2015 Wiley Periodicals, Inc. Complexity 21: 291–306, 2016 相似文献
94.
95.
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography
and Monte-Carlo methods.
The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom
number generation.
Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator
was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected.
Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number
generators with Dickson polynomials. 相似文献
96.
研究有预算限制的最大多种物资流问题,给出了这个问题的不依赖物资数k的全多项式时间近似算法,其算法复杂性是O~(-ε2m2).同时,利用有预算限制的最大多种物资流问题的研究结果,我们也得到了费用最小的最大多种物资流问题的近似算法和算法复杂性. 相似文献
97.
利用Dirichlet外问题与漂移布朗运动之间存在的密切联系,对Dirichlet外问题提出了一种新的有效的概率数值方法,这种方法运用了解的随机表达式、布朗运动、漂移布朗运动以及球面首中位置和时间的分布等. 相似文献
98.
王益 《高校应用数学学报(英文版)》2006,21(4):418-428
Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution language is not context-free but context-sensitive. Also, the same results hold for the equivalent (under conjugation) elementary cellular automaton of rule 182. 相似文献
99.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
100.
A. A. Bulatov 《Algebra and Logic》2006,45(6):371-388
A combinatorial constraint satisfaction problem aims at expressing in unified terms a wide spectrum of problems in various
branches of mathematics, computer science, and AI. The generalized satisfiability problem is NP-complete, but many of its
restricted versions can be solved in a polynomial time. It is known that the computational complexity of a restricted constraint
satisfaction problem depends only on a set of polymorphisms of relations which are admitted to be used in the problem. For
the case where a set of such relations is invariant under some Mal’tsev operation, we show that the corresponding constraint
satisfaction problem can be solved in a polynomial time.
__________
Translated from Algebra i Logika, Vol. 45, No. 6, pp. 655–686, November–December, 2006. 相似文献