全文获取类型
收费全文 | 303篇 |
免费 | 30篇 |
国内免费 | 15篇 |
专业分类
综合类 | 16篇 |
机械仪表 | 2篇 |
无线电 | 10篇 |
一般工业技术 | 20篇 |
自动化技术 | 300篇 |
出版年
2023年 | 3篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 8篇 |
2012年 | 16篇 |
2011年 | 18篇 |
2010年 | 18篇 |
2009年 | 22篇 |
2008年 | 22篇 |
2007年 | 41篇 |
2006年 | 18篇 |
2005年 | 40篇 |
2004年 | 14篇 |
2003年 | 10篇 |
2002年 | 16篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有348条查询结果,搜索用时 46 毫秒
1.
2.
项重写系统的并行归约可以提高归约的效率,在无共享内存的Transputer网络上实现时要考虑任务的分配,项的拼装,归约任务的控制等问题,其中怎么样减少机间的机内进程的通信慢提高系统效果的关键。本文从控制方式角度讨论在不同拓扑结构的Transputer网络上实现项重写系统的方案,重点介绍基于树形结构下的控制方法,进程安排和通讯形式。 相似文献
3.
Chen Yiyun 《计算机科学技术学报》1993,8(2):66-75
We define here the concept of head boundedness,head normal form and head confluence of term rewriting systems that allow infinite derivation.Head confluence iw weaker than confluence,but sufficient to guarantee the correctness of lazy implementations of equational logic programming languages.Then we prove several results.First,if a left-linear system is locally confluent and head-bounded.then it is head-confluent.Second,head-confluent and head-bounded systems have the heau Church-Rosser property.Last,if an orthogonal system is head-terminating,then it is head-bounded.These results can be applied to generalize equational logic programming languages. 相似文献
4.
Buffer overflow vulnerabilities are one of the most commonly and widely exploited security vulnerabilities in programs. Most existing solutions for avoiding buffer overflows are either inadequate, inefficient or incompatible with existing code. In this paper, we present a novel approach for transparent and efficient runtime protection against buffer overflows. The approach is implemented by two tools: Type Information Extractor and Depositor (TIED) and LibsafePlus. TIED is first used on a binary executable or shared library file to extract type information from the debugging information inserted in the file by the compiler and reinsert it in the file as a data structure available at runtime. LibsafePlus is a shared library that is preloaded when the program is run. LibsafePlus intercepts unsafe C library calls such as strcpy and uses the type information made available by TIED at runtime to determine whether it would be ‘safe’ to carry out the operation. With our simple design we are able to protect most applications with a performance overhead of less than 10%. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
5.
Implicit induction in conditional theories 总被引:1,自引:0,他引:1
We propose a new procedure for proof by induction in conditional theories where case analysis is simulated by term rewriting. This technique reduces considerably the number of variables of a conjecture to be considered for applying induction schemes. Our procedure is presented as a set of inference rules whose correctness has been formally proved. Moreover, when the axioms are ground convergent and the functions are completely defined, it is possible to apply the system for refuting conjectures. The procedure is even refutationally complete for conditional equations with Boolean preconditions over free constructors. The method is entirely implemented in the proverSPIKE. This system has solved interesting problems in a completely automatic way, that is, without interaction with the user and without ad hoc heuristics. It has also proved the challenging Gilbreath card trick, with only two easy lemmas.Preliminary versions of the results have been presented at the 13th International Joint Conference on Artificial Intelligence, Chambéry (France), 1993 (Bouhoula and Rusinowith, 1993). 相似文献
6.
《中国科学:信息科学(英文版)》2012,(1):149-164
It is significant to automatically detect and resolve the incompliance in security policy.Most existing works in this field focus on compliance verification,and few of them provide approaches to automatically correct the incompliant security policies.This paper proposes a novel approach to automatically transform a given security policy into a compliant one.Given security policy Π and delegation policy M declared by logic programs,the approach automatically rewrites Π into a new one ΠM which is compliant with M and is readable by the humans.We prove that the algorithm is sound and complete under noninterference assumption.Formally,we show that the security policy query evaluation algorithm with conflict and unsettlement resolution still works very well on ΠM.The approach is automatic,so it doesn’t require a administrator with excess abilities.In this sense,our proposal can help us to save much manpower resource in security management and improves the security assurance abilities. 相似文献
7.
8.
We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation
of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers,
ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by
matrices. This method allows us to prove termination and relative termination. A modification of the latter, in which strict
steps are only allowed at the top, turns out to be helpful in combination with the dependency pair transformation. By bounding
the dimension and the matrix coefficients, the search problem becomes finite. Our implementation transforms it to a Boolean
satisfiability problem (SAT), to be solved by a state-of-the-art SAT solver. 相似文献
9.
研究了基于自动机理论的XML查询重写问题,尤其针对局部查询重写技术作了深入研究.通过实例对其有效性进行了合理的分析. 相似文献
10.
朱燕 《计算机工程与设计》2009,30(14)
研究了AXML文档安全重写判定问题,即判定给定AXML文档通过触发其包含的服务调用生成的文档集合是否能够全部重写为符合目标模式的文档实例.基于树自动机理论,定义了用于抽象AXML文档的树自动机--ATA机(AXML treeautomata),ATA机等价于给定AXML文档通过触发其包含的服务调用所能生成的文档集合.基于ATA机,提出一个AXML文档安全重写判定算法,表明了该算法的正确性及有效性. 相似文献