This thesis presents methods to statistically quantify data from fastener vibration life tests. Data from fastener vibration life tests with secondary locking features of threaded inserts is used. Threaded inserts in three different configurations are examined: no locking feature, prevailing torque locking feature, and adhesive locking feature. Useful composite plots were developed by extracting minimum preloads versus cycles from test data. Minimum preloads were extracted due to the overlapping of varying test data and because the minimum preload is of most interest in such tests. In addition to composite plots, descriptive statistics of the samples were determined including mean, median, quartiles, and extents. These descriptive statistics were plotted to illustrate variability within a sample as well as variability between samples. These plots also reveal that characteristics of loosening for a sample, such as preload loss and rates of preload loss, are preserved when summarizing such tests. Usually fastener vibration life tests are presented and compared with one test sample, which is why statistically quantifying them is needed and important. Methods to predict the sample population have been created as well. To predict populations, tests to determine the distribution of the sample, such as probability plots and probability plot correlation coefficient, have been conducted. Once samples were determined to be normal, confidence intervals were created for test samples, which provides a range of where the population mean should lie. It has been shown that characteristics of loosening are preserved in the confidence intervals. Populations of fastener vibration life tests have never before been presented or created. The evaluation of loosening has been conducted for fastener vibration life tests in the past with plots of one test sample; however, in this work statistically quantified results of multiple tests were used. This is important because evaluating loosening with more than one test sample can determine variation between tests. It has been found that secondary locking features do help reduce the loss of preload. The prevailing torque secondary locking feature is found to be more effective as preload is lost. The best secondary locking feature has been found to be the adhesive.

Transactional memory (TM) systems have gained considerable popularity in the last decade driven by the increased demand for tools that ease parallel programming. TM eliminates the need for user-locks that protect accesses to shared data. It offers performance close to that of fine-grain locking with the programming simplicity of coarse-grain locking. Today’s TM systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict occurs. 2PL is a simple algorithm that provides fast transactional operations. However, it limits concurrency in applications with high contention because it increases the rate of aborts. We propose the use of a more relaxed concurrency control algorithm to provide better concurrency. This algorithm is based on the conflict-serializability (CS) model. Unlike 2PL, it allows some transactions to commit successfully even when they make conflicting accesses. We implement this algorithm both in a software TM system as well as in a simulator of a hardware TM system. Our evaluation using TM benchmarks shows that the algorithm improves the performance of applications with long transactions and high abort rates. Performance is improved by up to 299% in the software TM, and up to 66% in the hardware simulator. We argue that these improvements come with little additional complexity and require no changes to the transactional programming model. This makes our implementation feasible

Transactional memory (TM) systems have gained considerable popularity in the last decade driven by the increased demand for tools that ease parallel programming. TM eliminates the need for user-locks that protect accesses to shared data. It offers performance close to that of fine-grain locking with the programming simplicity of coarse-grain locking. Today’s TM systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict occurs. 2PL is a simple algorithm that provides fast transactional operations. However, it limits concurrency in applications with high contention because it increases the rate of aborts. We propose the use of a more relaxed concurrency control algorithm to provide better concurrency. This algorithm is based on the conflict-serializability (CS) model. Unlike 2PL, it allows some transactions to commit successfully even when they make conflicting accesses. We implement this algorithm both in a software TM system as well as in a simulator of a hardware TM system. Our evaluation using TM benchmarks shows that the algorithm improves the performance of applications with long transactions and high abort rates. Performance is improved by up to 299% in the software TM, and up to 66% in the hardware simulator. We argue that these improvements come with little additional complexity and require no changes to the transactional programming model. This makes our implementation feasible

The purpose of this research is to determine if anaerobic adhesive can be used as a prevailing torque locking feature. Maintaining preload in critical joints is the usual standard that anaerobic adhesives are held to in aerospace and other industry. To test if anaerobic adhesive can be used as a prevailing torque locking feature a test procedure was developed and implemented to measure the removal torque of threaded fasteners after an allotted cure time. In total, 191 threaded fasteners of different material and coatings were tested in the unseated and seated states with various strengths and varieties of anaerobic adhesive. A series of three tests were conducted: initial use, reuse with no added anaerobic adhesive, and a third test with added product to the bolt and nut to see how removal torque would behave in these conditions. It was found that using anaerobic adhesive as a prevailing torque locking feature is viable in many cases. No published work to date analyzes anaerobic adhesive at the standard of a prevailing torque locking feature.

