大型超市防盗优化策略研究

考虑了如何从选择恰当的人数和合适的设施布置两方面出发来增强超市的‘防盗’性能,以综合经济效益最佳为优化目标,给出了组合优化的数学模型,对大型超市和连锁超市具有较高的使用价值.     

连锁超市供应链风险评价模型及实证研究

随着经济的飞速发展,供应链风险管理问题越来越受到企业的重视．但国内外还缺乏对连锁超市供应链风险的深入研究．事实上,很多连锁超市的供应链上很多环节并不完善．本文分析了连锁超市供应链上所面临的风险,构建了连锁超市供应链风险评价模型,以某连锁超市为例,通过调查问卷与所得数据,并利用熵权法确定了各指标的权重,最后基于模糊综合评价法得出的结果,提出了降低连锁超市供应链风险的对策建议．     

基于双边市场理论的金融超市竞争定价策略研究

基于双边市场理论,重点分析金融超市在双寡头垄断情形下的竞争定价策略。即在在一般定价模型的基础上,构建起加入金融超市双边用户交易次数为歧视标准的价格歧视竞争模型。并且围绕金融超市追求长期利益和短期利益两种不同动机,对采取该策略均衡时最终用户的均衡进入价格、金融超市利润和市场份额进行比较分析。最后,给出金融超市实施价格歧视策略的对策和建议。     

基于微分博弈的二级猪肉供应链质量行为协调机制研究

运用微分博弈方法研究了由单一生猪屠宰加工企业和单一超市构成的二级猪肉供应链质量行为协调机制。首先考察并比较了Nash非合作博弈、Stackelberg主从博弈以及协同合作博弈情形下屠宰加工企业和超市的最优质量行为决策,研究结果表明协同合作决策模式下,屠宰加工企业和超市的质量行为以及猪肉供应链总体利润均严格优于在非合作决策模式下的相应值。然后导出了能够使屠宰加工企业和超市的个体利润达到帕累托最优,进而实现双方质量行为协调的供应链总体利润分配系数的取值范围。     

超市模型的实时动态控制及其数值分析

超市模型是针对大型并行排队网络所进行的 实时动态控制的随机负载平衡策略, 它在计算机网络、云计算、制造系统、交通网络等领域有着重要的实际应用价值. 本文考虑了超市模型中的若干重要问题: 实时动态控制模式; 效率比较; 平均场黑洞; 马氏变动环境; 稳定性; 固定点; 系统性能评价等等. 同时, 本文也通过数值算例研究了上述重要问题, 包括对顾客加入最短队列的超市模型与服务台服务最长队列的超市模型进行了性能比较, 给出了他们效率的优劣分析; 在超市模型中对控制到达过程机制进行了三种情况的对比; 对马氏变动环境下的超市模型进行了性能评价.     

超市配送中心库存策略SD模型研究与分析

超市配送中心库存策略的确定是实现零售商零库存的一种重要方法.运用系统动力学方法分析了配送中心与超市库存系统,结合系统动力学建模工具VEN S IM软件的使用,建立了配送中心与超市库存系统动力学模型,对该模型进行了运行及结果分析.     

零售连锁超市经营绩效影响因素的模糊聚类分析——以山西省太原地区为例

运营绩效既反映零售连锁超市现实竞争力,更影响企业长远发展,因此识别影响零售连锁超市经营绩效的关键因素具有重要意义.在调研访谈基础上从企业运营角度构建了零售连锁超市绩效影响因素集,使用模糊聚类分析工具,实现了对这些影响因素的主从排序,找到了影响零售连锁超市日常运营绩效的核心因素,并对这些因素进行了针对性分析.最后以山西太原地区为例进行了实例研究.     

考虑参考质量效应的“农超对接”供应链动态质量改进策略

在“农超对接”背景下,以“农村合作社+超市”组成的二级供应链为研究对象,考虑消费者参考质量效应对需求的影响,利用微分博弈理论分别求得了成本分担契约、非合作以及集中决策三种情形下供应链双方的最优均衡策略及利润。研究发现:消费者参考质量效应能够激励农村合作社提高农产品质量水平,同时缓解了超市的广告宣传压力,使得超市的广告宣传水平降低;当商誉-参考质量转换程度较大时,决策者会选择以低商誉战略来维持消费者合理的农产品质量期望值,形成了农产品质量低,成员收入少的不良经营环境;成本分担契约不仅提升了农产品质量水平,同时也实现了超市和农村合作社双方利润的帕累托改善,能够缓解超市面对劣质农产品束手无策的不良局面。     

新零售背景下生鲜超市的演化博弈分析

