基于时间Petri网的供应链网络关键路径分析

讨论了供应链网络中如何选择优化路径的问题,提出采用时间P etri网对供应链网络关键路径建模的方法.此方法根据顾客需要货物的情况,有条件地选取供应链网络图中可跨越活动和可替换分支,将网络图分别描述成Ebs图和Ew f图,结合时间P etri网的可达算法,求得Ebs和Ew f的关键路径.通过基本供应链的分析,得到网络的优化路径.     

国内外黄金现货价格联动波动复杂网络拓扑性质

为了研究国内外黄金现货价格联动性波动特征,选取2003年1月1日至2013年9月6日上海黄金交易所Au9999黄金现货收盘价与伦敦标准黄金现货的下午定盘价分别作为国内与国外黄金现货价格的样本数据.依据粗粒化方法,将Au9999与伦敦标准金价格的联动波动转化为由5个{P,O,M}三个字符构成的字符串,每一个字符串代表每5天的黄金现货价格联动波动模态,共产生106个模态.将模态作为节点,模态之间的转化为边,构建国内外黄金现货价格联动性波动复杂网络.对联动性复杂网络的点强度与强度分布、聚集系数、平均路径长度、中介中心性及凝集子群特征进行研究分析.结果表明:点强度值较大的前32个节点累积强度分布达到了92.05%,点强度与度分布、点强度与其等级均呈幂律分布;加权集聚系数与点强度之间并没有表现出良好的相关性,网络中存在14个小群簇;网络平均最短路径长度为7.668;节点中介性差异不太明显,前40个节点对整个网络的中介中心性贡献率为62.29%;8个节点的凝集子群有2个,8个节点以上的子群不存在.从网络结构拓扑性质角度验证了国内外黄金现货价格变化的复杂特征,这些对于掌握国内外黄金价格波动的内在规律和了解价格变化信息有一定指导意义,能够为我国黄金价格制定、风险投资和规避经济风险提供决策参考.     

有理插值中不可达点的研究

通过对一元Thiele型连分式插值和二元Newton-Thiele型混合有理插值中不可达点的分析,给出了一种判断不可达点的方法.而且,对于任意给定的插值条件,通过构造带参数的Thiele型切触插值和二元Newton-Thiele型混合切触有理插值,使得不可达点变成可达点.数值例子也说明了这种方法的有效性.     

基于协整的股票相互依存网络构建及分析北大核心CSCD

基于时间序列的协整检验方法,通过股票时间序列间可能存在的长期均衡相关关系,文章以P值大小确定连边,协整系数作为边的权重,在2014-2018年中国沪深300指数成分股中的交通运输类股票和金融类股票之间构建了有向有权的相互依存网络,其中交通运输类股票和金融类股票各自构建成两个子网.通过对两个子网以及整个网络进行拓扑结构静态统计量的分析和比较发现:因为依赖关系的存在,网络的平均度,平均路径长度和平均聚类系数增加,直径和图密度降低.从而,网络间的联系变得更加紧密,网络内部变得更稀疏,且存在很强的"抱团"趋势,网络稳定性更好.     

基于协整的股票相互依存网络构建及分析

基于时间序列的协整检验方法,通过股票时间序列间可能存在的长期均衡相关关系,文章以P值大小确定连边,协整系数作为边的权重,在2014-2018年中国沪深300指数成分股中的交通运输类股票和金融类股票之间构建了有向有权的相互依存网络,其中交通运输类股票和金融类股票各自构建成两个子网.通过对两个子网以及整个网络进行拓扑结构静态统计量的分析和比较发现:因为依赖关系的存在,网络的平均度,平均路径长度和平均聚类系数增加,直径和图密度降低.从而,网络间的联系变得更加紧密,网络内部变得更稀疏,且存在很强的"抱团"趋势,网络稳定性更好.     

基于网络拓扑结构的重要节点发现算法

