No description available.

Purpose – The purpose is to: Improve the efficiency of warehouses operations as well as reduce its workload imbalances by altering the warehouse layout and work zones at a storage area. This was done by answering the following research questions: What is the current state of the sites efficiency and workload imbalances? How can the warehouse layout be designed to increase the efficiency? How can warehouse work zones be altered to reduce workload imbalances? Method – The purpose was achieved through a case study at a vehicle manufacturing facility. By studying established methods of efficiency, layout designs and workload imbalances, ways of improving the operations was discovered. The effects of these methods were then tested through the case.   Findings –There are two categories improving efficiency, namely increasing output or decreasing input. The study also provides examples of ways to do both, and verifies them at the case company. The focus of both methods is a decrease in travel distance which proved to be a reliable way of increasing efficiency. Workload imbalances can be decreased by sharing workload between the resources. The case shows the result of two different resources with unequal workload and discusses the trade-off between efficiency and workload equality. Implications – The practical implications of the study is guidelines for how efficiency can be increased and how workload imbalances can be decreased. The academic implications are verifications of the used theories. Limitations – This study focuses on a restricted part of the storage process, namely traveling. There are more processes which could be included to further benefit the overall efficiency, these have however been excluded to limit the scope. The study also uses a heuristic approach based on prior research which means that the optimal solution might still be unknown. Keywords – Efficiency, workload imbalances, storage management, family grouping

At the national, state, district, and building levels, girls outperform boys in writing. The purpose of this study was to examine the achievement gap between 5th grade girls and boys in the content area of writing. The research questions explored the perceptions of 5th grade teachers and building administrators and examined the instructional strategies that were used to teach writing to 5th grade students. Attribution theory was used as the theoretical framework to address the achievement gap. Using a qualitative instrumental case study design, data were collected from a building administrator and a 5th grade writing teacher in the form of semi structured interviews, an observation of the 5th grade writing teacher, and the examination of writing instructional resources used to teach writing. Data from these sources were transcribed, coded, and analyzed to find emerging themes. The findings revealed that gender-specific instructional strategies and a progress monitoring assessment tool were needed to help close the achievement gap. Based on the findings, a white paper report was created and shared with the building administrator and 5th grade writing teacher. The white paper report included gender-specific instructional strategies and a progress monitoring assessment tool as recommendations to help close the achievement gap. Examining the achievement gap between 5th grade girls and boys in the content area of writing could promote positive social change by encouraging administrators as instructional leaders to become leading learners and by providing 5th grade teachers gender-specific instructional strategies to help students become proficient writers who are college and career ready.

The loading problem in a Flexible Manufacturing System (FMS) lies in the allocation of operations and associated cutting tools to machines for a given set of parts subject to capacity constraints. This dissertation proposes a hierarchical approach to the machine loading problem when the workload and tool magazine capacity of each machine are restrained. This hierarchical approach reduces the maximum workload of the machines by partially grouping them. This research deals with situations where different groups of machines performing the same operation require different processing times and this problem is formulated as an integer linear problem. This work proposes a solution that is comprised of two phases. In the first phase (Phase I), demand is divided into batches and then operations are allocated to groups of machines by using a heuristic constrained by the workload and tool magazine capacity of each group. The processing time of the operation is different for each machine group, which is composed of the same identical machines; however, these machines can perform different sets of operations if tooled differently. Each machine and each group of machines has a limited time for completing an operation. Operations are allocated to groups based on their respective workload limits. In the second phase (Phase II), demand is divided into batches again and operations are assigned to machines based on their workload and tool magazine capacity defined by Longest Processing Time (LPT) and Multifit algorithms. In Phase II, like Phase I, partial grouping is more effective in balancing the workload than total grouping. In partial grouping, each machine is tooled differently, but they can assist one another in processing each individual operation. Phase I demonstrates the efficiency of allocating operations to each group. Phase II demonstrates the efficiency of allocating operations to each machine within each group. This two-phase solution enhances routing flexibility with the same or a smaller number of machines through partial grouping rather than through total grouping. This partial grouping provides a balanced solution for problems involving a large number of machines. Performance of the suggested loading heuristics is tested by means of randomly generated tests.

Friend lists allow Facebook users to group their friends and may be used to share certain information only with those in a specific list. This function has been around for several years, but has never gained any particular popularity among users, most of whom probably did not know it even existed a couple of years ago. In the fall of 2011, however, the function was updated and made more visible on the site. There are several possible uses of friend lists, such as privacy control, filtering of the news feed, self-presentation and targeted information sharing. This paper aims to investigate the extent to which friend lists are used by students today, as well as why students actually use their lists, i.e. for what purposes. Judging from the results of this study in comparison with earlier research, there seems to have been a somewhat recent increase in the awareness of the fact that friend lists actually do exist, but still most users tend not to utilize them. Moreover, the results indicate that friend lists quite rarely are used for privacy control, or anything else for that matter, probably due to a number of drawbacks that they possess as of today.

