subject:(Signature generation)

1. Rice, Brandon. Automated snort signature generation.

Degree: 2014, James Madison University

URL: https://commons.lib.jmu.edu/master201019/301

► Network intrusion systems work on many models, but at their core they rely on algorithms to process data and determine if the network traffic is… (more)

Subjects/Keywords: snort; signature; generation; automated; IDS; IPS; intrusion; detection; Computer Sciences

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rice, B. (2014). Automated snort signature generation. (Masters Thesis). James Madison University. Retrieved from https://commons.lib.jmu.edu/master201019/301

Chicago Manual of Style (16^th Edition):

Rice, Brandon. “Automated snort signature generation.” 2014. Masters Thesis, James Madison University. Accessed March 08, 2021. https://commons.lib.jmu.edu/master201019/301.

MLA Handbook (7^th Edition):

Rice, Brandon. “Automated snort signature generation.” 2014. Web. 08 Mar 2021.

Vancouver:

Rice B. Automated snort signature generation. [Internet] [Masters thesis]. James Madison University; 2014. [cited 2021 Mar 08]. Available from: https://commons.lib.jmu.edu/master201019/301.

Council of Science Editors:

Rice B. Automated snort signature generation. [Masters Thesis]. James Madison University; 2014. Available from: https://commons.lib.jmu.edu/master201019/301

University of Michigan

2. Hu, Xin. Large Scale Malware Analysis, Detection and Signature Generation.

Degree: PhD, Computer Science & Engineering, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/89760

► As the primary vehicle for most organized cybercrimes, malicious software (or malware) has become one of the most serious threats to computer systems and the… (more)

▼ As the primary vehicle for most organized cybercrimes, malicious software (or malware) has become one of the most serious threats to computer systems and the Internet. With the recent advent of automated malware development toolkits, it has become relatively easy, even for marginally skilled adversaries, to create and mutate malware, bypassing Anti-Virus (AV) detection. This has led to a surge in the number of new malware threats and has created several major challenges for the AV industry. AV companies typically receive tens of thousands of suspicious samples daily. However, the overwhelming number of new malware easily overtax the available human resources at AV companies, making them less responsive to emerging threats and leading to poor detection rates. To address these issues, this dissertation proposes several new and scalable systems to facilitate malware analysis and detection, with the focus on a central theme: ``automation and scalability". This dissertation makes four primary contributions. First, it builds a large-scale malware database management system called SMIT that addresses the challenges of determining whether a suspicious sample is indeed malicious. SMIT exploits the insight that most new malicious samples are simple syntactic variations of existing malware. Thus, one way to ascertain the maliciousness of an unknown sample is to check if it is sufficiently similar to any existing malware. SMIT is designed to make such decisions efficiently using malware's function call graph – a high-level structural representation that is less susceptible to the low-level obfuscation employed by malware writers to evade detection. Second, the dissertation develops an automatic malware clustering system called MutantX. By quickly grouping similar samples into clusters, MutantX allows malware analysts to focus on representative samples and automatically generate labels based on samples’ association with existing groups. Third, this dissertation introduces a signature-generation system, called Hancock, that automatically creates high-quality string signatures with extremely low false-positive rates. Finally, observing that two widely used malware analysis approaches – i.e., static and dynamic analyses – have their respective pros and cons, this dissertation proposes a novel system that optimally integrates static-feature and dynamic-behavior based malware clusterings, mitigating their respective shortcomings without losing their merits. Advisors/Committee Members: Shin, Kang Geun (committee member), Halderman, J. Alex (committee member), Mei, Qiaozhu (committee member), Prakash, Atul (committee member).

Subjects/Keywords: Computer Security; Malware Analysis and Detection; Large-Scale Systems; Malware Clustering; Malware Signature Generation; Computer Science; Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hu, X. (2011). Large Scale Malware Analysis, Detection and Signature Generation. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/89760

Chicago Manual of Style (16^th Edition):

Hu, Xin. “Large Scale Malware Analysis, Detection and Signature Generation.” 2011. Doctoral Dissertation, University of Michigan. Accessed March 08, 2021. http://hdl.handle.net/2027.42/89760.

MLA Handbook (7^th Edition):

Hu, Xin. “Large Scale Malware Analysis, Detection and Signature Generation.” 2011. Web. 08 Mar 2021.

Vancouver:

Hu X. Large Scale Malware Analysis, Detection and Signature Generation. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2027.42/89760.

Council of Science Editors:

Hu X. Large Scale Malware Analysis, Detection and Signature Generation. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/89760

3. Silva, Raphael Campos [UNESP]. Malflow: um framework para geração automatizada de assinaturas de malwares baseado em fluxo de dados de rede.

Degree: 2017, Universidade Estadual Paulista

URL: http://hdl.handle.net/11449/148745

►

A garantia de segurança em ambientes computacionais é complexa, uma vez que a expertise dos atacantes e o número de ameaças têm aumentado. De forma… (more)

▼

A garantia de segurança em ambientes computacionais é complexa, uma vez que a expertise dos atacantes e o número de ameaças têm aumentado. De forma a lidar com o aumento de incidentes de segurança, é necessária uma metodologia que automatize o processo de análise de ameaças e forneça assinaturas de ataques para os ambientes de defesa. Este projeto propõe uma metodologia para criação automatizada de assinaturas para malware baseado em fluxo de dados de redes. A partir de múltiplas execuções de uma amostra de malware, são encontradas semelhanças entre o tráfego de rede gerado em cada uma de suas execuções. O processo de encontrar semelhanças baseia-se em: (i) geração de um hash para cada uma das conexões realizadas pelo malware, no qual cada hash irá representar um elemento de uma sequência e (ii) utilização do algoritmo LCS para encontrar uma subsequência em comum mais longa entre duas sequências geradas a partir das conexões realizadas pelo malware durante cada uma de suas execuções. Uma vez encontrada a subsequência em comum mais longa, os descritores das conexões realizadas pelo malware são recuperados, os quais irão compor os passos de uma assinatura. Por fim, as assinaturas geradas serão testadas para identificação de falsos-positivos e verdadeiros-positivos, para que sejam selecionadas com o intuito de alimentar um Sistema de Detecção de Intrusão.

