全文获取类型
收费全文 | 8675篇 |
免费 | 495篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 117篇 |
综合类 | 23篇 |
化学工业 | 2207篇 |
金属工艺 | 243篇 |
机械仪表 | 147篇 |
建筑科学 | 599篇 |
矿业工程 | 98篇 |
能源动力 | 290篇 |
轻工业 | 742篇 |
水利工程 | 51篇 |
石油天然气 | 20篇 |
武器工业 | 1篇 |
无线电 | 690篇 |
一般工业技术 | 1744篇 |
冶金工业 | 551篇 |
原子能技术 | 50篇 |
自动化技术 | 1605篇 |
出版年
2023年 | 118篇 |
2022年 | 209篇 |
2021年 | 329篇 |
2020年 | 199篇 |
2019年 | 212篇 |
2018年 | 232篇 |
2017年 | 271篇 |
2016年 | 353篇 |
2015年 | 294篇 |
2014年 | 381篇 |
2013年 | 604篇 |
2012年 | 537篇 |
2011年 | 722篇 |
2010年 | 514篇 |
2009年 | 479篇 |
2008年 | 490篇 |
2007年 | 426篇 |
2006年 | 381篇 |
2005年 | 305篇 |
2004年 | 255篇 |
2003年 | 189篇 |
2002年 | 170篇 |
2001年 | 102篇 |
2000年 | 101篇 |
1999年 | 116篇 |
1998年 | 151篇 |
1997年 | 112篇 |
1996年 | 96篇 |
1995年 | 57篇 |
1994年 | 64篇 |
1993年 | 49篇 |
1992年 | 52篇 |
1991年 | 27篇 |
1990年 | 41篇 |
1989年 | 29篇 |
1988年 | 31篇 |
1987年 | 34篇 |
1986年 | 28篇 |
1985年 | 35篇 |
1984年 | 44篇 |
1983年 | 19篇 |
1982年 | 21篇 |
1981年 | 18篇 |
1980年 | 23篇 |
1977年 | 40篇 |
1976年 | 28篇 |
1975年 | 18篇 |
1974年 | 18篇 |
1973年 | 16篇 |
1971年 | 15篇 |
排序方式: 共有9178条查询结果,搜索用时 0 毫秒
101.
We describe a neural network able to rapidly establish correspondence between neural feature layers. Each of the network's two layers consists of interconnected cortical columns, and each column consists of inhibitorily coupled subpopulations of excitatory neurons. The dynamics of the system builds on a dynamic model of a single column, which is consistent with recent experimental findings. The network realizes dynamic links between its layers with the help of specialized columns that evaluate similarities between the activity distributions of local feature cell populations, are subject to a topology constraint, and can gate the transfer of feature information between the neural layers. The system can robustly be applied to natural images, and correspondences are found in time intervals estimated to be smaller than 100 ms in physiological terms. 相似文献
102.
Christian Ronse 《Journal of Mathematical Imaging and Vision》2008,32(2):97-125
In connective segmentation (Serra in J. Math. Imaging Vis. 24(1):83–130, [2006]), each image determines subsets of the space on which it is “homogeneous”, in such a way that this family of subsets always
constitutes a connection (connectivity class); then the segmentation of the image is the partition of space into its connected
components according to that connection.
Several concrete examples of connective segmentations or of connections on sets, indicate that the space covering requirement
of the partition should be relaxed. Furthermore, morphological operations on partitions require the consideration of wider
framework.
We study thus partial partitions (families of mutually disjoint non-void subsets of the space) and partial connections (where connected components of a set are mutually disjoint but do not necessarily cover the set). We describe some methods
for generating partial connections. We investigate the links between the two lattices of partial connections and of partial
partitions. We generalize Serra’s characterization of connective segmentation and discuss its relevance. Finally we give some
ideas on how the theory of partial connections could lead to improved segmentation algorithms.
相似文献
Christian RonseEmail: |
103.
Andreas Ruh Adam-Mwanga Dieckmann Richard Heldele Volker Piotter Robert Ruprecht Christian Munzinger Jürgen Fleischer Jürgen Haußelt 《Microsystem Technologies》2008,14(12):1805-1811
In the field of micro-technology the production of metallic and ceramic micro-components by powder injection molding (PIM)
has become a more and more established fabrication method. But in order to fulfill the demand for more complex-shaped high-precision
micro-components further development work has to be performed. This is especially true if more efficient production routes
for multi-component-micro-assemblies consisting of different materials or sub-components are envisaged. To meet these challenges,
investigations are performed to realize and to establish two primary shape micro-processes. These are two-component micro-injection
molding (2C-MicroPIM) and sinter-joining. The realization of these technologies will lead to a markedly reduction of the efforts
for handling, adjustment, and assembling of metallic and ceramic micro-assemblies. Furthermore, an increased integration level
and functionality can be yielded. For an effective transfer of scientific results to industrial applications the whole process
chain must be considered, from development and construction of the tooling as well as of the components to the quality assurance
and determination of the properties of the assemblies after sintering. These primary shape processes shall enable the mutual
processing of different materials within the fabrication process, so avoiding separate mounting or assembling steps. Additionally
fixed and loose junctions between at least two components shall be realized. The progress in research and development will
be demonstrated especially by the implementation of shaft-to-collar connections between micro-gearwheels and corresponding
shafts. Regarding two-component micro-injection molding, the tool construction for shaft-to-collar connections will be presented
as well as first experimental results on the properties of selected ceramic powders and feedstocks for the special requirements
of the 2C-MicroPIM process. With the assembly step being performed outside the injection molding tool before sinter-joining
different parts and geometries can be combined quite easily. The presented article gives an overview on the concept and on
preliminary testing results for the fabrication of a shaft-to-collar-connection. Additionally, a solution for an automated
assembly of a shaft and a toothed wheel outside the injection molding tool is presented. 相似文献
104.
This paper considers the problem of scheduling quay cranes which are used at sea port container terminals to load and unload
containers. This problem is studied intensively in a recent stream of research but still lacks a correct treatment of crane
interference constraints. We present a revised optimization model for the scheduling of quay cranes and propose a heuristic
solution procedure. At its core a Branch-and-Bound algorithm is applied for searching a subset of above average quality schedules.
The heuristic takes advantage from efficient criteria for branching and bounding the search with respect to the impact of
crane interference. Although the used techniques are quite standard, the new heuristic produces much better solutions in considerably
shorter run times than all algorithms known from the literature. 相似文献
105.
Christian Struck Pieter J.C.J. de Wilde Jan L.M. Hensen 《Advanced Engineering Informatics》2009,23(4):386-395
This article describes research conducted to gather empirical evidence on size, character and content of the option space in building design projects. This option space is the key starting point for the work of any climate engineer using building performance simulation who is supporting the design process. The underlying goal is to strengthen the role of advanced computing in building design, especially in the early conceptual stage, through a better integration of building performance simulation tools augmented with uncertainty analysis and sensitivity analysis. Better integration will need to assist design rather than automate design, allowing a spontaneous, creative and flexible process that acknowledges the expertise of the design team members. This research investigates and contrasts emergent option spaces and their inherent uncertainties in an artificial setting (student design studios) and in real-life scenarios (commercial design project case studies). The findings provide empirical evidence of the high variability of the option space that can be subjected to uncertainty analysis and sensitivity analysis. 相似文献
106.
Nils Paust Christian Litterst Tobias Metz Michael Eck Christoph Ziegler Roland Zengerle Peter Koltay 《Microfluidics and nanofluidics》2009,7(4):531-543
In this paper we present a new concept of creating and using capillary pressure gradients for passive degassing and passive methanol supply in direct methanol fuel cells (DMFCs). An anode flow field consisting of parallel tapered channels structures is applied to achieve the passive supply mechanism. The flow is propelled by the surface forces of deformed CO2 bubbles, generated as a reaction product during DMFC operation. This work focuses on studying the influence of channel geometry and surface properties on the capillary-induced liquid flow rates at various bubbly gas flow rates. Besides the aspect ratios and opening angles of the tapered channels, the static contact angle as well as the effect of contact angle hysteresis has been identified to significantly influence the liquid flow rates induced by capillary forces at the bubble menisci. Applying the novel concept, we show that the liquid flow rates are up to thirteen times higher than the methanol oxidation reaction on the anode requires. Experimental results are presented that demonstrate the continuous passive operation of a DMFC for more than 15 h. 相似文献
107.
Information flow control (IFC) checks whether a program can leak secret data to public ports, or whether critical computations
can be influenced from outside. But many IFC analyses are imprecise, as they are flow-insensitive, context-insensitive, or
object-insensitive; resulting in false alarms. We argue that IFC must better exploit modern program analysis technology, and
present an approach based on program dependence graphs (PDG). PDGs have been developed over the last 20 years as a standard
device to represent information flow in a program, and today can handle realistic programs. In particular, our dependence
graph generator for full Java bytecode is used as the basis for an IFC implementation which is more precise and needs less
annotations than traditional approaches. We explain PDGs for sequential and multi-threaded programs, and explain precision
gains due to flow-, context-, and object-sensitivity. We then augment PDGs with a lattice of security levels and introduce
the flow equations for IFC. We describe algorithms for flow computation in detail and prove their correctness. We then extend
flow equations to handle declassification, and prove that our algorithm respects monotonicity of release. Finally, examples
demonstrate that our implementation can check realistic sequential programs in full Java bytecode. 相似文献
108.
109.
We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to terminate. The program can be used to compute numerically the Laurent expansion of divergent multi-loop integrals regulated by dimensional regularisation. The symbolic and the numerical steps of the algorithm are combined into one program.
Program summary
Program title: sector_decompositionCatalogue identifier: AEAG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAG_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.: 47 506No. of bytes in distributed program, including test data, etc.: 328 485Distribution format: tar.gzProgramming language: C++Computer: allOperating system: UnixRAM: Depending on the complexity of the problemClassification: 4.4External routines: GiNaC, available from http://www.ginac.de, GNU scientific library, available from http://www.gnu.org/software/gslNature of problem: Computation of divergent multi-loop integrals.Solution method: Sector decomposition.Restrictions: Only limited by the available memory and CPU time.Running time: Depending on the complexity of the problem. 相似文献110.
Christian Hofmann 《OR Spectrum》1994,16(1):9-20
Es wird eine Erweiterung des mehrstufigen stationären Losgrößenproblems mit endlichen Produktionsgeschwindigkeiten um den zeitpunktgeballten Transportvorgang vorgestellt. Diese Darstellung gibt die Beziehungen zwischen Zulieferer, Transporteur und Produzent adäquat wieder. Hinsichtlich der Abstimmung der Entscheidungsgrößen dieser organisatorischen Einheiten wird zwischen einer rein simultanen, einer rein sukzessiven sowie zweier gemischt simultan-sukzessiver Koordinationsarten unterschieden. An Hand einer analytischen Untersuchung werden Unterschiede und Gemeinsamkeiten der jeweiligen Entscheidungsgrößen und der daraus resultierenden Kostenfunktionen dargestellt. Schließlich zeigt eine numerische Analyse die Gesamtkostenunterschiede zwischen der rein simultanen und rein sukzessiven Koordinationsart auf.An extension is introduced to the multi-stage stationary lot-sizing problem with finite production rates by the time-concentrated transportation-process. This representation adequately demonstrates the relations between supplier, carrier and producer. With regard to the reconciliation of the decision variables of these institutional units one differentiates between a pure simultaneous, a pure gradual and two mixed simultaneous-gradual coordination methods. The differences and correspondences of the respective decision variables and the resulting cost functions are demonstrated by means of an analytical examination. Finally, a numerical analysis shows the distinctions in total cost between the pure simultaneous and pure gradual coordination method. 相似文献