全文获取类型
收费全文 | 108806篇 |
免费 | 1798篇 |
国内免费 | 4467篇 |
专业分类
电工技术 | 3035篇 |
技术理论 | 1篇 |
综合类 | 1705篇 |
化学工业 | 10632篇 |
金属工艺 | 7415篇 |
机械仪表 | 5358篇 |
建筑科学 | 5409篇 |
矿业工程 | 7850篇 |
能源动力 | 1194篇 |
轻工业 | 16778篇 |
水利工程 | 3561篇 |
石油天然气 | 4895篇 |
武器工业 | 918篇 |
无线电 | 12383篇 |
一般工业技术 | 20697篇 |
冶金工业 | 3774篇 |
原子能技术 | 2126篇 |
自动化技术 | 7340篇 |
出版年
2022年 | 640篇 |
2021年 | 576篇 |
2018年 | 537篇 |
2016年 | 484篇 |
2015年 | 636篇 |
2014年 | 1456篇 |
2013年 | 1071篇 |
2012年 | 6210篇 |
2011年 | 7592篇 |
2010年 | 2208篇 |
2009年 | 1859篇 |
2008年 | 5865篇 |
2007年 | 5714篇 |
2006年 | 5167篇 |
2005年 | 4807篇 |
2004年 | 4409篇 |
2003年 | 3664篇 |
2002年 | 3682篇 |
2001年 | 3577篇 |
2000年 | 2968篇 |
1999年 | 2057篇 |
1998年 | 1521篇 |
1997年 | 1322篇 |
1996年 | 1487篇 |
1995年 | 1517篇 |
1994年 | 1433篇 |
1993年 | 1274篇 |
1992年 | 1660篇 |
1991年 | 1700篇 |
1990年 | 2000篇 |
1989年 | 1795篇 |
1988年 | 2369篇 |
1987年 | 2859篇 |
1986年 | 2481篇 |
1985年 | 2759篇 |
1984年 | 2540篇 |
1983年 | 2295篇 |
1982年 | 2462篇 |
1981年 | 2116篇 |
1980年 | 1658篇 |
1979年 | 1088篇 |
1978年 | 694篇 |
1977年 | 569篇 |
1976年 | 578篇 |
1975年 | 693篇 |
1974年 | 698篇 |
1973年 | 527篇 |
1965年 | 893篇 |
1964年 | 746篇 |
1956年 | 521篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Chen G Deng Q Szymczak A Laramee RS Zhang E 《IEEE transactions on visualization and computer graphics》2012,18(5):767-782
Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is not unique, and its granularity directly impacts its computational cost. In this paper, we propose an automatic refinement scheme to construct the Morse Connection Graph (MCG) of a given vector field in a hierarchical fashion. Our framework allows a Morse set to be refined through a local update of the flow combinatorialization graph, as well as the connection regions between Morse sets. The computation is fast because the most expensive computation is concentrated on a small portion of the domain. Furthermore, the present work allows the generation of a topologically consistent hierarchy of MCGs, which cannot be obtained using a global method. The classification of the extracted Morse sets is a crucial step for the construction of the MCG, for which the Poincare′ index is inadequate. We make use of an upper bound for the Conley index, provided by the Betti numbers of an index pair for a translation along the flow, to classify the Morse sets. This upper bound is sufficiently accurate for Morse set classification and provides supportive information for the automatic refinement process. An improved visualization technique for MCG is developed to incorporate the Conley indices. Finally, we apply the proposed techniques to a number of synthetic and realworld simulation data to demonstrate their utility. 相似文献
992.
In this paper, we present a framework for the groupwise processing of a set of meshes in dense correspondence. Such sets arise when modeling 3D shape variation or tracking surface motion over time. We extend a number of mesh processing tools to operate in a groupwise manner. Specifically, we present a geodesic-based surface flattening and spectral clustering algorithm which estimates a single class-optimal flattening. We also show how to modify an iterative edge collapse algorithm to perform groupwise simplification while retaining the correspondence of the data. Finally, we show how to compute class-optimal texture coordinates for the simplified meshes. We present alternative algorithms for topologically symmetric data which yield a symmetric flattening and low-resolution mesh topology. We present flattening, simplification, and texture mapping results on three different data sets and show that our approach allows the construction of low-resolution 3D morphable models. 相似文献
993.
994.
Hosseinzadeh A Reza AM 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(3):754-763
A classifier combining strategy, virtual voting by random projection (VVRP), is presented. VVRP takes advantage from the bounded distortion incurred by random projection in order to improve accuracies of stable classifiers like discriminant analysis (DA) where existing classifier combining strategies are known to be failed. It uses the distortion to virtually generate different training sets from the total available training samples in a way that does not have the potential for overfitting. Then, a majority voting combines the base learners trained on these versions of the original problem. VVRP is very simple and just needs determining a proper dimensionality for the versions, an often very easy task. It is shown to be stable in a very large region of the hyperplane constructed by the dimensionality and the number of the versions. VVRP improves the best state-of-the-art DA algorithms in both small and large sample size problems in various classification fields. 相似文献
995.
Shilton A Lai DT Santhiranayagam BK Palaniswami M 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(3):950-955
This note presents an analysis of the octonionic form of the division algebraic support vector regressor (SVR) first introduced by Shilton A detailed derivation of the dual form is given, and three conditions under which it is analogous to the quaternionic case are exhibited. It is shown that, in the general case of an octonionic-valued feature map, the usual "kernel trick" breaks down. The cause of this (and its interpretation) is discussed in some detail, along with potential ways of extending kernel methods to take advantage of the distinct features present in the general case. Finally, the octonionic SVR is applied to an example gait analysis problem, and its performance is compared to that of the least squares SVR, the Clifford SVR, and the multidimensional SVR. 相似文献
996.
Pedrycz W Bargiela A 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(3):582-590
Clustering forms one of the most visible conceptual and algorithmic framework of developing information granules. In spite of the algorithm being used, the representation of information granules-clusters is predominantly numeric (coming in the form of prototypes, partition matrices, dendrograms, etc.). In this paper, we consider a concept of granular prototypes that generalizes the numeric representation of the clusters and, in this way, helps capture more details about the data structure. By invoking the granulation-degranulation scheme, we design granular prototypes being reflective of the structure of data to a higher extent than the representation that is provided by their numeric counterparts (prototypes). The design is formulated as an optimization problem, which is guided by the coverage criterion, meaning that we maximize the number of data for which their granular realization includes the original data. The granularity of the prototypes themselves is treated as an important design asset; hence, its allocation to the individual prototypes is optimized so that the coverage criterion becomes maximized. With this regard, several schemes of optimal allocation of information granularity are investigated, where interval-valued prototypes are formed around the already produced numeric representatives. Experimental studies are provided in which the design of granular prototypes of interval format is discussed and characterized. 相似文献
997.
Mallapragada G Ray A Jin X 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(3):647-659
This paper presents a procedure for behavior identification of mobile robots, which requires limited or no domain knowledge of the underlying process. While the features of robot behavior are extracted by symbolic dynamic filtering of the observed time series, the behavior patterns are classified based on language measure theory. The behavior identification procedure has been experimentally validated on a networked robotic test bed by comparison with commonly used tools, namely, principal component analysis for feature extraction and Bayesian risk analysis for pattern classification. 相似文献
998.
In this paper, we present the first method for the geometric autocalibration of multiple projectors on a set of CAVE-like immersive display surfaces including truncated domes and 4 or 5-wall CAVEs (three side walls, floor, and/or ceiling). All such surfaces can be categorized as swept surfaces and multiple projectors can be registered on them using a single uncalibrated camera without using any physical markers on the surface. Our method can also handle nonlinear distortion in the projectors, common in compact setups where a short throw lens is mounted on each projector. Further, when the whole swept surface is not visible from a single camera view, we can register the projectors using multiple pan and tilted views of the same camera. Thus, our method scales well with different size and resolution of the display. Since we recover the 3D shape of the display, we can achieve registration that is correct from any arbitrary viewpoint appropriate for head-tracked single-user virtual reality systems. We can also achieve wallpapered registration, more appropriate for multiuser collaborative explorations. Though much more immersive than common surfaces like planes and cylinders, general swept surfaces are used today only for niche display environments. Even the more popular 4 or 5-wall CAVE is treated as a piecewise planar surface for calibration purposes and hence projectors are not allowed to be overlapped across the corners. Our method opens up the possibility of using such swept surfaces to create more immersive VR systems without compromising the simplicity of having a completely automatic calibration technique. Such calibration allows completely arbitrary positioning of the projectors in a 5-wall CAVE, without respecting the corners. 相似文献
999.
Pollock B Burton M Kelly JW Gilbert S Winer E 《IEEE transactions on visualization and computer graphics》2012,18(4):581-588
Stereoscopic depth cues improve depth perception and increase immersion within virtual environments (VEs). However, improper display of these cues can distort perceived distances and directions. Consider a multi-user VE, where all users view identical stereoscopic images regardless of physical location. In this scenario, cues are typically customized for one "leader" equipped with a head-tracking device. This user stands at the center of projection (CoP) and all other users ("followers") view the scene from other locations and receive improper depth cues. This paper examines perceived depth distortion when viewing stereoscopic VEs from follower perspectives and the impact of these distortions on collaborative spatial judgments. Pairs of participants made collaborative depth judgments of virtual shapes viewed from the CoP or after displacement forward or backward. Forward and backward displacement caused perceived depth compression and expansion, respectively, with greater compression than expansion. Furthermore, distortion was less than predicted by a ray-intersection model of stereo geometry. Collaboration times were significantly longer when participants stood at different locations compared to the same location, and increased with greater perceived depth discrepancy between the two viewing locations. These findings advance our understanding of spatial distortions in multi-user VEs, and suggest a strategy for reducing distortion. 相似文献
1000.
Krishnan H Garth C Gühring J Gülsün MA Greiser A Joy KI 《IEEE transactions on visualization and computer graphics》2012,18(6):966-977
Many flow visualization techniques, especially integration-based methods, are problematic when the measured data exhibit noise and discretization issues. Particularly, this is the case for flow-sensitive phase-contrast magnetic resonance imaging (PC-MRI) data sets which not only record anatomic information, but also time-varying flow information. We propose a novel approach for the visualization of such data sets using integration-based methods. Our ideas are based upon finite-time Lyapunov exponents (FTLE) and enable identification of vessel boundaries in the data as high regions of separation. This allows us to correctly restrict integration-based visualization to blood vessels. We validate our technique by comparing our approach to existing anatomy-based methods as well as addressing the benefits and limitations of using FTLE to restrict flow. We also discuss the importance of parameters, i.e., advection length and data resolution, in establishing a well-defined vessel boundary. We extract appropriate flow lines and surfaces that enable the visualization of blood flow within the vessels. We further enhance the visualization by analyzing flow behavior in the seeded region and generating simplified depictions. 相似文献