The guarantee of security in computing environments is complex, since the expertise of the attackers and the numbers of threats have increased. In order to handle the increased security incidents, is required a methodology to automate the process of threat analysis and provide signatures to defense environments. This project proposes a methodology to generate signatures automatically, based on network flows. From multiple execution of a malware sample, similarities are found between the network traffic generated in each of its executions. The process of finding similarity is based on: (i) Generation of a hash for each connection performed by the malware, where each hash will represent an element of a sequence and (ii) application of the LCS algorithm to find the longest common subsequence between two sequences generated from the connections performed by the malware during each of its executions. Once the longest common subsequence is found, the descriptors of the connections performed by the malware are retrieved, which will compose the steps of a signature. Finally, the generated signatures will be tested for false positive and true positive identification, so that they are selected with the intention of feeding an Intrusion Detection System.

Advisors/Committee Members: Cansian, Adriano Mauro [UNESP], Universidade Estadual Paulista (UNESP).

Subjects/Keywords: Malware; Análise dinâmica; Mecanismo de geração de assinatura; Geração automatizada de assinatura; Sistemas de detecção de intrusão baseados em rede; Dynamic analysis; Signature generation mechanism; Automated signature generation; Network intrusion detection systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Silva, R. C. [. (2017). Malflow: um framework para geração automatizada de assinaturas de malwares baseado em fluxo de dados de rede. (Thesis). Universidade Estadual Paulista. Retrieved from http://hdl.handle.net/11449/148745

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Silva, Raphael Campos [UNESP]. “Malflow: um framework para geração automatizada de assinaturas de malwares baseado em fluxo de dados de rede.” 2017. Thesis, Universidade Estadual Paulista. Accessed March 08, 2021. http://hdl.handle.net/11449/148745.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Silva, Raphael Campos [UNESP]. “Malflow: um framework para geração automatizada de assinaturas de malwares baseado em fluxo de dados de rede.” 2017. Web. 08 Mar 2021.

Vancouver:

Silva RC[. Malflow: um framework para geração automatizada de assinaturas de malwares baseado em fluxo de dados de rede. [Internet] [Thesis]. Universidade Estadual Paulista; 2017. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11449/148745.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva RC[. Malflow: um framework para geração automatizada de assinaturas de malwares baseado em fluxo de dados de rede. [Thesis]. Universidade Estadual Paulista; 2017. Available from: http://hdl.handle.net/11449/148745

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Coutinho Canuto, Jânio. Biomechanical online signature modeling applied to verification : Modélisation biomécanique des signatures en ligne appliqué à la vérification.

Degree: Docteur es, Informatique, 2014, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2014TELE0026

►

Cette thèse porte sur la modélisation et vérification des signatures en ligne. La première partie a pour thème principal la modélisation biomécanique des mouvements de… (more)

▼

Cette thèse porte sur la modélisation et vérification des signatures en ligne. La première partie a pour thème principal la modélisation biomécanique des mouvements de la main. Un modèle basé sur le critère de Minimum de Secousse (MS) a été choisi parmi plusieurs théories du contrôle moteur. Ensuite, le problème de la segmentation des trajectoires en traits qui correspondent au modèle cinématique choisi a été étudié, ce qui a conduit à la mise au point d'une méthode de segmentation itérative. Le choix du modèle et de la méthode de segmentation sont basé sur le compromis entre la qualité de reconstruction et la compression. Dans la deuxième partie, le modèle polynomial issu du critère de MS est volontairement dégradé. Les zéros non-Réels des polynômes sont jetés et les effets de cette dégradation sont étudiés dans une perspective de vérification biométrique. Cette dégradation est équivalente à la technique connue sous le nom d’Infinity Clipping, initialement appliqué à des signaux de parole. Pour les signatures en ligne, comme pour la parole, la préservation de l'information essentielle a été observée sur des tâches de vérification de signature. En fait, en utilisant seulement la distance de Levenshtein sur la représentation dégradée, un taux d'erreur comparable à ceux des méthodes plus élaborées a été obtenu. En outre, la représentation symbolique issue de l’Infinity Clipping permet d’établir une relation conceptuelle entre le nombre de segments obtenus par la segmentation itératif basée sur le MS et la complexité de Lempel-Ziv. Cette relation est potentiellement utile pour l'analyse des signatures en ligne et pour l’amélioration des systèmes de reconnaissance

This thesis deals with the modelling and verification of online signatures. The first part has as main theme the biomechanical modelling of hand movements associated to the signing gesture. A model based on the Minimum Jerk (MJ) criterion was chosen amongst the several available motor control theories. Next, the problem of signature trajectory segmentation into strokes that better fit the chosen kinematic model is studied, leading to the development of an iterative segmentation method. Both the choice of the model and the segmentation method are strongly based on the tradeoff between reconstruction quality and compression. On the second part, the polynomial model provided by the MJ criterion is intentionally degraded. The non-Real zeroes of the polynomials are discarded and the effects of this degradation are studied from a biometric verification perspective. This degradation is equivalent to the signal processing technique known as Infinity Clipping, originally applied to speech signals. On signatures, as for speech, the preservation of essential information was observed on signature verification tasks. As a matter of fact, using only the Levenshtein distance over the infinitely clipped representation, verification error rates comparable to those of more elaborate methods were obtained. Furthermore, the symbolic representation yielded by the infinity…

Advisors/Committee Members: Dorizzi, Bernadette (thesis director).

Subjects/Keywords: Biométrique; Vérification des signatures; Modélisation; Jerk minimum; Infinity clipping; Complexité de Lempel-Ziv; Représentation symbolique; Génération de signatures; Biometrics; Signature verification; Modeling; Minimum jerk; Infinity clipping; Lempel-Ziv complexity; Symbolic representation; Signature generation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Coutinho Canuto, J. (2014). Biomechanical online signature modeling applied to verification : Modélisation biomécanique des signatures en ligne appliqué à la vérification. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2014TELE0026

Chicago Manual of Style (16^th Edition):

Coutinho Canuto, Jânio. “Biomechanical online signature modeling applied to verification : Modélisation biomécanique des signatures en ligne appliqué à la vérification.” 2014. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed March 08, 2021. http://www.theses.fr/2014TELE0026.

MLA Handbook (7^th Edition):

Coutinho Canuto, Jânio. “Biomechanical online signature modeling applied to verification : Modélisation biomécanique des signatures en ligne appliqué à la vérification.” 2014. Web. 08 Mar 2021.

Vancouver:

Coutinho Canuto J. Biomechanical online signature modeling applied to verification : Modélisation biomécanique des signatures en ligne appliqué à la vérification. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2014. [cited 2021 Mar 08]. Available from: http://www.theses.fr/2014TELE0026.

Council of Science Editors:

Coutinho Canuto J. Biomechanical online signature modeling applied to verification : Modélisation biomécanique des signatures en ligne appliqué à la vérification. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2014. Available from: http://www.theses.fr/2014TELE0026

5. HUANG MINI. BIOINFORMATIC ANALYSIS OF PHYSICAL MUTATION SIGNATURES IN TUMORS TO INFER CARCINOGENIC PROCESSES AND EXPOSURES.

Degree: 2016, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/135174

Subjects/Keywords: Next generation sequencing; Mutation signature; Microsatellite instability; Aristolochic acid exposure; Aflatoxin exposure; NMF

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

MINI, H. (2016). BIOINFORMATIC ANALYSIS OF PHYSICAL MUTATION SIGNATURES IN TUMORS TO INFER CARCINOGENIC PROCESSES AND EXPOSURES. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/135174

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

MINI, HUANG. “BIOINFORMATIC ANALYSIS OF PHYSICAL MUTATION SIGNATURES IN TUMORS TO INFER CARCINOGENIC PROCESSES AND EXPOSURES.” 2016. Thesis, National University of Singapore. Accessed March 08, 2021. http://scholarbank.nus.edu.sg/handle/10635/135174.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

MINI, HUANG. “BIOINFORMATIC ANALYSIS OF PHYSICAL MUTATION SIGNATURES IN TUMORS TO INFER CARCINOGENIC PROCESSES AND EXPOSURES.” 2016. Web. 08 Mar 2021.

Vancouver:

MINI H. BIOINFORMATIC ANALYSIS OF PHYSICAL MUTATION SIGNATURES IN TUMORS TO INFER CARCINOGENIC PROCESSES AND EXPOSURES. [Internet] [Thesis]. National University of Singapore; 2016. [cited 2021 Mar 08]. Available from: http://scholarbank.nus.edu.sg/handle/10635/135174.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

MINI H. BIOINFORMATIC ANALYSIS OF PHYSICAL MUTATION SIGNATURES IN TUMORS TO INFER CARCINOGENIC PROCESSES AND EXPOSURES. [Thesis]. National University of Singapore; 2016. Available from: http://scholarbank.nus.edu.sg/handle/10635/135174

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

6. Cai, Min. Distributed indexing and aggregation techniques for peer-to-peer and grid computing.

Degree: PhD, Computer Science, 2006, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/34426/rec/2049

► Peer-to-Peer (P2P) systems and Grids are emerging as two novel paradigms of distributed computing for wide-area resource sharing on the Internet. In these two paradigms,… (more)

▼ Peer-to-Peer (P2P) systems and Grids are emerging as two novel paradigms of distributed computing for wide-area resource sharing on the Internet. In these two paradigms, it is essential to discover resources by their attributes and to acquire global information in a fully decentralized fashion. This dissertation proposes a multi-attribute addressable network (MAAN) for resource indexing, a distributed aggregation tree (DAT) for information aggregation, and a distributed counting scheme for estimating global cardinalities.; MAAN indexes resources by their attribute values on Chord via uniform locality preserving hashing. It resolves multi-attribute range queries with a single-attribute dominated algorithm that scales to both the network size and the number of attributes. The DAT scheme implicitlybuilds an aggregation tree from Chord routing paths without membership maintenance. It also improves the Chord routing algorithm to build a balanced DAT tree, when nodes are evenly distributed in the identifier space. Furthermore, the distributed counting scheme digests large sets into small cardinality summaries and merges them through a DAT tree. The global cardinality is estimated by using an adaptive counting algorithm that not only scales to large cardinalities but also scales to small ones.; Based on these techniques, this dissertation has developed three applications including a P2P replica location service (P-RLS), a distributed RDF repository (RDFPeers) and a worm signature generation system (WormShield). P-RLS extends the Globus RLS system with properties of self-organization, fault-tolerance and improved scalability. It also reduces query hotspots by using a predecessor replication scheme. RDFPeers stores, searches and subscribes to RDFtriples in a MAAN network. In RDFPeers, the routing hops for triple insertion, for most query resolution and for triple subscription are logarithmic to the network size.; WormShield automatically generates worm signatures by using distributed fingerprint filtering and aggregation at multiple edge networks. Due to Zipf-like fingerprint distribution, the filtering scheme reduces the amount of aggregation traffic by several orders of magnitude. The global fingerprint statistics are computed through DAT trees in a scalable and load-balanced fashion. The experimental results demonstrate that the indexing and aggregation schemes perform well in different P2P and Grid applications. Advisors/Committee Members: Hwang, Kai (Committee Chair), Kuo, C.-C. Jay (Committee Member), Neuman, Clifford (Committee Member).

Subjects/Keywords: distributed indexing; distributed aggregation; peer-to-peer computing; grid computing; worm signature generation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cai, M. (2006). Distributed indexing and aggregation techniques for peer-to-peer and grid computing. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/34426/rec/2049

Chicago Manual of Style (16^th Edition):

Cai, Min. “Distributed indexing and aggregation techniques for peer-to-peer and grid computing.” 2006. Doctoral Dissertation, University of Southern California. Accessed March 08, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/34426/rec/2049.

MLA Handbook (7^th Edition):

Cai, Min. “Distributed indexing and aggregation techniques for peer-to-peer and grid computing.” 2006. Web. 08 Mar 2021.

Vancouver:

Cai M. Distributed indexing and aggregation techniques for peer-to-peer and grid computing. [Internet] [Doctoral dissertation]. University of Southern California; 2006. [cited 2021 Mar 08]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/34426/rec/2049.

Council of Science Editors:

Cai M. Distributed indexing and aggregation techniques for peer-to-peer and grid computing. [Doctoral Dissertation]. University of Southern California; 2006. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/34426/rec/2049

Texas Medical Center

7. hu, Xin. INTEGRATIVE ANALYSIS OF OMICS DATA IN ADULT GLIOMA AND OTHER TCGA CANCERS TO GUIDE PRECISION MEDICINE.

Degree: PhD, 2017, Texas Medical Center

URL: https://digitalcommons.library.tmc.edu/utgsbs_dissertations/729

► Transcriptomic profiling and gene expression signatures have been widely applied as effective approaches for enhancing the molecular classification, diagnosis, prognosis or prediction of therapeutic… (more)

▼ Transcriptomic profiling and gene expression signatures have been widely applied as effective approaches for enhancing the molecular classification, diagnosis, prognosis or prediction of therapeutic response towards personalized therapy for cancer patients. Thanks to modern genome-wide profiling technology, scientists are able to build engines leveraging massive genomic variations and integrating with clinical data to identify “at risk” individuals for the sake of prevention, diagnosis and therapeutic interventions. In my graduate work for my Ph.D. thesis, I have investigated genomic sequencing data mining to comprehensively characterise molecular classifications and aberrant genomic events associated with clinical prognosis and treatment response, through applying high-dimensional omics genomic data to promote the understanding of gene signatures and somatic molecular alterations contributing to cancer progression and clinical outcomes. Following this motivation, my dissertation has been focused on the following three topics in translational genomics. 1) Characterization of transcriptomic plasticity and its association with the tumor microenvironment in glioblastoma (GBM). I have integrated transcriptomic, genomic, protein and clinical data to increase the accuracy of GBM classification, and identify the association between the GBM mesenchymal subtype and reduced tumorpurity, accompanied with increased presence of tumor-associated microglia. Then I have tackled the sole source of microglial as intrinsic tumor bulk but not their corresponding neurosphere cells through both transcriptional and protein level analysis using a panel of sphere-forming glioma cultures and their parent GBM samples.FurthermoreI have demonstrated my hypothesis through longitudinal analysis of paired primary and recurrent GBM samples that the phenotypic alterations of GBM subtypes are not due to intrinsic proneural-to-mesenchymal transition in tumor cells, rather it is intertwined with increased level of microglia upon disease recurrence. Collectively I have elucidated the critical role of tumor microenvironment (Microglia and macrophages from central nervous system) contributing to the intra-tumor heterogeneity and accurate classification of GBM patients based on transcriptomic profiling, which will not only significantly impact on clinical perspective but also pave the way for preclinical cancer research. 2) Identification of prognostic gene signatures that stratify adult diffuse glioma patientsharboring1p/19q co-deletions. I have compared multiple statistical methods and derived a gene signature significantly associated with survival by applying a machine learning algorithm. Then I have identified inflammatory response and acetylation activity that associated with malignant progression of 1p/19q co-deleted glioma. In addition, I showed this signature translates to other types of adult diffuse glioma, suggesting its universality in the pathobiology of other subset gliomas. My efforts on integrative data analysis of this… Advisors/Committee Members: Roel G.W. Verhaak, Ph.D., Erik P. Sulman, M.D., Ph.D., Keith A. Baggerly, Ph.D..

Subjects/Keywords: Cancer genomics; Omics data mining; Transcriptomics profiling; Gene signature; Risk prediction; Tumor microenvironment; Precision medicine; Glioma; Pan-cancer; Fusion transcripts; Genomic rearrangement; Next-generation sequencing; Prediction model; Disease Modeling; Health Information Technology; Medicine and Health Sciences; Translational Medical Research

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

hu, X. (2017). INTEGRATIVE ANALYSIS OF OMICS DATA IN ADULT GLIOMA AND OTHER TCGA CANCERS TO GUIDE PRECISION MEDICINE. (Doctoral Dissertation). Texas Medical Center. Retrieved from https://digitalcommons.library.tmc.edu/utgsbs_dissertations/729

Chicago Manual of Style (16^th Edition):

hu, Xin. “INTEGRATIVE ANALYSIS OF OMICS DATA IN ADULT GLIOMA AND OTHER TCGA CANCERS TO GUIDE PRECISION MEDICINE.” 2017. Doctoral Dissertation, Texas Medical Center. Accessed March 08, 2021. https://digitalcommons.library.tmc.edu/utgsbs_dissertations/729.

MLA Handbook (7^th Edition):

hu, Xin. “INTEGRATIVE ANALYSIS OF OMICS DATA IN ADULT GLIOMA AND OTHER TCGA CANCERS TO GUIDE PRECISION MEDICINE.” 2017. Web. 08 Mar 2021.

Vancouver:

hu X. INTEGRATIVE ANALYSIS OF OMICS DATA IN ADULT GLIOMA AND OTHER TCGA CANCERS TO GUIDE PRECISION MEDICINE. [Internet] [Doctoral dissertation]. Texas Medical Center; 2017. [cited 2021 Mar 08]. Available from: https://digitalcommons.library.tmc.edu/utgsbs_dissertations/729.

Council of Science Editors:

hu X. INTEGRATIVE ANALYSIS OF OMICS DATA IN ADULT GLIOMA AND OTHER TCGA CANCERS TO GUIDE PRECISION MEDICINE. [Doctoral Dissertation]. Texas Medical Center; 2017. Available from: https://digitalcommons.library.tmc.edu/utgsbs_dissertations/729

Brno University of Technology

8. Bláha, Lukáš. Analýza automatizovaného generování signatur s využitím Honeypotu: Analysis of Automated Generation of Signatures Using Honeypots.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/53573

► In this paper, system of automatic processing of attacks using honeypots is discussed. The first goal of the thesis is to become familiar with the… (more)

Subjects/Keywords: Signatura; detekční profil; automatické generování signatur; honeypot; škodlivý software; systém detekce průniku; zero-day útok; buffer overflow útok.; Signature; detection profile; automatic generation of signatures; honeypot; malware; intrusion detection system; zero-day attack; buffer overflow attack.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bláha, L. (2019). Analýza automatizovaného generování signatur s využitím Honeypotu: Analysis of Automated Generation of Signatures Using Honeypots. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53573

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bláha, Lukáš. “Analýza automatizovaného generování signatur s využitím Honeypotu: Analysis of Automated Generation of Signatures Using Honeypots.” 2019. Thesis, Brno University of Technology. Accessed March 08, 2021. http://hdl.handle.net/11012/53573.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bláha, Lukáš. “Analýza automatizovaného generování signatur s využitím Honeypotu: Analysis of Automated Generation of Signatures Using Honeypots.” 2019. Web. 08 Mar 2021.

Vancouver:

Bláha L. Analýza automatizovaného generování signatur s využitím Honeypotu: Analysis of Automated Generation of Signatures Using Honeypots. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11012/53573.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bláha L. Analýza automatizovaného generování signatur s využitím Honeypotu: Analysis of Automated Generation of Signatures Using Honeypots. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53573

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Wang, Xian. Enabling low cost test and tuning of difficult-to-measure device specifications: application to DC-DC converters and high speed devices.

Degree: PhD, Electrical and Computer Engineering, 2015, Georgia Tech

URL: http://hdl.handle.net/1853/53521

► Low-cost test and tuning methods for difficult-to-measure specifications are presented in this research from the following perspectives: 1)"Safe" test and self-tuning for power converters: To… (more)

