全文获取类型
收费全文 | 1093篇 |
免费 | 66篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 13篇 |
综合类 | 3篇 |
化学工业 | 254篇 |
金属工艺 | 30篇 |
机械仪表 | 16篇 |
建筑科学 | 111篇 |
矿业工程 | 2篇 |
能源动力 | 40篇 |
轻工业 | 50篇 |
水利工程 | 4篇 |
武器工业 | 1篇 |
无线电 | 73篇 |
一般工业技术 | 191篇 |
冶金工业 | 88篇 |
原子能技术 | 9篇 |
自动化技术 | 275篇 |
出版年
2024年 | 4篇 |
2023年 | 20篇 |
2022年 | 20篇 |
2021年 | 56篇 |
2020年 | 29篇 |
2019年 | 29篇 |
2018年 | 44篇 |
2017年 | 32篇 |
2016年 | 51篇 |
2015年 | 40篇 |
2014年 | 66篇 |
2013年 | 62篇 |
2012年 | 68篇 |
2011年 | 88篇 |
2010年 | 62篇 |
2009年 | 65篇 |
2008年 | 50篇 |
2007年 | 51篇 |
2006年 | 29篇 |
2005年 | 44篇 |
2004年 | 29篇 |
2003年 | 13篇 |
2002年 | 15篇 |
2001年 | 23篇 |
2000年 | 4篇 |
1999年 | 14篇 |
1998年 | 19篇 |
1997年 | 22篇 |
1996年 | 15篇 |
1995年 | 14篇 |
1994年 | 5篇 |
1993年 | 13篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1981年 | 4篇 |
1979年 | 3篇 |
1975年 | 2篇 |
1974年 | 4篇 |
1971年 | 3篇 |
1970年 | 1篇 |
1969年 | 2篇 |
1968年 | 2篇 |
1963年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1160条查询结果,搜索用时 15 毫秒
31.
Higher‐order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a new class of data that must be analyzed by scientists and engineers. Currently available visualization tools for this type of data are either batch oriented or limited to certain cell types and polynomial degrees. Other approaches approximate higher‐order data by resampling resulting in trade‐offs in interactivity and quality. To overcome these limitations, we have developed a distributed visualization system which allows for interactive exploration of non‐conforming unstructured grids, resulting from space‐time discontinuous Galerkin simulations, in which each cell has its own higher‐order polynomial solution. Our system employs GPU‐based raycasting for direct volume rendering of complex grids which feature non‐convex, curvilinear cells with varying polynomial degree. Frequency‐based adaptive sampling accounts for the high variations along rays. For distribution across a GPU cluster, the initial object‐space partitioning is determined by cell characteristics like the polynomial degree and is adapted at runtime by a load balancing mechanism. The performance and utility of our system is evaluated for different aeroacoustic simulations involving the propagation of shock fronts. 相似文献
32.
It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-Löf randomness. Joe Miller and André Nies suggested some variations of Kolmogorov-Loveland randomness to approach this problem and to provide a partial solution. We show that their proposed notion of injective randomness is still weaker than Martin-Löf randomness. Since in this proof some of the ideas we use are clearer, we also show the weaker theorem that permutation randomness is weaker than Martin-Löf randomness. 相似文献
33.
Sofia Cassel Falk Howar Bengt Jonsson Bernhard Steffen 《Formal Aspects of Computing》2016,28(2):233-263
We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. Our algorithm infers a class of EFSMs called register automata. Register automata have a finite control structure, extended with variables (registers), assignments, and guards. Our algorithm is parameterized on a particular theory, i.e., a set of operations and tests on the data domain that can be used in guards.Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We also show that, under these conditions, our framework induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library. 相似文献
34.
35.
The World Wide Web has turned hypertext into a success story by enabling world-wide sharing of unstructured information and informal knowledge. The Semantic Web targets the sharing of structured information and formal knowledge pursuing objectives of achieving collective intelligence on the Web. Germane to the structure of the Semantic Web is a layering and standardization of concerns. These concerns are reflected by an architecture of the Semantic Web that we present through a common use case. Semantic Web data for the use case is now found on the Web and is part of a quickly growing set of Semantic Web resources available for formal processing. 相似文献
36.
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. 相似文献
37.
Progress in scanning probe microscopy profited from a flourishing multitude of new instrument designs, which lead to novel imaging modes and as a consequence to innovative microscopes. Often these designs were hampered by the restrictions, which conventional milling techniques impose. Modern rapid prototyping techniques, where layer by layer is added to the growing piece either by light driven polymerization or by three-dimensional printing techniques, overcome this constraint, allowing highly concave or even embedded and entangled structures. We have employed such a technique to manufacture an atomic force microscopy (AFM) head, and we compared its performance with a copy milled from aluminum. We tested both AFM heads for single molecule force spectroscopy applications and found little to no difference in the signal-to-noise ratio as well as in the thermal drift. The lower E modulus seems to be compensated by higher damping making this material well suited for low noise and low drift applications. Printing an AFM thus offers unparalleled freedom in the design and the rapid production of application-tailored custom instruments. 相似文献
38.
河流景观是人类需求与自然基底相互作用形成的复
杂、多尺度嵌套的社会生态和水文地貌系统。基于水文地貌学
原理的“河流样式框架”为理解河流“形式与过程”之间的关
系提供了一个成熟的分析工具。系统梳理河流样式框架的基本
原则、具体步骤与核心内容,提出多尺度的空间层级划分、河
流样式与地貌单元的分类体系是该框架解释河流特征与河流行
为的核心方法。进而在流域尺度依据地貌状况与修复潜力评估
结果确定各个河段修复管理的优先次序,在河段尺度通过河流
演变轨迹分析预测河流的变化趋势。以期为“基于过程”的河
流景观修复设计与行动计划提供理论支持。 相似文献
39.
Prerna Arora Lu Zhang Cheila Rocha Luise Graichen Inga Nehlmeier Amy Kempf Anne Cossmann Gema Morillas Ramos Eva Baier Bjrn Tampe Onnen Moerer Steffen Dickel Martin S. Winkler Georg M. N. Behrens Stefan Phlmann Markus Hoffmann 《International journal of molecular sciences》2022,23(22)
Recently, a recombinant SARS-CoV-2 lineage, XD, emerged that harbors a spike gene that is largely derived from the Omicron variant BA.1 in the genetic background of the Delta variant. This finding raised concerns that the recombinant virus might exhibit altered biological properties as compared to the parental viruses and might pose an elevated threat to human health. Here, using pseudotyped particles, we show that ACE2 binding and cell tropism of XD mimics that of BA.1. Further, XD and BA.1 displayed comparable sensitivity to neutralization by antibodies induced upon vaccination with BNT162b2/Comirnaty (BNT) or BNT vaccination followed by breakthrough infection. Our findings reveal important biological commonalities between XD and Omicron BA.1 host cell entry and its inhibition by antibodies. 相似文献
40.