基于2-可加模糊测度的NPD项目复杂性评价

针对NPD项目复杂性各因素间具有的关联性以及传统评价方法的局限性,提出一种基于关联多属性的2-可加模糊测度方法来对NPD项目复杂性进行评价。在界定项目复杂性内涵的基础上,从产品复杂性、环境复杂性、组织复杂性和技术复杂性四个方面构建了NPD项目复杂性评价指标体系。从模糊测度、默比乌斯变换和交互作用系数间的转化关系出发,基于最大Marichal熵原则,提出了一种确定2-可加模糊测度值的新方法。利用Choquet积分作为集结算子,自下而上计算各候选方案的综合评价值。最后,通过具体算例说明了该方法的可行性和有效性。     

一类具脉冲效应的三种群捕食系统的动力学性质

基于综合害虫管理,提出并研究了一类具有脉冲效应和Holling Ⅱ类功能反应的两个捕食者一个食饵系统.利用脉冲微分方程的Floquet理论和比较定理,得到了系统灭绝和持续生存的充分条件.最后,简要讨论了该综合害虫管理策略的有效性及系统在周期脉冲扰动下的动力复杂性.     

挣值法的参数扩展与修正研究

传统挣值法基于确定性与稳定性的项目基准计划,仅考虑和集成了项目时间与项目成本两个参数(要素),忽略了货币的时间价值.针对这些不足,对其进行参数扩展和相关的修正:运用蒙特卡罗法制定具有不确定性的项目的基准计划,考虑和集成了项目范围与项目质量两个参数,将时间因素引入成本度量中.在此基础上,提出和定义了挣值法的有关指标,以期提高挣值法的集成度和准确度.     

高阶特征线性及其与semi-Lagrangian方法的比较

特征线性与semi-Lagrangian方法都是处理流体方程时间离散的两种有效的方法．它们比经典的半隐格式，如Backward-Euler／Adams-Bashforth方法有更好的稳定性．本提出一种基于高阶空间离散的特征线法，通过稳定性，精度和计算复杂性与semi-Lagrangian方法进行比较，分析了高阶特征线法的有效性和适用性，并从数值试验上对分析结果进行验证．     

资源有限网络计划启发式方法的评价（上）：理论分析与试验设计

在对网络计划问题分析的基础上,提出了两个衡量资源约束网络计划问题复杂性特征的度量指标-网络复杂性系数CNC及有资源约束网络的复杂性系数CRNC,并基于此设计了一种产生给定网络复杂性要求的随机活动网络发生器GRAN,最后针对资源约束的网络计划问题设计了一种评价与分析其启发式算法效果的试验模型。     

耦合AF-SVR的短时交通流量预测模型

交通流量预测是城市智能交通系统的重要研究内容之一,是缓解城市拥堵、实现智能交通管理和建设智慧城市的前提,基于短时交通流量的复杂性及非线性等特点,提出耦合AF-SVR的短时交通流量预测模型.模型结合了鱼群算法较好的并行搜索性能和支持向量回归机较好的非线性拟合能力,利用该模型对短时交通流量数据进行仿真实验,结果表明:模型较BP神经网络预测模型具有较高的预测精度,是短时交通流预测的一种有效方法.     

基于关键链方法的多项目共享人力资源均衡问题及其遗传算法

通过对多项目管理瓶颈的分析,结合关键链方法,设置了瓶颈缓冲,建立了基于关键链方法的多项目管理,为多项目管理提供了一种新的管理方法.将基于关键链方法的多项目管理方法应用于并行多项目共享人力资源冲突管理,建立了基于遗传算法的多项目共享人力资源均衡模型,为缓解多项目共享人力资源供求矛盾提供了一种具体的量化管理方法,并进行了算例分析,证明了模型的有效性、实用性.     

关于并行计算中的等价性定理与Toeplitz三对角方程组的并行解

