• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 16
  • 7
  • 5
  • 2
  • 2
  • 1
  • Tagged with
  • 33
  • 9
  • 8
  • 6
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Development and Evaluation of Order Batching Procedures for a Distribution Center

Ganapathysubramanian, Karthick 17 October 2005 (has links)
No description available.
2

Tirpalų dozatoriaus gamyba ir dozavimo technologijos ištyrimas / Design and creation of the equipment for dosing out solution and its technological research

Mieldažys, Mindaugas 13 June 2005 (has links)
The equipment for dosing out the solution has been created and the research of its technical characteristics has been done. It appeared that during a certain period of time, depending upon the quantity of solution, the concentration of the solution changes. Besides, with the help of the model, experiments concerning concentration of a solution were done, and the results about the changes of concentration are shown on a graphic.
3

Cybersécurite matérielle et conception de composants dédiés au calcul homomorphe / Hardware cybersecurity and design of dedicated components for the acceleration of homomorphie encryption schemes

Migliore, Vincent 26 September 2017 (has links)
L’émergence d’internet et l’amélioration des infrastructures de com- munication ont considérablement encouragé l’explosion des flux d’in- formations au niveau mondial. Cette évolution a été accompagnée par l’apparition de nouveaux besoins et de nouvelles attentes de la part des consommateurs. Communiquer avec ses proches ou ses collaborateurs, stocker des documents de travail, des fichiers mul- timédia, utiliser des services innovants traitant nos documents per- sonnels, tout cela se traduit immanquablement par le partage, avec des tiers, d’informations potentiellement sensibles. Ces tiers, s’ils ne sont pas de confiance, peuvent réutiliser à notre insu les données sensibles que l’on leur a confiées. Dans ce contexte, le chiffrement homomorphe apporte une bonne solution. Il permet de cacher aux yeux des tiers les données qu’ils sont en train de manipuler. Cependant, à l’heure actuelle, le chif- frement homomorphe reste complexe. Pour faire des opérations sur des données de quelques bits (données en clair), il est nécessaire de manipuler des opérandes sur quelques millions de bits (données chiffrées). Ainsi, une opération normalement simple devient longue en termes de temps de calcul. Dans cette étude, nous avons cherché à rendre le chiffrement ho- momorphe plus pratique en concevant un accélérateur spécifique. Nous nous sommes basés sur une approche de type co-conception logicielle/matérielle utilisant l’algorithme de Karatsuba. En particulier, notre approche est compatible avec le batching, qui permet de sto- cker plusieurs bits d’informations dans un même chiffré. Notre étude démontre que le batching peut être implémenté sans surcoût important comparé à l’approche sans batching, et permet à la fois de réduire les temps de calcul (calculs effectués en parallèle) et de réduire le rapport entre la taille des données chiffrées et des données en clair. / The emergence of internet and the improvement of communica- tion infrastructures have considerably increased the information flow around the world. This development has come with the emergence of new needs and new expectations from consumers. Communicate with family or colleagues, store documents or multimedia files, using innovative services which processes our personal data, all of this im- plies sharing with third parties some potentially sensitive data. If third parties are untrusted, they can manipulate without our agreement data we share with them. In this context, homomorphic encryption can be a good solution. Ho- momorphic encryption can hide to the third parties the data they are processing. However, at this point, homomorphic encryption is still complex. To process a few bits of clear data (cleartext), one needs to manage a few million bits of encrypted data (ciphertext). Thus, a computation which is usually simple becomes very costly in terms of computation time. In this work, we have improved the practicability of homomorphic en- cryption by implementing a specific accelerator. We have followed a software/hardware co-design approach with the help of Karatsuba algorithm. In particular, our approach is compatible with batching, a technique that “packs" several messages into one ciphertext. Our work demonstrates that the batching can be implemented at no important additional cost compared to non-batching approaches, and allows both reducing computation time (operations are processed in parallel) and the ciphertext/cleartext ratio.
4

