Relevant bibliographies by topics / Fragmentation (computing)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Fragmentation (computing)'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fragmentation (computing).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fragmentation (computing)"

1

Hudic, Aleksandar, Shareeful Islam, Peter Kieseberg, Sylvi Rennert, and Edgar R. Weippl. "Data confidentiality using fragmentation in cloud computing." International Journal of Pervasive Computing and Communications 9, no. 1 (March 29, 2013): 37–51. http://dx.doi.org/10.1108/17427371311315743.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Park, Y. T., P. Sthapit, and J. Y. Pyun. "Energy Efficient Data Fragmentation for Ubiquitous Computing." Computer Journal 57, no. 2 (September 1, 2013): 263–72. http://dx.doi.org/10.1093/comjnl/bxt080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rasche, Florian, Aleš Svatoš, Ravi Kumar Maddula, Christoph Böttcher, and Sebastian Böcker. "Computing Fragmentation Trees from Tandem Mass Spectrometry Data." Analytical Chemistry 83, no. 4 (February 15, 2011): 1243–51. http://dx.doi.org/10.1021/ac101825k.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Scheubert, Kerstin, Franziska Hufsky, Florian Rasche, and Sebastian Böcker. "Computing Fragmentation Trees from Metabolite Multiple Mass Spectrometry Data." Journal of Computational Biology 18, no. 11 (November 2011): 1383–97. http://dx.doi.org/10.1089/cmb.2011.0168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beckham, Olly, Gord Oldman, Julie Karrie, and Dorth Craig. "Techniques used to formulate confidential data by means of fragmentation and hybrid encryption." International research journal of management, IT and social sciences 6, no. 6 (October 15, 2019): 68–86. http://dx.doi.org/10.21744/irjmis.v6n6.766.

Full text
Abstract:
Cloud computing is a concept shifting in the approach how computing resources are deployed and purchased. Even though the cloud has a capable, elastic, and consistent design, several security concerns restrain customers to completely accept this novel technology and move from traditional computing to cloud computing. In the article, we aspire to present a form of a novel architectural model for offering protection to numerous cloud service providers with the intention to devise and extend security means for cloud computing. In this work, we presented a two-tier architecture for security in multi-clouds; one at the client side, and other at the server side. The article presented a security domination outline for multi-clouds and supports security needs like Confidentiality, Integrity, Availability, Authorization, and Non-repudiation for cloud storage. Through this document we have anticipated, HBDaSeC, a secure-computation protocol to ease the challenges of enforcing the protection of data for information security in the cloud.
APA, Harvard, Vancouver, ISO, and other styles
6

Rasche, Florian, Aleš Svatoš, Ravi Kumar Maddula, Christoph Böttcher, and Sebastian Böcker. "Correction to Computing Fragmentation Trees from Tandem Mass Spectrometry Data." Analytical Chemistry 83, no. 17 (September 2011): 6911. http://dx.doi.org/10.1021/ac201785d.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vivek, V., R. Srinivasan, R. Elijah Blessing, and R. Dhanasekaran. "Payload fragmentation framework for high-performance computing in cloud environment." Journal of Supercomputing 75, no. 5 (November 17, 2018): 2789–804. http://dx.doi.org/10.1007/s11227-018-2660-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Salman, Mahdi Abed, Hasanain Ali Al Essa, and Khaldoon Alhussayni. "A Distributed Approach for Disk Defragmentation." JOURNAL OF UNIVERSITY OF BABYLON for Pure and Applied Sciences 26, no. 3 (January 9, 2018): 1–5. http://dx.doi.org/10.29196/jub.v26i3.548.

Full text
Abstract:
Fragmentation is a computing problem that occurs when files of a computer system are replaced frequently. In this paper, the fragments of each file are collected and grouped, thanks to ant-colony optimization ACO, in one place as a mission for a group of ants. The study shows the ability of ants to work in a distributed environment such as cloud computing systems to solve such problem. The model is simulated using NetLogo.
APA, Harvard, Vancouver, ISO, and other styles
9

Pei, Xin, Huiqun Yu, and Guisheng Fan. "Fine-Grained Access Control via XACML Policy Optimization in Cloud Computing." International Journal of Software Engineering and Knowledge Engineering 25, no. 09n10 (November 2015): 1709–14. http://dx.doi.org/10.1142/s0218194015710047.

