全文获取类型
收费全文 | 48篇 |
免费 | 5篇 |
国内免费 | 22篇 |
专业分类
电工技术 | 1篇 |
综合类 | 2篇 |
化学工业 | 4篇 |
金属工艺 | 2篇 |
机械仪表 | 2篇 |
轻工业 | 11篇 |
水利工程 | 2篇 |
石油天然气 | 4篇 |
无线电 | 6篇 |
一般工业技术 | 3篇 |
原子能技术 | 2篇 |
自动化技术 | 36篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 1篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 9篇 |
2016年 | 2篇 |
2015年 | 4篇 |
2014年 | 3篇 |
2013年 | 4篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 4篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2002年 | 1篇 |
2001年 | 3篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有75条查询结果,搜索用时 31 毫秒
1.
本项工程采用铵梯炸药、水胶炸药、毫秒延期电雷管等爆破器材,运用微差起爆,定向折叠,水压爆破等控制爆破技术,成功地拆除了总面积达3800m2的建筑群,达到了爆破噪声低,震动小,碎片坍塌范围小,尘土飞扬少等原设计目标。 相似文献
2.
3.
This work studies a nonlinear optimization problem subject to fuzzy relational equations with max-t-norm composition. Since the feasible domain of fuzzy relational equations with more than one minimal solution is non-convex, traditional nonlinear programming methods usually cannot solve them efficiently. This work proposes a genetic algorithm to solve this problem. This algorithm first locates the feasible domain through the maximum solution and the minimal solutions of the fuzzy relational equations, to significantly reduce the search space. The algorithm then executes all genetic operations inside this feasible domain, and thus avoids the need to check the feasibility of each solution generated. Moreover, it uses a local search operation to fine-tune each mutated solution. Experimental results indicate that the proposed algorithm can accelerate the searching speed and find the optimal solution. 相似文献
4.
5.
For distributed databases, checkpointing is used to ensure an efficient way to perform global reconstruction. However, the need for global reconstruction is infrequent. Most current checkpointing approaches for distributed databases are too expensive during run time. Some of them allow the checkpointing process to run in parallel with normal transactions at the cost of more data and resource contention, which in turn causes longer response time for normal transactions. Thus, an efficient way to checkpoint distributed databases is needed to avoid degrading the system performance. This paper presents a low-cost solution, called Loosely Synchronized Local Fuzzy Checkpointing (LSLFC), to these problems. LSLFC supports global reconstruction, and our performance study shows that LSLFC has little overhead during run time. 相似文献
6.
Active Store Window: Enabling Far Store-Load Forwarding with Scalability and Complexity-Efficiency
下载免费PDF全文
![点击此处可从《计算机科学技术学报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Conventional dynamically scheduled processors often use fully associative structures named load/store queue (LSQ) to implement the value communication between loads and the older in-flight stores and to detect the store-load order violation.But this in-flight forwarding only occupies about 15% of all store-load communications,which makes the CAM-based micro-architecture the major bottleneck to scale store-load communication further.This paper presents a new micro-architecture named ASW (short for active store window).It provides a new structure named speculative active store window to implement more aggressively speculative store-load forwarding than conventional LSQ.This structure could forward the data of committed stores to the executing loads without accessing to L1 data cache,which is referred to as far forwarding in this paper.At the back-end of the pipeline,it uses in-order load re-execution filtered by the tagged SSBF (short for store sequence bloom filter) to verify the correctness of the store-load forwarding.The speculative active store window and tagged store sequence bloom filter are all set-associate structures that are more efficient and scalable than fully associative structures.Experiments show that this simpler and faster design outperforms a conventional load/store queue based design and the NoSQ design on most benchmarks by 10.22% and 8.71% respectively. 相似文献
7.
基于选择性集成的最大化软间隔算法 总被引:1,自引:0,他引:1
当前,boosting集成学习算法研究主要集中于最大化弱学习器凸组合的间隔或软间隔,该凸组合几乎使用了生成的所有弱学习器,然而这些弱学习器间存在大量的相关性和冗余,增加了训练和分类过程的时空复杂度.针对这一问题,在LPBoost基础上提出了一种选择性boosting集成学习算法,称为SelectedBoost.在每次迭代生成新的弱学习器以后,通过计算新生成的弱学习器与已有弱学习器的相关度和差异度,并结合当前集成的强学习器的准确率来判断是否选择该弱学习器.另外,当前的一系列boosting算法(如AdaBoost,LPBoost,ERLPBoost等),本质上是基于已生成的1个或者多个弱学习器来更新样本权重,但与弱学习器相比,强学习器更能代表当前的决策面.因此,SelectedBoost通过在带约束的间隔最大化问题中引入更加严格的强学习器边界约束条件,使得该算法不仅参考弱学习器边界,同时还参考已生成的强学习器来更新样本权重,进而提高算法的收敛速度.最后,与其他有代表性的集成学习算法进行实验比较,结果表明,该方法在收敛率、分类准确性以及泛化能力等方面均具有比较明显的优势. 相似文献
8.
9.
在可靠性筛选中检测具有潜在损伤的器件一直是个难题.对GaA lAs红外发光二极管(IRLED)功率老化前后低频噪声的测量发现,1/f噪声幅值与偏置电流的γ次方成正比(小电流区γ=1,在大电流区γ≈2),且老化后1/f噪声幅值比老化前增大2个数量级.基于载流子数涨落和迁移率涨落机制建立了一个GaA lAs IR LED的1/f噪声模型,分析结果表明GaA lAs IR LED的1/f噪声在小电流时反映体陷阱特征,大电流时反映激活区陷阱特征,1/f噪声的增加归因于功率老化诱生的界面陷阱和表面陷阱,1/f噪声可以用来检测GaA lAs IR LED s的潜在缺陷. 相似文献
10.
采用半定量RT-PCR方法,对小鼠给予L-苹果酸后肝线粒体苹果酸天冬氨酸穿梭相关的两种线粒体酶:线粒体天冬氨酸氨基转移酶(mitochondrialaspartateaminotransferase,mAST)及线粒体苹果酸脱氢酶(mitochondrialmalatedehydrogenase,mMDH)及线粒体内膜上的天冬氨酸谷氨酸转运蛋白(AGC)与α-酮戊二酸苹果酸转运蛋白(OMC)的基因表达进行检测,探讨了L-苹果酸对肝线粒体苹果酸天冬氨酸穿梭的关键酶及转运蛋白mRNA表达规律。半定量RT-PCR结果表明:剂量组小鼠肝线粒体转运蛋白AGCmRNA的表达显著高于空白对照组,而mAST、mMDH及转运蛋白OMCmRNA的表达无显著性差异。由此可知,L-苹果酸能促进TCA循环及苹果酸天冬氨酸穿梭,其分子生物学机理与L-苹果酸提高AGC的基因表达水平有关。 相似文献