A Methodology to Design Systems to Support Fulfillment of Online Grocery Orders

Mesa, Akhilesh 02 June 2021 (has links)
No description available.
5

The Effects of Intravenous Admixture Batching Schedules on Waste - a Computer Simulation Approach

Chiu, Chien-Hsiang 30 September 2010 (has links)
No description available.
6

Some Problems in One-Operator Scheduling

Baki, Mohammed Fazle January 1999 (has links)
A flexible workforce or a versatile machine is employed to perform various types of operations. Often these resources are associated with setups. Whenever a worker or machine switches from processing one type of operation to another a setup time may be required although several operations of a same type can be processed in succession after a single setup. The presence of setups gives rise to the problem of choosing batch sizes that are neither too large nor too small. In the last one and a half decade, many researchers have addressed the problem of scheduling with batching. A majority of articles assumes that there is only one type of scarce resource, which is typically machine. Often there can be two scarce resources such as a worker and a machine or a machine and a tool. We propose a resource constrained scheduling model with a single operator and two or more machines. Whenever the operator changes machine, a setup time is required that may be sequence dependent or sequence independent. We consider the two cases of an open shop and a flow shop. In the open shop case, the order in which a job visits the machines is unrestricted. In the flow shop case, every job must visit the machines in the same order. We consider various scheduling objectives. For variable number of machines, many cases are intractable. We discuss some dominance properties that narrow down the search for an optimal schedule. We present a dynamic programming approach which solves a large number of cases. The running time of the dynamic program is polynomial for a fixed number of machines. For the case of two machines, we show that the dominance properties have a nice interpretation. We develop some algorithms and justify their use by establishing running times, comparing the running times with those of the existing algorithms, and testing the performance of the algorithms.
7

Reaproveitamento de lamas residuais do processo de fabricação do concreto. / Reuse of slurry from the concrete manufacturing process.

Silva, Daniel Oliveira Frazão da 21 December 2015 (has links)
Nos dias atuais, um dos maiores problemas de uma central dosadora de concreto são as sobras de resíduos de concretos que retornam nos caminhões, das obras gerando lamas decantadas com pH elevado caracterizando-a como resíduo perigoso e representando gastos elevados com destinação. O objetivo do presente trabalho visa estudar em detalhes a composição da lama residual do processo de fabricação do concreto excluindo o agregado graúdo, verificando qual é a influência de sua adição no concreto. Com isso, pretende-se estudar algumas formas de tratamento e viabilizar economicamente o seu reaproveitamento em substituição ao agregado miúdo. Para esse estudo foram coletadas duas amostras desse material cimentício, sendo uma coletada diretamente do tanque de decantação e a segunda coletada da própria lavagem dos caminhões betoneiras. Elas foram submetidas a ensaios de caracterização como: análise termogravimétrica (TG), granulometria a laser e calorimetria e ensaios de concreto fresco (reologia e abatimento) e concreto endurecido. Para a viabilização econômica foi realizado um estudo de caso em três centrais dosadoras de concreto, afim de identificar perdas de materiais, custos de destinação e custo variável na fabricação de concreto. Os resultados mostraram que a forma de coleta do material cimentício influencia na finura do material conforme ensaio de granulometria e densidade aparente, mas não foi possível obter cimento anidro. A possibilidade de utilização da lama em concretos foi possível com ajuda de aditivos superplastificantes, mas para a viabilização economicamente viável a cadeia produtiva do concreto estudou-se um teor ótimo de substituição da lama pelo agregado miúdo. / Nowadays, one of the biggest problems of a central concrete batching are the concrete waste leftovers returning from work generating decanted sludge with high pH characterizing it as hazardous waste and representing high spending allocation. The purpose of this study aims to study in detail the composition of the sludge from the concrete manufacturing process, checking what is the influence of its addition in concrete. With this, we intend to study some forms of treatment and its reuse economically viable to replace the fine aggregate. For this study two samples that were collected cementitious material, being collected directly from one settling tank and collected in the second washing of the own mixer trucks. They were subjected to characterization tests such as thermogravimetric analysis (TG), laser granulometry calorimetry and fresh concrete test (rheology and chilling) and hardened concrete. For economic feasibility was carried out a case study in three metering stations of concrete, in order to identify material losses, disposal costs and variable costs in the manufacture of concrete. The results showed that the form of collection of cementitious materials influences the fineness of the material as particle size and bulk density test, but it was not possible to obtain anhydrous cement. The possibility of using sludge in concrete was possible with the help of superplasticizers additives, but for the economical feasibility of the production chain concrete studied it a great replacement content of the mud by the fine aggregate.
8