Full text
Abstract:
One primary challenge of enforcing access control in cloud computing is how to ensure access with high efficiency while preserving data security. This paper proposes a fine-grained access control method for cloud resources. The basic idea is to use XACML as access control language and to optimize policies by data fragmentation and policy refinement algorithms. Through data fragmentation, the accessible resources are divided into disjoint data blocks, and each of them will be combined with a set of policy rules. This helps to refine the policy and to avoid data leakage caused by rule conflicting on the resource intersections. Finally, the disjoint data blocks and the optimized policy are distributed in the three-layered cloud, and the decision to a request is made by rule matching on a specific resource rather than traversing the whole policy rules. Experiments show that our proposal enjoys higher efficiency in cloud-based access control.
APA, Harvard, Vancouver, ISO, and other styles
10

Mariam O. Alrashidi, Mariam O. Alrashidi. "A Framework and Cryptography Algorithm for Protecting Sensitive Data on Cloud Service Providers." journal of King Abdulaziz University Computing and Information Technology Sciences 8, no. 2 (March 8, 2019): 69–92. http://dx.doi.org/10.4197/comp.8-2.6.

Full text
Abstract:
Most companies are sceptical about the security and insurance measures offered by cloud services and are reluctant to store sensitive data, such as employee records, in the cloud. Thus, more effort is needed to support the security of information in cloud computing. This paper proposes a cryptography algorithm called ―random algorithm‖ because it is built on the idea of randomising the encryption of uploaded files among four encryption algorithms. The proposed fragmentation technique helps add security and privacy to cloud storage applications. Based on earlier studies, we have created a file-level fragmentation technique that does not work at the database level, in contrast to commonly employed approaches in the case of fragmentation techniques such as horizontal fragmentation, vertical fragmentation, and hybrid fragmentation, which do work at the database level. The proposed encryption algorithm and fragmentation technique work within an integrated security framework that includes a user authentication gateway that encrypts user registration data through a cryptography algorithm called the RivestShamir-Adleman algorithm (RSA). The results of the proposed security framework were positive, as it contributed to reducing the encryption time and decoding time by approximately 99%, compared to earlier studies
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Fragmentation (computing)"

1

Kapusta, Katarzyna. "Protecting data confidentiality combining data fragmentation, encryption, and dispersal over a distributed environment." Electronic Thesis or Diss., Paris, ENST, 2018. http://www.theses.fr/2018ENST0061.

Full text
Abstract:
La thèse revient sur les techniques de fragmentation en les rendant plus rapides et/ou moins gourmand en mémoire. Le but ultime est de fournir à un utilisateur un ensemble de méthodes de fragmentation rapide pouvant être directement appliqué dans un contexte industrielle afin de renforcer la confidentialité des données stockées ou d'accélérer le processus de protection. Premièrement, une enquête riche sur la fragmentation en tant que moyen de préserver la confidentialité des données a été effectué et a donné comme résultat une vaste analyse de l'état de l'art. Deuxièmement, la famille des algorithmes de type "all-or-nothing" (tout-ou-rien) a été agrandie avec trois nouvelles propositions. Elles sont conçues pour être utilisés dans trois contextes différents: pour la fragmentation des données dans un environnement multi-cloud, un système de stockage distribué quelconque et un environnement composé d'un seul fournisseur de stockage et un dispositif privé. Troisièmement, une manière d'accélérer la fragmentation a été présentée, qui offre de meilleurs performances que le chiffrement de données en utilisant l'algorithme de chiffrement à clé symétrique le plus courant (AES-NI). Quatrièmement, un schéma de fragmentation léger basé sur le codage, la permutation et la dispersion des données a été introduit. Enfin, la fragmentation au sein des réseaux de capteurs a été réexaminée, en particulier dans les réseaux de capteurs sans fils. Dans ce cas, l'accent est mis non seulement sur la performance en matière de fragmentation, mais également sur la réduction des coûts de stockage et de transmission grâce à l'agrégation des données
This thesis dissertation revisits state-of-the-art fragmentation techniques making them faster and cost-efficient. The main focus is put on increasing data confidentiality without deteriorating the processing performance. The ultimate goal is to provide a user with a set of fast fragmentation methods that could be directly applied inside an industrial context to reinforce the confidentiality of the stored data and/or accelerate the fragmentation processing. First, a rich survey on fragmentation as a way of preserving data confidentiality is presented. Second, the family of all-or-nothing transforms is extended with three new proposals. They all aim at protecting encrypted and fragmented data against the exposure of the encryption key but are designed to be employed in three different contexts: for data fragmentation in a multi-cloud environment, a distributed storage system, and an environment composed of one storage provider and one private device. Third, a way of accelerating fragmentation is presented that achieves better performance than data encryption using the most common symmetric-key encryption algorithm. Fourth, a lightweight fragmentation scheme based on data encoding, permuting, and dispersing is introduced. It totally gets rid of data encryption allowing the fragmentation to be performed even faster; up to twice as fast as data encryption. Finally, fragmentation inside sensor networks is revisited, particularly in the Unattended Wireless Sensor Networks. The main focus in this case is put not solely on the fragmentation performance, but also on the reduction of storage and transmission costs by using data aggregation
APA, Harvard, Vancouver, ISO, and other styles
2

Ahuja, Ankit. "Contextinator: Recreating the context lost amid information fragmentation on the web." Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/23120.

Full text
Abstract:
The web browser has emerged as a central workspace for information workers, where they make use of cloud-based applications to access their information. While this solution nicely supports access to their data from multiple devices, it presents a nightmare for organizing and coordinating data between tools for a single project. Information is typically scattered between various online tools, where storage and organization structures are replicated. Information workers are interrupted and have to switch between projects frequently. Once interrupted, resuming work on a project can be hard. To address this information fragmentation and the impact of work interruptions, I created Contextinator, a personal information manager for the web browser that lets information workers organize their work activity and information into projects. Contextinator assists in coordinating information for projects, thereby ameliorating information fragmentation for projects that live on the cloud. It assists information workers in context switching and resuming work after interruptions. In my the- sis, I describe the problem of information fragmentation in the cloud. I discuss the different areas of related work of Personal Information Management, the design of Contextinator and how it is grounded in previous research. I briefly discuss how Contextinator is implemented. I then present the results from my field-evaluation of Contextinator. Finally, I conclude by discussing future work in this research.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
3

Denis, Bacelar Ana Maria. "Isomeric ratios of high-spin states in neutron-deficient N≈126 nuclei produced in projectile fragmentation reactions." Thesis, University of Brighton, 2012. https://research.brighton.ac.uk/en/studentTheses/62edb7eb-7e42-4e1e-be42-6926ccf600d0.

Full text
Abstract:
The population of high-spin isomeric states in neutron-deficient N≈126 nuclei has been studied in order to further understand the reaction mechanism of projectile fragmentation. The nuclei of interest were populated following projectile-fragmentation of a 1 GeV/A 238U beam on a 9Be target at GSI, Germany. The reaction products were selected and separated in the FRS FRagment Separator and brought to rest in an 8 mm plastic stopper placed at the focus of the RISING gamma-ray detector array. The results on the development of an add-back method for the RISING array are presented and discussed for source and in-beam data.
APA, Harvard, Vancouver, ISO, and other styles
4

Cherrueau, Ronan-Alexandre. "Un langage de composition des techniques de sécurité pour préserver la vie privée dans le nuage." Thesis, Nantes, Ecole des Mines, 2016. http://www.theses.fr/2016EMNA0233/document.

