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

Analysis of algorithms for filter bank design optimization

ElGarewi, Ahmed 06 September 2019 (has links)
This thesis deals with design algorithms for filter banks based on optimization. The design specifications consist of the perfect reconstruction and frequency response specifications for finite impulse response (FIR) analysis and synthesis filters. The perfect reconstruction conditions are formulated as a set of linear equations with respect to the analysis filters’ coefficients and the synthesis filters’ coefficients. Five design algorithms are presented. The first three are based on an unconstrained optimization of performance indices, which include the perfect reconstruction error and the error in the frequency specifications. The last two algorithms are formulated as constrained optimization problems with the perfect reconstruction error as the performance index and the frequency specifications as constraints. The performance of the five algorithms is evaluated and compared using six examples; these examples include uniform filter bank, compatible non-uniform filter bank and incompatible non-uniform filter bank designs. The evaluation criteria are based on distortion and aliasing errors, the magnitude response characteristics of analysis and synthesis filters, the computation time required for the optimization, and the convergence of the performance index with respect to the number of iterations. The results show that the five algorithms can achieve almost perfect reconstruction and can meet the frequency response specifications at an acceptable level. In the case of incompatible non-uniform filter banks, the algorithms have challenges to achieve almost perfect reconstruction. / Graduate
12

Self Incompatible Solvent

Męcfel-Marczewski, Joanna 13 August 2010 (has links) (PDF)
In dieser Arbeit wird das neue Prinzip der „Selbstinkompatiblen Lösungsmittel“ vorgestellt. Es wird theoretisch abgeleitet, dass eine Mischung aus zwei Substanzen mit ungünstigen Wechselwirkungen bereitwillig eine weitere Substanz aufnehmen sollte, die diese ungünstigen Wechselwirkungen durch Verdünnen vermindert. Dies sollte umso stärker ausgeprägt sein, je ungünstiger die Wechselwirkungen zwischen den beiden ersten Substanzen sind. Da sich jedoch Substanzen mit sehr ungünstigen Wechselwirkungen physikalisch nicht mischen, entstand die Idee, diese Substanzen durch eine kovalente Bindung aneinander zu binden. Ein solches Molekül, das aus zwei inkompatiblen Hälften besteht, wird im Folgendem Selbstinkompatibles Lösungsmittel genannt. Die in dieser Arbeit gewählten Substanzen zeigen mäßige Inkompatibilität, deshalb ist ein Vergleich zwischen einfachen physikalischen Mischungen und kovalent verknüpften Molekülhälften noch möglich. Dieses Prinzip wird für binäre und ternäre Mischungen quantitativ berechnet und experimentell in drei Serien von Experimenten bestätigt: i) unter Verwendung von Lösungskalorimetrie und Bestimmung der Wechselwirkungsparameter zwischen Komponente 3 und einer bereits hergestellt physikalischen binären Mischung aus Komponente 1 und 2, ii) unter Verwendung von Lösungskalorimetrie und Bestimmung der Wechselwirkungsparameter zwischen Komponente 3 und den selbstinkompatiblen Losungsmitteln, die den in (i) gewählten Mischungen entsprechen und iii) aus der Sättigungslöslichkeit der Komponente 3 in den entsprechenden selbstinkompatiblen Lösungsmitteln. In diesen drei verschiedenen Messserien wird stets der gleichen Trend beobachtet: Die Selbstinkompatibilität eines Lösungsmittels begünstigt den Lösevorgang. / In this thesis a new principle of Self Incompatible Solvent is introduced. It is shown theoretically that a preexisting mixture of two substances (compound 1 and 2) with unfavorable interactions will readily dissolve a third compound because it diminishes the unfavorable interaction between the compound 1 and 2 by dilution. This behavior should be the stronger the more unfavorable the interactions between compound 1 and 2 are. However, substances with strong unfavorable interactions will not mix. Therefore the idea pursued here is to enforce the desired preexisting mixture for example by linking compound 1 covalently to compound 2. Such a molecule that is composed of two incompatible parts is called Self Incompatible Solvent in this work. In this thesis examples of incompatible compounds that show moderate incompatibility are chosen, therefore it was possible to do a comparison between simple physical mixtures and covalently linked incompatible molecules. The theoretical prediction of the theory is compared with experiments. This principle is calculated quantitatively for binary and ternary mixtures and compared with the experimental results in three distinct series of experiments: i) by using solution calorimetry and calculation of the interaction parameters between compounds 3 and the preexisting binary mixture of compound 1 and 2, ii) by using solution calorimetry and calculation of the interaction parameters between compound 3 and the Self Incompatible Solvent that correspond to the mixtures used in (i) and iii) from the saturation solubility of compound 3 in the Self Incompatible Solvent. The results obtained from the theoretical prediction and these obtained from the three different series of experiments show the same trend: the self incompatibility of the solvent improves the dissolution process.
13

