全文获取类型
收费全文 | 2230篇 |
免费 | 103篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 26篇 |
综合类 | 5篇 |
化学工业 | 554篇 |
金属工艺 | 30篇 |
机械仪表 | 40篇 |
建筑科学 | 124篇 |
矿业工程 | 33篇 |
能源动力 | 38篇 |
轻工业 | 188篇 |
水利工程 | 32篇 |
石油天然气 | 4篇 |
无线电 | 183篇 |
一般工业技术 | 332篇 |
冶金工业 | 183篇 |
原子能技术 | 9篇 |
自动化技术 | 559篇 |
出版年
2023年 | 24篇 |
2022年 | 48篇 |
2021年 | 62篇 |
2020年 | 29篇 |
2019年 | 26篇 |
2018年 | 63篇 |
2017年 | 55篇 |
2016年 | 86篇 |
2015年 | 77篇 |
2014年 | 86篇 |
2013年 | 107篇 |
2012年 | 120篇 |
2011年 | 135篇 |
2010年 | 83篇 |
2009年 | 124篇 |
2008年 | 108篇 |
2007年 | 97篇 |
2006年 | 109篇 |
2005年 | 80篇 |
2004年 | 67篇 |
2003年 | 49篇 |
2002年 | 56篇 |
2001年 | 33篇 |
2000年 | 36篇 |
1999年 | 43篇 |
1998年 | 43篇 |
1997年 | 48篇 |
1996年 | 43篇 |
1995年 | 43篇 |
1994年 | 40篇 |
1993年 | 25篇 |
1992年 | 20篇 |
1991年 | 19篇 |
1990年 | 14篇 |
1989年 | 9篇 |
1988年 | 13篇 |
1987年 | 16篇 |
1986年 | 9篇 |
1985年 | 16篇 |
1984年 | 16篇 |
1983年 | 13篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 17篇 |
1975年 | 11篇 |
1971年 | 6篇 |
1908年 | 6篇 |
排序方式: 共有2340条查询结果,搜索用时 0 毫秒
51.
52.
53.
In this paper we give an overview over a series of experiments to visualize and measure flow fields in the human vascular
system with respect to their diagnostic capabilities. The experiments utilize a selection of GPU-based sparse and dense flow
visualization algorithms to show the diagnostic opportunities for volumetric cardiovascular phase contrast magnetic resonance
imaging data sets. Besides classical hardware accelerated particle and line-based approaches, an extensible tublet-based visualization,
a four-dimensional volumetric line integral convolution and a new two-dimensional cutting plane tool for three-dimensional
velocity data sets have been implemented. To evaluate the results, several hearts of human subjects have been investigated
and a flow phantom was built to artificially simulate distinctive flow features. Our results demonstrate that we are able
to provide an interactive tool for cardiovascular diagnostics with complementary hardware accelerated visualizations.
Electronic Supplementary Material The online version of this article () contains supplementary material, which is available to authorized users.
相似文献
Dieter SchmalstiegEmail: |
54.
A near-resonant, sway-induced sloshing flow in a rectangular tank is used to compare a homogeneous and inhomogeneous multiphase approach for fluid density and viscosity in a commercial CFD code. Dimensional analysis of the relative motion between the phases suggests the application of an inhomogeneous multiphase model whereas previous published work has used the computationally cheaper homogeneous (or average property) approach. The comparison between the computational and experimental results shows that the homogeneous model tends to underestimate the experimental peak pressures by up to 50%. The inhomogeneous multiphase model gives good agreement with the experimental pressure data. Examination of the relative velocity at the fluid interface confirms that the inhomogeneous model is the appropriate model to use for the simulation of a violent sloshing flow. 相似文献
55.
Benjamin Köhler Uta Preim Matthias Grothoff Matthias Gutberlet Katharina Fischbach Bernhard Preim 《Computer Graphics Forum》2016,35(1):32-43
Four‐dimensional phase‐contrast magnetic resonance imaging (4D PC‐MRI) allows the non‐invasive acquisition of time‐resolved, 3D blood flow information. Stroke volumes (SVs) and regurgitation fractions (RFs) are two of the main measures to assess the cardiac function and severity of valvular pathologies. The flow rates in forward and backward direction through a plane above the aortic or pulmonary valve are required for their quantification. Unfortunately, the calculations are highly sensitive towards the plane's angulation since orthogonally passing flow is considered. This often leads to physiologically implausible results. In this work, a robust quantification method is introduced to overcome this problem. Collaborating radiologists and cardiologists were carefully observed while estimating SVs and RFs in various healthy volunteer and patient 4D PC‐MRI data sets with conventional quantification methods, that is, using a single plane above the valve that is freely movable along the centerline. By default it is aligned perpendicular to the vessel's centerline, but free angulation (rotation) is possible. This facilitated the automation of their approach which, in turn, allows to derive statistical information about the plane angulation sensitivity. Moreover, the experts expect a continuous decrease of the blood flow volume along the vessel course. Conventional methods are often unable to produce this behaviour. Thus, we present a procedure to fit a monotonous function that ensures such physiologically plausible results. In addition, this technique was adapted for the usage in branching vessels such as the pulmonary artery. The performed informal evaluation shows the capability of our method to support diagnosis; a parameter evaluation confirms the robustness. Vortex flow was identified as one of the main causes for quantification uncertainties. 相似文献
56.
Sofia Cassel Falk Howar Bengt Jonsson Bernhard Steffen 《Formal Aspects of Computing》2016,28(2):233-263
We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. Our algorithm infers a class of EFSMs called register automata. Register automata have a finite control structure, extended with variables (registers), assignments, and guards. Our algorithm is parameterized on a particular theory, i.e., a set of operations and tests on the data domain that can be used in guards.Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We also show that, under these conditions, our framework induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library. 相似文献
57.
58.
Moreno R Garcia MA Puig D Pizarro L Burgeth B Weickert J 《IEEE transactions on pattern analysis and machine intelligence》2011,33(11):2215-2228
This paper proposes two alternative formulations to reduce the high computational complexity of tensor voting, a robust perceptual grouping technique used to extract salient information from noisy data. The first scheme consists of numerical approximations of the votes, which have been derived from an in-depth analysis of the plate and ball voting processes. The second scheme simplifies the formulation while keeping the same perceptual meaning of the original tensor voting: The stick tensor voting and the stick component of the plate tensor voting must reinforce surfaceness, the plate components of both the plate and ball tensor voting must boost curveness, whereas junctionness must be strengthened by the ball component of the ball tensor voting. Two new parameters have been proposed for the second formulation in order to control the potentially conflictive influence of the stick component of the plate vote and the ball component of the ball vote. Results show that the proposed formulations can be used in applications where efficiency is an issue since they have a complexity of order O(1). Moreover, the second proposed formulation has been shown to be more appropriate than the original tensor voting for estimating saliencies by appropriately setting the two new parameters. 相似文献
59.
Caches impose a major problem for predicting execution times of real-time systems since the cache behavior depends on the history of previous memory references. Too pessimistic assumptions on cache hits can obtain worst-case execution time estimates that are prohibitive for real-time systems. This paper presents a novel approach for deriving a highly accurate analytical cache hit function for C-programs at compile-time based on the assumption that no external cache interference (e.g. process dispatching or DMA activity) occurs. First, a symbolic tracefile of an instrumented C-program is generated based on symbolic evaluation, which is a static technique to determine the dynamic behavior of programs. All memory references of a program are described by symbolic expressions and recurrences and stored in chronological order in the symbolic tracefile. Second, a cache hit function for several cache architectures is computed based on a cache evaluation technique. Our approach goes beyond previous work by precisely modelling program control flow and program unknowns, modelling large classes of cache architectures, and providing very accurate cache hit predictions. Examples for the SPARC architecture are used to illustrate the accuracy and effectiveness of our symbolic cache prediction. 相似文献
60.