全文获取类型
收费全文 | 3287篇 |
免费 | 72篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 71篇 |
综合类 | 3篇 |
化学工业 | 510篇 |
金属工艺 | 85篇 |
机械仪表 | 64篇 |
建筑科学 | 159篇 |
矿业工程 | 10篇 |
能源动力 | 78篇 |
轻工业 | 194篇 |
水利工程 | 46篇 |
石油天然气 | 16篇 |
无线电 | 295篇 |
一般工业技术 | 459篇 |
冶金工业 | 787篇 |
原子能技术 | 23篇 |
自动化技术 | 566篇 |
出版年
2022年 | 39篇 |
2021年 | 40篇 |
2020年 | 33篇 |
2019年 | 42篇 |
2018年 | 45篇 |
2017年 | 46篇 |
2016年 | 55篇 |
2015年 | 39篇 |
2014年 | 71篇 |
2013年 | 215篇 |
2012年 | 94篇 |
2011年 | 143篇 |
2010年 | 92篇 |
2009年 | 92篇 |
2008年 | 155篇 |
2007年 | 104篇 |
2006年 | 99篇 |
2005年 | 101篇 |
2004年 | 93篇 |
2003年 | 79篇 |
2002年 | 86篇 |
2001年 | 55篇 |
2000年 | 54篇 |
1999年 | 64篇 |
1998年 | 118篇 |
1997年 | 85篇 |
1996年 | 73篇 |
1995年 | 69篇 |
1994年 | 85篇 |
1993年 | 52篇 |
1992年 | 64篇 |
1991年 | 38篇 |
1990年 | 47篇 |
1989年 | 46篇 |
1988年 | 41篇 |
1987年 | 39篇 |
1986年 | 40篇 |
1985年 | 37篇 |
1984年 | 46篇 |
1983年 | 45篇 |
1982年 | 42篇 |
1981年 | 30篇 |
1980年 | 34篇 |
1979年 | 30篇 |
1978年 | 36篇 |
1977年 | 36篇 |
1976年 | 40篇 |
1975年 | 24篇 |
1974年 | 31篇 |
1973年 | 32篇 |
排序方式: 共有3366条查询结果,搜索用时 15 毫秒
81.
82.
A theory of one-tape two-way one-head off-line linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) that halt in linear time, where the running time of a machine is defined as the length of any longest computation path. We explore structural properties of one-tape linear-time Turing machines and clarify how the machines’ resources affect their computational patterns and power. 相似文献
83.
We describe a quasi-Monte Carlo method for the simulation of discrete time Markov chains with continuous multi-dimensional state space. The method simulates copies of the chain in parallel. At each step the copies are reordered according to their successive coordinates. We prove the convergence of the method when the number of copies increases. We illustrate the method with numerical examples where the simulation accuracy is improved by large factors compared with Monte Carlo simulation. 相似文献
84.
Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical. 相似文献
85.
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 相似文献86.
Donatelli S. Haddad S. Sproston J. 《IEEE transactions on pattern analysis and machine intelligence》2009,35(2):224-240
Markov chains are a well-known stochastic process that provide a balance between being able to adequately model the system's behavior and being able to afford the cost of the model solution. The definition of stochastic temporal logics like continuous stochastic logic (CSL) and its variant asCSL, and of their model-checking algorithms, allows a unified approach to the verification of systems, allowing the mix of performance evaluation and probabilistic verification. In this paper we present the stochastic logic CSLTA, which is more expressive than CSL and asCSL, and in which properties can be specified using automata (more precisely, timed automata with a single clock). The extension with respect to expressiveness allows the specification of properties referring to the probability of a finite sequence of timed events. A typical example is the responsiveness property "with probability at least 0.75, a message sent at time 0 by a system A will be received before time 5 by system B and the acknowledgment will be back at A before time 7", a property that cannot be expressed in either CSL or asCSL. We also present a model-checking algorithm for CSLTA. 相似文献
87.
Milosavljevic S Gregory DE Pal P Carman AB Milburn PD Callaghan JP 《Applied ergonomics》2011,42(6):801-806
Wool handling is an important rural occupation where workers process 200 or more fleeces daily, separating them into various quality components. Loads and postures they experience carry substantial risk of low back pain (LBP). Although a formal skill training structure exists, interaction with loads and LBP is unknown. We examined whether skill and LBP influenced trunk postures and loads of 60 wool handlers representing 3 skill levels. LBP prevalence ranged from 20% for junior (lowest skill) to 45% for open class (highest skill) wool handlers. Open class wool handlers demonstrated increased lateral bend and more axially twisted postures, generating greater medio-lateral shear forces and lateral bend and axial twist moments. LBP was associated with open class wool handlers spending more time in severe axially twisted postures. These findings suggest that skill-based training needs to be reviewed to reduce the quantity of axially twisted posture which may help reduce the prevalence of LBP in this workforce. 相似文献
88.
In this paper we derive guaranteed gain, sector, and disk margins for nonlinear optimal and inverse optimal regulators that minimize a nonlinear-nonquadratic performance criterion involving cross-weighting terms. Specifically, sufficient conditions that guarantee gain, sector, and disk margins are given in terms of the state, control, and cross-weighting nonlinear-nonquadratic weighting functions. The proposed results provide a generalization of the “meaningful” inverse optimal nonlinear regulator stability margins as well as the classical linear-quadratic optimal regulator gain and phase margins. 相似文献
89.
90.
Chen Zizhong Dongarra Jack 《Parallel and Distributed Systems, IEEE Transactions on》2008,19(12):1628-1641
Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging. In this paper, we show that fail-stop process failures in ScaLAPACK matrix-matrix multiplication kennel can be tolerated without checkpointing or message logging. It has been proved in previous algorithm-based fault tolerance that, for matrix-matrix multiplication, the checksum relationship in the input checksum matrices is preserved at the end of the computation no mater which algorithm is chosen. From this checksum relationship in the final computation results, processor miscalculations can be detected, located, and corrected at the end of the computation. However, whether this checksum relationship can be maintained in the middle of the computation or not remains open. In this paper, we first demonstrate that, for many matrix matrix multiplication algorithms, the checksum relationship in the input checksum matrices is not maintained in the middle of the computation. We then prove that, however, for the outer product version algorithm, the checksum relationship in the input checksum matrices can be maintained in the middle of the computation. Based on this checksum relationship maintained in the middle of the computation, we demonstrate that fail-stop process failures (which are often tolerated by checkpointing or message logging) in ScaLAPACK matrix-matrix multiplication can be tolerated without checkpointing or message logging. 相似文献