Στην παρούσα μεταπτυχιακή εργασία περιγράφεται η διαδικασία συνδυασμού προβλημάτων Επιχειρησιακής Έρευνας με την μεθοδολογία εύρεσης συγκριτικής αποδοτικότητας (DEA). Αρχικά, παρουσιάζεται μια γενική περιγραφή της μεθόδου DEA και μια συνοπτική επισκόπηση της σχετικής βιβλιογραφίας. Παρουσιάζεται ο τρόπος συνδυασμού της μεθόδου DEA και δύο κλασσικών μοντέλων χωροθέτησης εγκαταστάσεων, του μοντέλου με περιορισμό και του αντίστοιχου μοντέλου χωρίς περιορισμό στην χωρητικότητα. Για την επίτευξη αυτού του στόχου γίνονται οι απαραίτητοι χειρισμοί στην μέθοδο DEA ούτως ώστε να μπορεί να υπολογίζεται η αποδοτικότητα για όλες τις μονάδες λήψης απόφασης ταυτόχρονα – μέθοδος ταυτόχρονης DEA (Simultaneous DEA), εφόσον το κλασσικό μοντέλο βρίσκει την αποδοτικότητα μιας μονάδας λύνοντας μια φορά το γραμμικό πρόβλημα με τους συντελεστές βαρύτητας αυτής της μονάδας. Η λύση του πολυκριτήριου προβλήματος αναδεικνύει την αλληλεπίδραση μεταξύ κόστους και αποδοτικότητας, για τη λήψη απόφασης ανάλογα με τις ανάγκες που μπορεί ενυπάρχουν σε ένα αντίστοιχο πραγματικό πρόβλημα. Στην συνέχεια αναπτύσσεται για πρώτη φορά στη διεθνή βιβλιογραφία μια μεθοδολογία για το συνδυασμό δύο άλλων βασικών προβλημάτων, της κάλυψης και της σύμπτυξης συνόλου, αντίστοιχα, με την μεθοδολογία DEA. Στόχος είναι να μορφοποιηθεί ένα μοντέλο γραμμικού προγραμματισμού έτσι ώστε εκτός από το μέτρο απόφασης του κόστους για την κάλυψη ή σύμπτυξη ενός συνόλου-στόχου, από διαθέσιμα υποσύνολα να ληφθεί υπόψη και η αποδοτικότητα του εκάστοτε υποσυνόλου, η οποία εν τέλει θα επηρεάσει και την συνολική αποδοτικότητα του συνόλου-στόχου. Γίνεται ο συνδυασμός των μεθοδολογιών και αναπτύσσονται μεθοδολογίες πολυκριτήριας ανάλυσης που μπορούν να χρησιμοποιηθούν για την λήψη αποφάσεων που αφορούν την αποδοτική και οικονομική κάλυψη ή σύμπτυξη ενός συνόλου. Για την πιστοποίηση και τη διαπίστωση της λειτουργικότητας των προτεινόμενων μεθοδολογιών αναπτύσσονται παραδείγματα προβλημάτων, τα οποία και επιλύονται επιτυχώς. / In the present thesis, the combination of Operation Research Problems with the Data Envelopment Analysis (DEA) is performed in order to make optimal and efficient decisions. Firstly, a general description of DEA and a breath literature review is presented. Then, we show and test location modeling formulations that utilize data envelopment analysis (DEA) efficiency measures to find optimal and efficient facility location/allocation patterns. In addition, to the authors’ best knowledge, the combinations of DEA with the Set Covering Problem as well as Set Packing Problem are formulated as multiobjective problems, for first time in the literature. The main aim of the proposed models is to make cost-effective and efficient decisions regarding the Set Covering and Packing Problem, respectively. Numerical examples are developed in order to validate and test the novel models. The numerical results of multiobjective analysis demonstrate that the proposed methods are able to successfully find optimal and efficient solutions for real set covering, packing and partitioning problems.

