Adaptation in a Business Network Cooperation Context (summary section only)

In today’s business one can say that competition does not take place inside the network, but between networks. Change and dynamics are central issues in network studies, and a company, due its changing environment, can identify opportunities and threats and respond to them accordingly. These opportunities are vital, but also complex and demanding for the management. Earlier research has identified a shortcoming in explanations of how the micro-level interactions to macro-level patterns are connected. The IMP-group has been trying to fill this research gap with research on interactions within business networks. In this area of research lies the focus of research on relationships between organizations. Adaptation in cooperation is a central concept within business network research. Adaptation has been dealt with in previous literature, but the focus of the studies has mainly been outside this phenomenon, and it has mostly had a supporting role. Most literature has also described the buyers' point of view in studied supply networks, whereas much less attention has been paid to the suppliers' view on them. This study focuses on this research gap. The results of the study stress that adaptation should be included to a greater extent in the strategy work of companies. The adaptations should be carefully planned and, as far as possible, made consciously. Conscious, well-planned adaptations can be seen as investments into present and future relationships, and resources should be invested into something that does not increase the company’s dependence, but divides the power in the relationship between the companies. Adaptations should be planned so that they result in a more offensive way of responding to the demands that are placed upon the companies. In this way, the actions can be viewed and analyzed in accordance with whether the actions make the company weaker or stronger.

A Model for Creating Strategic Alliances. A Study of Inter-firm Cooperation in the North European ICT Sector

In this study, it is argued that the view on alliance creation presented in the current academic literature is limited, and that using a learning approach helps to explain the dynamic nature of alliance creation. The cases in this study suggest that a wealth of inefficiency elements can be found in alliance creation. These elements can further be divided into categories, which help explain the dynamics of alliance creation. The categories –combined with two models brought forward by the study– suggest that inefficiency can be avoided through learning during the creation process. Some elements are especially central to this argumentation. First, the elements related to the clarity and acceptance of the strategy of the company, the potential lack of an alliance strategy and the elements related to changes in the strategic context. Second, the elements related to the length of the alliance creation processes and the problems a long process entails. It is further suggested that the different inefficiency elements may create a situation, where the alliance creation process is –sequentially and successfully– followed to the end, but where the different inefficiencies create a situation where the results are not aligned with the strategic intent. The proposed solution is to monitor and assess the risk for inefficiency elements during the alliance creation process. The learning, which occurs during the alliance creation process as a result of the monitoring, can then lead to realignments in the process. This study proposes a model to mitigate the risk related to the inefficiencies. The model emphasizes creating an understanding of the other alliance partner’s business, creating a shared vision, using pilot cooperation and building trust within the process. An analytical approach to assessing the benefits of trust is also central in this view. The alliance creation approach suggested by this study, which emphasizes trust and pilot cooperation, is further critically reviewed against contracting as a way to create alliances.

The EU and Institutional Twinning in Morocco - An inquiry into the motives of cooperation through discourse ethics

This study examines Institutional Twinning in Morocco as a case of EU cooperation through the pragmatic, ethical and moral logics of reason in Jürgen Habermas’s discourse ethics. As a former accession tool, Twinning was introduced in 2004 for legal approximation in the context of the European Neighborhood Policy. Twinning is a unique instrument in development cooperation from a legal perspective. With its long historical and cultural ties to Europe, Morocco presents an interesting case study of this new form of cooperation. We will analyse motives behind the Twinning projects on illegal immigration, environment legislation and customs reform. As Twinning is a new policy instrument within the ENP context, there is relatively little preceding research, which, in itself, constitutes a reason to inquire into the subject. While introducing useful categories, the approaches discussing “normative power Europe” do not offer methodological tools precise enough to analyse the motives of the Twinning cooperation from a broad ethical standpoint. Helene Sjursen as well as Esther Barbé and Elisabeth Johansson-Nogués have elaborated on Jürgen Habermas’ discourse ethics in determining the extent of altruism in the ENP in general. Situating the analysis in the process-oriented framework of Critical Theory, discourse ethics provides the methodological framework for our research. The case studies reveal that the context in which they operate affects the pragmatic, ethical and moral aspirations of the actors. The utilitarian notion of profit maximization is quite pronounced both in terms of the number of Twinning projects in the economic sphere and the pragmatic logics of reason instrumental to security and trade-related issues. The historical background as well internal processes, however, contribute to defining areas of mutual interest to the actors as well as the motives Morocco and the EU sometimes described as the external projection of internal values. Through its different aspects, Twinning cooperation portrays the functioning of the pragmatic, ethical and moral logics of reason in international relations.

Implications of the half-duplex constraint on relay-aided cooperation using rateless codes

The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.

Autonomous and non-autonomous traits mediate social cooperation in Dictyostelium discoideum

In the trishanku (triA(-)) mutant of the social amoeba Dictyostelium discoideum, aggregates are smaller than usual and the spore mass is located mid-way up the stalk, not at the apex. We have monitored aggregate territory size, spore allocation and fruiting body morphology in chimaeric groups of (quasi-wild-type) Ax2 and triA(-) cells. Developmental canalisation breaks down in chimaeras and leads to an increase in phenotypic variation. A minority of triA(-) cells causes largely Ax2 aggregation streams to break up; the effect is not due to the counting factor. Most chimaeric fruiting bodies resemble those of Ax2 or triA(-). Others are double-deckers with a single stalk and two spore masses, one each at the terminus and midway along the stalk. The relative number of spores belonging to the two genotypes depends both on the mixing ratio and on the fruiting body morphology. In double-deckers formed from 1:1 chimaeras, the upper spore mass has more Ax2 spores, and the lower spore mass more triA(-) spores, than expected. Thus, the traits under study depend partly on the cells' own genotype and partly on the phenotypes, and so genotypes, of other cells: they are both autonomous and non-autonomous. These findings strengthen the parallels between multicellular development and behaviour in social groups. Besides that, they reinforce the point that a trait can be associated with a genotype only in a specified context.