▼ Low-cost test and tuning methods for difficult-to-measure specifications are presented in this research from the following perspectives: 1)"Safe" test and self-tuning for power converters: To avoid the risk of device under test (DUT) damage during conventional load/line regulation measurement on power converter, a "safe" alternate test structure is developed where the power converter (boost/buck converter) is placed in a different mode of operation during alternative test (light switching load) as opposed to standard test (heavy switching load) to prevent damage to the DUT during manufacturing test. Based on the alternative test structure, self-tuning methods for both boost and buck converters are also developed in this thesis. In addition, to make these test structures suitable for on-chip built-in self-test (BIST) application, a special sensing circuit has been designed and implemented. Stability analysis filters and appropriate models are also implemented to predict the DUT’s electrical stability condition during test and to further predict the values of tuning knobs needed for the tuning process. 2) High bandwidth RF signal generation: Up-convertion has been widely used in high frequency RF signal generation but mixer nonlinearity results in signal distortion that is difficult to eliminate with such methods. To address this problem, a framework for low-cost high-fidelity wideband RF signal generation is developed in this thesis. Depending on the band-limited target waveform, the input data for two interleaved DACs (digital-to-analog converters) system is optimized by a matrix-model-based algorithm in such a way that it minimizes the distortion between one of its image replicas in the frequency domain and the target RF waveform within a specified signal bandwidth. The approach is used to demonstrate how interferers with specified frequency characteristics can be synthesized at low cost for interference testing of RF communications systems. The frameworks presented in this thesis have a significant impact in enabling low-cost test and tuning of difficult-to-measure device specifications for power converter and high-speed devices. Advisors/Committee Members: Chatterjee, Abhijit (advisor), Raychowdhury, Arijit (committee member), Keezer, David (committee member), Mukhopadhyay, Saibal (committee member), Singh, Adit D. (committee member).

