全文获取类型
收费全文 | 2202篇 |
免费 | 168篇 |
国内免费 | 114篇 |
专业分类
化学 | 34篇 |
力学 | 14篇 |
综合类 | 14篇 |
数学 | 425篇 |
物理学 | 200篇 |
综合类 | 1797篇 |
出版年
2024年 | 4篇 |
2023年 | 21篇 |
2022年 | 43篇 |
2021年 | 57篇 |
2020年 | 47篇 |
2019年 | 39篇 |
2018年 | 36篇 |
2017年 | 45篇 |
2016年 | 52篇 |
2015年 | 51篇 |
2014年 | 156篇 |
2013年 | 81篇 |
2012年 | 154篇 |
2011年 | 188篇 |
2010年 | 182篇 |
2009年 | 167篇 |
2008年 | 173篇 |
2007年 | 225篇 |
2006年 | 199篇 |
2005年 | 152篇 |
2004年 | 106篇 |
2003年 | 72篇 |
2002年 | 62篇 |
2001年 | 38篇 |
2000年 | 34篇 |
1999年 | 14篇 |
1998年 | 23篇 |
1997年 | 15篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
排序方式: 共有2484条查询结果,搜索用时 15 毫秒
1.
2.
设f是非常数亚纯函数,g是f的线性微分多项式.a和b是f的两个不同的小函数.本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f(k)(k≥1)IM分担a和b,b-a≠Peλz,测f≡g. 相似文献
3.
Indrajit Lahiri 《Journal of Mathematical Analysis and Applications》2002,271(1):206-216
In this paper we prove a uniqueness theorem for meromorphic functions sharing three values with some weight which improves some known results. 相似文献
4.
廊坊市“文化信息资源共享工程”建设分析与研究 总被引:1,自引:1,他引:0
在介绍廊坊市“文化信息资源共享工程”建设现状基础上,阐述了资源共享的意义,分析了资源共享存在的问题,研究了相应的解决方法。 相似文献
5.
一种小波域音频信息隐藏方法 总被引:1,自引:0,他引:1
提出了一种基于量化的小波域音频隐藏算法,将保密语音隐藏到载体音频中.为提高隐藏重和保密语音传输的安全性,对保密语音进行了小波域压缩编码和m序列的扩频调制,生成待隐藏的比特序列;通过量化方法,将编码和调制后的保密语音隐藏到载体音频的小波系数中;保密语音的恢复过程不需要使用原始音频、仿真结果表明,隐藏有保密语音的载体音频听觉质量没有明显下降,提取的保密语音感知质量较好;该算法对重量化、加噪、低通滤波等攻击均有良好的鲁棒性. 相似文献
6.
黄琼霞 《科技情报开发与经济》2007,17(15):45-46
论述了图书馆联机联合编目的现状,探讨了联机联合编目与资源共享的意义,提出了新形势下实现联机联合编目与资源共享的若干对策。 相似文献
7.
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where
a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The
result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed
communication networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
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.
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and
service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform
acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the Mt/Mt/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion
of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis
generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process
are known. 相似文献