面向可选服务的产品服务系统配置研究

可选服务是制造企业继必选服务后获取差异化服务竞争优势的有效手段,类似于必选服务,可选服务模块的设计与选择对产品功效和企业服务成本均有影响。本文运用模糊测度研究产品模块与可选服务模块之间的相关关系,建立客户满意度最大和企业成本最小的多目标优化模型,求解不同相关关系下面向可选服务的产品服务系统配置方案;以某制造企业矿渣立磨机产品模块与可选服务模块配置为例,验证了方法的有效性。研究结果表明:产品模块与可选服务模块的相关关系会影响产品服务系统配置方案,相关关系越强,客户越在意重视度较高模块的质量和功能,市场成本报价越高,可选服务在方案配置过程中越重要。本文为企业提供面向可选服务的产品服务系统配置方案提供借鉴。     

Exact boundary controllability of unsteady flows in a network of open canals

By means of the general results on the exact boundary controllability for quasilinear hyperbolic systems, the author establishes the exact boundary controllability of unsteady flows in both a single open canal and a network of open canals with star configuration respectively. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The configuration polytope of ℓ-line configurations in Steiner triple systems

It has been shown that the number of occurrences of any ℓ-line configuration in a Steiner triple system can be written as a linear combination of the numbers of full m-line configurations for 1 ≤ m ≤ ℓ; full means that every point has degree at least two. More precisely, the coefficients of the linear combination are ratios of polynomials in v, the order of the Steiner triple system. Moreover, the counts of full configurations, together with v, form a linear basis for all of the configuration counts when ℓ ≤ 7. By relaxing the linear integer equalities to fractional inequalities, a configuration polytope is defined that captures all feasible assignments of counts to the full configurations. An effective procedure for determining this polytope is developed and applied when ℓ = 6. Using this, minimum and maximum counts of each configuration are examined, and consequences for the simultaneous avoidance of sets of configurations explored. To Alex Rosa on the Occasion of his Seventieth Birthday     

具有内部构造安全保障体系的冗余机器系统的解的半离散化分析

对具有内部构造安全保障体系的冗余机器系统中的修复率μ(x)用初等阶梯函数方法进行逼近,并给出了系统的半离散化模型,为进一步数值计算打下基础.     

液固耦合系统中液体的有限幅晃动力及晃动力矩

研究弹簧-质量系统与圆柱贮箱类液体有限幅晃动系统间的非线性耦合动力学问题。在建立了六自由度非线性耦合动力学模型的基础上,导出了液体有限幅晃动力和力矩解析表达式。指出在终了构形上积分及压力表达式中的非线性项是有限幅晃动作用力、作用力矩非线性的根源。x、y方向结果之间良好的对称性在很大程度上证明了结果的正确性。通过耦合机理分析可知,这样的理论结果应具有较大的普适性。数值仿真结果与有关实验结果进行了对比。分析认为,在终了构形上求晃动力、晃动力矩较为合理。舍去的高维模态基底及高阶非线性项以及液体晃动阻尼的复杂性是导致偏差的重要原因。     

Computation ofg(1,5; 10)

It is established that the exact covering numberg(1,5; 10) is 102. It is further shown that this configuration is unique. It can be obtained from the unique Steiner systemS(5, 6, 12).     

SQUARE AND RHOMBUS CENTRAL CONFIGURATIONS

In this paper, we consider the flat central configurations of bodies using the characteristic set method. We completely solve two special cases of four planets, namely,the square and the rhombus. For the square case, we obtain that a square is a central configuration only in the case where the masses are equal and there exactly are two different square central configurations determined by the mass and the angular velocity; for the rhombus case, we obtain that if a rhombus is a central configuration, then the masses of the diagonal vertices must be equal. Furthermore, there are two or three or four different rhombus central configurations determined by the masses and the angular velocity.     

Configurations in 4-Cycle Systems

