全文获取类型
收费全文 | 2637篇 |
免费 | 154篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 50篇 |
综合类 | 7篇 |
化学工业 | 714篇 |
金属工艺 | 67篇 |
机械仪表 | 67篇 |
建筑科学 | 171篇 |
矿业工程 | 2篇 |
能源动力 | 57篇 |
轻工业 | 215篇 |
水利工程 | 6篇 |
石油天然气 | 2篇 |
无线电 | 238篇 |
一般工业技术 | 532篇 |
冶金工业 | 223篇 |
原子能技术 | 14篇 |
自动化技术 | 428篇 |
出版年
2022年 | 17篇 |
2021年 | 55篇 |
2020年 | 37篇 |
2019年 | 50篇 |
2018年 | 51篇 |
2017年 | 70篇 |
2016年 | 72篇 |
2015年 | 81篇 |
2014年 | 96篇 |
2013年 | 139篇 |
2012年 | 118篇 |
2011年 | 175篇 |
2010年 | 115篇 |
2009年 | 119篇 |
2008年 | 132篇 |
2007年 | 121篇 |
2006年 | 106篇 |
2005年 | 85篇 |
2004年 | 69篇 |
2003年 | 72篇 |
2002年 | 51篇 |
2001年 | 51篇 |
2000年 | 54篇 |
1999年 | 44篇 |
1998年 | 80篇 |
1997年 | 59篇 |
1996年 | 51篇 |
1995年 | 37篇 |
1994年 | 30篇 |
1993年 | 32篇 |
1992年 | 25篇 |
1991年 | 24篇 |
1990年 | 19篇 |
1989年 | 27篇 |
1988年 | 20篇 |
1987年 | 14篇 |
1986年 | 27篇 |
1985年 | 23篇 |
1984年 | 24篇 |
1983年 | 19篇 |
1982年 | 16篇 |
1981年 | 22篇 |
1980年 | 18篇 |
1979年 | 20篇 |
1978年 | 22篇 |
1977年 | 26篇 |
1976年 | 21篇 |
1975年 | 14篇 |
1974年 | 15篇 |
1973年 | 14篇 |
排序方式: 共有2793条查询结果,搜索用时 15 毫秒
61.
Holger Maune Mohsen Sazegar Yuliang Zheng Xianghui Zhou Andre Giere Patrick Scheele Florian Paul Joachim R. Binder Rolf Jakoby 《Microsystem Technologies》2011,17(2):213-224
The research on materials and systems for tunable microwave devices has gained attraction within the last years. The radio
frequency characterization and the component design of tunable microwave components based on dielectric ceramics especially
barium-strontium-titanate (BST) are presented in this second part, whereas the basic material properties are discussed in
detail in the first part. After a short introduction to the processing technology used for the fabrication of tunable components
based on a BST thick film, the relations between microwave properties and material properties as well as the microstructure
are presented in detail. The design process for tunable microwave components based on BST thick films is described. Especially
the considerations related to micro- and macrostructure and their connection are highlighted. The paper closes with two different
application examples: a reconfigurable array antenna for satellite communication and varactors for high power applications. 相似文献
62.
The geometric element transformation method (GETMe) is a geometry-based smoothing method for mixed and non-mixed meshes. It
is based on a simple geometric transformation applicable to elements bounded by polygons with an arbitrary number of nodes.
The transformation, if applied iteratively, leads to a regularization of the polygons. Global mesh smoothing is accomplished
by averaging the new node positions obtained by local element transformations. Thereby, the choice of transformation parameters
as well as averaging weights can be based on the element quality which leads to high quality results. In this paper, a concept
of an enhanced transformation approach is presented and a proof for the regularizing effect of the transformation based on
eigenpolygons is given. Numerical examples confirm that the GETMe approach leads to superior mesh quality if compared to other
geometry-based methods. In terms of quality it can even compete with optimization-based techniques, despite being conceptually
significantly simpler. 相似文献
63.
It is well-known that there are striking analogies between linear shift-invariant systems and morphological systems for image analysis. So far, however, the relations between both system theories are mainly understood on a pure convolution / erosion level. A formal connection on the level of differential or pseudodifferential equations and their induced scale-spaces is still missing. The goal of our paper is to close this gap. We present a simple and fairly general dictionary that allows to translate any linear shift-invariant evolution equation into its morphological counterpart and vice versa. It is based on a scale-space representation by means of the symbol of its (pseudo)differential operator. Introducing a novel transformation, the Cramér–Fourier transform, puts us in a position to relate the symbol to the structuring function of a morphological scale-space of Hamilton–Jacobi type. As an application of our general theory, we derive the morphological counterparts of many linear shift-invariant scale-spaces, such as the Poisson scale-space, \(\alpha \)-scale-spaces, summed \(\alpha \)-scale-spaces, relativistic scale-spaces, and their anisotropic variants. Our findings are illustrated by experiments. 相似文献
64.
In this paper, we present an automatic C-code generation strategy for real-time nonlinear model predictive control (NMPC), which is designed for applications with kilohertz sample rates. The corresponding code export module has been implemented within the software package ACADO Toolkit. It is capable of exporting fixed step-size integrators together with their sensitivities as well as a real-time Gauss–Newton method. Here, we employ the symbolic representation of optimal control problems in ACADO in order to auto-generate plain C-code which is optimized for final production. The exported code has been tested for model predictive control scenarios comprising constrained nonlinear dynamic systems with four states and a control horizon of ten samples. The numerical simulations show a promising performance of the exported code being able to provide feedback in much less than a millisecond. 相似文献
65.
Moreno R Garcia MA Puig D Pizarro L Burgeth B Weickert J 《IEEE transactions on pattern analysis and machine intelligence》2011,33(11):2215-2228
This paper proposes two alternative formulations to reduce the high computational complexity of tensor voting, a robust perceptual grouping technique used to extract salient information from noisy data. The first scheme consists of numerical approximations of the votes, which have been derived from an in-depth analysis of the plate and ball voting processes. The second scheme simplifies the formulation while keeping the same perceptual meaning of the original tensor voting: The stick tensor voting and the stick component of the plate tensor voting must reinforce surfaceness, the plate components of both the plate and ball tensor voting must boost curveness, whereas junctionness must be strengthened by the ball component of the ball tensor voting. Two new parameters have been proposed for the second formulation in order to control the potentially conflictive influence of the stick component of the plate vote and the ball component of the ball vote. Results show that the proposed formulations can be used in applications where efficiency is an issue since they have a complexity of order O(1). Moreover, the second proposed formulation has been shown to be more appropriate than the original tensor voting for estimating saliencies by appropriately setting the two new parameters. 相似文献
66.
We present an algorithm that finds out-trees and out-branchings with at least k leaves in directed graphs. These problems are known as Directed Maximum Leaf Out-Tree and Directed Maximum Leaf Out-Branching, respectively, and—in the case of undirected graphs—as Maximum Leaf Spanning Tree. The run time of our algorithm is O(4
k
nm) on directed graphs and O(poly(n)+4
k
k
2) on undirected graphs. This improves over the previously fastest algorithms for these problems with run times of 2
O(klog k)
poly(n) and O(poly(n)+6.75
k
poly(k)) respectively. 相似文献
67.
Knowledge visualization for evaluation tasks 总被引:1,自引:1,他引:0
Although various methods for the evaluation of intelligent systems have been proposed in the past, almost no techniques are
present that support the manual inspection of knowledge bases by the domain specialist. Manual knowledge base inspection is
an important and frequently applied method in knowledge engineering. Since it can hardly be performed in an automated manner,
it is a time-consuming and costly task. In this paper, we discuss a collection of appropriate visualization techniques that
help developers to interactively browse and analyze the knowledge base in order to find deficiencies and semantic errors in
their implementation. We describe standard visualization methods adapted to specifically support the analysis of the static
knowledge base structure, but also of the usage of knowledge base objects such as questions or solutions. Additionally, we
introduce a novel visualization technique that supports the validation of the derivation and interview behavior of a knowledge
system in a semi-automatic manner. The application of the presented methods was motivated by the daily practice of knowledge
base development. 相似文献
68.
Peter Coschurba Joachim Baumann Uwe Kubach Alexander Leonhardi 《Personal and Ubiquitous Computing》2001,5(1):16-19
Metaphors are often used to provide the user with a mental model to ease the use of computers. An example of such a metaphor
is the commonly used “Desktop Metaphor”. Metaphors also can be used to ease context-aware information access for the users
of mobile information systems. In this paper we present a taxonomy that allows the categorisation of such metaphors. Furthermore,
we give an overview of existing metaphors and their implementations. After introducing some new metaphors we conclude our
considerations with a classification of new and existing metaphors using our taxonomy. 相似文献
69.
An Internet-based negotiation server for e-commerce 总被引:6,自引:0,他引:6
Stanley Y.W. Su Chunbo Huang Joachim Hammer Yihua Huang Haifei Li Liu Wang Youzhong Liu Charnyote Pluempitiwiriyawej Minsoo Lee Herman Lam 《The VLDB Journal The International Journal on Very Large Data Bases》2001,10(1):72-90
This paper describes the design and implementation of a replicable, Internet-based negotiation server for conducting bargaining-type
negotiations between enterprises involved in e-commerce and e-business. Enterprises can be buyers and sellers of products/services
or participants of a complex supply chain engaged in purchasing, planning, and scheduling. Multiple copies of our server can
be installed to complement the services of Web servers. Each enterprise can install or select a trusted negotiation server
to represent his/her interests. Web-based GUI tools are used during the build-time registration process to specify the requirements,
constraints, and rules that represent negotiation policies and strategies, preference scoring of different data conditions,
and aggregation methods for deriving a global cost-benefit score for the item(s) under negotiation. The registration information
is used by the negotiation servers to automatically conduct bargaining type negotiations on behalf of their clients. In this
paper, we present the architecture of our implementation as well as a framework for automated negotiations, and describe a
number of communication primitives which are used in the underlying negotiation protocol. A constraint satisfaction processor
(CSP) is used to evaluate a negotiation proposal or counterproposal against the registered requirements and constraints of
a client company. In case of a constraint violation, an event is posted to trigger the execution of negotiation strategic
rules, which either automatically relax the violated constraint, ask for human intervention, invoke an application, or perform
other remedial operations. An Event-Trigger-Rule (ETR) server is used to manage events, triggers, and rules. Negotiation strategic
rules can be added or modified at run-time. A cost-benefit analysis component is used to perform quantitative analysis of
alternatives. The use of negotiation servers to conduct automated negotiation has been demonstrated in the context of an integrated
supply chain scenario.
Received: 30 October 2000 / Accepted: 12 January 2001 Published online: 2 August 2001 相似文献
70.