Η κατασκευή του Peano το 1890 μιας συνεχούς απεικόνισης από ένα τμήμα επί ενός τετραγώνου έδωσε αφορμή για το πρόβλημα εάν ένα τμήμα και ένα τετράγωνο είναι ομοιόμορφα, και γενικότερα εάν ο $n$-κύβος $I^{n}$ είναι ομοιόμορφος με τον $m$-κύβο $I^{m}$ για $n\neq m$. Το πρόβλημα αυτό λύθηκε από τον Brouwer το 1911 και η μελέτη αυτού του προβλήματος οδήγησε στον ορισμό των διαστάσεων ${\rm ind}$, ${\rm Ind}$ και ${\rm dim}$ και γενικότερα στη γένεση και ανάπτυξη της Θεωρίας Διαστάσεων. Στη διατριβή αυτή ορίζονται διαστάσεις-συναρτήσεις του τύπου ${\rm ind}$, ${\rm Ind}$ και ${\rm dim}$ και αποδεικνύονται βασικές ιδιότητες της Θεωρίας Διαστάσεων (θεωρήματα υποχώρου, αθροίσματος και γινομένου) για τις συναρτήσεις αυτές. Με τη βοήθεια των συναρτήσεων αυτών ορίζονται νέες κλάσεις τοπολογικών χώρων και μελετάται για τις κλάσεις αυτές το πρόβλημα της καθολικότητας, δηλαδή της ύπαρξης ή μη καθολικών χώρων για τις κλάσεις αυτές. Ένας τοπολογικός χώρος $T$ καλείται καθολικός για μια κλάση ${\rm I\!P}$ τοπολογικών χώρων, όταν ο $T$ ανήκει στην κλάση ${\rm I\!P}$ και κάθε τοπολογικός χώρος που ανήκει στην κλάση ${\rm I\!P}$ περιέχεται τοπολογικά στο χώρο $T$. Για την ύπαρξη καθολικών στοιχείων στις κλάσεις αυτές χρησιμοποιείται η μέθοδος κατασκευής Περιεκτικών Χώρων του βιβλίου: S.D. Iliadis, Universal spaces and mappings, North-Holland Mathematics Studies, 198. Elsevier Science B.V., Amsterdam, 2005. xvi+559 pp. / Peano' s construction in 1890 of a continuous map of a segment onto a square gave rise to the problem of whether a segment and a square are homeomorphic and generally whether the cubes $I^{n}$ and $I^{m}$ are homeomorhic for $n\neq m$. This problem was solved by Brouwer in 1911 and the investigation of this problem leads to the definitions of ${\rm ind}$, ${\rm Ind}$, and ${\rm dim}$ and generally to the beginning of Dimension Theory. In this thesis we define new dimension-like functions of the type ${\rm ind}$, ${\rm Ind}$ and ${\rm dim}$ and we give basic properties of Dimension Theory (subspace theorems, sum theorems, product theorems) for these dimension-like functions. Using the introduced dimension-like functions, new classes of spaces are defined and the investigation of the universality problem for these classes is given, that is whether there exists universal space in these classes. A space $T$ is said to be universal in a class ${\rm I\!P}$ of spaces if $T\in{\rm I\!P}$ and for every $X\in{\rm I\!P}$ there exists an embedding of $X$ into $T$. For the existence of universal elements in these classes is used the construction of Containing Spaces given in book: S.D. Iliadis, Universal spaces and mappings, North-Holland Mathematics Studies, 198. Elsevier Science B.V., Amsterdam, 2005. xvi+559 pp.

