ATL介绍(三)

允许支持MFC。由于ATL对除COM以外的基本的Windows编程方面的支持极为有限,同时许多程序员对MFC又非常熟悉,因此在ATL的工程设置中允许在ATL工程内部支持使用MFC,即可以使用MFC定义的类。这一特点给开发人员提供了许多方便,特别对于习惯使用MFC的人来说,能够使用MFC提供的各种功能强大的类的支持,而不必直接使用Windows SDK。从另一个方面来看,在ATL工程中使用MFC同时就丧失了ATL代码轻量级的特点。     

一招“导”出“天机”——链接器错误揭密

如果有这样一种情况：制作一种基于ATL的类库，这种类库既可以被基于ATL的控制台应用程序调用，也可以被基于。MFC／ATL的GUI应用程序调用。它不能包含任何MFC链接，GUI应用程序必须使用ATL，而且控制台应用程序不能使用任何MFC或其相关链接库。这一系列工序听起来好象很容易实现，但如果不使用一些     

奥创利闯西南

8月25日获悉,美国奥创利公司中国区分销商——香港ATL公司最近在成都建立了新的办事处。ATL成都办事处的建立对于ATL公司和奥创利产品在西南市场的发展有极大的推动力。之后美国奥创利公司和成都市户线电信有限责任公司、永成电子系统有限公司在成都签署了     

ATL开发COM组件的几个小技巧

COM是构造二进制兼容软件组件的规范．而ATL，正是开发COM组件的得力工具。本文介绍了利用ATL开发COM组件的几个实用的小技巧。     

ATL快速编写COM组件

通过ATL可以方便快速地建立小型的、基于COM的组件.本文简要介绍IDL语言编写COM接口的基本概念,并通过实例展示通过ATL开发COM组件的基本过程.     

VB如何调用VC类型库中线程

利用VC6.0的ATL COM创建ThreadExample工程,选择支持MFC,其他默认即可。然后添加简单的ATL对象,对象名命名为Thread。在CThread中,添加成员变量m_param     

基于Visual C 中ATL技术创建ActiveX控件的探讨

介绍了ActiveX控件和ATL技术,并以一个简单的圆的控件实现为例,介绍了VC 6.0中如何用ATL技术创建ActiveX控件,以及如何在网页中使用该控件。     

分布式计算环境中ActiveX控件的设计方法

文章详细介绍了利用ATL 2．1和Visual C＋＋5．0设计ActiveX控件的方法和步骤.通过ATL开发出的程序代码尺寸小、运行速度快,适合于分布式计算环境.     

简化磁带管理——昆腾推出ATL ValueLoader

上月底,昆腾的ATL ValueLoader DLT VS80正式面市,它是昆腾第一个2U(3.5英寸高)、针对机架进行优化设计的自动磁带加载机,能够充分利用昆腾DLT VS80半高磁带驱动器。昆腾公司已经把ValueLoader产品集成到其ATL L系列自动磁带加载机产品线中,补充提高了ATL SuperLoader自动磁带加载机的性能。 ValueLoader自动磁带加载机针对小型企业、远程     

活动模板库（ATL）创建小型COM对象（三）

当创建接口映射表时,ATL表假定表的第一个入口将是一个简单的映射人口并用它来满足IID_IUnknown的请求。 除了支持IUnkown外,ATL还提供了一定量的COM接口的缺省执行。ATL用一种简单的命名惯例给这些执行过程命名,它们中的大多数作为模板类执行,这些类占用一个模板参数,它就是实际被执行的类。 这种执行的一个简单的例子是接口I0bjectWithSite,它用一个指向它激活位置的指针提供一般对象的支持。ATL支持此接口的一个缺省执行     

Full contract verification for ATL using symbolic execution

The Atlas Transformation Language (ATL) is currently one of the most used model transformation languages and has become a de facto standard in model-driven engineering for implementing model transformations. At the same time, it is understood by the community that enhancing methods for exhaustively verifying such transformations allows for a more widespread adoption of model-driven engineering in industry. A variety of proposals for the verification of ATL transformations have arisen in the past few years. However, the majority of these techniques are either based on non-exhaustive testing or on proof methods that require human assistance and/or are not complete. In this paper, we describe our method for statically verifying the declarative subset of ATL model transformations. This verification is performed by translating the transformation (including features like filters, OCL expressions, and lazy rules) into our model transformation language DSLTrans. As we handle only the declarative portion of ATL, and DSLTrans is Turing-incomplete, this reduction in expressivity allows us to use a symbolic-execution approach to generate representations of all possible input models to the transformation. We then verify pre-/post-condition contracts on these representations, which in turn verifies the transformation itself. The technique we present in this paper is exhaustive for the subset of declarative ATL model transformations. This means that if the prover indicates a contract holds on a transformation, then the contract’s pre-/post-condition pair will be true for any input model for that transformation. We demonstrate and explore the applicability of our technique by studying several relatively large and complex ATL model transformations, including a model transformation developed in collaboration with our industrial partner. As well, we present our ‘slicing’ technique. This technique selects only those rules in the DSLTrans transformation needed for contract proof, thereby reducing proving time.     