Subjects/Keywords: Signature test; RF signal generation; Power converter test; Built-in test; DFT; Alternative testing

…x29; signature test. ...... 5 Figure 5: Overview of the alternative test procedure… …88 Figure 66: Block diagram of proposed band-limited channel interference generation with a… …100 xii Figure 69: Simulation on phase noise generation: (a) injected phase… …101 Figure 70: Simulation on minimum shift keying (MSK) waveform generation with… …112 Figure 81: Waveforms of entire RF signal generation process…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, X. (2015). Enabling low cost test and tuning of difficult-to-measure device specifications: application to DC-DC converters and high speed devices. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53521

Chicago Manual of Style (16^th Edition):

Wang, Xian. “Enabling low cost test and tuning of difficult-to-measure device specifications: application to DC-DC converters and high speed devices.” 2015. Doctoral Dissertation, Georgia Tech. Accessed March 08, 2021. http://hdl.handle.net/1853/53521.

MLA Handbook (7^th Edition):

Wang, Xian. “Enabling low cost test and tuning of difficult-to-measure device specifications: application to DC-DC converters and high speed devices.” 2015. Web. 08 Mar 2021.

Vancouver:

Wang X. Enabling low cost test and tuning of difficult-to-measure device specifications: application to DC-DC converters and high speed devices. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1853/53521.

