基于员工行为差异的元胞自动机演化模拟与机制设计

提出了企业员工的正行为、零行为和负行为概念,分析了员工中不同行为间的相互影响.对传统元胞自动机方法进行了改进,建立了基于员工传播性和保持性的元胞自动机模型,并对员工不同的初始比例、不同的行为传播性和保持性以及企业不同奖励和惩罚性政策下的员工行为演化进行了模拟,得到了一些合理和有益的结论,并对不同情形下的人员管理提供了针对性建议.     

场馆人员疏散的元胞自动机模拟

在人口密集场所(馆)观众席位区及疏散通道分布模拟图的基础上,应用数据库技术结合元胞自动机模拟了场馆中人员的疏散情况,并针对场馆发生突发事件后,在疏散过程中某个出口堵塞的情形进行了模拟,模拟结果可以记录人员疏散的轨迹,为突发事件发生后人员疏散应急方案提供参考.     

基于元胞自动机理论的孔隙介质渗流的模拟应用

基于元胞自动机理论,建立了四方形网格元胞空间和摩尔型元胞邻居为类型的时空动态演化模型,并设计了模拟流程.利用两点分布表征岩石骨架和孔隙空间的非均匀分布,设定了可表征流体在多孔介质中渗流的演化规则,对二维和三维岩石多孔介质流体渗流的元胞矩阵进行了模拟,分析得到了两点分布不同概率对渗流数学参数的影响,分析了不同注入方式对流体最终占据孔隙空间的分布形态的影响,注入方式包括点注入、线注入和面注入,最终对真实CT扫描的数字二维岩心进行了流体渗流过程模拟.基于以上的研究,为流体在多孔介质中渗流模拟提供了有效的方法.     

基于元胞自动机的供需网企业合作驱动建模与仿真

针对供需网企业合作驱动具有一定的复杂性这一现状,基于元胞自动机模型对三种状态的节点交互及供需网系统合作演变过程进行仿真,探讨了不同驱动作用下供需网企业合作行为的演化趋势。研究结果表明:供需网企业合作行为演化存在供需质交互频率阈值,当交互频率大于该阈值时,企业合作数量较高且会稳定在某一水平;提高企业的多功能合作执行力、外部力量等可以增加企业合作规模和数量,进而可以促进合作子系统的形成和合作平台的构建。     

胞腔代数和仿射胞腔代数简介

表示论中一个最基本的问题是确定不可约表示的参数集,这个问题至今没有完全解决.对于Graham和Lehrer引入的有限维胞腔代数,这个问题得到了完满解答,并被成功地应用于数学和物理中出现的许多代数.近来,人们引入仿射胞腔代数,将Graham和Lehrer有限维胞腔代数的表示理论框架推广到一类无限维代数上.仿射胞腔代数不仅包括有限维胞腔代数,也包括无限维的仿射Temperley-Lieb代数和Lusztig的A-型仿射Hecke代数.本文将对胞腔代数的发展历史和主要研究成果做一些综述,同时,对新引入的仿射胞腔代数及其最新成果做一点简介.     

Cellular generators

The aim of this paper is twofold. On the one hand, we show that the kernel of the Bousfield periodization functor is cellularly generated by a space , i.e., we construct a space such that the smallest closed class containing is exactly . On the other hand, we show that the partial order is a complete lattice, where if . Finally, as a corollary we obtain Bousfield's theorem, which states that )$"> is a complete lattice, where A$"> if .

     

Cellular categories

We study locally presentable categories equipped with a cofibrantly generated weak factorization system. Our main result is that these categories are closed under 2-limits, in particular under pseudopullbacks. We give applications to deconstructible classes in Grothendieck categories. We discuss pseudopullbacks of combinatorial model categories.     

Permutation Cellular Automata

Permutation cellular automata are cellular automata defined by using finite maximal prefix codes. The overall dynamics of onesided and twosided permutation cellular automata is studied. For some classes of permutation cellular automata including the class of those defined by using finite maximal bifix codes, the overall dynamics is completely or partially described in terms of the codes used to define them.     