A 4-cycle system of order n, denoted by 4CS(n), exists if and only if n1 (mod 8). There are four configurations which can be formed by two 4-cycles in a 4CS(n). Formulas connecting the number of occurrences of each such configuration in a 4CS(n) are given. The number of occurrences of each configuration is determined completely by the number d of occurrences of the configuration D consisting of two 4-cycles sharing a common diagonal. It is shown that for every n1 (mod 8) there exists a 4CS(n) which avoids the configuration D, i.e. for which d=0. The exact upper bound for d in a 4CS(n) is also determined.Acknowledgments A substantial part of the work forming this paper was done while the first author was visiting the Department of Pure Mathematics of The Open University at Milton Keynes; he thanks the Department for hospitality and the UK EPSRC for financial support (grant number GR/R78282/01). The first author also gratefully acknowledges the support of the Australian Research Council. The fourth author is supported by the VEGA grant 1/0261/03. All the authors thank the referees for their helpful comments.Final version received: November 11, 2003     

Hamiltonian reductions of free particles under polar actions of compact Lie groups

We investigate classical and quantum Hamiltonian reductions of free geodesic systems of complete Riemannian manifolds. We describe the reduced systems under the assumption that the underlying compact symmetry group acts in a polar manner in the sense that there exist regularly embedded, closed, connected submanifolds intersecting all orbits orthogonally in the configuration space. Hyperpolar actions on Lie groups and on symmetric spaces lead to families of integrable systems of the spin Calogero-Sutherland type. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 155, No. 1, pp. 161–176, April, 2008.     

复合结构可修复系统口香糖算子的性质

研究了有15个部件串并联工作的多状态口香糖生产可修复系统.运用C_0半群的理论,证明了系统算子是稠定的预解正算子,得出了系统算子的共轭算子及其定义域,并证明了系统算子的增长界为0.最后运用了预解正算子中共尾的概念及相关理论,证明了系统算子的谱上界也是0.     

面向多阶段任务的武器系统备件优化配置建模

资源优化配置是作战单元维修保障的关键因素.当作战单元执行单阶段任务时,讨论了部件结构为串联系统和k/n系统的任务成功概率建模问题,在此基础上,建立了k/n结构动态变化的多阶段任务系统的任务成功概率模型.在满足系统任务成功概率约束条件下,给出了防空作战单元备件携行量优化模型,并运用边际分析法进行了求解,通过示例表明了模型的正确性.     

RELIABILITY ANALYSIS FOR A REPAIRABLE PARALLEL SYSTEM WITH TIME-VARYING FAILURE RATES

To solve a real problem :how to calculate the reliability of a system with time-varying failure rates in industry systems,this paper studies a model for the load-sharing parallel system with time-varying failure rates,and obtains calculating formulas of reliability and availability of the system by solving differential equations. In this paper, the failure rates are expressed in polynomial configuration. The constant,linear and Weibull failure rate are in their special form. The polynomial failure rates provide flexibility in modeling the practical time-varying failure rates.     

Uniqueness and least energy property for solutions to a strongly coupled elliptic system

For the strongly coupled system of M ≥ 3 competing species:-Δ[(d_i +Σ_(j=1)~Mβ(_i_j)u_j)u_i]=(a_i-b_i)u_i-ku_iΣ_(j≠i)u_j, i=1,..., M,we prove the uniqueness of the limiting configuration as k →∞ under suitable conditions. Moreover,we prove that the limiting configuration minimizes a variational problem associated to the strongly coupled system among the segregated states with the same boundary conditions.     

多星测控调度效能评价指标体系研究

分析了建立多星测控调度问题评价指标体系的工程需求.从测控网管理方的角度,定义了反映测控系统服务能力、利用效率和资源配置合理性的指标;针对航天器拥有方的需求,建立了反映接受测控服务情况和反映航天任务满足程度的指标.通过两大部分指标构建了多星测控调度问题的指标体系.通过算例说明了利用该指标体系进行多星测控系统效能分析的可行性.     

准全息计算模型及其应用