Full text
Abstract:
Un service du nuage peut employer des techniques de sécurités pour assurer la sécurité de l’information. Ces techniques protègent une donnée personnelle en la rendant inintelligible pour toutes personnes autres que l’utilisateur du service. En contrepartie, certaines fonctionnalités ne peuvent plus être implémentées. Par exemple, la technique du chiffrement symétrique rend les données inintelligibles, mais empêche le calcul sur ces données.Cette thèse avance qu’un service du nuage doit composer les techniques pour assurer la sécurité de l’information sans perdre de fonctionnalités. Elle se base sur l’étude de la composition de trois techniques qui sont le chiffrement, la fragmentation verticale et les calculs côté client. Cette étude montre que la composition sécurise sans perdre de fonctionnalités, mais complexifie l’écriture du service. La thèse propose alors un nouveau langage pour l’écriture de services du nuage qui assurent la sécurité des données personnelles par compositions des techniques de sécurité.Ce langage est muni de lois algébriques pour dériver,systématiquement, un service local sans protection vers son équivalent sécurisé du nuage. Le langage est implémenté en Idris et profite de son système de type expressif pour vérifier la composition correcte des techniques de cryptographie. Dans le même temps, un encodage traduit le langage en ProVerif, un vérificateur de modèle pour l’analyse automatique des propriétés de sécurité sur les protocoles cryptographiques. Cette traduction vérifie alors la sécurité des données personnelles dans le service
A cloud service can use security techniques to ensure information privacy. These techniques protect privacy by converting the client’s personal data into unintelligible text. But they can also cause the loss of some functionalities of the service. For instance, a symmetric-key cipher protects privacy by converting readable personal data into unreadable one. However, this causes the loss of computational functionalities on this data.This thesis claims that a cloud service has to compose security techniques to ensure information privacy without the loss of functionalities. This claim is based on the study of the composition of three techniques: symmetric cipher, vertical data fragmentation and client-side computation. This study shows that the composition makes the service privacy preserving, but makes its formulation overwhelming. In response, the thesis offers a new language for the writing of cloud services that enforces information privacy using the composition of security techniques. This language comes with a set of algebraic laws to systematically transform a local service without protection into its cloud equivalent protected by composition. An Idris implementation harnesses the Idris expressive type system to ensure the correct composition of security techniques. Furthermore, an encoding translates the language intoProVerif, a model checker for automated reasoning about the security properties found in cryptographic protocols. This translation checks that the service preserves the privacy of its client
APA, Harvard, Vancouver, ISO, and other styles
5

Solat, Siamak. "Novel fault-tolerant, self-configurable, scalable, secure, decentralized, and high-performance distributed database replication architecture using innovative sharding to enable the use of BFT consensus mechanisms in very large-scale networks." Electronic Thesis or Diss., Université Paris Cité, 2023. http://www.theses.fr/2023UNIP7025.

