METAPHOR RECOGNITION: CHMETA, A PATTERN-BASED SYSTEM

Metaphor recognition presents a computational challenge, in part due to metaphoric deviation from literal thinking, and also because of a metaphor's various linguistic expressions. This article forwards a new computational method, an integrated treatment of metaphor recognition from the computational perspective, which recent related studies have not entirely addressed. The authors differentiate metaphor recognition from complex metaphor inference and interpretation employing psychological clues. To accomplish this, we have developed a formalized system of metaphorical expression in metaphor role dependency schema, which specifically defines, classifies, and quantifies metaphorical anomalies, building a computable classification system for metaphors (incorporating 32 major patterns of metaphorical expressions) by providing a strategy to locate potential metaphorical anomalies in a target input sentence through a pattern recognition method and a metaphor components' tagging approach. This metaphor recognition and tagging system is named and implemented as "CHMeta." Experiment results support the validity and efficiency of this metaphor recognition system. Compared with most metaphor computation systems, which work mainly on a few examples, this system classifies major metaphorical expressions from a computational perspective and is able to recognize a variety of different kinds of metaphors, including nested ones. Thus, this is the first integrated work in computable classification, recognition, and tagging of large-scale metaphors in Chinese.     

基于网格计算市场模型的资源管理和调度的研究

网格计算市场模型是把经济学的概念应用到网格资源管理和调度的模型。基于计算市场模型的网格资源管理系统借鉴人类社会竞争的市场调节机制，根据用户的经济需求进行资源管理与任务调度，不仅使资源所有者和资源消费者都能实现各自的经济目标，而且使资源消费者使用轻负栽和廉价的资源，达到整个网格资源整体的全局最优及合理利用。     

网格计算服务系统检查点算法研究

在由机构内部空闲计算机组成的为计算移动Agent提供服务的网格计算服务系统中减少容错开销,提高计算效率是一个重要的问题.一个具有非封闭、非阻塞、低开销等优势的新检查点算法被提出,且该算法的同步垃圾收集过程可以避免不同进程间在确立新检查点、抛弃旧检查点时的不同步造成的不一致状态.实验结果表明,该算法的开销与系统节点数量呈线性关系.     

Measurement designs to improve the computational efficiency of linear system state estimators

A design procedure for the measurement process is proposed to decrease the computational burden of state estimation in linear discrete-time systems. System order reduction is involved, which is achieved by a derived transformation, yielding an alternative system and measurement process representation that includes time delays in both the system and the measurement process. Without loss of filter optimality, measurement designs yielding reductions in the computational requirements of the Kalman filter applied to the reduced order system are derived. A computational comparison is included to show that the proposed method, as opposed to the direct application of the Kalman filter, can yield large reductions in the filter computation time.     

Ontology-based computational intelligent multi-agent and its application to CMMI assessment

This study presents an ontology-based computational intelligent multi-agent system for Capability Maturity Model Integration (CMMI) assessment. An ontology model is developed to represent the CMMI domain knowledge that will be adopted by the computational intelligent multi-agent. The CMMI ontology is predefined by domain experts, and created by the ontology generating system. The computational intelligent multi-agent comprises a natural language processing agent, an ontological reasoning agent and a summary agent. The multi-agent deals with the evaluation reports from the natural language processing agent, infers the term relation strength between the ontology and the evaluation report, and then summarizes the main sentences of the evaluation report. The summary reports are meanwhile transmitted back to the domain expert, which makes the domain expert further adjust the CMMI ontology. Experimental results indicate that the ontology-based computational intelligent multi-agent can effectively summarize the evaluation reports for the CMMI assessment.     

平行系统和数字孪生的一种数据驱动形式表示及计算框架

