全文获取类型
收费全文 | 6737篇 |
免费 | 895篇 |
国内免费 | 333篇 |
专业分类
电工技术 | 221篇 |
技术理论 | 1篇 |
综合类 | 318篇 |
化学工业 | 683篇 |
金属工艺 | 118篇 |
机械仪表 | 244篇 |
建筑科学 | 261篇 |
矿业工程 | 49篇 |
能源动力 | 678篇 |
轻工业 | 286篇 |
水利工程 | 154篇 |
石油天然气 | 101篇 |
武器工业 | 53篇 |
无线电 | 732篇 |
一般工业技术 | 434篇 |
冶金工业 | 109篇 |
原子能技术 | 295篇 |
自动化技术 | 3228篇 |
出版年
2024年 | 8篇 |
2023年 | 41篇 |
2022年 | 124篇 |
2021年 | 133篇 |
2020年 | 105篇 |
2019年 | 117篇 |
2018年 | 153篇 |
2017年 | 274篇 |
2016年 | 309篇 |
2015年 | 328篇 |
2014年 | 433篇 |
2013年 | 385篇 |
2012年 | 455篇 |
2011年 | 517篇 |
2010年 | 437篇 |
2009年 | 459篇 |
2008年 | 466篇 |
2007年 | 377篇 |
2006年 | 430篇 |
2005年 | 444篇 |
2004年 | 406篇 |
2003年 | 377篇 |
2002年 | 262篇 |
2001年 | 156篇 |
2000年 | 126篇 |
1999年 | 105篇 |
1998年 | 78篇 |
1997年 | 77篇 |
1996年 | 54篇 |
1995年 | 47篇 |
1994年 | 52篇 |
1993年 | 44篇 |
1992年 | 31篇 |
1991年 | 33篇 |
1990年 | 15篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 10篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1959年 | 2篇 |
排序方式: 共有7965条查询结果,搜索用时 31 毫秒
71.
油田采出水的精细过滤技术 总被引:4,自引:0,他引:4
低渗透油层渗透率〈0.1μm^2,孔喉半径小,容易被堵塞,对注入水质要求高,目前缺乏对含有原油、化学添加剂、粉质颗粒和无机盐的油田采出水适应性强的精细过滤设备。本文介绍了油田采出水回注精细过滤材料试验和采用旋流配水、脉冲水流反洗技术的改性聚四氟乙烯滤芯过滤装置的小试和中试研究情况,研究开发的改性聚四氟乙烯精细过滤装置,当进水含油量〈20mg/L、悬浮物含量〈20mg/L时,出水达到了(《碎屑岩油藏注水水质推荐指标》(SY5329-94)规定的A1级注水水质标准。 相似文献
72.
73.
74.
75.
Hendry L. B. Korzeniowski S. H. Hindenlang D. M. Kosarych Z. Mumma R. O. Jugovich J. 《Journal of chemical ecology》1975,1(3):317-322
The major sex attractant of the oak leaf roller (Archips semiferanus Walker),cis-10-tetradecenyl acetate (I), was synthesized in 55–62% overall yield by a highly economical route from inexpensive azelaic acid (II).Authorized as Paper No. 4779 in the Journal Series of the Pennsylvania Agricultural Experiment Station. 相似文献
76.
We present a new approach to microfacet‐based BSDF importance sampling. Previously proposed sampling schemes for popular analytic BSDFs typically begin by choosing a microfacet normal at random in a way that is independent of direction of incident light. To sample the full BSDF using these normals requires arbitrarily large sample weights leading to possible fireflies. Additionally, at grazing angles nearly half of the sampled normals face away from the incident ray and must be rejected, making the sampling scheme inefficient. Instead, we show how to use the distribution of visible normals directly to generate samples, where normals are weighted by their projection factor toward the incident direction. In this way, no backfacing normals are sampled and the sample weights contain only the shadowing factor of outgoing rays (and additionally a Fresnel term for conductors). Arbitrarily large sample weights are avoided and variance is reduced. Since the BSDF depends on the microsurface model, we describe our sampling algorithm for two models: the V‐cavity and the Smith models. We demonstrate results for both isotropic and anisotropic rough conductors and dielectrics with Beckmann and GGX distributions. 相似文献
77.
Crowded motions refer to multiple objects moving around and interacting such as crowds, pedestrians and etc. We capture crowded scenes using a depth scanner at video frame rates. Thus, our input is a set of depth frames which sample the scene over time. Processing such data is challenging as it is highly unorganized, with large spatio‐temporal holes due to many occlusions. As no correspondence is given, locally tracking 3D points across frames is hard due to noise and missing regions. Furthermore global segmentation and motion completion in presence of large occlusions is ambiguous and hard to predict. Our algorithm utilizes Gestalt principles of common fate and good continuity to compute motion tracking and completion respectively. Our technique does not assume any pre‐given markers or motion template priors. Our key‐idea is to reduce the motion completion problem to a 1D curve fitting and matching problem which can be solved efficiently using a global optimization scheme. We demonstrate our segmentation and completion method on a variety of synthetic and real world crowded scanned scenes. 相似文献
78.
We propose a fast method for 3D shape segmentation and labeling via Extreme Learning Machine (ELM). Given a set of example shapes with labeled segmentation, we train an ELM classifier and use it to produce initial segmentation for test shapes. Based on the initial segmentation, we compute the final smooth segmentation through a graph‐cut optimization constrained by the super‐face boundaries obtained by over‐segmentation and the active contours computed from ELM segmentation. Experimental results show that our method achieves comparable results against the state‐of‐the‐arts, but reduces the training time by approximately two orders of magnitude, both for face‐level and super‐face‐level, making it scale well for large datasets. Based on such notable improvement, we demonstrate the application of our method for fast online sequential learning for 3D shape segmentation at face level, as well as realtime sequential learning at super‐face level. 相似文献
79.
Natural objects often contain vivid color distribution with wide variety of colors. Conventional colorization techniques, on the other hand, produce colors that are relatively flat with little color variation. In this paper, we introduce a randomized algorithm which considers not only the value of target color but also the distribution of target color. In essence, our algorithm paints a color distribution to a region which synthesizes color distribution of a natural object. Our approach models the correlation between intensity and color in HSV color space in terms of H – S, H – V and S – V joint histogram. During the colorization process, we randomly swap and reassign color of a pixel to minimize a cost function that measures color consistency to its neighborhood and intensity‐to‐color correlation captured in the joint histogram. We tested our algorithm extensively on many natural objects and our user study confirms that our results are more vivid and natural compared to results from previous techniques. 相似文献
80.
Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color‐blind people. Simple color transformations often result in information loss and ambiguities, and one wishes to find an image‐specific transformation that would preserve as much as possible the structure of the original image in the target color space. In this paper, we propose Laplacian colormaps, a generic framework for structure‐preserving color transformations between images. We use the image Laplacian to capture the structural information, and show that if the color transformation between two images preserves the structure, the respective Laplacians have similar eigenvectors, or in other words, are approximately jointly diagonalizable. Employing the relation between joint diagonalizability and commutativity of matrices, we use Laplacians commutativity as a criterion of color mapping quality and minimize it w.r.t. the parameters of a color transformation to achieve optimal structure preservation. We show numerous applications of our approach, including color‐to‐gray conversion, gamut mapping, multispectral image fusion, and image optimization for color deficient viewers. 相似文献