全文获取类型
收费全文 | 1988篇 |
免费 | 365篇 |
国内免费 | 151篇 |
专业分类
化学 | 437篇 |
晶体学 | 6篇 |
力学 | 121篇 |
综合类 | 23篇 |
数学 | 333篇 |
物理学 | 671篇 |
无线电 | 913篇 |
出版年
2024年 | 6篇 |
2023年 | 22篇 |
2022年 | 55篇 |
2021年 | 83篇 |
2020年 | 66篇 |
2019年 | 46篇 |
2018年 | 57篇 |
2017年 | 84篇 |
2016年 | 101篇 |
2015年 | 75篇 |
2014年 | 159篇 |
2013年 | 135篇 |
2012年 | 126篇 |
2011年 | 167篇 |
2010年 | 109篇 |
2009年 | 110篇 |
2008年 | 140篇 |
2007年 | 136篇 |
2006年 | 110篇 |
2005年 | 69篇 |
2004年 | 89篇 |
2003年 | 70篇 |
2002年 | 69篇 |
2001年 | 64篇 |
2000年 | 48篇 |
1999年 | 47篇 |
1998年 | 22篇 |
1997年 | 20篇 |
1996年 | 26篇 |
1995年 | 22篇 |
1994年 | 26篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 7篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 4篇 |
1979年 | 8篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1967年 | 1篇 |
排序方式: 共有2504条查询结果,搜索用时 31 毫秒
1.
To save bandwidth and storage space as well as speed up data transmission, people usually perform lossy compression on images. Although the JPEG standard is a simple and effective compression method, it usually introduces various visually unpleasing artifacts, especially the notorious blocking artifacts. In recent years, deep convolutional neural networks (CNNs) have seen remarkable development in compression artifacts reduction. Despite the excellent performance, most deep CNNs suffer from heavy computation due to very deep and wide architectures. In this paper, we propose an enhanced wide-activated residual network (EWARN) for efficient and accurate image deblocking. Specifically, we propose an enhanced wide-activated residual block (EWARB) as basic construction module. Our EWARB gives rise to larger activation width, better use of interdependencies among channels, and more informative and discriminative non-linearity activation features without more parameters than residual block (RB) and wide-activated residual block (WARB). Furthermore, we introduce an overlapping patches extraction and combination (OPEC) strategy into our network in a full convolution way, leading to large receptive field, enforced compatibility among adjacent blocks, and efficient deblocking. Extensive experiments demonstrate that our EWARN outperforms several state-of-the-art methods quantitatively and qualitatively with relatively small model size and less running time, achieving a good trade-off between performance and complexity. 相似文献
2.
Ratnabali Biswas Kaushik Chowdhury Dharma P. Agrawal 《International Journal of Wireless Information Networks》2006,13(4):303-315
Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. 相似文献
3.
The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance. 相似文献
4.
5.
Based on the beam coherence-polarization (BCP) matrix, the polarization property of coherent and incoherent Gaussian beam combinations is studied in detail. The general expressions for the degree of polarization P of the resulting beam in case of incoherent and coherent combinations are derived. It is shown that P is dependent on the incoherent or coherent combination, propagation distance, separation, azimuth of the polarization plane and numbers of beamlets in general. The irradiance distribution of the resulting beam for the coherent cases depends on the azimuth of the polarization plane of beamlets. However, for the incoherent case it does not. 相似文献
6.
7.
《Journal of Chemical Sciences》2005,117(5):525-531
The silicon atom may increase its coordination number to values greater than four, to form pentacoordinated compounds. It
has been observed experimentally that, in general, pentacoordinated compounds show greater reactivity than tetracoordinated
compounds. In this work, density functional theory is used to calculate the global softness and the condensed softness of
the silicon atom for SiH
n
F4−n
and SiH
n
F
5−n
1−
. The values obtained show that the global and condensed softness are greater in the pentacoordinated compounds than in the
tetracoordinated compounds, a result that explains the enhanced reactivity. If the results are analysed through a local version
of the hard and soft acids and bases principle, it is possible to suggest that in nucleophilic substitution reactions, soft
nucleophiles preferably react with SiH
n
F
5−n
1−
, and hard nucleophiles with SiH
n
F4−n
. 相似文献
8.
从电视节目安全播出的角度出发,探讨如何采取切实有效的措施,确保电视节目的安全优质播出,力争使电视台的安全播出上一个新台阶,主要从播控系统的安全可靠性以及管理措施等方面进行阐述。 相似文献
9.
Markus Hegland Jochen Garcke Vivien Challis 《Linear algebra and its applications》2007,420(2-3):249-275
The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.
The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique. 相似文献
10.
本文研究一类多元Gauss-Weierstrass算子的线性组合加Jacobi型权逼近的性质,利用加权矩量不等式及加权K-泛函、光滑模等工具,建立了这类算子在Lp(1≤p≤∞)空间的正、逆定理和逼近阶的特征刻划. 相似文献