A linear programming duality approach to analyzing strictly nonblocking <Emphasis Type="Italic">d</Emphasis>-ary multilog networks under general crosstalk constraints

When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two routes share too many switching elements, then crosstalk introduced at those switching elements degrades signal quality. Vaez and Lea (IEEE Trans. Commun. 48:(2)316–323, 2000) introduced a parameter c which is the maximum number of distinct switching elements a route can share with other routes in the network. This is called the general crosstalk constraint. This paper presents a new method of analyzing strictly nonblocking multi-log networks under this general crosstalk constraint using linear programming duality.     

New perspectives on the governance of executive compensation: an examination of the role and effect of compensation consultants

We develop a multi-theoretic approach, drawing on economic, institutional, managerial power and social comparison literatures to explain the role of the external compensation consultant in the top management pay setting institutional field. Taking advantage of recent disclosure requirements in the UK, we collect data on compensation consultant use in 232 large companies. We show that consultants are a prevalent part of the CEO pay setting scene, and document evidence of all advisor use. Our econometric results show that consultant use is associated with firm size and the equity pay mix. We also show that CEO pay is positively associated with peer firms that share consultants, with higher board and consultant interlocks, and some evidence that where firms supply other business services to the firm, CEO pay is greater.     

An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem

We present a new Immune Algorithm, IMMALG, that incorporates a Stochastic Aging operator and a simple local search procedure to improve the overall performances in tackling the chromatic number problem (CNP) instances. We characterize the algorithm and set its parameters in terms of Kullback Entropy. Experiments will show that the IA we propose is very competitive with the state-of-art evolutionary algorithms.     

On edge orienting methods for graph coloring

We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge orienting problem is equivalent to finding the chromatic number of a graph. We study various properties of edge orienting methods in the context of local search for graph coloring. We then exploit these properties to derive four tabu search algorithms, each based on a different neighborhood. We compare these algorithms numerically to determine which are the most promising and to give potential research directions.     

The wireless network jamming problem

In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for a set of jamming devices in order to neutralize a wireless communication network. This problem is known as the wireless network jamming problem. We develop several mathematical programming formulations based on covering the communication nodes and limiting the connectivity index of the nodes. Two case studies are presented comparing the formulations with the addition of various percentile constraints. Finally, directions of further research are addressed.     

A note on special optimal batching structures to minimize total weighted completion time

A batch is a subset of jobs which must be processed jointly in either serial or parallel form. The algorithmic aspects of the batching scheduling problems have been extensively studied in the literature. This paper presents necessary and sufficient conditions of the existence of optimal batch sequences for the single machine, batching, total weighted completion time scheduling problems on two batching ways: (1) all jobs form one batch; (2) each batch contains a single job. This kind of conditions can help us to recognize some special optimal schedules quickly. Research supported by NSFC (10671183).     

Die Entwicklung der Fehler- und Feedbackkultur durch Team-Coaching

The development of an error culture and feedback culture by team coachingTeams and departments can be relieved of a tremendous burden and collaborate far more efficiently by mutually reflecting on making mistakes, giving and receiving feedback, calling meetings, trying things out in real life situations and, by doing so, establishing new forms of a culture that embraces failure and feedback. This approach works in areas such as team coaching. The purpose of this paper is to present a practical method for developing a team-based culture of learning from failure and feedback. The paper is designed to encourage professional trainers not to leave company employees and management on their own with the issue of establishing such a culture but to make the introduced tools a part of staff training, management and other company development programs as well as team workshops or to develop one’s own formats for introducing a culture of learning from failure and feedback.     

Gedanken zur Gestaltung einer professionellen Beratungsausbildung

Considerations on the design of a professional education of counselorsSome of the recently published articles about supervision-professionalizing are reflecting only sociological or psychological conceptions in order to describe and analyze professionality. In this article the authors discuss some of the mostly neglected points of view out of pedagogic and microsociologic professionalization-research (professional self, researching attitude). The existing requests of competence for supervisors are examined in order to test their teaching ability. Furthermore the content designs and didactic strategies for future counselor’s education are considered.