Wine companies face two important challenges in their supply chain: the international shipping temperatures and their effect on the perceived quality of the wine and the optimization of the bottling schedule. The wine maker takes special care in producing the best quality product, which is then shipped to the importer/distributor or consumer, generally in non-refrigerated containers at the mercy of the prevailing environmental conditions. The contributions of this work is that it is the first to measure, for a significant period of time, the temperatures along the international wine supply chain and to link them to the specific supply chain processes. This is also the first work that analyzes the effect of shipping temperature on the perceived quality of the product by those who make the purchase decision for importers, restaurants and supermarkets. Results indicate that the wine is very likely to have been exposed to extreme temperatures during shipping. For white wines, tasters are able to detect differences in wines which have been exposed to shipping temperatures and show a preference towards them. For red wines, they are unable to detect differences. Our contribution to the second challenge was the development of a model that produces solutions for the wine bottling lot sizing and scheduling problem with sequence dependent setup times, in an adequate time-frame, which can be implemented by large wineries. We have developed a model and algorithm that produces fast, good and robust solutions for the winery lot sizing and scheduling problem with sequence dependent setup times. We implemented an effective decomposition algorithm that uses the structure of the problem, that can be applied to other families of sequence dependent scheduling and lot sizing problem. Results indicate that the model achieves reductions of 30\% in the total plan costs.

This study investigates how power relations were negotiated and expressed through the use of certain linguistic practices in a public context. More specifically, it looks closer at how job applicants presented themselves publically through newspaper advertisements and which discursive codes they made use of to portray themselves as reputable, desirable employees that fit into the bourgeois concept of respectability. The survey accordingly moves within the theoretical frameworks of the respectability discourse, altering power relations, self-presentation and the public sphere, and does so through the application of linguistic methods on a very specific material not commonly looked at from these macro-perspectives. The first part of the analysis identifies which specific social groups that used the press as a channel for self-presentation, focusing on the aspects of gender, marital status, work experience and occupational title. Through establishing this information, we reach an understanding of who can be ascribed an active participation in the public sphere and where to place these individuals along the social scale. Thereafter, the vocabulary of the advertisers is scrutinized and compared to see how strategies to create an air of respectability around yourself may have differed with the personal aspects mentioned above. Conclusively, the results from these enquiries serve as the basis for a larger discussion on whether the assertive self-promotion of the job advertisers can be interpreted as a self-empowerment among a section of London’s labourers, or whether the publication of the adverts rather is to be seen as a consolidation of already existing power relationships. The findings prove that through their strict adherence to the concept of respectability in a desire to win the favour of their social superiors, the linguistic strategies of the adverts cannot be interpreted as an early form of working class-movement with the intention of overthrowing the social order. On the contrary, the hierarchical structure of the 18th century was as present as ever when society moved towards the next centenary and was consolidated even further by the linguistic strategies of the advertisers.

No description available.

Inhalt In diesem Beitrag wird die Kombination von virtuellen und experimentellen Methoden im Produktentwicklungsprozess am Beispiel einer Handhabungseinheit zur automatisierten Ablage technischer Textilien thematisiert. Um das Automatisierungspotenzial in den Fertigungsprozessen zum Aufbau von Faserverbundstrukturen zu erschließen, entwickelt das Institut für integrierte Produktentwicklung (BIK) seit längerem Handhabungseinheiten für technische Textilien. Eine automatisierte Fertigung soll die Reproduzierbarkeit und die Qualität von Bauteilen erhöhen, um z.B. den Beanspruchungen bei größer werdenden Rotorblättern von Windenergieanlagen gerecht zu werden. Ein weiteres Ziel der Automatisierung besteht in der Reduzierung von Prozesszeiten und Fertigungskosten, um den Fertigungsstandort Deutschland in Zukunft attraktiv zu gestalten. Die erfolgreiche Umsetzung der Produktentwicklung erfolgt am BIK unter kombinierter Anwendung von virtuellen und experimentellen Methoden. Insbesondere bei der Handhabung von technischen Textilien, deren biege- und schubweichen Materialeigenschaften nur mit hohem Aufwand in einer virtuellen Umgebung abgebildet werden können, ist das Durchführen von experimentellen Methoden bei komplex ablaufenden dynamischen Prozessen notwendig, um nicht vorhersehbares Materialverhalten zu identifizieren.

