全文获取类型
收费全文 | 42979篇 |
免费 | 4556篇 |
国内免费 | 2339篇 |
专业分类
电工技术 | 3252篇 |
技术理论 | 2篇 |
综合类 | 3465篇 |
化学工业 | 6728篇 |
金属工艺 | 2438篇 |
机械仪表 | 2725篇 |
建筑科学 | 3426篇 |
矿业工程 | 1242篇 |
能源动力 | 1175篇 |
轻工业 | 3729篇 |
水利工程 | 842篇 |
石油天然气 | 2249篇 |
武器工业 | 469篇 |
无线电 | 5213篇 |
一般工业技术 | 4480篇 |
冶金工业 | 1771篇 |
原子能技术 | 760篇 |
自动化技术 | 5908篇 |
出版年
2024年 | 258篇 |
2023年 | 839篇 |
2022年 | 1732篇 |
2021年 | 2200篇 |
2020年 | 1692篇 |
2019年 | 1369篇 |
2018年 | 1480篇 |
2017年 | 1587篇 |
2016年 | 1432篇 |
2015年 | 1874篇 |
2014年 | 2326篇 |
2013年 | 2571篇 |
2012年 | 2918篇 |
2011年 | 3023篇 |
2010年 | 2744篇 |
2009年 | 2628篇 |
2008年 | 2635篇 |
2007年 | 2439篇 |
2006年 | 2373篇 |
2005年 | 2025篇 |
2004年 | 1354篇 |
2003年 | 1258篇 |
2002年 | 1337篇 |
2001年 | 1192篇 |
2000年 | 950篇 |
1999年 | 790篇 |
1998年 | 477篇 |
1997年 | 471篇 |
1996年 | 432篇 |
1995年 | 297篇 |
1994年 | 273篇 |
1993年 | 203篇 |
1992年 | 191篇 |
1991年 | 109篇 |
1990年 | 82篇 |
1989年 | 79篇 |
1988年 | 64篇 |
1987年 | 44篇 |
1986年 | 31篇 |
1985年 | 17篇 |
1984年 | 18篇 |
1983年 | 15篇 |
1982年 | 13篇 |
1981年 | 9篇 |
1980年 | 11篇 |
1979年 | 4篇 |
1959年 | 6篇 |
1951年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1, … , sm among a set of n participants. In this paper, we propose an ideal linear multi-secret sharing scheme, based on monotone span programs, where each subset of the set of participants may have the associated secret. Our scheme can be used to meet the security requirement in practical applications, such as secure group communication and privacy preserving data mining etc. We also prove that our proposed scheme satisfies the definition of a perfect multi-secret sharing scheme. 相似文献
993.
Vegetation structure retrieval accuracies from spaceborne Geoscience Laser Altimeter System (GLAS) on the Ice, Cloud and land Elevation Satellite (ICESat) data are affected by surface topography, background noise and sensor saturation. This study uses a physical approach to remove surface topography effect from lidar returns to retrieve vegetation height from ICESat/GLAS data over slope terrains. Slope-corrected vegetation heights from ICESat/GLAS data were compared to airborne Laser Vegetation Imaging Sensor (LVIS) (20 m footprint size) and small-footprint lidar data collected in White Mountain National Forest, NH. Impact of slope on LVIS vegetation height estimates was assessed by comparing LVIS height before and after slope correction with small-footprint discrete-return lidar and field data.Slope-corrected GLAS vegetation heights match well with 98 percentile heights from small-footprint lidar (R2 = 0.77, RMSE = 2.2 m) and top three LVIS mean (slope-corrected) heights (R2 = 0.64, RMSE = 3.7 m). Impact of slope on LVIS heights is small, however, comparison of LVIS heights (without slope correction) with either small footprint lidar or field data indicates that our scheme improves the overall LVIS height accuracy by 0.4-0.7 m in this region. Vegetation height can be overestimated by 3 m over a 15° slope without slope correction. More importantly, both slope-corrected GLAS and LVIS height differences are independent of slope. Our results demonstrate the effectiveness of the physical approach to remove surface topography from large footprint lidar data to improve accuracy of maximum vegetation height estimates.GLAS waveforms were compared to aggregated LVIS waveforms in Bartlett Experimental Forest, NH, to evaluate the impact of background noise and sensor saturation on vegetation structure retrievals from ICESat/GLAS. We found that GLAS waveforms with sensor saturation and low background noise match well with aggregated LVIS waveforms, indicating these waveforms capture vertical vegetation structure well. However, waveforms with large noise often lead to mismatched waveforms with LVIS and underestimation of waveform extent and vegetation height. These results demonstrate the quality of ICESat/GLAS vegetation structure estimates. 相似文献
994.
Knowledge discovery has been demonstrated as an effective approach to extracting knowledge from existing data sources for soil classification and mapping. Soils are spatial entities with fuzzy boundaries. Our study focuses on the uncertainty associated with class assignments when classifying such entities. We first present a framework of knowledge representation for categorizing spatial entities with fuzzy boundaries. Three knowledge discovery methods are discussed next for extracting knowledge from data sources. The methods were designed to maintain information for modeling the uncertainties associated with class assignments when using the extracted knowledge for classification. In a case study of knowledge discovery from an area-class soil map, all three methods were able to extract knowledge embedded in the map to classify soils at accuracies comparable to that of the original map. The methods were also able to capture membership gradations and helped to identify transitional zones and areas of potential problems on the source map when measures of uncertainties were mapped. Among the three methods compared, a fuzzy decision tree approach demonstrated the best performance in modeling the transitions between soil prototypes. 相似文献
995.
Yuan-sheng Luo Yong Qi Di HouLin-feng Shen Ying ChenXiao Zhong 《Computer Communications》2011,34(9):1137-1144
Many works have been carried out to find the efficient algorithms for QoS-aware service composition in recent years. Nevertheless, on one hand, some of these works only consider the local QoS attributes in Web services composition; on the other hand, some ideas derived from QoS selection algorithms for network routing are directly applied in service composition without any adaption. A service composition model with end-to-end QoS constraints has been presented in this paper. An improved heuristics HCE based on the observation of characteristic of end-to-end service composition is proposed as a novel solution. Simulation results reveal the better performance of proposed heuristic compared to the other two heuristics, HMCOP and generic CE algorithm. 相似文献
996.
Despite the large amount of work devoted in recent years to the problem of non‐rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult to match against than others. In particular, we make a connection between the symmetry of a given shape and the stability of any method used to match it while optimizing a given distortion measure. We analyze two commonly used classes of methods in deformable shape matching, and show that the stability of both types of techniques can be captured by the appropriate notion of a condition number. We also provide a practical way to estimate the shape condition number and show how it can be used to guide the selection of landmark correspondences between shapes. Thus we shed some light on the reasons why general shape matching remains difficult and provide a way to detect and mitigate such difficulties in practice. 相似文献
997.
3D shape retrieval by Poisson histogram 总被引:1,自引:0,他引:1
998.
To reduce the curse of dimensionality arising from nonparametric estimation procedures for multiple nonparametric regression, in this paper we suggest a simulation-based two-stage estimation. We first introduce a simulation-based method to decompose the multiple nonparametric regression into two parts. The first part can be estimated with the parametric convergence rate and the second part is small enough so that it can be approximated by orthogonal basis functions with a small trade-off parameter. Then the linear combination of the first and second step estimators results in a two-stage estimator for the multiple regression function. Our method does not need any specified structural assumption on the regression function and it is proved that the newly proposed estimation is always consistent even if the trade-off parameter is designed to be small. Thus when the common nonparametric estimator such as local linear smoothing collapses because of the curse of dimensionality, our estimator still works well. 相似文献
999.
Rapid scalar value classification and volume clipping for?interactive 3D medical image visualization
In many clinical scenarios, medical data visualization and interaction are important to physicians for exploring inner anatomical
structures and extracting meaningful diagnostic information. Real-time high-quality volume rendering, artifact-free clipping,
and rapid scalar value classification are important techniques employed in this process. Unfortunately, in practice, it is
still difficult to achieve an optimal balance. In this paper, we present some strategies to address this issue, which are
based on the calculation of segment-based post color attenuation and dynamic ray–plane intersection (RPI) respectively. When
implemented within our visualization system, the new classification algorithm can deliver real-time performance while avoiding
the “color over-accumulation” artifacts suffered by the commonly used acceleration algorithms that employ pre-integrated classification.
Our new strategy can achieve an optimized balance between image quality and classification speed. Next, the RPI algorithm
is used with opacity adjustment technique to effectively remove the “striping” artifacts on the clipping plane caused by the
nonuniform integration length. Furthermore, we present techniques for multiple transfer function (TF) based anatomical feature
enhancement and “keyhole” based endoscopic inner structure view. Finally, the algorithms are evaluated subjectively by radiologists
and quantitatively compared using image power spectrum analysis. 相似文献
1000.