The Moderating Effect of Top Management\u27s Collective Mindfulness on the Relationship between Top Management Support and IS Function Performance

As an exploratory study we apply the concept of mindfulness to examine the moderating influence of cognitive processes of top management on the relationship between its support for the IS function and the overall IS function performance. In doing so we enhance our understanding of the underlying cognitive processes associated with top management in their support toward the IS function. We trace the origins of mindfulness in the psychology area to its final possible assimilation in IS research. We then broaden the potential application of collective mindfulness in IS research and embark on developing a scale of collective mindfulness in the IS context. Examination of such possible moderating influences in the context of top management support and IS performance may open doors for future, much deeper, integration of mindfulness in IS research and may help both research and practice in the continued quest for achieving reliable performance of IS

A Topology Control-Based Self-Organisation in Wireless Mesh Networks

An algorithm for self-organisation that assigns the channels intelligently in multi-radio wireless mesh networks (MR-WMN) is important for the proper operation of MR-WMN. The aim of the self-organisation algorithm is to reduce the overall interference and increase the aggregate capacity of the network. In this paper, we have first proposed a generic self-organisation algorithm that addresses these two challenges. The basic approach is that of a distributed, light-weight, cooperative multiagent system that guarantees scalability. Second, we have evaluated the performance of the proposed self-organisation algorithm for two sets of initialisation schemes. The initialisation process results in a topology control of MR-WMN by way of spatial distribution of connectivity between the mesh nodes. The results have been obtained for realistic scenarios of MR-WMN node densities and topologies. We have shown in addition the need to develop non-transmit power control based algorithms to achieve a further increase in system capacity

Scheduling problems with two competing agents

We consider the scheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion times of its jobs only. The objective functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs, and total weighted completion times. We obtain different scenarios, depending on the objective function of each agent, and on the structure of the processing system (single machine or shop). For each scenario, we address the complexity of various problems, namely, finding the optimal solution for one agent with a constraint on the other agent's cost function, finding single nondominated schedules (i.e., such that a better schedule for one of the two agents necessarily results in a worse schedule for the other agent), and generating all nondominated schedules

Pragmatic Philanthropy

Asian Philanthropy and Charitable Organizations; Social Investment in Asia; Social Delivery Organizations; Relationships and Philanthropy in Asia; Ultra-high Net-worth Individuals in Asia; How Social Investment Works in Asia; Impact of Charitable Giving in Asia; Relationship with Elites and Social Investment in Asi

Top Management Support, Collective Mindfulness, and Information Systems Performance

Mindfulness is a cognitive process that facilitates the discovery and correction of errors that might escalate. This study applies mindfulness theory to examine the impact of top management support for information systems on collective mindfulness, and that of collective mindfulness on IS performance. It treated such mindfulness in five dimensions, and top management support and IS performance as uni-dimensional. Forty-seven chief executive officers responded to a survey asking their perceptions of the constructs. Top management support predicted four of the dimensions with the strongest effect on sensitivity to IS operations. A negative path from support to commitment to IS resilience suggests a management predilection for planning over improvisation and adaptation. Sensitivity to IS operations alone predicted performance

Performance Evaluation of a Self-Organising Scheme for Multi-Radio Wireless Mesh Networks

Multi-Radio Wireless Mesh Networks (MR-WMN) can substantially increase the aggregate capacity of the Wireless Mesh Networks (WMN) if the channels are assigned to the nodes in an intelligent way so that the overall interference is limited. We propose a generic self-organisation algorithm that addresses the two key challenges of scalability and stability in a WMN. The basic approach is that of a distributed, light-weight, co-operative multiagent system that guarantees scalability. The usefulness of our algorithm is exhibited by the performance evaluation results that are presented for different MR-WMN node densities and typical topologies. In addition, our work complements the Task Group 802.11s Extended Service Set (ESS) Mesh networking project work that is in progress

Covering a line segment with variable radius discs

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of- view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing

Equilibrium in a two-agent assignment problem

In this paper we address a particular generalisation of the Assignment Problem (AP) in a Multi-Agent setting, where distributed agents share common resources. We consider the problem of determining Pareto-optimal solutions that satisfy a fairness criterion (equilibrium). We show that the solution obtained is equivalent to a Kalai Smorodinsky solution of a suitably defined bargaining problem and characterise the computational complexity of finding such an equilibrium. Additionally, we propose an exact solution algorithm based on a branch-and-bound scheme that exploits bounds obtained by suitably rounding the solutions of the corresponding linear relaxation, and give the results of extensive computational experiments. Copyright © 2009, Inderscience Publishers

Pragmatic Philanthropy

Asian Philanthropy and Charitable Organizations; Social Investment in Asia; Social Delivery Organizations; Relationships and Philanthropy in Asia; Ultra-high Net-worth Individuals in Asia; How Social Investment Works in Asia; Impact of Charitable Giving in Asia; Relationship with Elites and Social Investment in Asi