Quantum mechanics has a long history of helping computer science. For a long time, it provided help only at the hardware level by giving a better understanding of the properties of matter and thus allowing the design of ever smaller and ever more efficient components. For the last few decades, much research has been dedicated to finding whether one can change computer science even more radically by using the principles of quantum mechanics at both the hardware and algorithm levels. This field of research called Quantum Information Processing (QIP) has rapidly seen interesting theoretical developments: it was in particular shown that using superposition of states leads to computers that could outperform classical ones. The experimental side of QIP however lags far behind as it requires an unprecedented amount of control and understanding of quantum systems. Much effort is spent on finding which particular systems would provide the best physical implementation of QIP concepts. Because of their nearly endless versatility and the high degree of control over their synthesis, organic materials deserve to be assessed as a possible route to quantum computers. This thesis studies the QIP potential of spin degrees of freedom in several such organic compounds. Firstly, a study on low-spin antiferromagnetic rings is presented. It is shown that in this class of molecular nanomagnets the relaxation times are much longer than previously expected and are in particular long enough for up to a few hundred quantum operations to be performed. A detailed study of the relaxation mechanisms is presented and, with it, routes to increasing the phase coherence time further by choosing the suitable temperature, isotopic and chemical substitution or solvent. A study of higher-spin systems is also presented and it is shown that the relaxation mechanisms are essentially the same as in low-spin compounds. The route to multi-qubit system is also investigated: the magnetic properties of several supermolecular assemblies, in particular dimers, are investigated. Coupling between neighbouring nanomagnets is demonstrated and experimental issues are raised concerning the study of the coherent dynamics of dimers. Finally a study of the purely organic compound phenanthrene is reported. In this molecule the magnetic moment does not result from the interactions between several transition metal ions as in molecular nanomagnets but from the photoexcitation of an otherwise diamagnetic molecule. The interest of such a system in terms of QIP is presented and relaxation times and coupling to relevant nuclei are identified.

The diploma thesis The Figure of Saint Procopius in Historiographical and Hagiographical Texts of the 16th and 17th Century observes, how the earthly life and the posthumous effect of the saint are narrated in early modern historiographical and hagiographical literary relics. The thesis is also dedicated to miracles, which happened because of the intercession of Saint Procopius in the middle ages, and the fortune of the Slavonic monastic community of Sázava until the year 1097. It focuses on the changes, which Saint Procopius's theme has undergone in particular early modern works. It considers medieval legends of Saint Procopius, too. As a supplement to the thesis there is also a list of motifs connected with Saint Procopius, which are mentioned in early modern historiographical and hagiographical texts.

This thesis presents an introduction to the three main fields that study time: physics, philosophy, and logics. A brief introduction to general relativity, thermodynamics and quantum physics is made. Also some of the basic ideas from the philosophy of time are explained and dualities connected to time are described, e.g. eternalism vs. presentism, determinism vs. indeterminism and the reality or unreality of time. As there is a huge number of temporal logics, only the main ideas that differentiate these logics from others are pointed out and some typical proofs are then shown. Special attention is then given to the relation between logics and physics, how the first can be used in the latter. Thereafter, Branching space-times and Branching continuation models are presented, which proved to be useful within quantum physics. Next, some basic terminology connected to general relativity and the A, P and T topologies are introduced . These are used together with the given models to investigate a possible combination.