Asymmetric Cooperation Among Relays with Linear Precoding

Fixed and mobile relays are used, among other applications, in the downlink of cellular communications systems. Cooperation between relays can greatly increase their benefits in terms of extended coverage, increased reliability, and improved spectral efficiency. In this paper, we introduce the fundamental notion of asymmetric cooperation. For this, we consider a two-phase transmission protocol where, in the first phase, the base station (BS) sends several available messages to the relays over wireless links. But, depending on the channel state and the duration of the BS transmission, not all relays decode all messages. In a second phase, the relays, which may now have asymmetric message knowledge, use cooperative linear precoding for the transmission to the mobile stations. We show that for many channel configurations, asymmetric cooperation, although (slighlty) sub-optimum for the second phase, is optimum from a total-throughput point of view, as it requires less time and energy in the first phase. We give analytical formulations for the optimum operating parameters and the achievable throughput, and show that under typical circumstances, 20-30% throughput enhancement can be achieved over conventional systems.

Energy-Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading

Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.

SURE-FAST BILATERAL FILTERS

Edge-preserving smoothing is widely used in image processing and bilateral filtering is one way to achieve it. Bilateral filter is a nonlinear combination of domain and range filters. Implementing the classical bilateral filter is computationally intensive, owing to the nonlinearity of the range filter. In the standard form, the domain and range filters are Gaussian functions and the performance depends on the choice of the filter parameters. Recently, a constant time implementation of the bilateral filter has been proposed based on raisedcosine approximation to the Gaussian to facilitate fast implementation of the bilateral filter. We address the problem of determining the optimal parameters for raised-cosine-based constant time implementation of the bilateral filter. To determine the optimal parameters, we propose the use of Stein's unbiased risk estimator (SURE). The fast bilateral filter accelerates the search for optimal parameters by faster optimization of the SURE cost. Experimental results show that the SURE-optimal raised-cosine-based bilateral filter has nearly the same performance as the SURE-optimal standard Gaussian bilateral filter and the Oracle mean squared error (MSE)-based optimal bilateral filter.

Optimal parameter selection for bilateral filters using Poisson unbiased risk estimate

Bilateral filters perform edge-preserving smoothing and are widely used for image denoising. The denoising performance is sensitive to the choice of the bilateral filter parameters. We propose an optimal parameter selection for bilateral filtering of images corrupted with Poisson noise. We employ the Poisson's Unbiased Risk Estimate (PURE), which is an unbiased estimate of the Mean Squared Error (MSE). It does not require a priori knowledge of the ground truth and is useful in practical scenarios where there is no access to the original image. Experimental results show that quality of denoising obtained with PURE-optimal bilateral filters is almost indistinguishable with that of the Oracle-MSE-optimal bilateral filters.

Bilateral smoothing of gradient vector field and application to image segmentation

Medical image segmentation finds application in computer-aided diagnosis, computer-guided surgery, measuring tissue volumes, locating tumors, and pathologies. One approach to segmentation is to use active contours or snakes. Active contours start from an initialization (often manually specified) and are guided by image-dependent forces to the object boundary. Snakes may also be guided by gradient vector fields associated with an image. The first main result in this direction is that of Xu and Prince, who proposed the notion of gradient vector flow (GVF), which is computed iteratively. We propose a new formalism to compute the vector flow based on the notion of bilateral filtering of the gradient field associated with the edge map - we refer to it as the bilateral vector flow (BVF). The range kernel definition that we employ is different from the one employed in the standard Gaussian bilateral filter. The advantage of the BVF formalism is that smooth gradient vector flow fields with enhanced edge information can be computed noniteratively. The quality of image segmentation turned out to be on par with that obtained using the GVF and in some cases better than the GVF.

Accurate performance analysis of single and opportunistic AF relay cooperation with imperfect cascaded channel estimates

Given the significant gains that relay-based cooperation promises, the practical problems of acquisition of channel state information (CSI) and the characterization and optimization of performance with imperfect CSI are receiving increasing attention. We develop novel and accurate expressions for the symbol error probability (SEP) for fixed-gain amplify-and-forward relaying when the destination acquires CSI using the time-efficient cascaded channel estimation (CCE) protocol. The CCE protocol saves time by making the destination directly estimate the product of the source-relay and relay-destination channel gains. For a single relay system, we first develop a novel SEP expression and a tight SEP upper bound. We then similarly analyze an opportunistic multi-relay system, in which both selection and coherent demodulation use imperfect estimates. A distinctive aspect of our approach is the use of as few simplifying approximations as possible, which results in new results that are accurate at signal-to-noise-ratios as low as 1 dB for single and multi-relay systems. Using insights gleaned from an asymptotic analysis, we also present a simple, closed-form, nearly-optimal solution for allocation of energy between pilot and data symbols at the source and relay(s).