三用干燥热泵表面式蒸发器模拟计算

研究了三用干燥热泵表面式蒸发器模拟计算过程。须特别注意的是：不同运行状态时蒸发器析湿系数不同；蒸发器最佳翅片表面温度的确定方法及结构计算合理性判定等。     

量子计算中的六个组合恒等式的证明

证明了量子计算中出现的六个组合恒等式。     

柔性扑翼的模型建立及其功率研究

在原有匀速刚性模型的基础上,提出考虑了扑翼扑动速率变化和形状变化的柔性扑翼模型,使之更接近鸟翼真实扑动情况.模拟计算了时柔性扑翼气动功率及扑动效率随着扑动角、来流速度等参数的变化,从气动角度解释了为何鸟在不同的飞行阶段扑翼规律各不相同,为柔性扑翼飞行器的设计提供了理论依据.     

Echo-state-network classification based multi-services awareness in high-speed optical passive networks

With the challenge of great growing of services diversity,service-oriented supporting ability is required by current high-speed passive optical network (PON).Aimed at enhancing the quality of service (QoS) brought by diversified-services,this study proposes an echo state network (ESN) based multi-service awareness mechanism in 10-Gigabite ethernet passive optical network (10G-EPON).In the proposed approach,distributed architecture is adopted to realize this ESN based multi-service awareness.According to the network architecture of 10G-EPON,where a main ESN is running in OLT and a number of ESN agents works in ONUs.The main-ESN plays the main function of service-awareness from the total view of various kinds of services in 10G-EPON system,by full ESN training.Then,the reservoir information of well-trained ESN in OLT will be broadcasted to all ONUs and those ESN agents working in ONUs are allowed to conduct independent service-awareness function.Thus,resources allocation and transport policy are both determined only in ONUs.Simulation results show that the proposed mechanism is able to better support the ability of multiple services.     

An efficient identity-based key agreement protocol in a multiple PKG environment

Identity-based key agreement protocol affords a natural way to combine the participant’s identity with its public key.However,most of them just consider the key agreement in a single private key generator(PKG)environment.In addition,the existing key agreement protocols have a great computing overhead for mobile computing which is more and more popular today.This paper proposes a new identity based key agreement protocol.With the help of mathematical tools,we make our protocol applied in multiple PKG environment.It also satisfies all the security properties which is set for key agreement protocol.Moreover,some of its time-consuming operations can be delivered to untrusted public computation resources,so its computing complexity can be greatly reduced.     

On the usage of NURBS as interface representation in free‐surface flows

When simulating free‐surface flows using the finite element method, there are many cases where the governing equations require information which must be derived from the available discretized geometry. Examples are curvature or normal vectors. The accurate computation of this information directly from the finite element mesh often requires a high degree of refinement—which is not necessarily required to obtain an accurate flow solution. As a remedy and an option to be able to use coarser meshes, the representation of the free surface using non‐uniform rational B‐splines (NURBS) curves or surfaces is investigated in this work. The advantages of a NURBS parameterization in comparison with the standard approach are discussed. In addition, it is explored how the pressure jump resulting from surface tension effects can be handled using doubled interface nodes. Numerical examples include the computation of surface tension in a two‐phase flow as well as the computation of normal vectors as a basis for mesh deformation methods. For these examples, the improvement of the numerical solution compared with the standard approaches on identical meshes is shown. Copyright © 2011 John Wiley & Sons, Ltd.     

On using compressibility to detect when slime mould completed computation

Slime mould Physarum polycephalum is a single cell visible by an unaided eye. The slime mould optimizes its network of protoplasmic tubes in gradients of attractants and repellents. This behavior is interpreted as computation. Several prototypes of the slime mould computers were designed to solve problems of computation geometry, graphs, transport networks, and to implement universal computing circuits. Being a living substrate, the slime mould does not halt its behavior when a task is solved but often continues foraging the space thus masking the solution found. We propose to use temporal changes in compressibility of the slime mould patterns as indicators of the halting of the computation. Compressibility of a pattern characterizes the pattern's morphological diversity, that is, a number of different local configurations. At the beginning of computation the slime explores the space, thus generating less compressible patterns. After gradients of attractants and repellents are detected the slime spans data sites with its protoplasmic network and retracts scouting branches, thus generating more compressible patterns. We analyze the feasibility of the approach on results of laboratory experiments and computer modelling. © 2015 Wiley Periodicals, Inc. Complexity 21: 162–175, 2016     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.