全文获取类型
收费全文 | 1364篇 |
免费 | 46篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 15篇 |
综合类 | 2篇 |
化学工业 | 373篇 |
金属工艺 | 19篇 |
机械仪表 | 36篇 |
建筑科学 | 64篇 |
矿业工程 | 2篇 |
能源动力 | 39篇 |
轻工业 | 146篇 |
水利工程 | 9篇 |
石油天然气 | 1篇 |
无线电 | 116篇 |
一般工业技术 | 204篇 |
冶金工业 | 80篇 |
原子能技术 | 11篇 |
自动化技术 | 298篇 |
出版年
2023年 | 16篇 |
2022年 | 47篇 |
2021年 | 61篇 |
2020年 | 25篇 |
2019年 | 28篇 |
2018年 | 33篇 |
2017年 | 33篇 |
2016年 | 58篇 |
2015年 | 31篇 |
2014年 | 40篇 |
2013年 | 98篇 |
2012年 | 84篇 |
2011年 | 93篇 |
2010年 | 69篇 |
2009年 | 74篇 |
2008年 | 61篇 |
2007年 | 66篇 |
2006年 | 64篇 |
2005年 | 48篇 |
2004年 | 48篇 |
2003年 | 40篇 |
2002年 | 36篇 |
2001年 | 21篇 |
2000年 | 17篇 |
1999年 | 16篇 |
1998年 | 33篇 |
1997年 | 30篇 |
1996年 | 14篇 |
1995年 | 18篇 |
1994年 | 19篇 |
1993年 | 15篇 |
1992年 | 10篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 5篇 |
1983年 | 9篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1973年 | 2篇 |
1970年 | 2篇 |
1963年 | 1篇 |
1903年 | 1篇 |
排序方式: 共有1415条查询结果,搜索用时 15 毫秒
11.
Francesca Guidi Giovanni Carta Gilberto Rossetto Guido Salmaso 《Electrochimica acta》2005,50(23):4609-4614
Alumina (Al2O3) coatings of different thickness were deposited on OT59 brass substrate (BS) using the metal organic chemical vapour deposition (MOCVD) technique to evaluate the corrosion performance by EIS measurements. The used precursor was dimethyl-aluminium-isopropoxide. Electrochemical characterizations of the deposited films were performed in a standard very aggressive acidic solution (aerated 1N H2SO4 at 25 °C up to 168 h of immersion time) by means of direct current method (Tafel curves) and electrochemical impedance spectroscopy (EIS). The Rutherford backscattering spectroscopy (RBS) indicated that the films are very pure with the correct Al2O3 stoichiometry, while the IR absorption spectra showed that the films did not contain any OH groups. The surface film morphology was investigated by atomic force microscopy (AFM) and displayed a globular texture. The films were very smooth, with a maximum root mean square roughness, for example, of 14 nm for a 0.96 μm thick coating. The EIS data confirmed, as expected, that a 2.40 μm Al2O3 layer ensures the best corrosion protection after 168 h of immersion in the very acidic environment used. 相似文献
12.
Parsing details like author names and titles out of bibliographic references of scientific publications is an important issue that has received considerable attention recently. However, most existing techniques are tailored to the highly standardized reference styles used in the last two to three decades. They do not perform well with the wide variety of reference styles used in older, historic publications. Thus, they are of limited use when creating comprehensive bibliographies covering both historic and contemporary scientific publications. This paper presents a generic approach to bibliographic reference parsing, named RefParse, which is independent of any specific reference style. Its core feature is an inference mechanism that exploits the regularities inherent in any list of references to deduce its format. In addition, our approach learns names of authors, journals, and publishers to increase the accuracy in scenarios where human users double check parsing results to increase data quality. Our evaluation shows that our approach performs comparably to existing ones with contemporary reference lists and also works well with older ones. 相似文献
13.
Maxim Shishmarev Christopher Mears Guido Tack Maria Garcia de la Banda 《Constraints》2016,21(1):77-94
Understanding how the search space is explored for a given constraint problem – and how it changes for different models, solvers or search strategies – is crucial for efficient solving. Yet programmers often have to rely on the crude aggregate measures of the search that are provided by solvers, or on visualisation tools that can show the search tree, but do not offer sophisticated ways to navigate and analyse it, particularly for large trees. We present an architecture for profiling a constraint programming search that is based on a lightweight instrumentation of the solver. The architecture combines a visualisation of the search tree with various tools for convenient navigation and analysis of the search. These include identifying repeated subtrees, high-level abstraction and navigation of the tree, and the comparison of two search trees. The resulting system is akin to a traditional program profiler, which helps the user to focus on the parts of the execution where an improvement to their program would have the greatest effect. 相似文献
14.
Adriana Caione Anna Lisa Guido Angelo Martella Roberto Paiano Andrea Pandurino 《Information Systems and E-Business Management》2016,14(3):533-576
Enterprise activities are governed by regulations and laws that are multiple, heterogeneous and not always easy to understand. The arising and/or the modification of these regulations and laws can cause a significant impact in the business context, especially in terms of enterprise information systems adaptation. Currently, there are many methodological and technological tools that facilitate the application of regulations and procedures, but they are not integrated enough to ensure a complete problem management. Therefore, they are not sufficient to support organizations and companies in the management of their business processes. In this paper we propose a methodological and technological solution, able to model, manage, execute and monitor business processes of complex domains. The system allows both the design of an information system and its prototyping as a web application, by the extension of an appropriately selected Business Process Management suite. During both the design and the usage phases of the prototyped information system, it is possible to interface with a knowledge base that contains information about regulations and aspects that characterize the enterprise (organizational chart, tasks, etc.). 相似文献
15.
Tom Schrijvers Guido Tack Pieter Wuille Horst Samulowitz Peter J. Stuckey 《Constraints》2013,18(2):269-305
The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the developer of a constraint solver. The article discusses two modular implementation approaches and shows, by empirical evaluation, that search combinators can be implemented without overhead compared to a native, direct implementation in a constraint solver. 相似文献
16.
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear constraints both with unit and non-unit coefficients? Constraint variants are ubiquitous: implementing them requires considerable (if not prohibitive) effort and decreases maintainability, but will deliver better performance than resorting to constraint decomposition. This paper shows how to use views to derive propagator variants, combining the efficiency of dedicated propagator implementations with the simplicity and effortlessness of decomposition. A model for views and derived propagators is introduced. Derived propagators are proved to be perfect in that they inherit essential properties such as correctness and domain and bounds consistency. Techniques for systematically deriving propagators such as transformation, generalization, specialization, and type conversion are developed. The paper introduces an implementation architecture for views that is independent of the underlying constraint programming system. A detailed evaluation of views implemented in Gecode shows that derived propagators are efficient and that views often incur no overhead. Views have proven essential for implementing Gecode, substantially reducing the amount of code that needs to be written and maintained. 相似文献
17.
Guido Böttcher Dennis Allerkamp Daniel Glöckner Franz-Erich Wolter 《The Visual computer》2008,24(10):911-922
Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications,
where high frame rates are necessary for obtaining a satisfying experience. In this paper, we present an interactive cloth
simulation system that offers a compromise between a realistic physics-based simulation of fabrics and a haptic application
meeting high requirements in terms of computation speed. Our system allows the user to interact with the fabric using two
fingers. The required performance of the system is achieved by introducing an intermediate layer responsible for the simulation
of the small part of the surface being in contact with the fingers. Additionally we separate the possible contact situations
into different cases, each being individually handled by a specialised contact algorithm.
相似文献
Franz-Erich WolterEmail: |
18.
Jan-Patrick Elsholz Guido de Melo Marc Hermann Michael Weber 《Pervasive and Mobile Computing》2009,5(5):592-605
Ambient displays provide us with information in the background of our awareness. However, as each user has individual wishes and needs of how, which and when information is presented, the acceptance of ambient displays is low.In this paper we introduce an extensible architecture for personalized ambient information.We employ a notification system to extend the capability of a fixture to display more than one variable. Multiple variables can be updated by multiple information providers. Thereby, our architecture covers a broader spectrum of notifications from alarms to ambient information.We evaluate our concept within a dual-task experiment in comparison to preset notifications. The results show a level of self-interruption which is significantly lower than using preset notifications. Therefore our approach outperforms preset notifications and moves ambient displays closer to secondary displays in human–computer interaction. 相似文献
19.
The current Web Services Agreement specification draft proposes a simple request-response protocol for agreement creation
only addressing bilateral offer exchanges. This paper proposes a framework augmenting this WS-Agreement to enable negotiations
according to a variety of bilateral and multilateral negotiation protocols. The framework design is based on a thorough analysis
of taxonomies for negotiations from the literature in order to allow for capturing a variety of different negotiation models
within a single, WS-Agreement compatible, framework. In order to provide for the intended flexibility, the proposed protocol
takes a two-stage approach: a meta-protocol is conducted among interested parties to agree on a common negotiation protocol
first before the real negotiation is carried out in the second step due to the protocol established in the first step. 相似文献
20.
The main part of the code presented in this work represents an implementation of the split-operator method [J.A. Fleck, J.R. Morris, M.D. Feit, Appl. Phys. 10 (1976) 129-160; R. Heather, Comput. Phys. Comm. 63 (1991) 446] for calculating the time-evolution of Dirac wave functions. It allows to study the dynamics of electronic Dirac wave packets under the influence of any number of laser pulses and its interaction with any number of charged ion potentials. The initial wave function can be either a free Gaussian wave packet or an arbitrary discretized spinor function that is loaded from a file provided by the user. The latter option includes Dirac bound state wave functions. The code itself contains the necessary tools for constructing such wave functions for a single-electron ion. With the help of self-adaptive numerical grids, we are able to study the electron dynamics for various problems in 2+1 dimensions at high spatial and temporal resolutions that are otherwise unachievable.Along with the position and momentum space probability density distributions, various physical observables, such as the expectation values of position and momentum, can be recorded in a time-dependent way. The electromagnetic spectrum that is emitted by the evolving particle can also be calculated with this code. Finally, for planning and comparison purposes, both the time-evolution and the emission spectrum can also be treated in an entirely classical relativistic way.Besides the implementation of the above-mentioned algorithms, the program also contains a large C++ class library to model the geometric algebra representation of spinors that we use for representing the Dirac wave function. This is why the code is called “Dirac++”.
Program summary
Program title: Dirac++ or (abbreviated) d++Catalogue identifier: AEAS_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAS_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.: 474 937No. of bytes in distributed program, including test data, etc.: 4 128 347Distribution format: tar.gzProgramming language: C++Computer: Any, but SMP systems are preferredOperating system: Linux and MacOS X are actively supported by the current version. Earlier versions were also tested successfully on IRIX and AIXNumber of processors used: Generally unlimited, but best scaling with 2-4 processors for typical problemsRAM: 160 Megabytes minimum for the examples given hereClassification: 2.7External routines: FFTW Library [3,4], Gnu Scientific Library [5], bzip2, bunzip2Nature of problem: The relativistic time evolution of wave functions according to the Dirac equation is a challenging numerical task. Especially for an electron in the presence of high intensity laser beams and/or highly charged ions, this type of problem is of considerable interest to atomic physicists.Solution method: The code employs the split-operator method [1,2], combined with fast Fourier transforms (FFT) for calculating any occurring spatial derivatives, to solve the given problem. An autocorrelation spectral method [6] is provided to generate a bound state for use as the initial wave function of further dynamical studies.Restrictions: The code in its current form is restricted to problems in two spatial dimensions. Otherwise it is only limited by CPU time and memory that one can afford to spend on a particular problem.Unusual features: The code features dynamically adapting position and momentum space grids to keep execution time and memory requirements as small as possible. It employs an object-oriented approach, and it relies on a Clifford algebra class library to represent the mathematical objects of the Dirac formalism which we employ. Besides that it includes a feature (typically called “checkpointing”) which allows the resumption of an interrupted calculation.Additional comments: Along with the program's source code, we provide several sample configuration files, a pre-calculated bound state wave function, and template files for the analysis of the results with both MatLab and Igor Pro.Running time: Running time ranges from a few minutes for simple tests up to several days, even weeks for real-world physical problems that require very large grids or very small time steps.References:- [1]
- J.A. Fleck, J.R. Morris, M.D. Feit, Time-dependent propagation of high energy laser beams through the atmosphere, Appl. Phys. 10 (1976) 129-160.
- [2]
- R. Heather, An asymptotic wavefunction splitting procedure for propagating spatially extended wavefunctions: Application to intense field photodissociation of H+2, Comput. Phys. Comm. 63 (1991) 446.
- [3]
- M. Frigo, S.G. Johnson, FFTW: An adaptive software architecture for the FFT, in: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 3, IEEE, 1998, pp. 1381-1384.
- [4]
- M. Frigo, S.G. Johnson, The design and implementation of FFTW3, in: Proceedings of the IEEE, vol. 93, IEEE, 2005, pp. 216-231. URL: http://www.fftw.org/.
- [5]
- M. Galassi, J. Davies, J. Theiler, B. Gough, G. Jungman, M. Booth, F. Rossi, GNU Scientific Library Reference Manual, second ed., Network Theory Limited, 2006. URL: http://www.gnu.org/software/gsl/.
- [6]
- M.D. Feit, J.A. Fleck, A. Steiger, Solution of the Schrödinger equation by a spectral method, J. Comput. Phys. 47 (1982) 412-433.