Programming Languages For Interactive Computing

Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination. By contrast most applications are interactive: they maintain ongoing interactions with their environments. Modern systems address this incompatibility by manually extending the execution model of the host language to support interaction, usually by embedding an event-driven state management scheme which executes fragments of imperative code in response to interactions, the job of each executed fragment being to restore the internal consistency of the computation. The downside of this approach to interaction is that it relies heavily on mutable stores and side-effects and mixes application logic in with behaviour which is more properly the responsibility of an execution model. I describe a programming model called declarative interaction which supports interaction directly. The distinguishing feature of the model is its modal construal of state and interaction.     

自然计算的新分支——膜计算

作为自然计算的新分支,膜计算是当前计算机科学、数学、生物学和人工智能等多学科交叉的研究热点.概述膜计算的最新动态,以一个简单膜系统为例介绍膜计算的基本概念和基本原理,从细胞型、组织型和神经型三类膜系统以及它们的计算能力和计算效率方面介绍膜计算理论研究进展,通过概括膜计算国内外应用研究成果讨论其应用前景和方向,并从软硬件发展历程分析膜系统软硬实现研究现状.最后给出有关膜计算研究的重要网络资源、热点研究领域和重点关注的问题.     

Towards Graph Transformation Based Generation of Visual Editors Using Eclipse

This work discusses the state-of-the-art of visual editor generation based on graph transformation concepts on one hand, and using the Eclipse technology which includes the Graphical Editor Framework (GEF), on the other hand. Due to existing shortcomings in both approaches, we present a combined approach for a tool environment that allows to generate a GEF-based editor from a formal, graph-transformation based visual language specification.     

Some results on contextual grammars ∗

Contextual Grammars arc widely investigated as models of natural languages and currently find applications related to DNA Computing. In this paper, we extend the concept of control languages to contextual grammars. We prove that control languages indeed add to the power of contextual grammars and investigate certain hierarchy results.     

Unexpected universality results for three classes of P systems with symport/antiport

Symport and antiport are biological ways of transporting molecules through membranesin ``collaborating' pairs; in the case of symport the two molecules pass in the same direction, in the case of antiport the two molecules pass in opposite directions. Here we first survey the results about the computing power of membrane systems (P systems) using only symport/antiport rules (hence these systems compute by communication only), then we consider a recently introduced, way of defining the result of a computation in a membrane system: looking for the trace of certain objects in their movement through membranes. Rather unexpected, in this way we get characterizations of recursively enumerable languages by means of membrane systems with symport/antiport which work with multisets of objects (note the qualitative difference between the data structure used by computations – multisets: no ordering– and the data structure of the output – strings: linear ordering). A similar remark holds true for the case of analysing P systems, which work in an automata-like manner: the sequence of certain distinguished objects taken from the environment during acomputation is the string recognized by the computation. We also survey universality results from this area, with sketched proofs. Some open problems are also formulated. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the complexity of the instance checking problem in concept languages with existential quantification

Most of the work regarding complexity results for concept languages consider subsumption as the prototypical inference. However, when concept languages are used for building knowledge bases including assertions on individuals, the basic deductive service of the knowledge base is the so-called instance checking, which is the problem of checking if an individual is an instance of a given concept. We consider a particular concept language, calledALE, and we address the question of whether instance checking can be really solved by means of subsumption algorithms in this language. Therefore, we indirectly ask whether considering subsumption as the prototypical inference is justified. Our analysis, carried out considering two different measure of complexity, shows that inALE instance checking is strictly harder than subsumption. This result singles out a new source of complexity in concept languages, which does not show up when checking subsumption between concepts.This work has been supported by the ESPRIT Basic Research Action N.6810-COMPULOG 2 and by the Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo of the CNR (Italian Research Council).     

Part‐type Segmentation of Articulated Voxel‐Shapes using the Junction Rule

We present a part‐type segmentation method for articulated voxel‐shapes based on curve skeletons. Shapes are considered to consist of several simpler, intersecting shapes. Our method is based on the junction rule: the observation that two intersecting shapes generate an additional junction in their joined curve‐skeleton near the place of intersection. For each curve‐skeleton point, we construct a piecewise‐geodesic loop on the shape surface. Starting from the junctions, we search along the curve skeleton for points whose associated loops make for suitable part cuts. The segmentations are robust to noise and discretization artifacts, because the curve skeletonization incorporates a single user‐parameter to filter spurious curve‐skeleton branches. Furthermore, segment borders are smooth and minimally twisting by construction. We demonstrate our method on several real‐world examples and compare it to existing part‐type segmentation methods.     