一、关于L.Csanky的等价性定理 1976年,L.Csanky发表了并行计算中的重要理论结果。这一结论指出,对阵列式理论模型,求解线性代数方程组、矩阵求逆、行列式求值和求矩阵的特征多项式,在并行时间复杂性上是等价的。Csanky还给出了N阶矩阵求逆的两种O(log_2~2N)算法,使用的处理机台数分别为O(N~5)和O(N~4)。在这之前,所有求逆算法的并行步数不低于O(N)。Wang Guo-rong等已给出了求广义逆A~ 和A_(MN)~ 的一种复杂性相当的并行算法,并建     

高校科研微观管理系统研究

本文以高校科研过程和科研管理过程并行运作为事实基础，以系统论中的耦合性、整体性和层次性为方法和手段，探讨了高校科研管理运行机制与体制，并提出若干高校科研管理策略构想。     

定理机械化证明的数值并行法及单点例证法原理概述

本文浅近地介绍以检验数值实例为基本手段的两种方法——洪加威提出单点例证法和张景中.杨路提出的数值并行法以及这两种方法与吴文俊数学机械化理论的关系.     

A model for a widespread implementation of inquiry-based learning

Innovative teaching practices such as inquiry-based learning (IBL) have long been topics of discussion amongst mathematics and science educators. However, it is not easy to change day-to-day teaching on a large scale. The relevant question of how to promote a widespread uptake of IBL in day-to-day teaching therefore needs more consideration. In order to ensure such uptake of IBL in a variety of different contexts, a model including dissemination and implementation strategies needs to be designed. In this paper, we present the design of a focused and flexible model for dissemination and implementation as developed within the international project PRIMAS, funded by the EU under Framework 7. The design of this model is rooted in design research. We will outline and explain the complexity of the model, including its theoretical basis, its iterative approach for evaluation and refinement, and its intended contributions to research.     

Parallel algebraic hybrid solvers for large 3D convection-diffusion problems

In this paper we study the parallel scalability of variants of an algebraic additive Schwarz preconditioner for the solution of large three dimensional convection diffusion problems in a non-overlapping domain decomposition framework. To alleviate the computational cost, both in terms of memory and floating-point complexity, we investigate variants based on a sparse approximation or on mixed 32- and 64-bit calculation. The robustness and the scalability of the preconditioners are investigated through extensive parallel experiments on up to 2,000 processors. Their efficiency from a numerical and parallel performance view point are reported. This research activity was partially supported within the framework of the ANR-CIS project Solstice (ANR-06-CIS6- 010).     

基于实物期权定价方法的林业碳汇项目投资决策仿真研究

文章针对林业碳汇项目投资决策的复杂性、动态性和不确定性过程,利用林业—碳汇共同经营决策模型计算林业碳汇项目在投资期内的期望价值,采用实物期权定价方法对不同阶段不同策略下的林业碳汇项目价值进行评估,同时提出了多主体仿真建模方法,利用NetLogo仿真软件对林业碳汇项目投资决策过程进行动态模拟。仿真系统中涉及到的主体有林地、CO₂和投资者,投资者主要是作为观察者的身份,在不同阶段会做出不同的投资策略。模拟仿真三种不同状态下投资者的决策变化:一是传统林业投资动态模拟,不包含碳汇和期权因素动态模拟;二是引入碳汇市场后的林业投资动态模拟;三是引入碳汇市场和期权后林业投资动态模拟。NetLogo仿真分析结果表明引入碳汇市场可以提高投资者的收益并改变投资者的经营策略,同时引入期权,不仅增加了投资者的积极性而进行扩张投资,还可以更好地发挥林木碳汇功能,体现林业的生态价值及经济价值。     

Model and algorithm of the conceptual scheme formation for knowledge domain in distance learning

The article describes a knowledge model, oriented to the asynchronous mode of distance learning. The formalization of the knowledge model for a given domain, the operations on the knowledge and the algorithm of the knowledge model creation are submitted. All received decisions can be realized in a program environment compatible with the SCORM standard. The described methodology, based on a generalized knowledge model, enables to develop a distance learning course mainly for the fundamental knowledge. In this paper we describe the methodology and illustrate its use through a project to develop a distance learning course for a queuing system. Moreover, a practical application is proposed based on the eQuality project.     

