全文获取类型
收费全文 | 460篇 |
免费 | 25篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 10篇 |
综合类 | 4篇 |
化学工业 | 86篇 |
金属工艺 | 18篇 |
机械仪表 | 26篇 |
建筑科学 | 7篇 |
能源动力 | 36篇 |
轻工业 | 38篇 |
水利工程 | 5篇 |
石油天然气 | 1篇 |
无线电 | 43篇 |
一般工业技术 | 113篇 |
冶金工业 | 8篇 |
原子能技术 | 5篇 |
自动化技术 | 92篇 |
出版年
2024年 | 1篇 |
2023年 | 9篇 |
2022年 | 14篇 |
2021年 | 9篇 |
2020年 | 8篇 |
2019年 | 15篇 |
2018年 | 21篇 |
2017年 | 13篇 |
2016年 | 22篇 |
2015年 | 18篇 |
2014年 | 21篇 |
2013年 | 43篇 |
2012年 | 36篇 |
2011年 | 50篇 |
2010年 | 36篇 |
2009年 | 32篇 |
2008年 | 28篇 |
2007年 | 24篇 |
2006年 | 21篇 |
2005年 | 7篇 |
2004年 | 10篇 |
2003年 | 11篇 |
2002年 | 13篇 |
2001年 | 1篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1992年 | 4篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有492条查询结果,搜索用时 0 毫秒
101.
Jérémie Chalopin Shantanu Das Yann Disser Matúš Mihalák Peter Widmayer 《Algorithmica》2013,65(1):43-59
We consider the problem of mapping an initially unknown polygon of size n with a simple robot that moves inside the polygon along straight lines between the vertices. The robot sees distant vertices in counter-clockwise order and is able to recognize the vertex among them which it came from in its last move, i.e. the robot can look back. Other than that the robot has no means of distinguishing distant vertices. We assume that an upper bound on n is known to the robot beforehand and show that it can always uniquely reconstruct the visibility graph of the polygon. Additionally, we show that multiple identical and deterministic robots can always solve the weak rendezvous problem in which the robots need to position themselves such that all of them are mutually visible to each other. Our results are tight in the sense that the strong rendezvous problem, where robots need to gather at a vertex, cannot be solved in general, and, without knowing a bound beforehand, not even n can be determined. In terms of mobile agents exploring a graph, our result implies that they can reconstruct any graph that is the visibility graph of a simple polygon. This is in contrast to the known result that the reconstruction of arbitrary graphs is impossible in general, even if n is known. 相似文献
102.
Catherine J. Harrison Yann A. Le Gouellec Robert C. Cheng Amy E. Childress 《Canadian Metallurgical Quarterly》2007,133(11):1004-1014
A dual-staged nanofiltration process is being evaluated as an alternative to reverse osmosis for seawater desalination. The primary goal of this system is to reduce energy consumption while producing potable water at an acceptable recovery rate. Investigation of this system at the bench-scale level focused on membrane surface characterization, ion rejection (including boron, bromide, and iodide rejection), and flux decline. Results from this study showed that two commercially available nanofiltration membranes can effectively desalinate seawater. Although fouling was apparent—and resulted in approximately 20% flux decline over 3 days—a critical flux was not identifiable. Operation of the system at different cross-flow velocities revealed the significance of hydrodynamic conditions on the polarization modulus, and hence on membrane performance. 相似文献
103.
104.
105.
106.
Pascal Forquin Laurent Rota Yann Charles François Hild 《International Journal of Fracture》2004,125(1):171-187
An experimental procedure is developed to determine the scatter of the macroscopic toughness of brittle materials. First, samples are precracked to obtain a sharp precrack. The toughness is then determined by using a standard three-point flexural test. Digital image correlation is used to analyze displacement fields of cracked samples. Based upon the resolution and the spatial resolution of the measurement technique, a detection criterion is proposed and validated. It allows for an accurate estimate of the crack tip location so that the presence of a crack and its size at arrest can be monitored. As an example, the toughness distribution of 18 samples made of silicon carbide is evaluated. By using a simple macro-micro transition, an analysis of the scatter in toughness is related to that in strength for the material with no macrocracks. 相似文献
107.
Amorphous Ge‐Sb‐Se thin films fabricated by co‐sputtering: Properties and photosensitivity 下载免费PDF全文
Tomáš Halenkovič Jan Gutwirth Petr Němec Emeline Baudet Marion Specht Yann Gueguen Jean‐Christophe Sangleboeuf Virginie Nazabal 《Journal of the American Ceramic Society》2018,101(7):2877-2887
Amorphous Ge–Sb–Se thin films were fabricated by a rf‐magnetron co‐sputtering technique employing the following cathodes: GeSe2, Sb2Se3, and Ge28Sb12Se60. The influence of the composition, determined by energy‐dispersive X‐ray spectroscopy, on the optical properties was studied. Optical properties were analyzed based on variable angle spectroscopic ellipsometry and UV‐Vis‐NIR spectrophotometry. The results show that the optical bandgap range 1.35‐2.08 eV with corresponding refractive index ranging from 3.33 to 2.36 can be reliably covered. Furthermore, morphological and topographical properties of selenide‐sputtered films studied by scanning electron microscopy and atomic force microscopy showed a good quality of fabricated films. In addition, structure of the films was controlled using Raman scattering spectroscopy. Finally, irreversible photoinduced changes by means of change in optical bandgap energy and refractive index of co‐sputtered films were studied revealing the photobleaching effect in Ge‐rich films when irradiated by near‐bandgap light under Ar atmosphere. The photobleaching effect tends to decrease with increasing antimony content. 相似文献
108.
109.
110.
We present in this paper a variation of the self-organising map algorithm where the original time-dependent (learning rate and neighbourhood) learning function is replaced by a time-invariant one. This allows for on-line and continuous learning on both static and dynamic data distributions. One of the property of the newly proposed algorithm is that it does not fit the magnification law and the achieved vector density is not directly proportional to the density of the distribution as found in most vector quantisation algorithms. From a biological point of view, this algorithm sheds light on cortical plasticity seen as a dynamic and tight coupling between the environment and the model. 相似文献