On the distribution of income and worker assignment under intra-firm spillovers, with an application to ideas and networks

We study the earnings structure and the equilibrium assignment of workers when workers exert intra-firm spillovers on each other.We allow for arbitrary spillovers provided output depends on some aggregate index of workers' skill. Despite the possibility of increasing returns to skills, equilibrium typically exists. We show that equilibrium will typically be segregated; that the skill space can be partitioned into a set of segments and any firm hires from only one segment. Next, we apply the model to analyze the effect of information technology on segmentation and the distribution of income. There are two types of human capital, productivity and creativity, i.e. the ability to produce ideas that may be duplicated over a network. Under plausible assumptions, inequality rises and then falls when network size increases, and the poorest workers cannot lose. We also analyze the impact of an improvement in worker quality and of an increased international mobility of ideas.

Simple heuristics for the assembly line worker assignment and balancing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Simple heuristics for the assembly line worker assignment and balancing problem

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.

Job rotation in assembly lines employing disabled workers

In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. All rights reserved.

Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Two extensions for the ALWABP: Parallel stations and collaborative approach

In this article, we introduce two new variants of the Assembly Line Worker Assignment and Balancing Problem (ALWABP) that allow parallelization of and collaboration between heterogeneous workers. These new approaches suppose an additional level of complexity in the Line Design and Assignment process, but also higher flexibility; which may be particularly useful in practical situations where the aim is to progressively integrate slow or limited workers in conventional assembly lines. We present linear models and heuristic procedures for these two new problems. Computational results show the efficiency of the proposed approaches and the efficacy of the studied layouts in different situations. (C) 2012 Elsevier B.V. All rights reserved.

Task assignment optimization in SAP Extended WarehouseManagement

Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex and difficult taskregarding to the different processes and factors in a usual warehouse when we want tominimize the labor costs. Most of the workers’ working time is spent with travelingbetween source and destination points which cause deadheading. Even if a worker knowsthe structure of a warehouse well and because of that he or she can find the shortest pathbetween two points, it is still not guaranteed that there won’t be long traveling timebetween the locations of two consecutive tasks. We need optimal assignments betweentasks and workers.In the scientific literature Generalized Assignment Problem (GAP) is a wellknownproblem which deals with the assignment of m workers to n tasks consideringseveral constraints. The primary purpose of my thesis project was to choose a heuristics(genetic algorithm, tabu search or ant colony optimization) to be implemented into SAPExtended Warehouse Management (SAP EWM) by with task assignment will be moreeffective between tasks and resources.After system analysis I had to realize that due different constraints and businessdemands only 1:1 assingments are allowed in SAP EWM. Because of that I had to use adifferent and simpler approach – instead of the introduced heuristics – which could gainbetter assignments during the test phase in several cases. In the thesis I described indetails what ware the most important questions and problems which emerged during theplanning of my optimized assignment method.

Spatio-temporal credit assignment in population learning

Learning by reinforcement is important in shaping animal behavior, and in particular in behavioral decision making. Such decision making is likely to involve the integration of many synaptic events in space and time. However, using a single reinforcement signal to modulate synaptic plasticity, as suggested in classical reinforcement learning algorithms, a twofold problem arises. Different synapses will have contributed differently to the behavioral decision, and even for one and the same synapse, releases at different times may have had different effects. Here we present a plasticity rule which solves this spatio-temporal credit assignment problem in a population of spiking neurons. The learning rule is spike-time dependent and maximizes the expected reward by following its stochastic gradient. Synaptic plasticity is modulated not only by the reward, but also by a population feedback signal. While this additional signal solves the spatial component of the problem, the temporal one is solved by means of synaptic eligibility traces. In contrast to temporal difference (TD) based approaches to reinforcement learning, our rule is explicit with regard to the assumed biophysical mechanisms. Neurotransmitter concentrations determine plasticity and learning occurs fully online. Further, it works even if the task to be learned is non-Markovian, i.e. when reinforcement is not determined by the current state of the system but may also depend on past events. The performance of the model is assessed by studying three non-Markovian tasks. In the first task, the reward is delayed beyond the last action with non-related stimuli and actions appearing in between. The second task involves an action sequence which is itself extended in time and reward is only delivered at the last action, as it is the case in any type of board-game. The third task is the inspection game that has been studied in neuroeconomics, where an inspector tries to prevent a worker from shirking. Applying our algorithm to this game yields a learning behavior which is consistent with behavioral data from humans and monkeys, revealing themselves properties of a mixed Nash equilibrium. The examples show that our neuronal implementation of reward based learning copes with delayed and stochastic reward delivery, and also with the learning of mixed strategies in two-opponent games.

Synthesis of novel O-acylated-D-ribono-1,5-lactones and structural assignment supported by conventional NOESY-NMR and x-ray analysis

A practical method for the structural assignment of 3,4-O-benzylidene-D-ribono-1,5-lactones and analogues using conventional NMR techniques and NOESY measurements in solution is described. 2-O-Acyl-3,4-O-benzylidene-D-ribono-1,5-lactones were prepared in good yields by acylation of Zinner’s lactone with acyl chlorides under mildly basic conditions. Structural determination of 2-O-(4-nitrobenzoyl)-3,4-O-benzylidene-D-ribono-1,5-lactone was achieved by single crystal x-ray diffraction, which supports the results based on spectroscopic data.

