全文获取类型
收费全文 | 227篇 |
免费 | 32篇 |
国内免费 | 50篇 |
专业分类
电工技术 | 3篇 |
综合类 | 13篇 |
机械仪表 | 1篇 |
石油天然气 | 1篇 |
无线电 | 26篇 |
一般工业技术 | 1篇 |
自动化技术 | 264篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 8篇 |
2021年 | 9篇 |
2020年 | 5篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2015年 | 12篇 |
2014年 | 10篇 |
2013年 | 8篇 |
2012年 | 13篇 |
2011年 | 10篇 |
2010年 | 20篇 |
2009年 | 18篇 |
2008年 | 15篇 |
2007年 | 16篇 |
2006年 | 14篇 |
2005年 | 47篇 |
2004年 | 13篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2001年 | 8篇 |
2000年 | 12篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有309条查询结果,搜索用时 15 毫秒
1.
Hongda Wang Jianchun Xing Qiliang Yang Wei Song Xuewei Zhang 《Software Testing, Verification and Reliability》2016,26(2):149-169
Web Service Business Process Execution Language (WS‐BPEL) is one of the most popular service‐oriented workflow applications. The unique features (e.g. dead path elimination semantics and correlation mechanism) of WS‐BPEL applications have raised enormous problems to its test case generation, especially in unit testing. Existing studies mainly assume that each path in the control flow graphs that correspond to WS‐BPEL applications is feasible, which always yields imprecise test cases or complicates testing results. The current study tackles this problem based on satisfiability modulo theory solvers. First, a new coverage criterion is proposed to measure the quality of test sets for testing WS‐BPEL applications. Second, decomposition algorithms are presented to obtain test paths that meet the proposed coverage criterion. Finally, this paper symbolically encodes each test path with several constraints by capturing the unique features of WS‐BPEL. These constraints are solved and the test cases (test paths and test data) are obtained with the help of satisfiability modulo theory solvers to test WS‐BPEL applications effectively. Experiments are conducted using our approach and other typical approaches (e.g. message‐sequence generation‐based approach and concurrent path analysis approach) with 10 WS‐BPEL applications. Experimental results demonstrate that the test cases generated by our approach can avoid instantiating idle instance and expose more faults. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
2.
工作流将业务过程分解为有序的步骤并分配人力资源加以执行.资源分配受访问控制约束及资源异常干扰,存在可满足性和鲁棒性问题.而其鲁棒性验证又依赖于其可满足性判定,目前通过求可满足性的一个解来完成.本文提出另一种途径,通过统计解的个数来完成判定.特别地,通过多项式计数归约为有求解器可用的#SAT问题,给出了互斥和绑定约束下的可满足性计数算法.实验表明,相对目前时间复杂度最低的可满足性求解算法,该可满足性计数算法显著提高了实际判定效率和适用规模. 相似文献
3.
Eliezer L. Lozinskii 《人工智能实验与理论杂志》2013,25(3):243-266
This study is motivated by the question whether there exists a characteristic feature common to the phenomenon of phase transition of properties taking place in the course of evolution of various sets of objects of different nature. A novel measure model of phase transition is presented, providing an insight into the process underlying different phase transitions. First, it is shown to conform to several famous and extensively investigated cases of phase transition. Then a few close consequences of applying the measure model are presented. It has been proved that monotone properties undergo a sharp phase transition. The measure model provides a sufficient condition of a sharp phase transition common to monotone and non-monotone properties as well. The measure model reveals that if a property Q undergoes a phase transition in the course of evolution of objects of a certain type, then there exist other secondary properties related to the measure of Q that also undergo a phase transition during the evolution. 相似文献
4.
最强后件的计算是模型检测算法的核心.本文使用一阶逻辑可满足性模线性算术理论给出线性混成自动机的有界模型检测表示公式,利用一阶逻辑公式不可满足情况下的插值存在性定理,对线性混成自动机的有界模型检测公式进行指定的划分,使用支持线性算术插值计算的可满足性模理论后端证明引擎的线性时间复杂度的消解反证技术获得这两部分公式间的插值公式,按一阶逻辑Craig插值的性质,所得到的插值公式就是模型检测过程中最强后件公式的上近似表示.有效地避免了使用逻辑编码方案实现线性混成自动机模型检测过程中需要双指数时间复杂度的量词消去操作求取最强后件公式,也不需像有界模型检测按步长展开变迁公式进行可满足性判定.最后本文在此最强后件计算的基础上,以有界模型检测技术作为反例确认方法,实现了一种无假反例的混成系统近似可达集计算算法.实验证明该算法与目前已经得到广泛工业应用的有界模型检测算法相比具有更优的性能. 相似文献
5.
Based on our recent study on probability distributions for evolution in extremal optimization (EO),we propose a modified framework called EOSAT to approximate ground states of the hard maximum satisfia... 相似文献
6.
Mao Luo Chumin Li Xinyun Wu Shuolin Li Zhipeng Lv 《International Journal of Software and Informatics》2022,12(1):131-151
The two most effective branching strategies LRB and VSIDS perform differently on different types of instances. Generally, LRB is more effective on crafted instances, while VSIDS is more effective on application ones. However, distinguishing the types of instances is difficult. To overcome this drawback, we propose a branching strategy selection approach based on the vivification ratio. This approach uses the LRB branching strategy more to solve the instances with a very low vivification ratio. We tested the instances from the main track of SAT competitions in recent years. The results show that the proposed approach is robust and it significantly increases the number of solved instances. It is worth mentioning that, with the help of our approach, the solver Maple_CM can solve additional 16 instances for the benchmark from the 2020 SAT competition. 相似文献
7.
8.
在实际应用中通常需要求解对应CNF(ConjunctiveNormalForm)公式之间仅相差几个子句的一系列SAT(SatisfiabilityProblem)问题,但目前绝大多数SAT求解算法都是针对单一SAT问题设计的。为此,基于DPLL提出了nDPLL算法,并在随机问题上对该算法的效率进行测试。实验结果表明,nDPLL算法能一次性求解多个SAT问题,对于特定范围的CNF公式集具有较高的效率,CNF公式集的规模越大、相近因子越高、子句数和变量数的比值越大,则nDPLL算法的效率越高。 相似文献
9.
基于"逐步展开"模式的Tableau算法在各类非循环定义的描述逻辑概念的可满足性判断中会产生大量的重复性的中间概念描述,因而浪费大量的空间.为此,提出了-个全新的对非循环定义的ALCN-概念可满足性进行判断的完全析取范式(CDNF)算法.CDNF算法直接在输入概念描述上,以角色为纽带构建不同层次的析取范式,从而将输入概念描述重组成一种层次结构的可满足性直接可知的完全析取范式,从而实现了真正意义上的"计算"可满足性.CDNF算法采用"一步到位"的展开方式并且直接在输入概念描述上进行处理,因而可最大程度地消除概念描述的重复.因此,CDNF算法比Tableau算法能节省线性甚至指数倍于输入概念描述长度的空间代价. 相似文献
10.