全文获取类型
收费全文 | 186篇 |
免费 | 9篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 4篇 |
综合类 | 18篇 |
化学工业 | 12篇 |
金属工艺 | 2篇 |
机械仪表 | 4篇 |
建筑科学 | 13篇 |
矿业工程 | 1篇 |
能源动力 | 7篇 |
轻工业 | 11篇 |
石油天然气 | 5篇 |
武器工业 | 5篇 |
无线电 | 22篇 |
一般工业技术 | 11篇 |
冶金工业 | 1篇 |
自动化技术 | 88篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 1篇 |
2014年 | 6篇 |
2013年 | 9篇 |
2012年 | 19篇 |
2011年 | 25篇 |
2010年 | 14篇 |
2009年 | 10篇 |
2008年 | 20篇 |
2007年 | 6篇 |
2006年 | 11篇 |
2005年 | 10篇 |
2004年 | 2篇 |
2003年 | 9篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有204条查询结果,搜索用时 31 毫秒
31.
山东恒源石油化工股份有限公司采用AXENS公司的Prime-G+催化裂化汽油固定床选择性加氢脱硫处理技术,对30万t/a柴油加氢装置进行改造。在充分利用现有资源的基础上,增加了导热油系统、全馏分选择性加氢(SHU)反应分馏系统及循环氢脱硫系统。改造工艺选用AXENS公司的选择性加氢催化剂HR-845、HR-806和R-841,在保征脱硫水平的同时,使辛烷值损失最低,完全满足汽油硫质量分数不大于50μg/g、辛烷值损失不大于1.5设计指标的要求。 相似文献
32.
潜继成 《电脑编程技巧与维护》2010,(6):36-39
Vega Prime集成运行环境解决了基于Vega Prime开发程序独立运行的难题,分析了无VP环境运行程序存在的问题和运行环境需要的模拟license和运行数据,提出了Vega Prime集成运行环境由集成运行环境引擎和集成运行环境Shell组成,并具体实现了集成运行环境。 相似文献
33.
Brian J. Winkel 《Cryptologia》2013,37(2):123-126
Great Britain and the United States seek a closer relationship between their cipher experts and Churchill admits decrypting America's diplomatic codes. 相似文献
34.
J. Rachůnek 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2003,7(7):482-485
In the paper we study MV-algebras and their non-commutative generalizations, GMV-algebras, in which every element is compact. Further, we characterize finite MV-algebras as archimedean GMV-algebras which are 0-meet compact.
Dedicated to Prof. Ján Jakubík on the occasion of his 80th birthday
Supported by the Council of Czech Government, J 14/98: 15100011. 相似文献
35.
Brahim Sadik 《Applicable Algebra in Engineering, Communication and Computing》2000,10(3):251-268
With respect to an elimination ordering, we give an upper bound for the order of characteristic set elements of an ordinary prime differential ideal. Using some results of complexity in the algebraic case, we show that computing characteristic sets of ordinary prime differential ideals, by change of ordering, is single exponential time. Received: January 8, 1997; revised version: May 6, 1999 相似文献
36.
Dense β″-alumina electrolyte tubes with thickness less than 50 μm were slip cast on a porous substrate of β″-alumina. The resistance of the composite electrolyte was measured by a DC method. The area specific resistance of a thin layer electrolyte versus the full thickness electrolyte was lower by a factor of 1.6. The components of cell resistance were determined. It was concluded that interfacial resistance is a dominant factor in the electrolyte resistance. 相似文献
37.
The development of large-area, Na-Prime" align="MIDDLE" BORDER="0">-Al2O3 single-crystal films on sapphire substrates via vapor reaction is reported. The films form at the expense of the sapphire which reacts with the alkali-vapors generated from mixed (Na,Li)-Prime" align="MIDDLE" BORDER="0">-Al2O3 powders occupying the same space as the sapphire. A number of Prime" align="MIDDLE" BORDER="0">-Al2O3 single-crystal, large area isomorphs have been synthesized via ion exchange and their refraction and luminescence properties are reported. Patterned luminescence has been achieved in Cu+-doped single-crystal films using an electrochemical cell with + electrolyte separator between aqueous-solution electrodes. Ag+ ions are injected into the Prime" align="MIDDLE" BORDER="0">-Al2O3 electrolyte and Na+ expelled. The distribution of luminescent and environment ions is controlled by electrical charge and the chemical potential of the ions in the solution electrodes. 相似文献
38.
素数域椭圆曲线密码在智能卡上的设计与实现 总被引:2,自引:0,他引:2
椭圆曲线密码体制具有密钥短,安全性高的特点,十分适合在智能卡上使用.针对智能卡存储与计算能力有限的特点,分析了选择素数域椭圆曲线密码的原因,并提出一种基于RSA基本运算的ECC实现方案.通过该方案,可以利用已有的RSA智能卡平台所提供的运算协处理器实现素数域上的ECC算法.详细分析了椭圆曲线密码实现过程中的各个细节,并针对倍点与点加这两个基本运算,设计出针对智能卡的实现方案,该方案可以最大程度节省智能卡存储空间.最后给出了素数域椭圆曲线签名算法在智能卡上实现的实验数据,证明设计的实现方案是高效的. 相似文献
39.
Narumi Sugihara Yuusuke Tsutsui Tomohiko Tagashira Tominari Choshi Satoshi Hibino Jun Kamishikiryou Koji Furuno 《Journal of Functional Foods》2011,3(4):298-304
The role of structure–activity relationships in the ability of catechins to inhibit P-glycoprotein (P-gp) function was investigated with respect to gallate and pyrogallol moieties. Experiments using octyl derivatives of gallic acid indicated that the gallate moiety required the catechol group and a neighboring carbonyl group to inhibit P-gp. On the other hand, the pyrogallol moiety appeared to require three hydroxyl groups to inhibit P-gp, according to comparisons between (−)-epicatechin gallate (ECG) and (−)-epigallocatechin gallate (EGCG). The difference in the number of hydroxyl groups that gallate or pyrogallol moieties required for P-gp inhibition, was due to the presence of a carbonyl group. The P-gp inhibition by catechins was restricted by their hydrophobicity. The pyrogallol moiety of EGC did not appear to inhibit P-gp because of its low hydrophobicity. The P-gp inhibitory activity of EGCG was speculated to be increased by the addition of long carbon chains to the C3″of gallate moieties. 相似文献
40.
M. Hegland W. W. Wheeler 《Applicable Algebra in Engineering, Communication and Computing》1997,8(2):143-163
Fast Fourier transform algorithms rely upon the choice of certain bijective mappings between the indices of the data arrays.
The two basic mappings used in the literature lead to Cooley–Tukey algorithms or to prime factor algorithms. But many other
bijections also lead to FFT algorithms, and a complete classification of these mappings is provided. One particular choice
leads to a new FFT algorithm that generalizes the prime factor algorithm. It has the advantage of reducing the floating point
operation count by reducing the number of trigonometric function evaluations.
A certain equivalence relation is defined on the set of bijections that lead to FFT algorithms, and its connection with isomorphism
classes of group extensions is studied. Under this equivalence relation every equivalence class contains bijections leading
to an FFT algorithm of the new type.
Received October 27, 1994; revised version January 25, 1996 相似文献