Graphical interface for motion editing using procedure visualization

In this paper, we introduce an interface for motion editing that visualizes editing procedures. For intuitive understanding and construction of motion editing procedures, our system represents an editing element that produces modified motion from a given input motion as a graphical node, and enables user to construct a whole motion editing procedure by connecting the nodes with a few mouse interactions. The system provides both the 3D transform manipulator and the time-line slider for intuitive controlling ...     

GP~2N~2S~2系统集成环境与动态图形模拟器的特点与设计

GP~2N~2S~2系统集成环境为用户提供了编辑、编译和运行的共用界面。动态图形模拟器是从属于集成环境,并受之驱动的专用模拟器,它实现了神经网络动态变化过程的模拟。本文讲述了这两个部分的功能特点与设计方法。     

On the discovery of subsumption relations for the alignment of ontologies

For the effective alignment of ontologies, the subsumption mappings between the elements of the source and target ontologies play a crucial role, as much as equivalence mappings do. This paper presents the “Classification-Based Learning of Subsumption Relations” (CSR) method for the alignment of ontologies. Given a pair of two ontologies, the objective of CSR is to learn patterns of features that provide evidence for the subsumption relation among concepts, and thus, decide whether a pair of concepts from these ontologies is related via a subsumption relation. This is achieved by means of a classification task, using state of the art supervised machine learning methods. The paper describes thoroughly the method, provides experimental results over an extended version of benchmarking series of both artificially created and real world cases, and discusses the potential of the method.     

等离子体控制系统用户界面与参数管理

等离子体控制系统是聚变实验中重要的系统之一, 用于对等离子体的各项参数进行实时的反馈控制. 目前自主研发的等离子体控制系统基于组件模型开发, 其核心控制功能通过算法组件执行各种等离子体控制算法来实现, 需要提供图形界面编辑算法的预设参数, 并对参数进行管理, 因此基于PyQt5实现图形界面, 并开发参数配置组件负责参数存储回调, 通过发布订阅通讯机制完成两者的数据传输. 采用可扩展标记语言定义控制算法预设参数信息使得用户界面与控制算法解耦, 通过接口描述语言统一定义参数数据结构, 设计MySQL数据库存储历史参数数据, 并基于发布/订阅通讯机制完成数据通讯.     

The Tinkertoy graphical programming environment

