DESIGNING AND BUILDING A NEGOTIATING AUTOMATED AGENT

Negotiations are very important in a multiagenl environment, particularly, in an environment where there are conflicts between the agents, and cooperation would be beneficial. We have developed a general structure for a Negotiating Automated Agent that consists of five modules: a Prime Minister, a Ministry of Defense, a Foreign Office, a Headquarters and Intelligence. These modules are implemented using a dynamic set of local agents belonging to the different modules. We used this structure to develop a Diplomacy player. Diplomat. Playing Diplomacy involves a certain amount of technical skills as in other board games, but the capacity to negotiate, explain, convince, promise, keep promises or break them, is an essential ingredient in good play. Diplomat was evaluated and consistently played better than human players.     

基于FPGA的短波发射机自动调谐系统

提出了一种基于FPGA的短波发射机自动调谐系统逻辑设计。对发射机调谐原理、选择系统总体方案行了阐述。并对FPGA与单片机通信、测定工作频率、电机控制模块，进行了仿真验证。     

Sources of social support and burnout, job satisfaction, and productivity.

Social support has been identified as an important correlate of a variety of work outcomes. Support from different sources, including family, coworkers, and supervisors, was examined in 211 traffic enforcement agents (92 men, 119 women). Outcomes included subjective variables (burnout and job satisfaction) and an objective measure of productivity (number of summonses). Support was negatively associated with burnout and positively associated with satisfaction and productivity. A cluster of support variables accounted for 7% of the variance in burnout and productivity and 12% of the variance in job satisfaction. Family support was more closely associated with burnout than with satisfaction or productivity, whereas immediate supervisor support was related to satisfaction and productivity but not burnout. Results suggest that support may be associated with work-related outcomes through multiple pathways. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A case study in automated theorem proving: Finding sages in combinatory logic

We present in this article an application of automated theorem proving to a study of a theorem in combinatory logic. The theorem states: the strong fixed point property is satisfied in a system that contains the B and W combinators. The theorem can be stated in terms of Smullyan's forests of birds: a sage exists in a forest that contains a bluebird and a warbler. Proofs of the theorem construct sages from B and W. Prior to the study, one sage, discovered by Statman, was known to exist. During the study, with much assistance from two automated theorem-proving programs, four new sages were discovered. The study was conducted from a syntactic point of view because the authors know very little about combinatory logic. The uses of the automated theorem-proving programs are described in detail.This work was supported by the Applied Mathematical Sciences subprogram of the office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.     

面向资源Petri网的自动制造系统死锁预防

在自动制造系统(automated manufacturing systems, AMSs)中,死锁是一个急需解决的问题,其主要由资源的循环等待造成.为了解决该问题,本文首先基于面向资源Petri网(resource-oriented Petri nets, ROPNs)的特征,建立特殊资源标记图(special resource marked graphs, SRMGs).其次,在SRMGs中建立死锁与饱和回路之间的关系.最后通过为一些特殊回路添加控制器,阻止系统出现不安全标记.考虑到资源故障问题,为危险库所添加资源缓冲子网,保证需要故障资源的零件不会阻塞其他零件的持续生产.相比现有的控制器,本文的监督控制器具有控制开关,其通过实时改变控制库所的容量可以允许更多安全标记发生.     

自动导引车与机器集成调度问题研究现状

随着自动导引车（automated guided vehicles,AGV）的广泛应用,柔性制造车间中机器设备与AGV之间的协同配合日益受到重视。AGV与机器的集成调度主要研究机器分配、工序排序、搬运任务的AGV分配以及AGV路径规划。该问题是极为复杂的组合优化问题,对其研究具有重要的学术意义和应用价值。围绕问题特征,从模型与算法两个方面,对国内外最新的研究文献进行了梳理。对现有模型中的约束条件和优化目标进行了详细分类,从遗传算法、混合优化算法、仿真优化算法等五个方面综述了现有算法研究中的代表性成果。在此基础上,指出了现有研究中的不足,提出了未来的研究内容和方向。     

Iterative Android automated testing

With the benefits of reducing time and workforce, automated testing has been widely used for the quality assurance of mobile applications (APPs). Compared with automated testing, manual testing can achieve higher coverage in complex interactive Activities. And the effectiveness of manual testing is highly dependent on the user operation process (UOP) of experienced testers. Based on the UOP, we propose an iterative Android automated testing (IAAT) method that automatically records, extracts, and integrates UOPs to guide the test logic of the tool across the complex Activity iteratively. The feedback test results can train the UOPs to achieve higher coverage in each iteration. We extracted 50 UOPs and conducted experiments on 10 popular mobile APPs to demonstrate IAAT’s effectiveness compared with Monkey and the initial automated tests. The experimental results show a noticeable improvement in the IAAT compared with the test logic without human knowledge. Under the 60 minutes test time, the average code coverage is improved by 13.98% to 37.83%, higher than the 27.48% of Monkey under the same conditions.     

面向RISC-V向量算法库的自动化测试方法

RISC-V因其精简、开源、可定制的特点受到学术界和工业界的广泛关注,围绕RISC-V的软件生态也在逐步完善。2021年9月,RISC-V委员会发布了1.0版本的向量指令集规范（RVV）,为面向RISC-V的数据级并行优化提供了标准,且部分算法库（如OpenCV）已有面向RVV的移植工作。算法库的开发移植是基于明确的函数原型和语义规范,通常将具有基础（标量）版本的代码实现作为参考,开发的向量版本算法需要符合规范以保证算法库的兼容性。本文提出了一种面向RVV算法库的自动化测试方法,通过对算法函数原型进行解析生成符合规范的测试数据,将向量算法库的测试结果与参考实现对比分析给出测试结论,从而实现算法库的自动化测试。与传统的自动化测试框架相比,本方法无需手动编写测试用例,也无需提供待测目标的设计规范。实验表明,本方法可快速、有效地对RVV算法库进行测试。     

基于悉尼协调自适应交通控制系统线圈数据的交通事件自动检测算法

为了克服目前悉尼自适应交通控制系统(Sydney coordinated traffic system,SCATS)获取的动态交通数据仅用于交通信号控制的局限性,从信息共享的角度,将SCATS中感应线圈获取的动态交通数据应用于交通事件自动检测。在详细分析了SCATS中感应线圈获取的交通数据特性的基础上,设计了一种新的交通事件自动检测算法,并采用实测数据进行了验证和对比分析。结果表明,所设计的新算法在检测率、误警率方面均优于经典的对比算法,可为改善SCATS覆盖道路在交通信号控制、交通信息引导和交通指挥等方面的协调性提供技术支持。     

Efficient Simulation of Formal Processor Models

Computer systems under development are routinely modeled by simulators, and formal verification can be integrated into conventional computer system development by reasoning directly about such simulators. Simulators must be extremely fast to be usable in a real development effort. We have crafted a model for a simple processor in the logic of the ACL2 theorem prover that supports both formal analysis and efficient execution, with performance near that of a simulator written in C. We demonstrate our approach using this simple model and indicate how we applied it to our latest microprocessor.