Detection of API and ABI Compatibility in Java / Detection of API and ABI Compatibility in Java

Rohovský, Tomáš January 2013 (has links)
Tato diplomová práce se zabývá API a ABI kompatibilitou Java knihoven. Jsou popsány typy kompatibility a analyzovány změny API, které vedou k zdrojové či binárni nekompatibilitě. Dále je provedena analýza existujících nástrojů, které provádějí zjišťování nekompatibility. Vhodný nástroj z předchozí analýzy je vybrán a rozšířen. Na základě rozšířeného nástroje je vytvořena serverová aplikace, která poskytuje informace o kompatibilitě sledovaných knihoven.
14

Self-incompatible solvents with ionic groups / Selbstinkompatible Lösungsmittel mit ionischen Gruppen

Wang, Yana 28 February 2013 (has links) (PDF)
The concept of a self-incompatible solvent is introduced as a molecule composed of two parts (compound 1 and 2) with unfavourable interactions. A third compound will be readily dissolved in this solvent to diminish this unfavourable interaction by dilution. The more incompatible compounds 1 and 2 are, the stronger this behaviour is expected to be. In this work, ionic liquids comprising non-polar carbon chain and polar ionic group are chosen to serve as a model of self-incompatible solvent. The interactions parameters k of the ionic liquids with active ingredients are investigated to examine the effect of self-incompatibility of the ionic liquid molecule. On the other hand, phase separation between compounds 1 and 2 will reduce the positive effect of self-incompatibility. The tendency of phase separation is increasing with increasing size of the two compounds. Thus, if compounds 1 and 2 are blocks tied together into a block copolymer, one expects a decreasing ability of the block copolymer to dissolve an active ingredient with increasing block length. In this work the ability of polybutadiene-block-poly(2-vinylpyridine) (PB-b-P2VP) block copolymers to dissolve the model compound anthracene is investigated. As expected, the solubility indeed decreases with increasing block length.
15

Deterministic Scheduling Of Parallel Discrete And Batch Processors

