A Recursive Perspective on Discursive Legitimation and Organizational Action in Mergers and Acquisitions

This paper challenges the predominant view that legitimation is merely a specific phase in merger or acquisition processes. We argue that a better understanding of postmerger organizational dynamics calls for conceptualization of discursive legitimation as an inherent part of unfolding merger processes. In particular, we focus on the recursive relationship between legitimation and organizational action. We have two objectives: to outline a theoretical model that helps one to understand the dynamics of discursive legitimation and organizational action in postmerger organizations, and to examine a revealing case to distinguish the inherent risks and problems in discursive legitimation. Our case analysis focuses on the merger between the French pharmaceutical companies BioMérieux and Pierre Fabre. We adopt a critical multimethod approach and distinguish specific discursive dynamics and pathological tendencies in this case. The analysis highlights the unintended consequences of discursive legitimation, the central role of sensegiving and sensehiding in discursive legitimation, the inherently political nature of legitimation and the risks associated with politicization, the special problems associated with fashionable discourses and the role of the media, the use of specific discursive strategies for legitimation and delegitimation, and the crucial role of actual integration results. This analysis adds to the existing research on mergers and acquisitions by treating discursive legitimation as part of the merger dynamics. In particular, our case analysis provides a new explanation for merger failure. We also believe that the recursive model connecting discursive legitimation and delegitimation strategies to concrete organizational action makes a more general contribution to our understanding of organizational legitimation.

A recursive perspective on discursive legitimation and organizational action in mergers and acquisitions

This paper challenges the predominant view that legitimation is merely a specific phase in merger or acquisition processes. We argue that a better understanding of postmerger organizational dynamics calls for conceptualization of discursive legitimation as an inherent part of unfolding merger processes. In particular, we focus on the recursive relationship between legitimation and organizational action. We have two objectives: to outline a theoretical model that helps one to understand the dynamics of discursive legitimation and organizational action in postmerger organizations, and to examine a revealing case to distinguish the inherent risks and problems in discursive legitimation. Our case analysis focuses on the merger between the French pharmaceutical companies BioMérieux and Pierre Fabre. We adopt a critical multimethod approach and distinguish specific discursive dynamics and pathological tendencies in this case. The analysis highlights the unintended consequences of discursive legitimation, the central role of sensegiving and sensehiding in discursive legitimation, the inherently political nature of legitimation and the risks associated with politicization, the special problems associated with fashionable discourses and the role of the media, the use of specific discursive strategies for legitimation and delegitimation, and the crucial role of actual integration results. This analysis adds to the existing research on mergers and acquisitions by treating discursive legitimation as part of the merger dynamics. In particular, our case analysis provides a new explanation for merger failure. We also believe that the recursive model connecting discursive legitimation and delegitimation strategies to concrete organizational action makes a more general contribution to our understanding of organizational legitimation.

SPSA algorithms with measurement reuse

Four algorithms, all variants of Simultaneous Perturbation Stochastic Approximation (SPSA), are proposed. The original one-measurement SPSA uses an estimate of the gradient of objective function L containing an additional bias term not seen in two-measurement SPSA. As a result, the asymptotic covariance matrix of the iterate convergence process has a bias term. We propose a one-measurement algorithm that eliminates this bias, and has asymptotic convergence properties making for easier comparison with the two-measurement SPSA. The algorithm, under certain conditions, outperforms both forms of SPSA with the only overhead being the storage of a single measurement. We also propose a similar algorithm that uses perturbations obtained from normalized Hadamard matrices. The convergence w.p. 1 of both algorithms is established. We extend measurement reuse to design two second-order SPSA algorithms and sketch the convergence analysis. Finally, we present simulation results on an illustrative minimization problem.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

An ensemble of B-DNA dinucleotide geometries lead to characteristic nucleosomal DNA structure and provide plasticity required for gene expression