“饥饿营销”策略产品投放效果的元胞自动机模拟

"饥饿营销"作为一种新的营销方式,得到很多企业的青睐和使用,有的企业取得了成功,也有很多的企业以失败而告终,建立了一个元胞自动机模型:从微观角度对"饥饿营销"策略产品投放效果进行模拟研究,通过模拟实验,分析了广告强度、用户临界效用时长和市场规模对产品投放的影响,并对产品投放进行了定量的分析,为企业在实施"饥饿营销"策略时的产品投放给予建议.     

Partition Algebras are Cellular

The partition algebra P(q) is a generalization both of the Brauer algebra and the Temperley–Lieb algebra for q-state n-site Potts models, underpining their transfer matrix formulation on the arbitrary transverse lattices. We prove that for arbitrary field k and any element q k the partition algebra P(q) is always cellular in the sense of Graham and Lehrer. Thus the representation theory of P(q) can be determined by applying the developed general representation theory on cellular algebras and symmetric groups. Our result also provides an explicit structure of P(q) for arbitrary field and implies the well-known fact that the Brauer algebra D(q) and the Temperley–Lieb algebra TL(q) are cellular.     

On Primitive Cellular Algebras

First we define and study the exponentiation of a cellular algebra by a permutation group that is similar to the corresponding operation (the wreath product in primitive action) in permutation group theory. Necessary and sufficient conditions for the resulting cellular algebra to be primitive and Schurian are given. This enables us to construct infinite series of primitive non-Schurian algebras. Also we define and study, for cellular algebras, the notion of a base, which is similar to that for permutation groups. We present an upper bound for the size of an irredundant base of a primitive cellular algebra in terms of the parameters of its standard representation. This produces new upper bounds for the order of the automorphism group of such an algebra and in particular for the order of a primitive permutation group. Finally, we generalize to 2-closed primitive algebras some classical theorems for primitive groups and show that the hypothesis for a primitive algebra to be 2-closed is essential. Bibliography: 16 titles.     

Cellular covers of groups

In this paper we discuss the concept of cellular cover for groups, especially nilpotent and finite groups. A cellular cover is a group homomorphism c:G→M such that composition with c induces an isomorphism of sets between and . An interesting example is when G is the universal central extension of the perfect group M. This concept originates in algebraic topology and homological algebra, where it is related to the study of localizations of spaces and other objects. As explained below, it is closely related to the concept of cellular approximation of any group by a given fixed group. We are particularly interested in properties of M that are inherited by G, and in some cases by properties of the kernel of the map c.     

Cellular automata can generate fractals

Let L be the transition rule of a cellular automaton which is linear modulo 2. Associated to L there is defined a compact subspace of Euclidean space related to the behavior of L under iteration. It is seen that this subspace can have fractional Hausdorff dimension.     

Cellular Structure of q-Brauer Algebras

Let R be a commutative noetherian domain. The q-Brauer algebras over R are shown to be cellular algebras in the sense of Graham and Lehrer. In particular, they are iterated inflations of Hecke algebras of type A. When R is a field of arbitrary characteristic, we determine for which parameters the q-Brauer algebras are quasi-hereditary. Then, using the general theory of cellular algebras we parametrize all irreducible representations of q-Brauer algebras.     

Cellular Covers of Local Groups

We prove that, in the category of groups, the composition of a cellularization and a localization functor need not be idempotent. This provides a negative answer to a question of Emmanuel Dror Farjoun.     

Perfect Matchings of Cellular Graphs

We introduce a family of graphs, called cellular, and consider the problem of enumerating their perfect matchings. We prove that the number of perfect matchings of a cellular graph equals a power of 2 times the number of perfect matchings of a certain subgraph, called the core of the graph. This yields, as a special case, a new proof of the fact that the Aztec diamond graph of order n introduced by Elkies, Kuperberg, Larsen and Propp has exactly 2 ^n(n+1)/2 perfect matchings. As further applications, we prove a recurrence for the number of perfect matchings of certain cellular graphs indexed by partitions, and we enumerate the perfect matchings of two other families of graphs called Aztec rectangles and Aztec triangles.