La représentation des temps de parcours est un enjeu influençant la qualité de l’information transmise aux usagers des réseaux de transport. En particulier, la congestion constitue un inconvénient majeur dont la prise en compte n’est pas toujours maîtrisée au sein des calculateurs d’itinéraires. De même, les évènements comme les réductions de capacité, les perturbations climatiques, ou encore les pics de fréquentation incitent à dépasser la définition statique des temps de parcours. Des travaux antérieurs se sont focalisés sur des temps dynamiques, i.e. dépendants de la date de départ, de manière à affiner le détail de la représentation, et à prendre notamment en compte le caractère périodique des congestions. La considération d’informations en temps réel est aussi une amélioration indéniable, que ce soit lors de la préparation du trajet, ou lorsqu’il s’agit de s’adapter à des perturbations rencontrées en cours de route. Ceci dit, aussi fines qu’elles soient dans les calculateurs disponibles, ces modélisations présentent un inconvénient majeur : elles ne prennent pas en compte toutes les facettes de la variabilité des temps de parcours. Cette variabilité est très importante, en particulier si l’on considère le niveau d’aversion au risque des usagers. En outre, dans un réseau multimodal, les correspondances éventuelles rendent encore plus critique l’incertitude associée aux temps de parcours. En réponse à ces enjeux, les présents travaux de thèse ont ainsi été consacrés à l’étude de temps de parcours stochastiques, i.e. vus comme des variables aléatoires distribuées.Dans une première étape, nous nous intéressons à la modélisation statistique des temps de parcours et à la quantification de leur variabilité. Nous proposons l’utilisation d’un système de lois développé dans le domaine de l’hydrologie, la famille des lois de Halphen. Ces lois présentent les caractéristiques typiques des distributions de temps de parcours, elles vérifient par ailleurs la propriété de fermeture par l’addition sous certaines hypothèses afférentes à leurs paramètres. En exploitant les ratios de moments associés aux définitions de ces lois de probabilité, nous mettons également au point de nouveaux indicateurs de fiabilité, que nous confrontons avec la palette d’indicateurs classiquement utilisés. Cette approche holistique de la variabilité des temps de parcours nous semble ainsi ouvrir de nouvelles perspectives quant au niveau de détail de l’information, notamment à destination des gestionnaires de réseaux.Par la suite, nous étendons le cadre d’analyse aux réseaux, en utilisant les résultats obtenus à l’étape précédente. Différentes lois de probabilité sont ainsi testées dans le cadre de la recherche du plus court chemin stochastique. Cette première étude nous permet de dresser un panorama des chemins identifiés en fonction du choix de modélisation. S’il est montré que le choix du modèle est important, il s’agit surtout d’affirmer que le cadre stochastique est pertinent. Ensuite, nous soulevons la relative inefficacité des algorithmes de recherche du plus court chemin stochastique, ceux-ci nécessitant des temps de calcul incompatibles avec un passage à l’échelle industrielle. Pour pallier cette difficulté, un nouvel algorithme mettant en oeuvre une technique d’accélération tirée du cadre déterministe est développé dans la dernière partie de la thèse. Les résultats obtenus soulignent la pertinence de l’intégration de modèles stochastiques au sein des calculateurs d’itinéraires. / The travel time representation has a major impact on user-oriented routing information. In particular, congestion detection is not perfect in current route planners. Moreover, the travel times cannot be considered as static because of events such as capacity drops, weather disturbances, or demand peaks. Former researches focused on dynamic travel times, i.e. that depend on departure times, in order to improve the representation details, for example concerning the periodicity of congestions. Real-time information is also a significant improvement for users aiming to prepare their travel or aiming to react to on-line events. However these kinds of model still have an important drawback : they do not take into account all the aspects of travel time variability. This dimension is of huge importance, in particular if the user risk aversion is considered. Additionally in a multimodal network, the eventual connections make the travel time uncertainty critical. In this way the current PhD thesis has been dedicated to the study of stochastic travel times, seen as distributed random variables.In a first step, we are interested in the travel time statistical modeling as well as in the travel time variability. In this goal, we propose to use the Halphen family, a probability law system previously developed in hydrology. The Halphen laws show the typical characteristics of travel time distributions, plus they are closed under addition under some parameter hypothesis. By using the distribution moment ratios, we design innovative reliability indexes, that we compare with classical metrics. This holistic approach appears to us as a promising way to produce travel time information, especially for infrastructure managers.Then we extend the analysis to transportation networks, by considering previous results. A set of probability laws is tested during the resolution of the stochastic shortest path problem. This research effort helps us to describe paths according to the different statistical models. We show that the model choice has an impact on the identified paths, and above all, that the stochastic framework is crucial. Furthermore we highlight the inefficiency of algorithms designed for the stochastic shortest path problem. They need long computation times and are consequently incompatible with industrial applications. An accelerated algorithm based on a deterministic state-of-the-art is provided to overcome this problem in the last part of this document. The obtained results let us think that route planners might include travel time stochastic models in a near future.

