全文获取类型
收费全文 | 30269篇 |
免费 | 4097篇 |
国内免费 | 2239篇 |
专业分类
化学 | 2916篇 |
晶体学 | 95篇 |
力学 | 1529篇 |
综合类 | 462篇 |
数学 | 14267篇 |
物理学 | 6652篇 |
无线电 | 10684篇 |
出版年
2024年 | 65篇 |
2023年 | 326篇 |
2022年 | 523篇 |
2021年 | 663篇 |
2020年 | 785篇 |
2019年 | 804篇 |
2018年 | 774篇 |
2017年 | 1017篇 |
2016年 | 1099篇 |
2015年 | 1077篇 |
2014年 | 1668篇 |
2013年 | 2241篇 |
2012年 | 1736篇 |
2011年 | 2060篇 |
2010年 | 1681篇 |
2009年 | 1883篇 |
2008年 | 2080篇 |
2007年 | 2128篇 |
2006年 | 1895篇 |
2005年 | 1651篇 |
2004年 | 1355篇 |
2003年 | 1407篇 |
2002年 | 1183篇 |
2001年 | 1015篇 |
2000年 | 952篇 |
1999年 | 858篇 |
1998年 | 702篇 |
1997年 | 609篇 |
1996年 | 461篇 |
1995年 | 325篇 |
1994年 | 279篇 |
1993年 | 194篇 |
1992年 | 139篇 |
1991年 | 139篇 |
1990年 | 104篇 |
1989年 | 81篇 |
1988年 | 72篇 |
1987年 | 53篇 |
1986年 | 48篇 |
1985年 | 88篇 |
1984年 | 66篇 |
1983年 | 33篇 |
1982年 | 55篇 |
1981年 | 41篇 |
1980年 | 29篇 |
1979年 | 39篇 |
1978年 | 24篇 |
1977年 | 24篇 |
1976年 | 19篇 |
1975年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
32.
In the present paper, some new almost fixed point theorems and fixed point theorems for lower semicontinuous type multivalued mappings are obtained in metrizable H-spaces. 相似文献
33.
A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series. 相似文献
34.
Ashish Goel Monika R. Henzinger Serge Plotkin Eva Tardos 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):314-332
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum. 相似文献
35.
36.
介绍了一种基于人工神经网络(ANN)的声目标识别系统,概述了用MATLAB专用工具箱对神经网络权值进行训练及仿真的过程,叙述了ANN目标识别系统的数字信号处理器(DSP)实时实现过程,并着重分析定点实现过程中程序变量的定标、非线性运算的实现、溢出的处理等关键步骤.对不同字长的识别结果进行比较表明,基于定点实时实现的系统数据保持很高的精度,可以得到与浮点处理相同的识别率. 相似文献
37.
38.
39.
给出了Banach空间的一个增算子不动点定理,将这一定理应用到Banach空间的积分-微分方程,给出了一类积分-微分方程的连续可微最大解和连续可微最小解的存在性定理. 相似文献
40.
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献