全文获取类型
收费全文 | 1326篇 |
免费 | 68篇 |
国内免费 | 69篇 |
专业分类
电工技术 | 30篇 |
综合类 | 43篇 |
化学工业 | 27篇 |
金属工艺 | 25篇 |
机械仪表 | 169篇 |
建筑科学 | 27篇 |
矿业工程 | 8篇 |
能源动力 | 24篇 |
轻工业 | 3篇 |
水利工程 | 44篇 |
石油天然气 | 17篇 |
武器工业 | 19篇 |
无线电 | 61篇 |
一般工业技术 | 183篇 |
冶金工业 | 9篇 |
原子能技术 | 10篇 |
自动化技术 | 764篇 |
出版年
2024年 | 3篇 |
2023年 | 10篇 |
2022年 | 8篇 |
2021年 | 26篇 |
2020年 | 22篇 |
2019年 | 19篇 |
2018年 | 19篇 |
2017年 | 34篇 |
2016年 | 38篇 |
2015年 | 49篇 |
2014年 | 64篇 |
2013年 | 72篇 |
2012年 | 85篇 |
2011年 | 97篇 |
2010年 | 75篇 |
2009年 | 82篇 |
2008年 | 83篇 |
2007年 | 77篇 |
2006年 | 97篇 |
2005年 | 66篇 |
2004年 | 68篇 |
2003年 | 57篇 |
2002年 | 48篇 |
2001年 | 35篇 |
2000年 | 35篇 |
1999年 | 29篇 |
1998年 | 34篇 |
1997年 | 33篇 |
1996年 | 23篇 |
1995年 | 20篇 |
1994年 | 16篇 |
1993年 | 10篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有1463条查询结果,搜索用时 15 毫秒
91.
This paper proposes a technique, based on the Inexact Shift–Invert Lanczos (ISIL) method with Inexact Jacobi Orthogonal Component Correction (IJOCC) refinement, and a preconditioned conjugate-gradient (PCG) linear solver with multilevel preconditioner, for finding several eigenvalues for generalized symmetric eigenproblems. Several eigenvalues are found by constructing (with the ISIL process) an extended projection basis. Presented results of numerical experiments confirm the technique can be effectively applied to challenging, large-scale problems characterized by very dense spectra, such as resonant cavities with spatial dimensions which are large with respect to wavelengths of the resonating electromagnetic fields. It is also shown that the proposed scheme based on inexact linear solves delivers superior performance, as compared to methods which rely on exact linear solves, indicating tremendous potential of the ‘inexact solve’ concept. Finally, the scheme which generates an extended projection basis is found to provide a cost-efficient alternative to classical deflation schemes when several eigenvalues are computed. 相似文献
92.
Massimiliano Ferronato Luca Bergamaschi Giuseppe Gambolati 《International journal for numerical methods in engineering》2010,81(3):381-402
Block constraint preconditioners are a most recent development for the iterative solution to large‐scale, often ill‐conditioned, coupled consolidation problems. A major limitation to their practical use, however, is the somewhat difficult selection of a number of user‐defined parameters (at least 4) in a more or less optimal way. The present paper investigates the robustness of three variants of the block constraint preconditioning in relation to the above parameters. A theoretical analysis of the eigenspectrum of the preconditioned matrix provides relatively simple bounds of the eigenvalues as a function of these parameters. A number of test problems used to validate the theoretical results show that both the mixed constraint preconditioner (MCP) combined with the symmetric quasi‐minimal residual (SQMR) solver and the MCP triangular variant (T‐MCP) combined with the bi‐conjugate gradient stabilized (Bi‐CGSTAB) are efficient and robust tools for the solution to difficult Finite Element‐discretized coupled consolidation problems. Moreover, the practical selection of the user‐defined parameters is relatively easy as a stable behavior is observed for a wide range of fill‐in degree values. The theoretical bounds on the eigenspectrum of the preconditioned matrix may help to suggest the most appropriate parameter combination. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
93.
Exploiting constraint inconsistence for dimension selection in subspace clustering: A semi-supervised approach 总被引:1,自引:0,他引:1
Xianchao ZhangAuthor Vitae Yang Qiu Author VitaeYao Wu Author Vitae 《Neurocomputing》2011,74(17):3598-3608
Selecting correct dimensions is very important to subspace clustering and is a challenging issue. This paper studies semi-supervised approach to the problem. In this setting, limited domain knowledge in the form of space level pair-wise constraints, i.e., must-links and cannot-links, are available. We propose a semi-supervised subspace clustering (S3C) algorithm that exploits constraint inconsistence for dimension selection. Our algorithm firstly correlates globally inconsistent constraints to dimensions in which they are consistent, then unites constraints with common correlating dimensions, and finally forms the subspaces according to the constraint unions. Experimental results show that S3C is superior to the typical unsupervised subspace clustering algorithm FINDIT, and the other constraint based semi-supervised subspace clustering algorithm SC-MINER. 相似文献
94.
Laser forming of sheet metal offers the advantages of requiring no hard tooling, no spring back and no external force, thus this technology reduces cost, increases flexibility and accuracy. Laser forming is a complicated and transient thermo-mechanical process involving elastic and plastic strain depended on time history. How to control and enhance the accuracy of the laser forming attracts much attention. This paper delivered a deep insight into the mechanism of the edge effects in laser forming, improved an existing analytical model to approximately predict the edge effects, and based on this model a new strategy was put forward to reduce the edge effects. Numerical simulations and experiments were carried out to validate the model and the presented strategy. 相似文献
95.
96.
Simplified protein models are used for investigating general properties of proteins and principles of protein folding. Furthermore,
they are suited for hierarchical approaches to protein structure prediction. A well known protein model is the HP-model of
Lau and Dill [Lau, K. F., & Dill, K. A. (1989)]. A lattice statistical mechanics model of the conformational and sequence
spaces of proteins. Macromolecules, 22, 3986–3997) which models the important aspect of hydrophobicity. One can define the HP-model for various lattices, among
them two-dimensional and three-dimensional ones. Here, we investigate the three-dimensional case. The main motivation for
studying simplified protein models is to be able to predict model structures much more quickly and more accurately than is
possible for real proteins. However, up to now there was a dilemma: the algorithmically tractable, simple protein models can
not model real protein structures with good quality and introduce strong artifacts.
We present a constraint-based method that largely improves this situation. It outperforms all existing approaches for lattice
protein folding in HP-models. This approach is the first one that can be applied to two three-dimensional lattices, namely
the cubic lattice and the face-centered-cubic (FCC) lattice. Moreover, it is the only exact method for the FCC lattice. The ability to use the FCC lattice is a significant
improvement over the cubic lattice. The key to our approach is the ability to compute maximally compact sets of points (used
as hydrophobic cores), which we accomplish for the first time for the FCC lattice. 相似文献
97.
Hierarchical parallelisation for the solution of stochastic finite element equations 总被引:2,自引:0,他引:2
Andreas Keese 《Computers & Structures》2005,83(14):1033-1047
As an example application the elliptic partial differential equation for steady groundwater flow is considered. Uncertainties in the conductivity may be quantified with a stochastic model. A discretisation by a Galerkin ansatz with tensor products of finite element functions in space and stochastic ansatz functions leads to a certain type of stochastic finite element system (SFEM). This yields a large system of equations with a particular structure. They can be efficiently solved by Krylov subspace methods, as here the main ingredient is the multiplication with the system matrix and the application of the preconditioner. We have implemented a “hierarchical parallel solver” on a distributed memory architecture for this. The multiplication and the preconditioning uses a—possibly parallel—deterministic solver for the spatial discretisation as a building block in a black-box fashion. This paper is concerned with a coarser grained level of parallelism resulting from the stochastic formulation. These coarser levels are implemented by running different instances of the deterministic solver in parallel. Different possibilities for the distribution of data are investigated, and the efficiencies determined. On up to 128 processors, systems with more than 5 × 107 unknowns are solved. 相似文献
98.
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They generalize Venn diagrams and Euler circles, and include syntax for quantification and navigation of relations. The notation was designed to complement the Unified Modelling Language in the development of software systems.Since symbols representing quantification in a diagrammatic language can be naturally ordered in multiple ways, some constraint diagrams have more than one intuitive meaning in first-order predicate logic. Any equally expressive notation which is based on Euler diagrams and conveys logical statements using explicit quantification will have to address this problem.We explicitly augment constraint diagrams with reading trees, which provides a partial ordering for the quantifiers (determining their scope as well as their relative ordering). Alternative approaches using spatial arrangements of components, or alphabetical ordering of symbols, for example, can be seen as implicit representations of a reading tree.Whether the reading tree accompanies the diagram explicitly (optimizing expressiveness) or implicitly (simplifying diagram syntax), we show how to construct unambiguous semantics for the augmented constraint diagram. 相似文献
99.
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, symmetry breaking constraints are commonly used.
While variable symmetry breaking constraints can be expressed easily and propagated efficiently using lexicographic ordering,
value symmetry breaking constraints are often difficult to formulate. In this paper, we propose two methods of using symmetry
breaking constraints to tackle value symmetries. First, we show theoretically when value symmetries in one CSP correspond to variable symmetries in another CSP of the same problem. We also show when variable symmetry breaking constraints in the two CSPs, combined using channeling constraints, are consistent. Such results
allow us to tackle value symmetries efficiently using additional CSP variables and channeling constraints. Second, we introduce
value precedence, a notion which can be used to break a common class of value symmetries, namely symmetries of indistinguishable values. While value precedence can be expressed using inefficient if-then constraints in existing CSP solvers, we propose efficient
propagation algorithms for implementing global value precedence constraints. We also characterize several theoretical properties
of the value precedence constraints. Extensive experiments are conducted to verify the feasibility and efficiency of the two
proposals. 相似文献
100.
David Cohen Peter Jeavons Christopher Jefferson Karen E. Petrie Barbara M. Smith 《Constraints》2006,11(2-3):115-137
We review the many different definitions of symmetry for constraint satisfaction problems (CSPs) that have appeared in the
literature, and show that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions
of a CSP instance, or else as an operation preserving the constraints. We refer to these as solution symmetries and constraint symmetries. We define a constraint symmetry more precisely as an automorphism of a hypergraph associated with a CSP instance, the microstructure
complement. We show that the solution symmetries of a CSP instance can also be obtained as the automorphisms of a related
hypergraph, the k-ary nogood hypergraph and give examples to show that some instances have many more solution symmetries than constraint symmetries. Finally, we
discuss the practical implications of these different notions of symmetry. 相似文献