Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
2,235
result(s) for
"Data recovery (Computer science)"
Sort by:
Business Continuity and Disaster Recovery Planning for IT Professionals
In today's rapidly evolving digital landscape, organizations are increasingly vulnerable to various threats and disruptions that can significantly impact their operations. This book aims to equip IT professionals with the knowledge and tools they need to develop and execute robust plans that ensure the continuity of critical business functions in the face of unforeseen events. From risk assessment and mitigation strategies to backup and recovery procedures, this book covers essential topics to help IT professionals safeguard their organization's data, systems, and overall business resilience.
eBook
User Compensation as a Data Breach Recovery Action
Drawing on expectation confirmation research, we develop hypotheses regarding the effect of compensation on key customer outcomes following a major data breach and consequent service recovery effort. Data were collected in a longitudinal field study of Sony customers during their data breach in 2011. A total of 144 customers participated in the two-phase data collection that began when the breach was announced and concluded after reparations were made. Using polynomial modeling and response surface analysis, we demonstrate that a modified assimilation–contrast model explained perceptions of service quality and continuance intention and a generalized negativity model explained repurchase intention. The results of our work contribute to research on data breaches and service failure by demonstrating the impacts of compensation on customer outcomes. We discuss theoretical and practical implications.
Journal Article
Towards practical and robust DNA-based data archiving using the yin–yang codec system
DNA is a promising data storage medium due to its remarkable durability and space-efficient storage. Early bit-to-base transcoding schemes have primarily pursued information density, at the expense of introducing biocompatibility challenges or decoding failure. Here we propose a robust transcoding algorithm named the yin–yang codec, using two rules to encode two binary bits into one nucleotide, to generate DNA sequences that are highly compatible with synthesis and sequencing technologies. We encoded two representative file formats and stored them
in vitro
as 200 nt oligo pools and
in vivo
as a ~54 kbps DNA fragment in yeast cells. Sequencing results show that the yin–yang codec exhibits high robustness and reliability for a wide variety of data types, with an average recovery rate of 99.9% above 10
4
molecule copies and an achieved recovery rate of 87.53% at ≤10
2
copies. Additionally, the
in vivo
storage demonstration achieved an experimentally measured physical density close to the theoretical maximum.
Journal Article
Multipurpose medical image watermarking for effective security solutions
Digital medical images contain important information regarding patient’s health and very useful for diagnosis. Even a small change in medical images (especially in the region of interest (ROI)) can mislead the doctors/practitioners for deciding further treatment. Therefore, the protection of the images against intentional/unintentional tampering, forgery, filtering, compression and other common signal processing attacks are mandatory. This manuscript presents a multipurpose medical image watermarking scheme to offer copyright/ownership protection, tamper detection/localization (for ROI (region of interest) and different segments of RONI (region of non-interest)), and self-recovery of the ROI with 100% reversibility. Initially, the recovery information of the host image’s ROI is compressed using LZW (Lempel-Ziv-Welch) algorithm. Afterwards, the robust watermark is embedded into the host image using a transform domain based embedding mechanism. Further, the 256-bit hash keys are generated using SHA-256 algorithm for the ROI and eight RONI regions (i.e. RONI-1 to RONI-8) of the robust watermarked image. The compressed recovery data and hash keys are combined and then embedded into the segmented RONI region of the robust watermarked image using an LSB replacement based fragile watermarking approach. Experimental results show high imperceptibility, high robustness, perfect tamper detection, significant tamper localization, and perfect recovery of the ROI (100% reversibility). The scheme doesn’t need original host or watermark information for the extraction process due to the blind nature. The relative analysis demonstrates the superiority of the proposed scheme over existing schemes.
Journal Article
Digital privacy and security using Windows : a practical guide
\"This book teaches you how to secure your online identity and personal devices, encrypt your digital data and online communications, protect cloud data and Internet of Things (IoT), mitigate social engineering attacks, keep your purchases secret, and conceal your digital footprint ... The book helps you build a robust defense from electronic crime and corporate surveillance. It covers general principles of digital privacy and how to configure and use various security applications to maintain your privacy, such as TOR, VPN, and BitLocker. You will learn to encrypt email communications using Gpg4win and Thunderbird.\"--Page 4 of cover.
Book
A probabilistic molecular fingerprint for big data settings
Background
Among the various molecular fingerprints available to describe small organic molecules, extended connectivity fingerprint, up to four bonds (ECFP4) performs best in benchmarking drug analog recovery studies as it encodes substructures with a high level of detail. Unfortunately, ECFP4 requires high dimensional representations (≥ 1024D) to perform well, resulting in ECFP4 nearest neighbor searches in very large databases such as GDB, PubChem or ZINC to perform very slowly due to the curse of dimensionality.
Results
Herein we report a new fingerprint, called MinHash fingerprint, up to six bonds (MHFP6), which encodes detailed substructures using the extended connectivity principle of ECFP in a fundamentally different manner, increasing the performance of exact nearest neighbor searches in benchmarking studies and enabling the application of locality sensitive hashing (LSH) approximate nearest neighbor search algorithms. To describe a molecule, MHFP6 extracts the SMILES of all circular substructures around each atom up to a diameter of six bonds and applies the MinHash method to the resulting set. MHFP6 outperforms ECFP4 in benchmarking analog recovery studies. By leveraging locality sensitive hashing, LSH approximate nearest neighbor search methods perform as well on unfolded MHFP6 as comparable methods do on folded ECFP4 fingerprints in terms of speed and relative recovery rate, while operating in very sparse and high-dimensional binary chemical space.
Conclusion
MHFP6 is a new molecular fingerprint, encoding circular substructures, which outperforms ECFP4 for analog searches while allowing the direct application of locality sensitive hashing algorithms. It should be well suited for the analysis of large databases. The source code for MHFP6 is available on GitHub (
https://github.com/reymond-group/mhfp
).
Journal Article