全文获取类型
收费全文 | 846篇 |
免费 | 253篇 |
国内免费 | 23篇 |
专业分类
化学 | 99篇 |
晶体学 | 4篇 |
力学 | 27篇 |
综合类 | 62篇 |
数学 | 329篇 |
物理学 | 601篇 |
出版年
2024年 | 3篇 |
2023年 | 18篇 |
2022年 | 59篇 |
2021年 | 75篇 |
2020年 | 45篇 |
2019年 | 30篇 |
2018年 | 24篇 |
2017年 | 36篇 |
2016年 | 39篇 |
2015年 | 27篇 |
2014年 | 63篇 |
2013年 | 61篇 |
2012年 | 42篇 |
2011年 | 69篇 |
2010年 | 71篇 |
2009年 | 49篇 |
2008年 | 60篇 |
2007年 | 62篇 |
2006年 | 65篇 |
2005年 | 56篇 |
2004年 | 28篇 |
2003年 | 20篇 |
2002年 | 35篇 |
2001年 | 12篇 |
2000年 | 15篇 |
1999年 | 5篇 |
1998年 | 15篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有1122条查询结果,搜索用时 46 毫秒
1.
深挖高职院校公选课“生活中的化学”的育人元素,精心设计教学内容,运用课堂主题辩论、趣味生活实验的设计与展示、探秘生活中的化学等理论知识传授与课内外实践相结合的教学方式,实现全过程育人,充分展现了公选课在立德树人方面的价值。 相似文献
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.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
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.
工程施工中运输网络优化方案 总被引:5,自引:0,他引:5
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 . 相似文献
6.
本文根据国家关键技术管理工作的特点,本着提高决策质量,满足用户要求的原则,分析和设计国家关键技术管理计算机系统,为高层次宏观决策提供丰富的信息支持。 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
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. 相似文献
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. 相似文献