The first step of the program is to input the statistical information concerning the relations of th· database. This information is stored in the log file and the file matrix data structures. Next, the query itself is read and stored in an array called the query matrix. The program examines the various fields of this matrix and decides which relations in the database are necessary to answer the query. For these relations it determines those attributes which should be eliminated and those which should be preserved for further processing. The key attributes are identified and are projected along with the other attributes. After the initial projection is completed the sizes of the new temporary relations are evaluated and stored in the appropriate fields of the file matrix structure. The program then examines that part of the query which contains the various restrictions on the attributes. The values of the attributes are sorted and those values which do not match the restrictions are eliminated from the log file. Again, the sizes of the new relations are estimated according to the method described by Egyhazy et al. [6]. A second projection is performed to eliminate attributes which were required by the selection phase but are not part of the final answer to the query. The remaining relations are those relations which need to be joined to form a relation with the required information. In order to decide upon which relations to join, a special table, the join matrix, is created. This table contains pairs of relations which have common attributes and common values and therefore are joinable. The LP algorithm is used to determine the least expensive join out of all the possible joins. This process is repeated until all of the relations are joined to form a single relation which answers the query. As in the case of projection and selection the size of the temporary relations after each join is estimated. As a last step, we remove the key attributes which helped in joining the files but are not part of the answer to the query. / Master of Engineering

https://dc.etsu.edu/digital-animation-videos-oer/1004/thumbnail.jpg

The European Commission had approved the Registration, Evaluation and Authorization of Chemicals (REACH) regulations in the year 2006, and will begin to implement it form 1 June 2007. This regulation greatly increases safety of protection for the users of chemicals, but it also brought a problem for the manufactures as well as downstream users. That is they have to generate and distribute much more Material Safety Data Sheets (MSDS) then before. This work is difficult for most companies since this job usually was done manually. The new regulation requires a much more efficient method to generate and distribute them. This thesis project addresses the problem of automatically distributing MSDS and the corresponding metadata. It presents the underlying technology selected for this project. It gives a brief introduction of this project, the underlying technologies used, along with the methods used to deliver relevant and up to date materials safety information. At last an HTTP web application approach was selected to solve the problem, the resulting application can efficiently notify a downstream user of the newly updated MSDS and transport the corresponding file and metadata. It is truly data driven, therefore the downstream user does not need to check for updates everyday, instead will be notified when there is an available update. / Den Europeiska kommissionen antog 2006 en ny bestämmelse för informationsspridning av kemikalier, Registration, Evaluation, and Authorization of Chemicals (REACH), och den kommer att tas i bruk från första juni 2007. Bestämmelsen innebär ett starkt ökat skydd för användare av kemikalier, men den ställer även till problem för både tillverkare och användare. Exempelvis, de måste generera och distribuera betydligt fler materialsäkerhetsföreskrifter, Material Safety Data Sheets (MSDS), än tidigare. Detta arbete är krävande för de flesta företag eftersom arbetet ofta sker manuellt. Den nya bestämmelsen kräver mycket effektivare metoder att generera och distribuera MSDS. Det här examensarbetet fokuserar på problemet att automatiskt distribuera MSDS och den korresponderande metadatat. Rapporten presenterar den underliggande teknologin för examensarbetet. Därutöver ges en kort introduktion till examensarbetet, den underliggande teknologin, tillsammans med de metoderna som används för att skicka relevanta och aktuella materialsäkerhetsföreskrifter. Som avslutning väljs en HTTP Web applikationslösning för att lösa problemet. Den lösningen kan effektivt underrätta en användare att det finns en nyare MSDS och sedan skicka den korresponderande filen och dess metadata. Den är data driven, vilket gör att en användare inte måste kontrollera för uppdateringar varje dag, utan kommer att bli informerad när det finns en ny tillgänglig.

The editors of the Journal of Advanced Academics comment on Makel (2014). The replicability crisis in psychology is summarized in terms of three focal issues: the "file drawer" problem, lack of replication studies, and the null hypothesis significance testing paradigm. The authors argue that journal editors are uniquely positioned to address all three of these problems via the adoption of new policies for review and publication.

No description available.

This paper presents the G-network, a new topological design which is a suitable architecture for point-to-point communication and interconnection networks, We show that the G-network has the following desirable characteristics: Efficient routing, small number of links, and fault tolerance. The performance of the G-network is compared to that of the Barrel Shifter and Illiac Mesh networks.

A cluster is a group of computing resources that are connected by a single computer network and are managed as a single system. Clusters potentially have three key advantages over workstations operated in isolation—fault tolerance, load balancing and support for distributed computing. Information sharing among the cluster’s resources affects all phases of cluster administration. The thesis describes a new tool for distributing files within clusters. This tool, the Scalable and Reliable File Transfer Tool (SRFTT), uses Forward Error Correction (FEC) and multiple multicast channels to achieve an efficient reliable file transfer, relative to heterogeneous clusters. SRFTT achieves scalability by avoiding feedback from the receivers. Tests show that, for large files, retransmitting recovery information on multiple multicast channels gives significant performance gains when compared to a single retransmission channel.