旨在为平行系统及ACP方法建立一种数据驱动的数学形式和计算框架, 该形式与框架也适用于数字孪生系统.首先, 基于动态系统状态方程方法论, 给出了平行系统的虚实双系统表示方法, 基于此表示方法为平行系统问题提供了一种数学表示.围绕该表示, 讨论了虚实系统互动、平行系统与数字孪生系统异同等问题.然后, 为ACP方法提供了一种计算框架, 详细解释了人工系统(Artificial systems, A)、计算实验(Computational experiments, C)、平行执行(Parallel execution, P)的数学计算求解过程, 并讨论了“学习与训练”、“实验与评估”、“管理与控制”、灵捷–聚焦–收敛(AFC)、小数据-大数据-小智能等概念的相关数学表示, 并讨论了智能科学与平行系统数学架构的关系以及平行智能的内涵.最后, 以大学校园园区能源管理系统为案例, 为平行系统数学架构和方法提供一个直观的算例.     

计算受限控制系统的一种全资源预测控制方法

针对具有时变有限且不可预知计算资源的控制系统，提出了一种充分利用可用计算资源的预测控制策略和相应的控制器设计方法.该策略在控制系统可用计算资源充足时计算多步前向预测控制量，进而使用合适预测控制量在控制器因缺少计算资源无法运行时闭合系统，达到了在不要求额外计算资源前提下提升控制系统性能的效果.利用改进的模型预测控制方法设计了相应的控制器，并分别使用纯数值和MATLAB/LabVIEW联合仿真算例对所提出的方法进行了验证.     

Dynamic optimization of dual-mode hybrid systems with state-dependent switching conditions

This paper presents a computational approach for optimizing a class of hybrid systems in which the state dynamics switch between two distinct modes. The times at which the mode transitions occur cannot be specified directly, but are instead governed by a state-dependent switching condition. The control variables, which should be chosen optimally by the system designer, consist of a set of continuous-time input signals. By introducing an auxiliary binary-valued control function to represent the system's current mode, we show that any dual-mode hybrid system with state-dependent switching conditions can be transformed into a standard dynamic system subject to path constraints. We then develop a computational algorithm, based on control parameterization, the time-scaling transformation, and an exact penalty method, for determining the optimal piecewise constant input signals for the original hybrid system. A numerical example on cancer chemotherapy is included to demonstrate the effectiveness of the proposed algorithm.     

A hierarchical framework for statistical model calibration in engineering product development

As the role of computational models has increased, the accuracy of computational results has been of great concern to engineering decision-makers. To address a growing concern about the predictive capability of the computational models, this paper proposes a hierarchical model calibration procedure with a statistical model calibration technique. The procedure consists of two activities: (1) calibration planning (top-down) and (2) calibration execution (bottom-up). In the calibration planning activity, engineers define either physics-of-failure (PoF) mechanisms or system performances of interest. Then, an engineered system can be decomposed into subsystems or components of which computational models are better understood in terms of PoF mechanisms or system performances of interest. The calibration planning activity identifies vital tests and predictive models along with both known and unknown model input variable(s). The calibration execution activity takes a bottom-up approach, which systematically improves the predictive capability of the computational models from the lowest level to the highest using the statistical calibration technique. This technique compares the observed test results with the predicted results from the computational model. A likelihood function is used for the comparison metric. In the statistical calibration, an optimization technique is integrated with the eigenvector dimension reduction (EDR) method to maximize the likelihood function while determining the unknown model variables. As the predictive capability of a computational model at a lower hierarchy level is improved, this enhanced model can be fused into the model at a higher hierarchical level. The calibration execution activity is then continued for the model at the higher hierarchical level. A cellular phone is used to demonstrate the hierarchical calibration framework of the computational models presented in this paper. It is concluded that the proposed hierarchical model calibration can effectively enhance the ability of the computational model to predict the system reliability of the cellular phone system.     

Stability analysis and non-linear behaviour of structural systems using the complex non-linear modal analysis (CNLMA)

Herein, a novel non-linear procedure for producing non-linear behaviour and stable limit cycle amplitudes of non-linear systems subjected to super-critical Hopf bifurcation point is presented. This approach, called Complex Non-Linear Modal Analysis (CNLMA), makes use of the non-linear unstable mode which governs the non-linear dynamic of structural systems in unstable areas. In this study, the computational methodology of CNLMA is presented for the systematic estimation of the non-linear behavior of structural system, and it is applied to a complex system with quadratic and cubic non-linearities. Results from this non-linear method are compared with results obtained by integrating the full original non-linear system. This procedure appears very interesting in regard to computational time, formulation, and also necessitates very few computer resources. Thus the CNLMA is suited to computational implementation for various complex non-linear system with many degrees-of-freedom.     

