A fast hybrid computation model for rectum deformation

It is a challenging task to realistically reproduce the complex deformation of soft bio-tissues in a surgical operation, especially when large deformations and movements exist. A hybrid model which we call the beads-on-string model is presented to handle the deformation and collision of the rectum in a virtual surgery simulation system. Specially tailored for this purpose, our model takes multiple layers to capture the dynamics of the rectum in an efficient manner. Inspired by the shape similarity between a rectum with regular bulges and a string of beads, we use a Cosserat rod model, coinciding with the centreline of the rectum, to calculate its deformation subject to external forces. We introduce rigid spheres, analogy to beads, moving along with the rod to approximate the shape of the rectum in handling collision. In addition, the beads (rigid spheres) provide a natural interlayer to map the deformation of the centreline to the associated mesh which presents detailed geometry of the rectum. Our approach is carefully crafted to achieve high computational efficiency and its multi-layer structure is designed to reproduce the physics of the deformation of the rectum.     

一种基于本体的Web服务信任度计算模型

传统的Web服务信任度计算模型所计算的信任度是一个单独的数值, 缺少必要的上下文信息, 使得信任度表达的含义比较模糊。另外, 以往的计算模型大多局限于单一的管理域中, 管理域之间由于缺乏共同的知识标准而无法进行统一的信任度计算。为此, 提出了基于上下文本体的Web服务信任度计算模型以解决上述问题。本体技术为上下文信息的表达和推理提供了便利, 同时也为不同管理域之间的交互提供了共享知识库。在提出的模型中, 直接以用户关心的上下文信息作为间接信任度计算的重要依据, 在对上下文概念进行语义匹配的基础上, 最终实现跨域的信任度计算。实验结果验证了模型的可行性和有效性。     

基于互不信任企业联盟的统一身份认证模型

现有的统一身份认证模型采用单个密码对用户身份进行验证,这种方式无法对企业的商业秘密进行有效地保护,并且认证效率低,因而不被大多数企业所接受.为了解决这个问题,在对现有模型存在的问题进行分析的基础上提出一种新的认证模型.该模型把用户的信息分成两部分--共享信息和私有信息,并采用一对密码--本地密码和共享密码分别对这两部分信息进行保护.用户可以利用共享密码在不同网站中漫游,实现统一身份认证;而网站通过本地密码来保护属于商业秘密的那部分信息.该模型能够保护商业秘密,又能够在一定程度上提高认证效率.     

A communication-reduced and computation-balanced framework for fast graph computation

The bulk synchronous parallel (BSP) model is very user friendly for coding and debugging parallel graph algorithms. However, existing BSP-based distributed graph-processing frameworks, such as Pregel, GPS and Giraph, routinely suffer from high communication costs. These high communication costs mainly stem from the fine-grained message-passing communication model. In order to address this problem, we propose a new computation model with low communication costs, called LCC-BSP. We use this model to design and implement a high-performance distributed graph-processing framework called LCC-Graph. This framework eliminates high communication costs in existing distributed graph-processing frameworks. Moreover, LCC-Graph also balances the computation workloads among all compute nodes by optimizing graph partitioning, significantly reducing the computation time for each superstep. Evaluation of LCC-Graph on a 32-node cluster, driven by real-world graph datasets, shows that it significantly outperforms existing distributed graph-processing frameworks in terms of runtime, particularly when the system is supported by a high-bandwidth network. For example, LCC-Graph achieves an order of magnitude performance improvement over GPS and GraphLab.     

A novel algorithm for fast computation of Zernike moments