Ordonnancement sur les machines à traitement par batches et contraintes de compatibilité / Scheduling batching machines with compatibility constraints

Bellanger, Adrien 23 November 2009 (has links)
Dans cette thèse, nous avons traité les problèmes d'ordonnancement d'ateliers de type flowshop hybride à deux étages avec machines à traitement par batches sur le second étage et compatibilité entre les tâches.Les durées opératoires des tâches sont données par des intervalles, et les tâches sont dites compatibles si elles partagent une même durée d'exécution. Pour le problème de minimisation de la date de fin d'ordonnancement de ce type d'atelier, nous avons développé 6 heuristiques à performances garanties. D'après les expériences réalisées, ces heuristiques sont efficaces sur de grandes instances. Pour les petites instances, nous avons présenté deux méthodes exactes de type procédures par séparation évaluation qui permettent de résoudre des instances de 20 tâches. Nous avons également développé un schéma d'approximation polynomial (PTAS) utilisable lorsque les durées d'exécution sur le premier étage sont identiques. En complément de ces travaux, nous avons également étudié d’autres problèmes de minimisation de critères réguliers sur une machine à traitement par batches. Nous avons développé des algorithmes de programmation dynamiques pseudo-polynomiaux pour les problèmes de minimisation de la somme des dates de fin d'exécution et pour les problèmes avec dates de fin souhaitées. Afin de compléter ces résultats de complexité, nous avons montré la NP-complétude des problèmes avec dates de fin souhaitées / This thesis deals with 2-stages hybrid flowshop scheduling problems with batching machines on the second stage and compatibility constraints. The processing times of tasks are given by intervals and tasks are compatible if they share a same second stage processing time. We developped 6 heuristics with worth-case analysis for the makespan minimization problem. The experimental results show that these heuristics give good schedules with an average gap of 1\% on 200 task instances. For small instances, we presented 2 exact methods, Branch \& Bounds, which solves up to 20 task instances. For the particular case with identical processing times on first stage and uniform processing time intervals we developped a Polynomial Time Approximation Scheme (PTAS). The second part of this thesis deal with scheduling problems on one batching machine with infinite capacity and regular criteria minimization. We developped pseudo-polynomial dynamic programming algorithm for minimization total completion time, maximal lateness and total tardiness. Finally we show the NP-completeness of problems with due dates
9

Some Problems in One-Operator Scheduling

Baki, Mohammed Fazle January 1999 (has links)
A flexible workforce or a versatile machine is employed to perform various types of operations. Often these resources are associated with setups. Whenever a worker or machine switches from processing one type of operation to another a setup time may be required although several operations of a same type can be processed in succession after a single setup. The presence of setups gives rise to the problem of choosing batch sizes that are neither too large nor too small. In the last one and a half decade, many researchers have addressed the problem of scheduling with batching. A majority of articles assumes that there is only one type of scarce resource, which is typically machine. Often there can be two scarce resources such as a worker and a machine or a machine and a tool. We propose a resource constrained scheduling model with a single operator and two or more machines. Whenever the operator changes machine, a setup time is required that may be sequence dependent or sequence independent. We consider the two cases of an open shop and a flow shop. In the open shop case, the order in which a job visits the machines is unrestricted. In the flow shop case, every job must visit the machines in the same order. We consider various scheduling objectives. For variable number of machines, many cases are intractable. We discuss some dominance properties that narrow down the search for an optimal schedule. We present a dynamic programming approach which solves a large number of cases. The running time of the dynamic program is polynomial for a fixed number of machines. For the case of two machines, we show that the dominance properties have a nice interpretation. We develop some algorithms and justify their use by establishing running times, comparing the running times with those of the existing algorithms, and testing the performance of the algorithms.
10