Sistemas geralmente covariantes têm uma Hamiltoniana canônica nula, não é necessário encontrar na Hamiltoniana efetiva para determinar sua evolução dinâmica.Esta Hamiltoniana efetiva é dependente do gauge e sua forma varia com a escolha do gauge. Dirac propôs um método baseado em teoria de grupos para determinar a Hamiltoniana efetiva. Nós propomos um método baseado em teorias de gauge, segundo o formalismo BRST-BFV, para determiná-la. Aplicaremos o método à partícula relativística e a um modelo com dois tempos, também geralmente covariante. Para a partícula relativística com massa nula e spin N/2 encontraremos a Hamiltoniana efetiva nos gauges canônicos propostos por Dirac, chamados as formas da dinâmica: instante, frente de onda e pontual. Para isso, determinaremos a função fermiônica fixadora de gauge apropriada no formalismo BRST-BFV . A função fermiônica fixadora de gauge quebra as simetrias da ação original, tanto as simetrias locais quanto as globais, de forma que a Hamiltoniana efetiva é invariante por um grupo de simetria menor que o da ação clássica. No caso da física com dois tempos, o grupo de simetria da ação clássica, é o grupo conforme SO(d,2), maior que o grupo de Poincaré da partícula relativística. A ação também é invariante pela simetria local OSp(N\\2). Utilizando a mesma técnica aplicada à partícula relativística determinaremos, após as fixações dos gauges, as Hamiltonianas efetivas. Veremos que suas simetrias são menores que as simetrias da ação original, porém maiores que as da partícula relativística. Encontraremos uma Hamiltoniana não-relativística arbitrária, invariante por rotações em um espaço com (d-1) domensões espaciais e spin N/2. Neste trabalho, procuramos resolver alguns problemas que aparecem na física com dois tempos formulada por I. Bars, tais como a arbitrariedade das Hamiltonianas e das escolhas de gauge que levam a elas. Bars escolheu arbitrariamente as Hamiltonianas como combinações de geradores do grupo conforme, e fez escolhas de gauge complicadas e arbitrárias. Nós apresentamos escolhas de gauge mais simples que, de modo sistemático, resultam em Hamiltonianas com grupos de simetrias menores que os da ação original. Além disso, o resultado descrito no parágrafo acima, i.e., a Hamiltoniana arbitrária e com spin N/2, não havia sido obtido antes. / A general covariant system hás a vanishing canonical Hamiltonian and its time evolution is determined by na effective Hamiltonian. This effective Hamiltonian is gauge dependent and its form depends on the gauge on the gauge choice. Dirac has proposed a method based on gauge theories, according to the BRST-BFV formalism to determine it. This method Will be applied both to the relativistic particle and to a two-times model. For the massless relativistic and spin N/2 we Will showhow to get the effective Hamiltonian for the canonical gauges discussed by Dirac, called the forms of dynamics: instant, front and point. We Will find the appropriate gauge fixing function in the BRST-BFV formalism. The gauge fixing function breaks the symmetries of the original action, the local and the global symmetries, so that the effective Hamiltonian is invariant by a gauge symmetry groupwhich is smaller than the gauge symmetry group of the classical action. In the two times physics, the symmetry group of the classical action is the conformal group SO(d,2), which is larger than the Poincares group of the relativistic particle. The action is also invariant by the local symmetry OSp(N\\2). By using the same technique used in the relativistic particle, we Will determine the effective Hamiltonians, after the gauges had been fixed. We Will see that their symmetries are smaller than the original action symmetries, but they are larger than the symmetry group of the relativistic particle. We Will find a non-relativistic arbitrary Hamiltonian, invariant by rotations in a space with (d-1) dimensions and spin N/2. In this work, we tried to solve some problems that appeared in two times physics elaborated by I Bars, Just like the arbitrariness of Hamiltonians and the choices of gauges, which lead to them. Bars has chosen the Hamiltonians arbitrarily as combinations of the generators of the conformal group and has chosen complicated and arbitrary gauges. We have presented simple gauge choices, in which, in a systematic way, arise in Hamiltonians with symmetry groups that are smaller than the former paragraph, i. e. , na arbitrary Hamiltonian with spin N/2, hadnt been obtained before.

