Induktiokoneiden vyyhdenvalmistuksen ja kääminnän tulevaisuuden kapasiteettia sekä läpimenoajan lyhenemistä tukeva layout

Tämä insinöörityö tehtiin ABB Oy:n Pitäjänmäen konetehtaan Sähkökoneet -yksikölle. Työssä suunniteltiin Induktiokoneiden vyyhdenvalmistuksen ja kääminnän tulevaisuuden kapasiteettia sekä läpimenoajan lyhenemistä tukeva layout. Työssä kiinnitettiin huomiota myös järkeviin materiaalivirtoihin sekä työturvallisuuden parantamiseen. Työ aloitettiin kartoittamalla vyyhdenvalmistusten ja käämintöjen tilanne sekä tutkittiin tulevaisuudelle ennustettu kuormitus. Kartoituksen perusteella mietittiin, mitä välttämättömiä muutoksia tarvitsee tulevaisuudessa tehdä työtapojen, koneiden ja työpisteiden suhteen. Läpimenoaikoja tutkittiin ja mietittiin keinoja sen lyhentämiseksi. Edellä mainittujen perusteella lähdettiin suunnittelemaan layout, joka toteuttaisi kaikki vaaditut kriteerit mahdollisimman kattavasti. Työn tuloksena syntyi layout-ehdotus, joka kattaa vaaditut kriteerit käytössä oleviin tiloihin ja niiden sijaintiin nähden parhaalla mahdollisella tavalla. Tämä ehdotus on varsin varteenotettava, mikäli tuotantokäyttöön suunniteltu käsieristyskone ei sovellu sille tarkoitettuun käyttötarkoitukseen, eikä näin ollen tule tuotantokäyttöön. Tällä layoutilla on mahdollista parantaa työturvallisuutta raskaiden taakkojen kuljetusten vähentyessä, lyhentää läpimenoaikoja turhien siirtelyiden poistuttua ja tehdä materiaalivirroista loogisia. Näillä parannuksilla varmistuisi tulevaisuuden kuormituksen läpimenon kyseisillä osastoilla. Tästä lopputyöstä on hyötyä ABB:llä käynnissä olevalle vyyhdenvalmistus projektille, jonka tehtävänä on kehittää vyyhdenvalmistusta. Tämän lisäksi projektin tarkoituksena on miettiä vyyhdenvalmistukselle uusi layout, mikäli se nähdään tarpeelliseksi. Tekemäni kartoitus, layout ja parannusehdotukset ovat tarpeellisena pohjatietona tämän projektin edetessä. Tekemiäni parannusehdotuksia on jo osittain otettu käyttöön vyyhdenvalmistuksessa. Parannusehdotuksiani tullaan vyyhdenvalmistuksessa toteuttamaan, kokeilemaan ja kehittämään eteenpäin vielä jatkossakin.

Development of phase retrieval algorithm and techniques for optical spectrum analysis

Coherent anti-Stokes Raman scattering is the powerful method of laser spectroscopy in which significant successes are achieved. However, the non-linear nature of CARS complicates the analysis of the received spectra. The objective of this Thesis is to develop a new phase retrieval algorithm for CARS. It utilizes the maximum entropy method and the new wavelet approach for spectroscopic background correction of a phase function. The method was developed to be easily automated and used on a large number of spectra of different substances.. The algorithm was successfully tested on experimental data.

Efficient total variation algorithm for fetal MRI reconstruction

Fetal MRI reconstruction aims at finding a high-resolution image given a small set of low-resolution images. It is usually modeled as an inverse problem where the regularization term plays a central role in the reconstruction quality. Literature has considered several regularization terms s.a. Dirichlet/Laplacian energy [1], Total Variation (TV)based energies [2,3] and more recently non-local means [4]. Although TV energies are quite attractive because of their ability in edge preservation, standard explicit steepest gradient techniques have been applied to optimize fetal-based TV energies. The main contribution of this work lies in the introduction of a well-posed TV algorithm from the point of view of convex optimization. Specifically, our proposed TV optimization algorithm for fetal reconstruction is optimal w.r.t. the asymptotic and iterative convergence speeds O(1/n(2)) and O(1/root epsilon), while existing techniques are in O(1/n) and O(1/epsilon). We apply our algorithm to (1) clinical newborn data, considered as ground truth, and (2) clinical fetal acquisitions. Our algorithm compares favorably with the literature in terms of speed and accuracy.

Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted

