Visual exploration of production data using small multiples design with non-uniform color mapping

Visual data mining may overcome some of the flexibility problem often suffered by computer-centered data mining approaches. This can happen because human beings are introduced to the information discovery loop to take advantage of their natural strength in creative thinking and rapid visual pattern recognition to discover information not defined a priori and to perform approximated reasoning that computer algorithms are hard to do. This paper presents a novel visual exploration approach for mining abstract, multi-dimensional data stored in tables in a relational database. The visual image is constructed by converting each table into a visualization unit called a table graph and then assembling these table graphs together to form a small multiples design. Different types of non-uniform color mappings to render this small multiples design could be automatically generated by minimizing the weight differences of colors in the visual image. These non-uniform color mappings are designed in such a way that the adjacent glyphs in a table graph that have near underlying values will be assigned with the same color. As such, visual patterns not able to see under the traditional uniform color mapping could be revealed. This enables the users to examine the input tables from different perspectives. The proposed flexible visualization method has been applied to generate visual images from which the users could quickly and easily compare the machine idle cost performances of alternative master production plans.     

Composition and synthesis with a formal interactor model

This paper discusses the formal specification of interactors, which are primitive abstractions of user interface software, and focuses on the formal aspects of their composition. The composition of interactors is discussed formally in the framework of the Abstraction-Display-Controller (ADC) interactor model. The ADC model has been defined as a LOTOS specification template tailored for specifying user interface software. LOTOS behaviour expressions combining instances of this template specify the composition of interactors to model complex user interfaces. Synthesis is defined as a transformation of these behaviour expressions which supports the generic structure of the ADC model while preserving the meaning of the specified behaviour. Further, the notion of abstract views of interactors is introduced. It is shown how abstract views are themselves primitives for specifying complex interface architectures.     

Characterizing History Independent Data Structures

We consider history independent data structures as proposed for study by Naor and Teague. In a history independent data structure, nothing can be learned from the memory representation of the data structure except for what is available from the abstract data structure. We show that for the most part, strong history independent data structures have canonical representations. We provide a natural alternative definition of strong history independence that is less restrictive than Naor and Teague and characterize how it restricts allowable representations. We also give a general formula for creating dynamically resizing history independent data structures and give a related impossibility result.     

A practical approach to data modelling in spatial applications

The storage and manipulation of spatial data requires a different style of support from that normally found in commercial database systems. This paper explores the use of the functional data model and the high level language Daplex to provide an integrated tool for the conceptual modelling of spatial data and the manipulation of data values. Importance is attached to allowing dynamic schema definition and to the provision of abstract data types to support spatial objects. The implementation comprises three separate modules and uses an underlying relational DBMS to store all metadata and data values. This modular design has enabled the user interface, Daplex language and storage aspects of the software to be developed independently, creating a system which has already proved to be easily portable. Consideration has also been given to ways of improving system performance.     

Automating the Selection of Implementation Structures

An approach to automating the selection of implementations for the data representations used in a program is presented. Formalisms are developed for specifying data representations and implementation structures. Using these formalisms, algorithms are presented which will recognize the use in a program of known data representations (e. g., stacks, queues, lists, arrays, etc.) so that alternative implementations can be retrieved from a library and which will, for those representations not recognized, generate alternative implementations with a wide range of space-time tradeoffs. Experience with using these algorithms indicates they are reasonably successful, although there are several problems that must be solved before automatic implementation selection systems will be practical.     

Data access in distributed data base management systems

A software organization which provides for data definition and manipulation in a distributed data base system is presented by describing the functions and interrelations of the component processes; with its methodology for access, the physical location of the data is transparent to the user program. The concepts of distributed data bases are discussed and current research is summarized as a means of establishing a method for the data placement and location mechanism. Procedures for the movement of data in a distributed data base system are presented, along with the data manipulation procedures, in terms of their performance and integrity effects. Enhancements to the mechanisms are suggested.     

The query language Vizla