本文聚焦当前新零售背景下生鲜超市的竞争态势,借助于演化博弈这一研究工具,基于经济学原理构建了生鲜电商切入线下生鲜超市以后,与传统生鲜超市为竞争生存空间而形成的演化博弈模型,通过模型分析探讨这一演化过程中的演化逻辑,发现其中的演化规律及关键影响因素。研究认为,虽然打着“新零售”旗号的电商平台在切入线下生鲜超市时,通过首选精品化策略可以在初始阶段实现与传统生鲜超市的差异化竞争,但是,双方能否就此达成稳定均衡将会受到多种因素的制约,并可能演化出完全不同的均衡状态;甚至在特定的市场条件下,精品化都未必是生鲜超市的理性选择。     

奥运临时超市选址的优化模型

首先依据问卷调查的数据,分析了年龄结构、购物需求、出行、用餐方式之间的关系,然后进一步用逐步回归方法找出了对顾客消费额影响较大的因素为年龄结构、性别结构.以此为依据测算出20个商区的人流量的百分比分布,其中人流量最大的节点依次为:A6,B6,C4.对于各商区的人流量先折换成实际购物的标准人,然后以此作为超市规模的确定标准建模求解,建立以商业营利最大为目标,超市分布均衡及满足购物需求为约束的整数规划的选址模型,确定了在不同超市规模下,A、B、C三区应拥有的超市个数及各超市的具体所在.     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

泛系分析:数学·方法论·相对论·辩证思维

基于对广义系统、泛导、泛对称、泛箱原理、泛系相对性提出了新的分析模式与新的相对数学化的简化强化的定义,发展了泛系方法论与泛系相对论的框架与理法,具体内容涉及:相对普适的数学化的泛系,200类对偶,对偶转化,泛对称转化,泛系辩证,八畴方法,泛系数学方法,广义量化,逼近转化原则,泛等价定理,供求分析,思维实验,广义灰色系统,等等.     

Transverse compression of PPTA fibers

Results of single transverse compression testing of PPTA and PIPD fibers, using a novel test device, are presented and discussed. In the tests, short lengths of single fibers are compressed between two parallel, stiff platens. The fiber elastic deformation is analyzed as a Hertzian contact problem. The inelastic deformation is analyzed by elastic-plastic FE simulation and by laser-scanning confocal microscopy of the compressed fibers ex post facto. The results obtained are compared to those in the literature and to the theoretical predictions of PPTA fiber transverse elasticity based on PPTA crystal elasticity.Presented at the 11th International Conference on Mechanics of Composite Materials (Riga, June 11–15, 2000).3TEX, Inc. 109, MacKenan Drive, Cary, North Carolina 27511, USA. Published in Mekhanika Kompozitnykh Materialov, Vol. 36, No. 4, pp. 533–544, March–April, 2000.     

并行分批排序综述

并行分批排序起源于半导体芯片制造过程。在并行分批排序中,工件可成批加工,批加工机器最多可同时加工B个工件,批的加工时间为批中所有工件的最大工时。首先根据传统的机器环境和目标函数对并行分批排序已有成果进行分类介绍,主要为单机和平行机的机器环境,以及极小化最大完工时间、极小化总完工时间、极小化最大延迟、极小化误工工件数、极小化总延误和极小化最大延误的目标函数;然后梳理了由基本问题所衍生出来的具有新特点的16类新型并行分批排序,包括差异尺寸工件、多目标、工件加工时间或顺序存在限制、考虑费用和具有特殊机制等情况;最后展望未来的研究方向。     

A double-stage piecewise recursive filter for real-time applications

This paper examines the basic problem of estimating the state of a system described by a set of dynamical equations. The state estimation is performed by means of optimal filtering techniques in which the state observation is given by a set of nonlinear equations.The basic issue encountered in most engineering problems is the availability of more observable information than the processor can effectively process in real-time, while performing full optimal filtering on all available observable data. To alleviate this deficiency, an algorithm is developed in which the rate of information processing is kept at a high value, while the system statistics are evaluated at a much slower rate.The method utilizes a combination of fast and slow filtering loops, in which the observable data are processed at a high rate during the fast loop, while the system error covariance, gain computations, and all other system statistics are processed at a lower rate in the slow loop. Methods are provided to resolve any incompatibility in the system statistics resulting from this fast-loop/slow-loop processing combination.Applications describing problems pertaining to aircraft navigation are presented. Specifically, applications to aircraft navigation through a satellite network are studied. Appropriate simulation results from the above studies are shown.This work was performed under contract with the Department of the Air Force, Space and Missile Organization (SAMSO), Los Angeles, California, Contract No. F04-701-75-C-0180.The authors are indebted to Dr. C. Johnson, GPS System Engineer, Mr. G. Consolver, GPS Software Manager, and Mr. W. Riley, Communications/Navigation Department, Texas Instruments for their continuous encouragement in the course of this work. Also, they are indebted to Major M. Birnbaum, SAMSO, for his constructive criticism on the conceptual design of this work, and to Mr. A. Bierman, Aerospace Corporation, for kindly providing simulation data of aircraft trajectories. Finally, the authors would like to express their gratitude to Dr. N. Carlson, Intermetrics, for valuable consultation during the progress of this work.Portions of this paper were presented by the senior author at the GSP Conference, Plan 76, IEEE Position, Location, and Navigation Symposium, San Diego, California, 1976.     