Council of Science Editors:

Wang X. Enabling low cost test and tuning of difficult-to-measure device specifications: application to DC-DC converters and high speed devices. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53521

University of Tennessee – Knoxville

10. Freeman, Elton Lewis. Validation of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation.

Degree: MS, Engineering Science, 2012, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_gradthes/1377

► Extremization of a weak form for the continuum energy conservation principle differential equation naturally implements fluid convection and radiation as flux Robin boundary conditions… (more)

Subjects/Keywords: Algorithms; Thermal Signature Generation; Finite Elements; Computer Engineering; Engineering Physics; Engineering Science and Materials; Fluid Dynamics; Mechanical Engineering; Numerical Analysis and Computation; Numerical Analysis and Scientific Computing; Ordinary Differential Equations and Applied Dynamics; Other Mathematics; Partial Differential Equations; Software Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Freeman, E. L. (2012). Validation of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/1377

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Freeman, Elton Lewis. “Validation of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation.” 2012. Thesis, University of Tennessee – Knoxville. Accessed March 08, 2021. https://trace.tennessee.edu/utk_gradthes/1377.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Freeman, Elton Lewis. “Validation of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation.” 2012. Web. 08 Mar 2021.

Vancouver:

Freeman EL. Validation of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation. [Internet] [Thesis]. University of Tennessee – Knoxville; 2012. [cited 2021 Mar 08]. Available from: https://trace.tennessee.edu/utk_gradthes/1377.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Freeman EL. Validation of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation. [Thesis]. University of Tennessee – Knoxville; 2012. Available from: https://trace.tennessee.edu/utk_gradthes/1377

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Miami University

11. Amjad, Meisam. Lightmap Generation and Parameterizationfor Real-Time 3D Infra-Red Scenes.

Degree: MS, Computer Science & Software Engineering, 2019, Miami University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=miami1564675961391441

► Having high resolution Infra-Red (IR) imagery in cluttered environment of battlespace iscrucial for capturing intelligence in search and target acquisition tasks such as whether or… (more)

Subjects/Keywords: Computer Science; lightmap parameterization; lightmap generation; dynamic scene; Real-Time scene; Infra-Red; 3D infra-Red Scene; lightmap for heat signature; lightmap for heat sources; 3D mesh to UV mesh parameterization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Amjad, M. (2019). Lightmap Generation and Parameterizationfor Real-Time 3D Infra-Red Scenes. (Masters Thesis). Miami University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=miami1564675961391441

Chicago Manual of Style (16^th Edition):

Amjad, Meisam. “Lightmap Generation and Parameterizationfor Real-Time 3D Infra-Red Scenes.” 2019. Masters Thesis, Miami University. Accessed March 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=miami1564675961391441.

