El objetivo de la Tesis es realizar un proceso con nuevas técnicas en el análisis de fallas en los Laboratorios de Motorola con equipos especializados en tecnología iDEN con la finalidad de mejorar la calidad de reparación en los terminales radio celulares que proporciona Motorola del Perú al operador Nextel del Perú.

Syftet med detta arbete är att utforska hur Svenska Turistföreningen, i sina årsböcker mellan 1915-1919, förhåller sig i sina utsagor om människorna och landskapen till det regionala och det nationella. De frågeställningar som använts har varit: Vilka rumsligt anknutna utsagor finns om befolkningen i de olika landskapen och om landskapen som sådana? I vilken ut-sträckning bär dessa utsagor en regional eller nationell prägel? Sätts det regionala i kontrast till det nationella, eller ses det regionala som en del av det nationella? Hur talrika är dessa utsagor? Finns det en tendens att vissa landskapsskildringar innehåller fler eller färre av dessa utsagor? Finns det en förändring i dessa utsagor under den tid som undersökts? Källmaterialet har utgjorts av Svenska Turistföreningens årsskrifter mellan 1915-1919. Dessa behandlar Uppland, Småland, Bohuslän, Västmanland samt Skåne i den ordningen. För att uppnå syftet har en kvalitativ textanalys använts. Resultatet pekar på att det finns rumsligt anknutna utsa-gor i alla böcker men mängden och arten varierar kraftigt. Det finns alltså landskap som ges en starkare regionalitet, men i dessa fall knyter man detta landskap till nationen genom att t.ex. hävda att det regionala i landskapet är något utmärkande för hela landet.

<p>This Master’s Thesis deals with a special problem that may be of importance when planning a frequency hopping mobile communication network. In normal cases the Frequency Assignment Problem is solved, in order to plan the use of frequencies in a network. The special case discussed in this thesis occurs when the network operator requires that the frequencies must be arranged into groups. In this case the Frequency Assignment Problem must be solved with respect to the groups, i.e. a Group assignment Problem. </p><p>The thesis constitutes the final part of the Master of Science in Communication and Transport Systems Engineering education, at Linköping University, Campus Norrköping. The Group Arrangement Problem was presented by ComOpt, a company that has specialized in solving the Frequency Assignment Problem for network operators. </p><p>This thesis does not deal with solutions for the Frequency Assignment Problem, with respect to the groups. The main issue in the thesis is to construct a computer based algorithm that solves the Group Arrangement Problem, i.e. creating the groups. The goal is to construct an algorithm that creates groups which imply a better solution for the Frequency Assignment Problem than manually created groups. </p><p>Two algorithms are presented and tested on two cases. Their respective results for both cases are compared with the results from a manual grouping. The two computer based algorithms creates better groups than the manual grouping strategy, according to an artificial quality measure. As of spring 2003 a variant of one of the presented algorithms was implemented in ComOpt’s product for solving the Frequency Assignment Problem.</p>

This Master’s Thesis deals with a special problem that may be of importance when planning a frequency hopping mobile communication network. In normal cases the Frequency Assignment Problem is solved, in order to plan the use of frequencies in a network. The special case discussed in this thesis occurs when the network operator requires that the frequencies must be arranged into groups. In this case the Frequency Assignment Problem must be solved with respect to the groups, i.e. a Group assignment Problem. The thesis constitutes the final part of the Master of Science in Communication and Transport Systems Engineering education, at Linköping University, Campus Norrköping. The Group Arrangement Problem was presented by ComOpt, a company that has specialized in solving the Frequency Assignment Problem for network operators. This thesis does not deal with solutions for the Frequency Assignment Problem, with respect to the groups. The main issue in the thesis is to construct a computer based algorithm that solves the Group Arrangement Problem, i.e. creating the groups. The goal is to construct an algorithm that creates groups which imply a better solution for the Frequency Assignment Problem than manually created groups. Two algorithms are presented and tested on two cases. Their respective results for both cases are compared with the results from a manual grouping. The two computer based algorithms creates better groups than the manual grouping strategy, according to an artificial quality measure. As of spring 2003 a variant of one of the presented algorithms was implemented in ComOpt’s product for solving the Frequency Assignment Problem.