Venkataramana, M 07 1900 (has links)
Scheduling concerns the allocation of limited resources to tasks over time. In manufacturing systems, scheduling is nothing but assigning the jobs to the available processors over a period of time. Our research focuses on scheduling in systems of parallel processors which is challenging both from the theoretical and practical perspectives. The system of parallel processors is a common occurrence in different types of modern manufacturing systems such as job shop, batch shop and mass production. A variety of important and challenging problems with realistic settings in a system of parallel processors are considered. We consider two types of processors comprising discrete and batch processors. The processor which produces one job at a time is called a discrete processor. Batch processor is a processor that can produce several jobs simultaneously by keeping jobs in a batch form which is commonly seen in semiconductor manufacturing, heat treatment operations and also in chemical processing industries. Our aim is to develop efficient solution methodologies (heuristics/metaheuristics) for three different problems in the thesis. The first two problems consider the objective of minimizing total weighted tardiness in cases of discrete and batch processors where customer delivery time performance is critical. The third problem deals with the objective of minimizing the total weighted completion time in the case of batch processors to reduce work-in-process inventory. Specifically, the first problem deals with the scheduling of parallel identical discrete processors to minimize total weighted tardiness. We develop a metaheuristic based on Ant Colony Optimization(ACO) approach to solve the problem and compare it with the available best heuristics in the literature such as apparent tardiness cost and modified due date rules. An extensive experimentation is conducted to evaluate the performance of the ACO approach on different problem sizes with varied tardiness factors. Our experimentation shows that the proposed ant conony optimization algorithm yields promising results as compared to the best of the available heuristics. The second problem concerns with the scheduling of jobs to parallel identical batch processors for minimizing the total weighted tardiness. It is assumed that the jobs are incompatible in respect of job families indicating that jobs from different families cannot be processed together. We decompose the problem into two stages including batch formation and batch scheduling as in the literature. Ant colony optimization based heuristics are developed in which ACO is used to solve the batch scheduling problem. Our computational experimentation shows that the proposed five ACO based heuristics perform better than the available best traditional dispatching rule called ATC-BATC rule. The third scheduling problem is to minimize the total weighted completion time in a system of parallel identical batch processors. In the real world manufacturing system, jobs to be scheduled come in lots with different job volumes(i.e number of jobs) and priorities. The real settings of lots and high batch capacity are considered in this problem. This scheduling problem is formulated as a mixed integer non-linear program. We develop a solution framework based on the decomposition approach for this problem. Two heuristics are proposed based on the proposed decomposition approach and the performance of these heuristics is evaluated in the cases of two and three batch processors by comparing with the solution of LINGO solver.
16

Heuristic Methods For Job Scheduling In A Heat Treatment Shop To Maximize Kiln Utilization

Srinidhi, S 02 1900 (has links)
Scheduling in the context of manufacturing systems has become increasingly impor- tant in order for organizations to achieve success in dynamic and competitive scenarios. Scheduling can be described as allocation of available jobs over resources to meet the performance criteria defined in a domain. Our research work fo cuses on scheduling a given set of three-dimensional cylindrical items, each characterized by width wj , height hj, and depth dj , onto parallel non-identical rectangular heat treatment kilns, such that the capacities of the kilns is optimally used. The problem is strongly NP-hard as it generalizes the (one-dimensional) Bin Packing Problem (1BP), in which a set of n positive values wj has to be partitioned into the minimum number of subsets so that the total value in each subset does not exceed the bin capacity W. The problem has been formulated as a variant of the 3D-BPP by following the MILP approach, and we propose a weight optimization heuristic that produces solutions comparable to that of the LP problem, in addition to reducing the computational complexity. Finally, we also propose a Decomposition Algorithm (DA) and validate the perfor- mance effectiveness of our heuristic. The numerical analyses provides useful insights that influence the shop-floor decision making process.
17

ペリドタイト部分溶融における粒界濃集元素の挙動

鈴木, 和博, 諏訪, 兼位, 榎並, 正樹 03 1900 (has links)
科学研究費補助金 研究種目:一般研究(B) 課題番号:63460053 研究代表者:日比野 倫夫 研究期間:1988-1989年度
18

Self Incompatible Solvent

