Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 18 of 18 for “"Random Keys"”.

  1. Random Keys Genetic Algorithms Scheduling and Rescheduling Systems for Common Production Systems

    … consisting of models and algorithms based on Random Keys Genetic Algorithms (RKGA) to handle both the scheduling and rescheduling problems in the most common production environments and for various types of objective functions. The Scheduling system produces predictive (initial) schedules for …

    odu Repository record for Random Keys Genetic Algorithms Scheduling and Rescheduling Systems for Common Production Systems (opens in a new tab)

  2. A Particle Swarm Optimization Using Random Keys For Flexible Flow Shop Scheduling Problem With Sequence Dependent Setup Times

    … swarm optimization algorithm (PSO) using random keys is developed to schedule flexible flow lines with sequence dependent setup times to minimize makespan. The flexible flow line scheduling problem is a branch of production scheduling and is found in industries such as printed circuit …

    clemson Repository record for A Particle Swarm Optimization Using Random Keys For Flexible Flow Shop Scheduling Problem With Sequence Dependent Setup Times (opens in a new tab)

  3. Characterization of Rate Regions in Secure Network Coding over General Wiretap Networks

    … of network coding, primarily by generating random keys, which are independent of the message information that is to be communicated, and by sharing such keys between the various network nodes. In our work, we focus on networks which are modeled by directed acyclic graphs with source nodes, …

    buffalo Repository record for Characterization of Rate Regions in Secure Network Coding over General Wiretap Networks (opens in a new tab)

  4. Essays in Operations and Supply Chain Management

    … we propose to use genetic algorithms, based on random keys and multiple choice encodings, to heuristically solve them. We found that the genetic algorithms consistently outperform a standard mathematical programming package in terms of solutions and computation times. We also found that for …

    oregon Repository record for Essays in Operations and Supply Chain Management (opens in a new tab)

  5. Heuristics for Scheduling Reentrant Flexible Job Shops with Sequence-dependent Setup Times and Limited Buffer Capacities

    … an application of a genetic algorithm based on random keys encoding. The last method is developed based on tabu search. In total weighted tardiness problems the search spaces for local improvement approaches are large. A move search and a large step diversification are employed for developing …

    clemson Repository record for Heuristics for Scheduling Reentrant Flexible Job Shops with Sequence-dependent Setup Times and Limited Buffer Capacities (opens in a new tab)

  6. Random Number Generation using Human Gameplay

    Randomness is one of the most important research areas in computer science and in particular, in cryptography. Security of almost all cryptosystems relies on random keys. Unfortunately, perfect sources of randomness are not easily accessible. However, True Random Number Generators (TRNGs) generate …

    calgary Repository record for Random Number Generation using Human Gameplay (opens in a new tab)

  7. Physical Layer Authentication

    … threat of defeat, the secret authentication keys must be replaced more often. Unfortunately, the popular key replacement algorithms typically rely on either third parties or on non-trivial computational ability. In this thesis we attack these two aspects of the authentication problem by …

    maryland Repository record for Physical Layer Authentication (opens in a new tab)

  8. Scheduling flexible flow lines with sequence dependent setup times

    … created in order to evaluate the heuristics. A random keys genetic algorithm is found to be very effective for the problems eyed. In addition, several extensions based on backwards pass of the schedule and focusing on the bottleneck stage are proposed and examined. These proved to be ineffective …

    arizona-thes Repository record for Scheduling flexible flow lines with sequence dependent setup times (opens in a new tab)

  9. On End-to-end encryption for Cloud-based Services

    … on public key systems with user-managed private keys, or password-based symmetric encryption. We explore a symmetric-key approach without password-derived keys to facilitate end-to-end encryption of stored user data (e.g., cloud storage) and communication messages (e.g., web-based email). We …

    concordia Download PDF for On End-to-end encryption for Cloud-based Services (opens in a new tab)

  10. Advanced quantum communications for next-generation secure optical networks

    … exchange of theoretically secure symmetrical<br/>random keys based on the fundamentals of quantum mechanics. QKD relies on the exchange of<br/>single photons between two distant parties in an end-to-end configuration, making it extremely<br/>difficult to integrate with the current classical …

    bristol Repository record for Advanced quantum communications for next-generation secure optical networks (opens in a new tab) Download PDF for Advanced quantum communications for next-generation secure optical networks (opens in a new tab)

  11. Wireless Quantum Key Distribution in Indoor Environments

    … to provide a method for distributing secret random keys, which can be used for data encryption and decryption between two intended users. QKD has already been demonstrated in different scenarios over optical fibre and in atmospheric channels. QKD has also been used for security assurance in …

    whiterose Download PDF for Wireless Quantum Key Distribution in Indoor Environments (opens in a new tab)

  12. AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM

    … design, and representation schemes (random keys and permutation solution encoding procedures) of two path-based metaheuristics (Tabu Search and Simulated Annealing) and two population-based metaheuristics (Genetic Algorithms and Artificial Immune Algorithms) using QAP as a testbed. In …

    clemson Repository record for AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM (opens in a new tab)

  13. TIDS: Trust Value-Based IDS Framework for Wireless Body Area Network

    … (DoSL), this study employs pre-distributed random keys, random passwords, the trust value of each node, node energy consumption, the IDS, and an IDS database. The IDS plays a critical role in detecting and preventing DoSL attacks by monitoring the network traffic received and sent between …

    vu-aus Download PDF for TIDS: Trust Value-Based IDS Framework for Wireless Body Area Network (opens in a new tab)

  14. Improving Robustness of Deep Learning Models and Privacy-Preserving Image Denoising

    … as many IoT devices. In this method, we use two random keys to permute and perturb the noisy image patches. The cloud service provider implements the denoising task on the encrypted signal. After denoising, the output signal is still encrypted, and the real user who has access to the keys would …

    usf Repository record for Improving Robustness of Deep Learning Models and Privacy-Preserving Image Denoising (opens in a new tab)

  15. Deep Data Locality on Apache Hadoop

    … block placement policy (DBPP), data blocks are randomly placed on any available slave nodes, requiring a copy of RLM (Rack-Local Map) blocks. In block-based DDL, blocks are placed to avoid RLMs to reduce the block copy time. Second, block-based DDL concentrates the blocks in a smaller number of …

    unlv Repository record for Deep Data Locality on Apache Hadoop (opens in a new tab) Download PDF for Deep Data Locality on Apache Hadoop (opens in a new tab)

  16. Architectures for securing low-cost IoT

    … in particular struggle to create sufficient random data required for state-of-the-art security features. This is in stark contrast to common internet connected devices such as smartphones, and personal computers, which with their high-performance processors can generate sufficient randomness …

    strathclyde Repository record for Architectures for securing low-cost IoT (opens in a new tab)

  17. Analýza a optimalizace datové komunikace pro telemetrické systémy v energetice

    Telemetrické systémy, optimalizace, senzorické sítě, inteligentní sítě, internet věcí, senzory, informační bezpečnost, kryptografie, kryptografické algoritmy, kryptosystém, důvěrnost, integrita, autentičnost, čerstvost, nepopiratelnost.

    brno-tech Repository record for Analýza a optimalizace datové komunikace pro telemetrické systémy v energetice (opens in a new tab)