全文获取类型
收费全文 | 23800篇 |
免费 | 1533篇 |
国内免费 | 575篇 |
专业分类
电工技术 | 565篇 |
综合类 | 1747篇 |
化学工业 | 3221篇 |
金属工艺 | 932篇 |
机械仪表 | 1248篇 |
建筑科学 | 1190篇 |
矿业工程 | 415篇 |
能源动力 | 961篇 |
轻工业 | 1234篇 |
水利工程 | 122篇 |
石油天然气 | 729篇 |
武器工业 | 115篇 |
无线电 | 2475篇 |
一般工业技术 | 3975篇 |
冶金工业 | 540篇 |
原子能技术 | 150篇 |
自动化技术 | 6289篇 |
出版年
2024年 | 42篇 |
2023年 | 301篇 |
2022年 | 472篇 |
2021年 | 341篇 |
2020年 | 372篇 |
2019年 | 548篇 |
2018年 | 408篇 |
2017年 | 602篇 |
2016年 | 659篇 |
2015年 | 602篇 |
2014年 | 675篇 |
2013年 | 768篇 |
2012年 | 1122篇 |
2011年 | 1195篇 |
2010年 | 690篇 |
2009年 | 961篇 |
2008年 | 869篇 |
2007年 | 790篇 |
2006年 | 700篇 |
2005年 | 620篇 |
2004年 | 1299篇 |
2003年 | 983篇 |
2002年 | 1634篇 |
2001年 | 1359篇 |
2000年 | 1239篇 |
1999年 | 1054篇 |
1998年 | 621篇 |
1997年 | 690篇 |
1996年 | 1578篇 |
1995年 | 881篇 |
1994年 | 633篇 |
1993年 | 174篇 |
1992年 | 148篇 |
1991年 | 175篇 |
1990年 | 148篇 |
1989年 | 77篇 |
1988年 | 67篇 |
1987年 | 46篇 |
1986年 | 66篇 |
1985年 | 73篇 |
1984年 | 49篇 |
1983年 | 35篇 |
1982年 | 36篇 |
1981年 | 32篇 |
1980年 | 14篇 |
1979年 | 17篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 546 毫秒
951.
Functions that optimize Laplacian‐based energies have become popular in geometry processing, e.g. for shape deformation, smoothing, multiscale kernel construction and interpolation. Minimizers of Dirichlet energies, or solutions of Laplace equations, are harmonic functions that enjoy the maximum principle, ensuring no spurious local extrema in the interior of the solved domain occur. However, these functions are only C0 at the constrained points, which often causes smoothness problems. For this reason, many applications optimize higher‐order Laplacian energies such as biharmonic or triharmonic. Their minimizers exhibit increasing orders of continuity but lose the maximum principle and show oscillations. In this work, we identify characteristic artifacts caused by spurious local extrema, and provide a framework for minimizing quadratic energies on manifolds while constraining the solution to obey the maximum principle in the solved region. Our framework allows the user to specify locations and values of desired local maxima and minima, while preventing any other local extrema. We demonstrate our method on the smoothness energies corresponding to popular polyharmonic functions and show its usefulness for fast handle‐based shape deformation, controllable color diffusion, and topologically‐constrained data smoothing. 相似文献
952.
Francesco Banterle Massimiliano Corsini Paolo Cignoni Roberto Scopigno 《Computer Graphics Forum》2012,31(1):19-32
In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade‐off between visual quality and speed‐up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real‐time filtering. We show different applications of the proposed filter, in particular efficient cross‐bilateral filtering, real‐time edge‐aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage. 相似文献
953.
Jean‐Eudes Marvie Cyprien Buron Pascal Gautron Patrice Hirtzlin Gaël Sourimant 《Computer Graphics Forum》2012,31(7):2087-2095
GPU Shape Grammars provide a solution for interactive procedural generation, tuning and visualization of massive environment elements for both video games and production rendering. Our technique generates detailed models without explicit geometry storage. To this end we reformulate the grammar expansion for generation of detailed models at the tesselation control and geometry shader stages. Using the geometry generation capabilities of modern graphics hardware, our technique generated massive, highly detailed models. GPU Shape Grammars integrate within a scalable framework by introducing automatic generation of levels of detail at reduced cost. We apply our solution for interactive generation and rendering of scenes containing thousands of buildings and trees. 相似文献
954.
We provide a method for improving the parameterization of patching schemes that approximate Catmull‐Clark subdivision surfaces, such that the new parameterization conforms better to that of the original subdivision surface. We create this reparameterization in real‐time using a method that only depends on the topology of the surface and is independent of the surface's geometry. Our method can handle patches with more than one extraordinary vertex and avoids the combinatorial increase in both complexity and storage associated with multiple extraordinary vertices. Moreover, the reparameterization function is easy to implement and fast. 相似文献
955.
Medical illustrations have been used for a long time for teaching and communicating information for diagnosis or surgery planning. Illustrative visualization systems create methods and tools that adapt traditional illustration techniques to enhance the result of renderings. Clipping the volume is a popular operation in volume rendering for inspecting the inner parts, though it may remove some information of the context that is worth preserving. In this paper we present a new editing technique based on the use of clipping planes, direct structure extrusion, and illustrative methods, which preserves the context by adapting the extruded region to the structures of interest of the volumetric model. We will show that users may interactively modify the clipping plane and edit the structures to highlight, in order to easily create the desired result. Our approach works with segmented volume models and non‐segmented ones. In the last case, a local segmentation is performed on‐the‐fly. We will demonstrate the efficiency and utility of our method. 相似文献
956.
Accurate depth estimation is a challenging, yet essential step in the conversion of a 2D image sequence to a 3D stereo sequence. We present a novel approach to construct a temporally coherent depth map for each image in a sequence. The quality of the estimated depth is high enough for the purpose of2D to 3D stereo conversion. Our approach first combines the video sequence into a panoramic image. A user can scribble on this single panoramic image to specify depth information. The depth is then propagated to the remainder of the panoramic image. This depth map is then remapped to the original sequence and used as the initial guess for each individual depth map in the sequence. Our approach greatly simplifies the required user interaction during the assignment of the depth and allows for relatively free camera movement during the generation of a panoramic image. We demonstrate the effectiveness of our method by showing stereo converted sequences with various camera motions. 相似文献
957.
Fabian SobotkaThomas Kneib 《Computational statistics & data analysis》2012,56(4):755-767
Quantile regression has emerged as one of the standard tools for regression analysis that enables a proper assessment of the complete conditional distribution of responses even in the presence of heteroscedastic errors. Quantile regression estimates are obtained by minimising an asymmetrically weighted sum of absolute deviations from the regression line, a decision theoretic formulation of the estimation problem that avoids a full specification of the error term distribution. Recent advances in mean regression have concentrated on making the regression structure more flexible by including nonlinear effects of continuous covariates, random effects or spatial effects. These extensions often rely on penalised least squares or penalised likelihood estimation with quadratic penalties and may therefore be difficult to combine with the linear programming approaches often considered in quantile regression. As a consequence, geoadditive expectile regression based on minimising an asymmetrically weighted sum of squared residuals is introduced. Different estimation procedures are presented including least asymmetrically weighted squares, boosting and restricted expectile regression. The properties of these procedures are investigated in a simulation study and an analysis on rental fees in Munich is provided where the geoadditive specification allows for an analysis of nonlinear effects of the size of flats or the year of construction and the spatial distribution of rents simultaneously. 相似文献
958.
Guochang Wang 《Computational statistics & data analysis》2012,56(3):587-601
Functional linear regression has been widely used to model the relationship between a scalar response and functional predictors. If the original data do not satisfy the linear assumption, an intuitive solution is to perform some transformation such that transformed data will be linearly related. The problem of finding such transformations has been rather neglected in the development of functional data analysis tools. In this paper, we consider transformation on the response variable in functional linear regression and propose a nonparametric transformation model in which we use spline functions to construct the transformation function. The functional regression coefficients are then estimated by an innovative procedure called mixed data canonical correlation analysis (MDCCA). MDCCA is analogous to the canonical correlation analysis between two multivariate samples, but is between a multivariate sample and a set of functional data. Here, we apply the MDCCA to the projection of the transformation function on the B-spline space and the functional predictors. We then show that our estimates agree with the regularized functional least squares estimate for the transformation model subject to a scale multiplication. The dimension of the space of spline transformations can be determined by a model selection principle. Typically, a very small number of B-spline knots is needed. Real and simulation data examples are further presented to demonstrate the value of this approach. 相似文献
959.
Elena Garces Adolfo Munoz Jorge Lopez‐Moreno Diego Gutierrez 《Computer Graphics Forum》2012,31(4):1415-1424
Decomposing an input image into its intrinsic shading and reflectance components is a long‐standing ill‐posed problem. We present a novel algorithm that requires no user strokes and works on a single image. Based on simple assumptions about its reflectance and luminance, we first find clusters of similar reflectance in the image, and build a linear system describing the connections and relations between them. Our assumptions are less restrictive than widely‐adopted Retinex‐based approaches, and can be further relaxed in conflicting situations. The resulting system is robust even in the presence of areas where our assumptions do not hold. We show a wide variety of results, including natural images, objects from the MIT dataset and texture images, along with several applications, proving the versatility of our method. 相似文献
960.