基于组件模型分析的组件容器产品线体系结构

组件容器为组件提供部署和运行环境,是基于组件分布式应用开发的核心.近年来分布式组件的多样化和快速演化对组件容器的开发方法提出了挑战.产品线工程是基于公共的核心资产开发特定领域内软件产品系列的软件工程方法,产品线体系结构是其中最重要的部分.进行组件容器产品线体系结构的研究能够提高组件容器的结构复用性,获得更高的生产效率和质量.由于组件模型是组件容器设计的基础,在领域分析阶段引入组件模型分析,提出了组件模型分析框架,通过组件模型元素到领域需求元素的映射,建立组件容器领域模型.提出了组件容器设计的基本原则,并根据变化性封装原则,提出了组件容器产品线体系结构PLACE,通过引入可选属性、模块层次结构和决策模型,实现组件容器的领域需求.PLACE产品线体系结构已在网驰平台的多个组件容器设计中得到应用.     

基于ARM-Linux的GUI系统体系分析及其应用设计

实现一个表现良好的嵌入式GUI系统要求开发者对操作系统及底层硬件的各个组件及其之间的交互都十分清楚.阐述GUI的核心设计理念,并对基于ARM-Linux的GUI的实现原理和体系结构进行了详尽的分析探讨,最后给出基于MiniGUI的具体应用设计,对研究人员开发嵌入式GUI系统具有指导意义.     

基于产品线工程方法提高组件容器的可复用性(英文)

组件容器为组件提供部署和运行环境,是基于组件的分布式应用开发的核心。近年来,开发网构软件的需求驱动着组件技术持续改进,新型组件不断涌现,这对组件容器的开发效率提出更高的要求。因此,在组件容器开发过程中大规模复用已有的软件资产变得非常重要。在许多情况下,产品线工程已被证实是有效的系统化复用的工程方法。首先探讨将产品线工程应用于组件容器开发所面临的主要困难,并提出相应的解决方案;然后给出了一个组件容器的产品线——PLACE的设计,解释了其两个主要部分:产品线体系结构和产品派生流程;最后,通过一个实际案例,展示利用PLACE设计开发组件容器的完整过程,结果证实体系结构和源代码的复用性都有一定程度的提高。     

Java程序中图形界面案例的分析与研究

Java语言程序设计中可以设计出满足用户需求的图形用户界面,在界面中可以包含组件、容器、布局管理器、事件等内容。本文针对图形界面中的几个案例进行分析和说明,以此让读者能更好地掌握有关图形用户界面的有关编程技巧。     

Web服务体系结构浅析

“Web服务”（Web Services)可谓是当前最炙手可热的IT词汇之一．受到业界的高度关注。Web服务的历史渊源可以追溯到组件体系结构。产生于20世纪80年代的组件技术最初是在图形用户接口（GUI)的上下环境中被开发的——他们今天仍然是多数GUI体系结构的核心．     

基于Drupal 7的HTML5布局模板的二次开发

以目前在国外广泛应用的Drupal 7为应用开发框架,结合HTML5、样式表、动态脚本和第三方插件技术,通过在WAMP平台上对Drupal进行二次开发,设计了一套具有友好界面、易添加与删除容器,并动态加载数据的布局模板.该模板采取分层设计,从根容器到目标内容容器构建页面框架;采用HTML5自适应布局设计方法,针对不同的业务需求完成个性化定制界面UI.同时介绍了利用主流浏览器调试工具对界面代码进行分析与调试.     

Java复合数据类型组件及其MVC模型在GUI定制开发中的应用

针对Java应用程序中GUI的开发,分析MVC架构模式工作原理,阐述Java复合数据类型组件模型-视图-控制器的功能、相互关系及基于MVC模式的设计方法,并进一步详述Swing复合数据类型组件的代理事件与渲染重绘机制.将MVC架构与Swing组件的设计思想融汇在一起,最终揭示了JTable等复合数据类型组件在GUI设计中的灵活应用.     

ROSA:资源敏感的高性能Web容器体系结构

现有的Web容器多采用线程池体系结构,而Web容器所支撑的动态Web组件在执行过程中可能需要获取多种共享资源,由共享资源并发量限制导致的线程阻塞可能会严重影响性能。提出了一种资源敏感的Web容器体系结构ROSA(resource-oriented staged architecture)。当某些共享资源达到饱和时,若Web容器接到对需要这些资源的Web组件的请求,ROSA会暂缓为这些请求提供服务以减少线程阻塞。基于排队Petri网,建立了ROSA结构和线程池结构的性能模型,通过模型仿真和负载实验验证了ROSA体系结构的性能优势。     

