This is a report for our thesis that was conducted as a conclusion of our bachelor degree in Business engineering at the Royal Institute of Technology (KTH). The work is done in cooperation with the firm Navigate Consulting Business Solutions AB.They have their leading expertise in Oracle E-Business Suite and has previously chosen to implement Oracle EBS R12. The modules that are planned to be implemented are general ledger (GL), accounts payable (AP), accounts receivable (AR), project module (PA), purchases, and CRM. For a consulting company like Navigate, it is particularly important to have a simple and effective time reporting process. We were therefore asked to provide new tabs with a decision-making process to determine if Oracle Time & Labor (OTL) is a useful time tracking system for their business.In order to achieve the company´s aim and objective we decided to follow a development method with five different phases.

In this study, we looked at how balanced the various christian denominations in Sweden were raised in the news, on the basis of the requirement for balanced reporting. To measure the balance, we utilized Harcup and O'Neill?s news values and studied to what degree these values occurs in association with news articles that address the various denominations. The following denominations were selected for this study; Word of Life, the Pentecostal Church, Jehovah's witnesses, the Catholic Church, the Salvation Army and the Swedish Church. These denominations were then studied on the basis of news values in four of Sweden?s largest news organisations, in terms of audience numbers.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The last two decades have changed the society from the Industrial Age to the Information Age. The technological development, especially in IT, has caused a ?Revolution in Military Affairs?. However; how big are the changes RMA will give, or will it even change the foundation of the Art of War and if so, in what way?RMA has three cornerstones DBA, DS and PE all closely integrated in an NCW-concept.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

Glulam is a product that was engineered to make use of timber in a more efficient way. Bychoosing timber of similar quality and discarding natural defects during production, thedevelopment of a stronger cross-section is achieved.Carbon fiber is a relatively new material with a high tension capacity. This feature is used toexamine how the bending capacity of the beams improve by adhering carbon fiber laminateson the lower edge of the beamsThe strength of the material is tested with three experiments: carbon fiber on the bottom of thebeam (a), carbon fiber attached to the lower sides of the beam (b) and carbon fiber in thebeam, covered with a layer of wood (c)The results show that the first case, where the carbon fiber is attached to the bottom of thebeam, gave the best result with an increase in capacity of 59 % compared to the nonreinforcedcontrol. The other two cases also show an improvement in capacity, beam-type 3had a capacity increase of 47% and beam-type 4 increased with 25 %Tests were also made with glulam beams reinforced with fiberglass, but these tests were notanalyzed in depth because the purpose was to compare the capacity to carbon fiber. Thisbeam improved its capacity by 40.3%.The tests show that carbon fiber as a reinforcement material for glulam is a good choice whenthere is a requirement for stronger cross-sections in both new production and renovation ofold buildings.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

When contemplating entering an alliance the rationale behind the decision should differdepending on the size of the companies involved as well as on other important factors. The importantfactors influencing the decision are related to the resource pooling potential of the alliance,the power structure along with the business network the companies are a part of. Theanalysis has shown proof of a need for cooperation if one wish to succeed in the telecommunicationindustry and it has also determined which resources that are deemed to be most important toget in touch with, for our study object, to facilitate its access to the market. Those resources aredefined as a direct channel to the customer, funds/capital and the access to relevant businessnetworks. To get in touch with these lacking resources, three alternative approaches has beenproposed; all of them involving a strategic alliance decision.

We have through our theoretical framework been able to create a simplified measuring tool for a KIZ; the S-TKL. We have found that the S-TKL is possible to implement on the Öresund Region but with some flaws. Even though the Öresund Region has implemented the mindset of a KIZ, accurate statistics are in some areas hard to find. We can also through our empirical findings say that it is difficult to use the S-TKL on Shenzhen. The data we have found gives a good indication of both of the regions.

The health care sector is one of the most information-intensive institutions in Sweden. Big investments in information technology have been made to ensure efficiency and quality within organisations in health care. This has led to high requirements in documentation and resulted in an increase in administration which gradually more often is done by nurses and doctors. A major problem is that it is difficult to gain access to the information recorded in all the different systems, which is their objective. This causes double documentation instead of being a support in follow-up performance.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.