Adaptive transfer learning in deep neural networks: Wind power prediction using knowledge transfer from region to region and between different task domains

Transfer learning (TL) in deep neural networks is gaining importance because, in most of the applications, the labeling of data is costly and time consuming. Additionally, TL also provides an effective weight initialization strategy for deep neural networks. This paper introduces the idea of adaptive TL in deep neural networks (ATL‐DNN) for wind power prediction. Specifically, we show in case of wind power prediction that adaptive TL of the deep neural networks system can be adaptively modified as regards training on a different wind farm is concerned. The proposed ATL‐DNN technique is tested for short‐term wind power prediction, where continuously arriving information has to be exploited. Adaptive TL not only helps in providing good weight initialization, but also in utilizing the incoming data for effective learning. Additionally, the proposed ATL‐DNN technique is shown to transfer knowledge between different task domains (wind power to wind speed prediction) and from one region to another region. The simulation results show that the proposed ATL‐DNN technique achieves average values of 0.0637, 0.0986, and 0.0984 for the mean absolute error, root mean squared error, and standard deviation error, respectively.     

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic<Superscript>1</Superscript>

Alternating-time Temporal Logic (ATL) is typically applied for specifying properties of multi-agent systems modelled by game-like structures. This paper deals with verification of ATL by means of a fully symbolic model checking. Unbounded model checking (a SAT-based technique) is applied for the first time to verification of AT. Several examples are given in order to present an application of the technique.The authors acknowledge support from the two Polish grants: W/IMF/2/04 and 3 T11C 011 28.     

基于ATL方法的电子商务协议FONRP分析

研究ATL逻辑及其在电子商务协议形式化分析中的应用,对Kremer提出的方法进行扩展,使之在考虑公平等特性的同时能够分析协议的安全性。用该方法对周明天等人提出的FNORP协议及其变种进行了严格的形式化分析,结果表明基于博弈的ATL逻辑比传统的CTL更适合于描述和分析复杂电子商务协议。     

一种新的密码协议分析方法及其应用

针对传统时序逻辑把协议看成封闭系统进行分析的缺点, 提出一种新的基于策略的ATL逻辑方法分析密码协议。最后用新方法对Needham-Schroeder协议进行了严格的形式化分析,结果验证了该协议存在重放攻击。工作表明基于博弈的ATL逻辑比传统的CTL更适合于描述和分析密码协议。     

Knowledge as Strategic Ability

The ultimate goal of our research is to develop techniques for model checking knowledge properties of multi-agent systems. ATEL, an extension of the Alternating-time Temporal Logic of Alur et al, is a logic for specifying epistemic and strategic properties of such systems. We present a technique for reducing the ATEL model checking problem to one of model checking in ATL, whereby epistemic relations are explicitly encoded in ATL models as as dynamic transitions. The techniques is illustrated by means of a knowledge game, which is used as a running example throughout the paper.     

OLE DB技术及其在VC数据库开发中的应用

介绍了使用VC提供的ATL模板设计OLEDB数据应用程序,分析了OLEDB的基本原理和对象结构,给出了一个在vc 6.0平台下使用OLEDB客户模板开发用户程序的实例.实验结果表明,利用ATL模板可以很容易地将OLEDB与MFC结合起来,使数据库的参数查询等复杂的编程得到简化.     

COM的线程模型

本文介绍了COM的几种线程模型:单线程套间模型(STA Single Thread Apartment),多线程套间模型(MTA Multithread Apartment)和自动线程模型(Auto-thread).首先,介绍了单线程套间模型和多线程套间模型的意义和特点,其中,单线程套间模型是一种缺省的模型,而多线程套间模型可以说是对单线程套间模型的简化;然后,根据分析单线程套间和多线程套间模型的特点,引入了自动线程模型,这种模型可以在多个客户同时访问多个COM对象时,极大地提高访问的性能和效率.本文同时提供了样例代码,以便于理解这些概念.     

基于ATL实现通用报表工具COM控件

介绍基于ATL通用报表工具控件ReportCtrl的设计与实现.概要地讲述了报表工具的研发意义和功能要求以及开发ReportCtrl控件所涉及到的基本技术,包括ActiveX技术、ATL和ADO数据库访问技术等;讲述了控件设计的基本思想、技术难点和关键数据结构;给出了控件的应用方法,并通过应用实例,对控件进行了全面的测试.     

On timed alternating simulation for concurrent timed games

We address the problem of alternating simulation refinement for concurrent timed games (TG). We show that checking timed alternating simulation between TG is EXPTIME-complete, and provide a logical characterization of this preorder in terms of a meaningful fragment of a new logic, TAMTL*. TAMTL* is an action-based timed extension of standard alternating-time temporal logic ATL*, which allows to quantify over strategies where the designated coalition of players is not responsible for blocking time. While for full TAMTL*, model-checking TG is undecidable, we show that for its fragment TAMTL, corresponding to the timed version of ATL, the problem is instead decidable and in EXPTIME.