准确的电网仿真需要使用精确的电力设备模型,以反映电网中发生的最复杂的动态运行状况.传统的方法有时不能精确模拟电力设备的工作过程,即使使用同一种仿真模型,相同类型设备之间的物理差异也会降低整个电网仿真的准确性.一种全新的电力设备仿真方法——基于复值神经网络(CVNN)的建模方法,提供了一种高质量的仿真,它能够精确跟踪电网设备的动态运行状况.该方法的特点是它相对容易对所有电力网络设备建模,包括那些比较独特的设备.通常,电力变压器被看作是电网中的复杂非线性电器设备,它是CVNN的主要建模对象.研究结果表明,基于复值神经网络的电力变压器建模方法在电力工程中的应用是非常有用的方法.

Under the user equilibrium (UE) behavior assumption, the Braess Paradox (BP) and its variations have been well investigated. However, users do not always follow the UE behavior. In reality, there are likely quiet a few non-collaborative Cournot-Nash (CN) players coexisting with UE players in the common traffic network. Users in a CN player are completely collaborative to minimize their total travel cost and users subordinating to different players are perfectly competitive. Considering both UE and CN players in the congested network, it remains unclear that under what conditions the BP will occur. In this paper, the BP occurrence conditions under the UE-CN mixed equilibrium are firstly investigated using the classical Braess network with linear link cost function. Then, the BP conditions are studied to the ordinary grid network with nonlinear link cost function. It is shown that the BP occurrence in the conventional Braess network depends upon the link travel time function parameters and the demand level of users controlled by UE/CN players, and the BP occurs in the grid network only for certain demand combinations of users under one UE player and two CN players. (C) 2016 Elsevier Ltd. All rights reserved.

根据农村医疗卫生服务中心的特点,结合卫生服务人数限制、费用限制、距离限制等决定因素建立了卫生服务中心选址模型,分析了层次分析法及隐枚举法求解医疗卫生服务选址模型的差异性.结果显示:所建立的医疗卫生服务中心选址模型在限制条件下能够最大程度的满足人民群众对卫生服务的需求,且隐枚举法求解0-1整数规划比层次分析更具有可行性与有效性.

目的 了解农村居民对社区卫生服务站的利用现状,探讨影响居民对社区卫生服务站需求的因素,为卫生部门提高农村社区卫生服务质量提供决策参考.方法 2014年3-7月随机抽取某市实施城镇化示范乡镇建设的5个乡镇,以方便抽样的方式选取调查对象面对面调查,变量间相关性采用等级相关分析,因子分析采用主成分分析法提取初始因子,方差最大法进行正交旋转获取新的共性因子,P＜0.05为差异有统计学意义.结果 农村居民对社区卫生服务站的总体利用率偏低,社区卫生服务站的硬件条件、居民健康状况、居民的素质和家庭条件、自付医疗费的数目、就诊的距离这五个方面是影响居民到社区卫生服务站就医的主要因素.结论 围绕农村社区卫生服务站的功能,以主要影响因素为着力点,提高社区卫生服务站利用率,保障农村居民的健康.

目的：：针对农村社区的三级医疗服务体系建设构想，建立了农村卫生服务站点的P-中位层级选址-分配模型。该模型既能科学选址，又能将每个需求点分配给相应的不同层级的医疗单位。在给定资源限量的情况下，最大程度的满足广大群众对卫生服务的需要。

对山东省泰安市城镇化示范的农村卫生服务站点的资源配置效率进行评价,建立了数据包络分析(DEA)—Tobit回归两阶段法模型,并根据评价结果构建多元线性回归模型,分析影响其效率的因素.结果表明,各站点效率得分同该站点所覆盖人群的平均距离、总人数呈现一定的正相关性,而与人均收入具有负相关性.

We determine the exact upper bound of the inefficiency of atomic splittable selfish traffic equilibria with elastic travel demand with and without road pricing. In the previous results, only pseudo-approximation bound were obtained for this case. By comparison, we also conclude that the traffic equilibrium with elastic demand may be worse than the corresponding fixed demand case, which implying that the demands' elastic can have a negative effect on the quality of equilibrium solutions. Finally, we propose a road pricing mechanism. We prove that there are optimal tolls in general network, atomic players and elastic travel demand setting. (C) 2014 Elsevier Ltd. All rights reserved.

基于一种新的宽邻域,提出一个求解半定规划的新的非可行内点算法.在适当的假设条件下,证明了该算法具有较好的迭代复杂界O(√nL),优于目前此类算法的最好的复杂性O(n√nL),等同于可行内点算法.

