Version control systems are an asset to software development, enabling developers to keep snapshots of the code as they work. Stored in the version control system is the entire history of the software project, rich in information about who is contributing to the project, when contributions are made, and to what part of the project they are being made. Presented in the right way, this information can be made invaluable in helping software developers continue the development of the project, and maintainers to understand how the changes to the current version can be applied to older versions of projects. Maintainers are unable to effectively use the information stored within a software repository to assist with the maintanance older versions of that software in highly-collaborative projects. The Linux kernel repository is an example of such a project. This thesis focuses on improving visualizations of the Linux kernel repository, developing new visualizations that help answer questions about how commits are integrated into the project. Older versions of the kernel are used in a variety of systems where it is impractical to update to the current version of the kernel. Some of these applications include the controllers for spacecrafts, the core of mobile phones, the operating system driving internet routers, and as Internet-Of-Things (IOT) device firmware. As vulnerabilities are discovered in the kernel, they are patched in the current version. To ensure that older versions are also protected against the vulnerabilities, the patches applied to the current version of the kernel must be applied back to the older version. To do this, maintainers must be able to understand how the patch that fixed the vulnerability was integrated into the kernel so that they may apply it to the old version as well. This thesis makes four contributions: (1) a new tree-based model, the \mt{}, that abstracts the commits in the repository, (2) three visualizations that use this model, (3) a tool called \tool{} that uses these visualizations, (4) a user study that evaluates whether the tool is effective in helping users answer questions related to how commits are integrated about the Linux repository. The first contribution includes the new tree-based model, the algorithm that constructs the trees from the repository, and the evaluation of the results of the algorithm. the second contribution demonstrates some of the potential visualizations of the repository that are made possible by the model, and how these visualizations can be used depending on the structure of the tree. The third contribution is an application that applies the visualizations to the Linux kernel repository. The tool was able to help the participants of the study with understanding how commits were integrated into the Linux kernel repository. Additionally, the participants were able to summarize information about merges, including who made the most contributions, which file were altered the most, more quickly and accurately than with Gitk and the command line tools. / Graduate

In a previous paper “Merging Multiple Telemetry Files From Widely Separated Sources For Improved Data Integrity” presented at the 2012 ITC\USA conference, a method for synchronizing TM files at the minor frame level was presented. This paper expands on that work by describing a method for synchronizing the files at the minor frame level faster and at the earliest frame possible using an internal counter. This method is also useful if the minor frames fall out of sync due to large dropouts.

No description available.

No description available.

XML files are frequently used by developers when building Web applications or Java EE applications. However, maintaining XML files is challenging and time-consuming because the correct usage of XML entities is always domain-specific and rarely well documented. Also, the existing compilers and program analysis tools seldom examine XML files. In this thesis, we developed a novel approach to XML file debugging called Xeditor where we extract XML consistency rules from open-source projects and use these rules to detect XML bugs. There are two phases in Xeditor: rule inference and application. To infer rules, Xeditor mines XML-based deployment descriptors in open-source projects, extracting XML entity pairs that frequently co-exist in the same files and refer to the same string literals. Xeditor then applies association rule mining to the extracted pairs. For rule application, given a program commit, Xeditor checks whether any updated XML file violates the inferred rules; if so, Xeditor reports the violation and suggests an edit for correction?. Our evaluation shows that Xeditor inferred rules with high precision (83%). For injected XML bugs, Xeditor detected rule violations and suggested changes with 74.6% precision, 50% recall. More importantly, Xeditor identified 31 really erroneous XML updates in version history, 17 of which updates were fixed by developers in later program commits. This observation implies that by using Xeditor, developers would have avoided introducing errors when writing XML files. Finally, we compared Xeditor with a baseline approach that suggests changes based on frequently co-changed entities, and found Xeditor to outperform the baseline for both rule inference and rule application. / XML files are frequently used in Java programming and when building Web application implementation. However, it is a challenge to maintain XML files since these files should follow various domain-specific rules and the existing program analysis tools seldom check XML files. In this thesis, we introduce a new approach to XML file debugging called Xeditor that extracts XML consistency rules from open-source projects and uses these rules to detect XML bugs. To extract the rules, Xeditor first looks at working XML files and finds all the pairs of entities A and B, which entities coexist in one file and have the same value on at least one occasion. Then Xeditor will check when A occurs, what is the probability that B also occurs. If the probability is high enough, Xeditor infers a rule that A is associated with B. To apply the rule, Xeditor checks XML files with errors. If a file violates the rules that were previously inferred, Xeditor will report the violation and suggest a change. Our evaluation shows that Xeditor inferred the correct rules with high precision 83%. More importantly, Xeditor identified issues in previous versions of XML files, and many of those issues were fixed by developers in later versions. Therefore, Xeditor is able to help find and fix errors when developers write their XML files.

<p>In a fast moving environment and in a globalized market, companies are searching efficient distribution methods that enable broad product assortment, lower level of inventories, shorter customer order fulfilment, lower transportation costs in order to achieve a more efficient procurement process and a improved customer service. This paper will focus on a new solution in supply chain design to solve these trade-offs between management cost cutting and higher customer level within markets characterized by an increasing globalisation. Merge in transit (MIT) distribution method allows companies to reduce inventory and transportation costs while guaranteeing a high customer perceived service level. It is a new technique in which goods shipped from several supply locations are consolidated into one final customer delivery. The company needs to coordinate shipments so that they arrive simultaneously and goods can be bundled and shipped immediately to the final customer for arrival on due date. Economical benefits and drawbacks will be investigated from a supply chain prospective.</p>

