Globally, hundreds of thousands of people subsist by informally collecting, sorting, and selling materials recovered from disposed solid waste. For most individuals this informal activity is precarious and prone to job insecurity, stigmatization, exploitation, physical danger, and emotional distress. In order to understand how informal recyclers perceive their health and hazards, data were collected over a six-month period in 2010, in Buenos Aires, Argentina. Through a political ecology framework, the authors relate the systemic and exploitative structures that continue to negatively influence the health of the recyclers. The authors demonstrate that independent informal recyclers face a number of multifaceted health implications that are directly related to the unregulated and undervalued collection of solid waste. Recyclers are either uninformed or indifferent about policy interventions, such as accessing free personal protective equipment. The article concludes by suggesting specific measures supported by the academic literature on inclusive waste management and social networks, advocating an emphasis on cooperativism as a means of creating a space for workplace health promotion and access to resources. / Graduate

Thesis (MSc)--Stellenbosch University, 2012. / ENGLISH ABSTRACT: Order picking is the most important activity in distribution centres. It involves the process of retrieving products from storage in response to a speci c customer request. The order picking system in a distribution centre used by Pep Stores Ltd. (Pep), located in Durban, South Africa, is considered. The order picking system in Pep utilises picking lines. The system requires that the pickers move in a clockwise direction around the picking line. The planning of picking lines may be divided into three tiers of decisions. The rst tier determines which Stock Keeping Units (SKUs) should be allocated to which picking line and is known as the SKU to Picking Line Assignment Problem (SPLAP). The second tier, the SKU Location Problem (SLP), considers the positioning of the various SKUs in a picking line. The nal tier considers the sequencing of the orders for pickers within a picking line and is referred to as the Order Sequencing Problem (OSP). Collectively, these three tiers aim to achieve the objective of picking all the SKUs for all the orders in the shortest possible time. The decisions associated with each tier are made sequentially during the planning of a picking line. Each problem therefore relies on the information generated by its predecessing tier(s). Initially the OSP is addressed. A number of heuristic and metaheuristic approaches are presented, together with an exact formulation to solve this tier. The size of the problem is reduced by using a relaxation of the problem that may be solved exactly. A number of greedy tour construction heuristics, a scope and ranking algorithm, methods based on awarding starting locations with respect to preference ratios and a modi ed assignment approach was used to solve the OSP. Furthermore, a tabu search, simulated annealing, genetic algorithm and a generalised extremal optimisation approach are used to solve the OSP. The solution quality and computational times of all the approaches are compared for the data provided by Pep, with the generalised extremal optimisation approach delivering the best solution quality. Two methods from the literature was used to model the SLP, whereafter an ant colony system was used to maximise the number of orders in common between adjacent SKUs. A number of agglomerative clustering algorithms were used from which dendrograms could be constructed. Two novel heuristic clustering algorithms were considered. The rst heuristic calculates a distance between two clusters as the set of orders that have to collect all the SKUs in both clusters, whereas the second method is based upon the frequency of SKUs within a cluster. Little or no improvement was achieved in most cases. The SPLAP was introduced by means of a number of possibilities of how to formulate objectives. A possible exact formulation is presented, followed by a nearest neighbour search, which was initially used to construct new picking lines based on all data sets. A di erent approach was then taken by means of a tabu search where the waves of two or three picking lines were altered. Signi cant savings may be incurred for large data sets. / AFRIKAANSE OPSOMMING: Die opmaak van bestellings is die belangrikste aktiwiteit in 'n distribusiesentrum. Dit behels dat geskikte hoeveelhede produkte uit stoorplekke opgespoor en herpak moet word om aan kleinhandeltakke gestuur te word. Die bedrywighede binne een van Pep Stores Ltd. (Pep) se distribusiesentrums in Durban, Suid-Afrika, word beskou. Die sisteem vereis dat die werkers in 'n kloksgewyse rigting om 'n uitsoeklyn beweeg. Die beplanning van die uitsoeklyne kan verdeel word in drie besluite/probleme. Die eerste besluit is watter voorraadeenhede (VEs) toegewys moet word aan watter uitsoeklyn. Die tweede besluit is in watter vakkies in die uitsoeklyn die VEs geplaas moet word, en word die VE-plasings probleem (VLP) genoem. Die nale besluit is in watter volgorde bestellings opgemaak moet word in 'n uitsoeklyn, en staan bekend as die volgorde-van-bestellings-probleem (VBP). Die doel van al drie hierdie probleme is om al die bestellings in 'n uitsoeklyn in die kortste moontlike tyd af te handel. Die besluite wat verband hou met elke vlak van besluit word opeenvolgend gedoen tydens die beplanning van 'n uitsoeklyn. Die oplossing van elke subprobleem berus op die inligting van die voorafgaande probleme. Aanvanlik word die VBP beskou. 'n Aantal heuristiese en metaheuristiese benaderings word aangebied saam met 'n eksakte formulering om die derde vlak op te los. Die grootte van die probleem is verminder deur die gebruik van 'n verslapping van 'n eksakte formulering. 'n Aantal toerkonstruksie heuristieke, 'n omvang en rangorde algoritme, metodes wat gebaseer is op die toekenning van beginpunte met betrekking tot voorkeurverhoudings en 'n veralgemeende toewysingsprobleem is gebruik om die VBP op te los. 'n Tabu-soektog, gesimuleerde tempering, genetiese algoritme en 'n veralgemeende-ekstreme-optimering-benadering word ook gebruik om die VBP op te los. Die oplossingsgehalte en berekeningstye van al die benaderings word vergelyk vir werklike data wat verskaf is deur Pep. Die veralgemeende-ekstreme-optimering-benadering lewer die beste oplossingsgehalte. Twee metodes uit die literatuur is gebruik om die VLP te modelleer, waarna 'n mier kolonie stelsel gebruik word om die aantal bestellings wat aangrensende VEs in gemeen het te maksimeer. 'n Aantal groeperingsalgoritmes word gebruik wat dendrogramme kan lewer. Twee heuristiese groeperingsalgoritmes word oorweeg. Die eerste heuristiek bereken die afstand tussen twee groepe as die aantal bestellings wat al die VEs in beide groepe moet versamel, terwyl die tweede metode gebaseer is op die frekwensie van VEs binne 'n groep. Min of geen verbeterings is in die meeste gevalle gevind. Die eerste besluit word bekend gestel na aanleiding van 'n aantal moontlike maniere om die doelwitte te formuleer. 'n Moontlike eksakte formulering word aangebied. 'n Alternatiewe benadering is geneem deur middel van 'n tabu-soektog waar die golwe van twee of drie uitsoeklyne gewysig word. Beduidende besparings word gerealiseer vir groot datastelle.

No description available.

Robotic bin picking is the problem of emptying a bin of randomly distributedobjects through a robotic interface. This thesis examines an SVM approach to ex-tract grasping points for a vacuum-type gripper. The SVM is trained on syntheticdata and used to classify the points of a non-synthetic 3D-scanned point cloud aseither graspable or non-graspable. The classified points are then clustered intograspable regions from which the grasping points are extracted. The SVM models and the algorithm as a whole are trained and evaluated againstcubic and cylindrical objects. Separate SVM models are trained for each type ofobject in addition to one model being trained on a dataset containing both typesof objects. It is shown that the performance of the SVM in terms accuracy isdependent on the objects and their geometrical properties. Further, it is shownthat the algorithm is reasonably robust in terms of successfully picking objects,regardless of the scale of the objects.

Graph augmentation concerns the addition of edges to a graph to satisfy some connectivity property of a graph. Previous research in this field has been preoccupied with edge augmentation; however the research in this document focuses on the addition of vertices to a graph to satisfy a specific connectivity property: ensuring that all the nodes of the graph are contained within cycles. A distinction is made between graph augmentation (edge addition), and graph enlargement (vertex addition). This document expands on previous research into a graph matching problem known as the “shoe matching problem” and the role of a graph enlargement algorithm in finding this solution. The aim of this research was to develop new and efficient algorithms to solve the graph enlargement problem as applied to the shoe matching problem and to improve on the naïve algorithm of Sanders. Three new algorithms focusing on graph enlargement and the shoe matching problem are presented, with positive results overall. The new enlargement algorithms: cost-optimised, matrix, and subgraph, succeeded in deriving the best result (least number of total nodes required) in 37%, 53%, and 57% of cases respectively (measured across 120 cases). In contrast, Sanders’s algorithm has a success rate of only 20%; thus the new algorithms have a varying success rate of approximately 2 to 3 times that of Sanders’s algorithm. / Computing / M. Sc. Computing

