Evolution of Organisational Structure and Capabilities in Internationalising Banks: The CEE Operations of UniCredit's Vienna Office

Cross-border integration is the central management issue for banks that expand internationally, and this is especially true in Central and Eastern Europe, where the pace of internationalisation through mergers and acquisitions has been rapid. A critical challenge in cross-border integration is aligning a multinational company's formal organizational structure with the distribution of capabilities across its subsidiary units, and this issue is explored by tracking the co-evolution of organizational structure and capabilities during the internationalisation of a large banking network into this region. Our focus is the Vienna head office of Bank Austria Creditanstalt, which was acquired first by HypoVereinsbank (Germany) and then UniCredit (Italy). Despite its formal role being downgraded during these changes, the unit continued to develop its distinctive capabilities. The key insight our article offers is that managing cross-border integration is not simply about recognizing the value of the distinctive capabilities of individual units and designing formal structures that successfully align with them. It is also about understanding the need for dynamic interaction between formal corporate structure and individual units' desires to retain power and influence, which have significant implications for the development of their organizational capabilities.

Double-detonation sub-Chandrasekhar supernovae: Can minimum helium shell masses detonate the core?

The explosion of sub-Chandrasekhar mass white dwarfs via the double detonation scenario is a potential explanation for type Ia supernovae. In this scenario, a surface detonation in a helium layer initiates a detonation in the underlying carbon/oxygen core leading to an explosion. For a given core mass, a lower bound has been determined on the mass of the helium shell required for dynamical burning during a helium flash, which is a necessary prerequisite for detonation. For a range of core and corresponding minimum helium shell masses, we investigate whether an assumed surface helium detonation is capable of triggering a subsequent detonation in the core even for this limiting case. We carried out hydrodynamic simulations on a co-expanding Eulerian grid in two dimensions assuming rotational symmetry. The detonations are propagated using the level-set approach and a simplified scheme for nuclear reactions that has been calibrated with a large nuclear network. The same network is used to determine detailed nucleosynthetic abundances in a post-processing step. Based on approximate detonation initiation criteria in the literature, we find that secondary core detonations are triggered for all of the simulated models, ranging in core mass from 0.810 up to 1.385 M? with corresponding shell masses from 0.126 down to 0.0035 M?. This implies that, as soon as a detonation triggers in a helium shell covering a carbon/oxygen white dwarf, a subsequent core detonation is virtually inevitable.

Algorithms for Self-Healing Networks

Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never have node failures. Instead, these networks should be able to admit small, and maybe, periodic failures and still recover like skin heals from a cut. This process, where the network can recover itself by maintaining key invariants in response to attack by a powerful adversary is what we call \emph{self-healing}. Here, we present several fast and provably good distributed algorithms for self-healing in reconfigurable dynamic networks. Each of these algorithms have different properties, a different set of gaurantees and limitations. We also discuss future directions and theoretical questions we would like to answer. %in the final dissertation that this document is proposed to lead to.

Tanker Mission Implication on a Civil Aerial Refuelling Transport System’s Benefit Evaluation

As the emphasis on initiatives that can improve environmental efficiency while simultaneously maintaining economic viability has escalated in recent years, attention has turned to more radical concepts of operation. In particular, the cruiser–feeder concept has shown potential for a new generation, environmentally friendly, air-transport system to alleviate the growing pressure on the passenger air-transportation network. However, a full evaluation of realizable benefits is needed to determine how the design and operation of potential feeder-aircraft configurations impact on the feasibility of the overall concept. This paper presents an analysis of a cruiser–feeder concept, in which fuel is transferred between the feeder and the cruiser in an aerial-refueling configuration to extend range while reducing cruiser weight, compared against the effects of escalating existing technology levels while retaining the existing passenger levels. Up to 14% fuel-burn and 12% operating-cost savings can be achieved when compared to a similar technology-level aircraft concept without aerial refueling, representing up to 26% in fuel burn and 25% in total operating cost over the existing operational model at today’s standard fleet technology and performance. However, these potential savings are not uniformly distributed across the network, and the system is highly sensitive to the routes serviced, with reductions in revenue-generation potential observed across the network for aerial-refueling operations due to reductions in passenger revenue.

Time-lapse monitoring of climate effects on earthworks using surface waves

The UK’s transportation network is supported by critical geotechnical assets (cuttings/embankments/dams) that require sustainable, cost-effective management, while maintaining an appropriate service level to meet social, economic, and environmental needs. Recent effects of extreme weather on these geotechnical assets have highlighted their vulnerability to climate variations. We have assessed the potential of surface wave data to portray the climate-related variations in mechanical properties of a clay-filled railway embankment. Seismic data were acquired bimonthly from July 2013 to November 2014 along the crest of a heritage railway embankment in southwest England. For each acquisition, the collected data were first processed to obtain a set of Rayleigh-wave dispersion and attenuation curves, referenced to the same spatial locations. These data were then analyzed to identify a coherent trend in their spatial and temporal variability. The relevance of the observed temporal variations was also verified with respect to the experimental data uncertainties. Finally, the surface wave dispersion data sets were inverted to reconstruct a time-lapse model of S-wave velocity for the embankment structure, using a least-squares laterally constrained inversion scheme. A key point of the inversion process was constituted by the estimation of a suitable initial model and the selection of adequate levels of spatial regularization. The initial model and the strength of spatial smoothing were then kept constant throughout the processing of all available data sets to ensure homogeneity of the procedure and comparability among the obtained VS sections. A continuous and coherent temporal pattern of surface wave data, and consequently of the reconstructed VS models, was identified. This pattern is related to the seasonal distribution of precipitation and soil water content measured on site.

