全文获取类型
收费全文 | 2451篇 |
免费 | 156篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 39篇 |
综合类 | 6篇 |
化学工业 | 856篇 |
金属工艺 | 39篇 |
机械仪表 | 29篇 |
建筑科学 | 94篇 |
矿业工程 | 10篇 |
能源动力 | 107篇 |
轻工业 | 208篇 |
水利工程 | 8篇 |
石油天然气 | 7篇 |
无线电 | 209篇 |
一般工业技术 | 408篇 |
冶金工业 | 134篇 |
原子能技术 | 4篇 |
自动化技术 | 450篇 |
出版年
2024年 | 9篇 |
2023年 | 48篇 |
2022年 | 153篇 |
2021年 | 236篇 |
2020年 | 104篇 |
2019年 | 85篇 |
2018年 | 115篇 |
2017年 | 96篇 |
2016年 | 139篇 |
2015年 | 84篇 |
2014年 | 165篇 |
2013年 | 180篇 |
2012年 | 119篇 |
2011年 | 144篇 |
2010年 | 95篇 |
2009年 | 100篇 |
2008年 | 104篇 |
2007年 | 91篇 |
2006年 | 55篇 |
2005年 | 49篇 |
2004年 | 61篇 |
2003年 | 38篇 |
2002年 | 35篇 |
2001年 | 22篇 |
2000年 | 18篇 |
1999年 | 20篇 |
1998年 | 30篇 |
1997年 | 22篇 |
1996年 | 14篇 |
1995年 | 16篇 |
1994年 | 10篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 12篇 |
1990年 | 10篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 9篇 |
1986年 | 9篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1976年 | 4篇 |
1975年 | 4篇 |
1970年 | 2篇 |
排序方式: 共有2608条查询结果,搜索用时 15 毫秒
31.
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 相似文献32.
Piotr Sankowski 《Theory of Computing Systems》2008,42(1):73-90
In this paper we consider the problem of finding perfect matchings in parallel. We present a RNC algorithm with almost optimal
work with respect to sequential algorithms, i.e., it uses O(n
ω
) processors, where ω is the matrix multiplication exponent. Our algorithm is based on an RNC algorithm for computing determinant of a degree one
polynomial matrix which is of independent interest.
Research supported by KBN grant 1P03A01830. 相似文献
33.
This article proposes an analytical algorithm for predicting errors in lock-in amplifiers (LIAs) working with time-varying reference frequency. Furthermore, a simple method for correcting such errors is presented. The reference frequency can be swept in order to measure the frequency response of a system within a given spectrum. The continuous variation of the reference frequency produces a measurement error that depends on three factors: the sweep speed, the LIA low-pass filters, and the frequency response of the measured system. The proposed error prediction algorithm is based on the final value theorem of the Laplace transform. The correction method uses a double-sweep measurement. A mathematical analysis is presented and validated with computational simulations and experimental measurements. 相似文献
34.
Shang L Jasiobedzki P Greenspan M 《IEEE transactions on pattern analysis and machine intelligence》2007,29(6):976-989
A method is presented for tracking 3D objects as they transform rigidly in space within a sparse range image sequence. The method operates in discrete space and exploits the coherence across image frames that results from the relationship between known bounds on the object's velocity and the sensor frame rate. These motion bounds allow the interframe transformation space to be reduced to a reasonable and indeed tiny size, comprising only tens or hundreds of possible states. The tracking problem is in this way cast into a classification framework, effectively trading off localization precision for runtime efficiency and robustness. The method has been implemented and tested extensively on a variety of freeform objects within a sparse range data stream comprising only a few hundred points per image. It has been shown to compare favorably against continuous domain iterative closest point (ICP) tracking methods, performing both more efficiently and more robustly. A hybrid method has also been implemented that executes a small number of ICP iterations following the initial discrete classification phase. This hybrid method is both more efficient than the ICP alone and more robust than either the discrete classification method or the ICP separately 相似文献
35.
This contribution provides an introduction to the Common Information Model CIM which is an international standard maintained by the International Electrotechnical Commission IEC. Today’s market requirements towards the model are discussed, furthermore, we give an introduction to the history of the CIM, its serializations and scope of application. The contribution concludes with an overview of future use of the CIM for both science and commerce. Briefly, we focus on: Message-based loose coupling of information systems Exchange of power grid topologies with minimal communication and data overhead Data quality assurance using ontology-based meta annotations and Integration of heterogeneous standards in the utility domain. The contribution presents solutions to the use cases providing a better information management for the utility utilizing the Common Information Model. 相似文献
36.
This paper considers methods for knowledge exploitation in security policies for Service-Oriented Architecture (SOA) environments, discovering the modality conflicts in particular. Two algorithms for discovering SOA-specific modality conflicts are proposed. First, a trivial (ad-hoc) approach is presented and further extended by the improved algorithm which offers lower time complexity. The formal verification of the proposal is followed by experimental results confirming the expected supremacy of the improved algorithm. 相似文献
37.
Fabian SobotkaThomas Kneib 《Computational statistics & data analysis》2012,56(4):755-767
Quantile regression has emerged as one of the standard tools for regression analysis that enables a proper assessment of the complete conditional distribution of responses even in the presence of heteroscedastic errors. Quantile regression estimates are obtained by minimising an asymmetrically weighted sum of absolute deviations from the regression line, a decision theoretic formulation of the estimation problem that avoids a full specification of the error term distribution. Recent advances in mean regression have concentrated on making the regression structure more flexible by including nonlinear effects of continuous covariates, random effects or spatial effects. These extensions often rely on penalised least squares or penalised likelihood estimation with quadratic penalties and may therefore be difficult to combine with the linear programming approaches often considered in quantile regression. As a consequence, geoadditive expectile regression based on minimising an asymmetrically weighted sum of squared residuals is introduced. Different estimation procedures are presented including least asymmetrically weighted squares, boosting and restricted expectile regression. The properties of these procedures are investigated in a simulation study and an analysis on rental fees in Munich is provided where the geoadditive specification allows for an analysis of nonlinear effects of the size of flats or the year of construction and the spatial distribution of rents simultaneously. 相似文献
38.
This paper addresses the problem of verifying stability of networks whose subsystems admit dissipation inequalities of integral input-to-state stability (iISS). We focus on two ways of constructing a Lyapunov function satisfying a dissipation inequality of a given network. Their difference from one another is elucidated from the viewpoint of formulation, relation, fundamental limitation and capability. One is referred to as the max-type construction resulting in a Lipschitz continuous Lyapunov function. The other is the sum-type construction resulting in a continuously differentiable Lyapunov function. This paper presents geometrical conditions under which the Lyapunov construction is possible for a network comprising subsystems. Although the sum-type construction for general has not yet been reduced to a readily computable condition, we obtain a simple condition of iISS small gain in the case of . It is demonstrated that the max-type construction fails to offer a Lyapunov function if the network contains subsystems which are not input-to-state stable (ISS). 相似文献
39.
The scope of the article is to describe the automated production of a thixoformed steel part. The production plant was set up within a prototype initiative at the Institute of Metal Forming in cooperation with the Institute of Automatic Control of RWTH Aachen University and industrial partners. Preliminary experiments showed that the quality of the formed parts varied to a great extent due to changing production conditions since the handling of the billet was carried out manually. To eliminate the possible disturbances introduced by the manual handling of the billet, an automation concept has been elaborated in order to guarantee a defined production environment. An industrial robot (KUKA) fulfils the handling tasks like the feeding of the induction coil with the feedstock material and the placing of the heated billet into the hydraulic press. The removal of the formed part from the press is realised by a simple mechanical device in order to be able to use only one gripper. The design of the gripper ensures a minimal heat loss during handling. The induction coil, the gripper system and the cavity are flooded with inert gas in order to prevent scaling. The sequence control for the production of a part is realised on the controller of the robot which provides sufficient PLC functionality and can be easily equipped with the required I/O components to trigger the different automation components. 相似文献
40.
Benedetta Chianucci Alice Grossi Gianluca DellOrso Elena Palmisani Marina Lanciotti Paola Terranova Filomena Pierri Michela Lupia Luca Arcuri Marica Laurino Isabella Ceccherini Fabian Beier Carlo Dufour Francesca Fioredda Maurizio Miano 《International journal of molecular sciences》2022,23(23)
In recent years, the knowledge about the immune-mediated impairment of bone marrow precursors in immune-dysregulation and autoimmune disorders has increased. In addition, immune-dysregulation, secondary to marrow failure, has been reported as being, in some cases, the most evident and early sign of the disease and making the diagnosis of both groups of disorders challenging. Dyskeratosis congenita is a disorder characterized by premature telomere erosion, typically showing marrow failure, nail dystrophy and leukoplakia, although incomplete genetic penetrance and phenotypes with immune-dysregulation features have been described. We report on a previously healthy 17-year-old girl, with a cousin successfully treated for acute lymphoblastic leukemia, who presented with leukopenia and neutropenia. The diagnostic work-up showed positive anti-neutrophil antibodies, leading to the diagnosis of autoimmune neutropenia, a slightly low NK count and high TCR-αβ+-double-negative T-cells. A next-generation sequencing (NGS) analysis showed the 734C>A variant on exon 6 of the TINF2 gene, leading to the p.Ser245Tyr. The telomere length was short on the lymphocytes and granulocytes, suggesting the diagnosis of an atypical telomeropathy showing with immune-dysregulation. This case underlines the importance of an accurate diagnostic work-up of patients with immune-dysregulation, who should undergo NGS or whole exome sequencing to identify specific disorders that deserve targeted follow-up and treatment. 相似文献