I takt med att organisationers omgivande miljö beskrivs som alltmer dynamisk, ökar kritiken mot den budgeteringen, då budget anses var ett statiskt ekonomistyrningsverktyg. Trots medhållet som kritiken får visar empiriska studier att få företag faktiskt överger budget som huvudsakligt planerings- och kontrollverktyg (Sandalgaard 2012; Ekholm & Wallin 2000; Dokulil, Zlámalová & Popesko 2017). Till följd av Covid-19-pandemin under år 2020 förlorande många marknader sin förutsägbarhet vilket resulterade i osäkra omgivningar för många organisationer och branscher. Bilförsäljningen visade en hög variation under pandemiåret. Först tappade marknaden 40% av försäljningen och några månader senare fick den uppgång som täckte upp för de föregående förlorade intäkterna. Marknaden upplevde därmed en berg-och-dal-bana som ger insikt i hur budgetens praktiska användning sammanfaller med kritiserade svagheter. Genom att använda fem av de främsta argumenten i kritiken mot budgetering undersöker studien hur budgeten påverkas hos svenska bilåterförsäljare. Detta illustrerar behovet som bilåterförsäljarna har i en bransch vars omgivning påverkats av en oväntad osäkerhet. Sju bilåterförsäljare kontaktades och intervjuades i syfte att tillhandahålla den empiriska datan som i efterhand kompletterades genom de utvalda återförsäljarnas årsredovisningar. Genom detta urvalet utforskar studien en variation i behovet av budgeten. Studien kommer bland annat fram till att budgeten och dess komplement samspelar för att tillgodose de observerade bilåterförsäljarnas individuella behov av planering och kontroll. / The critique of budgeting has been growing louder during recent years as the influencing factors in the organizational environment is increasingly described as dynamic, while budgeting itself is seen as a static appliance in organizational management. However, despite the support this critique receives, empirical evidence shows that few companies actually abandon budgeting as one of their main tools for planning and control in financial management (Sandalgaard 2012; Ekholm & Wallin 2000; Dokulil, Zlámalová & Popesko 2017). Due to the Covid-19 pandemic year 2020, the wide consumer market lost its predictability, thus making it an uncertain environment for a majority of companies to act in. Sales of cars showed a wide variety during the pandemic year. First a decline of 40% in sales in the overall market and then an upswing which made up for previous loss. The car market had therefore experienced an interchangeable environment which contribute to giving insight to how the praxis of the budget coincide with the criticism. Using five of the main points in the critique against budgeting, the research area of this study, car retailers, were chosen to illuminate the need for the budget of retailers in an industry unexpectedly affected by uncertainty in the environment. Seven car retailer companies were contacted and interviewed to provide the empirical data which were later supplemented by the chosen companies’ annual reports. Through this selection this study explores a variety in the need for the budget. The results include that there is an interaction between the budget and the budget complement to satisfy the observed car retailers' individual needs of planning and control. This study is written in Swedish.

