全文获取类型
收费全文 | 4186篇 |
免费 | 144篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 57篇 |
综合类 | 18篇 |
化学工业 | 940篇 |
金属工艺 | 122篇 |
机械仪表 | 67篇 |
建筑科学 | 197篇 |
矿业工程 | 31篇 |
能源动力 | 65篇 |
轻工业 | 410篇 |
水利工程 | 27篇 |
石油天然气 | 9篇 |
无线电 | 326篇 |
一般工业技术 | 574篇 |
冶金工业 | 1048篇 |
原子能技术 | 39篇 |
自动化技术 | 403篇 |
出版年
2023年 | 31篇 |
2022年 | 63篇 |
2021年 | 80篇 |
2020年 | 71篇 |
2019年 | 66篇 |
2018年 | 82篇 |
2017年 | 59篇 |
2016年 | 90篇 |
2015年 | 76篇 |
2014年 | 102篇 |
2013年 | 119篇 |
2012年 | 143篇 |
2011年 | 174篇 |
2010年 | 139篇 |
2009年 | 128篇 |
2008年 | 136篇 |
2007年 | 136篇 |
2006年 | 115篇 |
2005年 | 145篇 |
2004年 | 90篇 |
2003年 | 84篇 |
2002年 | 92篇 |
2001年 | 92篇 |
2000年 | 86篇 |
1999年 | 85篇 |
1998年 | 304篇 |
1997年 | 179篇 |
1996年 | 129篇 |
1995年 | 116篇 |
1994年 | 85篇 |
1993年 | 91篇 |
1992年 | 56篇 |
1991年 | 55篇 |
1990年 | 54篇 |
1989年 | 48篇 |
1988年 | 37篇 |
1987年 | 34篇 |
1986年 | 35篇 |
1985年 | 42篇 |
1984年 | 30篇 |
1983年 | 31篇 |
1982年 | 38篇 |
1981年 | 37篇 |
1980年 | 31篇 |
1979年 | 50篇 |
1978年 | 21篇 |
1977年 | 48篇 |
1976年 | 91篇 |
1975年 | 23篇 |
1972年 | 18篇 |
排序方式: 共有4333条查询结果,搜索用时 15 毫秒
51.
Mike Espig Wolfgang Hackbusch Stefan Handschuh Reinhold Schneider 《Computing and Visualization in Science》2011,14(6):271-285
We discuss the calculus of variations in tensor representations with a special focus on tensor networks and apply it to functionals of practical interest. The survey provides all necessary ingredients for applying minimization methods in a general setting. The important cases of target functionals which are linear and quadratic with respect to the tensor product are discussed, and combinations of these functionals are presented in detail. As an example, we consider the representation rank compression in tensor networks. For the numerical treatment, we use the nonlinear block Gauss?CSeidel method. We demonstrate the rate of convergence in numerical tests. 相似文献
52.
This paper presents an innovative approach for initiating processes of a transactive memory system in newly formed groups of experts collaborating computer-supported in a complex problem-solving task. Our empirical study compared 15 experimental and 15 control groups, each consisting of triads. In the experimental condition, the triads were provided with a tool for fostering knowledge and information awareness, that is, being informed about the knowledge and the underlying information of the collaboration partners in form of digital concept maps. In the control condition, the groups had no access to this tool. Results confirmed the potential of the tool to initiate processes of a transactive memory system: shared agreement of the knowledge of the other group members’ knowledge proved to influence group performance positively. In addition, previous findings of the tool’s potential to establish knowledge and information awareness and to augment group performance could be replicated. However, the postulated mediating effect of processes of a transactive memory system concerning the impact of knowledge and information awareness on group performance did not reach statistical significance. Aspects for future studies and implications of these findings regarding their practical implementation, for example, in teams of organizations, are discussed. 相似文献
53.
Dennis Heinson York Yannikos Frederik Franke Christian Winter Markus Schneider 《Datenschutz und Datensicherheit - DuD》2010,34(2):75-79
Der Einsatz von Informationstechnologie (IT) in Organisationen bietet viele M?glichkeiten des Missbrauchs. Besch?ftigte k?nnen
sich die besonderen Eigenschaften der IT zunutze machen, um sich etwa in gesch?ftssch?digender Weise Vorteile zu verschaffen.
Gleichzeitig erm?glicht IT aber auch, verbotene Handlungen aufzuspüren und zu belegen (IT-Forensik). Der Beitrag beschreibt
die technische Praxis von IT-forensischen Analysen und geht auf damit verbundene rechtliche Fragestellungen ein. 相似文献
54.
Xiaoxu Guan C.J. Noble O. Zatsarinny K. Bartschat B.I. Schneider 《Computer Physics Communications》2009,180(12):2401-2409
We describe a general ab initio and non-perturbative method to solve the time-dependent Schrödinger equation (TDSE) for the interaction of a strong attosecond laser pulse with a general atom. While the field-free Hamiltonian and the dipole matrices may be generated using an arbitrary primitive basis, they are assumed to have been transformed to the eigenbasis of the problem before the solution of the TDSE is propagated in time using the Arnoldi–Lanczos method. Probabilities for survival of the ground state, excitation, and single ionization can be extracted from the propagated wavefunction.
Program summary
Program title: ALTDSECatalogue identifier: AEDM_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDM_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 2154No. of bytes in distributed program, including test data, etc.: 30 827Distribution format: tar.gzProgramming language: Fortran 95. [A Fortran 2003 call to “flush” is used to simplify monitoring the output file during execution. If this function is not available, these statements should be commented out.].Computer: Shared-memory machinesOperating system: Linux, OpenMPHas the code been vectorized or parallelized?: YesRAM: Several Gb, depending on matrix size and number of processorsSupplementary material: To facilitate the execution of the program, Hamiltonian field-free and dipole matrix files are provided.Classification: 2.5External routines: LAPACK, BLASNature of problem: We describe a computer program for a general ab initio and non-perturbative method to solve the time-dependent Schrödinger equation (TDSE) for the interaction of a strong attosecond laser pulse with a general atom [1,2]. The probabilities for survival of the initial state, excitation of discrete states, and single ionization due to multi-photon processes can be obtained.Solution method: The solution of the TDSE is propagated in time using the Arnoldi–Lanczos method. The field-free Hamiltonian and the dipole matrices, originally generated in an arbitrary basis (e.g., the flexible B-spline R-matrix (BSR) method with non-orthogonal orbitals [3]), must be provided in the eigenbasis of the problem as input.Restrictions: The present program is restricted to a 1Se initial state and linearly polarized light. This is the most common situation experimentally, but a generalization is straightforward.Running time: Several hours, depending on the number of threads used.References: [1] X. Guan, O. Zatsarinny, K. Bartschat, B.I. Schneider, J. Feist, C.J. Noble, Phys. Rev. A 76 (2007) 053411. [2] X. Guan, C.J. Noble, O. Zatsarinny, K. Bartschat, B.I. Schneider, Phys. Rev. A 78 (2008) 053402. [3] O. Zatsarinny, Comput. Phys. Comm. 174 (2006) 273. 相似文献55.
This paper examines and classifies the computational complexity of model checking and satisfiability for hybrid logics over
frames with equivalence relations. The considered languages contain all possible combinations of the downarrow binder, the
existential binder, the satisfaction operator, and the global modality, ranging from the minimal hybrid language to very expressive
languages. For model checking, we separate polynomial-time solvable from PSPACE-complete cases, and for satisfiability, we
exhibit cases complete for NP, PSpace, NExpTime, and even N2ExpTime. Our analysis includes the versions of all these languages without atomic propositions, and also complete frames. 相似文献
56.
Vasileios Belagiannis Xinchao Wang Horesh Beny Ben Shitrit Kiyoshi Hashimoto Ralf Stauder Yoshimitsu Aoki Michael Kranzfelder Armin Schneider Pascal Fua Slobodan Ilic Hubertus Feussner Nassir Navab 《Machine Vision and Applications》2016,27(7):1035-1046
Multiple human pose estimation is an important yet challenging problem. In an operating room (OR) environment, the 3D body poses of surgeons and medical staff can provide important clues for surgical workflow analysis. For that purpose, we propose an algorithm for localizing and recovering body poses of multiple human in an OR environment under a multi-camera setup. Our model builds on 3D Pictorial Structures and 2D body part localization across all camera views, using convolutional neural networks (ConvNets). To evaluate our algorithm, we introduce a dataset captured in a real OR environment. Our dataset is unique, challenging and publicly available with annotated ground truths. Our proposed algorithm yields to promising pose estimation results on this dataset. 相似文献
57.
Anjana Ramkumar Pieter Jan Stappers Wiro J. Niessen Sonja Adebahr Tanja Schimek-Jasch Ursula Nestle 《International journal of human-computer interaction》2017,33(2):123-134
HCI plays an important role in interactive medical image segmentation. The Goals, Operators, Methods, and Selection rules (GOMS) model and the National Aeronautics and Space Administration Task Load Index (NASA-TLX) questionnaire are different methods that are often used to evaluate the HCI process. In this article, we aim at improving the HCI process of interactive segmentation using both the GOMS model and the NASA-TLX questionnaire to: 1) identify the relations between these two methods and 2) propose HCI design suggestions based on the synthesis of the evaluation results using both methods. For this, we conducted an experiment where three physicians used two interactive segmentation approaches to segment different types of organs at risk for radiotherapy planning. Using the GOMS model, we identified 16 operators and 10 methods. Further analysis discovered strong relations between the use of GOMS operators and the results of the NASA-TLX questionnaire. Finally, HCI design issues were identified, and suggestions were proposed based on the evaluation results and the identified relations. 相似文献
58.
59.
Jens MaßbergJan Schneider 《Theoretical computer science》2011,412(50):6948-6958
We formulate a generalization of the NP-complete rectangle packing problem by parameterizing it in terms of packing density, the ratio of rectangle areas, and the aspect ratio of individual rectangles. Then we show that almost all restrictions of this problem remain NP-complete and identify some cases where the answer to the decision problem can be found in constant time. 相似文献
60.
Gregory Larson Deryl Snyder David Vanden Abeele Tanja Clees 《Computing and Visualization in Science》2008,11(1):27-40
Single- and multi-level iterative methods for sparse linear systems are applied to unsteady flow simulations via implementation
into a direct numerical simulation solver for incompressible turbulent flows on unstructured meshes. The performance of these
solution methods, implemented in the well-established SAMG and ML packages, are quantified in terms of computational speed
and memory consumption, with a direct sparse LU solver (SuperLU) used as a reference. The classical test case of unsteady
flow over a circular cylinder at low Reynolds numbers is considered, employing a series of increasingly fine anisotropic meshes.
As expected, the memory consumption increases dramatically with the considered problem size for the direct solver. Surprisingly,
however, the computation times remain reasonable. The speed and memory usage of pointwise algebraic and smoothed aggregation
multigrid solvers are found to exhibit near-linear scaling. As an alternative to multi-level solvers, a single-level ILUT-preconditioned
GMRES solver with low drop tolerance is also considered. This solver is found to perform sufficiently well only on small meshes.
Even then, it is outperformed by pointwise algebraic multigrid on all counts. Finally, the effectiveness of pointwise algebraic
multigrid is illustrated by considering a large three-dimensional direct numerical simulation case using a novel parallelization
approach on a large distributed memory computing cluster. 相似文献