Męcfel-Marczewski, Joanna 12 February 2010 (has links)
In dieser Arbeit wird das neue Prinzip der „Selbstinkompatiblen Lösungsmittel“ vorgestellt. Es wird theoretisch abgeleitet, dass eine Mischung aus zwei Substanzen mit ungünstigen Wechselwirkungen bereitwillig eine weitere Substanz aufnehmen sollte, die diese ungünstigen Wechselwirkungen durch Verdünnen vermindert. Dies sollte umso stärker ausgeprägt sein, je ungünstiger die Wechselwirkungen zwischen den beiden ersten Substanzen sind. Da sich jedoch Substanzen mit sehr ungünstigen Wechselwirkungen physikalisch nicht mischen, entstand die Idee, diese Substanzen durch eine kovalente Bindung aneinander zu binden. Ein solches Molekül, das aus zwei inkompatiblen Hälften besteht, wird im Folgendem Selbstinkompatibles Lösungsmittel genannt. Die in dieser Arbeit gewählten Substanzen zeigen mäßige Inkompatibilität, deshalb ist ein Vergleich zwischen einfachen physikalischen Mischungen und kovalent verknüpften Molekülhälften noch möglich. Dieses Prinzip wird für binäre und ternäre Mischungen quantitativ berechnet und experimentell in drei Serien von Experimenten bestätigt: i) unter Verwendung von Lösungskalorimetrie und Bestimmung der Wechselwirkungsparameter zwischen Komponente 3 und einer bereits hergestellt physikalischen binären Mischung aus Komponente 1 und 2, ii) unter Verwendung von Lösungskalorimetrie und Bestimmung der Wechselwirkungsparameter zwischen Komponente 3 und den selbstinkompatiblen Losungsmitteln, die den in (i) gewählten Mischungen entsprechen und iii) aus der Sättigungslöslichkeit der Komponente 3 in den entsprechenden selbstinkompatiblen Lösungsmitteln. In diesen drei verschiedenen Messserien wird stets der gleichen Trend beobachtet: Die Selbstinkompatibilität eines Lösungsmittels begünstigt den Lösevorgang. / In this thesis a new principle of Self Incompatible Solvent is introduced. It is shown theoretically that a preexisting mixture of two substances (compound 1 and 2) with unfavorable interactions will readily dissolve a third compound because it diminishes the unfavorable interaction between the compound 1 and 2 by dilution. This behavior should be the stronger the more unfavorable the interactions between compound 1 and 2 are. However, substances with strong unfavorable interactions will not mix. Therefore the idea pursued here is to enforce the desired preexisting mixture for example by linking compound 1 covalently to compound 2. Such a molecule that is composed of two incompatible parts is called Self Incompatible Solvent in this work. In this thesis examples of incompatible compounds that show moderate incompatibility are chosen, therefore it was possible to do a comparison between simple physical mixtures and covalently linked incompatible molecules. The theoretical prediction of the theory is compared with experiments. This principle is calculated quantitatively for binary and ternary mixtures and compared with the experimental results in three distinct series of experiments: i) by using solution calorimetry and calculation of the interaction parameters between compounds 3 and the preexisting binary mixture of compound 1 and 2, ii) by using solution calorimetry and calculation of the interaction parameters between compound 3 and the Self Incompatible Solvent that correspond to the mixtures used in (i) and iii) from the saturation solubility of compound 3 in the Self Incompatible Solvent. The results obtained from the theoretical prediction and these obtained from the three different series of experiments show the same trend: the self incompatibility of the solvent improves the dissolution process.
19

La réouverture du procès pénal : contribution à l’étude de l’efficacité des procédures actuelles de révision et de réexamen en droit pénal français / The reopening of a criminal trial