Σκοπός της παρούσας εργασίας είναι η σύγκριση διαφόρων μεθόδων κατηγοριοποίησης που στηρίζονται σε αναπαράσταση γνώσης με κανόνες μέσω της δημιουργίας έμπειρων συστημάτων από γνωστά σύνολα δεδομένων. Για την εφαρμογή των μεθόδων και τη δημιουργία και υλοποίηση των αντίστοιχων έμπειρων συστημάτων χρησιμοποιούμε διάφορα εργαλεία όπως: (α) Το ACRES, το οποίο είναι ένα εργαλείο αυτόματης παραγωγής έμπειρων συστημάτων με συντελεστές βεβαιότητας. Οι συντελεστές βεβαιότητος μπορούν να υπολογίζονται κατά δύο τρόπους και επίσης παράγονται δύο τύποι έμπειρων συστημάτων που στηρίζονται σε δύο διαφορετικές μεθόδους συνδυασμού των συντελεστών βεβαιότητας (κατά MYCIN και μιας γενίκευσης αυτής του MYCIN με χρήση βαρών που υπολογίζονται μέσω ενός γενετικού αλγορίθμου). (β) Το WEKA, το οποίο είναι ένα εργαλείο που περιέχει αλγόριθμους μηχανικής μάθησης. Συγκεκριμένα, στην εργασία χρησιμοποιούμε τον αλγόριθμο J48, μια υλοποίηση του γνωστού αλγορίθμου C4.5, που παράγει δένδρα απόφασης, δηλ. κανόνες. (γ) Το CLIPS, το οποίο είναι ένα κέλυφος για προγραμματισμό με κανόνες. Εδώ, εξάγονται οι κανόνες από το δέντρο απόφασης του WEKA και υλοποιούνται στο CLIPS με ενδεχόμενες μετατροπές. (δ) Το FuzzyCLIPS, το οποίο επίσης είναι ένα κέλυφος για την δημιουργία ασαφών ΕΣ. Είναι μια επέκταση του CLIPS που χρησιμοποιεί ασαφείς κανόνες και συντελεστές βεβαιότητος. Εδώ, το έμπειρο σύστημα που παράγεται μέσω του CLIPS μετατρέπεται σε ασαφές έμπειρο σύστημα με ασαφοποίηση κάποιων μεταβλητών. (ε) Το GUI Ant-Miner, το οποίο είναι ένα εργαλείο για την εξαγωγή κανόνων κατηγοριοποίησης από ένα δοσμένο σύνολο δεδομένων. με τη χρήση ενός μοντέλου ακολουθιακής κάλυψης, όπως ο αλγόριθμος AntMiner. Με βάση τις παραπάνω μεθόδους-εργαλεία δημιουργήθηκαν έμπειρα συστήματα από πέντε σύνολα δεδομένων κατηγοριοποίησης από τη βάση δεδομένων UCI Machine Learning Repository. Τα συστήματα αυτά αξιολογήθηκαν ως προς την ταξινόμηση με βάση γνωστές μετρικές (ορθότητα, ευαισθησία, εξειδίκευση και ακρίβεια). Από τη σύγκριση των μεθόδων και στα πέντε σύνολα δεδομένων, εξάγουμε τα παρακάτω συμπεράσματα: (α) Αν επιθυμούμε αποτελέσματα με μεγαλύτερη ακρίβεια και μεγάλη ταχύτητα, θα πρέπει μάλλον να στραφούμε στην εφαρμογή WEKA. (β) Αν θέλουμε να κάνουμε και παράλληλους υπολογισμούς, η μόνη εφαρμογή που μας παρέχει αυτή τη δυνατότητα είναι το FuzzyCLIPS, θυσιάζοντας όμως λίγη ταχύτητα και ακρίβεια. (γ) Όσον αφορά το GUI Ant-Miner, λειτουργεί τόσο καλά όσο και το WEKA όσον αφορά την ακρίβεια αλλά είναι πιο αργή μέθοδος. (δ) Σχετικά με το ACRES, λειτουργεί καλά όταν δουλεύουμε με υποσύνολα μεταβλητών, έτσι ώστε να παράγεται σχετικά μικρός αριθμός κανόνων και να καλύπτονται σχεδόν όλα τα στιγμιότυπα στο σύνολο έλεγχου. Στα σύνολα δεδομένων μας το ACRES δεν θεωρείται πολύ αξιόπιστο υπό την έννοια ότι αναγκαζόμαστε να δουλεύουμε με υποσύνολο μεταβλητών και όχι όλες τις μεταβλητές του συνόλου δεδομένων. Όσο πιο πολλές μεταβλητές πάρουμε ως υποσύνολο στο ACRES, τόσο πιο αργό γίνεται. / The aim of this thesis is the comparison of several classification methods that are based on knowledge representation with rules via the creation of expert systems from known data sets. For the application of those methods and the creation and implementation of the corresponding expert systems, we use various tools such as: (a) ACRES, which is a tool for automatic production of expert systems with certainty factors. The certainty factors can be calculated via two different methods and also two different types of expert systems can be produced based on different methods of certainty propagation (that of MYCIN and a generalized version of MYCIN one that uses weights calculated via a genetic algorithm). (b) WEKA, which is a tool that contains machine learning algorithms. Specifically, we use J48, an implementation of the known algorithm C4.5, which produces decision trees, which are coded rules. (c) CLIPS, which is a shell for rule based programming. Here, the rules encoded on the decision true produced by WEKA are extracted and codified in CLIPS with possible changes. (d) FuzzyCLIPS, which is a shell for creating fuzzy expert systems. It's an extension of CLIPS that uses fuzzy rules and certainty factors. Here, the expert system created via CLIPS is transferred to a fuzzy expert system by making some variables fuzzy. (e) GUI Ant-Miner, which is a tool for classification rules extraction from a given data set, using a sequential covering model, such as the AntMiner algorithm. Based on the above methods-tools, expert systems were created from five (5) classification data sets from the UCI Machine Learning Repository. Those systems have been evaluated according to their classification capabilities based on known metrics (accuracy, sensitivity, specificity and precision). From the comparison of the methods on the five data sets, we conclude the following: (a) if we want results with greater accuracy and high speed, we should probably turn into WEKA. (b) if we want to do parallel calculations too, the only tool that provides us this capability is FuzzyCLIPS, sacrificing little speed and accuracy. (c) With regards to GUI Ant-Miner, it works as well as WEKA in terms of accuracy, but it is slower. (d) About ACRES, it works well when we work with subsets of the variables, so that it produces a relatively small number or rules and covers almost all the instances of the test set. For our datasets, ACRES is not considered very reliable in the sense that we should work with subsets of variables, not all the variables of the dataset. The more variables we consider as a subset in ACRES, the slower it becomes.