While many people use USB flash drives, most do not protect their stored documents. Solutions for protecting flash drives exist but inherently limit functionality found in unprotected drives such as portability, usability, and the ability to share documents between multiple people. In addition, other drawbacks are introduced such as the possibility of losing access to protected documents if a password is lost. Assuming protecting portable documents is important, in order for people to be willing to protect their documents they should be required to make as few sacrifices in functionality as possible. We introduce KiwiVault, a USB flash drive encryption solution that retains more of the functionality found in unprotected storage devices than preceding solutions. In addition, this thesis reviews encryption solutions appropriate for portable data storage, reviews security components used by KiwiVault, discusses the design and implementation of KiwiVault, discusses a user study and threat analysis conducted to validate KiwiVault as a solution, and proposes future work.

With the advent of emerging "e-Science" applications, today's scientific research increasingly relies on petascale-and-beyond computing over large data sets of the same magnitude. While the computational power of supercomputers has recently entered the era of petascale, the performance of their storage system is far lagged behind by many orders of magnitude. This places an imperative demand on revolutionizing their underlying I/O systems, on which the management of both metadata and data is deemed to have significant performance implications. Prefetching/caching and data locality awareness optimizations, as conventional and effective management techniques for metadata and data I/O performance enhancement, still play their crucial roles in current parallel and distributed file systems. In this study, we examine the limitations of existing prefetching/caching techniques and explore the untapped potentials of data locality optimization techniques in the new era of petascale computing. For metadata I/O access, we propose a novel weighted-graph-based prefetching technique, built on both direct and indirect successor relationship, to reap performance benefit from prefetching specifically for clustered metadata serversan arrangement envisioned necessary for petabyte scale distributed storage systems. For data I/O access, we design and implement Segment-structured On-disk data Grouping and Prefetching (SOGP), a combined prefetching and data placement technique to boost the local data read performance for parallel file systems, especially for those applications with partially overlapped access patterns. One high-performance local I/O software package in SOGP work for Parallel Virtual File System in the number of about 2000 C lines was released to Argonne National Laboratory in 2007 for potential integration into the production mode.

The Oshawa 1937 strike against General Motors was a major turning point in Canadian labour history. This thesis explores the factors that led to its success, including the historical background of working class struggle; the economic and political context of the times; prior organizing by Communists; the engagement of rank-and-file GM workers and the remarkable stewards’ body they established; and the support and leadership of the UAW International union. The thesis shows there was overlap and interplay between these factors. The influence of the strategic outlook of Communists, both in Oshawa and in the UAW more broadly, meant that the 1937 strike incorporated many features of what might now be called rank-and-file unionism: industrial unionism, democratic engagement of rank-and-file workers, militancy on the shop floor, building solidarity within the workforce and in the community, international solidarity, and rejecting cooperation with corporations. My research focus was on the voices and actions of rank-and-file workers as much as possible, and on the remarkable day-to-day events of the strike itself. The thesis demonstrates that many of the events and lessons of the strike have been little understood or have been misinterpreted. In particular, I reexamine and correct the long-accepted conclusions of Irving Abella that the Oshawa workers were “on their own” without significant support from the UAW/CIO leadership, and that they (or the Canadian labour movement) would have been better off if they did not organize under the banner of an international union. The thesis also demonstrates that Abella failed to grasp the degree to which rank-and-file principles were embodied by the strike and were crucial to its success. The contending forces of workers, corporations, and rabidly anti-union governments that clashed in Oshawa in 1937 are largely the same ones we see in the battles going on in North America today. Thus, understanding the factors that led to the success of the Oshawa strikers can provide valuable lessons to those seeking to revive today’s labour movement. / Thesis / Master of Arts (MA) / The Oshawa 1937 strike against General Motors was a major turning point in Canadian labour history. This thesis explores the factors that led to its success, including the historical background of working class struggle; the economic and political context of the times; prior organizing by Communists; the engagement of rank-and-file GM workers and the remarkable stewards’ body they established; and the support and leadership of the UAW International union. The influence of Communists meant that the strike incorporated many features of what might now be called rank-and-file unionism: industrial unionism, democratic engagement of rank-and-file workers, militancy on the shop floor, building solidarity within the workforce and in the community, international solidarity, and rejecting cooperation with corporations. The contending forces of workers, corporations, and rabidly anti-union governments that clashed in Oshawa in 1937 are largely the same ones we see in the battles going on in North America today. Thus, understanding the factors that led to the success of the Oshawa strikers can provide valuable lessons to those seeking to revive today’s labour movement.