Auswahl der wissenschaftlichen Literatur zum Thema „Fragmentation (computing)“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Fragmentation (computing)" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Fragmentation (computing)"
Hudic, Aleksandar, Shareeful Islam, Peter Kieseberg, Sylvi Rennert und Edgar R. Weippl. „Data confidentiality using fragmentation in cloud computing“. International Journal of Pervasive Computing and Communications 9, Nr. 1 (29.03.2013): 37–51. http://dx.doi.org/10.1108/17427371311315743.
Der volle Inhalt der QuellePark, Y. T., P. Sthapit und J. Y. Pyun. „Energy Efficient Data Fragmentation for Ubiquitous Computing“. Computer Journal 57, Nr. 2 (01.09.2013): 263–72. http://dx.doi.org/10.1093/comjnl/bxt080.
Der volle Inhalt der QuelleRasche, Florian, Aleš Svatoš, Ravi Kumar Maddula, Christoph Böttcher und Sebastian Böcker. „Computing Fragmentation Trees from Tandem Mass Spectrometry Data“. Analytical Chemistry 83, Nr. 4 (15.02.2011): 1243–51. http://dx.doi.org/10.1021/ac101825k.
Der volle Inhalt der QuelleScheubert, Kerstin, Franziska Hufsky, Florian Rasche und Sebastian Böcker. „Computing Fragmentation Trees from Metabolite Multiple Mass Spectrometry Data“. Journal of Computational Biology 18, Nr. 11 (November 2011): 1383–97. http://dx.doi.org/10.1089/cmb.2011.0168.
Der volle Inhalt der QuelleBeckham, Olly, Gord Oldman, Julie Karrie und 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, Nr. 6 (15.10.2019): 68–86. http://dx.doi.org/10.21744/irjmis.v6n6.766.
Der volle Inhalt der QuelleRasche, Florian, Aleš Svatoš, Ravi Kumar Maddula, Christoph Böttcher und Sebastian Böcker. „Correction to Computing Fragmentation Trees from Tandem Mass Spectrometry Data“. Analytical Chemistry 83, Nr. 17 (September 2011): 6911. http://dx.doi.org/10.1021/ac201785d.
Der volle Inhalt der QuelleVivek, V., R. Srinivasan, R. Elijah Blessing und R. Dhanasekaran. „Payload fragmentation framework for high-performance computing in cloud environment“. Journal of Supercomputing 75, Nr. 5 (17.11.2018): 2789–804. http://dx.doi.org/10.1007/s11227-018-2660-7.
Der volle Inhalt der QuelleSalman, Mahdi Abed, Hasanain Ali Al Essa und Khaldoon Alhussayni. „A Distributed Approach for Disk Defragmentation“. JOURNAL OF UNIVERSITY OF BABYLON for Pure and Applied Sciences 26, Nr. 3 (09.01.2018): 1–5. http://dx.doi.org/10.29196/jub.v26i3.548.
Der volle Inhalt der QuellePei, Xin, Huiqun Yu und Guisheng Fan. „Fine-Grained Access Control via XACML Policy Optimization in Cloud Computing“. International Journal of Software Engineering and Knowledge Engineering 25, Nr. 09n10 (November 2015): 1709–14. http://dx.doi.org/10.1142/s0218194015710047.
Der volle Inhalt der QuelleMariam 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, Nr. 2 (08.03.2019): 69–92. http://dx.doi.org/10.4197/comp.8-2.6.
Der volle Inhalt der QuelleDissertationen zum Thema "Fragmentation (computing)"
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.
Der volle Inhalt der QuelleThis 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
Ahuja, Ankit. „Contextinator: Recreating the context lost amid information fragmentation on the web“. Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/23120.
Der volle Inhalt der QuelleMaster of Science
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.
Der volle Inhalt der QuelleCherrueau, 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.
Der volle Inhalt der QuelleA 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
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.
Der volle Inhalt der QuelleThis 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
Kao, Chen-Kang, und 高振綱. „Utilization of Resource Fragmentation in High-Performance Computing System“. Thesis, 2014. http://ndltd.ncl.edu.tw/handle/00939400485072812169.
Der volle Inhalt der Quelle國立交通大學
資訊科學與工程研究所
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.
Zhang, Qingan. „Detailed Modeling of Soot Formation/Oxidation in Laminar Coflow Diffusion Flames“. Thesis, 2009. http://hdl.handle.net/1807/19251.
Der volle Inhalt der QuelleBücher zum Thema "Fragmentation (computing)"
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.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Fragmentation (computing)"
Ghosh, Debdulal, und 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.
Der volle Inhalt der QuelleCoffman, 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.
Der volle Inhalt der QuelleMishra, Rakesh Kumar, Rashmikiran Pandey, Sankhayan Choudhury und 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.
Der volle Inhalt der QuelleAlsirhani, Amjad, Peter Bodorik und 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.
Der volle Inhalt der QuelleScheubert, Kerstin, Franziska Hufsky, Florian Rasche und 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.
Der volle Inhalt der QuelleDharavath, Ramesh, Vikas Kumar, Chiranjeev Kumar und 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.
Der volle Inhalt der QuelleFabre, Jean-Charles, Yves Deswarte und 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.
Der volle Inhalt der QuelleFabre, Jean-Charles, Yves Deswarte und 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.
Der volle Inhalt der QuelleGayathri Devi, K., S. Raksha und 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.
Der volle Inhalt der QuelleCastillo-García, Abraham, Lisbeth Rodríguez-Mazahua, Felipe Castro-Medina, Beatriz A. Olivares-Zepahua und 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.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Fragmentation (computing)"
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.
Der volle Inhalt der QuelleGhali, Cesar, Ashok Narayanan, David Oran, Gene Tsudik und 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.
Der volle Inhalt der QuelleAlsirhani, Amjad, Peter Bodorik und 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.
Der volle Inhalt der QuelleAndreas, Andreou, Constandinos X. Mavromoustakis, Jordi Mongay Batalla, Evangelos Markakis und 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.
Der volle Inhalt der QuelleMrabti, Almokhtar Ait El, Najim Ammari, Anas Abou El Kalam, Abdellah Ait Ouahman und 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.
Der volle Inhalt der QuelleGoovaerts, Griet, Bert Vandenberk, Carolina Varon, Rik Willems und 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.
Der volle Inhalt der QuelleDai, Tianxiang, Haya Shulman und 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.
Der volle Inhalt der QuelleDai, Tianxiang, Haya Shulman und 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.
Der volle Inhalt der QuelleCreedon, Eoin, und 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.
Der volle Inhalt der QuelleChristos, B., K. Vaggelis und 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.
Der volle Inhalt der Quelle