201 |
Secure VoIP performance measurementSaad, Amna January 2013 (has links)
This project presents a mechanism for instrumentation of secure VoIP calls. The experiments were run under different network conditions and security systems. VoIP services such as Google Talk, Express Talk and Skype were under test. The project allowed analysis of the voice quality of the VoIP services based on the Mean Opinion Score (MOS) values generated by Perceptual valuation of Speech Quality (PESQ). The quality of the audio streams produced were subjected to end-to-end delay, jitter, packet loss and extra processing in the networking hardware and end devices due to Internetworking Layer security or Transport Layer security implementations. The MOS values were mapped to Perceptual Evaluation of Speech Quality for wideband (PESQ-WB) scores. From these PESQ-WB scores, the graphs of the mean of 10 runs and box and whisker plots for each parameter were drawn. Analysis on the graphs was performed in order to deduce the quality of each VoIP service. The E-model was used to predict the network readiness and Common vulnerability Scoring System (CVSS) was used to predict the network vulnerabilities. The project also provided the mechanism to measure the throughput for each test case. The overall performance of each VoIP service was determined by PESQ-WB scores, CVSS scores and the throughput. The experiment demonstrated the relationship among VoIP performance, VoIP security and VoIP service type. The experiment also suggested that, when compared to an unsecure IPIP tunnel, Internetworking Layer security like IPSec ESP or Transport Layer security like OpenVPN TLS would improve a VoIP security by reducing the vulnerabilities of the media part of the VoIP signal. Morever, adding a security layer has little impact on the VoIP voice quality.
|
202 |
Making Decisions Regarding the Balance between Milk Quality, Udder Health, and Parlor ThroughputVanBaale, Matthew, Smith, John, Armstrong, Dennis, Harner, Joe 04 1900 (has links)
9 pp. / As today's dairy industry consolidates, cows are being milked more rapidly through larger milking parlors on larger dairies than ever before. Because milk is the primary commodity and source of income for producers, the harvesting of milk is the single most important job on any dairy. Producing high-quality milk to maximize yields and economic value requires effective parlor management, an enormous challenge for producers. Managing large parlors includes managing labor, milking equipment, as well as monitoring and evaluating parlor performance. Decisions concerning the milking center are some of the most complicated decisions a dairy producer has to make. Milking procedures, herd size, milking interval, the milk market, and the equity position of a producer influence these decisions. Producers will have to make the following decisions before they can select or develop management protocols for a milking parlor:
1. How many cows will be milked through the parlor?
2. What milking procedure will be used (minimal or full)?
3. If a full milking routine; how much contact time do you want (strips per teat)?
4. Which milking routine will be used (sequential, grouping, or territorial)?
5. Are you willing to train teams of milkers to operate large parlors?
|
203 |
RNAi Screening of the Kinome to Identify Mediators of proliferation and trastuzumab (Herceptin) resistance in HER2 Breast CancersLapin, Valentina 17 July 2013 (has links)
Breast cancers with overexpression or amplification of the HER2 tyrosine kinase receptor are more aggressive, resistant to chemotherapy, and associated with a worse prognosis. Currently, these breast cancers are treated with the monoclonal antibody trastuzumab (Herceptin®). Unfortunately, not all patients respond to trastuzumab drug therapy; some patients show de novo resistance, while others acquire resistance during treatment. This thesis describes our RNAi studies to identify novel regulators of the HER2 signaling pathway in breast cancer.
Three kinome-wide siRNA screens were performed on five HER2 amplified and seven HER2 non-amplified breast cancer cell lines, two normal breast cell lines, as well as two HER2-positive breast cancer cell lines with acquired trastuzumab resistance and their isogenic trastuzumab-sensitive controls. To understand the main kinase drivers of HER2 signaling, we performed a comprehensive screen that selected against growth inhibitors of the non-HER2 amplified breast cancer cell lines. This screen identified the loss of the HER2/HER3 heterodimer as the most prominent selective inhibitor of HER2-amplified breast cancers. In a trastuzumab sensitization screen on five trastuzumab-treated breast cancer cell lines, we identified several siRNA against the PI3K pathway as well as various other signaling pathways that inhibited proliferation. Finally, in a screen for acquired trastuzumab resistance, PKCη and its downstream targets were identified. Loss of PKCη resulted in a decrease in G1/S transition and upregulation of the cyclin dependent kinase inhibitor p27. Initial data suggest that PKCη promotes p27 ubiquitination and degradation.
Taken together, these studies provide novel insight into the complex signaling of HER2-positive breast cancers and the mechanisms of resistance to trastuzumab therapy. This work describes how various kinases can modulate cell proliferation, and points to possible novel drug targets for the treatment of HER2-positive breast cancers.
|
204 |
The Automation of Glycopeptide Discovery in High Throughput MS/MS DataSwamy, Sajani January 2004 (has links)
Glycosylation, the addition of one or more carbohydrates molecules to a protein, is crucial for many cellular processes. Aberrant glycosylation is a key marker for various diseases such as cancer and rheumatoid arthritis. It has also recently been discovered that glycosylation is important in the ability of the Human Immunodeficiency Virus (HIV) to evade recognition by the immune system. Given the importance of glycosylation in disease, major efforts are underway in life science research to investigate the glycome, the entire glycosylation profile of an organelle, cell or tissue type. To date, little bioinformatics research has been performed in glycomics due to the complexity of glycan structures and the low throughput of carbohydrate analysis. Recent advances in mass spectrometry (MS) have greatly facilitated the analysis of the glycome. Increasingly, this technology is preferred over traditional methods of carbohydrate analysis which are often laborious and unsuitable for low abundance glycoproteins. When subject to mass spectrometry with collision-induced dissociation, glycopeptides produce characteristic MS/MS spectra that can be detected by visual inspection. However, given the high volume of data output from proteome studies today, manually searching for glycopeptides is an impractical task. In this thesis, we present a tool to automate the identification of glycopeptide spectra from MS/MS data. Further, we discuss some methodologies to automate the elucidation of the structure of the carbohydrate moiety of glycopeptides by adapting traditional MS/MS ion searching techniques employed in peptide sequence determination. MS/MS ion searching, a common technique in proteomics, aims to interpret MS/MS spectra by correlating structures from a database to the patterns represented in the spectrum. The tool was tested on high throughput proteomics data and was shown to identify 97% of all glycopeptides present in the test data. Further, the tool assigned correct carbohydrate structures to many of these glycopeptide MS/MS spectra. Applications of the tool in a proteomics environment for the analysis of glycopeptide expression in cancer tissue are also be presented.
|
205 |
Cognitive MAC protocols for mobile ad-hoc networksMasrub, Abdullah Ashur January 2013 (has links)
The term of Cognitive Radio (CR) used to indicate that spectrum radio could be accessed dynamically and opportunistically by unlicensed users. In CR Networks, Interference between nodes, hidden terminal problem, and spectrum sensing errors are big issues to be widely discussed in the research field nowadays. To improve the performance of such kind of networks, this thesis proposes Cognitive Medium Access Control (MAC) protocols for Mobile Ad-Hoc Networks (MANETs). From the concept of CR, this thesis has been able to develop a cognitive MAC framework in which a cognitive process consisting of cognitive elements is considered, which can make efficient decisions to optimise the CR network. In this context, three different scenarios to maximize the secondary user's throughput have been proposed. We found that the throughput improvement depends on the transition probabilities. However, considering the past information state of the spectrum can dramatically increases the secondary user's throughput by up to 40%. Moreover, by increasing the number of channels, the throughput of the network can be improved about 25%. Furthermore, to study the impact of Physical (PHY) Layer errors on cognitive MAC layer in MANETs, in this thesis, a Sensing Error-Aware MAC protocols for MANETs has been proposed. The developed model has been able to improve the MAC layer performance under the challenge of sensing errors. In this context, the proposed model examined two sensing error probabilities: the false alarm probability and the missed detection probability. The simulation results have shown that both probabilities could be adapted to maintain the false alarm probability at certain values to achieve good results. Finally, in this thesis, a cooperative sensing scheme with interference mitigation for Cognitive Wireless Mesh Networks (CogMesh) has been proposed. Moreover, a prioritybased traffic scenario to analyze the problem of packet delay and a novel technique for dynamic channel allocation in CogMesh is presented. Considering each channel in the system as a sub-server, the average delay of the users' packets is reduced and the cooperative sensing scenario dramatically increases the network throughput 50% more as the number of arrival rate is increased.
|
206 |
An efficient execution model for reactive stream programsNguyen, Vu Thien Nga January 2015 (has links)
Stream programming is a paradigm where a program is structured by a set of computational nodes connected by streams. Focusing on data moving between computational nodes via streams, this programming model fits well for applications that process long sequences of data. We call such applications reactive stream programs (RSPs) to distinguish them from stream programs with rather small and finite input data. In stream programming, concurrency is expressed implicitly via communication streams. This helps to reduce the complexity of parallel programming. For this reason, stream programming has gained popularity as a programming model for parallel platforms. However, it is also challenging to analyse and improve the performance without an understanding of the program's internal behaviour. This thesis targets an effi cient execution model for deploying RSPs on parallel platforms. This execution model includes a monitoring framework to understand the internal behaviour of RSPs, scheduling strategies for RSPs on uniform shared-memory platforms; and mapping techniques for deploying RSPs on heterogeneous distributed platforms. The foundation of the execution model is based on a study of the performance of RSPs in terms of throughput and latency. This study includes quantitative formulae for throughput and latency; and the identification of factors that influence these performance metrics. Based on the study of RSP performance, this thesis exploits characteristics of RSPs to derive effective scheduling strategies on uniform shared-memory platforms. Aiming to optimise both throughput and latency, these scheduling strategies are implemented in two heuristic-based schedulers. Both of them are designed to be centralised to provide load balancing for RSPs with dynamic behaviour as well as dynamic structures. The first one uses the notion of positive and negative data demands on each stream to determine the scheduling priorities. This scheduler is independent from the runtime system. The second one requires the runtime system to provide the position information for each computational node in the RSP; and uses that to decide the scheduling priorities. Our experiments show that both schedulers provides similar performance while being significantly better than a reference implementation without dynamic load balancing. Also based on the study of RSP performance, we present in this thesis two new heuristic partitioning algorithms which are used to map RSPs onto heterogeneous distributed platforms. These are Kernighan-Lin Adaptation (KLA) and Congestion Avoidance (CA), where the main objective is to optimise the throughput. This is a multi-parameter optimisation problem where existing graph partitioning algorithms are not applicable. Compared to the generic meta-heuristic Simulated Annealing algorithm, both proposed algorithms achieve equally good or better results. KLA is faster for small benchmarks while slower for large ones. In contrast, CA is always orders of magnitudes faster even for very large benchmarks.
|
207 |
Mobile high-throughput phenotyping using watershed segmentation algorithmDammannagari Gangadhara, Shravan January 1900 (has links)
Master of Science / Department of Computing and Information Sciences / Mitchell L. Neilsen / This research is a part of BREAD PHENO, a PhenoApps BREAD project at K-State which combines contemporary advances in image processing and machine vision to deliver transformative mobile applications through established breeder networks. In this platform, novel image analysis segmentation algorithms are being developed to model and extract plant phenotypes. As a part of this research, the traditional Watershed segmentation algorithm has been extended and the primary goal is to accurately count and characterize the seeds in an image. The new approach can be used to characterize a wide variety of crops. Further, this algorithm is migrated into Android making use of the Android APIs and the first ever user-friendly Android application implementing the extended Watershed algorithm has been developed for Mobile field-based high-throughput phenotyping (HTP).
|
208 |
Data Integration of High-Throughput Proteomic and Transcriptomic Data based on Public Database KnowledgeWachter, Astrid 22 March 2017 (has links)
No description available.
|
209 |
Network & Cloud TrackFitzek, Frank H.P. 15 November 2016 (has links) (PDF)
No description available.
|
210 |
Phage display to identify functional resistance mutations to RigosertibFilipovic, Nedim 01 January 2017 (has links)
In vitro protein selection has had major impacts in the field of protein engineering. Traditional screens assay individual proteins for specific function. Selection, however, analyzes a pool of mutants and yields the best variants. Phage display, a successful selection technique, also provides a reliable link between variant phenotype and genotype. It can also be coupled with high throughput sequencing to map protein mutations; potentially highlighting vital mutations in variants. We propose to apply this technique to cancer therapy. RAF, a serine/threonine kinase, is critical for cell regulation in mammals. RAF can be activated by oncogenic RAS, found in over 30% of cancers, to drive cancer proliferation. Rigosertib, a benzyl styryl sulfone in phase III clinical trials for myelodysplastic syndrome (MDS), is an inhibitor of the RAS binding domain (RBD) in RAF. Phage display can be used to select RAF mutants for RAS binding affinity, in the presence of Rigosertib. High-throughput sequencing of these variants can provide a means of anticipating, and mapping resistance to this anti-cancer drug.
|
Page generated in 0.0444 seconds