Made available in DSpace on 2014-12-17T14:07:23Z (GMT). No. of bitstreams: 1 GilsonSN.pdf: 6365807 bytes, checksum: a479a13345717293c658748ef49aab97 (MD5) Previous issue date: 2007-07-04 / The state of Rio Grande do Norte presents a great potentiality for the production of ceramic tiles because of having natural raw material in quantity and quality making its economical exploration possible, beyond the great energetic differential of the state, the natural g?s. This works aims to study the influence of the dolomite and granulometry concentration and calcinations temperature in the obtaining of formulations for porous coverings which have to be coherent to the project,s specifications. The experiments have involved the physical-chemical and mineralogical characterizations of raw materials and mechanical tests in the dry and burnt proof bodies preceding a mixture experiment planning with the use of the response surface methodology, in order to get the best raw materials combinations to produce a ceramic mass with specific properties. The twelve ceramic masses studied in this work were prepared by the via dry process, characterized, shaped by uniaxial pressing and sinterized in the temperatures of 940?C, 1000?C, 1060?C, 1120?C and 1180?C, using a fast burning cycle. The crystalline phases formed during the sintering in the temperatures in study have revealed the presence of anorthite and diopside beyond quartz with a remaining phase. These phases were the main responsible ones by the physical- mechanical properties of the sinterized proof bodies. The proof bodies after the sintering stage have presented water absorption higher than 10% and a good dimensional stability in all studied temperatures. However, the flexural breaking strength results in the temperatures of 940?C, 1000?C and 1060?C, under the temperature zone of the vitrification of ceramic whiteware do not reach the flexural breaking strength specific for the porous wall tile (15 MPa), but in the temperature of 1120?C next to the vitrification temperature zone, some whiteware ceramic (formulations) has reached the specified value for the porous wall tile. The results of this work have showed that the studied raw materials have great importance for used in the production of porous wall tiles (BIII) / Rio Grande do Norte apresenta uma grande potencialidade para produ??o de revestimento cer?mico, haja vista, possuir mat?rias-primas naturais em quantidade e qualidade possibilitando sua explora??o econ?mica, al?m do grande diferencial energ?tico do Estado, que ? o g?s natural. Este trabalho objetiva estudar a influ?ncia da concentra??o de dolomita, sua granulometria e temperatura de sinteriza??o na obten??o de formula??es para revestimento poroso que atendam as especif?ca??es do projeto. Os experimentos envolveram a caracteriza??o f?sico qu?mico e mineral?gica das mat?rias-primas, e ensaios mec?nicos nos corpos de prova secos e queimados, precedendo-se de um planejamento de experimento de mistura, com o uso da metodologia de superf?cie de resposta, a fim de se obter as melhores combina?oes das mat?rias-primas para produzir massa cer?mica com propriedades especif?cas. As doze massas cer?micas estudadas foram preparadas pelo processo via seca, caracterizadas, conformadas por presagem uniaxial e sinterizadas nas temperaturas de 940?C, 1000?C, 1060?C, 1120?C, e 1180?C, utilizando um ciclo de queima r?pido. As fases cristalina formadas durante a sinteriza??o nas temperaturas em estudo, revelaram a presen?a de anortita e diopsita, al?m de quartzo com fase remanescente. Estas fases foram as principais respons?veis pelas propriedades f?sico-mec?nicas dos corpos de provas sinterizados. As fases cristalina formadas durante a sinteriza??o nas temperaturas em estudo, revelaram a presen?a de anortita e diopsita, al?m de quartzo com fase remanescente. Estas fases foram as principais respons?veis pelas propriedades f?sico-mec?nicas dos corpos de provas sinterizados. Os corpos de prova ap?s sinteriza??o apresentaram absor??o de ?gua superior a 10%, e uma boa estabilidade dimensional em todas as temperaturas estudadas, entretanto, os resultados da tens?o de ruptura ? flex?o nas temperaturas ( 940?C, 1000?C,e1060?C) abaixo da faixa de temperatura de gresifica?ao das massas cer?micas, n?o atigiram o valor de TRF especificado para revestimento poroso(15 MPa), por?m, na temperatura de 1120?C pr?xima da faixa da temperatura de gresifica??o, algumas massas cer?micas (formula??es) j? atingiram o valor especificado para revestimento poroso. Os resultados desse trabalho mostraram que, as mat?rias primas estudadas possuem grande potencial para serem utilizadas na fabrica??o de revestimento poroso (BIII)