Zernike moments (ZMs) have been successfully used in pattern recognition and image analysis due to their good properties of orthogonality and rotation invariance. However, their computation by a direct method is too expensive, which limits the application of ZMs. In this paper, we present a novel algorithm for fast computation of Zernike moments. By using the recursive property of Zernike polynomials, the inter-relationship of the Zernike moments can be established. As a result, the Zernike moment of order n with repetition m, Z_nm, can be expressed as a combination of Z_n−2,m and Z_n−4,m. Based on this relationship, the Zernike moment Z_nm, for n>m, can be deduced from Z_mm. To reduce the computational complexity, we adopt an algorithm known as systolic array for computing these latter moments. Using such a strategy, the multiplication number required in the moment calculation of Z_mm can be decreased significantly. Comparison with known methods shows that our algorithm is as accurate as the existing methods, but is more efficient.     

A fast analog front-end processor for digital imaging systems

With higher sensor resolutions available, the speed and dynamic range requirements for image processors in digital imaging systems are more demanding. A 12-bit, 50 Mpixels/s digital image acquisition system balances power end performance. The analog processor's total power dissipation is only 150 MW at full speed-an enviable quality for the portable market although the underlying technique requires special analog circuitry to handle fast gain changes, it achieves a far wider dynamic range     

A working memory model based on fast Hebbian learning

Recent models of the oculomotor delayed response task have been based on the assumption that working memory is stored as a persistent activity state (a 'bump' state). The delay activity is maintained by a finely tuned synaptic weight matrix producing a line attractor. Here we present an alternative hypothesis, that fast Hebbian synaptic plasticity is the mechanism underlying working memory. A computational model demonstrates a working memory function that is more resistant to distractors and network inhomogeneity compared to previous models, and that is also capable of storing multiple memories.     

Exploring correlation for fast skyline computation

Scaling skyline queries over high-dimensional datasets remains to be challenging due to the fact that most existing algorithms assume dimensional independence when establishing the worst-case complexity by discarding correlation distribution. In this paper, we present HashSkyline, a systematic and correlation-aware approach for scaling skyline queries over high-dimensional datasets with three novel features: First, it offers a fast hash-based method to prune non-skyline points by utilizing data correlation characteristics and speed up the overall skyline evaluation for correlated datasets. Second, we develop \(HashSkyline_{GPU}\), which can dramatically reduce the response time for anti-correlated and independent datasets by capitalizing on the parallel processing power of GPUs. Third, the HashSkyline approach uses the pivot cell-based mechanism combined with the correlation threshold to determine the correlation distribution characteristics for a given dataset, enabling adaptive configuration of HashSkyline for skyline query evaluation by auto-switching of \(HashSkyline_{CPU}\) and \(HashSkyline_{GPU}\). We evaluate the validity of HashSkyline using both synthetic datasets and real datasets. Our experiments show that HashSkyline consumes significantly less pre-processing cost and achieves significantly higher overall query performance, compared to existing state-of-the-art algorithms.     

A fast adaptive model reduction method based on Takenaka-Malmquist systems

An adaptive model reduction method is proposed for linear time-invariant systems based on the continuous-time rational orthogonal basis (Takenaka-Malmquist basis). The method is to find an adaptive approximation in the energy sense by selecting optimal points for the rational orthogonal basis. The stability of the reduced models holds, and the steady-state values of step responses are kept to be equal. Furthermore, the method automatically ensures the reduced system to be in the Hardy space H₂. The existence of the best approximation in the Hardy space H₂ by n Blaschke forms is proved in the proposed approach. The effectivity of this method is illustrated through three well-known examples.     

引入初级视通路计算模型的轮廓检测