A visual language and environment for enterprise system modelling and automation

ObjectiveWe want to support enterprise service modelling and generation using a more end user-friendly metaphor than current approaches, which fail to scale to large organisations with key issues of “cobweb” and “labyrinth” problems and large numbers of hidden dependencies.MethodWe present and evaluate an integrated visual approach for business process modelling using a novel tree-based overlay structure that effectively mitigate complexity problems. A tree-overlay based visual notation (EML) and its integrated support environment (MaramaEML) supplement and integrate with existing solutions. Complex business architectures are represented as service trees and business processes are modelled as process overlay sequences on the service trees.ResultsMaramaEML integrates EML and BPMN to provide complementary, high-level business service modelling and supports automatic BPEL code generation from the graphical representations to realise web services implementing the specified processes. It facilitates generated service validation using an integrated LTSA checker and provides a distortion-based fisheye and zooming function to enhance complex diagram navigation. Evaluations of EML show its effectiveness.ConclusionsWe have successfully developed and evaluated a novel tree-based metaphor for business process modelling and enterprise service generation. Practice implications: a more user-friendly modelling approach and support tool for business end users.     

Spiking neural P systems with extended rules: universality and languages

We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.     

基于云环境的信息系统风险评估模型应用研究

针对云计算环境下网络信息系统会面临更多安全风险问题,总结出8种威胁安全准则,并对应得到影响因素;结合云计算技术具有协作性、虚拟性等特点,采用层次分析法并引入相关系数对多决策目标进行分析,提出一种基于云环境下的信息安全风险评估模型;最后运用该模型建模得出云计算环境下的信息系统安全风险评估思路;实验结果表明文章提出的风险评估模型具有一定的实际应用价值。     

Accurate Image Generation and Interactive Image Editing with the A-buffer

The A-buffer suggested by Carpenter [2] is a hidden surface removal method which deals with arbitrary overlapping edges in a pixel. In this paper, we suggest a way of increasing the subpixel resolution by storing the bitmask index rather than the bitmask. This allows much more accurate images to be generated while at the same time, minimising memory usage. It also allows zooming to reveal more information. We also suggest an enhancement to the A-buffer by allowing the creation of dynamic objects. These dynamic objects can then be edited (deleted, moved, etc.) interactively as image modification and assembly is going on. This new buffer forms part of the image composition system we have been working on.     

面向工业过程的图像生成及其应用研究综述

在面向工业过程的计算机视觉研究中, 智能感知模型能否实际应用取决于其对复杂工业环境的适应能力. 由于可利用的工业图像数据集存在分布不均、多样性不足和干扰严重等问题, 如何生成符合多工况分布的期望训练集是提高感知模型性能的关键. 为解决上述问题, 以城市固废焚烧(Municipal solid wastes incineration, MSWI)过程为背景, 综述目前面向工业过程的图像生成及其应用研究, 为进行面向工业图像的感知建模提供支撑. 首先, 梳理面向工业过程的图像生成定义和流程以及其应用需求; 随后, 分析在工业领域中具有潜在应用价值的图像生成算法; 接着, 从工业过程图像生成、生成图像评估和应用等视角进行现状综述; 然后, 对下一步研究方向进行讨论与分析; 最后, 对全文进行总结并指出未来挑战.     

Nonrigid Matching of Undersampled Shapes via Medial Diffusion

We introduce medial diffusion for the matching of undersampled shapes undergoing a nonrigid deformation. We construct a diffusion process with respect to the medial axis of a shape, and use the quantity of heat diffusion as a measure which is both tolerant of missing data and approximately invariant to nonrigid deformations. A notable aspect of our approach is that we do not define the diffusion on the shape's medial axis, or similar medial representation. Instead, we construct the diffusion process directly on the shape. This permits the diffusion process to better capture surface features, such as varying spherical and cylindrical parts, as well as combine with other surface‐based diffusion processes. We show how to use medial diffusion to detect intrinsic symmetries, and for computing correspondences between pairs of shapes, wherein shapes contain substantial missing data.     