面向产品研发任务的知识层次协调模型及仿真研究

从微观视角量化分析产品研发团队中的知识协调过程,可以更为深入地揭示本质性规律.在理论研究基础上,提炼产品研发任务的复杂性,并提出团队学习是实现知识协调的重要方式.将研发任务的完成以相应知识层次的概率密度函数予以表征,并将团队中的个体学习与协同学习表述为对应层次的知识水平增长.从而构建出复杂知识性任务情境下的知识层次协调...     

A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm

In this study, we present a heterogeneous cooperative parallel search that integrates branch-and-bound method and tabu search algorithm. These two algorithms perform searches in parallel and cooperate by asynchronously exchanging information about the best solutions found and new initial solutions for tabu search. The rapid production of a good solution from the tabu search process provides the branch-and-bound process with a better feasible solution to accelerate the elimination of subproblems that do not contain an optimal solution. The new initial solution produced from the subproblem with a least-cost lower bound of the branch-and-bound method suggests the best potential area for tabu search to explore. We use a master-slave model to reduce the complexity of communication and enhance the performance of data exchange. A branch-and-bound process is used as the master process to control the exchange of information and the termination of computation. Several tabu search processes are executed simultaneously as the slave processes and cooperate by asynchronously exchanging information on the best solutions found and the new initial solutions by the master process of branch-and-bound. Based on the computation experiments of solving traveling salesman problems (TSP), the proposed heterogeneous parallel search algorithm outperforms a conventional parallel branch-and-bound method and a conventional parallel tabu search. We also present the computational results showing the efficiency of heterogeneous cooperative parallel search when we use more processors to accelerate search time. Thus, the proposed heterogeneous parallel search algorithm achieves linear accelerations.     

抛物型时间周期问题的Schwarz波形松驰方法

周期稳态是科学和工程系统中一类重要的运行状态,其计算复杂度远高于相应的初值问题,因此有更迫切的并行计算需要.我们提出了计算抛物型方程时间周期解的并行方法—基于区域分解(又称Schwarz方法)的波形松驰方法,该方法只需在子区域上求解较低维的周期问题.我们分析了两种不同的传输条件下方法的收敛性,并用数值实验支持了理论结果.     

基于交互耦合网络的项目组合决策模型研究

随着项目活动进入“大尺度”时代,复杂性成为现代化项目组合管理中的突出问题。在项目组合决策系统复杂性分析基础上,提出了交互耦合网络视角下的项目组合决策系统表征方法;借鉴非线性动力学建模方法构建项目组合决策系统复杂动力网络模型,结合模型的稳定解和稳定条件将项目组合决策系统划分为竞争型、共生型、强依存型和弱依存型,并通过数值仿真方法对系统的稳定域、分岔和混沌进行分析。研究表明,项目组合决策系统的复杂性和稳定性依赖于系统内交互关系作用,改善协作关系,避免过分竞争,以系统整体为先优化配置有利于项目组合目标实现。     

QML-Morven: A novel framework for learning qualitative differential equation models using both symbolic and evolutionary approaches

In this paper, a novel qualitative differential equation model learning (QML) framework named QML-Morven is presented. QML-Morven employs both symbolic and evolutionary approaches as its learning strategies to deal with models of different complexity. Based on this framework, a series of experiments were designed and carried out to: (1) investigate factors that influence the learning precision and minimum data requirement for successful learning; (2) address the scalability issue of QML systems.     

Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be NP-hard. We prove a few dominance properties of optimal solutions of this problem. Their proposal was inspired by the results of some auxiliary computational experiments. Test were performed with the dynamic programming algorithm and list algorithms. Then, we propose the polynomial time approximation scheme, based on structuring problem input. Moreover, we discuss the relationship between the early work criterion and the related late work criterion. We compare the computational complexity and approximability of scheduling problems with both mentioned objective functions.