Made available in DSpace on 2016-08-12T19:18:23Z (GMT). No. of bitstreams: 1 MariaEHC_TESE.pdf: 1170432 bytes, checksum: 23f945c77b271c8ad86c1d93e1bf0f2c (MD5) Previous issue date: 2011-12-14 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Three experiments were carried out in the didactic orchard of the Departamento de Ciências Vegetais of Universidade Federal Rural do Semi-Árido (UFERSA), located in Mossoró-RN. The experiments aimed at assessing the interference of weeds on the soil temperature, on the growth of sweet pepper (Capsicum annuum L.), and on the efficiency as to the use of water in the referred to type of crop when submitted to weed handling strategies within the systems no-trillage and conventional planting. The trials were assembled in a split-plot scheme, distributed within the experimental design , in randomized blocks with four replications. Within the plots, two planting systems were assessed (no-trillage and conventional), and, within the subplots, three weed handling strategies soil covering with black polyethylene film, with regular weeds, and with no weeds, were assessed. Within each subplot, sensors were installed at a depth of 5 cm for the purpose of measuring the soil temperature. Data were collected every 10 minutes and stored in dataloggers. As for the first experiment, the collected data led to the determination the temperature variation throughout the day from 20 to 30 days after transplanting (DAT), the average maximum and minimum temperatures every 5 days, and the daily temperature range during the crop cycle. On the 60th and 147th days after transplanting, the density as well as the dry mass of the weeds were assessed within the treatment with no weeds. Regarding the second experiment, what was assessed was the growth of sweet pepper, submitted to weed handling strategies within no-trillage and conventional planting systems. To attain such an objective, eight assessment times were established (0, 21, 42, 63, 84, 105, 126 e 147 DAT). The assessed features were: leaf area per plant, leaf area index, dry mass of leaves, of stem, of fruits, and the total dry mass per plant, leaf area ratio as well as the rates of absolute and relative growth and of net assimilation. On the 30th and 90th DAT, the weeds density and the dry mass were assessed in the treatments with no weeds. As to the third experiment, the water consumption and the sweet pepper s productivity were assessed. Based upon the relationship between productivity and water consumption, the efficiency as with water use (kg of fruit m-³ of water) was determined. On 0, 21, 42, 63, 84 e 105 DAT, the density and dry mass of weeds were assessed in the treatments with no weeds. Irrigation was done by way of dripping water, with different water supply to each subplot in order that the soil would be maintained with at least 80% of the total available water, based upon water tension in the soil. It was found that the soil temperature was influenced by the covering types, with wider temperature ranges and maximum temperatures in the treatments with weeds and in the treatments with the soil covered by polyethylene film within the conventional planting system as compared to the no trillage direct planting with regular weeds. The no-trillage system proved to be a suitable technique for growing sweet peppers under a high temperature condition. The no-trillage system displayed higher growth rates than those displayed by the conventional planting in all weed handling strategies. The highest rates were observed in the no-trillage with weeds; besides, this type of planting reduces infestation and the weeds dry mass accumulation. Insofar as the third trial is concerned, it was found that the weeds interference increased water consumption and reduced the sweet pepper productivity within the two planting systems; however, the conventional planting displayed stronger effects. The treatment with weeds in the direct planting displayed greater fruit productivity and greater efficiency as for water use as compared to the others. It was concluded that the dead covering in the direct planting lowered the soil temperature, favored the growth and productivity of sweet pepper, reduced infestation by weeds, and increased water use efficiency / Foram conduzidos na horta didática do Departamento de Ciências Vegetais da Universidade Federal Rural do Semi-Árido (UFERSA), no município de Mossoró-RN, três experimentos com o objetivo de avaliar a interferência de plantas daninhas sobre a temperatura do solo, no crescimento e na eficiência do uso da água na cultura do pimentão (Capsicum annuum L.), submetido a estratégias de manejo de plantas daninhas nos sistemas de plantio direto e convencional. Os ensaios foram montados no esquema de parcelas subdivididas, distribuídas no delineamento experimental em blocos casualizados com quatro repetições. Nas parcelas foram avaliados dois sistemas de plantio (direto e convencional) e nas subparcelas, três estratégias de manejo de plantas daninhas (cobertura do solo com filme de polietileno preto, com capinas regulares e sem capinas). Em cada subparcela, foram instalados sensores, a 5 cm de profundidade, para medir a temperatura do solo. Os dados foram coletados a cada 10 minutos e armazenados em dataloggers. No primeiro experimento, a partir dos dados obtidos, determinou-se a variação da temperatura ao longo do dia, no período de 20 a 30 dias após o transplantio (DAT) e a cada 5 dias a média das temperaturas máxima e mínima e a amplitude térmica diária durante o ciclo da cultura e aos 60 e 147 dias após o transplantio foram realizadas avaliações nos tratamentos sem capinas da densidade e massa seca de plantas daninhas. No segundo experimento avaliou-se o crescimento do pimentão submetido a estratégias de manejo de plantas daninhas nos sistemas de plantio convencional e direto. Para tal foram realizadas oito épocas de avaliações (0, 21, 42, 63, 84, 105, 126 e 147 DAT). As características avaliadas foram: área foliar por planta, índice de área foliar, massa seca de folhas, caule, frutos e total por planta, razão de área foliar, as taxas de crescimento absoluto e relativo e taxa de assimilação líquida. Aos 30 e 90 DAT foram realizadas avaliações de densidade e massa seca de plantas daninhas nos tratamentos sem capinas. No terceiro experimento avaliou-se o consumo de água e a produtividade do pimentão. A partir da relação entre a produtividade e o consumo de água determinou-se, para cada tratamento, a eficiência no uso da água (kg de fruto m-³ de água) e aos 0, 21, 42, 63, 84 e 105 DAT foram realizadas avaliações de densidade e massa seca de plantas daninhas nos tratamentos sem capinas. As irrigações foram realizadas por gotejamento com fornecimento de água diferenciado para cada subparcela, de modo a manter o solo com no mínimo de 80% da água disponível total, com base na tensão de água no solo. Verificou-se que a temperatura do solo foi influenciada pelos tipos de cobertura, tendo-se constatado maiores amplitudes térmicas e temperaturas máximas nos tratamentos com capinas e coberto com filme de polietileno no sistema de plantio convencional em relação ao plantio direto com capinas regulares. O sistema de plantio direto mostrou-se como uma técnica adequada para o cultivo do pimentão sob condição de temperatura elevada. O sistema de plantio direto apresentou índices de crescimento superiores aos do plantio convencional em todas as estratégias de manejo de plantas daninhas e as maiores taxas foram verificadas no plantio direto com capinas além de reduzir a infestação e o acúmulo de massa seca de plantas daninhas. No terceiro ensaio, constatou-se que a interferência das plantas daninhas elevou o consumo de água e reduziu a produtividade do pimentão nos dois sistemas de plantio, embora com efeitos mais pronunciados no plantio convencional. O tratamento com capinas no plantio direto apresentou maior produtividade de frutos e eficiência no uso da água em relação aos demais. Concluiu-se que a cobertura morta no sistema de plantio direto diminuiu a temperatura do solo e favoreceu o crescimento e a produtividade do pimentão, reduziu a infestação de plantas daninhas e elevou a eficiência no uso da água

