The Experts below are selected from a list of 67593 Experts worldwide ranked by ideXlab platform
Muhasin, Haifaa Jassim - One of the best experts on this subject based on the ideXlab platform.
-
A multi-level framework for efficient sensitive data transmission in cloud computing
2019Co-Authors: Muhasin, Haifaa JassimAbstract:Cloud computing, as a growing field, can provide the needs of enterprises and individuals to access cloud computing resources and meet their organizational computing requirements. The popularity of cloud computing is characterized by a number of great features, such as scalability, low cost and unlimited resources. These features have encouraged many organizations and individuals to transfer their data over the cloud. However, cloud computing is constrained by security and privacy issues, particularly by factors on confidentiality, integrity, availability and privacy, apart from access control, management and internal attacks. These issues have become a major challenge in using the cloud, especially when dealing with sensitive data. The aim of this study is to address the problem of protection in terms of privacy and security of data from the perspective of management of information systems (MIS) and its decision-making process. Here, the factors related to the management and protection of sensitive data in cloud computing are data confidentiality (DC), data integrity (DI), data privacy (DP) and data availability (DA). The analyses of these factors are performed on the basis of the interests of managers and individuals whose aim is to protect sensitive data over the cloud. The experimental study in this research includes a pilot study, the development of a Tool as a proof of concept and an experts’ interview. The Tool, which is developed on the basis of the proposed framework, is verified by the interviewed experts and through Tool Execution. The results from the interviews confirm the validity and workability of the proposed framework in enhancing the decision making of MIS and managing and protecting sensitive data over the cloud. Subsequently, the anonymization method of the proposed framework is compared with the encryption approach of previous work. The research applies the anonymization technique and classifies the contents of a sensitive data file by the k-anonymity technique, which can efficiently protect sensitive data and reduce the transmission time and size of a file sent over the cloud. The digital signature of the file containing sensitive data is generated and sent together with the file to ensure DI. Private and confidential data management issues of intrusion and data loss over the cloud are solved by using the proposed multi-level framework, which applies the method of responsible participation to maintain DC and DA upon request—the other major contribution of this research. This study has achieved its stated objectives. The results obtained by the experimental study are aligned with the proposed framework and the concept of protection and management of private confidential data for effective information management decision making
Luo Shuang - One of the best experts on this subject based on the ideXlab platform.
-
Enabling and Performance Benchmarking of a Next-generation Sequencing Data Analysis Pipeline
2019Co-Authors: Luo ShuangAbstract:The development of Next Generation Sequencing (NGS) technology resulted the rapid accumulation of a large amount of sequencing data demanding data mining. Various of variant calling softwares and pipelines came into being. Genome Analysis Toolkit (GATK) and its Best Practices quickly became the industrial gold-standard for variant calling because of its speediness, high accuracy and throughput. GATK has been updated all the time. The latest and strongest version is GATK4 which enabled parallelization and cloud infrastructure optimization via Apache spark. Currently, Broad Institute has cooperated with many cloud providers to deploy GATK Best Practices on cloud platform. However, there is no benchmarking data released for GATK4 and no cooperation with CSC (CSC – IT Center of Science Ltd) cPouta IaaS (Infrastructure as a Service) cloud. We optimized WDL (workflow description language) script of germline SNPs and Indels short variants discovery workflow from Best Practices and ran it by Cromwell Execution engine on a virtual machine of cPouta cloud which featured a 24 cores Intel(R) Xeon(R) CPU E5-2680 v3 with hyper-threading. In addition, we benchmarked pipeline Execution time(s) for five seperated pipelines of this workflow with three 30X WGS (Whole Genome Sequencing) datasets: NA12878, NA12891 and NA12892 and explored optimized runtime parameters for GATK4 Tools, PairHMM thread scalability in HaplotypeCaller, GATK4 thread scalability for PGC in MarkDuplicates and Execution times comparison for GATK4 SortSam vs SortSamSpark and MarkDuplicates vs MarkDuplicatesSpark. We found the real Execution time for similar WGS datasets with different size and features showed consistency and Execution time and dataset size were roughly positive correlated. The optimal threads number is 12 for GATK4 HaplotypeCaller in ERC mode, giving rise to 12.4% speed-up. The optimal PGC threads number is 2 for GATK4 MarkDuplicates. And, multi-threading with Spark local runner highly speeded up GATK4 Tool Execution. SortSamSpark enabled 16 local cores gave rise to a speed-up of 83.6%. MarkDuplicatesSpark enabled 16 local cores gave rise to a speed-up of 22.2% and 37.3%, seperately with and without writing metrics file. With detailed virtural machine setting up, optimized parameters and GATK4 performance benchmarking data, this thesis is a guide for implementation of GATK4 Best Practices germline SNPs and Indels short variants discovery workflow on CSC cPouta cloud platform
William H Mangionesmith - One of the best experts on this subject based on the ideXlab platform.
-
dynamic circuit generation for solving specific problem instances of boolean satisfiability
Field-Programmable Custom Computing Machines, 1998Co-Authors: A Rashid, J Leonard, William H MangionesmithAbstract:Optimization and query problems provide the best clear opportunity for configurable computing systems to achieve a significant performance advantage over ASICs. Programmable hardware can be optimized to solve a specific problem instance that only needs to be solved once, and the circuit can be thrown away after its single Execution. This paper investigates the applicability of this technology to solving a specific query problem, known as Boolean Satisfiability. We provide a system for capturing the complete Execution cost of this approach, by accounting for CAD Tool Execution time. The key to this approach is to circumvent the standard CAD Tools and directly generate circuits at runtime. A set of example circuits is presented as part of the system evaluation, and a complete implementation on the Xilinx XC6216 FPGA is presented.
A Rashid - One of the best experts on this subject based on the ideXlab platform.
-
dynamic circuit generation for solving specific problem instances of boolean satisfiability
Field-Programmable Custom Computing Machines, 1998Co-Authors: A Rashid, J Leonard, William H MangionesmithAbstract:Optimization and query problems provide the best clear opportunity for configurable computing systems to achieve a significant performance advantage over ASICs. Programmable hardware can be optimized to solve a specific problem instance that only needs to be solved once, and the circuit can be thrown away after its single Execution. This paper investigates the applicability of this technology to solving a specific query problem, known as Boolean Satisfiability. We provide a system for capturing the complete Execution cost of this approach, by accounting for CAD Tool Execution time. The key to this approach is to circumvent the standard CAD Tools and directly generate circuits at runtime. A set of example circuits is presented as part of the system evaluation, and a complete implementation on the Xilinx XC6216 FPGA is presented.
J Leonard - One of the best experts on this subject based on the ideXlab platform.
-
dynamic circuit generation for solving specific problem instances of boolean satisfiability
Field-Programmable Custom Computing Machines, 1998Co-Authors: A Rashid, J Leonard, William H MangionesmithAbstract:Optimization and query problems provide the best clear opportunity for configurable computing systems to achieve a significant performance advantage over ASICs. Programmable hardware can be optimized to solve a specific problem instance that only needs to be solved once, and the circuit can be thrown away after its single Execution. This paper investigates the applicability of this technology to solving a specific query problem, known as Boolean Satisfiability. We provide a system for capturing the complete Execution cost of this approach, by accounting for CAD Tool Execution time. The key to this approach is to circumvent the standard CAD Tools and directly generate circuits at runtime. A set of example circuits is presented as part of the system evaluation, and a complete implementation on the Xilinx XC6216 FPGA is presented.