Parenting advantage in the MNC: An embeddedness perspective on the value added by headquarters

What determines the value an MNC’s headquarters adds to its own affiliates? In this paper, we shed light on this question by linking the embeddedness view of the multinational corporation to the literature on parenting advantage. We test our hypotheses on an original dataset of 124 manufacturing subsidiaries located in Europe. Our results indicate that the external embeddedness of the MNC is an antecedent to headquarters’ value creation. We find that headquarters’ investments into their own relationships with the subsidiaries’ contexts are positively related to the value added by headquarters. Furthermore, this relationship is stronger when the subsidiary itself is strongly embedded. We discuss implications for the MNC literature, embeddedness research, and the literature on parenting and headquarters’ roles. Copyright © 2013 John Wiley & Sons, Ltd.

Narrative on the Net:Bill and his hyper- lives, loves and texts

Narrative, by its very nature, is changing as a consequence of internet developments. Hypertexts are, for example, changing not just the way in which we disseminate information, but also the ways in which we write, speak and think. In this paper a narrative approach is taken to assess a case study of a person’s extensive home site on the web. Bill maintains an extensive web site documenting his life with Parkinson’s Disease, his love for running and all matters relating to the island of Montserrat in the Eastern Caribbean. Bill’s Parkinson’s Disease hypertext diary forms the focus of this case study of a life spent on-line. Though set up just as a diary about this progressively degenerative disease, because of its hypertextual qualities, this paper argues that it is through the diary that Bill comes to produce and sustain - to narrate - his identity. This paper thus contributes to the position that though hypertext encourages the construction of fragmented and false identity narratives, it is also a medium for sustaining linear and coherent representations of self-identity.

On Quillen's calculation of graded K-theory

