全文获取类型
收费全文 | 978篇 |
免费 | 46篇 |
国内免费 | 28篇 |
专业分类
化学 | 7篇 |
晶体学 | 3篇 |
力学 | 6篇 |
综合类 | 20篇 |
数学 | 828篇 |
物理学 | 188篇 |
出版年
2024年 | 1篇 |
2023年 | 33篇 |
2022年 | 40篇 |
2021年 | 53篇 |
2020年 | 47篇 |
2019年 | 26篇 |
2018年 | 19篇 |
2017年 | 24篇 |
2016年 | 32篇 |
2015年 | 18篇 |
2014年 | 36篇 |
2013年 | 41篇 |
2012年 | 14篇 |
2011年 | 33篇 |
2010年 | 22篇 |
2009年 | 66篇 |
2008年 | 76篇 |
2007年 | 56篇 |
2006年 | 62篇 |
2005年 | 26篇 |
2004年 | 29篇 |
2003年 | 36篇 |
2002年 | 53篇 |
2001年 | 41篇 |
2000年 | 33篇 |
1999年 | 53篇 |
1998年 | 29篇 |
1997年 | 24篇 |
1996年 | 15篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1052条查询结果,搜索用时 15 毫秒
81.
Koji Nuida Satoshi Fujitsu Manabu Hagiwara Takashi Kitagawa Hajime Watanabe Kazuto Ogawa Hideki Imai 《Designs, Codes and Cryptography》2009,52(3):339-362
It has been proven that the code lengths of Tardos’s collusion-secure fingerprinting codes are of theoretically minimal order
with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding
studies have revealed. In this article we improve a recent discrete variant of Tardos’s codes, and give a security proof of
our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly
shorter lengths than Tardos’s codes. For example, when c = 8, our code length is about 4.94% of Tardos’s code in a practical setting and about 4.62% in a certain limit case. Our
code lengths for large c are asymptotically about 5.35% of Tardos’s codes.
A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), Bangalore,
India, December 16–20, 2007. 相似文献
82.
83.
本文研究了环F2 uF2上的奇长度的循环码和(1 u)-循环码.运用代数方法,得到了F2 uF2上的循环码和(1 u)-循环码成为自由码的几个充要条件.推广了Bonnecaze(1999)和Aydin(2002)的关于自由码的结果. 相似文献
84.
Beniamin Mounits 《Discrete Mathematics》2008,308(24):6241-6253
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using a linear programming approach. In particular, it is proved that limn→∞β(n,2n)=5/2. We also give a new recursive inequality for β(n,M). 相似文献
85.
王开弘 《数学的实践与认识》2008,38(12):141-144
通过对q元线性码广义Hamming重量dr(·)的分析,应用支撑重量ωs(C)的性质,再次分析了q元[n,k]线性码广义Griesmer界n≥dr+sum from i=1 to k-r[(q-1)dr/qi(qr-1)]. 相似文献
86.
Within the collective coordinate approach to chiral soliton models we suggest that breaking of SU(3) flavor symmetry mainly resides in the baryon wave-functions while the charge operators maintain a symmetric structure. Sizable symmetry breaking in the wave-functions is required to reproduce the observed spacing in the spectrum of the
baryons. The matrix elements of the flavor symmetric charge operators nevertheless yield gA/gV ratios for hyperon beta-decay which agree with the empirical data approximately as well as the successful F&D parameterization of the Cabibbo scheme. Demanding the strangeness component in the nucleon to vanish in the two flavor limit of the model, determines the structure of the singlet axial charge operator and yields the various quark flavor components of the axial charge of the Λ-hyperon. The suggested picture gains support from calculations in a realistic model using pion and vector meson degrees of freedom to build up the soliton. 相似文献
87.
P. Seneviratne 《Discrete Mathematics》2009,309(8):1967-3119
Partial permutation decoding is shown to apply to the first-order Reed-Muller codes R(1,m), where m>4 by finding s-PD-sets for these codes for 2≤s≤4. 相似文献
88.
We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time. 相似文献
89.
With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy. 相似文献
90.
Anton Skidin Alexey Redyuk Olga Shtyrina Michael Fedoruk Alex Shafarenko 《Optics Communications》2011,284(19):4695-4698
We quantify the error statistics and patterning effects in a 5 × 40 Gbit/s WDM RZ-OOK SMF/DCF fibre link using hybrid Raman/EDFA amplification. By extensive use of a numerical model, we determine how the error statistics change with the transmission distance. This knowledge is used as a basis for a constrained coding technique in order to improve the transmission error rate. We propose an adaptive constrained code for mitigation of the patterning effects and demonstrate that this approach can substantially reduce the bit error rate (BER) even for very large values of the channel BER (BER > 10− 1). The proposed technique can be used in combination with forward error correction schemes (FEC) to extend the range of channel BERs that an FEC scheme is effective over. 相似文献