准全息计算模型,是信息系统的定量形式化描述模型,为有效揭示与把握信息系统的结构与功能,及其涌现原理的人工模拟,提供了一种整体思维模式及有效的数学理论基础.模型体现了信息系统演化偶然与必然、确定与随机的统一性,体现了信息系统的自组织性、多维系统参量的互为因果性、目的性及主动性.     

五点八边图的完美T(G)-三元系

设G是Kn的子图.在G的每边外添加一点,将该边扩展为一个3长圈,且所添加的点两两不同,均异于G的诸顶点,这样得到的图形被记为T(G).如果3Kn的边恰好能够分拆成与T(G)同构的一些子图,则称这些子图构成一个n阶的T(G)-三元系.进而,若此分拆的全体内部边又恰构成Kn中全部边的一个分拆,则称这个T(G)-三元系是完美的.对于所有使得完美T(G)-三元系存在的正整数n的集合称为完美T(G)-三元系的存在谱.对于K4的所有子图及K5的7边以下子图G,其完美T(G)-三元系的存在性问题已经在一系列文章中被完全解决.本文将对不含孤立点的全部五点八边图G,确定完美T(G)-三元系的存在谱.     

移动机器人履行系统配置优化研究——基于闭排队网络理论

本文对移动机器人履行系统中货架调度任务的履行过程进行分析,根据机器人在货架装载、搬运、拣选、卸载四个过程的作业特点建立闭排队网络模型。采用近似平均值分析算法求解,实现系统绩效的迅速评估。通过与仿真计算实验的对比证明,模型对系统绩效的评估误差不超过5%。利用闭排队网络模型评估拣选台、机器人利用率和调度任务履行能力,实现对系统设施配置的讨论和优化。研究表明,拣选台均匀分布于仓库较长的两侧能提高系统履行绩效;系统存在最优机器人投放数量使系统整体利用率较高。     

Stability analysis of cyclic switched nonlinear systems via event-triggered method

In this paper, the exponential stability problem is addressed for a class of cyclic switched nonlinear systems with unstable modes. A novel event-triggered cyclic switching scheme (ETCSS) is proposed to generate a cyclic switching signal that exponentially stabilizes the considered system for any given initial configuration. Some easily verifiable stability criteria for switched nonlinear and linear systems are established, and the effects of event parameters on the convergence rate are also analyzed. Different from the existing studies, here the developed switching scheme is not only cyclic but also event-triggered and thereby the switching frequency is relatively low. Finally, a numerical example is given to verify the efficiency of the method.     

Identification of heat transfer dynamics for non-modal analysis of thermoacoustic stability

A systematic approach for non-modal stability analysis of thermoacoustic systems with a localized heat source is proposed. The response of the heat source to flow perturbations is obtained from unsteady computational fluid dynamics combined with correlation-based linear system identification. A model for the complete thermoacoustic system is formulated with a Galerkin expansion technique, where the heat source is included as an acoustically compact element. The eigenvalues of the resulting system are obtained from discretization of the solution operator, the maximum growth factor is estimated from the pseudospectra using Kreiss’ theorem.The approach is illustrated with a simple Rijke tube configuration. Results obtained with a simple “baseline” model for the heat source dynamics based on King’s law - widely used in hot wire anemometry - are compared against the more advanced treatment developed here. Analysis of pseudospectra diagrams shows that the choice of the heat source model does influence the sensitivity of eigenvalues to perturbations and hence the non-normal behavior. The maximum growth factor for the system with the heat source model based on King’s law is more sensitive to changes in the heat source location than the CFD-based heat source model.     

Condorcet winner configurations of linear networks

We consider the problem of locating a fixed number of facilities along a line to serve n players. We model this problem as a cooperative game and assume that any locational configuration can be eventually disrupted through a strict majority of players voting for an alternative configuration. A solution of such a voting location problem is called a Condorcet winner configuration. In this article, we state three necessary and one sufficient condition for a configuration to be a Condorcet winner. Consequently, we propose a fast algorithm which enables us to verify whether a given configuration is a Condorcet winner, and can be efficiently used also for computing the (potentially empty) set of all Condorcet winner configurations.