全文获取类型
收费全文 | 1220篇 |
免费 | 74篇 |
国内免费 | 29篇 |
专业分类
化学 | 209篇 |
力学 | 1篇 |
综合类 | 8篇 |
数学 | 816篇 |
物理学 | 289篇 |
出版年
2024年 | 1篇 |
2023年 | 19篇 |
2022年 | 27篇 |
2021年 | 21篇 |
2020年 | 19篇 |
2019年 | 12篇 |
2018年 | 24篇 |
2017年 | 19篇 |
2016年 | 15篇 |
2015年 | 8篇 |
2014年 | 50篇 |
2013年 | 79篇 |
2012年 | 49篇 |
2011年 | 85篇 |
2010年 | 78篇 |
2009年 | 116篇 |
2008年 | 132篇 |
2007年 | 98篇 |
2006年 | 109篇 |
2005年 | 59篇 |
2004年 | 46篇 |
2003年 | 17篇 |
2002年 | 31篇 |
2001年 | 21篇 |
2000年 | 15篇 |
1999年 | 29篇 |
1998年 | 39篇 |
1997年 | 27篇 |
1996年 | 31篇 |
1995年 | 12篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1985年 | 6篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1323条查询结果,搜索用时 15 毫秒
1.
The drawbacks of our earlier report of preparing fuel cell catalyst arrays by borohydride reduction of inkjet prepared arrays of metal salts are discussed along with the need for inclusion of state-of-the-art metrics in all array screening. An alternative method for screening of hydrogen/air cathode catalysts, direct methanol fuel cell (DMFC) anode catalysts, and catalyst loading studies is provided. State-of-the-art Johnson Matthey catalysts were used in control experiments to demonstrate the utility of the array fuel cell for high throughput screening of fuel cell catalysts in the 3-4 mg/cm2 range. This report lays out hard learned rules for high throughput screening and demonstrates that the array fuel cell can be used for very precise screening of libraries of membrane electrode assembly (MEA) components without the pitfalls discussed in the introduction. 相似文献
2.
HE Guang-Qiang ZENG Gui-Hua 《理论物理通讯》2006,46(1):61-64
A quantum encryption protocol based on Gaussian-modulated continuous variable EPR correlations is proposed. The security is guaranteed by continuous variable EPR entanglement correlations produced by nondegenerate optical parametric amplifier (NOPA). For general beam splitter eavesdropping strategy, the mutual information I(α, ε) between Alice and Eve is caJculated by employing Shannon information theory. Finally the security analysis is presented. 相似文献
3.
Jesús Vázquez 《Tetrahedron letters》2006,47(10):1657-1661
Use of a semicarbazide resin for the solid-phase preparation of peptide ketones and aldehyde led to optimal results in terms of both purity of the final product and overall yield. This resin was prepared without complication by activation of the commercial available aminomethyl polystyrene with CDI at room temperature, followed by treatment with tert-butyl carbazate. Furthermore, the TNBSA colorimetric assay has been adapted for checking the incorporation of the carbonyl moiety onto hydrazine-based resins. 相似文献
4.
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... 相似文献
5.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
6.
Montgomery Multiplication in GF(2k) 总被引:8,自引:0,他引:8
We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large. 相似文献
7.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
8.
In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly
as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields
basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative
difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis
[3] for all n≥ t ≥ 2. 相似文献
9.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
10.
Chen Hao 《中国科学A辑(英文版)》2006,49(5):715-720
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p
m) (any positive integer m) with the period 3n (n and p
m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura
algorithm, we can determine the linear complexity of any sequence over GF(p
m) with the period 3n (n and p
m
− 1 are coprime) more efficiently. 相似文献