In the recent years threaded run-to-run (RtR) control algorithms have experienced drawbacks under certain circumstances, one such trait is when applied to high-mix of products such as in Application Specific Integrated Circuits (ASIC) foundries. The variations in the process are a function of the product being manufactured as well as the tool being used. The presence of semiconductor layers increases the number of times the lithography process must be repeated. Successive layers having different patterns must be exposed using different reticles/masks in order to maximize tool utilizations. The objectives of this research are to develop a set of methodologies for evaluation and extension of threaded control applied to overlay. This project defines methods to quantify the efficacy of threaded controls, finds the drawbacks of threaded control under production of high mix of semiconductors and suggests extensions and alternatives to improve threaded control. To evaluate the performance of threaded control, extensive simulations were performed in MATLAB. The effects of noise, disturbances, sampling and delays on the control and estimation performance of threaded controller were studied through these simulations. Based on the results obtained, several ideas to extend threaded control by reducing overall number of threads, by improving thread definitions and combination have been introduced. A unique idea of sampling the measurements dynamically based on the estimation accuracy is also presented. Future work includes implementing the extensions to threaded control suggested in this work in real production data and comparing the results without the use of those methods. Future work also includes building new alternatives to threaded control. / text

Industry equipment such as pressure vessels, mining equipment, heat exchang-ers, steam generators and other structures are provided with bolted closures for the purpose of in-service inspection and maintenance of internal components. Threaded connections often experience variable cyclic loads due to temperature, inner pressure and variation in the deformation of connection fittings. Often, studs and screws are not only affected by an axial load, but also by bending moments. More sophisticated high-cycle and low-cycle durability calculation meth-odologies have been already developed for threaded connections experiencing cyclic axial loads, and in these methodologies the distribution of axial load among turns is assessed quantitatively. The quantitative data of load distribu-tion in the thread enables a more accurate assessment of the influence of the constructional design particularities (connection length, material, nut and turn’s form) and the deformation stages of the connection element. These durability calculation methodologies are not applied for threaded connections that are cyclically bent, as the analytical models that are suitable for practical application in the load distribution of the turns have not been cre-ated for bent threaded connections. In this field, no models have been created to be calculated by the BE method. As the threaded connection is a complex node consisting of deformed el-ements, the load distribution among turns is influenced by the... [to full text] / Srieginės jungtys dažnai patiria ciklinių lenkimo apkrovų dėl temperatū-ros, vidaus slėgio ir jungiamųjų detalių deformacijų kitimo. Srieginėms jung-tims, kurios patiria ašinių ciklinių apkrovų jau yra sukurtos modernesnės daugiaciklio ir mažaciklio ilgaamžiškumo skaičiavimo metodikos, kuriomis detaliai kiekybiškai įvertinamas ašinės apkrovos pasiskirstymas tarp vijų. Ap-krovos pasiskirstymo sriegyje kiekybiniai duomenys leidžia detaliau ir tiksliau įvertinti konstrukcijos ypatumų (jungties ilgio, medžiagos, veržlės ir vijų for-mos) ir jungties elementų deformavimo stadijų įtaką. Tokios ilgaamžiškumo skaičiavimo metodikos cikliškai lenkiamoms srieginėms jungtims netaikomos, nes lenkiamoms srieginėms jungtims nėra sukurtų apkrovos pasiskirstymo vijose analitinių modelių, tinkamų praktiniam naudojimui. Šioje srityje taip pat nėra sukurtų ir modelių, kurie skaičiuojami baigtinių elementų metodu. Kadangi srieginė jungtis yra kompleksinis mazgas, kurį sudaro deformuo-jami elementai, tai apkrovos pasiskirstymą tarp vijų lemia jungties elementų deformacijų ir poslinkių suderinamumas. Matematiškai aprašant jungties de-formuotą būvį, reikalingi teoriniai ir eksperimentiniai duomenys, kurie atspin-dėtų jungties elementų deformavimo specifinius ypatumus, pasireiškiančius veikiant lenkimui. Disertacijoje siekiama sukurti cikliškai lenkiamų srieginių jungčių apkro-vos pasiskirstymo sriegyje skaičiavimo metodą ir pritaikyti jį mažacikliam ilga-amžiškumui skaičiuoti.

