全文获取类型
收费全文 | 2426篇 |
免费 | 112篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 32篇 |
综合类 | 8篇 |
化学工业 | 709篇 |
金属工艺 | 43篇 |
机械仪表 | 47篇 |
建筑科学 | 123篇 |
矿业工程 | 6篇 |
能源动力 | 72篇 |
轻工业 | 227篇 |
水利工程 | 22篇 |
石油天然气 | 7篇 |
无线电 | 190篇 |
一般工业技术 | 424篇 |
冶金工业 | 233篇 |
原子能技术 | 20篇 |
自动化技术 | 380篇 |
出版年
2023年 | 29篇 |
2022年 | 35篇 |
2021年 | 47篇 |
2020年 | 36篇 |
2019年 | 47篇 |
2018年 | 55篇 |
2017年 | 54篇 |
2016年 | 75篇 |
2015年 | 67篇 |
2014年 | 85篇 |
2013年 | 123篇 |
2012年 | 112篇 |
2011年 | 156篇 |
2010年 | 109篇 |
2009年 | 97篇 |
2008年 | 122篇 |
2007年 | 109篇 |
2006年 | 82篇 |
2005年 | 85篇 |
2004年 | 62篇 |
2003年 | 72篇 |
2002年 | 53篇 |
2001年 | 45篇 |
2000年 | 42篇 |
1999年 | 43篇 |
1998年 | 85篇 |
1997年 | 51篇 |
1996年 | 53篇 |
1995年 | 37篇 |
1994年 | 32篇 |
1993年 | 34篇 |
1992年 | 24篇 |
1991年 | 26篇 |
1990年 | 24篇 |
1989年 | 23篇 |
1988年 | 13篇 |
1987年 | 15篇 |
1986年 | 22篇 |
1985年 | 25篇 |
1984年 | 22篇 |
1983年 | 14篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 12篇 |
1978年 | 19篇 |
1977年 | 12篇 |
1976年 | 20篇 |
1975年 | 16篇 |
1974年 | 14篇 |
1973年 | 9篇 |
排序方式: 共有2543条查询结果,搜索用时 15 毫秒
31.
For the efficient analysis and optimization of flexible multibody systems, gradient information is often required. Next to simple and easy-to-implement finite difference approaches, analytical methods, such as the adjoint variable method, have been developed and are now well established for the sensitivity analysis in multibody dynamics. They allow the computation of exact gradients and require normally less computational effort for large-scale problems. In the current work, we apply the adjoint variable method to flexible multibody systems with kinematic loops, which are modeled using the floating frame of reference formulation. Thereby, in order to solve ordinary differential equations only, the equations of motion are brought into minimal form using coordinate partitioning, and the constraint equations at position and velocity level are incorporated in the adjoint dynamics. For testing and illustrative purposes, the procedure is applied to compute the structural gradient for a flexible piston rod of a slider–crank mechanism. 相似文献
32.
Christoph Bosshard Roland Bouffanais Michel Deville Ralf Gruber Jonas Latt 《Computers & Fluids》2011,44(1):1-8
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed with the help of a time prediction model based on a parameterization of the application and the hardware resources. Two tailor-made benchmark cases in computational fluid dynamics (CFD) are introduced and used to carry out this review, stressing the particular interest for clusters with up to thousands of cores. Some problems in the parallel implementation have been detected and corrected. The theoretical complexities with respect to the number of elements, to the polynomial degree, and to communication needs are correctly reproduced. It is concluded that this type of code has a nearly perfect speedup on machines with thousands of cores, and is ready to make the step to next-generation petaFLOP machines. 相似文献
33.
Roland H. C. Yap 《Constraints》2001,6(2-3):157-172
Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries. 相似文献
34.
A positive and innovative organizational climate is of great importance in order to manage and adapt to change. Such a climate seldom evolves in organizations closely governed by rules and regulations. Because of ongoing organizational and technical changes within the Swedish Air Navigation Services Provider, a study concerning the organizational climate for changes and innovations was conducted to investigate the organization's capacity to cope with changes. Study locations were the two Swedish main air traffic control centers and parts of the civil aviation administration headquarters. In the study 390 subjects took part and the CCQ questionnaire was used to measure the organizational climate. The results show that the organizational climate is quite positive despite the rule-governed work. The results also show that administrative personnel assess the organizational climate as more positive than operative personnel. Comparisons between management positions did not result in any differences. 相似文献
35.
Pradeep K. Nalla Roland J. Weiss Prakash Peranandam Jürgen Ruf Thomas Kropf Wolfgang Rosenstiel 《Electronic Notes in Theoretical Computer Science》2006,135(2):47
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifies larger models and returns results faster than the sequential version.The core algorithm distributes partitions of the state set to computation nodes after reaching a threshold size. The nodes proceed with image computation on the nodes asynchronously. The main scalability problem of this scheme is the overlap of state set partitions. We present static and dynamic overlap reduction techniques. 相似文献
36.
Roland Gerber 《电信纪事》1983,38(9-10):367-379
37.
Bernd Altmayer Klaus W. Eichhorn und Roland Plapp 《Zeitschrift für Lebensmitteluntersuchung und -Forschung A》1982,175(3):172-174
Zusammenfassung Traubenmoste aus dem Weinanbaugebiet der Rheinpfalz wurden auf ihren Patulingehalt untersucht. Nach Extraktion und Reinigung wurde Patulin mit Hilfe der Hochleistungsflilssig- und Dünnschichtchromatographie bestimmt. Zur Extraktion des Patulins erwies sich die Verwendung von Extrelutsdulen als vorteilhaft. In 62% der untersuchten Proben (55) war kein Patulin nachweisbar, 22% enthielten weniger als 50 g, 16% mehr als 50 g Patulin pro Liter. Durch praxisübliche Mostschwefelung (100 mg Kaliumpyrosulîit/1) und Vergärung mit Hefen der GattungSaccharomyces konnte vorhandenes Patulin entfernt werden.
Analysis of patulin in grape juices and wine
Summary Grape juices from the wine-growing region of the palatinate Rheinpfalz were analysed for patulin. After extraction and purification patulin was determined by high performance liquid chromatography and thin layer chromatography. The use of Extrelut-columns for the extraction of patulin was found advantageous. 62% of the analysed samples (55) were free of patulin, 22% contained less than 50 g/l, 16% more than 50 g/l. By addition of sulfur dioxide to the must and fermentation withSaccharomyces sp. patulin could be removed from the samples.相似文献
38.
39.
Roland Rüdiger 《Informatik-Spektrum》2003,13(3):406-409
Algorithmen für Quantenrechner wie
der Faktorisierungsalgorithmus von Shor lassen sich mittels
neuer Programmiersprachen formulieren, die neben konventionellen
auch über für Quantenrechner spezifische Sprachkonstrukte
verfügen. In Verbindung mit Simulatoren kann man so auch bereits
heute Programme für Quantenrechner entwickeln und
testen. 相似文献
40.
The repeated median line estimator is a highly robust method for fitting a regression line to a set of n data points in the plane. In this paper, we consider the problem of updating the estimate after a point is removed from or added to the data set. This problem occurs, e.g., in statistical online monitoring, where the computational effort is often critical. We present a deterministic algorithm for the update working in O(n) time and O(n2) space. 相似文献