目的 轮廓是对图像目标的一种稀疏表达方式，从图像中提取出有效物体轮廓可以更好地完成后续的视觉认知任务，所以轮廓检测在计算机视觉领域具有较好的应用。本文考虑到初级视通路中视觉信息传递和处理流程中的特点，提出了一种基于初级视通路计算模型的轮廓检测方法。方法 在视网膜神经节环节，提出一种体现方向选择特性的经典感受野（CRF）改进模型，利用多尺度特征融合策略来模拟视网膜神经节细胞对图像目标的初级轮廓响应；在视网膜神经节到神经节-外膝体（LGN）的视通路中，提出一种反映视觉信息时空尺度特征的时空编码机制，模拟神经节-外膝体通路对初级轮廓响应的去冗余处理；利用非下采样轮廓波变换和Gabor变换协同作用，模拟非经典感受野（NCRF）的侧向抑制特性。最后利用初级视皮层对整体轮廓的前馈机制，实现对轮廓局部细节信息的完整性融合。结果 选择将RuG40图库的所有图像作为测试集合进行模型性能测试，对检测结果进行非极大值抑制和阈值处理，最终将得到的二值轮廓图与基准图比较，整个数据集和单张图的最优平均P指标分别为0.49和0.56。对于单个图像最优参数条件下的检测结果均值，将本文方法与非经典感受野抑制模型（ISO）和多特征外周抑制模型（MCI）比较，较两者分别提高了19.1%和7.7%。结果表明本文方法能有效突出主体轮廓并抑制纹理背景。结论 面向图像处理应用的初级视通路计算模型，将为后续图像理解和分析提供一种新的思路。     

基于类型的安全移动计算模型

Agent的迁移和通信是影响移动计算安全性的重要问题,但是已有的移动计算模型缺乏相应的安全机制。针对这一问题,文中讨论了移动计算环境中基于语言的安全技术,同时建立了Confined π计算模型,通过引入类型系统,该模型将Agent迁移和通信的安全问题转换成相应的静态分析特性,然后从静态分析的角度研究了保证Agent迁移和通信安全性的机制。     

A multilayer self-organizing model for convex-hull computation

A self-organizing neural-network model is proposed for computation of the convex-hull of a given set of planar points. The network evolves in such a manner that it adapts itself to the hull-vertices of the convex-hull. The proposed network consists of three layers of processors. The bottom layer computes some angles which are passed to the middle layer. The middle layer is used for computation of the minimum angle (winner selection). These information are passed to the topmost layer as well as fed back to the bottom layer. The network in the topmost layer self-organizes by labeling the hull-processors in an orderly fashion so that the final convex-hull is obtained from the topmost layer. Time complexity of the proposed model is analyzed and is compared with existing models of similar nature     

A fast algorithm for integrating connected-component labeling and euler number computation

This paper proposes a fast algorithm for integrating connected-component labeling and Euler number computation. Based on graph theory, the Euler number of a binary image in the proposed algorithm is calculated by counting the occurrences of four patterns of the mask for processing foreground pixels in the first scan of a connected-component labeling process, where these four patterns can be found directly without any additional calculation; thus, connected-component labeling and Euler number computation can be integrated more efficiently. Moreover, when computing the Euler number, unlike other conventional algorithms, the proposed algorithm does not need to process background pixels. Experimental results demonstrate that the proposed algorithm is much more efficient than conventional algorithms either for calculating the Euler number alone or simultaneously calculating the Euler number and labeling connected components.     

A comparative analysis of algorithms for fast computation of Zernike moments

This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Z_pq. The present method comprises of Direct, Belkasim's, Prata's, Kintner's and Coefficient methods. We propose a new technique, denoted as q-recursive method, specifically for fast computation of Zernike moments. It uses radial polynomials of fixed order p with a varying index q to compute Zernike moments. Fast computation is achieved because it uses polynomials of higher index q to derive the polynomials of lower index q and it does not use any factorial terms. Individual order of moments can be calculated independently without employing lower- or higher-order moments. This is especially useful in cases where only selected orders of Zernike moments are needed as pattern features. The performance of the present and proposed methods are experimentally analyzed by calculating Zernike moments of orders 0 to p and specific order p using binary and grayscale images. In both the cases, the q-recursive method takes the shortest time to compute Zernike moments.     

A fast procedure for manipulator inverse kinematics computation and singularities prevention

