Identity Fragmentation in Post-Secondary Computing Education
Mara Kirdani-Ryan · ResearchWorks at the University of Washington (University of Washington) · 2024
Thesis (Ph.D.)--University of Washington, 2024
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 3,421 papers for “Fragmentation (computing)”
Mara Kirdani-Ryan · ResearchWorks at the University of Washington (University of Washington) · 2024
Thesis (Ph.D.)--University of Washington, 2024
Cited by 0
Florian Rasche (2097586), Aleš Svatoš (2037844), Ravi Kumar Maddula (2230798) et al. · Figshare · 2016
The structural elucidation of organic compounds in complex biofluids and tissues remains a significant analytical challenge. For mass spectrometry, the manual interpretation of collision-induced dissociation (CID) mass spectra is cumbersome and requires expert knowledge, as the fragmentation mechanisms of ions formed from small molecules are not completely understood. The automated identification of compounds is generally limited to searching in spectral libraries. Here, we present a method for interpreting the CID spectra of the organic compound’s protonated ions by computing fragmentation trees that establish not only the molecular formula of the compound and all fragment ions but also the dependencies between fragment ions. This is an important step toward the automated identification of unknowns from the CID spectra of compounds that are not in any database.
Cited by 0Open access
Florian Rasche (2097586), Aleš Svatoš (2037844), Ravi Kumar Maddula (2230798) et al. · Figshare · 2016
The structural elucidation of organic compounds in complex biofluids and tissues remains a significant analytical challenge. For mass spectrometry, the manual interpretation of collision-induced dissociation (CID) mass spectra is cumbersome and requires expert knowledge, as the fragmentation mechanisms of ions formed from small molecules are not completely understood. The automated identification of compounds is generally limited to searching in spectral libraries. Here, we present a method for interpreting the CID spectra of the organic compound’s protonated ions by computing fragmentation trees that establish not only the molecular formula of the compound and all fragment ions but also the dependencies between fragment ions. This is an important step toward the automated identification of unknowns from the CID spectra of compounds that are not in any database.
Cited by 0Open access
Mr. Mahesh J. Kanase, Bhagyashri A. Alase, Vinayak Mahadev Chougule et al. · International Journal of Scientific Research in Science and Technology · 2025
Cloud computing has revolutionized data storage and processing by offering scalability, flexibility, and cost efficiency. However, it introduces significant security challenges, particularly concerning data privacy and protection against unauthorized access. Traditional encryption methods, while effective, are not always sufficient to mitigate sophisticated attacks such as data breaches or insider threats. Data fragmentation emerges as a robust supplementary approach to enhance data security in cloud environments. This paper explores the concept of data fragmentation, which involves dividing data into smaller fragments and distributing them across multiple storage nodes or regions. By storing fragmented data in disparate locations and combining it with encryption, the risk of unauthorized data access is significantly reduced. Even if one fragment is compromised, the attacker cannot reconstruct meaningful information without access to all fragments and decryption keys.
Cited by 0Open access
Juan José Gálvez-Viruet, Felipe J. Llanes–Estrada, Nicolás Martínez de Arenaza et al. · ArXiv.org · 2025
We deploy Quantum Chromodynamics (QCD) in Light-front Quantization (and Gauge), discretized and truncated in both Fock -- and momentum -- spaces with a particle-register encoding suited for quantum simulation; we show for the first time how to calculate fragmentation functions, a problem heretofore untractable in general from \emph{ab-initio} approaches. We provide a classical-simulator based proof-of-concept by computing the charm-to-charmonium fragmentation, $c\to J/ψ$, in a simplified setup, an interesting case where we can (reasonably) compare with the known 1993 perturbative evaluation within Nonrelativistic QCD.
Cited by 0Open access
Kerstin Scheubert, Franziska Hufsky, Florian Rasche et al. · Journal of Computational Biology · 2011
Since metabolites cannot be predicted from the genome sequence, high-throughput de novo identification of small molecules is highly sought. Mass spectrometry (MS) in combination with a fragmentation technique is commonly used for this task. Unfortunately, automated analysis of such data is in its infancy. Recently, fragmentation trees have been proposed as an analysis tool for such data. Additional fragmentation steps (MS(n)) reveal more information about the molecule. We propose to use MS(n) data for the computation of fragmentation trees, and present the Colorful Subtree Closure problem to formalize this task: There, we search for a colorful subtree inside a vertex-colored graph, such that the weight of the transitive closure of the subtree is maximal. We give several negative results regarding the tractability and approximability of this and related problems. We then present an exact dynamic programming algorithm, which is parameterized by the number of colors in the graph and is swift in practice. Evaluation of our method on a dataset of 45 reference compounds showed that the quality of constructed fragmentation trees is improved by using MS(n) instead of MS² measurements.
Cited by 34
Anjali Savita, Vasanth · International Journal of Engineering and Advanced Technology · 2019
An invention of cloud computing technology comes with numerous benefits for IT industries and others. The data store in the cloud can be easily shared among stakeholders irrespective of their location, i.e. data availability is very good. Nowadays organizations are switching to cloud platform for storing and sharing data in a decentralized manner. This is significantly reduces the economically burden to the organization. As the data are accessible through network, so major concern is to maintain the data confidentiality. Data breach in any form organization losses their trustworthy, and this affect the reputation of the organization. This is very important to maintain the privacy and security of data all the time. There are so many works has been proposed by many researchers to secure data in the cloud by using various encryption techniques. In this paper, we proposed a security mechanism to maintain confidentiality of data. This method is combination of multiplicative homomorphic encryption algorithms along with vertical fragmentation of data. We have tested our scheme based on crypto delays, communication delays, and query processing delays with an existing work. The results obtained show that our method out-perform the existing work. The results obtained show improvement with the proposed method.
Cited by 1Open access
Abiodun Ismail Lawal, B. Adebayo, Thomas Busuyi Afeni et al. · Geotechnical and Geological Engineering · 2023
Cited by 8
Andreas Andreou, Constandinos X. Mavromoustakis, Jordi Mongay Batalla et al. · 2023
The three pillars of health data exchange, confidentiality, integrity and availability, pose a significant challenge to the efficiency and robustness of the healthcare ecosystem. By utilising fragmentation, sensitive attributes dissociate, and thus, data security can be enhanced, and data utility can be improved. Throughout this research, confidentiality was performed by deploying polynomials and Newton-Gregory's divided difference interpolation to enable encryption of confidential data values such as patients' IDs. The fragmentation technique was utilised to achieve integrity, and the utility method enabled end-user availability. Extensive evaluations show that the precision, recall, and Fl-score under different values of correlation index ϒ of the proposed methodology outperform state-of-the-art approaches. Also, a time complexity comparison for overhead tasks was implemented between these approaches.
Cited by 4
Villermaux, Emmanuel · HAL (Le Centre pour la Communication Scientifique Directe) · 2007
International audience
Cited by 0
Gaydarska, B. · Durham Research Online (Durham University) · 2012
Cited by 0
Ismail Hababeh · 2012
Abstract- As many distributed database applications contain online information that change continuously and expand incrementally, comprehensive cloud Application Programming Interface API’s are required to monitor and control the accuracy of the information and data proliferation. This cloud software is required to monitor and control the accuracy of the information and data proliferation. This software can be viewed as integrated cloud computing services; data fragmentation, clustering network sites, and fragments Allocation that support transactional database applications. In this paper, we describe our data Fragmentation as a Service (FaaS) in construction of a cloud computing software system. Specifically, we design a novel data fragmentation as a service to facilitate enormous data processing, and introduce some functioning enhancement on data distribution to improve the cloud system performance. This research presents our attempt to implement data fragmentation service in a cloud computing system, with large scale data mining as targeted application.
Cited by 0
Samir Saad, Joe Tekli, Richard Chbeir et al. · 2006
{richard.chbeir, kokou.yetongnon} @ u-bourgogne.fr Abstract. Database fragmentation is a process for reducing irrelevant data accesses by grouping data frequently accessed together in dedicated segments. In this paper, we address multimedia database fragmentation by extending existing fragmentation algorithms to take into account key characteristics of multimedia objects. We particularly discuss multimedia primary horizontal fragmentation and provide a partitioning strategy based on low-level multimedia features. Our approach particularly emphasizes the importance of multimedia predicates implications in optimizing multimedia fragments. To validate our approach, we have implemented a prototype computing multimedia predicates implications. Experimental results are satisfactory.
Cited by 0
M. Archana, MallikarjunShastry P M · International Journal of Engineering and Advanced Technology · 2019
Security is one of the most crucial aspects in cloud computing, in order to provide security in cloud computing there are many cryptographic and non-cryptographic techniques [2][3] are used. Most of the non cryptographic approaches suffer from security breaches and the main drawback of cryptographic algorithms is computation time incurred in encryption and decryption of data. A methodology is proposed to implement unique approach to provide a security in cloud computing. Where text file will be fragmented based on random number generation.From the random number generation algorithm lower range and higher range values will be calculated so that the new random number which needs to compute should be within the lower and higher range of random number.Fragments can be obtained based on the new random number. With reference to the random number, block size or fragment size will be calculated. Hence text file will be divided into fragments.
Cited by 1Open access
Ketan Bhardwaj, Ada Gavrilovska, Vlad Kolesnikov et al. · 2019
At the core of the value proposition of edge computing is the ability to put computation close enough to the data sources, on demand. However, the data sources, computational infrastructure and software services needed to come together to power emerging and future edge computing applications are fragmented across different stakeholders, each with their own incentives, policies, and constraints on resources they can afford. This fragmentation limits the ability of edge computing to guarantee to applications and data the edge which will deliver the desired benefit. In this paper, we present our vision for an Edge Exchange, a decentralized directory service for a multi-stakeholder edge, as a path forward to enabling applications to be deployed across the best available edge resources, while still providing each stakeholder with controls regarding their resource use and sharing policies.
Cited by 10
Mahboobeh Najmi · Indian Journal of Science and Technology · 2019
Objective: In this study we have investigated the affecting parameters in cloud computing in information technology. To this end, security and load balancing in cloud computing is still considered to be one of the most important views owe to the sensitive and confidential information stored in the cloud by the users. Methods: This study has as a prime focus on the matters related to the security and load balancing aspects of CC. Furthermore, we have tried to review the researches about cloud computing, improving load balancing and data fragmentation in cloud computing and related matters in regard of its performance. Findings: As well, this research paper has shown all of aspect of investigations in recent years. In fact, this study has located novel ways for finding new paths in this field for future researches. Application: In the latest part of the paper we have presented some future themes as follows: Load balancing with novel load balancing algorithms for better efficiency, and also security issues considering some aspects such as data fragmentation and encrypted in CC are unknown for research. Keywords: Cloud Computing, Data Fragmentation, Data, Load Balancing, Security Challenges
Cited by 0Open access
Balabhadra, Nisha · eScholarship (California Digital Library) · 2015
Cited by 0Open access
Balabhadra, Nisha · eScholarship (California Digital Library) · 2015
Cited by 0Open access
Mark Overholt, Shiguang Wang Outline, Bcube Mdcube · 2012
5 % cost of money, and a 3 year amortization, the amortized cost of servers comes to $52.5 million per year. � (50,000 * 3000 * 1.05 /3 = 52.5 M) � Achieving high utilization is an important goal � i.e. useful work accomplished per dollar invested � Unfortunately … remarkably low utilization
Cited by 0
MAGGIORDOMO, ANDREA · Electronic Theses and Dissertations Repository (University of Pisa) · 2018
This thesis faces the problem of improving the existing texture atlas of a polygonal model. We target textures generated by 3D reconstruction pipelines, which usually exhibit high fragmentation in the texture data, and try to reduce the number of of discontinuities without losing existing information. We do so by computing a new mesh parameterization that is less fragmented, has shorter boundaries and exhibits minimal distortion compared to the original texture map. Our approach relies on available parameterization algorithms, and adapts them in an original way to minimize deformation of the newly computed flattening with respect to the shape of the existing one. We report experimental results obtained by applying our method on a collection of publicly available models generated from 3D reconstruction software.
Cited by 0Open access