Made available in DSpace on 2016-06-02T20:28:22Z (GMT). No. of bitstreams: 1 DissFPM.pdf: 979275 bytes, checksum: 1b13e7e3772ecbeac26224804b180369 (MD5) Previous issue date: 2007-06-27 / Universidade Federal de Sao Carlos / In this work, we study the Artin braid group, B(n), and the confguration spaces (ordered and unordered) of a path connected manifold of dimension ¸ 2. The fundamental group of confguration space (unordered) of IR2 is identifed with the Artin braid group. This identifcation is used to conclude that the confguration space of IR2 is an Eilenberg-MacLane space of type K(B(n), 1). Therefore, it can be proved that the braid group B(n) contains no nontrivial element of the finite order. We use this fact to prove a generalization of a 2−dimensional version of the Borsuk-Ulam theorem presented by Connett [3]. / Neste trabalho, apresentamos o grupo de tranças de Artin, B(n), e os espaços de configurações (ordenado e não ordenado) de uma variedade conexa por caminhos de dimensão ¸ 2, a fim de identificar o grupo fundamental do espaço de configurações (não ordenado) de IR2 com o grupo de tranças de Artin. Usamos este fato para concluir que o espaço de configurações de IR2 é um espaço de Eilenberg-MacLane do tipo K(B(n), 1). Deste modo pode ser provado que o grupo de tranças B(n) não possui elementos não triviais de ordem finita, e usamos este fato na demonstração de uma generalização da versão bi-dimensional do teorema de Borsuk-Ulam apresentado por Connett [3].

Este trabalho consiste de duas partes. Na primeira, desenvolvemos uma teoria de Nielsen equivariante para raizes de G-aplicações $f:X\\to Y$ equivariantes entre G-espaços topológicos Hausdorff, conexos, normais, localmente conexos por caminhos e semilocalmente simplesmente conexos, onde G é um grupo topológico, Na segunda parte, estudamos a questão da realização do G-número de Nielsen de raizes quando este é zero. / This work consists of two parts. In the firs one, we develop an equivariant Nielsen root theory for G-maps. We consider equivariant maps $f:X\\to Y$ between Hausdorff, connected, normal, locally path connected and semilocally simply connected G-spaces, where G is a topological group. In the second part, we study the question of the realization of G-Nielsen root number when it is zero.

