全文获取类型
收费全文 | 118篇 |
免费 | 3篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 9篇 |
矿业工程 | 2篇 |
轻工业 | 6篇 |
水利工程 | 1篇 |
无线电 | 4篇 |
一般工业技术 | 32篇 |
冶金工业 | 15篇 |
原子能技术 | 1篇 |
自动化技术 | 49篇 |
出版年
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 1篇 |
2013年 | 6篇 |
2012年 | 4篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 2篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 2篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1981年 | 1篇 |
排序方式: 共有121条查询结果,搜索用时 31 毫秒
51.
Sprinkhuizen SM Bakker CJ Ippel JH Boelens R Viergever MA Bartels LW 《Magma (New York, N.Y.)》2012,25(1):33-39
Object
Proton resonance frequency shift (PRFS)-based MR thermometry (MRT) is hampered by heat-induced susceptibility changes when applied in tissues containing fat, e.g., the human breast. In order to assess the impact of fat susceptibility changes on PRFS-based MRT during thermal therapy in the human breast, reliable knowledge of the temperature dependence of the magnetic volume susceptibility of fat, dχfat/dT, is a prerequisite. In this work we have measured dχfat/dT of human breast fat tissue, using a double-reference method to ensure invariance to temperature-induced changes in the proton electron screening constant. 相似文献52.
53.
Huan He Zhanqi Guo Piet Stroeven Martijn Stroeven Lambertus Johannes Sluys 《Materials Characterization》2009,60(10):1082-1087
Aggregate roughly takes up three-quarters of the volume of concrete, so it plays an important role in the properties of concrete. A particle packing phenomenon exists in a wide range of fields as well as in concrete technology. A spherical grain shape is generally adopted in conventional discrete element simulation (DES) systems, despite imposing serious limitations. In this paper, a flexible simulation strategy is presented for the simulation of arbitrary-shaped aggregate grains used in concrete technology. This simulation approach is also incorporated in a concurrent algorithm-based DES system. Furthermore, a method has been developed for the assessment of properties pertaining to arbitrary shaped particles, such as mass, centre of mass, and moment of inertia. Some trials of particle packing with different shapes are also revealed and discussed in this paper. 相似文献
54.
A microcountercurrent flame photometric detector (microcc-FPD) was adapted and optimized for ultrafast gas chromatographic (GC) separation and detection of organophosphor (OP) and organosulfur (OS) compounds on short chromatographic columns. Air and hydrogen are introduced to the microcc-FPD from opposite directions, creating a hydrogen-rich flame. In this microcc-FPD, combustion takes place between the burner tips without touching them. The separation between the tips and the flame reduces heat loss from the flame to the surrounding environment, resulting in low hydrogen consumption and a compact flame. The microcc-FPD is capable of detecting very narrow (13 ms) chromatographic peaks. An ultrafast GC separation of a group of six OP and OS compounds is achieved within less than 5 s using fast temperature programming of a 0.5-m-long microbore column. Very fast separations are also demonstrated on a 1-m-long microfabricated column consisting of 150-microm-wide, 240-microm-deep channels, etched in a 1.9-cm square silicon chip, covered with a Pyrex wafer, and statically coated with dimethyl polysiloxane. With a hydrogen flow rate of 10 mL/min, the detection limit for OP is 12 pg of P/s and 3 ng of S/s for OS compounds at a signal-to-noise ratio of 2. The coupling of a microfabricated column and a miniature FPD is an important step toward the development of a miniaturized GC-FPD capable of ultrafast detection of low levels of OP and OS compounds. 相似文献
55.
Smid Henderikus G.; Mulder Gijsbertus; Mulder Lambertus J.; Brands Gerrit J. 《Canadian Metallurgical Quarterly》1992,18(4):1101
Ss performed a hybrid go/no-go reaction task in which colored letters were assigned in various ways to 4 finger responses, 2 on each hand. In addition to reaction time (RT), psychophysiological measures were used to assess the duration of stimulation and the onset of central and peripheral motor activity. The results suggest that response selection can begin on the basis of 1 stimulus dimension (e.g., color), while the other dimension (e.g., letter form) has not yet been identified. Other results are discussed with regard to "selection for action" (D. A. Allport, 1987) and the importance of stimulus–response translation strategies in the use of partial information. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
56.
Wim H. Hesselink 《Distributed Computing》1995,9(1):21-36
Summary The correctness of a program for wait-free linearization ofan arbitrary shared data object in bounded memory is verified mechanically. The program uses atomic read-write registers, an array of consensus registers and one compare and swap register. In the program, a number of processes concurrently inspect and modify a pointer structure without waiting. Consequently, the proof of correctness is very delicate. The theorem prover NQTHM of Boyer and Moore has been used to mechanically certify the correctress.
Wim H. Hesselink received his Ph.D. in mathematics from the University of Utrecht in 1975. After ten years of research in Lie algebras he turned to computer science. In 1986/1987 he was on leave with the Department of Computer Sciences of the University of Texas at Austin. Currently, he is chairman of the Department of Computing Science at the University of Groningen. His research interests include distributed programming, design and correctness of algorithms, mechanicaltheorem proving, and predicate transformation semantics of recursive procedures with nondeterminacy of various flavors. 相似文献
57.
58.
59.
Wim H. Hesselink 《Acta Informatica》1996,33(3):233-254
The problem is to let n processes concurrently and repeatedly search for free addresses in a range of m addresses. The search must be wait-free: a searching process finds an address in a bounded number of steps. Three solutions
are presented. The first one has large atomic actions. The second one is only correct if m≧(r+1) ⋅ n where r is the maximum number of used addresses. The third solution is always partially correct. It is wait-free if m>r+2 ⋅ n. This solution has a worst-case waiting time quadratic in n and an amortized waiting time linear in n, even linear in the number of active processes.
Received February 2, 1994/January 24, 1995 相似文献
60.