Problemet som avhandlats i detta projekt är plockkvalitén på DHL Supply Chain i Örebro som opererar som ett distributionscenter för Ford och Volvo. Fokus i detta projekt har varit på plockprocessen på Fords avdelning. Med stigande reklamationskostnader utan vidare ökning av omsättning av varor, har detta problem varit i fokus i syfte att identifiera orsakerna samt presentera lönsamma och implementeringsbara förbättringsförslag. Problemet att avhandla har därmed varit: ”På vilket sätt kan orderprocessen effektiviseras för att minska reklamationskostnader?” De tre reklamationstyperna som varit aktuella på grund av att de är mer vanligt förekommande är: • Fel kvantitet levererat • Fel artikel levererad • Skadad artikel levererad Dessa reklamationstyper har behandlats med hjälp av olika verktyg, samt Lean-principer. Jidoka låg till grund för att bygga in kvalitet i processen genom Poka Yoke för att försvåra potentialen att plocka fel i lagret. Även Paretodiagram har varit av stor vikt för att identifiera reklamationstypen som hade störst inverkan på processen. Resultatet av detta arbete är bl.a. förbättringsförslag i form av implementering av streckkodsläsare eller pick to voice. Även förbättringsförslag i form av en modifiering av en algoritm för att försöka minska felen i val av emballage för plocket har presenterats. / The problem that was studied in this project is the pick quality in DHL Supply Chain in Örebro, which operates as a distribution center for Ford and Volvo. This project focuses entirely on the processes of the Ford department. With rising claim costs without further increase in turnover of goods, this problem has been the focus in order to identify the causes to this condition and present profitable and implementable improvement proposals to enhance the current state. The main research question that is analyzed in this thesis has thus been “How can the efficiency of the ordering process be enhanced to reduce the claim costs?”. The three types of claims that have been relevant because of their higher occurrence rate are: • Wrong quantity delivered • Wrong item delivered • Damaged item delivered These types of claims have been processed using various tools and Lean principles. Jidoka was the basis for building quality in the process through Poka Yoke, to raise the difficulty of potential picking errors in the warehouse. Even Paretodiagram have been of great importance to identify the type of claim that have the greatest impact on the process. The result of this project is, among other things, improvement suggestions that include the implementation of handscanners and pick to voice. Even improvements in the form of a modification of an algorithm to try to reduce the errors in the selection of packaging for the picking process have been presented.