Este trabalho trata do problema de programação de operações no ambiente flow shop com máquinas múltiplas, com seus tempos de preparação (setup) assimétricos e dependentes da seqüência de processamento das tarefas. Este ambiente de produção é comum em indústrias gráficas, químicas, têxteis, de papel e de tinta, caracterizadas por sistemas com amplo mix de produtos. Qualquer processo produtivo requer um gerenciamento eficaz por meio do Planejamento e Controle da Produção (PCP). Esta atividade inclui a programação da produção, ou seja, a alocação de recursos para a execução de tarefas em uma base de tempo. A atividade de programação é uma das tarefas mais complexas no gerenciamento de produção, pois há a necessidade de lidar com diversos tipos diferentes de recursos e atividades simultaneamente. Além disso, o número de soluções possíveis cresce exponencialmente em várias dimensões, de acordo com a quantidade de tarefas, operações ou máquinas, conferindo uma natureza combinatorial ao problema. No ambiente estudado neste trabalho as operações de cada tarefa são executadas em múltiplos estágios de produção, podendo variar a quantidade de máquinas em cada um deles. Cada operação é processada por apenas uma máquina em cada estágio. Os tempos de preparação das máquinas possuem uma variabilidade relevante em função da ordem de execução das tarefas nas máquinas. A função-objetivo considerada é a minimização da duração total da programação (makespan). Foram desenvolvidos quatro métodos heurísticos construtivos com base em algoritmos reportados na literatura para solução de problemas flow shop permutacional e máquinas paralelas no ambiente cujo tempo de setup é dependente da seqüência. Como não foram encontrados na literatura métodos para programação no ambiente tratado neste trabalho, os algoritmos construídos foram comparados entre si. O foco da pesquisa foi o estudo da influência da relação entre as ordens de grandeza dos tempos de processamento e de setup em cada método de solução. Os resultados obtidos na experimentação computacional foram analisados e discutidos com base na porcentagem de sucesso, desvio relativo (%), desvio-padrão do desvio relativo e tempo médio de computação / This work adressess the hybrid flow shop scheduling problem with asymmetric sequence dependent setup times. This environment of production system is common in graphical, chemical, fabric, paper and ink industries. It’s characterized by systems with large mix of products. Any productive process requires an efficient management by means of Production Planning and Control. This activity includes scheduling, i.e., the resources allocation for the execution of jobs in a time base. Scheduling is one of the tasks most complex in production management, since it deals simultaneously with different types of resources and activities. Moreover, the number of possible solutions grows exponentially in some dimensions, in accordance with the number of jobs, operations or machines, conferring a combinatorial nature to the problem. In the environment studied in this work, the operations of each job are processed in multiple production stages. The number of machines in each stage can be different. Each operation is processed by only one machine in each stage. The setup times have a significant variability in function of the sequence of job processing on the machines. The objective is minimizing the total time to complete the schedule (makespan). Four constructive heuristic methods were developed on the basis of algorithms reported in the literature for solving permutation flow shop and parallel machine problems with sequence dependent setup times. The proposed heuristic methods have been compared between themselves, since no constructive heuristics have been found in the literature for the scheduling problem considered in this work. The focus of the research was the study of the influence of the relations among the range of the times processing and setup times in each method. The statistics used in order to evaluate the heuristic performances were the percentage of success (in finding the best solution), relative deviation, standard deviation of relative deviation and average computation time. Results from computational experience are discussed