MLA Handbook (7^th Edition):

Amjad, Meisam. “Lightmap Generation and Parameterizationfor Real-Time 3D Infra-Red Scenes.” 2019. Web. 08 Mar 2021.

Vancouver:

Amjad M. Lightmap Generation and Parameterizationfor Real-Time 3D Infra-Red Scenes. [Internet] [Masters thesis]. Miami University; 2019. [cited 2021 Mar 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1564675961391441.

Council of Science Editors:

Amjad M. Lightmap Generation and Parameterizationfor Real-Time 3D Infra-Red Scenes. [Masters Thesis]. Miami University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1564675961391441

University of Cincinnati

12. ABEYSINGHE, RUVINI PRADEEPA. SIGNATURE FILES FOR DOCUMENT MANAGEMENT.

Degree: MS, Engineering : Computer Science, 2001, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin990539054

► A document management system, called SDMS (Signature-file Document Management System), has been designed and implemented. This system was designed based on the signature file method… (more)

Subjects/Keywords: Computer Science; SIGNATURE FILES; TEXT RETRIEVAL METHODS; INDEXING; DOCUMENT MANAGEMENT SYSTEM; PSEUDO RANDOM NUMBER GENERATION

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

ABEYSINGHE, R. P. (2001). SIGNATURE FILES FOR DOCUMENT MANAGEMENT. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin990539054

Chicago Manual of Style (16^th Edition):

ABEYSINGHE, RUVINI PRADEEPA. “SIGNATURE FILES FOR DOCUMENT MANAGEMENT.” 2001. Masters Thesis, University of Cincinnati. Accessed March 08, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin990539054.

MLA Handbook (7^th Edition):

ABEYSINGHE, RUVINI PRADEEPA. “SIGNATURE FILES FOR DOCUMENT MANAGEMENT.” 2001. Web. 08 Mar 2021.

Vancouver:

ABEYSINGHE RP. SIGNATURE FILES FOR DOCUMENT MANAGEMENT. [Internet] [Masters thesis]. University of Cincinnati; 2001. [cited 2021 Mar 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin990539054.

Council of Science Editors:

ABEYSINGHE RP. SIGNATURE FILES FOR DOCUMENT MANAGEMENT. [Masters Thesis]. University of Cincinnati; 2001. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin990539054

University of Victoria

13. Elsayed, Mohamed Ahmed Seifeldin Mohamed. Blockchain-based containment of computer worms.

Degree: Department of Electrical and Computer Engineering, 2020, University of Victoria

URL: http://hdl.handle.net/1828/12492

► Information technology systems are essential for most businesses as they facilitate the handling and sharing of data and the execution of tasks. Due to connectivity… (more)

▼ Information technology systems are essential for most businesses as they facilitate the handling and sharing of data and the execution of tasks. Due to connectivity to the internet and other internal networks, these systems are susceptible to cyberattacks. Computer worms are one of the most significant threats to computer systems because of their fast self-propagation to multiple systems and malicious payloads. Modern worms employ obfuscation techniques to avoid detection using patterns from previous attacks. Although the best defense is to eliminate (patch) the software vulnerabilities being exploited by computer worms, this requires a substantial amount of time to create, test, and deploy the patches. Worm containment techniques are used to reduce or stop the spread of worm infections to allow time for software patches to be developed and deployed. In this dissertation, a novel blockchain-based collaborative intrusion prevention system model is introduced. This model is designed to proactively contain zero-day and obfuscated computer worms. In this model, containment is achieved by creating and distributing signatures for the exploited vulnerabilities. Blockchain technology is employed to provide liveness, maintain an immutable record of vulnerability-based signatures to update peers, accomplish trust in confirming the occurrence of a malicious event and the corresponding signature, and allow a decentralized defensive environment. A consensus algorithm based on the Practical Byzantine Fault Tolerance (PBFT) algorithm is employed in the model. The TLA+ formal method is utilized to check the correctness, liveness, and safety properties of the model as well as to assert that it has no behavioral errors. A blockchain-based automatic worm containment system is implemented. A synthetic worm is created to exploit a network-deployed vulnerable program. This is used to evaluate the effectiveness of the containment system. It is shown that the system can contain the worm and has good performance. The system can contain 100 worm attacks a second by generating and distributing the corresponding vulnerability-based signatures. The system latency to contain these attacks is less than 10 ms. In addition, the system has low resource requirements with respect to memory, CPU, and network traffic. Advisors/Committee Members: Gulliver, T. Aaron (supervisor).

Subjects/Keywords: Worm Containment; Intrusion Response; Practical Byzantine Fault Tolerance (PBFT); Distributed Host-based Intrusion Prevention; Worm Signature Generation; Blockchain-based Containment; Dynamic Taint Analysis Detection; Vulnerability-based Worm Signatures; TLA+ Formal Method

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Elsayed, M. A. S. M. (2020). Blockchain-based containment of computer worms. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/12492

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Elsayed, Mohamed Ahmed Seifeldin Mohamed. “Blockchain-based containment of computer worms.” 2020. Thesis, University of Victoria. Accessed March 08, 2021. http://hdl.handle.net/1828/12492.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Elsayed, Mohamed Ahmed Seifeldin Mohamed. “Blockchain-based containment of computer worms.” 2020. Web. 08 Mar 2021.

Vancouver:

Elsayed MASM. Blockchain-based containment of computer worms. [Internet] [Thesis]. University of Victoria; 2020. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/1828/12492.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Elsayed MASM. Blockchain-based containment of computer worms. [Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/12492

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

AUT University

14. Naidu, Vijay Jeevanantham. Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques .

Degree: AUT University

URL: http://hdl.handle.net/10292/12064

► Modern antivirus systems (AVSs) are not able to detect new polymorphic malware variants until they emerge, even when signatures of one or more variants belonging… (more)

Subjects/Keywords: Smith-Waterman algorithm; Dynamic programming; Polymorphic malware; Syntactic approach; Sequence alignment techniques; String matching algorithm; Biological sequences; Bioinformatics; Data mining; Automatic signature generation; Phylogenetics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Naidu, V. J. (n.d.). Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques . (Thesis). AUT University. Retrieved from http://hdl.handle.net/10292/12064

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Naidu, Vijay Jeevanantham. “Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques .” Thesis, AUT University. Accessed March 08, 2021. http://hdl.handle.net/10292/12064.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Naidu, Vijay Jeevanantham. “Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques .” Web. 08 Mar 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Naidu VJ. Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques . [Internet] [Thesis]. AUT University; [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10292/12064.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Naidu VJ. Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques . [Thesis]. AUT University; Available from: http://hdl.handle.net/10292/12064

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Brno University of Technology

15. Hrazdilová, Ivana. Analýza dat ze sekvenování příští generace ke studiu aktivity transposonů v nádorových buňkách: Analysis of NGS data for study of transposon activity in cancer cells.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/26155

► Theoretical part of this diploma thesis gives a brief characteristic of human mobile elements (transposons), which represents nearly 50% of human genome. It provides basic… (more)

Subjects/Keywords: transposony; mobilní genetické elementy; LINE; L1; SINE; Alu; sekvenace nové generace; NGS; masivní paralelní sekvenování; RNA-seq; rakovina; single-end; paired-end; TopHat; Bowtie; transposons; mobile genetic elements; LINE; L1; SINE; Alu; next generation sequencing; NGS; massively paralell signature sequencing; RNA-seq; cancer; single-end; paired-end; TopHat; Bowtie

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hrazdilová, I. (2018). Analýza dat ze sekvenování příští generace ke studiu aktivity transposonů v nádorových buňkách: Analysis of NGS data for study of transposon activity in cancer cells. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/26155

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hrazdilová, Ivana. “Analýza dat ze sekvenování příští generace ke studiu aktivity transposonů v nádorových buňkách: Analysis of NGS data for study of transposon activity in cancer cells.” 2018. Thesis, Brno University of Technology. Accessed March 08, 2021. http://hdl.handle.net/11012/26155.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hrazdilová, Ivana. “Analýza dat ze sekvenování příští generace ke studiu aktivity transposonů v nádorových buňkách: Analysis of NGS data for study of transposon activity in cancer cells.” 2018. Web. 08 Mar 2021.

Vancouver:

Hrazdilová I. Analýza dat ze sekvenování příští generace ke studiu aktivity transposonů v nádorových buňkách: Analysis of NGS data for study of transposon activity in cancer cells. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11012/26155.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hrazdilová I. Analýza dat ze sekvenování příští generace ke studiu aktivity transposonů v nádorových buňkách: Analysis of NGS data for study of transposon activity in cancer cells. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/26155

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Campbell, Keith A. Low-cost error detection through high-level synthesis.

Degree: MS, Electrical & Computer Engineering, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/89068

► System-on-chip design is becoming increasingly complex as technology scaling enables more and more functionality on a chip. This scaling and complexity has resulted in a… (more)

▼ System-on-chip design is becoming increasingly complex as technology scaling enables more and more functionality on a chip. This scaling and complexity has resulted in a variety of reliability and validation challenges including logic bugs, hot spots, wear-out, and soft errors. To make matters worse, as we reach the limits of Dennard scaling, efforts to improve system performance and energy efficiency have resulted in the integration of a wide variety of complex hardware accelerators in SoCs. Thus the challenge is to design complex, custom hardware that is efficient, but also correct and reliable. High-level synthesis shows promise to address the problem of complex hardware design by providing a bridge from the high-productivity software domain to the hardware design process. Much research has been done on high-level synthesis efficiency optimizations. This thesis shows that high-level synthesis also has the power to address validation and reliability challenges through two solutions. One solution for circuit reliability is modulo-3 shadow datapaths: performing lightweight shadow computations in modulo-3 space for each main computation. We leverage the binding and scheduling flexibility of high-level synthesis to detect control errors through diverse binding and minimize area cost through intelligent checkpoint scheduling and modulo-3 reducer sharing. We introduce logic and dataflow optimizations to further reduce cost. We evaluated our technique with 12 high-level synthesis benchmarks from the arithmetic-oriented PolyBench benchmark suite using FPGA emulated netlist-level error injection. We observe coverages of 99.1% for stuck-at faults, 99.5% for soft errors, and 99.6% for timing errors with a 25.7% area cost and negligible performance impact. Leveraging a mean error detection latency of 12.75 cycles (4150x faster than end result check) for soft errors, we also explore a rollback recovery method with an additional area cost of 28.0%, observing a 175x increase in reliability against soft errors. Another solution for rapid post-silicon validation of accelerator designs is Hybrid Quick Error Detection (H-QED): inserting signature generation logic in a hardware design to create a heavily compressed signature stream that captures the internal behavior of the design at a fine temporal and spatial granularity for comparison with a reference set of signatures generated by high-level simulation to detect bugs. Using H-QED, we demonstrate an improvement in error detection latency (time elapsed from when a bug is activated to when it manifests as an observable failure) of two orders of magnitude and a threefold improvement in bug coverage compared to traditional post-silicon validation techniques. H-QED also uncovered previously unknown bugs in the CHStone benchmark suite, which is widely used by the HLS community. H-QED incurs less than 10% area overhead for the accelerator it validates with negligible performance impact, and we also introduce techniques to minimize any possible intrusiveness introduced by H-QED. Advisors/Committee Members: Chen, Deming (advisor).

Subjects/Keywords: High-level synthesis; Automation; error detection; scheduling; binding; compiler transformation; compiler optimization; pipelining; modulo arithmetic; logic optimization; state machine; datapath, control logic; shadow logic; low cost; high performance; electrical bugs; Aliasing; stuck-at faults; soft errors; timing errors; checkpointing; rollback; recovery; post-silicon validation; Accelerators; system on a chip; signature generation; execution signatures; execution hashing; logic bugs; nondeterministic bugs; masked errors; circuit reliability; hot spots; wear out; silent data corruption; observability; detection latency; mixed datapath; diversity; checkpoint corruption; error injection; error removal; Quick Error Detection (QED); Hybrid Quick Error Detection (H-QED); hybrid hardware/software; execution tracing; address conversion; undefined behavior; High-Level Synthesis (HLS) engine bugs; detection coverage

…resources. In Chapter 4, I propose the insertion of signature generation logic in a hardware… …design to create a heavily compressed signature stream that captures the internal behavior of… …identifying important variables to capture and enabling the sharing of expensive signature… …generation logic. Before these main chapters, I will provide some background on the reliability and… …dynamic values during hardware execution. An execution signature is a hashed trace of the…

15 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Campbell, K. A. (2015). Low-cost error detection through high-level synthesis. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/89068

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Campbell, Keith A. “Low-cost error detection through high-level synthesis.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed March 08, 2021. http://hdl.handle.net/2142/89068.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Campbell, Keith A. “Low-cost error detection through high-level synthesis.” 2015. Web. 08 Mar 2021.

Vancouver:

Campbell KA. Low-cost error detection through high-level synthesis. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2142/89068.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Campbell KA. Low-cost error detection through high-level synthesis. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/89068

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. Campbell, Keith A. Robust and reliable hardware accelerator design through high-level synthesis.

Degree: PhD, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/99294

► System-on-chip design is becoming increasingly complex as technology scaling enables more and more functionality on a chip. This scaling-driven complexity has resulted in a variety… (more)

▼ System-on-chip design is becoming increasingly complex as technology scaling enables more and more functionality on a chip. This scaling-driven complexity has resulted in a variety of reliability and validation challenges including logic bugs, hot spots, wear-out, and soft errors. To make matters worse, as we reach the limits of Dennard scaling, efforts to improve system performance and energy efficiency have resulted in the integration of a wide variety of complex hardware accelerators in SoCs. Thus the challenge is to design complex, custom hardware that is efficient, but also correct and reliable. High-level synthesis shows promise to address the problem of complex hardware design by providing a bridge from the high-productivity software domain to the hardware design process. Much research has been done on high-level synthesis efficiency optimizations. This dissertation shows that high-level synthesis also has the power to address validation and reliability challenges through three automated solutions targeting three key stages in the hardware design and use cycle: pre-silicon debugging, post-silicon validation, and post-deployment error detection. Our solution for rapid pre-silicon debugging of accelerator designs is hybrid tracing: comparing a datapath-level trace of hardware execution with a reference software implementation at a fine temporal and spatial granularity to detect logic bugs. An integrated backtrace process delivers source-code meaning to the hardware designer, pinpointing the location of bug activation and providing a strong hint for potential bug fixes. Experimental results show that we are able to detect and aid in localization of logic bugs from both C/C++ specifications as well as the high-level synthesis engine itself. A variation of this solution tailored for rapid post-silicon validation of accelerator designs is hybrid hashing: inserting signature generation logic in a hardware design to create a heavily compressed signature stream that captures the internal behavior of the design at a fine temporal and spatial granularity for comparison with a reference set of signatures generated by high-level simulation to detect bugs. Using hybrid hashing, we demonstrate an improvement in error detection latency (time elapsed from when a bug is activated to when it manifests as an observable failure) of two orders of magnitude and a threefold improvement in bug coverage compared to traditional post-silicon validation techniques. Hybrid hashing also uncovered previously unknown bugs in the CHStone benchmark suite, which is widely used by the HLS community. Hybrid hashing incurs less than 10% area overhead for the accelerator it validates with negligible performance impact, and we also introduce techniques to minimize any possible intrusiveness introduced by hybrid hashing. Finally, our solution for post-deployment error detection is modulo-3 shadow datapaths: performing lightweight shadow computations in modulo-3 space for each main computation. We leverage the binding and scheduling… Advisors/Committee Members: Chen, Deming (advisor), Chen, Deming (Committee Chair), Hwu, Wen-Mei W (committee member), Wong, Martin D F (committee member), Kim, Nam Sung (committee member).

Subjects/Keywords: High-level synthesis (HLS); Automation; Error detection; Scheduling; Binding; Compiler transformation; Compiler optimization; Pipelining; Modulo arithmetic; Modulo-3; Logic optimization; State machine; Datapath; Control logic; Shadow datapath; Modulo datapath; Low cost; High performance; Electrical bug; Aliasing; Stuck-at fault; Soft error; Timing error; Checkpointing; Rollback; Recovery; Pre-silicon validation; Post-silicon validation; Pre-silicon debug; Post-silicon debug; Accelerator; System on a chip; Signature generation; Execution signature; Execution hash; Logic bug; Nondeterministic bug; Masked error; Circuit reliability; Hot spot; Wear out; Silent data corruption; Observability; Detection latency; Mixed datapath; Diversity; Checkpoint corruption; Error injection; Error removal; Quick Error Detection (QED); Hybrid Quick Error Detection (H-QED); Instrumentation; Hybrid co-simulation; Hardware/software; Integration testing; Hybrid tracing; Hybrid hashing; Source-code localization; Software debugging tool; Valgrind; Clang sanitizer; Clang static analyzer; Cppcheck; Root cause analysis; Execution tracing; Realtime error detection; Simulation trigger; Nonintrusive; Address conversion; Undefined behavior; High-level synthesis (HLS) bug; Detection coverage; Gate-level architecture; Mersenne modulus; Full adder; Half adder; Quarter adder; Wraparound; Modulo reducer; Modulo adder; Modulo multiplier; Modulo comparator; Cross-layer; Algorithm; Instruction; Architecture; Logic synthesis; Physical design; Algorithm-based fault tolerance (ABFT); Error detection by duplicated instructions (EDDI); Parity; Flip-flop hardening; Layout design through error-aware transistor positioning dual interlocked storage cell (LEAP-DICE); Cost-effective; Place-and-route; Field programmable gate array (FPGA) emulation; Application specific integrated circuit (ASIC); Field programmable gate array (FPGA); Energy; Area; Latency

…signature generation logic into a fabricated hardware design to create a heavily compressed… …variables to capture and enabling the sharing of expensive signature generation logic. In Chapter… …signature stream that captures the internal behavior of the design during post-silicon validation… …generation of these units. We show that the use of these new functional units reduces shadow… …execution. An execution signature is a hashed trace of the dynamic value of variables during…

14 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Campbell, K. A. (2017). Robust and reliable hardware accelerator design through high-level synthesis. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99294

Chicago Manual of Style (16^th Edition):

Campbell, Keith A. “Robust and reliable hardware accelerator design through high-level synthesis.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 08, 2021. http://hdl.handle.net/2142/99294.

MLA Handbook (7^th Edition):

Campbell, Keith A. “Robust and reliable hardware accelerator design through high-level synthesis.” 2017. Web. 08 Mar 2021.

Vancouver:

Campbell KA. Robust and reliable hardware accelerator design through high-level synthesis. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/2142/99294.

Council of Science Editors:

Campbell KA. Robust and reliable hardware accelerator design through high-level synthesis. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99294

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations