Democratic dialogue and collective learning in the context of self-managed teams

This paper provides a longitudinal, empirical view of the multifaceted and reciprocal processes of organizational learning in a context of self-managed teams. Organizational learning is seen as a social construction between people and actions in a work setting. The notion of learning as situated (Brown & Duguid 1989, Lave& Wenger 1991, Gherardi & al. 1998, Easterby-Smith & Araujo 1999, Abma 2003) opens up the possibility for placing the focus of research on learning in the community rather than in individual learning processes. Further, in studying processes in their social context, we cannot avoid taking power relations into consideration (Contu & Willmott 2003). The study is based on an action research with a methodology close to the ‘democratic dialogue’ presented by Gustavsen (2001). This gives a ground for research into how the learning discourse developed in the case study organization over a period of 5 years, during which time the company abandoned a middle management level of hierarchy and the teams had to figure out how to work as self-managed units. This paper discusses the (re)construction of power relations and its role in organizational learning. Power relations are discussed both in vertical and horizontal work relations. A special emphasis is placed on the dialectic between managerial aims and the space for reflection on the side of employees. I argue that learning is crucial in the search for the limits for empowerment and that these limits are negotiated both in actions and speech. This study unfolds a purpose-oriented learning process, constructing an open dialogue, and describes a favourable context for creative, knowledge building communities.

Brownian motion with drift threshold model

In this thesis we implement estimating procedures in order to estimate threshold parameters for the continuous time threshold models driven by stochastic di®erential equations. The ¯rst procedure is based on the EM (expectation-maximization) algorithm applied to the threshold model built from the Brownian motion with drift process. The second procedure mimics one of the fundamental ideas in the estimation of the thresholds in time series context, that is, conditional least squares estimation. We implement this procedure not only for the threshold model built from the Brownian motion with drift process but also for more generic models as the ones built from the geometric Brownian motion or the Ornstein-Uhlenbeck process. Both procedures are implemented for simu- lated data and the least squares estimation procedure is also implemented for real data of daily prices from a set of international funds. The ¯rst fund is the PF-European Sus- tainable Equities-R fund from the Pictet Funds company and the second is the Parvest Europe Dynamic Growth fund from the BNP Paribas company. The data for both funds are daily prices from the year 2004. The last fund to be considered is the Converging Europe Bond fund from the Schroder company and the data are daily prices from the year 2005.

Coding mode decision algorithm for binary descriptor coding

In visual sensor networks, local feature descriptors can be computed at the sensing nodes, which work collaboratively on the data obtained to make an efficient visual analysis. In fact, with a minimal amount of computational effort, the detection and extraction of local features, such as binary descriptors, can provide a reliable and compact image representation. In this paper, it is proposed to extract and code binary descriptors to meet the energy and bandwidth constraints at each sensing node. The major contribution is a binary descriptor coding technique that exploits the correlation using two different coding modes: Intra, which exploits the correlation between the elements that compose a descriptor; and Inter, which exploits the correlation between descriptors of the same image. The experimental results show bitrate savings up to 35% without any impact in the performance efficiency of the image retrieval task. © 2014 EURASIP.

A genetic algorithm for the resource constrained multi-project scheduling problem

This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

Single-objective spreading algorithm

This paper addresses the problem of finding several different solutions with the same optimum performance in single objective real-world engineering problems. In this paper a parallel robot design is proposed. Thereby, this paper presents a genetic algorithm to optimize uni-objective problems with an infinite number of optimal solutions. The algorithm uses the maximin concept and ε-dominance to promote diversity over the admissible space. The performance of the proposed algorithm is analyzed with three well-known test functions and a function obtained from practical real-world engineering optimization problems. A spreading analysis is performed showing that the solutions drawn by the algorithm are well dispersed.

Spatial distribution and socioeconomic context of tuberculosis in Rio de Janeiro, Brazil

OBJECTIVE To analyze the spatial distribution of risk for tuberculosis and its socioeconomic determinants in the city of Rio de Janeiro, Brazil.METHODS An ecological study on the association between the mean incidence rate of tuberculosis from 2004 to 2006 and socioeconomic indicators of the Censo Demográfico (Demographic Census) of 2000. The unit of analysis was the home district registered in the Sistema de Informação de Agravos de Notificação (Notifiable Diseases Information System) of Rio de Janeiro, Southeastern Brazil. The rates were standardized by sex and age group, and smoothed by the empirical Bayes method. Spatial autocorrelation was evaluated by Moran’s I. Multiple linear regression models were studied and the appropriateness of incorporating the spatial component in modeling was evaluated.RESULTS We observed a higher risk of the disease in some neighborhoods of the port and north regions, as well as a high incidence in the slums of Rocinha and Vidigal, in the south region, and Cidade de Deus, in the west. The final model identified a positive association for the variables: percentage of permanent private households in which the head of the house earns three to five minimum wages; percentage of individual residents in the neighborhood; and percentage of people living in homes with more than two people per bedroom.CONCLUSIONS The spatial analysis identified areas of risk of tuberculosis incidence in the neighborhoods of the city of Rio de Janeiro and also found spatial dependence for the incidence of tuberculosis and some socioeconomic variables. However, the inclusion of the space component in the final model was not required during the modeling process.

A genetic algorithm for project scheduling with multi-modes and renewable resources

This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.

Project scheduling under multiple resources constraints using a genetic algorithm

The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement procedure is applied to all solutions. The chromosomes supplied by the genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

A genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

This paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.

A two-level genetic algorithm for the multi-mode resource-constrained project scheduling problem

This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.

Implementation of fractional-order electromagnetic potential through a genetic algorithm

Several phenomena present in electrical systems motivated the development of comprehensive models based on the theory of fractional calculus (FC). Bearing these ideas in mind, in this work are applied the FC concepts to define, and to evaluate, the electrical potential of fractional order, based in a genetic algorithm optimization scheme. The feasibility and the convergence of the proposed method are evaluated.

Exposure to psychosocial risk factors in the context of work: a systematic review

ABSTRACT OBJECTIVE To analyze the scientific literature about the effects of exposure to psychosocial risk factors in work contexts. METHODS A systematic review was performed using the terms “psychosocial factors” AND “COPSOQ” in the databases PubMed, Medline, and Scopus. The period analyzed was from January 1, 2004 to June 30, 2012. We have included articles that used the Copenhagen Psychosocial Questionnaire (COPSOQ) as a measuring instrument of the psychosocial factors and the presentation of quantitative or qualitative results. German articles, psychometric studies or studies that did not analyze individual or work factors were excluded. RESULTS We included 22 articles in the analysis. Individual factors, such as gender, age, and socioeconomic status, were analyzed along with work-related factors such as labor demands, work organization and content, social relationships and leadership, work-individual interface, workplace values, justice and respect, personality, health and well-being, and offensive behaviors. We analyzed the sample type and the applied experimental designs. Some population groups, such as young people and migrants, are more vulnerable. The deteriorated working psychosocial environment is associated with physical health indicators and weak mental health. This environment is also a risk factor for the development of moderate to severe clinical conditions, predicting absenteeism or intention of leaving the job. CONCLUSIONS The literature shows the contribution of exposure to psychosocial risk factors in work environments and their impact on mental health and well-being of workers. It allows the design of practical interventions in the work context to be based on scientific evidences. Investigations in specific populations, such as industry, and studies with more robust designs are lacking.