基于电子商务的集群式供应链跨链库存控制

以电子商务环境下集群式供应链库存控制为对象,建立了时变需求下跨链合作的交叉库存模型,并用H∞控制中抑制外部干扰的对策理论来寻求最优订货策略,以减小库存、订货波动和提高供需网快速响应市场的能力.文中采用对比分析方法分别针对供应链间有合作与无合作情形对模型做了仿真实验,仿真表明,实施H∞控制和交叉紧急库存补充策略可以有效避免货物积压或缺货现象,提高供应链及集群的竞争力.     

线性互补问题的并行多分裂松弛迭代算法

运用矩阵多重分裂理论,同时考虑并行计算与松弛迭代法,得到一类求解线性互补问题的高效数值算法．当问题的系数矩阵为对角元为正的H-矩阵或对称半正定矩阵时,证明了算法的全局收敛性；该算法与已有算法相比,具有计算量小、计算速度快等特点,因而特别适于求解大规模问题．数值试验的结果说明了算法的有效性．     

Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

光互联网的抗毁性设计研究

由于互联网层叠模型中多层都存在重复的保护与恢复机制，致使互联网的实现极其复杂，造成网络传输效率较低，而且拥塞。随着密集波分复用（DWDM）的广泛使用和网络底层性能的大幅度提高，已经不需要再对网络中多层进行重复保护与恢复。在此基础上，采用了未来光互联网3层 (应用层、IP层和光互联层) 协议模型，并对其中的光互联层的保护进行了深入的研究，提出了部分共享备用路径保护(P-SPP)方法。此模型能充分利用IP层电子的灵活恢复机制与光互联层的快速保护与恢复机制，提高光互联网的传输性能，以适应目前高速发展的互联网对传输带宽的要求。     

Normative KGP agents

We extend the logical model of agency known as the KGP model, to support agents with normative concepts, based on the roles an agent plays and the obligations and prohibitions that result from playing these roles. The proposed framework illustrates how the resulting normative concepts, including the roles, can evolve dynamically during the lifetime of the agent. Furthermore, we illustrate how these concepts can be combined with the existing capabilities of KGP agents in order to plan for their goals, react to changes in the environment, and interact with other agents. Our approach gives an executable specification of normative concepts that can be used directly for prototyping applications. Fariba Sadri is a senior lecturer at Imperial College London, from where she received her PhD. Her earlier work concentrated on integrity of deductive databases and temporal reasoning, in particular using the event calculus. In more recent years her work has been on agent technologies and multi-agent systems. She has worked on logic-based agent models, reasoning, dynamic belief revision, and inter-agent communication and negotiation for resources. She was co-awarded an EPSRC grant for research into logic-based multi-agents and was co-investigator in the EU SOCS project. Kostas Stathis is a senior lecturer at Royal Holloway, University of London and he holds a PhD from Imperial College London. His research interests are in the area of computational intelligence in general and in the intersection of computational logic and cognitive systems for social computing applications in particular. His research interests include: representation of human-computer (or computer-computer) interaction as a game; cognitive & autonomous agents; artificial agent societies; agent communication; programmable agents and agent platforms. He is a co-investigator of the EU ArguGRID project and was a co-investigator of the EU SOCS project. Francesca Toni is a senior lecturer at Imperial College London, from where she received her PhD. Her earlier work focused on abductive reasoning. In more recent years, she focused on argumentation, agent models and multi-agent systems. She has worked on computational logic-based agent models, agent reasoning, dynamic belief revision, and inter-agent communication and negotiation for resources. She has been co-ordinator of the EU SOCS project, which developed the KGP model of agency, and is coordinator of the EU ArguGRID project, on the application of argumentative agents within grid systems.     

非齐次微分方程两点边值问题正解的存在性及多重性

本文考虑一类非齐次微分方程的两点边值问题,得到了一些有关其正解存在性与多重性的精确条件．     

闭模糊拟阵模糊基的判定

通过讨论闭模糊拟阵的导出拟阵序列和模糊基的结构,找到了判定闭模糊拟阵的模糊基的一个充要条件。根据此充要条件,给出了从导出拟阵序列得到闭模糊拟阵的模糊基的一种算法。     

Lines Tangent to Four Triangles in Three-Dimensional Space

We investigate the lines tangent to four triangles in R³. By a construction, there can be as many as 62 tangents. We show that there are at most 162 connected components of tangents, and at most 156 if the triangles are disjoint. In addition, if the triangles are in (algebraic) general position, then the number of tangents is finite and it is always even.     

Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations

Summary. We examine the convergence characteristics of iterative methods based on a new preconditioning operator for solving the linear systems arising from discretization and linearization of the steady-state Navier-Stokes equations. With a combination of analytic and empirical results, we study the effects of fundamental parameters on convergence. We demonstrate that the preconditioned problem has an eigenvalue distribution consisting of a tightly clustered set together with a small number of outliers. The structure of these distributions is independent of the discretization mesh size, but the cardinality of the set of outliers increases slowly as the viscosity becomes smaller. These characteristics are directly correlated with the convergence properties of iterative solvers. Received August 5, 2000 / Published online June 20, 2001