全文获取类型
收费全文 | 177830篇 |
免费 | 16970篇 |
国内免费 | 12306篇 |
专业分类
化学 | 95151篇 |
晶体学 | 1860篇 |
力学 | 12111篇 |
综合类 | 679篇 |
数学 | 43577篇 |
物理学 | 53728篇 |
出版年
2024年 | 353篇 |
2023年 | 2074篇 |
2022年 | 3712篇 |
2021年 | 3989篇 |
2020年 | 4223篇 |
2019年 | 4015篇 |
2018年 | 13275篇 |
2017年 | 12803篇 |
2016年 | 10610篇 |
2015年 | 5764篇 |
2014年 | 6379篇 |
2013年 | 8143篇 |
2012年 | 12920篇 |
2011年 | 19430篇 |
2010年 | 11988篇 |
2009年 | 12021篇 |
2008年 | 12961篇 |
2007年 | 14288篇 |
2006年 | 5806篇 |
2005年 | 5941篇 |
2004年 | 5126篇 |
2003年 | 4836篇 |
2002年 | 3635篇 |
2001年 | 2476篇 |
2000年 | 2241篇 |
1999年 | 2217篇 |
1998年 | 1938篇 |
1997年 | 1708篇 |
1996年 | 1761篇 |
1995年 | 1485篇 |
1994年 | 1315篇 |
1993年 | 1095篇 |
1992年 | 953篇 |
1991年 | 841篇 |
1990年 | 703篇 |
1989年 | 560篇 |
1988年 | 436篇 |
1987年 | 395篇 |
1986年 | 392篇 |
1985年 | 308篇 |
1984年 | 231篇 |
1983年 | 189篇 |
1982年 | 167篇 |
1981年 | 116篇 |
1980年 | 105篇 |
1979年 | 70篇 |
1978年 | 56篇 |
1973年 | 42篇 |
1914年 | 45篇 |
1909年 | 41篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
41.
Curtis T. Mcmullen 《Acta Mathematica》2003,191(2):191-223
42.
We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed
product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally
compact groups on -algebras.
Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002
This work is partially supported by Hong Kong RGC Direct Grant. 相似文献
43.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
44.
Harish C. Bahl Stanley Zionts 《The Journal of the Operational Research Society》1987,38(12):1141-1148
Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method. 相似文献
45.
Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K5‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K3,3), M*(K5)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5), M*(K5)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
46.
本文是[1,12]的继续,研究描述架中概念的结构;本文讨论后半部分,内容涉及概念内涵与外延的转换,清晰关系的内投影与内变换,概念的结构*以及有关问题的注记。 相似文献
47.
48.
将自卫机制加入OOP成为AOP以提高CORBA中软件的强健性和防卫能力,在CORBA这个异构环境中,一个对象申请服务之后就需等待,如果应答迟迟不到则有可能永远等待下去,为避免这种现象的产生和蔓延,在客户和服务方的行为中加入超时机制(timeout mecha-nism)并采用利己或利他策略,使得对象可独立地根据当前环境和时间决定下一步骤,将这种在协作者失败的情况下仍能生存的对象称为自卫智能体,加入白卫智能体的CORBA称为CORBA~( ),由于智能体可在任何条件下生存,CORBA~( )可为用户提供可靠的服务,也就能实现CORBA~( )中软件构成的强健性。 相似文献
49.
Christian Prins 《The Journal of the Operational Research Society》1994,45(6):611-623
Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints. 相似文献
50.