The Tinkertoy graphical interface to Lisp is described, in which programs are `built' rather than written, out of icons and flexible interconnections. It represents a computer/user interface that can easily exceed the interaction speed of the best text-based language editors and command languages. It also provides a consistent framework for interaction across both editing and command execution. Moreover, because programs are represented graphically, structures that do not naturally conform to the text medium can be clearly described, the new kinds of information can be incorporated into programs and program elements     

A high-level Petri net for goal-directed semantics of Horn clauselogic

A new high level Petri net (HLPN) model is introduced as a graphical syntax for Horn clause logic (HCL) programs. We call these nets: Horn clause logic goal directed nets (HCLGNs). It is shown that there is a bijection between the queried definite programs and the class of HCLGNs. In addition, a visualization of SLD resolution is realized through the enabling and firing rules and net markings. The correctness of these rules with respect to SLD resolution is also proven. We model SLD refutations and failing computations. It is shown how HCLGNs can be used to model built in atoms and provide a new AND/OR parallel execution model. Recently, several software packages (graphical editors) have become available for editing and executing HLPNs. The simulation capabilities of the HLPN software offer opportunities to perform automated, interactive code walk throughs and also have potential for providing a framework for visual debugging environments. However, HCLGNs differ from the major classes of HLPNs for which software tools have been developed in primarily two ways: the tokens in the markings can have variables; and the firing of a transition may not only update the marking of the adjacent places, but may instantiate variables in tokens in the markings of places that are non adjacent to the fired transition. Thus, the existing packages can only provide graphical syntax editing and are not appropriate for graphical simulation of HCLGNs. We provide an algebraic characterization of HCLGNs that can serve as a design guideline for implementing HCLGNs     

HAGI, a High-level Application/Graphics Interface

HAGI is an object-oriented graphics system developed on top of the X window system. In addition to providing facilities that structured graphics systems such as GKS usually have, HAGI supports a high- level graphics paradigm with the following features:

• + In addition to graphical objects, the system provides a class of application objects with a higher level of abstraction than graphical objects.
• + Graphics manipulation operations can be issued simplyfrom application objects without explicitly referring to specific graphical objects. Thus graphics manipulation appears to be transparent to application programmers.
• + Graphical objects are designed to encompass more semantics, thus are at a level close to the application. For example, they useflexible visual objects to determine their visual appearance.

HAGI provides such a high-level application/graphics interface by maintaining a dependency relationship between graphical objects and application objects.     

A flexible and easy to use molecular biology workbench efficiently developed in Tcl/Tk

We describe the design and implementation of a workbench for molecular biology that allows the easy integration of analysis tools. The software is implemented in Tcl/Tk using the [incr Tcl] extension that provides object‐oriented programming. The program is called tkGDE and consists of four main parts. The sequence editor allows the user to perform basic editing operations on biomolecule sequences. The graphical annotation editor gives the user a graphical overview of all annotated features of a sequence. The output manager retains information on the results produced by the analysis tools. The bundle control allows several tools to run automatically, passing data from one tool to the next. Tools are integrated into the system by describing their properties in a configuration file, which drastically reduces the time needed for integration. We present results proving that Tcl/Tk has been misjudged to be slow and unsuited for large projects. To achieve sufficient performance we exploited special features of Tcl/Tk, namely idle tasks and the capabilities built into the Tk canvas widget. The system consists of more than 34000 lines of [incr Tcl] code in 182 classes. The whole development process took about one person‐year. Copyright © 2000 John Wiley & Sons, Ltd.     

NSEDIT: A syntax-directed editor and testing tool based on Nassi—Shneiderman charts

This paper describes a programming environment for Pascal, called NSEDIT, which runs under VAX/VMS

1 VAX/VMS is a trademark of the Digital Equipment Corporation.

. NSEDIT is based upon the notion of Nassi-Shneiderman charts (abbreviated to N-S charts in this paper) and is designed for ease of use by novice programmers in a teaching situation. A key component of the system is the editor, which enables structural features of Pascal to be manipulated in terms of their N-S chart box representations. Simultaneous editing of more than one program or module is permitted. Another key feature of the system is a semiautomatic interface to the VAX/VMS Pascal compiler, with subsequent display of execution counts as part of the N-S charts. In this way users can obtain immediate feedback on the coverage of program elements by test runs, while still inside an editing session.     

面向对象科学计算工作空间管理框架

大型科学计算领域需要良好的应用开发和管理环境,以提高应用组件可复性为目标,规范应用软件开发过程和计算工作流程。     

A toolset in Java2 for modelling, prototyping and implementing communicating real-time state machines

This paper proposes an approach to the development of real-time systems which depends on Communicating Real-Time State Machines (CRSMs) as the specification language, and on a customisable actor kernel for prototyping, analysis and implementation of a modelled system. CRSMs offer an intuitive and distributed specification of a system in terms of a collection of co-operating state machines interacting with one another through timed CSP-like I/O commands. On the other hand, the underlying actor framework provides a time-sensitive scheduling structure which can be tuned to CSRMs in order to support temporal validation through assertions on the recorded time-stamped event histories. The approach can be practically used through a graphical environment (jCRSM) which has been realised using Java2. The toolset facilitates editing, testing and implementation in Java of CRSM systems. The proposed methodology is novel in that it provides a seamless system development life cycle where the specification, analysis, design and implementation phases are unified by a common representation of machines in terms of actors. The paper demonstrates the use of CRSM based software components by means of examples.     

Interactive visual modeling for performance

An overview is given of Q+, an interactive tool for performance modeling that uses graphical input and visual output. Two major enhancements are a subnetwork capability for structuring models hierarchically and an integrated expression capability. New capabilities are custom icons and temporal browsing. With a Q+ icon palette, users can draw their own icons and manipulate existing ones. The browser allows browsing, editing and updating Q+ information, which can be textual or graphical. Automatic model building, operations management, and experimental design with Q+ are discussed     

A new computer graphics approach to parameter space design of control systems

This paper presents a new approach to parameter space design of linear multivariable control systems. The complete solution of a pole region assignment problem for single-input systems is obtained as an admissible region in then-dimensional parameter space of state feedback gains. We develop a new modeling technique for these admissible parameter space regions which is superior to previous ones because it permits unambiguous and efficient graphical display of slices in 2D and 3D subspaces. In an interactive computer graphics implementation, this method provides an environment where the influence of stability, performance, robustness, integrity, and control constraints on design parameters can be directly visualized and complex tradeoffs are resolved in an interactive way. By judicious combination of overlays, color, and/ or animation, admissible ranges of up to five or six design parameters can be displayed simultaneously. A sequential decomposition technique which selects slices for full parameter space design of lower dimensional subsystems such that the remaining eigenvalues are invariant is used for systems of arbitrarily high order. Parameter space design of unity rank feedback for multiinput systems is done in exactly the same fashion, while systematic sequential design of full rank feedback is achieved as the sum of dyadic stages to which the single-input modeling techniques apply. Examples are given for all presented methods to show the flexibility and potential as a computer-aided control system design framework with a novel integration of computer graphics technology.     

The anatomy of vampire

We present an implementation technique for a class of bottom-up logic procedures. The technique is based oncode trees. It is intended to speed up most important and costly operations, such as subsumption and resolution. As an example, we consider the forward subsumption problem which is the bottleneck of many systems implementing first-order logic.To efficiently implement subsumption, we specialize subsumption algorithms at run time, using theabstract subsumption machine. The abstract subsumption machine makes subsumption-check using sequences of instructions that are similar to the WAM instructions. It gives an efficient implementation of the clause at a time subsumption problem. To implement subsumption on the set at a time basis, we combine sequences of instructions incode trees.We show that this technique yields a new way of indexing clauses. Some experimental results are given.The code trees technique may be used in various procedures, including binary resolution, hyper-resolution, UR-resolution, the inverse method, paramodulation and rewriting, OLDT-resolution, SLD-AL-resolution, bottom-up evaluation of logic programs, and disjunctive logic programs.Supported by Swedish TFR grant No. 93–409     

PICASSO: A graphical query language

PICASSO (PICture Aided Sophisticated Sketch Of database queries) is a graphics-based database query language designed for use with a universal relation database system. The primary objective of PICASSO is ease of use. Graphics are used to provide a simple method of expressing queries and to provide visual feedback to the user about the system's interpretation of the query. Inexperienced users can use the graphical feedback to aid them in formulating queries whereas experienced users can ignore the feedback. Inexperienced users can pose queries without knowing the details of underlying database schema and without learning the formal syntax of SQL-like query language. This paper presents the syntax of PICASSO queries and compares PICASSO queries with similar queries in standard relational query languages. Comparisons are also made with System/U, a non-graphical universal relation system on which PICASSO is based. The hypergraph semantics of the universal relation are used as the foundation for PICASSO and their integration with a graphical workstation enhances the usability of database systems.     

On Graph Features of Semantic Web Schemas

In this paper, we measure and analyze the graph features of semantic Web (SW) schemas with focus on power-law degree distributions. Our main finding is that the majority of SW schemas with a significant number of properties (respectively, classes) approximate a power law for total-degree (respectively, the number of subsumed classes) distribution. Moreover, our analysis revealed some emerging conceptual modeling practices of SW schema developers: (1) each schema has a few focal classes that have been analyzed in detail (that is, they have numerous properties and subclasses), which are further connected with focal classes defined in other schemas, (2) class subsumption hierarchies are mostly unbalanced (that is, some branches are deep and heavy, while others are shallow and light), (3) most properties have as domain/range classes that are located high at the class subsumption hierarchies, and (4) the number of recursive/multiple properties is significant. The knowledge of these features is essential for guiding synthetic SW schema generation, which is an important step toward benchmarking SW repositories and query language implementations.     

基本图的图表示与项表示的相互转换算法

基本图是一种描述并发交互系统的形式化方法,它具有描述简洁、清晰和直观的特点.在基本图中,进程以及进程间的交互行为,既可以用图表示方法(其中一个图对应一个进程,图之间的归约对应进程之间的交互行为),又可以用项代数来表示.本文对基本图的图表示中进行了一些改动,并在此基础上给出了这两种表示方法之间的转换算法,同时实现了具有创建、编辑和转换功能的基本图规范描述工具.     

Visual programming support for graph‐oriented parallel/distributed processing

GOP is a graph‐oriented programming model which aims at providing high‐level abstractions for configuring and programming cooperative parallel processes. With GOP, the programmer can configure the logical structure of a parallel/distributed program by constructing a logical graph to represent the communication and synchronization between the local programs in a distributed processing environment. This paper describes a visual programming environment, called VisualGOP, for the design, coding, and execution of GOP programs. VisualGOP applies visual techniques to provide the programmer with automated and intelligent assistance throughout the program design and construction process. It provides a graphical interface with support for interactive graph drawing and editing, visual programming functions and automation facilities for program mapping and execution. VisualGOP is a generic programming environment independent of programming languages and platforms. GOP programs constructed under VisualGOP can run in heterogeneous parallel/distributed systems. Copyright © 2005 John Wiley & Sons, Ltd.