Background: A nucleosome is the fundamental repeating unit of the eukaryotic chromosome. It has been shown that the positioning of a majority of nucleosomes is primarily controlled by factors other than the intrinsic preference of the DNA sequence. One of the key questions in this context is the role, if any, that can be played by the variability of nucleosomal DNA structure. Results: In this study, we have addressed this question by analysing the variability at the dinucleotide and trinucleotide as well as longer length scales in a dataset of nucleosome X-ray crystal structures. We observe that the nucleosome structure displays remarkable local level structural versatility within the B-DNA family. The nucleosomal DNA also incorporates a large number of kinks. Conclusions: Based on our results, we propose that the local and global level versatility of B-DNA structure may be a significant factor modulating the formation of nucleosomes in the vicinity of high-plasticity genes, and in varying the probability of binding by regulatory proteins. Hence, these factors should be incorporated in the prediction algorithms and there may not be a unique `template' for predicting putative nucleosome sequences. In addition, the multimodal distribution of dinucleotide parameters for some steps and the presence of a large number of kinks in the nucleosomal DNA structure indicate that the linear elastic model, used by several algorithms to predict the energetic cost of nucleosome formation, may lead to incorrect results.

Particle filters for structural system identification using multiple test and sensor data: A combined computational and experimental study

The problem of structural system identification when measurements originate from multiple tests and multiple sensors is considered. An offline solution to this problem using bootstrap particle filtering is proposed. The central idea of the proposed method is the introduction of a dummy independent variable that allows for simultaneous assimilation of multiple measurements in a sequential manner. The method can treat linear/nonlinear structural models and allows for measurements on strains and displacements under static/dynamic loads. Illustrative examples consider measurement data from numerical models and also from laboratory experiments. The results from the proposed method are compared with those from a Kalman filter-based approach and the superior performance of the proposed method is demonstrated. Copyright (C) 2009 John Wiley & Sons, Ltd.

Genetic algorithms: a survey

Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex landscapes. We introduce the art and science of genetic algorithms and survey current issues in GA theory and practice. We do not present a detailed study, instead, we offer a quick guide into the labyrinth of GA research. First, we draw the analogy between genetic algorithms and the search processes in nature. Then we describe the genetic algorithm that Holland introduced in 1975 and the workings of GAs. After a survey of techniques proposed as improvements to Holland's GA and of some radically different approaches, we survey the advances in GA theory related to modeling, dynamics, and deception

Multiple UAV Coalitions for a Search and Prosecute Mission

Unmanned aerial vehicles (UAVs) have the potential to carry resources in support of search and prosecute operations. Often to completely prosecute a target, UAVs may have to simultaneously attack the target with various resources with different capacities. However, the UAVs are capable of carrying only limited resources in small quantities, hence, a group of UAVs (coalition) needs to be assigned that satisfies the target resource requirement. The assigned coalition must be such that it minimizes the target prosecution delay and the size of the coalition. The problem of forming coalitions is computationally intensive due to the combinatorial nature of the problem, but for real-time applications computationally cheap solutions are required. In this paper, we propose decentralized sub-optimal (polynomial time) and decentralized optimal coalition formation algorithms that generate coalitions for a single target with low computational complexity. We compare the performance of the proposed algorithms to that of a global optimal solution for which we need to solve a centralized combinatorial optimization problem. This problem is computationally intensive because the solution has to (a) provide a coalition for each target, (b) design a sequence in which targets need to be prosecuted, and (c) take into account reduction of UAV resources with usage. To solve this problem we use the Particle Swarm Optimization (PSO) technique. Through simulations, we study the performance of the proposed algorithms in terms of mission performance, complexity of the algorithms and the time taken to form the coalition. The simulation results show that the solution provided by the proposed algorithms is close to the global optimal solution and requires far less computational resources.

3-D Warping in Four-Bar Laminated Linkages

This paper deals with the evaluation of the component-laminate load-carrying capacity, i.e., to calculate the loads that cause the failure of the individual layers and the component-laminate as a whole in four-bar mechanism. The component-laminate load-carrying capacity is evaluated using the Tsai-Wu-Hahn failure criterion for various layups. The reserve factor of each ply in the component-laminate is calculated by using the maximum resultant force and the maximum resultant moment occurring at different time steps at the joints of the mechanism. Here, all component bars of the mechanism are made of fiber reinforced laminates and have thin rectangular cross-sections. They could, in general, be pre-twisted and/or possess initial curvature, either by design or by defect. They are linked to each other by means of revolute joints. We restrict ourselves to linear materials with small strains within each elastic body (beam). Each component of the mechanism is modeled as a beam based on geometrically nonlinear 3-D elasticity theory. The component problems are thus split into 2-D analyses of reference beam cross-sections and nonlinear 1-D analyses along the three beam reference curves. For the thin rectangular cross-sections considered here, the 2-D cross-sectional nonlinearity is also overwhelming. This can be perceived from the fact that such sections constitute a limiting case between thin-walled open and closed sections, thus inviting the nonlinear phenomena observed in both. The strong elastic couplings of anisotropic composite laminates complicate the model further. However, a powerful mathematical tool called the Variational Asymptotic Method (VAM) not only enables such a dimensional reduction, but also provides asymptotically correct analytical solutions to the nonlinear cross-sectional analysis. Such closed-form solutions are used here in conjunction with numerical techniques for the rest of the problem to predict more quickly and accurately than would otherwise be possible. Local 3-D stress, strain and displacement fields for representative sections in the component-bars are recovered, based on the stress resultants from the 1-D global beam analysis. A numerical example is presented which illustrates the failure of each component-laminate and the mechanism as a whole.

KFVS (Kinetic Flux Vector Splitting) on moving grids for unsteady aerodynamics

Accurate numerical solutions to the problems in fluid-structure (aeroelasticity) interaction are becoming increasingly important in recent years. The methods based on FCD (Fixed Computational Domain) and ALE (Alternate Lagrangian Eulerian) to solve such problems suffer from numerical instability and loss of accuracy. They are not general and can not be extended to the flowsolvers on unstructured meshes. Also, global upwind schemes can not be used in ALE formulation thus leads to the development of flow solvers on moving grids. The KFVS method has been shown to be easily amenable on moving grids required in unsteady aerodynamics. The ability of KFMG (Kinetic Flux vector splitting on Moving Grid) Euler solver in capturing shocks, expansion waves with small and very large pressure ratios and contact discontinuities has been demonstrated.

A finite element method for compressible viscous fluid flows

This work presents a mixed three-dimensional finite element formulation for analyzing compressible viscous flows. The formulation is based on the primitive variables velocity, density, temperature and pressure. The goal of this work is to present a `stable' numerical formulation, and, thus, the interpolation functions for the field variables are chosen so as to satisfy the inf-sup conditions. An exact tangent stiffness matrix is derived for the formulation, which ensures a quadratic rate of convergence. The good performance of the proposed strategy is shown in a number of steady-state and transient problems where compressibility effects are important such as high Mach number flows, natural convection, Riemann problems, etc., and also on problems where the fluid can be treated as almost incompressible. Copyright (C) 2010 John Wiley & Sons, Ltd.

