全文获取类型
收费全文 | 4451篇 |
免费 | 226篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 54篇 |
综合类 | 3篇 |
化学工业 | 947篇 |
金属工艺 | 86篇 |
机械仪表 | 67篇 |
建筑科学 | 269篇 |
矿业工程 | 4篇 |
能源动力 | 196篇 |
轻工业 | 471篇 |
水利工程 | 30篇 |
石油天然气 | 9篇 |
无线电 | 384篇 |
一般工业技术 | 822篇 |
冶金工业 | 416篇 |
原子能技术 | 32篇 |
自动化技术 | 897篇 |
出版年
2023年 | 44篇 |
2022年 | 66篇 |
2021年 | 124篇 |
2020年 | 83篇 |
2019年 | 99篇 |
2018年 | 109篇 |
2017年 | 101篇 |
2016年 | 138篇 |
2015年 | 125篇 |
2014年 | 159篇 |
2013年 | 284篇 |
2012年 | 287篇 |
2011年 | 341篇 |
2010年 | 295篇 |
2009年 | 265篇 |
2008年 | 276篇 |
2007年 | 238篇 |
2006年 | 206篇 |
2005年 | 177篇 |
2004年 | 155篇 |
2003年 | 135篇 |
2002年 | 120篇 |
2001年 | 59篇 |
2000年 | 74篇 |
1999年 | 53篇 |
1998年 | 64篇 |
1997年 | 53篇 |
1996年 | 55篇 |
1995年 | 43篇 |
1994年 | 51篇 |
1993年 | 34篇 |
1992年 | 27篇 |
1991年 | 27篇 |
1990年 | 23篇 |
1989年 | 29篇 |
1988年 | 17篇 |
1987年 | 25篇 |
1986年 | 21篇 |
1985年 | 21篇 |
1984年 | 22篇 |
1983年 | 19篇 |
1982年 | 23篇 |
1981年 | 17篇 |
1980年 | 13篇 |
1979年 | 18篇 |
1978年 | 9篇 |
1977年 | 15篇 |
1976年 | 10篇 |
1974年 | 7篇 |
1971年 | 6篇 |
排序方式: 共有4687条查询结果,搜索用时 15 毫秒
91.
92.
Adrià Junyent-Ferré Oriol Gomis-Bellmunt Andreas Sumper Marc Sala Montserrat Mata 《Simulation Modelling Practice and Theory》2010,18(9):1365-1381
The present paper deals with the modeling of wind turbine generation systems. The model of a doubly fed induction generator, along with the corresponding converter, crow bar protection and electrical grid is described. The different level control strategies both in normal operation and under voltage dig conditions are discussed, including speed control, torque and reactive power control for the rotor-side converter, reactive and DC voltage control for the grid-side converter and the corresponding current loops control. The results obtained with simulations are compared to experimental data obtained from voltage sags provoked to real wind turbines. 相似文献
93.
Marc Secanell Ron Songprakorp Ned Djilali Afzal Suleman 《Structural and Multidisciplinary Optimization》2010,40(1-6):563-583
A computational framework for fuel cell analysis and optimization is presented as an innovative alternative to the time consuming trial-and-error process currently used for fuel cell design. The framework is based on a two-dimensional through-the-channel isothermal, isobaric and single phase membrane electrode assembly (MEA) model. The model input parameters are the manufacturing parameters used to build the MEA: platinum loading, platinum to carbon ratio, electrolyte content and gas diffusion layer porosity. The governing equations of the fuel cell model are solved using Netwon’s algorithm and an adaptive finite element method in order to achieve near quadratic convergence and a mesh independent solution respectively. The analysis module is used to solve the optimization problem of finding the optimal MEA composition for maximizing performance. To solve the optimization problem a gradient-based optimization algorithm is used in conjunction with analytical sensitivities. By using a gradient-based method and analytical sensitivities, the framework presented is capable of solving a complete MEA optimization problem with state-of-the-art electrode models in approximately 30 min, making it a viable alternative for solving large-scale fuel cell problems. 相似文献
94.
Luis M. Torres Ramiro Torres Ralf Borndörfer Marc E. Pfetsch 《International Transactions in Operational Research》2011,18(4):455-472
We discuss an optimization model for the line planning problem in public transport in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the computational complexity of this problem for tree network topologies as well as several categories of line operations that are important for the Quito Trolebús system. In practice, these instances can be solved quite well, and significant optimization potentials can be demonstrated. 相似文献
95.
Phase equilibria in a system constituted of an alloy nanoparticle in contact with a solid nanowire have been modelled based on the minimization of a Gibbs free energy function. The Gibbs free energy consists of a bulk, surface and interface contribution. The bulk contribution is taken from CALPHAD thermodynamic databases and the surface properties from the literature. The effect of particle size and surface and interfacial properties on the liquidus line of the Au-Ge and In-Si systems has been studied. The results are compared to the bulk phase diagram and phase equilibria calculated for nano-systems with different geometries. 相似文献
96.
97.
Sudipta N. Sinha Jan-Michael Frahm Marc Pollefeys Yakup Genc 《Machine Vision and Applications》2011,22(1):207-217
This paper describes novel implementations of the KLT feature tracking and SIFT feature extraction algorithms that run on
the graphics processing unit (GPU) and is suitable for video analysis in real-time vision systems. While significant acceleration
over standard CPU implementations is obtained by exploiting parallelism provided by modern programmable graphics hardware,
the CPU is freed up to run other computations in parallel. Our GPU-based KLT implementation tracks about a thousand features
in real-time at 30 Hz on 1,024 × 768 resolution video which is a 20 times improvement over the CPU. The GPU-based SIFT implementation
extracts about 800 features from 640 × 480 video at 10 Hz which is approximately 10 times faster than an optimized CPU implementation. 相似文献
98.
Markus Haas Stefan Mittnik Marc S. Paolella 《Computational statistics & data analysis》2009,53(6):2129-2154
An asymmetric multivariate generalization of the recently proposed class of normal mixture GARCH models is developed. Issues of parametrization and estimation are discussed. Conditions for covariance stationarity and the existence of the fourth moment are derived, and expressions for the dynamic correlation structure of the process are provided. In an application to stock market returns, it is shown that the disaggregation of the conditional (co)variance process generated by the model provides substantial intuition. Moreover, the model exhibits a strong performance in calculating out-of-sample Value-at-Risk measures. 相似文献
99.
Marc Baboulin Alfredo Buttari Jack Dongarra Jakub Kurzak Julie Langou Julien Langou Piotr Luszczek Stanimire Tomov 《Computer Physics Communications》2009,180(12):2526-2533
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to other technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the STI Cell BE processor. Results on modern processor architectures and the STI Cell BE are presented.
Program summary
Program title: ITER-REFCatalogue identifier: AECO_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AECO_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.: 7211No. of bytes in distributed program, including test data, etc.: 41 862Distribution format: tar.gzProgramming language: FORTRAN 77Computer: desktop, serverOperating system: Unix/LinuxRAM: 512 MbytesClassification: 4.8External routines: BLAS (optional)Nature of problem: On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution.Solution method: Mixed precision algorithms stem from the observation that, in many cases, a single precision solution of a problem can be refined to the point where double precision accuracy is achieved. A common approach to the solution of linear systems, either dense or sparse, is to perform the LU factorization of the coefficient matrix using Gaussian elimination. First, the coefficient matrix A is factored into the product of a lower triangular matrix L and an upper triangular matrix U. Partial row pivoting is in general used to improve numerical stability resulting in a factorization PA=LU, where P is a permutation matrix. The solution for the system is achieved by first solving Ly=Pb (forward substitution) and then solving Ux=y (backward substitution). Due to round-off errors, the computed solution, x, carries a numerical error magnified by the condition number of the coefficient matrix A. In order to improve the computed solution, an iterative process can be applied, which produces a correction to the computed solution at each iteration, which then yields the method that is commonly known as the iterative refinement algorithm. Provided that the system is not too ill-conditioned, the algorithm produces a solution correct to the working precision.Running time: seconds/minutes 相似文献100.
Inah Omoronyia John Ferguson Marc Roper Murray Wood 《Computer Supported Cooperative Work (CSCW)》2009,18(5-6):509-558
Software development is a global activity unconstrained by the bounds of time and space. A major effect of this increasing scale and distribution is that the shared understanding that developers previously acquired by formal and informal face-to-face meetings is difficult to obtain. This paper proposes a shared awareness model that uses information gathered automatically from developer IDE interactions to make explicit orderings of tasks, artefacts and developers that are relevant to particular work contexts in collaborative, and potentially distributed, software development projects. The research findings suggest that such a model can be used to: identify entities (developers, tasks, artefacts) most associated with a particular work context in a software development project; identify relevance relationships amongst tasks, developers and artefacts e.g. which developers and artefacts are currently most relevant to a task or which developers have contributed to a task over time; and, can be used to identify potential bottlenecks in a project through a ‘social graph’ view. Furthermore, this awareness information is captured and provided as developers work in different locations and at different times. 相似文献