The role of Lean at the interface with between operations management and applied services within a large aerospace organisation: a boundary spanning perspective

Increased complexity in large design and manufacturing organisations requires improvements at the operations management (OM)–applied service (AS) interface areas to improve project effectiveness. The aim of this paper is explore the role of Lean in improving the longitudinal efficiency of the OM–AS interface within a large aerospace organisation using Lean principles and boundary spanning theory. The methodology was an exploratory longitudinal case approach including exploratory interviews (n = 21), focus groups (n = 2), facilitated action-research workshops (n = 2) and two trials or experiments using longitudinal data involving both OM and AS personnel working at the interface. The findings draw upon Lean principles and boundary spanning theory to guide and interpret the findings. It was found that misinterpretation, and forced implementation, of OM-based Lean terminology and practice in the OM–AS interface space led to delays and misplaced resources. Rather both OM and AS staff were challenged to develop a cross boundary understanding of Lean-based boundary (knowledge) objects in interpreting OM requests. The longitudinal findings from the experiments showed that the development of Lean Performance measurements and lean Value Stream constructs was more successful when these Lean constructs were treated as boundary (knowledge) objects requiring transformation over time to orchestrate improved effectiveness and in leading to consistent terminology and understanding between the OM–AS boundary spanning team.

An Efficient Precoder Design for Multiuser MIMO Cognitive Radio Networks with Interference Constraints

We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary BS and the interference power constraints at the primary users. The problem of interest differs from the ones studied previously that often assumed a sum power constraint and/or single antenna employed at either both the primary and secondary receivers or the primary receivers. To develop an efficient numerical algorithm, we first invoke the rank relaxation method to transform the considered problem into a convex-concave problem based on a downlink-uplink result. We then propose a barrier interior-point method to solve the resulting saddle point problem. In particular, in each iteration of the proposed method we find the Newton step by solving a system of discrete-time Sylvester equations, which help reduce the complexity significantly, compared to the conventional method. Simulation results are provided to demonstrate fast convergence and effectiveness of the proposed algorithm. 

Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks

In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches.