Model-driven Enterprise Systems Configuration

Enterprise Systems potentially lead to significant efficiency gains but require a well-conducted configuration process. A promising idea to manage and simplify the configuration process is based on the premise of using reference models for this task. Our paper continues along this idea and delivers a two-fold contribution: first, we present a generic process for the task of model-driven Enterprise Systems configuration including the steps of (a) Specification of configurable reference models, (b) Configuration of configurable reference models, (c) Transformation of configured reference models to regular build time models, (d) Deployment of the generated build time models, (e) Controlling of implementation models to provide input to the configuration, and (f) Consolidation of implementation models to provide input to reference model specification. We discuss inputs and outputs as well as the involvement of different roles and validation mechanisms. Second, we present an instantiation case of this generic process for Enterprise Systems configuration based on Configurable EPCs

Viral Marketing On Configuration Model

We consider propagation of influence on a Configuration Model, where each vertex can be influenced by any of its neighbours but in its turn, it can only influence a random subset of its neighbours. Our (enhanced) model is described by the total degree of the typical vertex, representing the total number of its neighbours and the transmitter degree, representing the number of neighbours it is able to influence. We give a condition involving the joint distribution of these two degrees, which if satisfied would allow with high probability the influence to reach a non-negligible fraction of the vertices, called a big (influenced) component, provided that the source vertex is chosen from a set of good pioneers. We show that asymptotically the big component is essentially the same, regardless of the good pioneer we choose, and we explicitly evaluate the asymptotic relative size of this component. Finally, under some additional technical assumption we calculate the relative size of the set of good pioneers. The main technical tool employed is the "fluid limit" analysis of the joint exploration of the configuration model and the propagation of the influence up to the time when a big influenced component is completed. This method was introduced in Janson & Luczak (2008) to study the giant component of the configuration model. Using this approach we study also a reverse dynamic, which traces all the possible sources of influence of a given vertex, and which by a new "duality" relation allows to characterise the set of good pioneers

Behavior of shell-model configuration moments

An important input into reaction theory is the density of states or the level density. Spectral distribution theory (also known as nuclear statistical spectroscopy) characterizes the secular behavior of the density of states through moments of the Hamiltonian. One particular approach is to partition the model space into subspaces and find the moments in those subspaces; a convenient choice of subspaces are spherical shell-model configurations. We revisit these configuration moments and find, for complete $0\hbar\omega$ many-body spaces, the following behaviors: (a) the configuration width is nearly constant for all configurations; (b) the configuration asymmetry or third moment is strongly correlated with the configuration centroid; (c) the configuration fourth moment, or excess is linearly related to the square to the configuration asymmetry. Such universal behavior may allow for more efficient modeling of the density of states in a shell-model framework.Comment: 12 pages, 8 figure

Chiral Quark Model with Configuration Mixing

The implications of one gluon exchange generated configuration mixing in the Chiral Quark Model ($\chi$QM$_{gcm}$) with SU(3) and axial U(1) symmetry breakings are discussed in the context of proton flavor and spin structure as well as the hyperon $\beta$-decay parameters. We find that $\chi$QM$_{gcm}$ with SU(3) symmetry breaking is able to give a satisfactory unified fit for spin and quark distribution functions, with the symmetry breaking parameters $\alpha=.4$, $\beta=.7$ and the mixing angle $\phi=20^o$, both for NMC and the most recent E866 data. In particular, the agreement with data, in the case of $G_A/G_V, \Delta_8$, F, D, $f_s$ and $f_3/f_8$, is quite striking.Comment: 16 pages, LaTex, Table and Appendix adde

Weighted Configuration Model

The configuration model is one of the most successful models for generating uncorrelated random networks. We analyze its behavior when the expected degree sequence follows a power law with exponent smaller than two. In this situation, the resulting network can be viewed as a weighted network with non trivial correlations between strength and degree. Our results are tested against large scale numerical simulations, finding excellent agreement.Comment: Proceedings CNET200

A rigged configuration model for B(∞)B(\infty)

We describe a combinatorial realization of the crystals $B(\infty)$ and $B(\lambda)$ using rigged configurations in all symmetrizable Kac-Moody types up to certain conditions. This includes all simply-laced types and all non-simply-laced finite and affine types

The Configuration Model for Partially Directed Graphs

The configuration model was originally defined for undirected networks and has recently been extended to directed networks. Many empirical networks are however neither undirected nor completely directed, but instead usually partially directed meaning that certain edges are directed and others are undirected. In the paper we define a configuration model for such networks where nodes have in-, out-, and undirected degrees that may be dependent. We prove conditions under which the resulting degree distributions converge to the intended degree distributions. The new model is shown to better approximate several empirical networks compared to undirected and completely directed networks.Comment: 19 pages, 3 figures, 2 table

The Lambrechts-Stanley Model of Configuration Spaces

We prove the validity over $\mathbb{R}$ of a commutative differential graded algebra model of configuration spaces for simply connected closed smooth manifolds, answering a conjecture of Lambrechts--Stanley. We get as a result that the real homotopy type of such configuration spaces only depends on the real homotopy type of the manifold. We moreover prove, if the dimension of the manifold is at least $4$, that our model is compatible with the action of the Fulton--MacPherson operad (weakly equivalent to the little disks operad) when the manifold is framed. We use this more precise result to get a complex computing factorization homology of framed manifolds. Our proofs use the same ideas as Kontsevich's proof of the formality of the little disks operads.Comment: 61 pages. To appear in Inventiones Mathematica

Far-out Vertices In Weighted Repeated Configuration Model

We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the rest of the graph by a distance exceeding certain threshold play an important role in determining some global properties of the graph like diameter, flooding time etc., in spite of being statistically rare. We give a convergence result for the distribution of the number of such far-out vertices. We also make a conjecture about how this relates to the longest edge of the minimal spanning tree on the graph under consideration