复杂网络中的重要节点发现在现实生活中有着广泛的应用价值。传统重要节点发现方法可分为局部发现和全局发现两类算法,全局发现算法中最具代表性的是特征向量中心性算法(Eigenvector Centrality, EC),EC算法将所有节点归为一个社区并利用邻居节点重要性反馈计算节点的影响力大小,具有较高的计算效率和识别精度。但是,EC算法忽略了网络的拓扑结构,未考虑到真实网络中节点所在社区的结构特征。为此,本文提出一种基于网络拓扑结构的可达中心性算法(Accessibility Centrality, AC),首先利用邻接矩阵作为反馈路径,在反馈过程中计算不同路径下的节点整体影响力。同时,利用影响力传递过程中的噪音干扰特性,修正每一路径长度下节点整体影响力大小,最后利用修正结果得到AC值。为评估AC算法,本文利用两种传染病模型模拟节点影响力在四组真实网络中的传播过程,并引入其他四种算法进行对比验证。实验结果表明,与其他算法相比,AC算法可以更准确、有效地识别出有具有影响力的重要节点。     

包含极值点和分枝点的解曲线跟踪算法的摄动解法

本文提出了采用摄动格式求解非线性方程组的解曲线跟踪算法的计算格式.文中着重讨论了解曲线上非正则点的搜索,以及从这些非正则点——转向点或分枝点——继续跟踪超临界平衡路径的计算方法.文中把这一算法应用于弹性薄壳的屈曲分析。通过柱壳和环壳的算例得到它们的整个屈曲过程的平衡路径和变形形态.     

一种基于GIS的选址问题及算法

本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较.     

变测度的积分-水平集确定性算法

提出了一个求总极值的变测度确定性算法,对不同的箱子采用不同的测度,结合确定性数论方法选取一致分布佳点集来代替Monte-Carlo随机投点,使水平值充分地下降,更快地到达全局最小,从而提高算法的计算效率.在文中给出了算法的收敛性证明,并通过数值算例验证了它的有效性.     

基于道路堵塞及顾客时间要求的快件配送最优路径选择

针对道路堵塞如节假日导致的临时最短配送路径失效的问题,提出配送网络最优路径选择模型,并设计了求解快递配送网络关键边和最优路径的算法。首先,计算出整个网络的关键边,掌握配送网络特征;其次,考虑顾客时间要求,研究不完全信息(中断无法提前预知,只有到达中断边的起点处才可知)下的最优路径,根据最短路径上各边新的特点,计算出每条边中断后对应的一组备用路径,再选择运输时间小于或等于顾客可等待时间的路径为有效路径,考虑道路堵塞情况,从有效路径中选择最优路径;最后,结合配送网络的实际情况对最优路径进行了算例分析。     

On the closure of reachable sets for control systems

We prove the existence of a dense subsetD of continuous functions such that, forfD, the reachable set for the control system

Actuator placement based on reachable set optimization for expected disturbance

This paper examines the role of the control objective and the control time in determining fuel-optimal actuator placement for structural control. A general theory is developed that can be easily extended to include alternative performance metrics such as energy and timeoptimal control. The performance metric defines a convex admissible control set which leads to a max-min optimization problem expressing optimal location as a function of initial conditions and control time. A solution procedure based on a nested genetic algorithm is presented and applied to an example problem. Results indicate that the optimal placement varies widely as a function of both control time and disturbance location. An approximate fitness function is presented to alleviate the computational burden associated with finding exact solutions. This function is shown to accurately predict the optimal actuator locations for a 6th-order system, and is further demonstrated on a 12th-order system.This work was supported by the US Department of Energy at Sandia National Laboratories under Contract DE-AC04-76DP00789.     

解释结构模型在专业课程体系结构解析中的应用——以信息管理与信息系统专业为例

以信息管理与信息系统专业为例,引入解释结构模型对专业课程体系结构进行解析,通过设计区域划分算法,对专业课程体系进行子系统划分,从而提炼出若干专业方向;通过设计层级划分算法,并利用其对专业课程体系进行层级划分,形成课程间的衔接关系,为培养方案制订及教学计划优化提供了有力支撑。提出连通度的概念,并利用其筛选核心元素,为主干课程的确定提供了理论依据,通过子系统划分、层级划分及主干课程确定,建立了专业课程体系的多级递阶结构,为专业课程体系解析提供了方法指导。     

