全文获取类型
收费全文 | 14004篇 |
免费 | 1454篇 |
国内免费 | 363篇 |
专业分类
化学 | 1219篇 |
晶体学 | 12篇 |
力学 | 262篇 |
综合类 | 202篇 |
数学 | 2528篇 |
物理学 | 1719篇 |
无线电 | 9879篇 |
出版年
2024年 | 25篇 |
2023年 | 131篇 |
2022年 | 319篇 |
2021年 | 519篇 |
2020年 | 465篇 |
2019年 | 340篇 |
2018年 | 328篇 |
2017年 | 534篇 |
2016年 | 625篇 |
2015年 | 665篇 |
2014年 | 1123篇 |
2013年 | 1078篇 |
2012年 | 1043篇 |
2011年 | 1039篇 |
2010年 | 654篇 |
2009年 | 659篇 |
2008年 | 830篇 |
2007年 | 872篇 |
2006年 | 720篇 |
2005年 | 662篇 |
2004年 | 597篇 |
2003年 | 517篇 |
2002年 | 348篇 |
2001年 | 302篇 |
2000年 | 262篇 |
1999年 | 193篇 |
1998年 | 144篇 |
1997年 | 127篇 |
1996年 | 121篇 |
1995年 | 115篇 |
1994年 | 78篇 |
1993年 | 64篇 |
1992年 | 51篇 |
1991年 | 45篇 |
1990年 | 28篇 |
1989年 | 22篇 |
1988年 | 29篇 |
1987年 | 20篇 |
1986年 | 18篇 |
1985年 | 19篇 |
1984年 | 26篇 |
1983年 | 10篇 |
1982年 | 13篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1973年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 796 毫秒
921.
William DallariMarco Scotto Marco Allione Elena SamoylovaFrancesca Pignatelli Roberto CingolaniAthanassia Athanassiou Alberto Diaspro 《Microelectronic Engineering》2011,88(12):3466-3469
Three dimensional optical data storage is one of the most promising tools to respond to the always growing demand for high data storage capacity. Here, we focused a femtosecond laser source by means of a confocal microscope onto different transparent recording media. The purpose of the study is to probe the capability of the system to independently address different data layers within the storage medium achieving thus three dimensional data storage. We demonstrated the possibility to write superposed independent layers of data due to either multiphoton excitation or to local optical breakdown and the performances observed in the different types of media used are compared. 相似文献
922.
Natalia Irishina Diego lvarez Oliver Dorn Miguel Moscoso 《Mathematical and Computer Modelling》2009,50(5-6):743
In this paper we investigate the performance of a shape-reconstruction technique as tested on the ‘Marseille data’. This approach, which is based on a level set technique, offers several advantages compared to other approaches, as for example well-defined boundaries and the incorporation of an intrinsic regularization in the form of a priori assumptions regarding the general structures in the medium. The level set strategy (which is an implicit representation of the shapes) frees us from topological restrictions during this reconstruction process. Our algorithm is aiming at, not only detecting the objects, but simultaneously determining their approximate locations, sizes and dielectric properties. The numerical experiments show the utility of this method. 相似文献
923.
Masayoshi Kamiya Hiroaki Ikeda Shigenobu Shinohara 《International Journal of Communication Systems》2001,14(5):477-485
This paper describes a low‐cost version of a full‐duplex optical fibre analogue/digital data transmission link whose practical implementation is simplified by using a pair of laser diodes, each having a built‐in photodiode for monitoring the laser output power, and its application to vibration test data transmission. The transmission link sends digital data of up to 9600 bps in one direction, and analogue data of DC to 100 kHz and image data specified by an NTSC colour video signal in the opposite direction, all at the same time through one GI optical fibre. Being simple in configuration and stable against noise, this type of link has a variety of applications within factory, home and offices. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
924.
We study detection and imaging of small reflectors in heavy clutter, using an array of transducers that emits and receives sound waves. Heavy clutter means that multiple scattering of the waves in the heterogeneous host medium is strong and overwhelms the arrivals from the small reflectors. Building on the adaptive time-frequency filter of [Borcea et al, SIIMS 2011;4(3)], we propose a robust method for detecting the direction of arrival of the direct echoes from the small reflectors, and suppressing the unwanted clutter backscatter. This improves the resolution of imaging. We illustrate the performance of the method with realistic numerical simulations in a non-destructive testing setup. 相似文献
925.
《Journal of computational and graphical statistics》2013,22(4):656-672
Incomplete data models typically involve strong untestable assumptions about the missing data distribution. As inference may critically depend on them, the importance of sensitivity analysis is well recognized. Molenberghs, Kenward, and Goetghebeur proposed a formal frequentist approach to sensitivity analysis which distinguishes ignorance due to unintended incompleteness from imprecision due to finite sampling by design. They combine both sources of variation into uncertainty. This article develops estimation tools for ignorance and uncertainty concerning regression coefficients in a complete data model when some of the intended outcome values are missing. Exhaustive enumeration of all possible imputations for the missing data requires enormous computational resources. In contrast, when the boundary of the occupied region is of greatest interest, reasonable computational efficiency may be achieved via the imputation towards directional extremes (IDE) algorithm. This is a special imputation method designed to mark the boundary of the region by maximizing the direction of change of the complete data estimator caused by perturbations to the imputed outcomes. For multi-dimensional parameters, a dimension reduction approach is considered. Additional insights are obtained by considering structures within the region, and by introducing external knowledge to narrow the boundary to useful proportions. Special properties hold for the generalized linear model. Examples from a Kenyan HIV study will illustrate the points. 相似文献
926.
基于加权相似性的BIRCH聚类算法 总被引:1,自引:0,他引:1
BIRCH方法是一个集成的层次聚类方法.它克服了凝聚层次聚类方法所面临的两个难点:可伸缩性和不能撤销前一步工作的问题.基于BIRCH聚类的多阶段聚类算法思想,结合基于权重的欧式距离度量和基于划分的K-means算法,提出了一种基于加权相似性的BIRCH聚类方法,并将方法应用在时间序列的气象数据分析中. 相似文献
927.
We consider the application of a four‐dimensional variational data assimilation method to a numerical model, which employs local mesh refinement to improve its solution. We focus on structured meshes where a high‐resolution grid is embedded in a coarser resolution one, which covers the entire domain. The formulation of the nested variational data assimilation algorithm was derived in a preliminary work (Int. J. Numer. Meth. Fluids 2008; under review). We are interested here in complementary theoretical aspects. We present first a model for the multi‐grid background error covariance matrix. Then, we propose a variant of our algorithms based on the addition of control variables in the inter‐grid transfers in order to allow for a reduction of the errors linked to the interactions between the grids. These formulations are illustrated and discussed in the test case experiment of a 2D shallow water model. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
928.
裴朝志 《电子信息对抗技术》2011,26(6):82-86
数据处理软件的设计方法,由于受到处理对象的多样性和处理算法的复杂性两类问题的困扰,难以控制软件开发的效率与成本。以处理对象通用性、处理算法灵活性和软件模块可配置性为设计准则,结合已有的标准设计模式,提出一种可复用数据处理软件设计方法。它能有效地解决软件设计开发过程中所遇到的两类复杂性问题,同时也为工程中数据处理软件的设计提供参考。 相似文献
929.
In this article, the depth‐averaged transport equations are written in a new way so that it is possible to solve the transport equations for very small water depths. Variables are interpolated into the cell face with two different schemes and, the schemes are compared in terms of computational cost and accuracy. The bed source terms are computed using two different assumptions. The effect of these assumptions on numerical simulations is then investigated. Solutions of transport equations on different types of unstructured triangular grids are compared and, an appropriate choice of grid is suggested. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
930.
This paper presents a feasible direction algorithm for the minimization of a pseudoconvex function over a smooth, compact, convex set. We establish that each cluster point of the generated sequence is an optimal solution of the problem without introducing anti-jamming procedures. Each iteration of the algorithm involves as subproblems only one line search for a zero of a continuously differentiable convex function and one univariate function minimization on a compact interval. 相似文献