全文获取类型
收费全文 | 5599篇 |
免费 | 199篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 139篇 |
综合类 | 13篇 |
化学工业 | 1427篇 |
金属工艺 | 117篇 |
机械仪表 | 104篇 |
建筑科学 | 431篇 |
矿业工程 | 10篇 |
能源动力 | 123篇 |
轻工业 | 768篇 |
水利工程 | 36篇 |
石油天然气 | 15篇 |
无线电 | 288篇 |
一般工业技术 | 920篇 |
冶金工业 | 644篇 |
原子能技术 | 59篇 |
自动化技术 | 711篇 |
出版年
2022年 | 44篇 |
2021年 | 70篇 |
2020年 | 55篇 |
2019年 | 59篇 |
2018年 | 67篇 |
2017年 | 85篇 |
2016年 | 115篇 |
2015年 | 137篇 |
2014年 | 149篇 |
2013年 | 249篇 |
2012年 | 229篇 |
2011年 | 244篇 |
2010年 | 208篇 |
2009年 | 224篇 |
2008年 | 221篇 |
2007年 | 252篇 |
2006年 | 204篇 |
2005年 | 204篇 |
2004年 | 186篇 |
2003年 | 127篇 |
2002年 | 135篇 |
2001年 | 111篇 |
2000年 | 99篇 |
1999年 | 77篇 |
1998年 | 91篇 |
1997年 | 86篇 |
1996年 | 82篇 |
1995年 | 75篇 |
1994年 | 55篇 |
1993年 | 78篇 |
1992年 | 80篇 |
1991年 | 54篇 |
1990年 | 63篇 |
1989年 | 61篇 |
1987年 | 71篇 |
1986年 | 58篇 |
1985年 | 72篇 |
1984年 | 65篇 |
1983年 | 61篇 |
1982年 | 64篇 |
1981年 | 69篇 |
1980年 | 67篇 |
1979年 | 68篇 |
1978年 | 51篇 |
1977年 | 54篇 |
1976年 | 57篇 |
1975年 | 56篇 |
1974年 | 67篇 |
1973年 | 49篇 |
1970年 | 41篇 |
排序方式: 共有5805条查询结果,搜索用时 15 毫秒
51.
Michael Buro Hans Kleine Büning 《Annals of Mathematics and Artificial Intelligence》1996,18(2):243-260
We investigate properties ofk-resolution, a restricted version of resolution in which one parent clause must have length at mostk. Starting from a unit-preference strategy, we compare minimal proof lengths of unit-resolution and unrestricted resolution. In particular, we show that the speed-up by using resolution is bound by
if the shortest unit-resolution refutation needst steps. Next we present an algorithm which decides whether the empty clause can be deduced by 2-resolution from a formula and has time complexity O(length()4). Finally we describe effects onk-resolution if a formula is transformed intot-CNF and show that extended 3-resolution is complete and sound. 相似文献
52.
This paper is the first attempt to successfully design efficient approximation algorithms for the single-machine weighted
flow-time minimization problem when jobs have different release dates and weights equal to their processing times under the
assumption that one job is fixed (i.e., the machine is unavailable during a fixed interval corresponding to the fixed job).
Our work is motivated by an interesting algorithmic application to the generation of valid inequalities in a branch-and-cut
method. Our analysis shows that the trivial FIFO sequence can lead to an arbitrary large worst-case performance bound. Hence,
we modify this sequence so that a new 2-approximation solution can be obtained for every instance and we prove the tightness
of this bound. Then, we propose a fully polynomial-time approximation algorithm with efficient running time for the considered
problem. Especially, the complexity of our algorithm is strongly polynomial. 相似文献
53.
Hans De Sterck Killian Miller Geoffrey Sanders 《Computing and Visualization in Science》2011,14(2):51-65
Recently, it was shown how the convergence of a class of multigrid methods for computing the stationary distribution of sparse,
irreducible Markov chains can be accelerated by the addition of an outer iteration based on iterant recombination. The acceleration
was performed by selecting a linear combination of previous fine-level iterates with probability constraints to minimize the
two-norm of the residual using a quadratic programming method. In this paper we investigate the alternative of minimizing
the one-norm of the residual. This gives rise to a nonlinear convex program which must be solved at each acceleration step.
To solve this minimization problem we propose to use a deep-cuts ellipsoid method for nonlinear convex programs. The main
purpose of this paper is to investigate whether an iterant recombination approach can be obtained in this way that is competitive
in terms of execution time and robustness. We derive formulas for subgradients of the one-norm objective function and the
constraint functions, and show how an initial ellipsoid can be constructed that is guaranteed to contain the exact solution
and give conditions for its existence. We also investigate using the ellipsoid method to minimize the two-norm. Numerical
tests show that the one-norm and two-norm acceleration procedures yield a similar reduction in the number of multigrid cycles.
The tests also indicate that one-norm ellipsoid acceleration is competitive with two-norm quadratic programming acceleration
in terms of running time with improved robustness. 相似文献
54.
55.
Making changes to software systems can prove costly and it remains a challenge to understand the factors that affect the costs
of software evolution. This study sought to identify such factors by investigating the effort expended by developers to perform
336 change tasks in two different software organizations. We quantitatively analyzed data from version control systems and
change trackers to identify factors that correlated with change effort. In-depth interviews with the developers about a subset
of the change tasks further refined the analysis. Two central quantitative results found that dispersion of changed code and
volatility of the requirements for the change task correlated with change effort. The analysis of the qualitative interviews
pointed to two important, underlying cost drivers: Difficulties in comprehending dispersed code and difficulties in anticipating
side effects of changes. This study demonstrates a novel method for combining qualitative and quantitative analysis to assess
cost drivers of software evolution. Given our findings, we propose improvements to practices and development tools to manage
and reduce the costs. 相似文献
56.
In certain situations the state of a quantum system, after transmission through a quantum channel, can be perfectly restored.
This can be done by “coding” the state space of the system before transmission into a “protected” part of a larger state space,
and by applying a proper “decoding” map afterwards. By a version of the Heisenberg Principle, which we prove, such a protected
space must be “dark” in the sense that no information leaks out during the transmission. We explain the role of the Knill–Laflamme
condition in relation to protection and darkness, and we analyze several degrees of protection, whether related to error correction,
or to state restauration after a measurement. Recent results on higher rank numerical ranges of operators are used to construct
examples. In particular, dark spaces are constructed for any map of rank 2, for a biased permutations channel and for certain
separable maps acting on multipartite systems. Furthermore, error correction subspaces are provided for a class of tri-unitary
noise models. 相似文献
57.
Tim Van Gestel Feng Han Doris Sebold Hans Peter Buchkremer Detlev St?ver 《Microsystem Technologies》2011,17(2):233-242
A solid oxide fuel cell (SOFC) with a thin-film yttria-stabilized zirconia (YSZ) electrolyte was developed and tested. This
novel SOFC shows a similar multilayer set-up as other current anode-supported SOFCs and is composed of a Ni/8YSZ anode, a
gas-tight 8YSZ electrolyte layer, a dense Sr-diffusion barrier layer and a LSCF cathode. To increase the power density and
lower the SOFC operating temperature, the thickness of the electrolyte layer was reduced from around 10 μm in current cells
to 1 μm, using a nanoparticle deposition method. By using the novel 1 μm electrolyte layer, the current density of our SOFC
progressed to 2.7, 2.1 and 1.6 A/cm2 at operation temperatures of 800, 700 and 650°C, respectively, and out-performs all similar cells reported to date in the
literature. An important consideration is also that cost-effective dip-coating and spin-coating methods are applied for the
fabrication of the thin-film electrolyte. Processing of 1 μm layers on the very porous anode substrate material was initially
experienced as very difficult and therefore 8YSZ nanoparticle coatings were developed and optimized on porous 8YSZ model substrates
and transferred afterwards to regular anode substrates. In this paper, the preparation of the novel SOFC is shown and its
morphology is illustrated with high resolution SEM pictures. Further, the performance in a standard SOFC test is demonstrated. 相似文献
58.
Rajan K. Chakrabarty Mark A. Garro Shammah Chancellor Hans Moosmüller 《Computer Physics Communications》2009,180(8):1376-1381
Computer simulation techniques have found extensive use in establishing empirical relationships between three-dimensional (3d) and two-dimensional (2d) projected properties of particles produced by the process of growth through the agglomeration of smaller particles (monomers). In this paper, we describe a package, FracMAP, that has been written to simulate 3d quasi-fractal agglomerates and create their 2d pixelated projection images by restricting them to stable orientations as commonly encountered for quasi-fractal agglomerates collected on filter media for electron microscopy. Resulting 2d images are analyzed for their projected morphological properties.
Program summary
Program title: FracMAPCatalogue identifier: AEDD_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDD_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.: 4722No. of bytes in distributed program, including test data, etc.: 27 229Distribution format: tar.gzProgramming language: C++Computer: PCOperating system: Windows, LinuxRAM: 2.0 MegabytesClassification: 7.7Nature of problem: Solving for a suitable fractal agglomerate construction under constraints of typical morphological parameters.Solution method: Monte Carlo approximation.Restrictions: Problem complexity is not representative of run-time, since Monte Carlo iterations are of a constant complexity.Additional comments: The distribution file contains two versions of the FracMAP code, one for Windows and one for Linux.Running time: 1 hour for a fractal agglomerate of size 25 on a single processor. 相似文献59.
Classifying species of individual trees by intensity and structure features derived from airborne laser scanner data 总被引:3,自引:0,他引:3
Hans Ole Ørka Erik Næsset Ole Martin Bollandsås 《Remote sensing of environment》2009,113(6):1163-3342
The objective of this study was to identify candidate features derived from airborne laser scanner (ALS) data suitable to discriminate between coniferous and deciduous tree species. Both features related to structure and intensity were considered. The study was conducted on 197 Norway spruce and 180 birch trees (leaves on conditions) in a boreal forest reserve in Norway. The ALS sensor used was capable of recording multiple echoes. The point density was 6.6 m− 2. Laser echoes located within the vertical projection of the tree crowns, which were assumed to be circular and defined according to field measurements, were attributed to three categories: “first echoes of many”, “single echoes”, or “last echoes of many echoes”. They were denoted FIRST, SINGLE, and LAST, respectively. In tree species classification using ALS data features should be independent of tree heights. We found that many features were dependent on tree height and that this dependency influenced selection of candidate features. When we accounted for this dependency, it was revealed that FIRST and SINGLE echoes were located higher and LAST echoes lower in the birch crowns than in spruce crowns. The intensity features of the FIRST echoes differed more between species than corresponding features of the other echo categories. For the FIRST echoes the intensity values tended to be higher for birch than spruce. When using the various features for species classification, maximum overall classification accuracies of 77% and 73% were obtained for structural and intensity features, respectively. Combining candidate features related to structure and intensity resulted in an overall classification accuracy of 88%. 相似文献
60.
Daniel E. Rivera Hyunjin Lee Hans D. Mittelmann Martin W. Braun 《Journal of Process Control》2009,19(4):623-635
This paper considers the use of constrained minimum crest factor multisine signals as inputs for plant-friendly identification testing of chemical process systems. The methodology presented here effectively integrates operating restrictions, information-theoretic requirements, and state-of-the-art optimization techniques to design minimum crest factor multisine signals meeting important user-specified time and frequency domain properties. A series of optimization problem formulations relevant to problems in linear, nonlinear, and multivariable system identification are presented; these culminate with their application to the modeling of the Weischedel–McAvoy high-purity distillation column problem, a demanding nonlinear and highly interactive system. The effectiveness of these signals for modeling for control purposes and the ability to incorporate a priori nonlinear models in the signal design procedure are demonstrated in this distillation system case study. 相似文献