Full text
Abstract:
Cette thèse de doctorat se compose de 6 chapitres. Dans le premier chapitre, en guise d'introduction, nous donnons un aperçu des objectifs généraux et des motivations des réseaux décentralisés et permissionless, ainsi que des obstacles auxquels ils sont confrontés. Dans l'introduction, nous évoquons également la solution irrationnelle et illogique, connue sous le nom de « blockchain permissioned », qui a été proposée pour améliorer les performances des réseaux similaires à Bitcoin. Cette question a été détaillée au chapitre 5. Dans le chapitre 2, nous rendons clairs et intelligibles les systèmes que l'idée proposée, « Parallel Committees », est basée sur de tels réseaux. Nous détaillons les fonctionnalités indispensables et les défis essentiels des systèmes de réplication. Ensuite, dans le chapitre 3, nous discutons des limitations de scalabilité et du faible débit des systèmes de réplication qui utilisent des mécanismes de consensus pour traiter les transactions et comment ces problèmes peuvent être améliorés en utilisant des techniques de sharding. Nous décrivons les défis les plus importants dans le sharding des systèmes de réplication distribuée, une approche qui a déjà été mise en œuvre dans plusieurs systèmes de réplication basés sur la blockchain et, bien qu'elle ait montré un potentiel significatif pour améliorer les performances et la scalabilité, les techniques de sharding actuelles ont encore des limitations de scalabilité et des défis de sécurité. Nous expliquons pourquoi la plupart des protocoles de sharding actuels utilisent une approche d'allocation aléatoire pour distribuer les nœuds entre les shards pour des raisons de sécurité. Nous décrivons également comment traiter une transaction dans un système de réplication partitionné basé sur les protocoles de sharding actuels. Nous expliquons comment un « shared-ledger » partagé sur les shards impose des limitations de scalabilité et des défis de sécurité au réseau, et expliquons pourquoi les transactions « cross-shards » ou « inter-shards » sont indésirables et plus coûteuses en raison des problèmes qu'elles causent, y compris « atomicity failure » et les défis de « state transition », ainsi qu'une passe en revue des solutions proposées. Nous passons également en revue certains des travaux récents les plus remarquables qui utilisent des techniques de sharding pour les systèmes de réplication. Cette partie de l'ouvrage a été publiée sous la forme d'un chapitre de livre (peer-reviewed) in « Building Cybersecurity Applications with Blockchain Technology and Smart Contracts » (Springer, 2023). Dans le chapitre 4, nous proposons une nouvelle technique de sharding, « Parallel Committees », prenant en charge à la fois le « processing-sharding » et le « storage/state sharding », pour améliorer la scalabilité et les performances des systèmes de réplication distribués qui utilisent des mécanismes de consensus pour traiter les demandes des clients (client requests). Nous introduisons une approche innovante et originale pour répartir les nœuds entre les shards à l'aide d'un processus de génération de clé publique qui atténue simultanément l'attaque Sybil et sert de mécanisme de preuve de travail (proof-of-work). Notre approche réduit efficacement les transactions « inter-shards » indésirables, qui sont plus complexes et coûteuses à traiter que les transactions « intra-shards ». L'idée proposée a été publiée dans la conférence IEEE BCCA 2023. Nous expliquons ensuite pourquoi nous n'utilisons pas la structure de la blockchain dans l'idée proposée, un sujet abordé en détail au chapitre 5. Cette explication et clarification a été publiée dans le Journal of Software (JSW), Volume 16, Number 3, May 2021. Et dans le dernier chapitre de cette thèse, le chapitre 6, nous résumons les points importants et les conclusions de cette recherche
This PhD thesis consists of 6 Chapters. In the first Chapter, as an introduction, we provide an overview of the general goals and motives of decentralized and permissionless networks, as well as the obstacles they face. In the introduction, we also refer to the irrational and illogical solution, known as "permissioned blockchain" that has been proposed to improve the performance of networks similar to Bitcoin. This matter has been detailed in Chapter 5. In Chapter 2, we make clear and intelligible the systems that the proposed idea, Parallel Committees, is based on such networks. We detail the indispensable features and essential challenges in replication systems. Then in Chapter 3, we discuss in detail the low performance and scalability limitations of replication systems that use consensus mechanisms to process transactions, and how these issues can be improved using the sharding technique. We describe the most important challenges in the sharding of distributed replication systems, an approach that has already been implemented in several blockchain-based replication systems and although it has shown remarkable potential to improve performance and scalability, yet current sharding techniques have several significant scalability and security issues. We explain why most current sharding protocols use a random assignment approach for allocating and distributing nodes between shards due to security reasons. We also detail how a transaction is processed in a sharded replication system, based on current sharding protocols. We describe how a shared-ledger across shards imposes additional scalability limitations and security issues on the network and explain why cross-shard or inter-shard transactions are undesirable and more costly, due to the problems they cause, including atomicity failure and state transition challenges, along with a review of proposed solutions. We also review some of the most considerable recent works that utilize sharding techniques for replication systems. This part of the work has been published as a peer-reviewed book chapter in "Building Cybersecurity Applications with Blockchain Technology and Smart Contracts" (Springer, 2023). In Chapter 4, we propose a novel sharding technique, Parallel Committees, supporting both processing and storage/state sharding, to improve the scalability and performance of distributed replication systems that use a consensus to process clients' requests. We introduce an innovative and novel approach of distributing nodes between shards, using a public key generation process that simultaneously mitigates Sybil attack and serves as a proof-of-work mechanism. Our approach effectively reduces undesirable cross-shard transactions that are more complex and costly to process than intra-shard transactions. The proposed idea has been published as peer-reviewed conference proceedings in the IEEE BCCA 2023. We then explain why we do not make use of a blockchain structure in the proposed idea, an issue that is discussed in great detail in Chapter 5. This clarification has been published in the Journal of Software (JSW), Volume 16, Number 3, May 2021. And, in the final Chapter of this thesis, Chapter 6, we summarize the important points and conclusions of this research
APA, Harvard, Vancouver, ISO, and other styles
6

Kao, Chen-Kang, and 高振綱. "Utilization of Resource Fragmentation in High-Performance Computing System." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/00939400485072812169.

