全文获取类型
收费全文 | 3553篇 |
免费 | 219篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 48篇 |
综合类 | 28篇 |
化学工业 | 989篇 |
金属工艺 | 128篇 |
机械仪表 | 74篇 |
建筑科学 | 239篇 |
矿业工程 | 8篇 |
能源动力 | 77篇 |
轻工业 | 203篇 |
水利工程 | 16篇 |
石油天然气 | 2篇 |
无线电 | 259篇 |
一般工业技术 | 745篇 |
冶金工业 | 170篇 |
原子能技术 | 35篇 |
自动化技术 | 755篇 |
出版年
2023年 | 54篇 |
2022年 | 49篇 |
2021年 | 139篇 |
2020年 | 111篇 |
2019年 | 118篇 |
2018年 | 115篇 |
2017年 | 120篇 |
2016年 | 151篇 |
2015年 | 120篇 |
2014年 | 196篇 |
2013年 | 240篇 |
2012年 | 227篇 |
2011年 | 305篇 |
2010年 | 210篇 |
2009年 | 189篇 |
2008年 | 210篇 |
2007年 | 186篇 |
2006年 | 145篇 |
2005年 | 125篇 |
2004年 | 81篇 |
2003年 | 72篇 |
2002年 | 67篇 |
2001年 | 36篇 |
2000年 | 54篇 |
1999年 | 48篇 |
1998年 | 60篇 |
1997年 | 31篇 |
1996年 | 30篇 |
1995年 | 29篇 |
1994年 | 18篇 |
1993年 | 26篇 |
1992年 | 19篇 |
1991年 | 19篇 |
1990年 | 14篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 13篇 |
1986年 | 8篇 |
1985年 | 14篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1979年 | 10篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1972年 | 5篇 |
1971年 | 6篇 |
1966年 | 4篇 |
排序方式: 共有3776条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
Enterprise Architecture Management (EAM) is discussed in academia and industry as a vehicle to guide IT implementations, alignment, compliance assessment, or technology management. Still, a lack of knowledge prevails about how EAM can be successfully used, and how positive impact can be realized from EAM. To determine these factors, we identify EAM success factors and measures through literature reviews and exploratory interviews and propose a theoretical model that explains key factors and measures of EAM success. We test our model with data collected from a cross-sectional survey of 133 EAM practitioners. The results confirm the existence of an impact of four distinct EAM success factors, ‘EAM product quality’, ‘EAM infrastructure quality’, ‘EAM service delivery quality’, and ‘EAM organizational anchoring’, and two important EAM success measures, ‘intentions to use EAM’ and ‘Organizational and Project Benefits’ in a confirmatory analysis of the model. We found the construct ‘EAM organizational anchoring’ to be a core focal concept that mediated the effect of success factors such as ‘EAM infrastructure quality’ and ‘EAM service quality’ on the success measures. We also found that ‘EAM satisfaction’ was irrelevant to determining or measuring success. We discuss implications for theory and EAM practice. 相似文献
103.
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases (Motik and Rosati, 2010 [52]), and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based semantics and the traditional Well-Founded Semantics for logic programs. Moreover, our proposal allows for the detection of inconsistencies, possibly occurring in tightly integrated ontology axioms and rules, with only little additional effort. We also identify tractable fragments of the resulting language. 相似文献
104.
Emanuel Gull Philipp Werner Sebastian Fuchs Brigitte Surer Thomas Pruschke Matthias Troyer 《Computer Physics Communications》2011,182(4):1078-1082
Continuous-time quantum Monte Carlo impurity solvers are algorithms that sample the partition function of an impurity model using diagrammatic Monte Carlo techniques. The present paper describes codes that implement the interaction expansion algorithm originally developed by Rubtsov, Savkin, and Lichtenstein, as well as the hybridization expansion method developed by Werner, Millis, Troyer, et al. These impurity solvers are part of the ALPS-DMFT application package and are accompanied by an implementation of dynamical mean-field self-consistency equations for (single orbital single site) dynamical mean-field problems with arbitrary densities of states.
Program summary
Program title: dmftCatalogue identifier: AEIL_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIL_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: ALPS LIBRARY LICENSE version 1.1No. of lines in distributed program, including test data, etc.: 899 806No. of bytes in distributed program, including test data, etc.: 32 153 916Distribution format: tar.gzProgramming language: C++Operating system: The ALPS libraries have been tested on the following platforms and compilers:•
Linux with GNU Compiler Collection (g++ version 3.1 and higher), and Intel C++ Compiler (icc version 7.0 and higher) •
MacOS X with GNU Compiler (g++ Apple-version 3.1, 3.3 and 4.0) •
IBM AIX with Visual Age C++ (xlC version 6.0) and GNU (g++ version 3.1 and higher) compilers •
Compaq Tru64 UNIX with Compq C++ Compiler (cxx) •
SGI IRIX with MIPSpro C++ Compiler (CC) •
HP-UX with HP C++ Compiler (aCC) •
Windows with Cygwin or coLinux platforms and GNU Compiler Collection (g++ version 3.1 and higher)
[1]
A. Albuquerque, F. Alet, P. Corboz, et al., J. Magn. Magn. Mater. 310 (2007) 1187. [2]
http://arxiv.org/abs/1012.4474, Rev. Mod. Phys., in press.
105.
Matthias Jungmann Margarete Kopal Christoph ClauserThomas Berlage 《Computers & Geosciences》2011,37(4):541-553
Electrical borehole wall images represent micro-resistivity measurements at the borehole wall. The lithology reconstruction is often based on visual interpretation done by geologists. This analysis is very time-consuming and subjective. Different geologists may interpret the data differently. In this work, linear discriminant analysis (LDA) in combination with texture features is used for an automated lithology reconstruction of ODP (Ocean Drilling Program) borehole 1203A drilled during Leg 197. Six rock groups are identified by their textural properties in resistivity data obtained by a Formation MircoScanner (FMS). Although discriminant analysis can be used for multi-class classification, non-optimal decision criteria for certain groups could emerge. For this reason, we use a combination of 2-class (binary) classifiers to increase the overall classification accuracy. The generalization ability of the combined classifiers is evaluated and optimized on a testing dataset where a classification rate of more than 80% for each of the six rock groups is achieved. The combined, trained classifiers are then applied on the whole dataset obtaining a statistical reconstruction of the logged formation. Compared to a single multi-class classifier the combined binary classifiers show better classification results for certain rock groups and more stable results in larger intervals of equal rock type. 相似文献
106.
Matthias B. StuartAuthor Vitae Jens SparsøAuthor Vitae 《Microprocessors and Microsystems》2011,35(7):632-642
This paper presents an analytical method to derive the worst-case traffic pattern caused by a task graph mapped to a cache-coherent shared-memory system. Our analysis allows designers to rapidly evaluate the impact of different mappings of tasks to IP cores on the traffic pattern. The accuracy varies with the application’s data sharing pattern, and is around 65% in the average case and 1% in the best case when considering the traffic pattern as a whole. For individual connections, our method produces tight worst-case bandwidths. 相似文献
107.
Martin Seiler Denis Steinemann Jonas Spillmann Matthias Harders 《The Visual computer》2011,27(6-8):519-529
We present an adaptive octree based approach for interactive cutting of deformable objects. Our technique relies on efficient refine- and node split-operations. These are sufficient to robustly represent cuts in the mechanical simulation mesh. A high-resolution surface embedded into the octree is employed to represent a cut visually. Model modification is performed in the rest state of the object, which is accomplished by back-transformation of the blade geometry. This results in an improved robustness of our approach. Further, an efficient update of the correspondences between simulation elements and surface vertices is proposed. The robustness and efficiency of our approach is underlined in test examples as well as by integrating it into a prototype surgical simulator. 相似文献
108.
We present a new foreign-function interface for SML/NJ. It is based on the idea of data-level interoperability—the ability of ML programs to inspect as well as manipulate C data structures directly.The core component of this work is an encoding of the almost2 complete C type system in ML types. The encoding makes extensive use of a “folklore” typing trick, taking advantage of ML's polymorphism, its type constructors, its abstraction mechanisms, and even functors. A small low-level component which deals with C struct and union declarations as well as program linkage is hidden from the programmer's eye by a simple program-generator tool that translates C declarations to corresponding ML glue code. 相似文献
109.
110.
Visual cryptography and (k,n)-visual secret sharing schemes were introduced by Naor and Shamir (Advances in Cryptology — Eurocrypt 94, Springer, Berlin, 1995, pp. 1–12). A sender wishing to transmit a secret message distributes n transparencies amongst n recipients, where the transparencies contain seemingly random pictures. A (k,n)-scheme achieves the following situation: If any k recipients stack their transparencies together, then a secret message is revealed visually. On the other hand, if only k−1 recipients stack their transparencies, or analyze them by any other means, they are not able to obtain any information about the secret message. The important parameters of a scheme are its contrast, i.e., the clarity with which the message becomes visible, and the number of subpixels needed to encode one pixel of the original picture. Naor and Shamir constructed (k,k)-schemes with contrast 2−(k−1). By an intricate result from Linial (Combinatorica 10 (1990) 349–365), they were also able to prove the optimality of these schemes. They also proved that for all fixed kn, there are (k,n)-schemes with contrast
. For k=2,3,4 the contrast is approximately
and
. In this paper, we show that by solving a simple linear program, one is able to compute exactly the best contrast achievable in any (k,n)-scheme. The solution of the linear program also provides a representation of a corresponding scheme. For small k as well as for k=n, we are able to analytically solve the linear program. For k=2,3,4, we obtain that the optimal contrast is at least
and
. For k=n, we obtain a very simple proof of the optimality of Naor's and Shamir's (k,k)-schemes. In the case k=2, we are able to use a different approach via coding theory which allows us to prove an optimal tradeoff between the contrast and the number of subpixels. 相似文献