Synthesis and total H-1- and C-13-NMR assignment of cephem derivatives for use in ADEPT approaches

We report the synthesis and total NMR characterization of 5-thia-1-azabicyclo[4.2.0]oct-2-ene-2-carboxylic acid-3-[[[(4''-nitrophenoxy)carbonyl]oxy]-methyl]-8-oxo-7[(2-thienyloxoacetyl)amino]-diphenylmethyl ester-5-dioxide (5), a new cephalosporin derivative. This compound can be used as the carrier of a wide range of drugs containing an amino group. The preparation of the intermediate product, 5-thia-1-azabicyclo[4.2.0]oct-2-ene-2-carboxylic acid-3-[methyl-4-(6-methoxyquinolin-8-ylamino) pentylcarbamate]-8-oxo-7-[(2-thienyloxoacetyl)amino]-diphenylmethyl ester-5-dioxide (6), as well as the synthesis of the antimalarial primaquine prodrug 5-thia-1-azabicyclo[4.2.0]oct-2-ene-2-carboxylic acid-3-[methyl-4-(6-methoxyquinolin-8-ylamino) pentylcarbamate]-8-oxo-7-[(2-thienyloxoacetyl)amino]-5-dioxide (7) are also described, together with their total H-1- and C-13-NMR assignments.

Var transcription profiling of Plasmodium falciparum 3D7: assignment of cytoadherent phenotypes to dominant transcripts

Background: Cytoadherence of Plasmodium falciparum-infected red blood cells is mediated by var gene-encoded P. falciparum erythrocyte membrane protein-1 and host receptor preference depends in most cases on which of the 50-60 var genes per genome is expressed. Enrichment of phenotypically homogenous parasites by panning on receptor expressing cells is fundamental for the identification of the corresponding var transcript. Methods: P. falciparum 3D7 parasites were panned on several transfected CHO-cell lines and their var transcripts analysed by i) reverse transcription/PCR/cloning/sequencing using a universal DBL alpha specific oligonucleotide pair and ii) by reverse transcription followed by quantitative PCR using 57 different oligonucleotide pairs. Results: Each cytoadherence selected parasite line also adhered to untransfected CHO-745 cells and upregulation of the var gene PFD995/PFD1000c was consistently associated with cytoadherence to all but one CHO cell line. In addition, parasites panned on different CHO cell lines revealed candidate var genes which reproducibly associated to the respective cytoadherent phenotype. The transcription profile obtained by RT-PCR/cloning/sequencing differed significantly from that of RT-quantitative PCR. Conclusion: Transfected CHO cell lines are of limited use for the creation of monophenotypic cytoadherent parasite lines. Nevertheless, 3D7 parasites can be reproducibly selected for the transcription of different determined var genes without genetic manipulation. Most importantly, var transcription analysis by RT-PCR/cloning/sequencing may lead to erroneous interpretation of var transcription profiles.

Morphological Studies on the Mature Worker Larvae of Paratrechina fulva (Hymenoptera, Formicidae)

The ant Paratrechina fulva is native to Brazil, but has spread to other countries where it has become a serious pest. Their larvae are known from a preliminary description made without the aid of scanning electron microscopy. The present investigation aimed at describing the mature worker larvae of this species in deeper detail, while identifying useful morphological characters for taxonomy and cladistics. General morphological traits typical of Paratrechina larvae described so far were also confirmed with this species, particularly regarding body shape, types of hairs, and distribution pattern of head sensilla, but P fulva presented unusually shaped mandibles.

Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks

This paper presents a strategy for the solution of the WDM optical networks planning. Specifically, the problem of Routing and Wavelength Allocation (RWA) in order to minimize the amount of wavelengths used. In this case, the problem is known as the Min-RWA. Two meta-heuristics (Tabu Search and Simulated Annealing) are applied to take solutions of good quality and high performance. The key point is the degradation of the maximum load on the virtual links in favor of minimization of number of wavelengths used; the objective is to find a good compromise between the metrics of virtual topology (load in Gb/s) and of the physical topology (quantity of wavelengths). The simulations suggest good results when compared to some existing in the literature.

Detailed H-1 and C-13 NMR structural assignment and relative stereochemistry determination for three closely related sesquiterpene lactones

A complete analysis of H-1 and C-13 NMR spectra of the trypanocidal sesquiterpene lactone eremantholide C and two of its analogues is described. These structurally similar sesquiterpene lactones were submitted to H-1 NMR, C-13 (H-1) NMR, gCOSY, gHSQC, gHMBC, J-resolved and DPFGSE-NOE NMR techniques. The detailed analysis of those results, correlated to some computational calculations (molecular mechanics), led to the total and unequivocal assignment of all H-1 and C-13 NMR data. The determination of all H-1/H-1 coupling constants and all signal multiplicities, together with the elimination of previous ambiguities were also achieved. Copyright (C) 2008 John Wiley & Sons, Ltd.