全文获取类型
收费全文 | 4197篇 |
免费 | 121篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 57篇 |
综合类 | 2篇 |
化学工业 | 978篇 |
金属工艺 | 127篇 |
机械仪表 | 74篇 |
建筑科学 | 173篇 |
矿业工程 | 30篇 |
能源动力 | 53篇 |
轻工业 | 390篇 |
水利工程 | 22篇 |
石油天然气 | 9篇 |
无线电 | 329篇 |
一般工业技术 | 565篇 |
冶金工业 | 1076篇 |
原子能技术 | 42篇 |
自动化技术 | 393篇 |
出版年
2022年 | 38篇 |
2021年 | 52篇 |
2020年 | 54篇 |
2019年 | 48篇 |
2018年 | 62篇 |
2017年 | 44篇 |
2016年 | 70篇 |
2015年 | 64篇 |
2014年 | 90篇 |
2013年 | 93篇 |
2012年 | 136篇 |
2011年 | 162篇 |
2010年 | 137篇 |
2009年 | 130篇 |
2008年 | 128篇 |
2007年 | 121篇 |
2006年 | 112篇 |
2005年 | 138篇 |
2004年 | 86篇 |
2003年 | 79篇 |
2002年 | 98篇 |
2001年 | 96篇 |
2000年 | 88篇 |
1999年 | 89篇 |
1998年 | 322篇 |
1997年 | 192篇 |
1996年 | 138篇 |
1995年 | 124篇 |
1994年 | 103篇 |
1993年 | 108篇 |
1992年 | 65篇 |
1991年 | 63篇 |
1990年 | 59篇 |
1989年 | 53篇 |
1988年 | 43篇 |
1987年 | 41篇 |
1986年 | 40篇 |
1985年 | 51篇 |
1984年 | 36篇 |
1983年 | 34篇 |
1982年 | 42篇 |
1981年 | 43篇 |
1980年 | 35篇 |
1979年 | 53篇 |
1978年 | 30篇 |
1977年 | 52篇 |
1976年 | 100篇 |
1975年 | 37篇 |
1974年 | 26篇 |
1972年 | 22篇 |
排序方式: 共有4320条查询结果,搜索用时 31 毫秒
101.
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. 相似文献
102.
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. 相似文献103.
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. 相似文献
104.
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. 相似文献
105.
106.
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. 相似文献
107.
Human eye-head co-ordination in natural exploration 总被引:1,自引:0,他引:1
Einhäuser W Schumann F Bardins S Bartl K Böning G Schneider E König P 《Network (Bristol, England)》2007,18(3):267-297
During natural behavior humans continuously adjust their gaze by moving head and eyes, yielding rich dynamics of the retinal input. Sensory coding models, however, typically assume visual input as smooth or a sequence of static images interleaved by volitional gaze shifts. Are these assumptions valid during free exploration behavior in natural environments? We used an innovative technique to simultaneously record gaze and head movements in humans, who freely explored various environments (forest, train station, apartment). Most movements occur along the cardinal axes, and the predominance of vertical or horizontal movements depends on the environment. Eye and head movements co-occur more frequently than their individual statistics predicts under an independence assumption. The majority of co-occurring movements point in opposite directions, consistent with a gaze-stabilizing role of eye movements. Nevertheless, a substantial fraction of eye movements point in the same direction as co-occurring head movements. Even under the very most conservative assumptions, saccadic eye movements alone cannot account for these synergistic movements. Hence nonsaccadic eye movements that interact synergistically with head movements to adjust gaze cannot be neglected in natural visual input. Natural retinal input is continuously dynamic, and cannot be faithfully modeled as a mere sequence of static frames with interleaved large saccades. 相似文献
108.
Kriger J Schneider J Westermann R 《IEEE transactions on visualization and computer graphics》2006,12(5):941-948
Volume rendered imagery often includes a barrage of 3D information like shape, appearance and topology of complex structures, and it thus quickly overwhelms the user. In particular, when focusing on a specific region a user cannot observe the relationship between various structures unless he has a mental picture of the entire data. In this paper we present ClearView, a GPU-based, interactive framework for texture-based volume ray-casting that allows users which do not have the visualization skills for this mental exercise to quickly obtain a picture of the data in a very intuitive and user-friendly way. ClearView is designed to enable the user to focus on particular areas in the data while preserving context information without visual clutter. ClearView does not require additional feature volumes as it derives any features in the data from image information only. A simple point-and-click interface enables the user to interactively highlight structures in the data. ClearView provides an easy to use interface to complex volumetric data as it only uses transparency in combination with a few specific shaders to convey focus and context information. 相似文献
109.
110.
Johannes Blümlein Sebastian Klein Carsten Schneider Flavia Stan 《Journal of Symbolic Computation》2012
Given a Feynman parameter integral, depending on a single discrete variable N and a real parameter ε, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in ε. In a first step, the integrals are expressed by hypergeometric multi-sums by means of symbolic transformations. Given this sum format, we develop new summation tools to extract the first coefficients of its series expansion whenever they are expressible in terms of indefinite nested product–sum expressions. In particular, we enhance the known multi-sum algorithms to derive recurrences for sums with complicated boundary conditions, and we present new algorithms to find formal Laurent series solutions of a given recurrence relation. 相似文献