基于容器中间件的组件系统体系结构性能评价

对组件系统性能建模时,需要考虑中间件平台的影响.基于体系结构模式,分析了容器风格中间件对组件系统结构和性能的影响,并提出了一种在组件系统UML描述中集成中间件组件及交互关系的方法.从该集成UML模型导出的性能模型,能够有效地反映中间件的影响.这样,在对组件系统性能建模时,无须了解中间件内部细节.这种基于体系结构模式的方法可以方便扩展以处理不同风格的中间件,且易于实现自动化.以EJB容器中间件为例说明并验证了所提出方法的有效性.     

基于Web的中间件系统集成框架--应用服务器的研究

以“八六三”项目为背景,在探讨应用服务器技术、组件和框架技术的基础上,通过结合CORBA开放性、跨平台、跨语言的特性和EJB业务处理能力,设计并实现了一个可伸缩、健壮的、支持Web分布式应用的中间应用服务器系统平台,其功能包括组件容器、管理控制台、事务服务、外部资源管理、名字服务等;并在实际中得到了初步应用,取得了很好的效果.与其它方式的服务相比,它有着易于开发、易于管理和易于加载服务等特点.对其理论背景、体系结构、关键技术以及其上的应用领域框架等进行了全面的研究.     

Model-driven reverse engineering of legacy graphical user interfaces

Businesses are increasingly beginning to modernise those of their legacy systems that were originally developed with Rapid Application Development (RAD) or Fourth Generation Language (4GL) environments, in order to benefit from new platforms and technologies. In these systems, the Graphical User Interface (GUI) layout is implicitly provided by the position of the GUI elements (i.e. coordinates). However, taking advantage of current features of GUI technologies often requires an explicit, high-level layout model. We propose a Model-Driven Engineering process with which to perform the automatic reverse engineering of RAD-built GUIs, which is focused on discovering the implicit layout, and produces a GUI model in which the layout is explicit. As an example of the approach, we apply an automatic reengineering process to this model in order to generate a Java Swing user interface.     

基于Java的GUI设计与实现

介绍了基于Java的 GUI软件开发的工具以及SWT的标准布局类,并给出了一个使用SWT中标准布局类设计GUI的实例.     

GridDroid---An Effective and Efficient Approach for Android Repackaging Detection Based on Runtime Graphical User Interface

Repackaging brings serious threats to Android ecosystem.Software birthmark techniques are typically applied to detect repackaged apps.Birthmarks based on apps'runtime graphical user interfaces(GUI)are effective,especially for obfuscated or encrypted apps.However,existing studies are time-consuming and not suitable for handling apps in large scale.In this paper,we propose an effective yet efficient dynamic GUI birthmark for Android apps.Briefly,we run an app with automatically generated GUI events and dump its layout after each event.We divide each dumped layout into a grid,count in each grid cell the vertices of boundary rectangles corresponding to widgets within the layout,and generate a feature vector to encode the layout.Similar layouts are merged at runtime,and finally we obtain a graph as the birthmark of the app.Given a pair of apps to be compared,we build a weighted bipartite graph from their birthmarks and apply a modified version of the maximum-weight-bipartite-matching algorithm to determine whether they form a repackaging pair(RP)or not.We implement the proposed technique in a prototype,GridDroid,and apply it to detect RPs in three datasets involving 527 apks.GridDroid reports only six false negatives and seven false positives,and it takes GridDroid merely 20 microseconds on average to compare a pair of birthmarks.     

Re-marshaling export containers in port container terminals

In order to speed up the loading operation of export containers onto a ship, the re-marshaling operation is an usual practice in port container terminals. It is assumed that the current yard map for containers is available and a desirable bay layout is provided. A methodology is proposed to convert the current bay layout into the desirable layout by moving the fewest possible number of containers and in the shortest possible travel distance. The problem is decomposed into three sub-problems such as the bay matching, the move planning, and the task sequencing. The bay matching is to match a specific current bay with a bay configuration in the target layout. In the move planning stage, the number of containers to be moved from a specific bay to another is determined. The completion time of the re-marshaling operation is minimized by sequencing the moving tasks in the final stage. A mathematical model is suggested for each sub-problem. A numerical example is provided to illustrate the solution procedure.     

Data layout optimization for multi-valued containers in OpenCL