本文讨论了线性代数教学中科学计算能力培养的重要性，指出了目前线性代数课程教学的不足，并结合实际教学分析了利用MATLAB软件解决线性代数教学中复杂计算的可行性与优势。

In this paper, we extend the Ai–Zhang predictor–corrector method to the class of semidefinite programming. First, we define a new wide neighborhood N(τ,β). Another key ingredient of our method is that we treat the classical Newton direction as the sum of two other directions, corresponding to respectively the negative part and the positive part of the right-hand-side. We prove that, besides the predictor steps, each corrector step also reduces the duality gap by a rate of 1−1O(n). Then the method enjoys the low iteration bound of O(nL), which is better than that of usual wide neighborhood algorithm O(nL), where n is the dimension of the problem and L=(X0)T•S0ϵ with ϵ the required precision and (X0,y0,S0) the initial interior solution.

本文引入了广义Banach框架的概念,研究了该框架所对应的框架算子的特点,利用框架算子给出了一个广义Banach框架判定的充要条件.并且对该框架稳定性进行了研究,推广了Hilbert空间中的广义框架与可测空间上定义的(Ω,μ)框架稳定性的有关结论.

The most literature discuss the question of postgraduates' innovation quality raise,but appraises are the pedagogue must face.Establishes graduate student's innovation quality appraisal target,examines two level of fuzzy synthesis judgment models using the cartel 16pf personality factor,enables the appraisal to have scientifically,is objective,is pointed,by time wooden barrel theory short board lengthen.

In this article we propose a new primal-dual path-following interior point algorithm for second-order cone programming. Each iterate always follows the usual wide neighborhood , it does not necessarily stay within it, but must stay within the wider neighbourhood 𝒩(τ, β). We show that the algorithm has iteration complexity bound which is better than that of usual wide neighbourhood algorithm O(n log ϵ−1), where n is the dimension of the problem, with ϵ the required precision, α ∈ [0, 1] the given constant number and (x 0, s 0) the initial interior solution. It is the best result in regard to the iteration complexity bound in the context of path-following method for second-order cone programming.

研究生创新素质的模糊综合评判中的评判指标确定后,首先涉及到它的权重确定而指标的权重是指标相对重要程度的一种客观度量的反映,指标权重的精确性决定了评判结果的准确性,所以,利用层次分析法和德尔菲法(Delphi)来确定评判指标的权重.

A new smoothing function of the well known Fischer-Burmeister function is given.Based on this new function, a smoothing Newton-type method is proposed for solving secondorder cone programming.At each iteration, the proposed algorithm solves only one system of linear equations and performs only one line search.This algorithm can start from an arbitrary point and it is Q-quadratically convergent under a mild assumption.Numerical results demonstrate the effectiveness of the algorithm.

A large-update primal-dual interior-point algorithm is presented for solving second order cone programming. At each iteration, the iterate is always following the usual wide neighborhood 𝒩_∞^-(τ) , but not necessary staying within it. However, it must stay within a wider neighborhood 𝒩(τ,β) . We show that the method has O(√(r)L) iteration complexity bound which is the best bound of wide neighborhood algorithm for second-order cone programming.

In this article we propose a new class of primal-dual path-following interior-point algorithms for semidefinite programming (SDP). Each iterate always follows the usual wide neighbourhood [image omitted], not necessarily remaining within it, but must stay within the wider neighbourhood [image omitted]. We show that the algorithm has [image omitted] iteration-complexity bound which is better than that of the usual wide neighbourhood algorithm O(nL). It is the best result in regard to iteration-complexity bound in the context of path-following method for SDP.

通过数据包络分析法(DEA)对农村卫生医疗服务网络资源进行分析诊断,提出对资源优化配置的措施。

In this paper we propose a new class of primal-dual path-following interior point algorithms for semidefinite programming. Each iterate is always following the usual wide neighborhood $\mathcal {N}_\infty^-(\tau)$, not necessary stay within it, but must stay within the wider neighborhood $\mathcal{N}(\tau,\beta)$. We show that the algorithm has $O(\sqrt{n}L)$ iteration complexity bound which is better than that of usual wide neighborhood algorithm $O(nL)$. It is the best result in regard the iteration complexity bound in the context of path-following method for semidefinite programming.

随着中国金融市场的开放,由于国际金融环境的不确定性,我国银行业面临的风险加剧,本文根据风险的三个核心指标,建立隶属函数和隶属度的计算方法,用模糊综合评价模型监测我国银行风险。