FPGA-based soft-core processors for image processing applications

With security and surveillance, there is an increasing need to process image data efficiently and effectively either at source or in a large data network. Whilst a Field-Programmable Gate Array (FPGA) has been seen as a key technology for enabling this, the design process has been viewed as problematic in terms of the time and effort needed for implementation and verification. The work here proposes a different approach of using optimized FPGA-based soft-core processors which allows the user to exploit the task and data level parallelism to achieve the quality of dedicated FPGA implementations whilst reducing design time. The paper also reports some preliminary
progress on the design flow to program the structure. An implementation for a Histogram of Gradients algorithm is also reported which shows that a performance of 328 fps can be achieved with this design approach, whilst avoiding the long design time, verification and debugging steps associated with conventional FPGA implementations.

Received signal strength in large-scale wireless relay sensor network: a stochastic ray approach

The authors consider a point percolation lattice representation of a large-scale wireless relay sensor network (WRSN) deployed in a cluttered environment. Each relay sensor corresponds to a grid point in the random lattice and the signal sent by the source is modelled as an ensemble of photons that spread in the space, which may 'hit' other sensors and are 'scattered' around. At each hit, the relay node forwards the received signal to its nearest neighbour through direction-selective relaying. The authors first derive the distribution that a relay path reaches a prescribed location after undergoing certain number of hops. Subsequently, a closed-form expression of the average received signal strength (RSS) at the destination can be computed as the summation of all signal echoes' energy. Finally, the effect of the anomalous diffusion exponent ß on the mean RSS in a WRSN is studied, for which it is found that the RSS scaling exponent e is given by (3ß-1)/ß. The results would provide useful insight into the design and deployment of large-scale WRSNs in future. © 2011 The Institution of Engineering and Technology.

Cache-Integrated Network Interfaces: Flexible On-Chip Communication and Synchronization for Large-Scale CMPs

Per-core scratchpad memories (or local stores) allow direct inter-core communication, with latency and energy advantages over coherent cache-based communication, especially as CMP architectures become more distributed. We have designed cache-integrated network interfaces, appropriate for scalable multicores, that combine the best of two worlds – the flexibility of caches and the efficiency of scratchpad memories: on-chip SRAM is configurably shared among caching, scratchpad, and virtualized network interface (NI) functions. This paper presents our architecture, which provides local and remote scratchpad access, to either individual words or multiword blocks through RDMA copy. Furthermore, we introduce event responses, as a technique that enables software configurable communication and synchronization primitives. We present three event response mechanisms that expose NI functionality to software, for multiword transfer initiation, completion notifications for software selected sets of arbitrary size transfers, and multi-party synchronization queues. We implemented these mechanisms in a four-core FPGA prototype, and measure the logic overhead over a cache-only design for basic NI functionality to be less than 20%. We also evaluate the on-chip communication performance on the prototype, as well as the performance of synchronization functions with simulation of CMPs with up to 128 cores. We demonstrate efficient synchronization, low-overhead communication, and amortized-overhead bulk transfers, which allow parallelization gains for fine-grain tasks, and efficient exploitation of the hardware bandwidth.

Bagging statistical network inference from large-scale gene expression data.

Modern biology and medicine aim at hunting molecular and cellular causes of biological functions and diseases. Gene regulatory networks (GRN) inferred from gene expression data are considered an important aid for this research by providing a map of molecular interactions. Hence, GRNs have the potential enabling and enhancing basic as well as applied research in the life sciences. In this paper, we introduce a new method called BC3NET for inferring causal gene regulatory networks from large-scale gene expression data. BC3NET is an ensemble method that is based on bagging the C3NET algorithm, which means it corresponds to a Bayesian approach with noninformative priors. In this study we demonstrate for a variety of simulated and biological gene expression data from S. cerevisiae that BC3NET is an important enhancement over other inference methods that is capable of capturing biochemical interactions from transcription regulation and protein-protein interaction sensibly. An implementation of BC3NET is freely available as an R package from the CRAN repository. © 2012 de Matos Simoes, Emmert-Streib.

Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.

Improving neural network training solutions using regularisation

This paper describes the application of regularisation to the training of feedforward neural networks, as a means of improving the quality of solutions obtained. The basic principles of regularisation theory are outlined for both linear and nonlinear training and then extended to cover a new hybrid training algorithm for feedforward neural networks recently proposed by the authors. The concept of functional regularisation is also introduced and discussed in relation to MLP and RBF networks. The tendency for the hybrid training algorithm and many linear optimisation strategies to generate large magnitude weight solutions when applied to ill-conditioned neural paradigms is illustrated graphically and reasoned analytically. While such weight solutions do not generally result in poor fits, it is argued that they could be subject to numerical instability and are therefore undesirable. Using an illustrative example it is shown that, as well as being beneficial from a generalisation perspective, regularisation also provides a means for controlling the magnitude of solutions. (C) 2001 Elsevier Science B.V. All rights reserved.

Local network-based measures to assess the inferability of different regulatory networks

The purpose of this study is to compare the inferability of various synthetic as well as real biological regulatory networks. In order to assess differences we apply local network-based measures. That means, instead of applying global measures, we investigate and assess an inference algorithm locally, on the level of individual edges and subnetworks. We demonstrate the behaviour of our local network-based measures with respect to different regulatory networks by conducting large-scale simulations. As inference algorithm we use exemplarily ARACNE. The results from our exploratory analysis allow us not only to gain new insights into the strength and weakness of an inference algorithm with respect to characteristics of different regulatory networks, but also to obtain information that could be used to design novel problem-specific statistical estimators.