This work endeavours to achieve technology transfer between established best-practice in academic high-performance computing and current techniques in commercial high-productivity computing. It shows that a credible high-performance message-passing communication library, with semantics and syntax following the Message-Passing Interface (MPI) Standard, can be built in pure C# (one of the .Net suite of computer languages). Message-passing has been the dominant paradigm in high-performance parallel programming of distributed-memory computer architectures for three decades. The MPI Standard originally distilled architecture-independent and language-agnostic ideas from existing specialised communication libraries and has since been enhanced and extended. Object-oriented languages can increase programmer productivity, for example by allowing complexity to be managed through encapsulation. Both the C# computer language and the .Net common language runtime (CLR) were originally developed by Microsoft Corporation but have since been standardised by the European Computer Manufacturers Association (ECMA) and the International Standards Organisation (ISO), which facilitates portability of source-code and compiled binary programs to a variety of operating systems and hardware. Combining these two open and mature technologies enables mainstream programmers to write tightly-coupled parallel programs in a popular standardised object-oriented language that is portable to most modern operating systems and hardware architectures. This work also establishes that a thread-to-thread delivery option increases shared-memory communication performance between MPI ranks on the same node. This suggests that the thread-as-rank threading model should be explicitly specified in future versions of the MPI Standard and then added to existing MPI libraries for use by thread-safe parallel codes. This work also ascertains that the C# socket object suffers from undesirable characteristics that are critical to communication performance and proposes ways of improving the implementation of this object.

This multi-disciplinary study examines the linguistic characteristics which influence communication and social interaction in computer-mediated communication (CMC). We begin by conducting a qualitative data analysis on a group of graduate students taking online courses. Through this, we look more closely at their perception of social interaction in their online learning environment (Knowledge eCommons). We then take individual student notes and analyze their linguistic characteristics. We look at the emotional cues in notes, the use of factual, objective language and other linguistic features. We study these notes through the use of sentiment analysis methodologies – which will be explained in detail in the first and second chapter. We have proposed a method for deducing note objectivity and have computed reliability testing of this method. Our analyses show that there is a high correlation between the use of objective language in a note and the value that students place on that note.

This multi-disciplinary study examines the linguistic characteristics which influence communication and social interaction in computer-mediated communication (CMC). We begin by conducting a qualitative data analysis on a group of graduate students taking online courses. Through this, we look more closely at their perception of social interaction in their online learning environment (Knowledge eCommons). We then take individual student notes and analyze their linguistic characteristics. We look at the emotional cues in notes, the use of factual, objective language and other linguistic features. We study these notes through the use of sentiment analysis methodologies – which will be explained in detail in the first and second chapter. We have proposed a method for deducing note objectivity and have computed reliability testing of this method. Our analyses show that there is a high correlation between the use of objective language in a note and the value that students place on that note.

abstract: Most embedded applications are constructed with multiple threads to handle concurrent events. For optimization and debugging of the programs, dynamic program analysis is widely used to collect execution information while the program is running. Unfortunately, the non-deterministic behavior of multithreaded embedded software makes the dynamic analysis difficult. In addition, instrumentation overhead for gathering execution information may change the execution of a program, and lead to distorted analysis results, i.e., probe effect. This thesis presents a framework that tackles the non-determinism and probe effect incurred in dynamic analysis of embedded software. The thesis largely consists of three parts. First of all, we discusses a deterministic replay framework to provide reproducible execution. Once a program execution is recorded, software instrumentation can be safely applied during replay without probe effect. Second, a discussion of probe effect is presented and a simulation-based analysis is proposed to detect execution changes of a program caused by instrumentation overhead. The simulation-based analysis examines if the recording instrumentation changes the original program execution. Lastly, the thesis discusses data race detection algorithms that help to remove data races for correctness of the replay and the simulation-based analysis. The focus is to make the detection efficient for C/C++ programs, and to increase scalability of the detection on multi-core machines. / Dissertation/Thesis / Doctoral Dissertation Computer Science 2015