Full text
Abstract:
碩士
國立交通大學
資訊科學與工程研究所
103
In high-performance computing (HPC) systems, resources are al-located to users according to configurable scheduling policies. Unfor-tunately, these policies often create resource fragments which reduce overall resource utilization. In this paper, we propose an HPC archi-tecture which maximizes the resource utilization by allocating unused resource fragments for jobs which are malleable in the sense that these jobs can be created and terminated at any time without severe penalties. Hence, the whole HPC system can utilize almost 100% of its computing resources by filling its schedule with these malleable jobs. Malleable job computation can then be offered at a lower price for potential cus-tomers, allowing for multi-pricing schemes for the HPC system pro-vider.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Qingan. "Detailed Modeling of Soot Formation/Oxidation in Laminar Coflow Diffusion Flames." Thesis, 2009. http://hdl.handle.net/1807/19251.

Full text
Abstract:
The first goal of this thesis is to develop and validate a modeling tool into which fundamental combustion chemistry and aerosol dynamics theory are implemented for investigating soot formation/oxidation in multi-dimensional laminar coflow diffusion flames taking into account soot polydispersity and fractal-like aggregate structure. The second goal is to use the tool to study soot aggregate formation/oxidation in experimentally studied laminar coflow diffusion flames to advance the understanding of soot aggregate formation/oxidation mechanism. The first part of the thesis deals with the large CPU time problem when detailed models are coupled together. Using the domain decomposition method, a high performance parallel flame code is successfully developed. An advanced sectional aerosol dynamics model which can model fractal-like aggregate structure is successfully implemented into the parallel flame code. The performance of the parallel code is demonstrated through its application to the modeling of soot formation/oxidation in a laminar coflow CH4/air diffusion flame. The parallel efficiency reaches as high as 83%. The second part of the thesis numerically explores soot aggregate formation in a laminar coflow C2H4/air diffusion flame using detailed PAH-based combustion chemistry and a PAH-based soot formation/oxidation model. Compared to the measured data, flame temperature, axial velocity, C2H2 and OH concentrations, soot volume fraction, the average diameter and the number density of primary particles are reasonably well predicted. However, it is very challenging to predict effectively the average degree of particle aggregation. To do so, particle-particle and fluid-particle interactions that may cause non-unitary soot coagulation efficiency need to be considered. The original coagulation model is enhanced in this thesis to accommodate soot coagulation efficiency. Different types of soot coagulation efficiency are numerically investigated. It is found that a simple adjustment of soot coagulation efficiency from 100% to 20% provides good predictions on soot aggregate structure as well as flame properties. In the third part of the thesis, the effects of oxidation-driven soot aggregate fragmentation on aggregate structure and soot oxidation rate are studied. Three fragmentation models with different fragmentation patterns are developed and implemented into the sectional aerosol dynamics model. The implementation of oxidation-driven aggregate fragmentation significantly improves the prediction of soot aggregate structure in the soot oxidation region.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Fragmentation (computing)"

1

Tierney, Margaret. Thef ormation and fragmentation of computing as an occupation: A review of shifting 'expertise'. Edinburgh: Research Centre for Social Sciences, University of Edinburgh, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Fragmentation (computing)"

1