控制系统中的分形

本文将整数维与分形的Hausdorff测度引入并应用于控制系统,同时也介绍了准自相似集这个新概念,证明了这种集合的存在性与唯一性.并将计算自相似集维数的公式推广到准自相似集,在此基础上,说明了控制系统的可达集可以具有分数维.表明在分析非线性系统可控性与可观性时,分形几何学也将是一种有意义的工具.     

Approximate controllability for trajectories of a delay Volterra control system

For the abstract delay Volterra control system,

On the boundedness of outer polyhedral estimates for reachable sets of linear systems

New properties of outer polyhedral (parallelepipedal) estimates for reachable sets of linear differential systems are studied. For systems with a stable matrix, it is determined what the orientation matrices are for which the estimates possessing the generalized semigroup property are bounded/unbounded on an infinite time interval. In particular, criteria are found (formulated in terms of the eigenvalues of the system’s matrix and the properties of bounding sets) that guarantee for previously mentioned tangent estimates and estimates with a constant orientation matrix that either there are initial orientation matrices for which the corresponding estimate tubes are bounded or all these tubes are unbounded. For linear stationary systems, a system of ordinary differential equations and algebraic relations is derived that determines estimates with constant orientation matrices for reachable sets that have no generalized semigroup property but are tangent and also bounded if the matrix of the system is stable.     

The concept of hyperellipticity on surfaces with nodes

A surface with nodes X is hyperelliptic if there exists an involution such that the genus of X/〈h〉 is 0. We prove that this definition is equivalent, as in the category of surfaces without nodes, to the existence of a degree 2 morphism satisfying an additional condition where the genus of Y is 0. Other question is if the hyperelliptic involution is unique or not. We shall prove that the hyperelliptic involution is unique in the case of stable Riemann surfaces but is not unique in the case of Klein surfaces with nodes. Finally, we shall prove that a complex double of a hyperelliptic Klein surface with nodes could not be hyperelliptic.     

Ellipsoidal Bounds on Reachable Sets of Dynamical Systems with Matrices Subjected to Uncertain Perturbations1

Linear dynamical systems described by finite-difference or ordinary differential equations are considered. The matrix of the system is uncertain or subject to disturbances, and only the bounds on admissible perturbations of the matrix are known. Outer ellipsoidal estimates of reachable sets of the system are obtained and equations describing the evolution of the approximating ellipsoids are derived. An example is presented.     

Extreme points, support points and the Loewner variation in several complex variables

In this paper we consider extreme points and support points for compact subclasses of normalized biholomorphic mappings of the Euclidean unit ball Bn in Cn. We consider the class S0(Bn) of biholomorphic mappings on Bn which have parametric representation, i.e., they are the initial elements f (·, 0) of a Loewner chain f (z, t) = etz + ··· such that {e-tf (·, t)}t 0 is a normal family on Bn. We show that if f (·, 0) is an extreme point (respectively a support point) of S0(Bn), then e-tf (·, t) is an extreme point of S0(Bn) for t 0 (respectively a support point of S0(Bn) for t ∈[0, t0] and some t0 > 0). This is a generalization to the n-dimensional case of work due to Pell. Also, we prove analogous results for mappings which belong to S0(Bn) and which are bounded in the norm by a fixed constant. We relate the study of this class to reachable sets in control theory generalizing work of Roth. Finally we consider extreme points and support points for biholomorphic mappings of Bn generated by using extension operators that preserve Loewner chains.     

Triple integral approach to reachable set bounding for linear singular systems with time‐varying delay

This paper is concerned with the reachable set estimation problem of singular systems with time‐varying delay and bounded disturbance inputs. Based on a novel Lyapunov–Krasovskii functional that contains four triple integral terms, reciprocally convex approach and free‐weighting matrix method, two sufficient conditions are derived in terms of linear matrix inequalities to guarantee that the reachable set of singular systems with time‐varying delay is bounded by the intersection of ellipsoid. Finally, two numerical examples are given to demonstrate the effectiveness and superiority of the proposed method. Copyright © 2016 John Wiley & Sons, Ltd.