VxWorks嵌入式图形界面设计

针对嵌入式图形界面开发难度高、工作量大、用户界面可视化效果单调等困境,采用Tilcon图形开发软件与WindML相结合开辟一种嵌入式图形开发的新方法。该方法具有图形设计思路简单、开发周期短且界面效果好等特性。应用结果表明,该方法开发的图形界面可靠性好、实时性强、界面效果丰富,具有广泛的实用性和推广价值。     

基于蓝牙技术的图形互动平台设计与实现

由于资源有限,在嵌入式系统实现图形互动界面具有不小的风险.介绍了一种基于Philips ARM7TDMI LPC2104微控制器的轻量级蓝牙互动图形界面的实现方法.从硬件设计,软件程序开发两方面入手阐述,提出了基于蓝牙技术图形界面系统的实现过程,比较了其他图形设计系统的不同特点.     

基于VxWorks的图形界面开发方法

为了解决嵌入式图形界面开发中的困难、增强图形界面的功能和效果,结合工程实践讲述了双缓冲技术、中文字符显示方法和响应鼠标、键盘事件、多页面设计等嵌入式图形开发方法。应用结果表明,这些技术和方法的使用在丰富嵌入式图形界面功能和效果方面确实起到了很好的作用,有着非常广泛的使用和推广价值。     

基于Java的面向对象交互式图形工具箱

为在开发交互式图形应用过程中有效地建立、表示和管理代表应用数据的直接操作图形对象,设计一个基于Java的面向对象交互式图形工具箱——JOOIGT,该工具箱利用面向对象技术和Java基本类库,提供多种图形对象以及图形界面框架,使设计者只需定义对象,而不必考虑绘图细节,简化操作流程,利用JOOIGT建立的图形界面不仅可以运行于本地窗口程序中,也能运行在Web程序或嵌入式程 序中。     

基于uCLinux系统的图形界面研究与实现

将嵌入式Linux应用至目标设备，并开发出优秀的人机交互界面，是嵌入式开发的关键技术之一。探讨了嵌入式图形界面国内外研究现状，通过比较，提出了在uclinux系统下采用MiniGUI开发图形界面应用软件的一般性实现方案，并重点分析了移植MiniGUI到目标板的关键技术。并最终在农业数据采集设备上实现了图形界面。     

用PASCAL语言实现图形界面设计和控制

在当前颇具竟争性的商业环境中,程序的界面已不仅仅是装饰物,而成为一个软件成功的重要的因素之一。 编写界面的基本原则是实用,也就是说不必说明,从界面上直观地就告诉了用户,这个程序是干什么用的,怎么用。方便用户是程序设计的目标。图形界面或图形和文本的结合应用能较好地解决这一问题。本文介绍了使用PASCAL语言实现图形界面设计和控制的一种方法。 实现图形界面设计需要做两件事:一件事是画出图形界面;另一件事是对这视口进行控制。解决第一件事就是利用色彩的明暗对比,来产生     

嵌入式Linux下Qt/Embedded的应用

随着嵌入式系统的发展，用于实现与用户交流功能的嵌入式GUI成为研究中的一个重点。嵌入式Linux下，如粜图形界面接口采用的是Qt／Embedded，则必须采用Linux的帧缓冲设备来处理相关的底层命令。帧缓冲是Linux为图形设备提供的一个抽象接口．是Qt／Embcdded的底层图形引擎。文中介绍了Linux帧缓冲设备驱动程序框架，基于三星公司的S3C2410x处理器的开发平台，系统给出了嵌入式圆形界面GUI的移植，包括编译环境的建立，编译参数的设置等。     

基于QNX的无人机地面控制台嵌入式系统开发

针对当前各种嵌入式系统开发中存在的图形界面开发较难的现状,介绍了一种新型的具有简便的图形界面开发功能的嵌入式系统--QNX;通过其自带的PhAB开发工具,可以方便地开发出用户所需的良好界面;根据QNX强实时性和高可靠性的特点,结合无人机地面控制台嵌入式系统的开发,论述了QNX下嵌入式系统的开发过程以及图形界面的开发方法.叙述了控制台软件的设计思想,给出了软件图形界面,对用户定制其它的带有图形界面的嵌入式系统具有一定的指导意义;通过实时性测试分析可以看出,系统实时响应时间在1～28ms之间,完全满足实时系统的要求.     

基于税控收款机的图形系统的开发与实现

新一代的税控收款机对图形界面的交互能力有很高的要求．开发满足市场特点的图形开发系统也势在必行,本文在嵌入式系统μClinux的环境下,采用LCD Framebuffer和MiniGUI设计并实现了新一代税控机图形界面的开发．此系统也对其它嵌入式图形系统的开发提供了很好的借鉴作用。     

嵌入式Linux下Qt/Embedded的应用

随着嵌入式系统的发展,用于实现与用户交流功能的嵌入式GUI成为研究中的一个重点。嵌入式Linux下,如果图形界面接口采用的是Qt/Embedded,则必须采用Linux的帧缓冲设备来处理相关的底层命令。帧缓冲是Linux为图形设备提供的一个抽象接口,是Qt/Embedded的底层图形引擎。文中介绍了Linux帧缓冲设备驱动程序框架,基于三星公司的S3C2410x处理器的开发平台,系统给出了嵌入式图形界面GUI的移植,包括编译环境的建立,编译参数的设置等。     

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization and VLSI design. Drawing algorithms for hierarchical graphs have been well investigated. However, the problem of planar straight-line representation has not been solved completely. In this paper we answer the question: does every planar hierarchical graph admit a planar straight-line hierarchical drawing? We present an algorithm that constructs such drawings in linear time. Also, we answer a basic question for clustered graphs, that is, does every planar clustered graph admit a planar straight-line drawing with clusters drawn as convex polygons? We provide a method for such drawings based on our algorithm for hierarchical graphs.     

A graph-based generic type system for object-oriented programs

We present a graph-basedmodel of a generic type system for an OO language. The type system supports the features of recursive types, generics and interfaces, which are commonly found in modern OO languages such as Java. In the classical graph theory, we define type graphs, instantiation graphs and conjunction graphs that naturally illustrate the relations among types, generics and interfaces within complex OO programs. The model employs a combination of nominal and anonymous nodes to represent respectively types that are identified by names and structures, and defines graph-based relations and operations on types including equivalence, subtyping, conjunction and instantiation. Algorithms based on the graph structures are designed for the implementation of the type system. We believe that this type system is important for the development of a graph-based logical foundation of a formal method for verification of and reasoning about OO programs.     

The number of spanning trees in a new lexicographic product of graphs

The problem of counting the number of spanning trees is an old topic in graph theory with important applications to reliable network design. Usually, it is desirable to put forward a formula of the number of spanning trees for various graphs, which is not only interesting in its own right but also in practice. Since some large graphs can be composed of some existing smaller graphs by using the product of graphs, the number of spanning trees of such large graph is also closely related to that of the corresponding smaller ones. In this article, we establish a formula for the number of spanning trees in the lexicographic product of two graphs, in which one graph is an arbitrary graph G and the other is a complete multipartite graph. The results extend some of the previous work, which is closely related to the number of vertices and Lapalacian eigenvalues of smaller graphs only.     

Stability analysis of constrained MPC with CLF applied to discrete-time nonlinear system

The problem of counting the number of spanning trees is an old topic in graph theory with important applications to reliable network design. Usually, it is desirable to put forward a formula of the number of spanning trees for various graphs, which is not only interesting in its own right but also in practice. Since some large graphs can be composed of some existing smaller graphs by using the product of graphs, the number of spanning trees of such large graph is also closely related to that of the corresponding smaller ones. In this article, we establish a formula for the number of spanning trees in the lexicographic product of two graphs, in which one graph is an arbitrary graph G and the other is a complete multipartite graph. The results extend some of the previous work, which is closely related to the number of vertices and Lapalacian eigenvalues of smaller graphs only.     