Ghosh, Debdulal, and Jitendra Kumar. "Existence of Equilibrium Solution of the Coagulation–Fragmentation Equation with Linear Fragmentation Kernel." In Mathematics and Computing, 295–303. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2095-8_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Coffman, Ed. "Computer Storage Fragmentation: Pioneering Work of Brian Randell." In Dependable and Historic Computing, 174–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24541-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mishra, Rakesh Kumar, Rashmikiran Pandey, Sankhayan Choudhury, and Nabendu Chaki. "Device Fragmentation: A Case Study using “NeSen”." In Advances in Intelligent Systems and Computing, 411–21. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-3373-5_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alsirhani, Amjad, Peter Bodorik, and Srinivas Sampalli. "Data Fragmentation Scheme: Improving Database Security in Cloud Computing." In Recent Trends in Computer Applications, 115–38. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89914-5_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Scheubert, Kerstin, Franziska Hufsky, Florian Rasche, and Sebastian Böcker. "Computing Fragmentation Trees from Metabolite Multiple Mass Spectrometry Data." In Lecture Notes in Computer Science, 377–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20036-6_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dharavath, Ramesh, Vikas Kumar, Chiranjeev Kumar, and Amit Kumar. "An Apriori-Based Vertical Fragmentation Technique for Heterogeneous Distributed Database Transactions." In Intelligent Computing, Networking, and Informatics, 687–95. New Delhi: Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-1665-0_69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fabre, Jean-Charles, Yves Deswarte, and Brian Randell. "Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: an Object-Oriented Approach." In Predictably Dependable Computing Systems, 173–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-79789-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fabre, Jean-Charles, Yves Deswarte, and Brian Randell. "Designing secure and reliable applications using fragmentation-redundancy-scattering: an object-oriented approach." In Dependable Computing — EDCC-1, 21–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58426-9_122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gayathri Devi, K., S. Raksha, and Kavitha Sooda. "Enhancing Restore Speed of In-line Deduplication Cloud-Based Backup Systems by Minimizing Fragmentation." In Smart Intelligent Computing and Applications, 9–21. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9282-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Castillo-García, Abraham, Lisbeth Rodríguez-Mazahua, Felipe Castro-Medina, Beatriz A. Olivares-Zepahua, and María A. Abud-Figueroa. "A Review of Horizontal Fragmentation Methods Considering Multimedia Data and Dynamic Access Patterns." In Advances in Intelligent Systems and Computing, 69–82. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-89909-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fragmentation (computing)"

1

Odom, William, John Zimmerman, Jodi Forlizzi, Ana López Higuera, Mauro Marchitto, José Cañas, Youn-kyung Lim, et al. "Fragmentation and transition." In CHI '13: CHI Conference on Human Factors in Computing Systems. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2470654.2466242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ghali, Cesar, Ashok Narayanan, David Oran, Gene Tsudik, and Christopher A. Wood. "Secure Fragmentation for Content-Centric Networks." In 2015 IEEE 14th International Symposium on Network Computing and Applications (NCA). IEEE, 2015. http://dx.doi.org/10.1109/nca.2015.34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Alsirhani, Amjad, Peter Bodorik, and Srinivas Sampalli. "Improving Database Security in Cloud Computing by Fragmentation of Data." In 2017 International Conference on Computer and Applications (ICCA). IEEE, 2017. http://dx.doi.org/10.1109/comapp.2017.8079737.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Andreas, Andreou, Constandinos X. Mavromoustakis, Jordi Mongay Batalla, Evangelos Markakis, and George Mastorakis. "Ensuring Confidentiality of Healthcare Data Using Fragmentation in Cloud Computing." In GLOBECOM 2023 - 2023 IEEE Global Communications Conference. IEEE, 2023. http://dx.doi.org/10.1109/globecom54140.2023.10436812.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mrabti, Almokhtar Ait El, Najim Ammari, Anas Abou El Kalam, Abdellah Ait Ouahman, and Mina De Montfort. "Mobile app security by fragmentation "MASF"." In ICC '17: Second International Conference on Internet of Things, Data and Cloud Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3018896.3036371.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goovaerts, Griet, Bert Vandenberk, Carolina Varon, Rik Willems, and Sabine Van Huffel. "Phase:Rectified Signal Averaging for Automatic Detection of QRS Fragmentation." In 2016 Computing in Cardiology Conference. Computing in Cardiology, 2016. http://dx.doi.org/10.22489/cinc.2016.186-403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dai, Tianxiang, Haya Shulman, and Michael Waidner. "Poster: Fragmentation Attacks on DNS over TCP." In 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS). IEEE, 2021. http://dx.doi.org/10.1109/icdcs51616.2021.00118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dai, Tianxiang, Haya Shulman, and Michael Waidner. "Poster: Fragmentation Attacks on DNS over TCP." In 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS). IEEE, 2021. http://dx.doi.org/10.1109/icdcs51616.2021.00118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Creedon, Eoin, and Michael Manzke. "Impact of Fragmentation Strategy on Ethernet Performance." In 2009 Sixth IFIP International Conference on Network and Parallel Computing (NPC). IEEE, 2009. http://dx.doi.org/10.1109/npc.2009.15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Christos, B., K. Vaggelis, and M. Ioannis. "Web page fragmentation for personalized portal construction." In International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. IEEE, 2004. http://dx.doi.org/10.1109/itcc.2004.1286475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Fragmentation (computing)' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography