Relationships between employees and their nomadic, non-territorial work environment

Recent and current socio-cultural trends are significant factors impacting on how business is conduced and correspondingly, on how work environments are designed. New communication technology is helping to break physical boundaries and change the way and speed of conducting business. One of the main characteristics of these new workplaces is non-permanency wherein the individual employee has no dedicated personally assigned office, work station, or desk. In this non-territorial, nomadic situation, employees undertake their work tasks in a wide variety of work settings inside and outside the office building. Such environments are understood to be must suitable where there is the need for high interaction with others as well as a high level of concentrated, independent work. This thesis reports on a project designed to develop a deeper understanding of the relationships between people (P) and their built environment (E) in the context of everyday work practice in a nomadic and non-territorial work environment. To achieve this, the study focuses on the experiences of employees as they understand them in relation to their work and the designed/ physical work environment. In this sense, the study is qualitative and grounded in nature. It does not assume any previously established theory nor test any presenting hypothesis. Instead it interviews the participants about their situations at work in their workplace, interprets natural interaction and creates a foundation for the development of theory informing workplace design, particularly theory that recognises the human nature of work and the need, as highlighted by several seminal researchers, for a greater understanding of how people manage and adapt in dynamic work environments.

The Melbourne Decision-Making Questionnaire : an instrument for measuring patterns for coping with decisional conflict

A study was conducted to examine the factorial validity of the Flinders Decision Making Questionnaire (Mann, 1982), a 31-item self-report inventory designed to measure tendencies to use three major coping patterns identified in the conflict theory of decision making (Janis and Mann, 1977): vigilance, hypervigilance, and defensive avoidance (procrastination, buck-passing, and rationalization). A sample of 2051 university students, comprising samples from Australia (n=262), New Zealand (n=260), the USA (n=475), Japan (n=359), Hong Kong (n=281) and Taiwan (n=414) was administered the DMQ. Factorial validity of the instrument was tested by confirmatory factor analysis with LISREL. Five different substantive models, representing different structural relationships between the decision-coping patterns had unsatisfactory fit to the data and could not be validated. A shortened instrument, containing 22 items, yielded a revised model comprising four identifiable factors-vigilance, hypervigilance, buck-passing, and procrastination. The revised model had adequate fit with data for each country sample and for the total sample, and was confirmed. It is recommended that the 22-item instrument, named the Melbourne DMQ, replace the Flinders DMQ for measurement of decision-coping patterns.

QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm

In the filed of semantic grid, QoS-based Web service scheduling for workflow optimization is an important problem.However, in semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the scheduling consider not only quality properties of Web services, but also inter service dependencies which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address scheduling optimization problems in workflow applications in the presence of domain constraints and inter service dependencies. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

QoS-based web service composition accommodating inter-service dependencies using minimal-conflict , hill-climbing repair genetic algorithm

In the field of semantic grid, QoS-based Web service composition is an important problem. In semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the composition consider not only QoS properties of Web services, but also inter service dependencies and conflicts which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address the Web service composition optimization problem in the presence of domain constraints and inter service dependencies and conflicts. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

Safety climate and relational conflict in the eyes of team members : examining the role of need for closure

This study was aimed at examining the safety climate and relational conflict within teams at the individual level. A sample of 372 respondents, divided into 50 teams, was used to test our hypothesis. It was proposed - and discovered - that team members’ individual differences in need for closure mitigated the negative relationship between perceptions of team safety climate and team relational conflict. The implications of our findings and the study’s limitations are discussed.

Motor conflict in Stroop tasks : direct evidence from single-trial electro-myography and electro-encephalography

Several brain imaging studies have assumed that response conflict is present in Stroop tasks. However, this has not been demonstrated directly. We examined the time-course of stimulus and response conflict resolution in a numerical Stroop task by combining single-trial electro-myography (EMG) and event-related brain potentials (ERP). EMG enabled the direct tracking of response conflict and the peak latency of the P300 ERP wave was used to index stimulus conflict. In correctly responded trials of the incongruent condition EMG detected robust incorrect response hand activation which appeared consistently in single trials. In 50–80% of the trials correct and incorrect response hand activation coincided temporally, while in 20–50% of the trials incorrect hand activation preceded correct hand activation. EMG data provides robust direct evidence for response conflict. However, congruency effects also appeared in the peak latency of the P300 wave which suggests that stimulus conflict also played a role in the Stroop paradigm. Findings are explained by the continuous flow model of information processing: Partially processed task-irrelevant stimulus information can result in stimulus conflict and can prepare incorrect response activity. A robust congruency effect appeared in the amplitude of incongruent vs. congruent ERPs between 330–400 ms, this effect may be related to the activity of the anterior cingulate cortex.

Conflict resolution through negotiation in a railway open access market : a multi-agent system approach

Open access reforms to railway regulations allow multiple train operators to provide rail services on a common infrastructure. As railway operations are now independently managed by different stakeholders, conflicts in operations may arise, and there have been attempts to derive an effective access charge regime so that these conflicts may be resolved. One approach is by direct negotiation between the infrastructure manager and the train service providers. Despite the substantial literature on the topic, few consider the benefits of employing computer simulation as an evaluation tool for railway operational activities such as access pricing. This article proposes a multi-agent system (MAS) framework for the railway open market and demonstrates its feasibility by modelling the negotiation between an infrastructure provider and a train service operator. Empirical results show that the model is capable of resolving operational conflicts according to market demand.

Railway junction conflict resolution by genetic algorithm

In general, simple and traditional methods are applied to resolve traffic conflicts at railway junctions. They are, however, either inefficient or computationally demanding. A simple genetic algorithm is presented to enable a search for a near optimal resolution to be carried out while meeting the constraints on generation evolution and minimising the search time.

The conflict resolution in connected railway junctions

Purpose of study: Traffic conflicts occur when trains on different routes approach a converging junction in a railway network at the same time. To prevent collisions, a right-of-way assignment is needed to control the order in which the trains should pass the junction. Such control action inevitably requires the braking and/or stopping of trains, which lengthens their travelling times and leads to delays. Train delays cause a loss of punctuality and hence directly affect the quality of service. It is therefore important to minimise the delays by devising a suitable right-of-way assignment. One of the major difficulties in attaining the optimal right-of-way assignment is that the number of feasible assignments increases dramatically with the number of trains. Connected-junctions further complicate the problem. Exhaustive search for the optimal solution is time-consuming and infeasible for area control (multi-junction). Even with the more intelligent deterministic optimisation method revealed in [1], the computation demand is still considerable, which hinders real-time control. In practice, as suggested in [2], the optimality may be traded off by shorter computation time, and heuristic searches provide alternatives for this optimisation problem.

Railway junction conflict resolution by local search method

This study investigates the application of local search methods on the railway junction traffic conflict-resolution problem, with the objective of attaining a quick and reasonable solution. A procedure based on local search relies on finding a better solution than the current one by a search in the neighbourhood of the current one. The structure of neighbourhood is therefore very important to an efficient local search procedure. In this paper, the formulation of the structure of the solution, which is the right-of-way sequence assignment, is first described. Two new neighbourhood definitions are then proposed and the performance of the corresponding local search procedures is evaluated by simulation. It has been shown that they provide similar results but they can be used to handle different traffic conditions and system requirements.