We define the query language Vizla, in which answers to queries are built up by pointing to representations of sets and functions in a conceptual model of the data base of an application, and to iconic identifiers of computational operators or control constructs. At its present stage of development the primary use of Vizla is in the validation of conceptual models of information systems, but it is to be developed into a user interface to SF, a prototyping language for information and control systems. Moreover, it can be regarded as a visual programming language in its own right. As such it is based on abstract data types     

Run-time diagnostics in pascal

A compiler maps abstract data and control structures into equivalent representations at the order code level of a computer. When a program written in a high level language fails, there is presented the problem of interpreting the state of the abstract (high level) machine in terms of the state of the physical machine which is all that is available. This interpretation is undertaken by a program usually known as a run-time diagnostics package. In this paper a novel package is described which provides diagnostics for dynamically created data structures in addition to the usual facilities. It has been implemented for the language Pascal and has been used successfully for 18 months.     

一个面向对象的交互式图形工具箱OOIGT

在开发交互式图形应用过程中，一个主要难题是如何表示和建立代表应用模型数据及操作的图形对象并提供直接操作的交互方式，另一个难题是如何有效地表示和管理图形对象之间的关系。ＯＯＩＧＴ是作者设计和实现的一个交互式图形建造工具箱，其目的是为解决上述个有效的解，ＯＯＩＧＴ提供了一相可扩充，用于表示应用模型并集成了事件模型的图形对象集，使应用不人需定义对象，而毋须了解如何作图，且容易处理在这些对象上的交互式直     

基于文本引导的注意力图像转发预测排序网络

转发预测在社交媒体网站(Social media sites, SMS)中是一个很有挑战性的问题. 本文研究了SMS中的图像转发预测问题, 预测用户再次转发图像推特的图像共享行为. 与现有的研究不同, 本文首先提出异构图像转发建模网络(Image retweet modeling, IRM), 所利用的是用户之前转发图像推特中的相关内容、之后在SMS中的联系和被转发者的偏好三方面的内容. 在此基础上, 提出文本引导的多模态神经网络, 构建新型多方面注意力排序网络学习框架, 从而学习预测任务中的联合图像推特表征和用户偏好表征. 在Twitter的大规模数据集上进行的大量实验表明, 我们的方法较之现有的解决方案而言取得了更好的效果.     

面向对象软件规格语言的设计

本文提出一种面向对象软件的形式描述语言JOOSL，用它可描述面向对象软件需求规格、概要设计和详细设计。从描述方法角度看，需求规格和概要设计的描述在很大程度上相同，这就反映了OO开发模型中需求和设计之间的重叠。在这些描述中用抽象方法描述数据和操作；详细设计中确定算法细节和数据的表示。JOOSL 认为对象是一种抽象的状态机，继承是行为特性的共享。     

A hierarchical approach for the redesign of chemical processes

An approach to improve the management of complexity during the redesign of technical processes is proposed. The approach consists of two abstract steps. In the first step, model-based reasoning is used to generate automatically alternative representations of an existing process at several levels of abstraction. In the second step, process alternatives are generated through the application of case-based reasoning. The key point of our framework is the modeling approach, which is an extension of the Multimodeling and Multilevel Flow Modeling methodologies. These, together with a systematic design methodology, are used to represent a process hierarchically, thus improving the identification of analogous equipment/sections from different processes. The hierarchical representation results in sets of equipment/sections organized according to their functions and intentions. A case-based reasoning system then retrieves from a library of cases similar equipment/sections to the one selected by the user. The final output is a set of equipment/sections ordered according to their similarity. Human intervention is necessary to adapt the most promising case within the original process.     

Strongly Typed Rewriting For Coupled Software Transformation

Coupled transformations occur in software evolution when multiple artifacts must be modified in such a way that they remain consistent with each other. An important example involves the coupled transformation of a data type, its instances, and the programs that consume or produce it. Previously, we have provided a formal treatment of transformation of the first two: data types and instances. The treatment involved the construction of type-safe, type-changing strategic rewrite systems. In this paper, we extend our treatment to the transformation of corresponding data processing programs.The key insight underlying the extension is that both data migration functions and data processors can be represented type-safely by a generalized abstract data type (GADT). These representations are then subjected to program calculation rules, harnessed in type-safe, type-preserving strategic rewrite systems. For ease of calculation, we use point-free representations and corresponding calculation rules.Thus, coupled transformations are carried out in two steps. First, a type-changing rewrite system is applied to a source type to obtain a target type together with (representations of) migration functions between source and target. Then, a type-preserving rewrite system is applied to the composition of a migration function and a data processor on the source (or target) type to obtain a data processor on the target (or source) type. All rewrites are type-safe.     