Nonlinear dynamics and chaotic motions in feedback-controlled two- and three-degree-of-freedom robots

The dynamics of a feedback-controlled rigid robot is most commonly described by a set of nonlinear ordinary differential equations. In this paper we analyze these equations, representing the feedback-controlled motion of two- and three-degrees-of-freedom rigid robots with revolute (R) and prismatic (P) joints in the absence of compliance, friction, and potential energy, for the possibility of chaotic motions. We first study the unforced or inertial motions of the robots, and show that when the Gaussian or Riemannian curvature of the configuration space of a robot is negative, the robot equations can exhibit chaos. If the curvature is zero or positive, then the robot equations cannot exhibit chaos. We show that among the two-degrees-of-freedom robots, the PP and the PR robot have zero Gaussian curvature while the RP and RR robots have negative Gaussian curvatures. For the three-degrees-of-freedom robots, we analyze the two well-known RRP and RRR configurations of the Stanford arm and the PUMA manipulator respectively, and derive the conditions for negative curvature and possible chaotic motions. The criteria of negative curvature cannot be used for the forced or feedback-controlled motions. For the forced motion, we resort to the well-known numerical techniques and compute chaos maps, Poincare maps, and bifurcation diagrams. Numerical results are presented for the two-degrees-of-freedom RP and RR robots, and we show that these robot equations can exhibit chaos for low controller gains and for large underestimated models. From the bifurcation diagrams, the route to chaos appears to be through period doubling.

Spatial Data Mining and Modeling for visualisation of Rapid Urbanisation

Rapid urbanisation in India has posed serious challenges to the decision makers in regional planning involving plethora of issues including provision of basic amenities (like electricity, water, sanitation, transport, etc.). Urban planning entails an understanding of landscape and urban dynamics with causal factors. Identifying, delineating and mapping landscapes on temporal scale provide an opportunity to monitor the changes, which is important for natural resource management and sustainable planning activities. Multi-source, multi-sensor, multi-temporal, multi-frequency or multi-polarization remote sensing data with efficient classification algorithms and pattern recognition techniques aid in capturing these dynamics. This paper analyses the landscape dynamics of Greater Bangalore by: (i) characterisation of direct impervious surface, (ii) computation of forest fragmentation indices and (iii) modeling to quantify and categorise urban changes. Linear unmixing is used for solving the mixed pixel problem of coarse resolution super spectral MODIS data for impervious surface characterisation. Fragmentation indices were used to classify forests – interior, perforated, edge, transitional, patch and undetermined. Based on this, urban growth model was developed to determine the type of urban growth – Infill, Expansion and Outlying growth. This helped in visualising urban growth poles and consequence of earlier policy decisions that can help in evolving strategies for effective land use policies.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d