全文获取类型
收费全文 | 1950篇 |
免费 | 330篇 |
国内免费 | 141篇 |
专业分类
化学 | 522篇 |
晶体学 | 2篇 |
力学 | 118篇 |
综合类 | 63篇 |
数学 | 1301篇 |
物理学 | 415篇 |
出版年
2024年 | 4篇 |
2023年 | 45篇 |
2022年 | 121篇 |
2021年 | 101篇 |
2020年 | 110篇 |
2019年 | 91篇 |
2018年 | 86篇 |
2017年 | 92篇 |
2016年 | 121篇 |
2015年 | 78篇 |
2014年 | 147篇 |
2013年 | 170篇 |
2012年 | 99篇 |
2011年 | 121篇 |
2010年 | 97篇 |
2009年 | 123篇 |
2008年 | 100篇 |
2007年 | 102篇 |
2006年 | 84篇 |
2005年 | 75篇 |
2004年 | 65篇 |
2003年 | 57篇 |
2002年 | 48篇 |
2001年 | 33篇 |
2000年 | 33篇 |
1999年 | 22篇 |
1998年 | 33篇 |
1997年 | 33篇 |
1996年 | 20篇 |
1995年 | 10篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 9篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 7篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1970年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有2421条查询结果,搜索用时 15 毫秒
1.
2.
3.
Alessandro Conflitti 《Finite Fields and Their Applications》2003,9(4):423-431
We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field. 相似文献
4.
光突发交换的交换控制策略和光缓存配置 总被引:4,自引:2,他引:2
光突发交换是面向下一代互联网的光交换模式.讨论了异步光突发交换系统的交换控制策略以及相应光缓存的优化配置策略.除了传统预约模式的交换策略,还研究了非预约和改进型预约模式,它们的性能评估由计算机仿真给出.结果表明:在条件相当情况下,改进型预约模式具有最低的丢包率.同时光缓存的配置对上述几类交换控制策略的性能都有很大影响,仿真结果指出:光缓存的粒度对系统性能具有重要影响,所讨论的几类交换模式都存在最佳时延粒度,研究结果对光交换矩阵的设计有指导意义. 相似文献
5.
6.
Viviane Van Hoof Hugo Cluckers Vera Verhaeghe An Hennebel Marleen Truyens Edith Van Loock Pierre Rombouts Dirk Maes Jan Van Elven Katrien Lesage Mark Flothmann Lieve Nijs Filip Colpaert Werner Vercammen Dominique Bolain 《Accreditation and quality assurance》2004,10(1-2):55-59
In response to a change of the Belgian National Directives whereby hospital laboratories became responsible for all point-of-care testing (POCT) performed within hospital walls a standardized and automated POC glucose-testing system was implemented in our hospital. The system consists of 50 AccuCheck Inform instruments (Roche Diagnostics, Vilvoorde, Belgium), 50 docking stations, a DataCare Server, and connections to the medical laboratory information system (MOLIS, Sysmex, Barchon, Belgium) and to the hospital information system. Implementation involved many parties and extensive preparation and communication. Key issues were bar-coded patient and user identification, training, and responsibilities. One year after the hospital wide implementation of this system the quality of POC glucose testing has significantly increased, thereby improving patient safety. This study describes a stepwise change over involving the medical laboratory and with a focus on hands-on quality.Presented at the ninth conference on Quality in the Spotlight, 18–19 March 2004, Antwerp, Belgium. 相似文献
7.
Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices. 相似文献
8.
两相同部件温贮备可修的人机系统解的性质分析 总被引:5,自引:1,他引:4
郭卫华 《数学的实践与认识》2003,33(7):88-95
本文首先用强连续算子半群理论证明了两相同部件温贮备可修的人机系统动态非负解的存在唯一性 ,然后证明了 0是系统主算子的本征值 ,并得到 0本征值对应的本征向量是正的 ,从而系统存在稳态正解 . 相似文献
9.
Liang-gen Hu 《应用数学学报(英文版)》2007,23(2):281-288
In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic. 相似文献
10.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献