全文获取类型
收费全文 | 974篇 |
免费 | 180篇 |
国内免费 | 27篇 |
专业分类
化学 | 156篇 |
力学 | 28篇 |
综合类 | 38篇 |
数学 | 726篇 |
物理学 | 233篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 39篇 |
2021年 | 78篇 |
2020年 | 57篇 |
2019年 | 55篇 |
2018年 | 40篇 |
2017年 | 52篇 |
2016年 | 64篇 |
2015年 | 36篇 |
2014年 | 72篇 |
2013年 | 63篇 |
2012年 | 50篇 |
2011年 | 56篇 |
2010年 | 57篇 |
2009年 | 52篇 |
2008年 | 47篇 |
2007年 | 59篇 |
2006年 | 55篇 |
2005年 | 34篇 |
2004年 | 25篇 |
2003年 | 25篇 |
2002年 | 26篇 |
2001年 | 22篇 |
2000年 | 19篇 |
1999年 | 12篇 |
1998年 | 15篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1984年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有1181条查询结果,搜索用时 500 毫秒
1.
本文是文[1-7]的继续,研究变权综合问题,从确定变权的经验公式入手引出了变权原理,给出了变权的公理化定义,讨论了与之有关的均衡函数及其梯度向量。 相似文献
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.
关联规则是数据挖掘中的重要研究内容之一,对在事务数据库不变,只对最小支持度和最小可信度进行改变的情况下,针对关联规则的维护问题,设计了一个增量式更新的改进算法AIUA。 相似文献
5.
6.
基于粗糙集理论的知识约简及应用实例 总被引:5,自引:0,他引:5
在保持分类能力不变的前提下 ,通过利用粗糙集理论中的知识约简方法 ,在保护知识库分类不变的条件下 ,删除其中不相关或不重要的知识 ,从而导出问题的决策 .利用基于决策表的粗糙集模型算法 ,实例分析如何数字化表示决策表 ,并对其进行属性约简和属性值的约简 ,从而提取决策规则 . 相似文献
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.
Bernhard Heinemann 《Mathematical Logic Quarterly》1997,43(2):203-215
Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated. 相似文献
9.
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. 相似文献
10.
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. 相似文献