Generalized median graph computation by means of graph embedding in vector spaces

The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we propose a new approach for the computation of the median graph based on graph embedding. Graphs are embedded into a vector space and the median is computed in the vector domain. We have designed a procedure based on the weighted mean of a pair of graphs to go from the vector domain back to the graph domain in order to obtain a final approximation of the median graph. Experiments on three different databases containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results. These experiments on real data open the door to the application of the median graph to a number of more complex machine learning algorithms where a representative of a set of graphs is needed.     

Statistical inference on attributed random graphs: Fusion of graph features and content

Many problems can be cast as statistical inference on an attributed random graph. Our motivation is change detection in communication graphs. We prove that tests based on a fusion of graph-derived and content-derived metadata can be more powerful than those based on graph or content features alone. For some basic attributed random graph models, we derive fusion tests from the likelihood ratio. We describe the regions in parameter space where the fusion improves power, using both numeric results from selected small examples and analytic results on asymptotically large graphs.     

基于基本块标识方法的控制流图生成器设计

设计一个实用的程序控制流分析工具需要解决非结构程序中goto等语句的控制流图构造问题。C语言程序控制流图生成器CfgGen的设计采用基于基本块标识的控制流图构造方法解决该问题。CfgGen程序基于规则,通过语法制导翻译标识基本块、构造控制流图,易移植和维护。CfgGen构造的控制流图标识了基本块,可以很方便地用于程序分析和优化。     

航班延误预警图形组件包的设计与实现

为了给航班延误预警平台提供图形生成服务,设计并实现航班延误预警图形组件包,用于自动生成航班延误波及DAG、高级Petri网、贝叶斯网络和元胞自动机等数学模型的仿真视图,以及棒图等统计图。图形组件包包括外层服务和核心引擎两部分。外层服务生成图形XML文档,核心引擎解析该文档并渲染生成图形。图形组件包以Web服务暴露接口,以XML作为数据交换媒介,提高了互操作性和通用性。实验表明,该图形组件包可以有效满足航班延误预警平台的图形生成和表现需求。     

Using partial evaluation in holistic subgraph search

Because of its wide application, the subgraph matching problem has been studied extensively during the past decade. However, most existing solutions assume that a data graph is a vertex/edge-labeled graph (i.e., each vertex/edge has a simple label). These solutions build structural indices by considering the vertex labels. However, some real graphs contain rich-content vertices such as user profiles in social networks and HTML pages on the World Wide Web. In this study, we consider the problem of subgraph matching using a more general scenario. We build a structural index that does not depend on any vertex content. Based on the index, we design a holistic subgraph matching algorithm that considers the query graph as a whole and finds one match at a time. In order to further improve efficiency, we propose a “partial evaluation and assembly” framework to find subgraph matches over large graphs. Last but not least, our index has light maintenance overhead. Therefore, our method can work well on dynamic graphs. Extensive experiments on real graphs show that our method outperforms the state-of-the-art algorithms.     

面向不确定图的k最近邻查询

生物网络、社会网络、交际网络等复杂的网络被广泛的研究,由于数据抽出时引入的噪声和错误使这些数据具有不确定性,因此可以对这些应用使用不确定图模型建模,k最近邻查询问题是查询一个图上的距离某个特定点最近的k个邻居节点的问题,它是不确定图上的一个基础问题.设计了一个解决不确定图上最近邻问题的框架,首先定义了一种新颖的不确定图上的k最近邻查询,然后提出了针对该查询的一般处理算法,同时对该算法进行了优化,使算法效率得到极大提高.理论分析和实验结果表明提出的算法能够高效地处理不确定图上的k最近邻查询.