Thesis (Ed. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaves 94-104).

Thesis (Ph. D.)--University of Notre Dame, 2003. / Thesis directed by Cindy Bergeman for the Department of Psychology. "July 2003." Includes bibliographical references (leaves 103-106).

No description available.

The loading problem in a Flexible Manufacturing System (FMS) lies in the allocation of operations and associated cutting tools to machines for a given set of parts subject to capacity constraints. This dissertation proposes a hierarchical approach to the machine loading problem when the workload and tool magazine capacity of each machine are restrained. This hierarchical approach reduces the maximum workload of the machines by partially grouping them. This research deals with situations where different groups of machines performing the same operation require different processing times and this problem is formulated as an integer linear problem. This work proposes a solution that is comprised of two phases. In the first phase (Phase I), demand is divided into batches and then operations are allocated to groups of machines by using a heuristic constrained by the workload and tool magazine capacity of each group. The processing time of the operation is different for each machine group, which is composed of the same identical machines; however, these machines can perform different sets of operations if tooled differently. Each machine and each group of machines has a limited time for completing an operation. Operations are allocated to groups based on their respective workload limits. In the second phase (Phase II), demand is divided into batches again and operations are assigned to machines based on their workload and tool magazine capacity defined by Longest Processing Time (LPT) and Multifit algorithms. In Phase II, like Phase I, partial grouping is more effective in balancing the workload than total grouping. In partial grouping, each machine is tooled differently, but they can assist one another in processing each individual operation. Phase I demonstrates the efficiency of allocating operations to each group. Phase II demonstrates the efficiency of allocating operations to each machine within each group. This two-phase solution enhances routing flexibility with the same or a smaller number of machines through partial grouping rather than through total grouping. This partial grouping provides a balanced solution for problems involving a large number of machines. Performance of the suggested loading heuristics is tested by means of randomly generated tests.

Politikai įvairiai deklaruoja savo elgesį, todėl vienintelis būdas juos kontroliuoti – stebėjimas. Šiame darbe yra analizuojamas LRS darbas, susijęs su balsavimais. Stengiamasi atsakyti į klausimą: ar informacinių technologijų įrankiai gali leisti nustatyti ar Seimo narių priklausomybė partijai (frakcijai) ar pozicijai (opozicijai) lemia jų balsavimą? Pagrindiniai darbo tikslai – Seimo narių grupavimas ir balsavimo kitimo aptikimas. Apžvelgiama 2008-2012 metų Seimo kadencijos veikla, atlikta balsavimų statistinė analizė, taip pat apžvelgti kiti tyrimai, susiję su parlamentinėmis veiklomis. Seimo narių grupavimui taikome klasterizavimo metodus. Klasterizavimas gali būti apibrėžiamas kaip objektų suskirstymas į grupes (klasterius), kuriose objektų skirtumai yra kuo mažesni, o tarp grupių skirtumai - kuo didesni. Darbe apžvelgiami įvairūs klasterizavimo metodai, jų veikimo principai, aprašomi atstumų tarp objektų skaičiavimo metodai, kokybės įvertinimo kriterijai. Balsavimų duomenys saugomi MySQL duomenų bazėje, todėl sukurtas įrankis duomenų apdorojimui. Aprašomi visi darbo etapai: naudoti įrankiai, balsavimo kodavimas, balsavimų skaidymas į periodus. Tyrimams atlikti pasirinkti k-Means, hierarchiniai tolimiausio kaimyno, vidutinių atstumų, artimiausio kaimyno klasterizavimo metodai. Objektų panašumams įvertinti naudojami Euklido (ang. Euclidean) ir Manheteno (angl. Manhattan) atstumų skaičiavimo metodai. Klasterizavimo kokybės įvertinimui naudojame PURITY, RAND, NMI metodus... [toliau žr. visą tekstą] / Politicians declare their behavior in different ways, so the only way to control it - monitoring. In this thesis tools for Lithuanian Parliament Members voting behavior are analyzed. The question is following: can Information technologies tool help to determine how membership in a faction or the position (opposition) is related with voting behavior? The main objectives of this work are Lithuanian Parliament members grouping by their voting behavior and its' change detection. In the thesis the 2008-2012 of the Parliament activities are analysed using statistical voting analysis. We use clustering for grouping members of the Parliament. A loose definition of clustering could be the process of organizing objects into groups whose members are similar in some way. A cluster (group) is a collection of objects which are similar between them and are dissimilar to the objects belonging to other clusters. We overviewed different clustering methods and their principles of operation, described the distance between the objects of calculation methods, quality evaluation criteria in this work. Voting data is stored in MySQL database, hence a tool was created for data processing. We describe all the stages of the work: the use of tools, coding of the votes, division of the votes into the periods. The following techniques were chosen: K-Means, Hierarchical Clustering with Complete (furthest neighbor), Average, Single (nearest neighbor) linkage. We use Euclidean and Manhattan methods for... [to full text]