Fitness function shaping in multiagent cooperative coevolutionary algorithms

Coevolution is a promising approach to evolve teams of agents which must cooperate to achieve some system objective. However, in many coevolutionary approaches, credit assignment is often subjective and context dependent, as the fitness of an individual agent strongly depends on the actions of the agents with which it collaborates. In order to alleviate this problem, we introduce a cooperative coevolutionary algorithm which biases the evolutionary search as well as shapes agent fitness functions to promote behavior that benefits the system-level performance. More specifically, we bias the search using a hall of fame approximation of optimal collaborators, and shape the agent fitness using the difference evaluation function. Our results show that shaping agent fitness with the difference evaluation improves system performance by up to 50 %, and adding an additional fitness bias improves performance by up to 75 % in our experiments. Finally, an analysis of system performance as a function of computational cost demonstrates that this algorithm makes extremely efficient use of computational resources, having a higher performance as a function of computational cost than any other algorithm tested.     

A computational method for optimizing the hierarchy and spatial configuration of successively inclusive facilities on a continuous plane

This paper shows a computational method for optimizing a system of successively inclusive hierarchical facilities (a system in which the services provided by a certain rank of facilities include all services provided by lower rank facilities) on a continuous plane. The system is optimized with respect to not only the configuration of ranked facilities, but also its hierarchical structure (i.e. the composition of the number of ranks and the numbers of ranked facilities). The optimization procedure has two steps. The first step optimizes a system of exclusive hierarchical facilities by an analytical method. Using this optimal solution, the second step optimizes a system of successively inclusive hierarchical facilities by a computational search method. Numerical experiments show that the proposed method tends to reach a near optimal solution within a few iterations.     

带有时变计算时延的倒立摆视觉实时控制研究

针对倒立摆视觉实时控制系统中,通过每帧图像处理检测小车位移和摆杆偏角带来的时变图像处理计算时间,直接影响控制系统采样周期和系统性能的问题,不同于目前不考虑图像处理计算时间或将其视为定时滞进行倒立摆视觉实时控制的研究方法,本文首先构建了倒立摆视觉伺服控制实验平台,考虑倒立摆的小车与摆杆特征,提出了小车位移和摆杆偏角的实时计算方法;然后统计分析了图像处理计算时间的特性并设计了视觉传感事件触发采样策略,进一步刻画了时变时延与计算时间的直接关系,进而建立了带有时变计算时延的倒立摆视觉控制系统闭环模型,证明了系统稳定性并建立了反映图像处理计算时间与系统稳定性之间的关系.最后,仿真和实时控制实验验证了所提方法的可行性和有效性.     

From Watson-Crick L systems to Darwinian P systems