Creation of views for reuse of software with different datarepresentations

Software reuse is inhibited by the many different ways in which equivalent data can be represented. We describe methods by which views can be constructed semi-automatically to describe how application data types correspond to the abstract types that are used in numerical generic algorithms. Given such views, specialized versions of the generic algorithms that operate directly on the application data can be produced by compilation. This enables reuse of the generic algorithms for an application with minimal effort. Graphical user interfaces allow views to be specified easily and rapidly. Algorithms are presented for deriving, by symbolic algebra, equations that relate the variables used in the application data to the variables needed for the generic algorithms. Arbitrary application data structures are allowed. Units of measurement are converted as needed. These techniques allow reuse of a single version of a generic algorithm for a variety of possible data representations and programming languages. These techniques can also be applied in data conversion and in object-oriented, functional, and transformational programming     

Verifying abstract data types with SNOBOL4

The presentation of an abstract data type by a series of equational axioms has become an accepted specification mechanism. Verifying the correctness of such specifications has been recognized as a problem troubling their use. A means is presented for experimenting with a directly executable version of the axioms without having to choose representations for the data structures or describe algorithms for the operations.     

Mutual engagement and collocation with shared representations

In this paper we explore the use of shared representations to support creative activities, focussing on collaborative music making. We examine the effect that user interface features of shared representations have on mutual engagement and show that providing shared awareness mechanisms increases mutual engagement. In particular, we show through an empirical study of 78 participants that providing cues to identity and shared pointers increases mutual engagement between participants, but together these features can overwhelm users. We also demonstrate that support for free-form annotation and spatial interaction with shared representations mediates interaction and helps participants to manage their collaborative activity effectively. In this paper we develop several measures mutual engagement and demonstrate their use to assess the design of shared representations. A key contribution of this paper is the development of a measure of collocation of participant interaction which indicates mutual engagement. The findings of the study have implications beyond the domain of collaborative music making and we outline some design guidelines for mutually engaging shared representations.     

Statecharts的抽象语法分析研究

用抽象数据类型来描述Statecharts,希望隐藏语义表述上的细节，把一个图形化的语言转换为文本的方式来描述，并为Statecharts语法分析奠定基础。     

Immersive authoring of Tangible Augmented Reality content: A user study

Immersive authoring refers to the style of programming or developing content from within the targetexecutable environment. Immersive authoring is important for fields such as augmented reality (AR) in which interaction usability and user perception of the target content must be checked first hand, in situ. In addition, the interaction efficiency and usability of the authoring tools itself is equally important forease of authoring. In this paper, we propose design principles and describe an implementation of animmersive authoring system for AR. More importantly, we present a formal user study demonstrating its benefits and weaknesses. In particular, our results demonstrate that, compared to using the traditional 2D desktop development method, immersive authoring gained significant efficiency in specifying spatial arrangements and behavior tasks, a major component of AR content authoring. However, it was not so successful for abstract tasks such as logical programming. Based on this result, we suggest that a comprehensive AR authoring tool should include such immersive authoring functionality to help, particularly non-technical media artists, create effective contents based on the characteristics of the underlying media and interaction style.     

Abstract data views: an interface specification concept to enhancedesign for reuse

The abstract data view (ADV) design model was originally created to specify clearly and formally the separation of the user interface from the application component of a software system, and to provide a systematic design method that is independent of specific application environments. Such a method should lead to a high degree of reuse of designs for both interface and application components. The material presented, extends the concept of ADV's to encompass the general specification of interfaces between application components in the same or different computing environments. This approach to specifying interfaces clearly separates application components from each other, since they do not need to know how they are used, or how they obtain services from other application components. Thus, application components called abstract data objects (ADOs), are designed to minimize knowledge of the environment in which they are used and should be more amenable to reuse