Data mining (DM) is the process of finding patterns and relationships in databases. The breakthrough in computer technologies triggered a massive growth in data collected and maintained by organisations. In many applications, these data arrive continuously in large volumes as a sequence of instances known as a data stream. Mining these data is known as stream data mining. Due to the large amount of data arriving in a data stream, each record is normally expected to be processed only once. Moreover, this process can be carried out on different sites in the organisation simultaneously making the problem distributed in nature. Distributed stream data mining poses many challenges to the data mining community including scalability and coping with changes in the underlying concept over time. In this thesis, the author hypothesizes that learning classifier systems (LCSs) - a class of classification algorithms - have the potential to work efficiently in distributed stream data mining. LCSs are an incremental learner, and being evolutionary based they are inherently adaptive. However, they suffer from two main drawbacks that hinder their use as fast data mining algorithms. First, they require a large population size, which slows down the processing of arriving instances. Second, they require a large number of parameter settings, some of them are very sensitive to the nature of the learning problem. As a result, it becomes difficult to choose a right setup for totally unknown problems. The aim of this thesis is to attack these two problems in LCS, with a specific focus on UCS - a supervised evolutionary learning classifier system. UCS is chosen as it has been tested extensively on classification tasks and it is the supervised version of XCS, a state of the art LCS. In this thesis, the architectural design for a distributed stream data mining system will be first introduced. The problems that UCS should face in a distributed data stream task are confirmed through a large number of experiments with UCS and the proposed architectural design. To overcome the problem of large population sizes, the idea of using a Neural Network to represent the action in UCS is proposed. This new system - called NLCS { was validated experimentally using a small fixed population size and has shown a large reduction in the population size needed to learn the underlying concept in the data. An adaptive version of NLCS called ANCS is then introduced. The adaptive version dynamically controls the population size of NLCS. A comprehensive analysis of the behaviour of ANCS revealed interesting patterns in the behaviour of the parameters, which motivated an ensemble version of the algorithm with 9 nodes, each using a different parameter setting. In total they cover all patterns of behaviour noticed in the system. A voting gate is used for the ensemble. The resultant ensemble does not require any parameter setting, and showed better performance on all datasets tested. The thesis concludes with testing the ANCS system in the architectural design for distributed environments proposed earlier. The contributions of the thesis are: (1) reducing the UCS population size by an order of magnitude using a neural representation; (2) introducing a mechanism for adapting the population size; (3) proposing an ensemble method that does not require parameter setting; and primarily (4) showing that the proposed LCS can work efficiently for distributed stream data mining tasks.

Data mining (DM) is the process of finding patterns and relationships in databases. The breakthrough in computer technologies triggered a massive growth in data collected and maintained by organisations. In many applications, these data arrive continuously in large volumes as a sequence of instances known as a data stream. Mining these data is known as stream data mining. Due to the large amount of data arriving in a data stream, each record is normally expected to be processed only once. Moreover, this process can be carried out on different sites in the organisation simultaneously making the problem distributed in nature. Distributed stream data mining poses many challenges to the data mining community including scalability and coping with changes in the underlying concept over time. In this thesis, the author hypothesizes that learning classifier systems (LCSs) - a class of classification algorithms - have the potential to work efficiently in distributed stream data mining. LCSs are an incremental learner, and being evolutionary based they are inherently adaptive. However, they suffer from two main drawbacks that hinder their use as fast data mining algorithms. First, they require a large population size, which slows down the processing of arriving instances. Second, they require a large number of parameter settings, some of them are very sensitive to the nature of the learning problem. As a result, it becomes difficult to choose a right setup for totally unknown problems. The aim of this thesis is to attack these two problems in LCS, with a specific focus on UCS - a supervised evolutionary learning classifier system. UCS is chosen as it has been tested extensively on classification tasks and it is the supervised version of XCS, a state of the art LCS. In this thesis, the architectural design for a distributed stream data mining system will be first introduced. The problems that UCS should face in a distributed data stream task are confirmed through a large number of experiments with UCS and the proposed architectural design. To overcome the problem of large population sizes, the idea of using a Neural Network to represent the action in UCS is proposed. This new system - called NLCS { was validated experimentally using a small fixed population size and has shown a large reduction in the population size needed to learn the underlying concept in the data. An adaptive version of NLCS called ANCS is then introduced. The adaptive version dynamically controls the population size of NLCS. A comprehensive analysis of the behaviour of ANCS revealed interesting patterns in the behaviour of the parameters, which motivated an ensemble version of the algorithm with 9 nodes, each using a different parameter setting. In total they cover all patterns of behaviour noticed in the system. A voting gate is used for the ensemble. The resultant ensemble does not require any parameter setting, and showed better performance on all datasets tested. The thesis concludes with testing the ANCS system in the architectural design for distributed environments proposed earlier. The contributions of the thesis are: (1) reducing the UCS population size by an order of magnitude using a neural representation; (2) introducing a mechanism for adapting the population size; (3) proposing an ensemble method that does not require parameter setting; and primarily (4) showing that the proposed LCS can work efficiently for distributed stream data mining tasks.

Data mining (DM) is the process of finding patterns and relationships in databases. The breakthrough in computer technologies triggered a massive growth in data collected and maintained by organisations. In many applications, these data arrive continuously in large volumes as a sequence of instances known as a data stream. Mining these data is known as stream data mining. Due to the large amount of data arriving in a data stream, each record is normally expected to be processed only once. Moreover, this process can be carried out on different sites in the organisation simultaneously making the problem distributed in nature. Distributed stream data mining poses many challenges to the data mining community including scalability and coping with changes in the underlying concept over time. In this thesis, the author hypothesizes that learning classifier systems (LCSs) - a class of classification algorithms - have the potential to work efficiently in distributed stream data mining. LCSs are an incremental learner, and being evolutionary based they are inherently adaptive. However, they suffer from two main drawbacks that hinder their use as fast data mining algorithms. First, they require a large population size, which slows down the processing of arriving instances. Second, they require a large number of parameter settings, some of them are very sensitive to the nature of the learning problem. As a result, it becomes difficult to choose a right setup for totally unknown problems. The aim of this thesis is to attack these two problems in LCS, with a specific focus on UCS - a supervised evolutionary learning classifier system. UCS is chosen as it has been tested extensively on classification tasks and it is the supervised version of XCS, a state of the art LCS. In this thesis, the architectural design for a distributed stream data mining system will be first introduced. The problems that UCS should face in a distributed data stream task are confirmed through a large number of experiments with UCS and the proposed architectural design. To overcome the problem of large population sizes, the idea of using a Neural Network to represent the action in UCS is proposed. This new system - called NLCS { was validated experimentally using a small fixed population size and has shown a large reduction in the population size needed to learn the underlying concept in the data. An adaptive version of NLCS called ANCS is then introduced. The adaptive version dynamically controls the population size of NLCS. A comprehensive analysis of the behaviour of ANCS revealed interesting patterns in the behaviour of the parameters, which motivated an ensemble version of the algorithm with 9 nodes, each using a different parameter setting. In total they cover all patterns of behaviour noticed in the system. A voting gate is used for the ensemble. The resultant ensemble does not require any parameter setting, and showed better performance on all datasets tested. The thesis concludes with testing the ANCS system in the architectural design for distributed environments proposed earlier. The contributions of the thesis are: (1) reducing the UCS population size by an order of magnitude using a neural representation; (2) introducing a mechanism for adapting the population size; (3) proposing an ensemble method that does not require parameter setting; and primarily (4) showing that the proposed LCS can work efficiently for distributed stream data mining tasks.

Aim of this thesis is to search the market for suitable autonomous robot to be used by smart house. The research in this work is partly done on the range of abilities of smart houses in matter of sensor systems, ability of data processing and their use by mobile robots. The output of this thesis is robotics application written using Microsoft Robotics Developer Studio (C#) and simulated using Visual Simulation Environment. Main feature of this robotic application is the interface between robot and smart house, and robot and user. This interface enables employer to directly control robot's movement or to use automated pathfinding. The robot is able to navigate in dynamic environment and to register, interact and eventually forget temporary obstacles.

Aim of this thesis is to search the market for suitable autonomous robot to be used by smart house. The research in this work is partly done on the range of abilities of smart houses in matter of sensor systems, ability of data processing and their use by mobile robots. The output of this thesis is robotics application written using Microsoft Robotics Developer Studio (C#) and simulated using Visual Simulation Environment. Main feature of this robotic application is the interface between robot and smart house, and robot and user. This interface enables employer to directly control robot's movement or to use automated pathfinding. The robot is able to navigate in dynamic environment and to register, interact and eventually forget temporary obstacles.