基于模糊FNN-ELECTRE法的国有商业银行竞争力评价

随着金融业全方位开放,国有商业银行已成为国家经济命脉的核心,其竞争力强弱关系着国家经济的繁荣与衰退。本文基于模糊FNN-ELECTRE方法建立国有商业银行竞争力评价模型,以因素神经网络理论(FNN)与ELECTRE融合方法为基础,以现有商业银行竞争力评价指标为着眼,把国有商业银行竞争力的评价体系从现实竞争力和潜在竞争力两个因素抽取为一级指标,以规模、质量、业务结构、效率、成长性五个因素设为二级指标。从实证的角度对银行A、银行B、银行C、银行D、银行E五大国有银行进行分析验证,对其属性值进行和谐性与非和谐性检验得出,银行B竞争能力最强,银行E竞争能力最弱,五大国有银行均有改进空间。     

区组长为奇素数的自反MD设计

本文利用差方法对自反MD设计SCMD(4mp,p,1)的存在性给出了构造性证明,这里p为奇素数,m为正整数．     

Professor Sun Yongsheng

Sun Yongsheng, professor of mathematics, was born on January 22, 1929, in Wanghaisi Village, Cang County, Hebei Province, China. He died of lung cancer at 23 hour 15 minutes,March 22, 2006 in Beijing.     

Immersive Projection Technology for Visual Data Mining

The PlatoCAVE, the MiniCAVE, and the C2 are immersive stereoscopic projectionbased virtual reality environments oriented toward group interactions. As such they are particularly suited to collaborative efforts in data analysis and visual data mining. In this article, we provide an overview of virtual reality in general, including immersive projection technology, and the use of stereoscopic displays for data visualization. We discuss design considerations for the construction of these immersive environments including one-wall versus four-wall implementations, augmented reality, stereoscopic placement, head tracking, the use of LCD devices, polarized light stereo, voice control, and image synchronization.     

Components of the Fundamental Category II

In this article we carry on the study of the fundamental category (Goubault and Raussen, Dihomotopy as a tool in state space analysis. In: Rajsbaum, S. (ed.) LATIN 2002: Theoretical Informatics. Lecture Notes in Computer Science, vol. 2286, Cancun, Mexico, pp. 16–37, Springer, Berlin Heidelberg New York, 2002; Goubault, Homology, Homotopy Appl., 5(2): 95–136, 2003) of a partially ordered topological space (Nachbin, Topology and Order, Van Nostrand, Princeton, 1965; Johnstone, Stone Spaces, Cambridge University Press, Cambridge, MA, 1982), as arising in e.g. concurrency theory (Fajstrup et al., Theor. Comp. Sci. 357: 241–278, 2006), initiated in (Fajstrup et al., APCS, 12(1): 81–108, 2004). The “algebra” of dipaths modulo dihomotopy (the fundamental category) of such a po-space is essentially finite in a number of situations. We give new definitions of the component category that are more tractable than the one of Fajstrup et al. (APCS, 12(1): 81–108, 2004), as well as give definitions of future and past component categories, related to the past and future models of Grandis (Theory Appl. Categ., 15(4): 95–146, 2005). The component category is defined as a category of fractions, but it can be shown to be equivalent to a quotient category, much easier to portray. A van Kampen theorem is known to be available on fundamental categories (Grandis, Cahiers Topologie Géom. Différentielle Catég., 44: 281–316, 2003; Goubault, Homology, Homotopy Appl., 5(2): 95–136, 2003), we show in this paper a similar theorem for component categories (conjectured in Fajstrup et al. (APCS, 12(1): 81–108, 2004). This proves useful for inductively computing the component category in some circumstances, for instance, in the case of simple PV mutual exclusion models (Goubault and Haucourt, A practical application of geometric semantics to static analysis of concurrent programs. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005 – Concurrency Theory: 16th International Conference, San Francisco, USA, August 23–26. Lecture Notes in Computer Science, vol. 3653, pp. 503–517, Springer, Berlin Heidelberg New York, 2005), corresponding to partially ordered subspaces of R ⁿ minus isothetic hyperrectangles. In this last case again, we conjecture (and give some hints) that component categories enjoy some nice adjunction relations directly with the fundamental category.