Un des plus grands défis dans la conception matérielle et logicielle est de s’assurer que le système soit exempt d’erreurs. La moindre erreur dans les systèmes embarqués réactifs peut avoir des conséquences désastreuses et coûteuses pour certains projets critiques, nécessitant parfois de gros investissements pour les corriger, ou même conduire à un échec spectaculaire et inattendu du système. Prévenir de tels phénomènes en identifiant tous les comportements critiques du système est une tâche assez délicate. Les tests en industrie sont globalement non exhaustifs, tandis que la vérification formelle souffre souvent du problème d’explosion combinatoire. Nous présentons dans ce contexte une nouvelle approche de génération exhaustive de jeux de test qui combine les principes du test industriel et de la vérification formelle académique. Notre approche construit un modèle générique du système étudié à partir de l’approche synchrone. Le principe est de se limiter à l’analyse locale des sous-espaces significatifs du modèle. L’objectif de notre approche est d’identifier et extraire les conditions préalables à l’exécution de chaque chemin du sous-espace étudie. Il s’agit ensuite de générer tout les cas de tests possibles à partir de ces pré-conditions. Notre approche présente un algorithme de quasi-aplatissement plus simple et efficace que les techniques existantes ainsi qu’une compilation avantageuse favorisant une réduction considérable du problème de l’explosion de l’espace d’états. Elle présente également une manipulation symbolique des données numériques permettant un test plus expressif et concret du système étudié. / One of the biggest challenges in hardware and software design is to ensure that a system is error-free. Small errors in reactive embedded systems can have disastrous and costly consequences for a project. Preventing such errors by identifying the most probable cases of erratic system behavior is quite challenging. Indeed, tests in industry are overall non-exhaustive, while formal verification in scientific research often suffers from combinatorial explosion problem. We present in this context a new approach for generating exhaustive test sets that combines the underlying principles of the industrial test technique and the academic-based formal verification approach. Our approach builds a generic model of the system under test according to the synchronous approach. The goal is to identify the optimal preconditions for restricting the state space of the model such that test generation can take place on significant subspaces only. So, all the possible test sets are generated from the extracted subspace preconditions. Our approach exhibits a simpler and efficient quasi-flattening algorithm compared with existing techniques and a useful compiled internal description to check security properties and reduce the state space combinatorial explosion problem. It also provides a symbolic processing technique of numeric data that provides a more expressive and concrete test of the system. We have implemented our approach on a tool called GAJE. To illustrate our work, this tool was applied to verify an industrial project on contactless smart cards security.

Le travail général de cette thèse consiste à étendre les outils analytiques et algébriques usuellement employés dans la résolution de problèmes combinatoires déterministes à un cadre combinatoire stochastique. Deux cadres distincts sont étudiés : les problèmes combinatoires stochastiques discrets et les problèmes stochastiques continus. Le cadre discret est abordé à travers le problème de la forêt couvrante de poids maximal dans une formulation Two-Stage à multi-scénarios. La version déterministe très connue de ce problème établit des liens entre la fonction de rang dans un matroïde et la formulation duale, via l'algorithme glouton. La formulation stochastique discrète du problème de la forêt maximale couvrante est transformée en un problème déterministe équivalent, mais du fait de la multiplicité des scénarios, le dual associé est en quelque sorte incomplet. Le travail réalisé ici consiste à comprendre en quelles circonstances la formulation duale atteint néanmoins un minimum égal au problème primal intégral. D'ordinaire, une approche combinatoire classique des problèmes de graphes pondérés consiste à rechercher des configurations particulières au sein des graphes, comme les circuits, et à explorer d'éventuelles recombinaisons. Pour donner une illustration simple, si on change d'une manière infinitésimale les valeurs de poids des arêtes d'un graphe, il est possible que la forêt couvrante de poids maximal se réorganise complètement. Ceci est vu comme un obstacle dans une approche purement combinatoire. Pourtant, certaines grandeurs analytiques vont varier de manière continue en fonction de ces variations infinitésimales, comme la somme des poids des arêtes choisies. Nous introduisons des fonctions qui rendent compte de ces variations continues, et nous examinons dans quels cas les formulations duales atteignent la même valeur que les formulations primales intégrales. Nous proposons une méthode d'approximation dans le cas contraire et nous statuons sur la NP complétude de ce type de problème.Les problèmes stochastiques continus sont abordés via le problème de sac à dos avec contrainte stochastique. La formulation est de type ``chance constraint'', et la dualisation par variable lagrangienne est adaptée à une situation où la probabilité de respecter la contrainte doit rester proche de $1$. Le modèle étudié est celui d'un sac à dos où les objets ont une valeur et un poids déterminés par des distributions normales. Dans notre approche, nous nous attachons à appliquer des méthodes de gradient directement sur la formulation en espérance de la fonction objectif et de la contrainte. Nous délaissons donc une possible reformulation classique du problème sous forme géométrique pour détailler les conditions de convergence de la méthode du gradient stochastique. Cette partie est illustrée par des tests numériques de comparaison avec la méthode SOCP sur des instances combinatoires avec méthode de Branch and Bound, et sur des instances relaxées. / The global purpose of this thesis is to study the conditions to extend analytical and algebraical properties commonly observed in the resolution of deterministic combinatorial problems to the corresponding stochastic formulations of these problems. Two distinct situations are treated : discrete combinatorial stochastic problems and continuous stochastic problems. Discrete situation is examined with the Two Stage formulation of the Maximum Weight Covering Forest. The well known corresponding deterministic formulation shows the connexions between the rank function of a matroid, the greedy algorithm , and the dual formulation. The discrete stochastic formulation of the Maximal Covering Forest is turned into a deterministic equivalent formulation, but, due to the number of scenarios, the associated dual is not complete. The work of this thesis leads to understand in which cases the dual formulation still has the same value as the primal integer formulation. Usually, classical combinatorial approaches aim to find particular configurations in the graph, as circuits, in order to handle possible reconfigurations. For example, slight modifications of the weights of the edges might change considerably the configuration of the Maximum Weight Covering Forest. This can be seen as an obstacle to handle pure combinatorial proofs. However, some global relevant quantities, like the global weight of the selected edges during the greedy algorithm, have a continuous variation in function of slight modifications. We introduce some functions in order to outline these continuous variations. And we state in which cases Primal integral problems have the same objective values as dual formulations. When it is not the case, we propose an approximation method and we examine the NP completeness of this problem.Continuous stochastic problems are presented with the stochastic Knapsack with chance constraint. Chance constraint and dual Lagrangian formulation are adapted in the case where the expected probability of not exceeding the knapsack capacity is close to $1$. The introduced model consists in items whose costs and rewards follow normal distributions. In our case, we try to apply direct gradient methods without reformulating the problem into geometrical terms. We detail convergence conditions of gradient based methods directly on the initial formulation. This part is illustrated with numerical tests on combinatorial instances and Branch and Bound evaluations on relaxed formulations.