We adapt Quillen’s calculation of graded K-groups of Z-graded rings with support in N to graded K-theory, allowing gradings in a product Z×G with G an arbitrary group. This in turn allows us to use induction and calculate graded K-theory of Z -multigraded rings.

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we present AGWAN (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the AGWAN model to real-world graphs and for generating random graphs from the model. Using the Enron “who communicates with whom” social graph, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to the structure of real-world graphs.

Lovastatin biosynthesis depends on the carbon-nitrogen proportion: model development and controller design

Lovastatin biosynthesis depends on the relative concentrations of dissolved oxygen and the carbon and nitrogen resources. An elucidation of the underlying relationship would facilitate the derivation of a controller for the improvement of lovastatin yield in bioprocesses. To achieve this goal, batch submerged cultivation experiments of lovastatin production by Aspergillus flavipus BICC 5174, using both lactose and glucose as carbon sources, were performed in a 7 liter bioreactor and the data used to determine how the relative concentrations of lactose, glucose, glutamine and oxygen affected lovastatin yield. A model was developed based on these results and its prediction was validated using an independent set of batch data obtained from a 15-liter bioreactor using five statistical measures, including the Willmott index of agreement. A nonlinear controller was designed considering that dissolved oxygen and lactose concentrations could be measured online, and using the lactose feed rate and airflow rate as process inputs. Simulation experiments were performed to demonstrate that a practical implementation of the nonlinear controller would result in satisfactory outcomes. This is the first model that correlates lovastatin biosynthesis to carbon-nitrogen proportion and possesses a structure suitable for implementing a strategy for controlling lovastatin production.

A-level Mathematics Module Choice and Subsequent Performance in First Year of an Engineering Degree

The A-level Mathematics qualification is based on a compulsory set of pure maths modules and a selection of applied maths modules. The flexibility in choice of applied modules has led to concerns that many students would proceed to study engineering at university with little background in mechanics. A survey of aerospace and mechanical engineering students in our university revealed that a combination of mechanics and statistics (the basic module in both) was by far the most popular choice of optional modules in A-level Mathematics, meaning that only about one-quarter of the class had studied mechanics beyond the basic module within school mathematics. Investigation of student performance in two core, first-year engineering courses, which build on a mechanics foundation, indicated that any benefits for students who studied the extra mechanics at school were small. These results give concern about the depth of understanding in mechanics gained during A-level Mathematics.

Towards Understanding Man-In-The-Middle Attacks on IEC 60870-5-104 SCADA Networks

This paper investigates cyber attacks on ICS which rely on IEC 60870-5-104 for telecontrol communications. The main focus of the paper is on man-in-the-middle attacks, covering modification and injection of commands, it also details capture and replay attacks. An initial set of attacks are preformed on a local software simulated laboratory. Final experiments and validation of a man-in-the-middle attack are performed in a comprehensive testbed environment in conjunction with an electricity distribution operator.

Power Scaling of Uplink Massive MIMO Systems with Arbitrary-Rank Channel Means

This paper investigates the uplink achievable rates of massive multiple-input multiple-output (MIMO) antenna systems in Ricean fading channels, using maximal-ratio combining (MRC) and zero-forcing (ZF) receivers, assuming perfect and imperfect channel state information (CSI). In contrast to previous relevant works, the fast fading MIMO channel matrix is assumed to have an arbitrary-rank deterministic component as well as a Rayleigh-distributed random component. We derive tractable expressions for the achievable uplink rate in the large-antenna limit, along with approximating results that hold for any finite number of antennas. Based on these analytical results, we obtain the scaling law that the users' transmit power should satisfy, while maintaining a desirable quality of service. In particular, it is found that regardless of the Ricean K-factor, in the case of perfect CSI, the approximations converge to the same constant value as the exact results, as the number of base station antennas, M, grows large, while the transmit power of each user can be scaled down proportionally to 1/M. If CSI is estimated with uncertainty, the same result holds true but only when the Ricean K-factor is non-zero. Otherwise, if the channel experiences Rayleigh fading, we can only cut the transmit power of each user proportionally to 1/√M. In addition, we show that with an increasing Ricean K-factor, the uplink rates will converge to fixed values for both MRC and ZF receivers.

On Cherry-Picking ... or Trying to Have One’s Cake and Eating It: past principles and practice in the pursuit of an alternative to [full] EU membership

With the United Kingdom’s continued membership of the EU being increasingly questioned and the Prime Minister, David Cameron, committed to 're-negotiate’ the terms of membership, consideration is being given to what forms alternatives to [full] membership may take. While much current discussion focuses on the advantages and disadvantages of particular existing arrangements (e.g. European Economic Area, Swiss bilateralism), this paper examines the broader principles and practices that have to date underpinned – and undermined – EU’s attempts to develop alternatives to [full] EU membership. Drawing on an analysis of the evolution of association as an alternative to membership, the paper assesses the principled, practical and political limitations the EU faces – and imposes on itself – in offering an acceptable balance of rights and obligations to states not wishing to assume the mantle of full membership. In its assessment the paper considers various proposed models of affiliate and associate membership. It also situates consideration of the UK case in the broader context of the EU’s relations with other European non-member states for which membership may not be achievable and for which alternatives to membership (e.g. a form of privileged partnership) have been proposed. In doing so, the paper reflects on the precedent-setting consequences of any arrangement that the EU might reach with any state re-negotiating membership or withdrawing.

Sets of multiplicity and closable multipliers on group algebras

We undertake a detailed study of the sets of multiplicity in a second countable locally compact group G and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space B(L-2(G)) of bounded linear operators on L-2 (G) into the von Neumann algebra VN(G) of G and use it to show that a closed subset E subset of G is a set of multiplicity if and only if the set E* = {(s,t) is an element of G x G : ts(-1) is an element of E} is a set of operator multiplicity. Analogous results are established for M-1-sets and M-0-sets. We show that the property of being a set of multiplicity is preserved under various operations, including taking direct products, and establish an Inverse Image Theorem for such sets. We characterise the sets of finite width that are also sets of operator multiplicity, and show that every compact operator supported on a set of finite width can be approximated by sums of rank one operators supported on the same set. We show that, if G satisfies a mild approximation condition, pointwise multiplication by a given measurable function psi : G -> C defines a closable multiplier on the reduced C*-algebra G(r)*(G) of G if and only if Schur multiplication by the function N(psi): G x G -> C, given by N(psi)(s, t) = psi(ts(-1)), is a closable operator when viewed as a densely defined linear map on the space of compact operators on L-2(G). Similar results are obtained for multipliers on VN(C).

AGWAN: A Generative Model for Labelled, Weighted Graphs

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we presentAgwan (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the Agwanmodel to real-world graphs and for generating random graphs from the model. Using real-world directed and undirected graphs as input, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to graph structure.

Density functional theory study on the activation of molecular oxygen on a stepped gold surface in an aqueous environment: a new approach for simulating reactions in solution

The activation of oxygen molecules is an important issue in the gold-catalyzed partial oxidation of alcohols in aqueous solution. The complexity of the solution arising from a large number of solvent molecules makes it difficult to study the reaction in the system. In this work, O-2 activation on an Au catalyst is investigated using an effective approach to estimate the reaction barriers in the presence of solvent. Our calculations show that O-2 can be activated, undergoing OOH* in the presence of water molecules. The OOH* can readily be formed on Au(211) via four possible pathways with almost equivalent free energy barriers at the aqueous-solid interface: the direct or indirect activation of O-2 by surface hydrogen or the hydrolysis of O-2 following a Langmuir-Hinshelwood mechanism or an Eley-Rideal mechanism. Among them, the Eley-Rideal mechanism may be slightly more favorable due to the restriction of the low coverage of surface H on Au(211) in the other mechanisms. The results shed light on the importance of water molecules on the activation of oxygen in gold-catalyzed systems. Solvent is found to facilitate the oxygen activation process mainly by offering extra electrons and stabilizing the transition states. A correlation between the energy barrier and the negative charge of the reaction center is found. The activation barrier is substantially reduced by the aqueous environment, in which the first solvation shell plays the most important role in the barrier reduction. Our approach may be useful for estimating the reaction barriers in aqueous systems.

Generating Realistic Labelled, Weighted Random Graphs

Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs) with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI) approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs). Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.

Exact and heuristic methods for solving Boolean games

Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents’ goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.

Using Answer Set Programming for Solving Boolean Games

Boolean games are a framework for reasoning about the rational behaviour of agents, whose goals are formalized using propositional formulas. They offer an attractive alternative to normal-form games, because they allow for a more intuitive and more compact encoding. Unfortunately, however, there is currently no general, tailor-made method available to compute the equilibria of Boolean games. In this paper, we introduce a method for finding the pure Nash equilibria based on disjunctive answer set programming. Our method is furthermore capable of finding the core elements and the Pareto optimal equilibria, and can easily be modified to support other forms of optimality, thanks to the declarative nature of disjunctive answer set programming. Experimental results clearly demonstrate the effectiveness of the proposed method.