Disseny, layout i planificació d'una empresa de producció d'equips foraborda elèctrics

Aquest projecte es basa en l'aplicació de models de simulació de processos a un exemple d'empresa de producció i la seva adaptació en dimensió i recursos al mercat en un entorn de poca capacitat d'inversió i finançament, de forma que l'entorn de simulació digital aporti valor a la presa de decisions emmarcada en l'estratègia de l'empresa en cada escenari de mercat en que aquesta es trobi. Es realitza el treball sobre el cas d'una empresa, INNOVANAUTIC, dedicada a la innovació, desenvolupament i producció de sistemes de propulsió d'embarcacions. La simulació es una tècnica que permet optimitzar els processos, representant-ne i comprovant el funcionament dels processos, tant entorns físics, de producció com dels serveis associats o subcontractacions de diferents processos i els seus impactes en la disponibilitat de recursos, espais i terminis d'entrega, sense haver de recórrer a procediments de prova i error sobre sistemes reals que impliquen costos a tots nivells en l'empresa. Aquestes metodologies son habitualment emprades en d'altres països o també en el nostre país però en empreses de gran tamany. El present treball, emmarcat dins un entorn socioeconòmic convuls, amb grans limitacions financeres i de recursos per les empreses, demostra com la utilització d'eines de simulació és útil per a PIMES en aquest entorn i permet el dimensionament i la modelització dels processos de forma que es permeti trobar els punts òptims en els que l'empresa ha de donar un pas de creixement en alguns dels paràmetres. La metodologia amb que s'elabora el present treball es la de plantejar una simulació complerta del procés, i definir diversos escenaris de mercat per als productes fabricats, cercant els punt òptims de canvi de dimensió de l'empresa atenent a espai físic, sotscontractació de processos, personal i recursos.

Pose-based SLAM with probabilistic scan matching algorithm using a mechanical scanned imaging sonar

This paper proposes a pose-based algorithm to solve the full SLAM problem for an autonomous underwater vehicle (AUV), navigating in an unknown and possibly unstructured environment. The technique incorporate probabilistic scan matching with range scans gathered from a mechanical scanning imaging sonar (MSIS) and the robot dead-reckoning displacements estimated from a Doppler velocity log (DVL) and a motion reference unit (MRU). The proposed method utilizes two extended Kalman filters (EKF). The first, estimates the local path travelled by the robot while grabbing the scan as well as its uncertainty and provides position estimates for correcting the distortions that the vehicle motion produces in the acoustic images. The second is an augment state EKF that estimates and keeps the registered scans poses. The raw data from the sensors are processed and fused in-line. No priory structural information or initial pose are considered. The algorithm has been tested on an AUV guided along a 600 m path within a marina environment, showing the viability of the proposed approach

A concurrent region growing algorithm guided by circumscribed contours

Image segmentation of natural scenes constitutes a major problem in machine vision. This paper presents a new proposal for the image segmentation problem which has been based on the integration of edge and region information. This approach begins by detecting the main contours of the scene which are later used to guide a concurrent set of growing processes. A previous analysis of the seed pixels permits adjustment of the homogeneity criterion to the region's characteristics during the growing process. Since the high variability of regions representing outdoor scenes makes the classical homogeneity criteria useless, a new homogeneity criterion based on clustering analysis and convex hull construction is proposed. Experimental results have proven the reliability of the proposed approach

Shout and Act: an Algorithm for Digital Objects Preservation Inspired from Rescue Robots

We adapt the Shout and Act algorithm to Digital Objects Preservation where agents explore file systems looking for digital objects to be preserved (victims). When they find something they “shout” so that agent mates can hear it. The louder the shout, the urgent or most important the finding is. Louder shouts can also refer to closeness. We perform several experiments to show that this system works very scalably, showing that heterogeneous teams of agents outperform homogeneous ones over a wide range of tasks complexity. The target at-risk documents are MS Office documents (including an RTF file) with Excel content or in Excel format. Thus, an interesting conclusion from the experiments is that fewer heterogeneous (varying skills) agents can equal the performance of many homogeneous (combined super-skilled) agents, implying significant performance increases with lower overall cost growth. Our results impact the design of Digital Objects Preservation teams: a properly designed combination of heterogeneous teams is cheaper and more scalable when confronted with uncertain maps of digital objects that need to be preserved. A cost pyramid is proposed for engineers to use for modeling the most effective agent combinations

An energy efficient vertical handover decision algorithm

As wireless communications evolve towards heterogeneousnetworks, mobile terminals have been enabled tohandover seamlessly from one network to another. At the sametime, the continuous increase in the terminal power consumptionhas resulted in an ever-decreasing battery lifetime. To that end,the network selection is expected to play a key role on howto minimize the energy consumption, and thus to extend theterminal lifetime. Hitherto, terminals select the network thatprovides the highest received power. However, it has been provedthat this solution does not provide the highest energy efficiency.Thus, this paper proposes an energy efficient vertical handoveralgorithm that selects the most energy efficient network thatminimizes the uplink power consumption. The performance of theproposed algorithm is evaluated through extensive simulationsand it is shown to achieve high energy efficiency gains comparedto the conventional approach.

Pk-yrityksen layout-suunnittelu ohutlevytuoteteollisuudessa

Diplomityössä käsitellään omistajanvaihdon myötä tapahtuvaa yritysten yhdentymistä pkt- sektorilla. Tutkimuksen tarkoituksena oli suunnitella layout uuteen halliin sekä suunnitella muuttoprosessi kokonaisuudessaan. Tutkimuksessa käsiteltiin koneiden siirron lisäksi myös yritysten yhdentymistä ja yritysfuusiota. Ratkaisumalleja haettiin kirjallisuudesta, tuotannon seuraamisesta ja edellisistä muutoista syntyneistä kokemuksista. Työn aikana kartoitettiin yritysten nykytilanne ja etsittiin siellä olevat parantamista vaativat kohdat. Lisäksi selvitettiin yritysten tuotanto layout -suunnittelua varten. Layoutin tekemisen runkona käytettiin Mutherin -layoutkaaviota. Tietojen pohjalta tehtiin kolme erillistä mallia, joista hyötyarvomatriisia hyväksi käyttäen valittiin yksi. Lisäksi yritysten yhdentymisen työkirjan avulla tehtiin lista tarvittavista toimenpiteistä ennen muuttoa sekä muuton jälkeen. Tutkimuksessa käsiteltiin myös yrityksen ohjelmainvestointeja sekä levytyökeskuksen että laserleikkauskoneen nestaukseen. Lisäksi työssä käsiteltiin myös uusia koneinvestointeja ja uutta organisaatiokaaviota.

Stress testing and risk evaluation of new capacity payment algorithm proposed by Market Council

In the Russian Wholesale Market, electricity and capacity are traded separately. Capacity is a special good, the sale of which obliges suppliers to keep their generating equipment ready to produce the quantity of electricity indicated by the System Operator. The purpose of the formation of capacity trading was the maintenance of reliable and uninterrupted delivery of electricity in the wholesale market. The price of capacity reflects constant investments in construction, modernization and maintenance of power plants. So, the capacity sale creates favorable conditions to attract investments in the energy sector because it guarantees the investor that his investments will be returned.

Solving Leontief Input-Output Model with Trapezoidal Fuzzy Numbers and Gauss-Seidel Algorithm

In this work a fuzzy linear system is used to solve Leontief input-output model with fuzzy entries. For solving this model, we assume that the consumption matrix from di erent sectors of the economy and demand are known. These assumptions heavily depend on the information obtained from the industries. Hence uncertainties are involved in this information. The aim of this work is to model these uncertainties and to address them by fuzzy entries such as fuzzy numbers and LR-type fuzzy numbers (triangular and trapezoidal). Fuzzy linear system has been developed using fuzzy data and it is solved using Gauss-Seidel algorithm. Numerical examples show the e ciency of this algorithm. The famous example from Prof. Leontief, where he solved the production levels for U.S. economy in 1958, is also further analyzed.