String‐Based Synthesis of Structured Shapes

We propose a novel method to synthesize geometric models from a given class of context‐aware structured shapes such as buildings and other man‐made objects. The central idea is to leverage powerful machine learning methods from the area of natural language processing for this task. To this end, we propose a technique that maps shapes to strings and vice versa, through an intermediate shape graph representation. We then convert procedurally generated shape repositories into text databases that, in turn, can be used to train a variational autoencoder. The autoencoder enables higher level shape manipulation and synthesis like, for example, interpolation and sampling via its continuous latent space. We provide project code and pre‐trained models.     

Heat Walk: Robust Salient Segmentation of Non‐rigid Shapes

Segmenting three dimensional objects using properties of heat diffusion on meshes aim to produce salient results. The few existing algorithms based on heat diffusion do not use the full knowledge that can be gained from heat diffusion and are sensitive to varying kinds of perturbations. Our simple algorithm, Heat Walk, converts the implicit information in the heat kernel to explicit knowledge about the pathways for maximum heat flow capacity. We develop a two stage strategy for segmentation. In the first stage we quickly identify regions which are dominated by heat accumulators by employing a greedy algorithm. The second stage partitions out dissipative regions from the previously discovered accumulative regions by using a KL‐divergence based criterion. The resulting algorithm is both independent of human intervention and fast because of the globally aware directed walk along the maximal heat flow capacity. Extensive experimental evidence shows the method is robust to a variety of noise factors including topological short circuits, surface holes, pose variations, variations in tessellation, missing features, scaling, as well as normal and shot noise. Comparison with the Princeton Segmentation Benchmark (PSB) shows that our method is comparable with state of the art segmentation methods and has additional advantages of being robust and self contained. Based upon theoretical insight the convergence and stability of the Heat Walk is shown.     

深度对抗视觉生成综述

深度视觉生成是计算机视觉领域的热门方向,旨在使计算机能够根据输入数据自动生成预期的视觉内容。深度视觉生成使用人工智能技术赋能相关产业,推动产业自动化、智能化改革与转型。生成对抗网络（generative adversarial networks,GANs）是深度视觉生成的有效工具,近年来受到极大关注,成为快速发展的研究方向。GANs能够接收多种模态的输入数据,包括噪声、图像、文本和视频,以对抗博弈的模式进行图像生成和视频生成,已成功应用于多项视觉生成任务。利用GANs实现真实的、多样化和可控的视觉生成具有重要的研究意义。本文对近年来深度对抗视觉生成的相关工作进行综述。首先介绍深度视觉生成背景及典型生成模型,然后根据深度对抗视觉生成的主流任务概述相关算法,总结深度对抗视觉生成目前面临的痛点问题,在此基础上分析深度对抗视觉生成的未来发展趋势。     

基于改良编码与高斯过程的交互式医学图像分割

医学图像分割是众多医学临床应用的基础与关键组成. 近年来, 交互式分割方法凭借其在复杂临床任务中的高准确性和鲁棒性受到广泛关注. 然而, 现有基于深度学习的交互式分割方法在用户交互的利用上仍有不足, 特别是在交互编码设计和像素分类等方面. 针对上述问题, 本文提出了一种包含“近中心点”和“外边缘点”的混合交互设计, 以保障交互成本并对用户意图进行精准捕捉; 同时, 通过高斯衰减函数对现有测地线距离编码方法进行加权, 以降低图像噪声干扰, 提高交互编码的鲁棒性和准确性; 此外, 结合基于混合核函数的高斯过程分类方法, 在像素分类过程中对用户交互信息进行充分利用, 提升分割精度并赋予模型一定的可解释性. 实验结果表明, 本文所提方法在MSD数据集4个标志性子集的5项分割任务中均表现出较高的分割精度, 尤其在复杂任务(如Pancreas tumour和Colon图像分割)中, Dice系数和ASSD值显著优于现有方法, 体现了其在精准分割和边界处理方面的优势.     

交互编辑逻辑图的设计方法

本文以交互式的逻辑图编辑系统ILDES的设计和实现为背景,提出并解决了逻辑图交互编辑中的一些设计方法和技术问题。在归纳出图编辑的界面设计技术特点的基础上,探讨了旨在提高处理效率的自动算法问题,以及针对复杂电路的层次设计方法和分页处理技术等。