En quoi le traitement journalistique contribue-t-il à une construction de l’Histoire, quand il se confronte à la barbarie du genre humain ou aux pires déchaînements de Mère Nature ? De quels éléments de compréhension dispose-t-on dans la mémoire de ces événements ? La place occupée par le journaliste sur ces terrains en crise est intenable. Il est comme coincé dans une crise perpétuelle qu’il ne vit qu’au présent. Avec des archives conservées ou non, les traces disponibles sont très aléatoires. Je souhaite décortiquer ce que l’on appelle parfois la machine médiatique. Par une recherche approfondie mais non moins sélective des médias et des publics qui les consomment, il s’agit de trouver les clés pour comprendre comment ces crises majeures se transforment en une nouvelle Histoire focalisée sur l’instantané du journaliste qui traite de ces crises. Guerres, crimes génocidaires, tremblements de terre, tsunami : cette toile de fond ne reçoit pas le même traitement journalistique selon que l’on se situe en avril 1994 ou en janvier 2010.Interroger l’approche de ces crises qui se ressemblent mais déchirent les mémoires diversement selon que le traitement journalistique porte sur la République démocratique du Congo ou le Rwanda ; éclairer ce qui fait le terreau du misérabilisme ou suscite l’admiration dans la manière de rapporter les événements qui touchent Haïti ou le Japon ; savoir pourquoi telle ou telle direction est privilégiée dans la couverture de ces crises dans la presse imprimée francophone à travers des titres belge et français ; comprendre comment le Web bouscule les choix et la vitesse de la couverture du chaos : voici la base de cette recherche. / How does media coverage contribute to build History, when it faces Human atrocities and huge natural disasters? What keys to understanding can be found in the recollection of such events? The journalist’s position on these unstable fields is untenable. He is stuck in a permanent crisis that he can only watch as a contemporary witness. And, because records are not always held, traces are randomly available. My objective is to dissect what we may call the media spiral. Through an in-depth but nonetheless selective study of the Medias and their publics, the aim is to find keys to understanding how these major crises are turned into a new History focused on the reporter’s snapshot. Wars, genocides, earthquakes, and tsunami: this backdrop is not subject to the same media coverage depending whether we are in April 1994 or in January 2010. Questioning the approach to crises which are alike, but tear memories variously as the journalistic treatment concerns the Democratic Republic of Congo or Rwanda; decoding what is a breeding ground for ‘miserabilism’ on the one hand, and what arouses the admiration on the other hand, in the way of reporting the events which affect Haiti or Japan; trying to find out why such or such direction is favoured in the coverage of these crises in French-speaking printed press, through the study of Belgian and French titles; comprehending why the Internet rushes the choices and the race for the chaos coverage: here is the basis of this research.