Orientador: Carlos Fernando Fiorini / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Artes / Made available in DSpace on 2018-08-10T11:50:06Z (GMT). No. of bitstreams: 1 Maia_MarcosdaSilva_M.pdf: 1288060 bytes, checksum: 0d432b91de9c8e88dcfd6fb1d21df8d0 (MD5) Previous issue date: 2007 / Resumo: Cordofones beliscados são instrumentos musicais que apresentam características variadas de timbres, advindas de suas formas, tamanhos, qualidade das cordas e diferentes maneiras de fazê-las vibrar. Desde a Antigüidade, as preferências oscilam entre o som obtido pelo pulsar das cordas com os dedos ou aquele produzido pela utilização de um plectro ou palheta. A técnica híbrida (do inglês, hybrid picking) refere-se à utilização simultânea da palheta e dos dedos. No violão, os bordões são tocados com palheta, presa entre o indicador e o polegar da mão direita, e as primas tangidas com qualquer combinação dos dedos médio, anular e mínimo. Dessa forma, a técnica funciona bem tanto para bases rítmico-harmônicas, como para músicas polifônicas e linhas melódicas. No presente trabalho, a tradicional simbologia do violão p-i-m-a (polegar, indicador, médio e anular) foi alterada. As letras p e i foram substituídas pelos símbolos usuais dos movimentos alternados da palheta: ou, mantendo-se as letras m-a e incluindo-se a letra c (chico, dedo mínimo em espanhol). Assim, a pesquisa objetivou contextualizar a técnica híbrida e sua aplicação ao violão, discorrendo sobre aspectos históricos referenciais ao uso da palheta e dedos; indicando exemplos musicais para a aplicação da técnica; enfatizando a importância da adequada seleção de palhetas para a mesma, bem como investigando sua aplicação por diversos músicos na atualidade e sua eficácia na realização de variados repertórios / Abstract: Plucked chordophones are musical instruments that offer a great variety of tones from their forms, sizes, quality of the strings and different ways of making them vibrate. Since ancient times, the preferences sway between the sound obtained by the vibration of the strings with the fingers or that produced by the use of a pick. Hybrid Picking refers to the simultaneous use of the pick and the fingers. In nylon strings guitar, the bass-strings are played with the pick, held between the right forefinger and the thumb, and the first strings are played with any combination of the middle, the ring and little fingers. Therefore, the technique works well for rhythm-harmonic bases, polyphonic music and melodic lines. In the present work, the traditional guitar terminology of p-i-m-a (from the Portuguese, polegar [thumb], indicador [forefinger], médio [middle finger] and anular [ring finger) was altered. The letters p and i were changed for the usual symbols of the picks¿ up and down movementsor, maintaining the m-a (middle and ring fingers) and including the c letter (chico, Spanish for little finger). So, this study aimed at contextualizing the hybrid picking applied for nylon strings guitar by discussing referential historical aspects of the use of the pick and the fingers; indicating musical examples for applying the technique; emphasizing the importance of adequate selection of picks for that, as well as by examining its application by diverse musicians from actuality and its efficacy for different repertoire / Mestrado / Praticas Interpretativas / Mestre em Música

Dynamic development of nuclear magnetic resonance spectroscopy (NMR) allowed fast acquisition of experimental data which determine structure and dynamics of macromolecules. Nevertheless, due to lack of appropriate computational methods, NMR spectra are still analyzed manually by researchers what takes weeks or years depending on protein complexity. Therefore automation of this process is extremely desired and can significantly reduce time of protein structure solving. In presented work, a new approach to automated three-dimensional protein NMR spectra analysis is presented. It is based on Histogram of Oriented Gradients and Bayesian Network which have not been ever applied in that context in the history of research in the area. Proposed method was evaluated using benchmark data which was established by manual labeling of 99 spectroscopic images taken from 6 different NMR experiments. Afterwards subsequent validation was made using spectra of upstream of N-ras protein. With the use of proposed method, a three-dimensional structure of mentioned protein was calculated. Comparison with reference structure from protein databank reveals no significant differences what has proven that proposed method can be used in practice in NMR laboratories.

No description available.

This thesis focuses on the storage location assignment problem using modern meta-heuristic techniques combined with realistic simulation. A graphical tool implemented as part of this work is capable of warehouse model creation, generation of synthetic customer orders, optimization of product allocation using state of the art techniques, extensive warehouse simulation, and a pathfinder capable of finding the shortest path for orders going through the system. The work presents the comparison between different approaches based on many parameters to reach the most efficient allocation of products to warehouse slots. The author conducted tests on an experimental warehouse featuring almost twice the throughput -- 57%. The benefit of this work is a possibility to create model of an already built warehouse and its simulation and optimization, driving impact on the throughput of the warehouse, saving the user's resources, or helping him in planning and bottle-neck identification. Furthermore, this thesis introduces a new approach to warehouse optimization and new optimization criteria.