Scientific data is mostly multi-valued, e.g., coordinates, velocities, moments or feature components, and it comes in large quantities. The data layout of such containers has an enormous impact on the achieved performance, however, layout optimization is very time-consuming and error-prone because container access syntax in standard programming languages is not sufficiently abstract. This means that changing the data layout of a container necessitates syntax changes in all parts of the code where the container is used. Object oriented languages allow to solve this problem by hiding the data layout behind a class interface. However, the additional coding effort is enormous in comparison to a simple structure. A clever coding pattern, previously presented by the author, significantly reduces the code overhead, however, it relies heavily on advanced C++ features, a language that is not supported on most accelerators. This paper develops a concise macro based solution that requires only support for structures and unions and can therefore be utilized in OpenCL, a widely supported programming language for parallel processors. This enables the development of high performance code without an a-priori commitment to a certain layout and includes the possibility to optimize it subsequently. This feature is used to identify the best data layouts for different processing patterns of multi-valued containers on a multi-GPU system.     

Domain Specific High-Level Constraints for User Interface Layout

We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a graphical user interface (GUI). Most GUI frameworks offer layout managers that are basically adjustable tables; often adjacent table cells can be merged. In the ALM, the focus switches from the table cells to vertical and horizontal tabulators between the cells. On the lowest level of abstraction, the model applies linear constraints, and an optimal layout is calculated using linear programming. However, bare linear programming makes layout specification cumbersome and unintuitive, especially for GUI domain experts who are often not used to such mathematical formalisms. In order to improve the usability of the model, ALM offers several other layers of abstraction that make it possible to define common GUI layout more easily. In the domain of user interfaces it is important that specifications are not over-constrained, therefore ALM introduces soft constraints, which are automatically translated to appropriate hard linear constraints and terms in the objective function. GUIs are usually composed of rectangular areas containing controls, therefore ALM offers an abstraction for such areas. Dynamic resizing behavior is very important for GUIs, hence areas have domain-specific parameters specifying their minimum, maximum and preferred sizes. From such definitions, hard and soft constraints are automatically derived. A third level of abstraction allows designers to arrange GUIs in a tabular fashion, using abstractions for columns and rows, which offer additional parameters for ordering and alignment. Row and column definitions are used to automatically generate definitions from lower levels of abstraction, such as hard and soft constraints and areas. Specifications from all levels of abstraction can be consistently combined, offering GUI developers a rich set of tools that is much closer to their needs than pure linear constraints. Incremental computation of solutions makes constraint solving fast enough for near real-time use.     

基于模型的图形用户界面软件测试方法

通过研究GUI(图形用户界面)软件的规格说明、GUI结构、GUI代码,构造用于GUI测试的四种不同层次的GUI表示方法,该表示方法可以描述界面间关系的界面调用关系图、界面信息的对象-事件分析图、界面内事件间关系的事件关系流图以及程序内部逻辑结构的事件程序控制流图,在此基础上提出了基于这些模型的复合性测试用例生成方法,并用实例说明该方法的有效性.     

基于多模态表征的移动应用GUI模糊测试框架

GUI模糊测试在提升移动应用可靠性和兼容性方面发挥着关键作用.然而,现有的GUI模糊测试方法大多效率较低,主要原因是这些工作过于粗粒度,仅基于单一模态的特征来整体理解GUI页面,应用状态的过度抽象使得许多细节信息被忽略,导致对GUI状态及小部件的理解不足.为了解决上述问题,本文提出了一种基于多模态表征的移动应用GUI模糊测试框架GUIFuzzer.该框架通过考虑多模态特征,如视觉特征、布局上下特征以及细粒度的元属性特征,来联合推断GUI小部件的语义,然后训练一个多层次奖励驱动的深度强化学习模型来优化GUI事件选择策略,提高模糊测试的效率.我们在大量的真实应用上对所提框架进行评估.实验结果表明,与现有的竞争性基线相比,GUIFuzzer显著地提升了模糊测试的覆盖率.我们还对特定目标的定制化搜索即敏感API触发进行了案例研究,进一步验证了GUIFuzzer框架的实用性.     

面向Data-Path布图应用的注册式GUI设计

提出了一种基于工作站、UNIX操作系统,采用C++语言、Tcl/Tk语言及Gu库实现图形用户界面(GUI)的新方法。文章重点介绍了所采用的注册机制。与其他的设计方法相比,该GUI的设计具有良好的适用性和可维护性;同时,又有易实现性,省去了设计者了解底层布图算法内容的繁琐过程。测试结果表明该GUI实现了预期的功能。目前,该GUI已应用到在研的Data-Path布图项目之中。