全文获取类型
收费全文 | 347篇 |
免费 | 23篇 |
专业分类
电工技术 | 5篇 |
综合类 | 1篇 |
化学工业 | 91篇 |
金属工艺 | 12篇 |
机械仪表 | 12篇 |
建筑科学 | 20篇 |
矿业工程 | 5篇 |
能源动力 | 16篇 |
轻工业 | 22篇 |
水利工程 | 2篇 |
无线电 | 28篇 |
一般工业技术 | 69篇 |
冶金工业 | 12篇 |
自动化技术 | 75篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 5篇 |
2021年 | 21篇 |
2020年 | 13篇 |
2019年 | 19篇 |
2018年 | 15篇 |
2017年 | 11篇 |
2016年 | 18篇 |
2015年 | 19篇 |
2014年 | 20篇 |
2013年 | 21篇 |
2012年 | 15篇 |
2011年 | 34篇 |
2010年 | 20篇 |
2009年 | 23篇 |
2008年 | 21篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 2篇 |
1985年 | 5篇 |
1982年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1963年 | 2篇 |
排序方式: 共有370条查询结果,搜索用时 15 毫秒
1.
Hannes Verlinde Martine De Cock Raymond Boute 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2006,36(3):679-684
As opposed to quantitative association rule mining, fuzzy association rule mining is said to prevent the overestimation of boundary cases, as can be shown by small examples. Rule mining, however, becomes interesting in large databases, where the problem of boundary cases is less apparent and can be further suppressed by using sensible partitioning methods. A data-driven approach is used to investigate if there is a significant difference between quantitative and fuzzy association rules in large databases. The influence of the choice of a particular triangular norm in this respect is also examined. 相似文献
2.
Andreas Klenk Andreas Beck-Greinwald Hannes Angst Georg Carle 《Service Oriented Computing and Applications》2012,6(4):321-335
Inter-domain collaborations suffer not only from technological obstacles that hinder interoperability, but also from diverting business objectives of the involved domains. Today, hand-crafted contracts define the terms and conditions for service interactions. Electronic negotiation can serve as the enabler of dynamic interdomain collaborations by providing a large degree of freedom for the automation of agreement formation and electronic contracting. Negotiation by electronic means has been an area of intensive research for many years now. However, most effort was put on the determination of prices and neglected that real-world agreements also consist of complex dependencies of interdependent obligations. In this paper we present agreement negotiation as a tool to establish ad hoc services collaborations. Our novel protocol allows for the discovery of complex agreement options and for the formation of multi-party agreements. The protocol works through an iterative exchange of requirements and offers. A major benefit over existing bilateral negotiation protocols is that our protocol is capable of discovering potential collaborations between different parties. It will leave each negotiating party with a complete agreement document after a successful negotiation. This comprehensive agreement document defines the interdependent obligations between all parties and is well suited for E-Contracting. 相似文献
3.
Anna Kutschenko Selma Staege Karen Grütz Hannes Glaß Norman Kalmbach Thomas Gschwendtberger Lisa M. Henkel Johanne Heine Anne Grünewald Andreas Hermann Philip Seibler Florian Wegner 《International journal of molecular sciences》2021,22(7)
Myoclonus-dystonia (DYT-SGCE, formerly DYT11) is characterized by alcohol-sensitive, myoclonic-like appearance of fast dystonic movements. It is caused by mutations in the SGCE gene encoding ε-sarcoglycan leading to a dysfunction of this transmembrane protein, alterations in the cerebello-thalamic pathway and impaired striatal plasticity. To elucidate underlying pathogenic mechanisms, we investigated induced pluripotent stem cell (iPSC)-derived striatal medium spiny neurons (MSNs) from two myoclonus-dystonia patients carrying a heterozygous mutation in the SGCE gene (c.298T>G and c.304C>T with protein changes W100G and R102X) in comparison to two matched healthy control lines. Calcium imaging showed significantly elevated basal intracellular Ca2+ content and lower frequency of spontaneous Ca2+ signals in SGCE MSNs. Blocking of voltage-gated Ca2+ channels by verapamil was less efficient in suppressing KCl-induced Ca2+ peaks of SGCE MSNs. Ca2+ amplitudes upon glycine and acetylcholine applications were increased in SGCE MSNs, but not after GABA or glutamate applications. Expression of voltage-gated Ca2+ channels and most ionotropic receptor subunits was not altered. SGCE MSNs showed significantly reduced GABAergic synaptic density. Whole-cell patch-clamp recordings displayed elevated amplitudes of miniature postsynaptic currents and action potentials in SGCE MSNs. Our data contribute to a better understanding of the pathophysiology and the development of novel therapeutic strategies for myoclonus-dystonia. 相似文献
4.
Hannes Tschofenig 《Datenschutz und Datensicherheit - DuD》2016,40(4):222-224
Over the last few years Internet of Things products have become known for their weak security. News articles regularly describe security vulnerabilities of cars, surveillance cameras, kettles, and other IoT devices. There are, however, recent standardization activities addressing some of these security challenges. This article describes how the work of the IETF and the FIDO Alliance can lead to improved security. 相似文献
5.
6.
Georg Menge Hannes Lorenz Zongwen Fu Franziska Eichhorn Florian Schader Kyle G. Webber Tobias Fey Peter Greil Nahum Travitzky 《Advanced Engineering Materials》2018,20(7)
7.
Falk Hüffner Christian Komusiewicz Hannes Moser Rolf Niedermeier 《Theory of Computing Systems》2010,47(1):196-217
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted case, one searches for a minimum
number of vertex deletions to transform a graph into a collection of disjoint cliques. The parameter is the number of vertex
deletions. We present efficient fixed-parameter algorithms for CVD applying the fairly new iterative compression technique.
Moreover, we study the variant of CVD where the maximum number of cliques to be generated is prespecified. Here, we exploit
connections to fixed-parameter algorithms for (weighted) Vertex Cover. 相似文献
8.
Walter Lang Frank Jakobs Elena Tolstosheeva Hannes Sturm Azat Ibragimov Antonia Kesel Dirk Lehmhus Ursula DickeAuthor vitae 《Sensors and actuators. A, Physical》2011,171(1):3-11
Ubiquitous computing is about to become part of our everyday lives by integrating hundreds of “invisible” to us computing devices in our environment, so that they can unobtrusively and constantly assist us. This will imply more and smaller “invisible” sensors, homogeneously distributed and at the same time densely packed in host materials, responding to various stimuli and immediately delivering information. In order to reach this aim, the embedded sensors should be integrated within the host material, heading towards sensorial materials. The first step is to omit all parts that are not needed for the sensorial task and to find new solutions for a gentle integration. This is what we call function scale integration. The paper discusses sensor embedding in the human hand as an example of integration in nature, new technological applications and main challenges associated with this approach. 相似文献
9.
Generating feature spaces for linear algorithms with regularized sparse kernel slow feature analysis
Wendelin B?hmer Steffen Grünew?lder Hannes Nickisch Klaus Obermayer 《Machine Learning》2012,89(1-2):67-86
Without non-linear basis functions many problems can not be solved by linear algorithms. This article proposes a method to automatically construct such basis functions with slow feature analysis (SFA). Non-linear optimization of this unsupervised learning method generates an orthogonal basis on the unknown latent space for a given time series. In contrast to methods like PCA, SFA is thus well suited for techniques that make direct use of the latent space. Real-world time series can be complex, and current SFA algorithms are either not powerful enough or tend to over-fit. We make use of the kernel trick in combination with sparsification to develop a kernelized SFA algorithm which provides a powerful function class for large data sets. Sparsity is achieved by a novel matching pursuit approach that can be applied to other tasks as well. For small data sets, however, the kernel SFA approach leads to over-fitting and numerical instabilities. To enforce a stable solution, we introduce regularization to the SFA objective. We hypothesize that our algorithm generates a feature space that resembles a Fourier basis in the unknown space of latent variables underlying a given real-world time series. We evaluate this hypothesis at the example of a vowel classification task in comparison to sparse kernel PCA. Our results show excellent classification accuracy and demonstrate the superiority of kernel SFA over kernel PCA in encoding latent variables. 相似文献
10.
Performance limits of electron holography 总被引:1,自引:0,他引:1
Lichte H 《Ultramicroscopy》2008,108(3):256-262
Transmission electron microscopy is wave optics. The object exit wave contains the full object information. However, in the usual intensity images, recorded either in real space or in Fourier space, the phases are missing. In many applications at medium and at high resolution, electron holography has shown its unique ability of solving the “missing phase problem” and utilizing the recovered phase for complete interpretation of the object structure. The question is “What are the performance limits?” with respect to field of view, lateral resolution and signal resolution. In this article, the performance limits are derived and discussed. 相似文献