In a fast moving environment and in a globalized market, companies are searching efficient distribution methods that enable broad product assortment, lower level of inventories, shorter customer order fulfilment, lower transportation costs in order to achieve a more efficient procurement process and a improved customer service. This paper will focus on a new solution in supply chain design to solve these trade-offs between management cost cutting and higher customer level within markets characterized by an increasing globalisation. Merge in transit (MIT) distribution method allows companies to reduce inventory and transportation costs while guaranteeing a high customer perceived service level. It is a new technique in which goods shipped from several supply locations are consolidated into one final customer delivery. The company needs to coordinate shipments so that they arrive simultaneously and goods can be bundled and shipped immediately to the final customer for arrival on due date. Economical benefits and drawbacks will be investigated from a supply chain prospective.

Syfte – Syftet är att undersöka om en merge-in-transit-lösning kan användas vid distributionen av prover inom ett klädföretag för att säkerställa låga kostnader, korta ledtider och kontroll. Metod – En fallstudie har gjorts i samarbete med Didriksons för att uppnå studiens syfte. Datainsamlingsmetoder såsom intervjuer och dokumentstudier har legat till grund för insamlandet av empiri, som kontinuerligt har analyserats mot studiens teoretiska ramverk. Därigenom har studiens resultat utformats. Resultat - Resultatet visar på att en merge-in-transit (MIT)-lösning skulle vara att föredra inom klädbranschen på grund av de tidskrav som finns på snabba leveranser. Vidare framgår det att det är av största vikt att få kommunikationen mellan aktörerna i försörjningskedjan att integrera om en MIT-lösning ska användas. En MIT-lösning kan sänka de direkta transportkostnaderna med 69 procent, samtidigt som studien tyder på att kapitalbindningen och tullkostnaderna minskas. Ökade lagerhållningskostnader kommer att uppstå på grund av inhyrandet i en terminal med MIT-tjänsten som tillkommer. Vad gäller ledtiden kommer den totala ledtiden att reduceras med 15 procent, vilket innebär att leverantörerna fårlängre tid på sig att producera och kan minska antalet delleveranser. Genom att leverantörerna producerar mer till första delleveransen får försäljarna mer i sin första leverans, och därigenom genereras en bättre hel­hets­förståelse över kollektionen som i sin tur leder till bättre beställnings­underlag och mer intäkter. Gällande kontrollaspekten kan den likställas med den konroll som finns i dagsläget. Implikationer ­- Studiens resultat har tagits fram utan att ta hänsyn till prototypstadiet, vilket gör att den komplexitet som råder inom klädbranschen har utelämnats. Resultatet kan ändå vara till hjälp för företag som funderar på att förändra sin distributionskanal, men innan förändringen bör noggrannare kvantitativa kostnadsberäkningar utföras än de som gjorts i denna studie. Vidare rekommenderas det att utvärdera flertalet tredjeparts­logistiker om huruvida de kan vara aktuella partners vid en MIT-lösning, samt hur förutsättningarna för integrationen mellan aktörernas informationssystem ser ut. / Purpose - The purpose is to investigate if a merge-in-transit-solution can be used in the distribution of cloth samples within a cloth company to reduce costs, shorten lead time and maintain control. Method - A case study was conducted in cooperation with Didriksons to achieve the purpose of the study. Methods such as interviews and documentation studies were the basis for the collection of empirical data, which has continuously been analyzed against the study's theoretical framework. Thereby the study findings were generated. Findings - The findings show that a merge-in-transit (MIT) solution would be preferable in the clothing industry due to the time constraints available for fast delivery. Furthermore, it appears that it is vital to get the communication between actors in the supply chain to integrate if an MIT solution should be used. A MIT solution can reduce the direct transport costs by 69 percent, while the study shows that the capital and tariff costs are reduced. Increased inventory costs will be incurred due to hiring a terminal with the MIT service that will be added. As far as lead time, the total lead time is reduced by 15 percent, meaning that suppliers have more time to produce and can reduce the number of deliveries. If the suppliers produce more to the first delivery, it will generate that the salesman can get a better overview of the collection, which make the purchasing process easier and results in higher revenue. When it comes to the control, it can be equated with the control in the current situation. Implications - The study findings has been made regardless to the prototype stage, which means that the complexity of  the clothing industry has been omitted. The result can still be helpful for companies that are searching for a solution to transform their distribution channel. Thus more quantitative calculations need to be conducted before any implementations. Furthermore, it is recommended to evaluate the majority of third party logistics providers to whether they can be relevant partners for a MIT solution.

No description available.

This paper analyses the phenomenon of Suspended Affixation (SA) which refers to a situation in coordinated constructions when affixes on the final conjunct have scope over all the non-final conjuncts. The main goal of this paper is to look at the structure of SA for Noun Compound Coordination and to find out how pl and poss suffixes behave regarding suspension. Previous studies have shown that in N and NP coordination poss cannot be suspended leaving pl on the non-final conjunct. This study tests the suspendability of poss in the context of Noun Compound coordination. Since SA seems to represent gradient judgment data two acceptability judgment studies were conducted to find out the (un)grammaticality of Noun Compound constructions. The results show that pl and poss suffixes cannot be suspended for independent reasons. The suspendability of poss does not depend on the presence/absence of pl in the structure due to its structural position. This article proposes an analysis of SA in N and NP coordination which represents a combination of two approaches on SA already proposed in literature and is based on the idea of Parallel Merge proposed by Citko (2005). SA in N and NP coordination is considered to be a coordination of fully inflected conjuncts where the inflections are parallel-merged with two conjuncts (final and non-final). I show that due to the structure of Noun Compound coordination constructions, pl and poss cannot be parallel-merged because of a minimality condition: a non-final conjunct has to be a Minimal Morphological Word.