Schmandt, Claire-Annie 21 December 2012 (has links)
Une condamnation pénale définitive ne peut en principe plus être remise en cause. La chose jugée doit en effet être tenue pour vraie. L’adage non bis in idem et les principes de l’autorité et de la force de la chose jugée semblent dès lors interdire de rouvrir le procès pénal. Toutefois, le législateur français prévoit deux procédures distinctes permettant de remettre encause la condamnation prononcée : la révision et le réexamen. Les conditions de mise en oeuvre de ces procédures et leurs spécificités en font des procédures très exceptionnelles. Par la présentation d’éléments nouveaux de fait pour la révision, et de droit pour le réexamen, le requérant peut dans certains cas prétendre à nouvelle étude de son affaire. Cependant cette réouverture ne pourra être décidée que par une juridiction ad hoc et sera de type différent selon le nouveau procès envisagé. De plus, l’issue de ce nouveau procès pourra permettre de maintenir la condamnation en dépit des nouveaux faits présentés ou reconnaître l’innocence du condamné. / Final sentencing in a criminal trial cannot in principle be questioned any more. Indeed the adjudged case has to be considered as definitely settled. The non bis in idem Latin saw and the res judicata tenet thus seem to preclude the re-opening of a criminal trial. And yet, lawgivers put in place two distinct legal processes that enable French citizens to challenge their sentencing: reviewing and re-hearing. The conditions for carrying out these processes and their own specifities make these proceedings quite exceptional. Through the presentation of new evidence for reviewing, and because re-hearing can be considered as of right, convicted people may in some cases get a new trial. Nevertheless only an ad hoc jurisdiction can decide upon a new hearing and the latter will be of a different kind depending on the new trial at hand. Moreover, the upshot of this new trial will make it possible either to maintain the sentencing notwithstanding new evidence being presented to a new court or to declare the defendant not guilty.
20

La question litigieuse en matière contractuelle. Essai sur le traitement procédural du droit des contrats / The litigious questions in contractual matters. Essay on the procedural treatment of contract law

Reverchon-Billot, Morgane 09 July 2015 (has links)
La question litigieuse en matière contractuelle correspond aux sanctions du contrat que les parties, à la suite d'un différend, décident d'introduire dans le procès civil. Le concept se présente comme un trait d'union entre le droit des contrats et la procédure civile : il offre ainsi une vision processualiste des sanctions du contrat, qu'il replace dans le contexte du procès civil, doublée d'une perspective contractualiste de la procédure civile, celle-ci étant chargée de la réalisation des droits substantiels des parties. La question litigieuse s'avère un instrument utile pour préciser la nature des sanctions du contrat que les parties peuvent solliciter ensemble et celles pour lesquelles il est nécessaire d'opérer un choix (en les hiérarchisant éventuellement par le mécanisme du subsidiaire). L'intérêt est également de spécifier le régime de l'évolution de la question litigieuse tout au long de l'instance. L'analyse révèle ainsi dans quelle mesure les parties peuvent la modifier en première instance, en appel, ou encore devant la Cour de cassation. De surcroît, lorsqu'un nouveau procès est entamé par un contractant, il faut s'assurer que la question nouvellement posée n'est pas identique à la précédente. Le concept encadre enfin les pouvoirs du juge appelé à trancher un litige relatif au contrat : il permet de savoir de quelle manière le juge peut ajouter ou substituer une sanction à celle choisie par les parties, et s'il dispose, à cet égard, d'un pouvoir ou d'un devoir d'y procéder. De la sorte, l'étude de la question litigieuse concourt à améliorer le traitement procédural du droit des contrats. / The litigious question in contractual matters corresponds to the contractual sanctions that the parties enter into in a civil trial. It is the link between contract law and a civil proceeding: it offers a procedural vision of the contractual sanctions because they are analyzed in terms of their implementation by the civil trial, it also allows to have a contractualist's perspective about the procedural civil law inasmuch as the comprehension of the litigious question is based on a study of contract sanctions.On the one hand, the litigious question concept is used to specify which are the contractual sanctions that the parties have the right to solicit together and the sanctions between which it is necessary to choose (potentially by using a subsidiary claim). On the other hand, it also allows to define the rules of its evolution on the parties' or the judge's initiative. The study of the litigious question reveals to what extent the parties can change the question in the first instance, in appeal or before the Supreme Court. One of them can call a new trial as well; it should be checked that the new litigious question is not the same as the precedent one. Likewise, the concept frames the authority of the judge before which the sanction is requested. It clarifies especially how to proceed to add or substitute another penalty for that chosen by the parties, and if it is a faculty or an obligation. The study of the litigious question thus contributes to improve the procedural treatment of contractual law.

Page generated in 0.0748 seconds