Watson-Crick L systems are language generating devices making use ofWatson-Crick complementarity, a fundamental concept of DNA computing.These devices are Lindenmayer systems enriched with a trigger forcomplementarity transition: if a ``bad' string is obtained, then thederivation continues with its complement which is always a ``good'string. Membrane systems or P systems are distributed parallel computingmodels which were abstracted from the structure and the way offunctioning of living cells. In this paper, we first interpret theresults known about the computational completeness of Watson-Crick E0Lsystems in terms of membrane systems, then we introduce a related way ofcontrolling the evolution in P systems, by using the triggers not in theoperational manner (i.e., turning to the complement in a ``bad'configuration), but in a ``Darwinian' sense: if a ``bad' configurationis reached, then the system ``dies', that is, no result is obtained.The triggers (actually, the checkers) are given as finite state multisetautomata. We investigate the computational power of these P systems.Their computational completeness is proved, even for systems withnon-cooperative rules, working in the non-synchronized way, andcontrolled by only two finite state checkers; if the systems work in thesynchronized mode, then one checker for each system suffices to obtainthe computational completeness.     

Estimation of dynamical characteristics of a parallel program on a model

This paper considers a model of a parallel program that can efficiently be interpreted on an instrumental computer, providing a means for a sufficiently accurate prediction of the actual time needed for execution of the parallel program on a given parallel computational system. The model is designed for parallel programs with explicit message passing written in Java with calls to the MPI library and is a part of the ParJava environment. The model is obtained by transforming the program control tree, which, for Java programs, can be constructed by modifying the abstract syntax tree. The communication functions are simulated on the basis of the LogGP model, which makes it possible to take into account specific features of the distributed computational system.     

多体系统传递矩阵法不须进行违约修正的验证

对一含有完整约束的多体系统在平面、空间中的运动规律进行了计算机仿真研究,采用通常动力学方法,以卡尔丹角作为位置角建立和求解动力学方程,并对进行和不进行违约修正的仿真结果进行了比较,然后采用多体系统离散时间传递矩阵法进行了计算机仿真,仿真结果表明多体系统传递矩阵法在不进行违约修正的情况下,仍能保证完整约束不被违反与通常动力学方法相比,多体系统传递矩阵法不需进行违约修正。     

Recursion Hypothesis Considered as a Research Program for Cognitive Science

Humans grasp discrete infinities within several cognitive domains, such as in language, thought, social cognition and tool-making. It is sometimes suggested that any such generative ability is based on a computational system processing hierarchical and recursive mental representations. One view concerning such generativity has been that each of the mind’s modules defining a cognitive domain implements its own recursive computational system. In this paper recent evidence to the contrary is reviewed and it is proposed that there is only one supramodal computational system with recursion in the human mind. A recursion thesis is defined, according to which the hominin cognitive evolution is constituted by a recent punctuated genetic mutation that installed the general, supramodal capacity for recursion into the human nervous system on top of the existing, evolutionarily older cognitive structures, and it is argued on the basis of empirical evidence and theoretical considerations that the recursion thesis constitutes a plausible research program for cognitive science.     

A Cascade Framework for a Real-Time Statistical Plate Recognition System

This paper describes a plate recognition system that can process images rapidly at high accuracy rates. This system is designed to meet the requirements of performance, computational speed, and adaptation for vehicle surveillance applications, such as stolen car detection systems. These requirements are satisfied by adopting a cascade framework, utilizing plate characteristics, and developing fast one-pass algorithms. Our system is composed of three main cascading modules for plate detection, character segmentation, and postprocessing. Each module is further decomposed into several cascading procedures, which are composed of successively more complex rejecters. The first module rapidly rejects a majority of nonplate regions by using low computational gradient features and a one-pass scanning algorithm followed by heavy computational statistical rejecters. The second module rejects a majority of noncharacter regions in a similar manner. A peak-valley analysis algorithm is proposed to rapidly detect all promising candidates of character regions. The third module eliminates the plate characters that do not satisfy the plate specifications. In our experiments, the system can recognize plates over 38 frames per second with a resolution of 640 times 480 pixels on a 3-GHz Intel Pentium 4 personal computer     

基于剩余计算能力的动态负载均衡系统

基于剩余计算能力的动态负载均衡系统是一种基于新型负载向量的动态负载均衡系统。该系统使用一种新的负载评价指标：剩余计算能力,它兼顾节点的资源使用情况及节点本身的性能特征两个方面,更好地体现了集群系统的处理能力和系统正在处理的负载情况,比常用的其它负载向量更加灵活、准确。系统还将任务调度和进程迁移结合起来,以达到更有效的系统负载均衡,同时,也减小系统负载均衡带来的额外开销。     

计算反射性ICAI模型

智能计算机辅助教学（ＩＣＡＩ）系统是一个综合多领域知识的复杂的知识系统．理想的ＩＣＡＩ应具有强的自适应性以实现个别化教育的目的．计算反射是指能因果关联地对自身进行处理的一种计算行为．本文从计算反射的基本思想出发，讨论了知识系统中计算反射的基本模型，进而推广到ＩＣＡＩ系统的设计中，提出了将教师实体和学生实体作为“自身”的反射性的ＩＣＡＩ系统的初步模型．各知识实体均由对象层和反射层组成，在不同层次上依赖不同的知识源完成不同性质的任务．