Transmission Schemes, Caching Algorithms and P2P Content Distribution with Network Coding for Efficient Video Streaming Services

Kao, Yung-cheng 23 February 2010 (has links)
For more than a decade, streaming media services, including on-line conferences, distance education and movie broadcasting, have gained much popularity on the Internet. Due to the high bandwidth requirements and long lived nature of video streaming, it requires huge transmission cost to support these streaming media services. In addition, how to adapt rich multimedia content to satisfy various resource-constrained devices presents a challenge. The limited and time-varying network bandwidth complicates the content adaptation tasks. Differentiated content delivery may be required to meet diverse client profiles and user preferences. Therefore, in order to reduce transmission cost to serve heterogeneous clients for efficient streaming, in this dissertation, several novel schemes including transcoding-enable proxy caching scheme, reactive transmission schemes, and network coding P2P content distribution scheme, are proposed to support efficient multiple-version and layered video delivery in the proxy-attached network environment as well as to provide efficient interactive IPTV service in a peer-to-peer network. Firstly, for multiple-version cache consideration in the transcoding-enable proxy, we focus on reducing the required server bandwidth and startup delay by caching the optimal versions of the video. A generalized video object profit function is derived from the extended weighted transcoding graph to calculate the individual cache profit of certain version of a video object, and the aggregate profit from caching multiple versions of the same video object. This proposed function takes into account the popularity of certain version of a video object, the transcoding delay among versions and the average access duration of each version. Based on the profit function, cache replacement algorithms are proposed to reduce the startup delay and network traffic by efficiently caching video objects with maximum profits. Next, a set of proxy-assisted transmission schemes are proposed to reduce the transmission cost for layered video streaming by integrating the proxy caching with reactive transmission schemes, peer-to-peer mesh networks and multicast capability. These proposed transmission schemes make multiple requests to be serviced by the single transmission and thus to significantly reduce the total required transmission cost. The optimal proxy prefix cache allocation is also calculated for each transmission scheme to identify the cache layers and cache length of each video to minimize the aggregate transmission cost. The process considers the fact that reduction in transmission cost by caching X layers of a video is not only from requests on X layers, but also from requests on less than X layers. Finally, we proposed a network coding equivalent content distribution (NCECD) scheme to decrease server stress, startup delay and jumping latency to support random access operations which are desirable for peer-to-peer on-demand video streaming. The random access operations are difficult to be efficiently supported, due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In NCECD, videos are divided into segments which are then further divided into blocks. These blocks are then encoded into independent encoded blocks that are distributed to the local storage of different peers. With NCECD, a new client only needs to connect to a sufficient number of parent peers in order to view the whole video and rarely needs to find new parents when performing random access operations. Whereas most existing methods must search for parent peers containing interested segments, NCECD uses the properties of network coding to cache equivalent content on most peers, so that searches are rarely needed. The analysis of system parameters is given to achieve reasonable block loss rates for peer-to-peer interactive video-on-demand streaming. Experimental results demonstrate that these proposed schemes can lead to significant transmission cost saving, high delay saving ratio, high bandwidth saving ratio, low startup and jumping searching delays, connecting to a new parent peer delay and less server resources. Hence, these proposed schemes can further be integrated and utilized to build an efficient video streaming platform for providing high-performance and high-quality IPTV services to a diversity of clients.

Page generated in 0.0612 seconds