全文获取类型
收费全文 | 1230篇 |
免费 | 40篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 65篇 |
综合类 | 3篇 |
化学工业 | 316篇 |
金属工艺 | 25篇 |
机械仪表 | 35篇 |
建筑科学 | 18篇 |
能源动力 | 58篇 |
轻工业 | 76篇 |
水利工程 | 4篇 |
无线电 | 115篇 |
一般工业技术 | 209篇 |
冶金工业 | 173篇 |
原子能技术 | 50篇 |
自动化技术 | 131篇 |
出版年
2023年 | 6篇 |
2022年 | 11篇 |
2021年 | 13篇 |
2020年 | 6篇 |
2019年 | 19篇 |
2018年 | 15篇 |
2016年 | 24篇 |
2015年 | 15篇 |
2014年 | 24篇 |
2013年 | 37篇 |
2012年 | 53篇 |
2011年 | 59篇 |
2010年 | 46篇 |
2009年 | 40篇 |
2008年 | 52篇 |
2007年 | 44篇 |
2006年 | 46篇 |
2005年 | 38篇 |
2004年 | 53篇 |
2003年 | 35篇 |
2002年 | 30篇 |
2001年 | 19篇 |
2000年 | 24篇 |
1999年 | 30篇 |
1998年 | 89篇 |
1997年 | 54篇 |
1996年 | 35篇 |
1995年 | 26篇 |
1994年 | 19篇 |
1993年 | 33篇 |
1992年 | 15篇 |
1991年 | 13篇 |
1990年 | 14篇 |
1989年 | 23篇 |
1988年 | 20篇 |
1987年 | 15篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 14篇 |
1983年 | 11篇 |
1982年 | 9篇 |
1981年 | 13篇 |
1980年 | 18篇 |
1979年 | 17篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 12篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1968年 | 5篇 |
排序方式: 共有1278条查询结果,搜索用时 46 毫秒
991.
992.
Quasiconvex optimization for robust geometric reconstruction 总被引:1,自引:0,他引:1
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show that, for various geometric reconstruction problems, their reprojection error functions share a common and quasiconvex formulation. Based on the quasiconvexity, we present a novel quasiconvex optimization framework in which the geometric reconstruction problems are formulated as a small number of small-scale convex programs that are ready to solve. Our final reconstruction algorithm is simple and has intuitive geometric interpretation. In contrast to existing local minimization approaches, our algorithm is deterministic and guarantees a predefined accuracy of the minimization result.The quasiconvexity also provides an intuitive method to handle directional uncertainties and outliers in measurements. When there are outliers in the measurements, our method provides a mechanism to locate the global minimum of a robust error function. For large scale problems and when computational resources are constrained, we provide an efficient approximation that gives a good upper bound (but not global minimum) on the reconstruction error. We demonstrate the effectiveness of our algorithm by experiments on both synthetic and real data. 相似文献
993.
Michiharu Kudo 《International Journal of Information Security》2002,1(2):116-130
Over the years a wide variety of access control models and policies have been proposed, and almost all the models have assumed
“grant the access request or deny it.” They do not provide any mechanism that enables us to bind authorization rules with
required operations such as logging and encryption. We propose the notion of a “provisional action” that tells the user that
his request will be authorized provided he (and/or the system) takes certain actions. The major advantage of our approach
is that arbitrary actions such as cryptographic operations can all coexist in the access control policy rules. We define a
fundamental authorization mechanism and then formalize a provision-based access control model. We also present algorithms
and describe their algorithmic complexity. Finally, we illustrate how provisional access control policy rules can be specified
effectively in practical usage scenarios.
Published online: 22 January 2002 相似文献
994.
Kazuyo Mizuno Hsiang‐Yun Wu Shigeo Takahashi Takeo Igarashi 《Computer Graphics Forum》2019,38(3):13-24
A set diagram represents the membership relation among data elements. It is often visualized as secondary information on top of primary information, such as the spatial positions of elements on maps and charts. Visualizing the temporal evolution of such set diagrams as well as their primary features is quite important; however, conventional approaches have only focused on the temporal behavior of the primary features and do not provide an effective means to highlight notable transitions within the set relationships. This paper presents an approach for generating a stepwise animation between set diagrams by decomposing the entire transition into atomic changes associated with individual data elements. The key idea behind our approach is to optimize the ordering of the atomic changes such that the synthesized animation minimizes unwanted set occlusions by considering their depth ordering and reduces the gaze shift between two consecutive stepwise changes. Experimental results and a user study demonstrate that the proposed approach effectively facilitates the visual identification of the detailed transitions inherent in dynamic set diagrams. 相似文献
995.
Tetsuji TakahashiMineichi Kudo Atsuyoshi Nakamura 《Pattern recognition letters》2011,32(16):2224-2230
We propose an algorithm to approximate each class region by a small number of approximated convex hulls and to use these for classification. The classifier is one of non-kernel maximum margin classifiers. It keeps the maximum margin in the original feature space, unlike support vector machines with a kernel. The construction of an exact convex hull requires an exponential time in dimension, so we find an approximate convex hull (a polyhedron) instead, which is constructed in linear time in dimension. We also propose a model selection procedure to control the number of faces of convex hulls for avoiding over-fitting, in which a fast procedure is adopted to calculate an upper-bound of the leave-one-out error. In comparison with support vector machines, the proposed approach is shown to be comparable in performance but more natural in the extension to multi-class problems. 相似文献
996.
Pattern Analysis and Applications - Multi-label classification faces several critical challenges, including modeling label correlations, mitigating label imbalance, removing irrelevant and... 相似文献
997.
The Journal of Supercomputing - With the rapid development of the mobile Internet and the Internet of Things, the number of personal wireless devices and wireless services have grown exponentially... 相似文献
998.
A locally adaptive window for signal matching 总被引:5,自引:4,他引:5
This article presents a signal matching algorithm that can select an appropriate window size adaptively so as to obtain both precise and stable estimation of correspondences.Matching two signals by calculating the sum of squared differences (SSD) over a certain window is a basic technique in computer vision. Given the signals and a window, there are two factors that determine the difficulty of obtaining precise matching. The first is the variation of the signal within the window, which must be large enough, relative to noise, that the SSD values exhibit a clear and sharp minimum at the correct disparity. The second factor is the variation of disparity within the window, which must be small enough that signals of corresponding positions are duly compared. These two factors present conflicting requirements to the size of the matching window, since a larger window tends to increase the signal variation, but at the same time tends to include points of different disparity. A window size must be adaptively selected depending on local variations of signal and disparity in order to compute a most-certain estimate of disparity at each point.There has been little work on a systematic method for automatic window-size selection. The major difficulty is that, while the signal variation is measurable from the input, the disparity variation is not, since disparities are what we wish to calculate. We introduce here a statistical model of disparity variation within a window, and employ it to establish a link between the window size and the uncertainty of the computed disparity. This allows us to choose the window size that minimizes uncertainty in the disparity computed at each point. This article presents a theory for the model and the resultant algorithm, together with analytical and experimental results that demonstrate their effectiveness. 相似文献
999.
The measurement of highlights in color images 总被引:4,自引:3,他引:4
Gudrun J. Klinker Steven A. Shafer Takeo Kanade 《International Journal of Computer Vision》1988,2(1):7-32
In this paper, we present an approach to color image understanding that accounts for color variations due to highlights and shading. We demonstrate that the reflected light from every point on a dielectric object, such as plastic, can be described as a linear combination of the object color and the highlight color. The colors of all light rays reflected from one object then form a planar cluster in the color space. The shape of this cluster is determined by the object and highlight colors and by the object shape and illumination geometry. We present a method that exploits the difference between object color and highlight color to separate the color of every pixel into a matte component and a highlight component. This generates two intrinsic images, one showing the scene without highlights, and the other one showing only the highlights. The intrinsic images may be a useful tool for a variety of algorithms in computer vision, such as stereo vision, motion analysis, shape from shading, and shape from highlights. Our method combines the analysis of matte and highlight reflection with a sensor model that accounts for camera limitations. This enables us to successfully run our algorithm on real images taken in a laboratory setting. We show and discuss the results.This material is based upon work supported by the National Science Foundation under Grant DCR-8419990 and by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 4976, monitored by the Air Force Avionics Laboratory under contract F33615-84-K-1520. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the National Science Foundation, the Defense Advanced Research Projects Agency, or the US Government. 相似文献
1000.
Large eddy simulation (LES) of turbulent flow in a bare rod bundle was performed, and a new concept about the flow structure that enhances heat transport between subchannels was proposed. To investigate the geometrical effect, the LES was performed for three different values of rod diameter over pitch ratio (D/P = 0.7, 0.8, 0.9). The computational domain containing 4 subchannels was large enough to capture large-scale structures wide across subchannels. Lateral flow obtained was unconfined in a subchannel, and some flows indicated a pulsation through the rod gap between subchannels. The gap flow became strong as D/P increased, as existing experimental studies had reported. Turbulence intensity profile in the rod gap suggested that the pulsation was caused by the turbulence energy transferred from the main flow to the wall-tangential direction. This implied that the flow pulsation was an unsteady mode of the secondary flow and arose from the same geometrical effect of turbulence. This implication was supported by the analysis results: two-points correlation functions of fluctuating velocities indicated two length-scales, P-D and D, respectively of cross-sectional and longitudinal motions; turbulence stress in the cross-sectional mean flow contained a non-potential component, which represented energy injection through the unsteady longitudinal fluid motion. 相似文献