• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • 1
  • Tagged with
  • 5
  • 5
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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

Without A Camera

Kulbaba, Brian 01 January 2008 (has links)
The method for creating my art is a matter of experimental process, manipulation of photographic elements, and time spent. I am a photographer in a digital age that does not use a camera. My moment of creativity occurs without the snap of a shutter, but relies on my understanding and control of the chemical components of photography. My work deconstructs the notion of duplication commonly found in photography. The procedure can be repeated but the results are variable. The process of creating my work often results in a multitude of prints, but the pieces that I select as art capture a number of instinctive characteristics which convey an emotion or message to me. When I present my photographs I offer the viewer an experience--an opportunity to see the work through my mind's eye as it makes sense to me. It is within this open dialogue that the work is complete: part process, part intuitive participation.
2

Genetic Algorithm Applied to Generalized Cell Formation Problems / Les algorthmes génétiques appliqués aux problèmes de formation de cellules de production avec routages et processes alternatifs

Vin, Emmanuelle 19 March 2010 (has links)
The objective of the cellular manufacturing is to simplify the management of the manufacturing industries. In regrouping the production of different parts into clusters, the management of the manufacturing is reduced to manage different small entities. One of the most important problems in the cellular manufacturing is the design of these entities called cells. These cells represent a cluster of machines that can be dedicated to the production of one or several parts. The ideal design of a cellular manufacturing is to make these cells totally independent from one another, i.e. that each part is dedicated to only one cell (i.e. if it can be achieved completely inside this cell). The reality is a little more complex. Once the cells are created, there exists still some traffic between them. This traffic corresponds to a transfer of a part between two machines belonging to different cells. The final objective is to reduce this traffic between the cells (called inter-cellular traffic). Different methods exist to produce these cells and dedicated them to parts. To create independent cells, the choice can be done between different ways to produce each part. Two interdependent problems must be solved: • the allocation of each operation on a machine: each part is defined by one or several sequences of operations and each of them can be achieved by a set of machines. A final sequence of machines must be chosen to produce each part. • the grouping of each machine in cells producing traffic inside and outside the cells. In function of the solution to the first problem, different clusters will be created to minimise the inter-cellular traffic. In this thesis, an original method based on the grouping genetic algorithm (Gga) is proposed to solve simultaneously these two interdependent problems. The efficiency of the method is highlighted compared to the methods based on two integrated algorithms or heuristics. Indeed, to form these cells of machines with the allocation of operations on the machines, the used methods permitting to solve large scale problems are generally composed by two nested algorithms. The main one calls the secondary one to complete the first part of the solution. The application domain goes beyond the manufacturing industry and can for example be applied to the design of the electronic systems as explained in the future research.
3

Embrace, Exhaust, Efface

Heurtin, Geren McKinnon January 2021 (has links)
No description available.
4

Space Search Based Algorithm for Cell Formation with Alternative Process Plans

Rajaraman, Srinivas January 2003 (has links)
No description available.
5

Genetic algorithm applied to generalized cell formation problems / Algorthmes génétiques appliqués aux problèmes de formation de cellules de production avec routages et processes alternatifs

Vin, Emmanuelle 19 March 2010 (has links)
The objective of the cellular manufacturing is to simplify the management of the<p>manufacturing industries. In regrouping the production of different parts into clusters,<p>the management of the manufacturing is reduced to manage different small<p>entities. One of the most important problems in the cellular manufacturing is the<p>design of these entities called cells. These cells represent a cluster of machines that<p>can be dedicated to the production of one or several parts. The ideal design of a<p>cellular manufacturing is to make these cells totally independent from one another,<p>i.e. that each part is dedicated to only one cell (i.e. if it can be achieved completely<p>inside this cell). The reality is a little more complex. Once the cells are created,<p>there exists still some traffic between them. This traffic corresponds to a transfer of<p>a part between two machines belonging to different cells. The final objective is to<p>reduce this traffic between the cells (called inter-cellular traffic).<p>Different methods exist to produce these cells and dedicated them to parts. To<p>create independent cells, the choice can be done between different ways to produce<p>each part. Two interdependent problems must be solved:<p>• the allocation of each operation on a machine: each part is defined by one or<p>several sequences of operations and each of them can be achieved by a set of<p>machines. A final sequence of machines must be chosen to produce each part.<p>• the grouping of each machine in cells producing traffic inside and outside the<p>cells.<p>In function of the solution to the first problem, different clusters will be created to<p>minimise the inter-cellular traffic.<p>In this thesis, an original method based on the grouping genetic algorithm (Gga)<p>is proposed to solve simultaneously these two interdependent problems. The efficiency<p>of the method is highlighted compared to the methods based on two integrated algorithms<p>or heuristics. Indeed, to form these cells of machines with the allocation<p>of operations on the machines, the used methods permitting to solve large scale<p>problems are generally composed by two nested algorithms. The main one calls the<p>secondary one to complete the first part of the solution. The application domain goes<p>beyond the manufacturing industry and can for example be applied to the design of<p>the electronic systems as explained in the future research.<p> / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished

Page generated in 0.0973 seconds