In this article, a fast procedure for numerical manipulator inverse kinematics computation and singularities prevention is presented. The approach is based upon solving a linear system and automatically calculating some parameters. These parameters are properly used in either one of two original schemes that are also proposed to induce robustness to the pseudoinverse. Furthermore, here it is also shown how to properly implement one of these schemes in conjunction with a recently developed approach for the singularities prevention of redundant manipulators. The resultant algorithms are tested on the simulation of a planar redundant manipulator. From the results obtained, it is observed that the proposed approach compares favorably with the approaches using a Gaussian elimination procedure and with pseudoinverse robustness based on a manipulability measure.     

基于双服务器模型的可公开验证多元多项式外包计算方案

结合云安全外包计算中的隐私保护问题,针对任意多元多项式函数的外包计算,利用同态加密算法和多线性映射,构造了基于双服务器模型的可公开验证外包计算方案。该方案能够保证多项式函数输入与输出的隐私性和安全性,用户或者任意第三方都可以对云服务器计算的结果进行验证,实现了可公开验证性和可用性。云返回给用户的结果处于密文状态,只有拥有解密密钥的用户才能够输出最终的结果,一定程度上保证了计算结果的安全性。分析结果表明,该方案在标准模型下能够达到输入的选择明文攻击（CPA）安全,用户的计算代价远远小于服务器以及直接计算多项式函数的计算代价。     

稀疏光流快速计算的动态目标检测与跟踪

动态目标的检测与跟踪作为图像处理和计算机视觉学科的重要分支,广泛应用于军事和民用等各个领域。文中提出一种基于稀疏光流快速计算的目标检测和跟踪新方法,该方法通过计算能反映图像特征的特定像素点光流矢量来实现目标检测和跟踪,同时结合图像金字塔技术,可以检测和跟踪运动速度更快、运动尺度更大的目标。文中将该方法分别与稠密光流方法和基于颜色特征方法作对比,结果表明该方法有计算量小、能很好应对目标遮挡情况和能检测和跟踪运动速度较快的目标等诸多优点。实验在多种条件下对该方法进行了验证,跟踪准确率都能达到80%以上,且基本能符合实时性的要求,说明该方法具有可行性和实用价值。     

A linear quadrilateral shell element with fast stiffness computation

A new quadrilateral shell element with 5/6 nodal degrees of freedom is presented. Assuming linear isotropic elasticity a Hellinger–Reissner functional with independent displacements, rotations and stress resultants is used. Within the mixed formulation the stress resultants are interpolated using five parameters for the membrane forces as well as for the bending moments and four parameters for the shear forces. The hybrid element stiffness matrix resulting from the stationary condition is integrated analytically. This leads to a part obtained by one point integration and a stabilization matrix. The element possesses the correct rank, is free of locking and is applicable within the whole range of thin and thick shells. The in-plane and bending patch tests are fulfilled and the computed numerical examples show that the convergence behaviour of the stress resultants is very good in comparison to comparable existing elements. The essential advantage is the fast stiffness computation due to the analytically integrated matrices.     

A fast and scalable approach for IoT service selection based on a physical service model

Information Systems (ISs) have become one of the crucial tools for various organizations in managing and coordinating business processes. Now we are entering the era of the Internet of Things (IoT). IoT is a paradigm in which real-world physical things can be connected to the Internet and provide services through the computing devices attached. The IoT infrastructure is starting to be integrated with ISs thereby diminishing the boundaries between the physical world and the business IT systems. With the development of IoT technologies, the number of connected things and their available physical services are increasing rapidly. Thus, selecting an appropriate service that satisfies a user’s requirements from such services becomes a time-consuming challenge. To address this issue, we propose a Physical Service Model (PSM) as a common conceptual model to describe heterogeneous IoT physical services. PSM contains three core concepts (device, resource, and service) and specifies their relationships. Based on the proposed PSM, we define three types of Quality of Service (QoS) attributes and rate candidate services according to user requirements. To dynamically rate QoS values and select an appropriate physical service, we propose a Physical Service Selection (PSS) method that takes a user preference and an absolute dominance relationship among physical services into account. Finally, experiments are conducted to evaluate the performance of the proposed method.