Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Guaranteee.
Дисертації з теми "Guaranteee"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Guaranteee".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Tefft, Barbara J. "No guarantees /." Online version of thesis, 1990. http://hdl.handle.net/1850/10949.
Повний текст джерела
2
Miguel, Luiz Felipe Hadlich. "As garantias dadas ao particular nas parcerias público-privadas." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/2/2134/tde-20062013-133627/.
Повний текст джерелаАнотація:
O presente trabalho tem por objetivo apresentar ao leitor as diversas formas de garantia que poderão ser oferecidas ao particular, pelo Estado, como forma de atraí-lo à contratação de parcerias público-privadas, instituídas em âmbito federal pela lei nº. 11.079, de 30 de dezembro de 2004. A escassez de recursos públicos, culminando com a incapacidade estatal de investir em áreas de sua responsabilidade, fez com que se buscassem novas formas de interação entre os setores público e privado. Contudo, o histórico de mau pagador da Administração Pública brasileira implicou na necessidade de oferecimento de garantias àqueles que irão contratar com o poder público, sem as quais talvez poucos ousassem investir seu capital em atividades nem sempre certamente rentáveis. A proposta é analisar as diversas modalidades de garantias, apontando suas fragilidades e seus aspectos favoráveis, sempre no intuito de mostrá-las viáveis e eficientes. Por fim, algumas sugestões de novas espécies serão apresentadas, aumentando a gama de opções que o administrador terá ao seu alcance quando pretender levar a efeito uma contratação desta natureza.<br>The present work aims at presenting the reader a wide range of guarantees which can be offered to private companies by the State, so as to attract them to contracting public-private partnerships, instituted in federal extent under law number 11.079, dated December 30, 2004. The shortage in public resources, culminating with the incapacity of the State to invest in sectors of its own responsibility, has brought about the pursuit of new ways of interaction between the public and private sectors. Notwithstanding, the fact that Brazilian Public Administration has a history of being a bad payer has implied the need for guarantees to those who will hire the Public Power, taking into consideration that perhaps only a few people will be willing to invest their funds in doubtfully profitable activities. The purpose of this paper is to analyze the various forms of guarantees, pointing out weaknesses and favorable aspects, always targeting on turning them viable and efficient. At last, some other new suggestions will be introduced, enhancing the range of options the administrator may have at reach whenever one intends to put into practice such kind of hiring.
3
Uzelac, Filip [Verfasser]. "Four Essays in Equity-Linked Life and Pension Insurance : Financial Analysis of Surrender Guarantees, Pension Guarantee Funds and Pension Retirement Plans [[Elektronische Ressource]] / Filip Uzelac." Bonn : Universitäts- und Landesbibliothek Bonn, 2014. http://d-nb.info/1060098911/34.
Повний текст джерела
4
Blaise, Guerby. "Les mesures privatives de liberté avant jugement : regard porté sur le droit haïtien à la lumière du droit français." Electronic Thesis or Diss., Paris 10, 2021. http://www.theses.fr/2021PA100167.
Повний текст джерелаАнотація:
Ce travail de recherche tend à exposer la nécessité de la privation de liberté avant procès et la corrélation entre la sauvegarde de l’ordre public et la liberté individuelle dans le cadre de la manifestation de la vérité. Pour cela, le législateur doit instituer des contrepoids aux mesures privatives de liberté avant jugement (des mesures de milieu fermé ou ouvert) afin de permettre à la personne mise en cause de contrebalancer l’accusation. Dans ce cadre, les personnes privées de liberté doivent bénéficier des garanties judiciaires en vue de contester l’accusation, c’est-à-dire les charges retenues contre elles dans les procédures d’enquête et de l’information, par la voie de contrôle institutionnel afin d’éviter des détentions excessives et arbitraires. C’est ainsi que cette étude analyse l’équilibre des droits entre les parties, c’est-à-dire entre le ministère public et la personne mise en cause, dans la phase de l’avant-procès pénal au sein des politiques criminelles française et haïtienne<br>The preparatory phase of the criminal trial is characterized by the presumption of innocence in the application of custodial measures. In this regard, the alleged must in some degree be exempted from custody (removal of freedom) because of his status of “presumed innocent” within the definition of the rights to freedom. However, in the contemporary criminal proceedings, custodial measures are taken before trials in order to seek evidence of the truth, safeguard social peace and secure the criminal trial.This derogation from the principle of freedom expresses the need for custodial measures in the pre-trial phase. In this context, the modern criminal procedure is based on the balance between the right to freedom and the protection of the general interest. This the way that the French and Haitian criminal laws establish measures involving removal of freedom prior to trials to relativize the right to freedom during the procedures of investigation and information.This research work is part of this judicial balance in matters of custody prior to trial. Indeed, this study tends to expose the necessity of the removal of freedom before trial and the correlation between the safeguard of public safety and individual freedom in the context of the search of evidence of the truth. Consequently, French and Haitian criminal policies establish a counterweight to the custodial measures prior to trial (closed or open environment measures) in order to allow the alleged to counterbalance the allegations. Thus, custodians must benefit fromjudicial guarantees in order to appeal the allegations, that is to say the charges brought against them, in the procedures of investigation and information, by means of institutional control in order to avoid excessive, arbitrary and illegal detentions. This is how our study analyzes the balance of rights between the parties : the public prosecutor (prosecutor) and the accused person, in the phase of the criminal pre-trial within the French and Haitian criminal policies
5
Handke, Dagmar. "Graphs with distance guarantees /." [S.l. : s.n.], 1999. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8282292.
Повний текст джерела
6
Elías, Naranjo Silvana Patricia. "Treatment of Guaranteed Indebtedness Allowed in Airport Transportation Infrastructure Concession Contracts." Derecho & Sociedad, 2016. http://repositorio.pucp.edu.pe/index/handle/123456789/118824.
Повний текст джерелаАнотація:
Taking in account the need of financing of inversions to be done by the concessionaires on the frame of concession contracts, this article develops the treatment of Guaranteed Indebtedness Allowed in the concession contracts on airport matter, which general concepts are also applicable to other types of public use transport infrastructure. In this way, the concept of Creditor Allowed is explained, and the guarantees that can be given in the frame of the referred Indebtedness are analyzed, making a comparison of these concepts in the different concession contracts.<br>Teniendo en consideración la necesidad de financiamiento a las inversiones a ser realizadas por los concesionarios en el marco de los contratos de concesión, en el presente artículo se desarrolla el tratamiento de los Endeudamientos Garantizados Permitidos en los contratos de concesión de infraestructura aeroportuaria, siendo los conceptos generales desarrollados en el mismo, aplicables a los demás tipos de infraestructura de transporte de uso público.De esta manera, se explica, además, el concepto de Acreedor Permitido y se analizan las garantías que pueden ser otorgadas en el marco de los citados Endeudamientos, realizando una comparación sobre el tratamiento de estos conceptos en los distintos contratos de concesión.
7
Bertrams, Roeland I. V. F. "Bank guarantees in international trade /." Amsterdam : Nibe [u.a.], 1993. http://www.gbv.de/dms/spk/sbb/recht/toc/277508355.pdf.
Повний текст джерела
8
Kuperman, Gregory. "Network protection with service guarantees." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82471.
Повний текст джерелаАнотація:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2013.<br>This electronic version was submitted and approved by the author's academic department as part of an electronic thesis pilot project. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from department-submitted PDF version of thesis.<br>Includes bibliographical references (p. 167-174).<br>With the increasing importance of communication networks comes an increasing need to protect against network failures. Traditional network protection has been an "all-or-nothing" approach: after any failure, all network traffic is restored. Due to the cost of providing this full protection, many network operators opt to not provide protection whatsoever. This is especially true in wireless networks, where reserving scarce resources for protection is often too costly. Furthermore, network protection often does not come with guarantees on recovery time, which becomes increasingly important with the widespread use of real-time applications that cannot tolerate long disruptions. This thesis investigates providing protection for mesh networks under a variety of service guarantees, offering significant resource savings over traditional protection schemes. First, we develop a network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within the network. Our scheme guarantees that a fraction q of each demand remains after any single-link failure, at a fraction of the resources required for full protection. We develop both a linear program and algorithms to find the minimum-cost capacity allocation to meet both demand and protection requirements. Subsequently, we develop a novel network protection scheme that provides guarantees on both the fraction of time a flow has full connectivity, as well as a quantifiable minimum grade of service during downtimes. In particular, a flow can be below the full demand for at most a maximum fraction of time; then, it must still support at least a fraction q of the full demand. This is in contrast to current protection schemes that offer either availability-guarantees with no bandwidth guarantees during the down-time, or full protection schemes that offer 100% availability after a single link failure. We show that the multiple availability guaranteed problem is NP-Hard, and develop solutions using both a mixed integer linear program and heuristic algorithms. Next, we consider the problem of providing resource-efficient network protection that guarantees the maximum amount of time that flow can be interrupted after a failure. This is in contrast to schemes that offer no recovery time guarantees, such as IP rerouting, or the prevalent local recovery scheme of Fast ReRoute, which often over-provisions resources to meet recovery time constraints. To meet these recovery time guarantees, we provide a novel and flexible solution by partitioning the network into failure-independent "recovery domains", where within each domain, the maximum amount of time to recover from a failure is guaranteed. Finally, we study the problem of providing protection against failures in wireless networks subject to interference constraints. Typically, protection in wired networks is provided through the provisioning of backup paths. This approach has not been previously considered in the wireless setting due to the prohibitive cost of backup capacity. However, we show that in the presence of interference, protection can often be provided with no loss in throughput. This is due to the fact that after a failure, links that previously interfered with the failed link can be activated, thus leading to a "recapturing" of some of the lost capacity. We provide both an ILP formulation for the optimal solution, as well as algorithms that perform close to optimal.<br>by Gregory Kuperman.<br>Ph.D.
9
Kratz, Gutstav. "Risk Modelling in Payment Guarantees." Thesis, KTH, Matematisk statistik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229418.
Повний текст джерелаАнотація:
The Swedish Export Credit Agency (EKN) issues payment guarantees to Swedish companies who face the risk of non-payments in export transactions. Commitments are typically correlated, as defaults of companies are driven by other factors than factors specific to that company, such as the economic cycle or the regional conditions. In deciding upon how much capital to be reserved to remain solvent even in an unlikely scenario, this has to be accounted for in order to not underestimate financial risks.By studying models for credit risk and the research available in the area, the popular CreditRisk+ has been chosen as a suitable model for EKN to use in risk assessments. The model together with a few customizations are described in detail and tested on data from EKN.<br>Exportkreditnämnden (EKN) utfärdar betalningsgarantier till svenska exportörer som riskerar inställda betalningar. Fallissemang hos olika motparter är typiskt korrelerade. Vid bedömning av risken i portföljen av garantier måste detta tas i beaktning, för att inte underskatta risken väsentligt. Genom att studera befintliga kreditriskmodeller och tillgänglig forskning inom området har en modell föreslagits som kan användas i EKN:s riskbedömningar. Modellen beskrivs i detalj och testas på data från EKN.
10
Mustafa, Mohamed. "Guaranteed SLAM : an interval approach." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/guaranteed-slaman-interval-approach(50242329-e0fa-43dd-881b-6719c5504231).html.
Повний текст джерелаАнотація:
The mapping problem is a major player in mobile robotics, and it is essential for many real applications such as disaster response or nuclear decommissioning. Generally, the robotic mapping is addressed under the umbrella of simultaneous localization and mapping (SLAM). Several probabilistic techniques were developed in the literature to approach the SLAM problem, and despite the good performance, their convergence proof is only limited to linear Gaussian models. This thesis proposes an interval SLAM (i-SLAM) algorithm as a new approach that addresses the robotic mapping problem in the context of interval methods. The noise of the robot sensor is assumed bounded, and without any prior knowledge of its distribution, we specify soft conditions that guarantee the convergence of robotic mapping for the case of nonlinear models with non-Gaussian noise. A new theory about compact sets is developed in the context of real analysis to conclude such conditions. Then, a case study is presented where the performance of i-SLAM is compared to the probabilistic counterparts in terms of accuracy and efficiency. Moreover, this work presents an application for i-SLAM using an RGB-D sensor that operates in unknown environments. Interval methods and computer vision techniques are employed to extract planar landmarks in the environment. Then, a new hybrid data association approach is developed using a modified version of bag-of-features method to uniquely identify different landmarks across timesteps. Finally, the results obtained using the proposed data association approach are compared to the typical least-squares approaches, thus demonstrating the consistency and accuracy of the proposed approach.
11
Frye, Samantha. "Satisfaction guaranteed and other stories." FIU Digital Commons, 2004. http://digitalcommons.fiu.edu/etd/3421.
Повний текст джерелаАнотація:
SATISFACTION GUARANTEED AND OTHER STORIES was a collection of dark short fiction that explored the nature of hubris. Hubris was not limited to the definition of overbearing pride and arrogance, but bore a connection to love, curiosity, greed, and covetousness. In each story, the main characters' hubris sparked a desire that often lead to extreme actions. The stories' characters ranged in age from five years to centuries old. Their backgrounds were also diverse: a condemned spirit, a sculptor, a succubus posing as a psychiatrist and her empathic patient, a Rosarian, an entomologist, and a mural artist, The plots of the stories were simple and drawn from elements of myth and legend. In the essence of Edgar Allan Poe and Henry James, the stories developed the uncanny to give introspection concerning the darker human qualities.
12
Cadena, Jose Eduardo. "Finding Interesting Subgraphs with Guarantees." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/81960.
Повний текст джерелаАнотація:
Networks are a mathematical abstraction of the interactions between a set of entities, with extensive applications in social science, epidemiology, bioinformatics, and cybersecurity, among others. There are many fundamental problems when analyzing network data, such as anomaly detection, dense subgraph mining, motif finding, information diffusion, and epidemic spread. A common underlying task in all these problems is finding an "interesting subgraph"; that is, finding a part of the graph---usually small relative to the whole---that optimizes a score function and has some property of interest, such as connectivity or a minimum density.
Finding subgraphs that satisfy common constraints of interest, such as the ones above, is computationally hard in general, and state-of-the-art algorithms for many problems in network analysis are heuristic in nature. These methods are fast and usually easy to implement. However, they come with no theoretical guarantees on the quality of the solution, which makes it difficult to assess how the discovered subgraphs compare to an optimal solution, which in turn affects the data mining task at hand. For instance, in anomaly detection, solutions with low anomaly score lead to sub-optimal detection power. On the other end of the spectrum, there have been significant advances on approximation algorithms for these challenging graph problems in the theoretical computer science community. However, these algorithms tend to be slow, difficult to implement, and they do not scale to the large datasets that are common nowadays.
The goal of this dissertation is developing scalable algorithms with theoretical guarantees for various network analysis problems, where the underlying task is to find subgraphs with constraints. We find interesting subgraphs with guarantees by adapting techniques from parameterized complexity, convex optimization, and submodularity optimization. These techniques are well-known in the algorithm design literature, but they lead to slow and impractical algorithms. One unifying theme in the problems that we study is that our methods are scalable without sacrificing the theoretical guarantees of these algorithm design techniques. We accomplish this combination of scalability and rigorous bounds by exploiting properties of the problems we are trying to optimize, decomposing or compressing the input graph to a manageable size, and parallelization.
We consider problems on network analysis for both static and dynamic network models. And we illustrate the power of our methods in applications, such as public health, sensor data analysis, and event detection using social media data.<br>Ph. D.
13
Memari, Pooran. "Geometric tomography with topological guarantees." Nice, 2010. http://www.theses.fr/2010NICE4053.
Повний текст джерелаАнотація:
Le sujet de cette thèse porte sur la reconstruction de formes `a partir de coupes planaires. Dans de nombreux domaines d’application, il est nécessaire de reconstruire des formes à partir de sections. L’importance du sujet en imagerie médicale a conduit, depuis les années 1990, à des résultats importants qui sont cependant pour la plupart limités au cas de sections parallèles. Pourtant en échographie, les données obtenues au moyen d’une sonde guidée manuellement, forment une série d’images représentant des coupes de l’organe par des plans non parallèles. Cette application directe motivait le sujet de ma thèse. Dans cette thèse nous considérons le problème de la reconstruction d’une 3-variété `a bord plongée dans R3, à partir de ses intersections avec un ensemble de plans en positions arbitraires, appelées coupes. C’est pour la première fois que ce problème est étudié en toute généralité, dans le but de fournir des garanties théoriques satisfaisantes sur le résultat de la reconstruction. Aucune garantie théorique n’a été obtenue même pour le cas de coupes parallèles avant cette thèse. Dans le premier chapitre de ce manuscrit, nous étudions la méthode de reconstruction proposée par Liu et al. En 2008. Nous prouvons que si certaines conditions d’échantillonnage sont vérifiées, cette méthode permet de reconstruire la topologie de l’objet `a partir des coupes données. Nous prouvons également que l’objet reconstruit est homéomorphe (et isotope) à l’objet. Le deuxième chapitre présente une nouvelle méthode de reconstruction en utilisant le diagramme de Voronoi des sections. Cette méthode permet d’établir plus de connections entre les sections par rapport `a la première méthode. Favoriser les connections entre les sections est motivé par la reconstruction d’objets fins `a partir de sections peu denses. Nous présentons des conditions d’échantillonnage qui sont adaptées aux objets fins et qui permettent de prouver l’équivalence homotopique entre l’objet reconstruit et l’objet de départ. En effet, nous prouvons que si les plans de coupe sont suffisamment transversales `a l’objet, notre méthode de reconstruction est topologiquement valide et peut traiter des topologies complexes des sections avec plusieurs branchements. Dans le dernier chapitre de ce manuscrit, nous présentons une autre méthode de reconstruction qui permet d’établir encore plus de connections entre les sections en comparant avec les deux premières méthodes. Notre méthode est basée sur la triangulation de Delaunay et suit une approche duale en considérant le diagramme de Voronoi des sections. L’algorithme correspondant a été implémenté en C++, en utilisant la bibliothèque CGAL. Les résultats de la reconstruction obtenus par cet algorithme sont très satisfaisants pour les topologies complexes des sections. En se basant sur les études que nous avons développées durant cette thèse, nous espérons pouvoir fournir un fondement solide pour le processus d’acquisition et de reconstruction des données échographiques afin d’avoir un logiciel fiable pour les diagnostics<br>The purpose of this doctoral thesis is to provide a method to reconstruct three dimensional shapes from cross-sections. The principal motivation is 3D reconstruction of organs that is widely considered to be an important diagnostic aid in the medical world. However, the actual simulation results, namely in 3D ultrasonic simulation, are not reliable to be used in diagnosis. This thesis is the first geometric analysis of the reliability and the validity of reconstruction methods from cross-sectional data. Even in the case of parallel sections, no formal analysis and guarantees had been obtained before this thesis. More formally, we consider the problem of reconstructing a compact 3-manifold (with boundary) embedded in R3 from its cross-sections with a given set of cutting planes having arbitrary orientations. The first Chapter of this manuscript is devoted to analyzing a method presented by Liu et al. In 2008. We prove that under appropriate sampling conditions, the resulting reconstructed object is homeomorphic (and isotopic) to the original object. In the second chapter, we present a second reconstruction method that makes use of the Voronoi diagram of the sections. This method performs more connections between the sections comparing to the first method. Increasing the connectivity between the sections is motivated by reconstructing tree-like structures from sparse sectional data. The provided sampling conditions, leading to topological guarantees, are adapted to tree-like structures: Indeed, we show that if the cutting planes are sufficiently transversal to the surface we want to reconstruct, then the method can handle complex branching structures. Finally, in the third chapter, we show how the Voronoi-Delaunay duality allows us to perform still more connections between the sections comparing to the two first methods. The preliminary experimental results are quite promising, e. G. , regarding the practicality of the approach to reconstruct complex cross-sectional branching situations such as the coronary arterial tree. The hope is that the theoretical studies provided in this thesis will be a first step to provide solid foundations and theoretical guarantees for medical diagnostic software
14
Baumann, Manuela. "Swiss Pension Funds - Interest Guarantee." St. Gallen, 2005. http://www.biblio.unisg.ch/org/biblio/edoc.nsf/wwwDisplayIdentifier/01648484002/$FILE/01648484002.pdf.
Повний текст джерела
15
Zhang, Liping. "Three essays on low-price guarantees." Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/29275.
Повний текст джерелаАнотація:
This thesis consists of three essays and one literature review. The thesis examines theoretically the effects of Low-Price Guarantees (LPGs), which are increasingly common in retail markets and goods industries. Although the essays in this thesis share a common theme, they can be read independently without impeding the readers' understanding of the issues discussed in each.
The first essay studies the effects of LPGs in the search model of Salop and Stiglitz (1977). This model provides a general framework for the comparison of Matching Competition Clauses (MCCs) and Beating Competition Clauses (BCCs): The number of firms in the market is determined by free entry and consumers have incomplete information about prices and differ in their search costs. It is shown that MCCs have stronger collusive effects than BCCs, however, these effects evaporate with the introduction of an arbitrarily small hassle cost.
The second essay extends the Milgrom and Robers model (1982) to study the entry deterrence effects of LPGs. In this model, the potential entrant has no complete information about the true unit cost of the incumbent. It is demonstrated that under certain conditions, the high-cost incumbent can imitate the behavior of the low-cost one and deter entry even in situations where this would not be possible in the absence of a price guarantee. Therefore, the corresponding policy suggestion is to prohibit this pricing behavior when it is exerted by a monopolist.
The third essay studies LPGs in a partial equilibrium model, where consumers can search for lower prices but search takes time and thus delays consumption. A price guarantee to match any lower price offered by the retailer allows a consumer to purchase and consume now while keeping the option of reaping the benefit of a lower price that he may find later in time. The analysis demonstrates how the following two factors, the variability of market prices and the percentage of bargain hunters, affect the decisions that a firm needs to make in setting its price and the duration of its price guarantee in a competitive environment.
16
Sun, Liwen, and 孙理文. "Mining uncertain data with probabilistic guarantees." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45705392.
Повний текст джерела
17
Plácido, Alex. "Family model guaranteed in 1993 Constitution." Pontificia Universidad Católica del Perú, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/115446.
Повний текст джерелаАнотація:
This article describes interaction among constitutional law, international law of human rights and family law based on human rights extensive role. In family law field, involving family model and constitutional protection, it is clear to notice the influence of permanent dialogue among those three areas becoming as the main factor of family law evolution. The author emphasizes the deep transformation experienced by “family” notion through history and in fact that change shall keep happening, which does not necessarily mean that all forms of living in family shall have the same level of legal coverage. However, it should result in a minimum level of protection marked by human rights recognition.<br>Este artículo describe la interacción entre el derecho constitucional, el derecho internacional de los derechos humanos y el derecho de familia, cuyo fundamento es el papel extensivo de los derechos humanos. En el ámbito del derecho de familia —que implica el modelo de familia y la protección constitucional de la que goza— se ve la incidencia de este diálogo permanente entre las tres áreas, que llega a constituirse en el principal motor de la evolución del derecho de familia. El autor concluye señalando que lo que conocemos como «familia» ha experimentado una transformación profunda a través de la historia y que el cambio en su contenido seguirá variando. Esto no significa que todas las formas de vivir en familia vayan a gozar del mismo grado de cobertura legal, pero sí que debe traducirse en la existencia de un piso mínimo de protección signado por el reconocimiento de los derechos humanos.
18
Iqbal, Muhammad Sohail. "Continuum robot modeling with guaranteed approach." Thesis, Paris Est, 2010. http://www.theses.fr/2010PEST1027.
Повний текст джерелаАнотація:
Contrairement aux robots conventionnels, les robots continuums ne possèdent ni de liaisons discrètes, ni de corps rigides. Leur courbure est continue, similaire à celle des trompes ou des tentacules animales. Le développement de ce type de robots pour les applications médicales soulève plusieurs problèmes : optimisation de la conception, modélisation cinématique, choix des capteurs et commande en temps réel. Les techniques actuelles pour la modélisation des robots continuums ne tiennent pas compte les incertitudes inhérentes au système. La prise en compte de ces incertitudes est d'une importance cruciale pour la certification de tels robots utilisés pour les gestes chirurgicaux. Dans cette thèse, nous considérons un micro robot continuum à 3 actionneurs. Ce robot a été développé au laboratoire LISSI pour le traitement des anévrismes de l'aorte abdominale par chirurgie mini-invasive. Dans ce type de chirurgie, il est important de disposer d'un modèle cinématique garanti du robot continuum prenant en compte différents types d'incertitudes. Pour traiter ce problème, nous utilisons les techniques d'analyse par intervalles. Ces techniques permettent de résoudre des problèmes d'optimisation globale sous contraintes tout en prenant en compte des incertitudes aussi bien aléatoires que systématiques. La contribution de cette thèse porte sur la proposition d'un modèle cinématique d'un robot continuum prenant en compte des incertitudes liées à différents facteurs comme les erreurs d'arrondis, les erreurs paramétriques et les erreurs dues aux hypothèses de modélisation. Tout d'abord, nous développons les modèles géométriques direct et inverse du robot continuum sous forme de solutions de formes fermées. Ces solutions sont utilisées pour caractériser les différentes propriétés du robot comme la manipulabilité. Pour calculer la cinématique inverse garantie et optimale, nous appliquons une version améliorée de l'algorithme par séparation et évaluation (Branch and Bound). En considérant l'orientation du robot, la cinématique inverse est ramenée à la formulation et à la résolution par intervalles d'un problème d'optimisation sous contraintes. Les approches proposées sont validées par des simulations. Les résultats de cette thèse constituent un cadre général pour la modélisation garantie de la classe des robots continuums dont la forme est décrite par des actionneurs en flexion continue<br>Unlike conventional robots, continuum robots do not contain any rigid link or any rotational joint but present a continuous bending in the structure through smooth motion. Development of this class of robot for their medical application presents a common set of problems : optimization of design, kinematic modeling, sensing choice, and their control in real time. Existing techniques for the modeling of continuum robots do not take system uncertainties into account. A proper handling of these uncertainties becomes of crucial importance for the certification of such robots used as medical devices. For our research, we consider a continuum robot that has been developed for the treatment of aortic aneurysm by Minimal Invasive Surgery (MIS), in LISSI Lab. In the context of MIS, it is very important to develop a guaranteed kinematic model of robot taking into account the different types of un-certainties. To handle this problem, we use the techniques of interval analysis. These techniques are capable of performing the global optimization and solving CSPs while taking into account the different uncertainties ; no matter, whether these uncertainties are random or systematic. Contribution of this thesis is proposal of a continuum robot's kinematic model that can take system uncertainties due to different factors such as rounding errors, parametric errors, and errors due to modeling assumptions. Initially, we develop the forward and inverse kinematics of the continuum robot in closed-form formulas. These derived formulas are used for the characterization of different properties of the robot such as manipulability. To find optimized guaranteed kinematics, we retained and applied an enhanced version of branch and bound algorithm. The inverse kinematics was formulated and resolved as a constrained optimization problem for robot's orientation. The proposed approaches are validated through simulations. The results of this thesis give rise to a general framework that is valid to handle the system uncertainties for the entire class of continuum robot that are shaped by continuously bending actuators
19
Ren, Shaolei. "Cooperative wireless networks with QoS guarantees /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20REN.
Повний текст джерела
20
Rajani, Meena. "Application Server Caching with Freshness Guarantees." Thesis, The University of Sydney, 2013. http://hdl.handle.net/2123/9730.
Повний текст джерелаАнотація:
Dynamic websites rely on caching and clustering to achieve high performance and scalability. But while queries benefit from such middle-tier caching, updates introduce a distributed cache consistency problem. In addition, even a high cache hit ratio is not beneficial if the cached data is either not fresh or not consistent enough. We have proposed Multi-Object Freshness-Aware Caching (MOFAC): MOFAC tracks the freshness of the cached data and allows clients to explicitly trade data freshness for faster response times. In the first part of this thesis, we introduce the core MOFAC caching algorithm. MOFAC provides clients a consistent snapshot of data with reduced response time if the client agrees to lower its data freshness expectation. The MOFAC algorithm has been implemented in the Java EE application server cache and the evaluation with an exemplified bookshop application shows that client requests for complex objects can clearly benefit from this approach. For example, for a 20% update ratio, MOFAC can almost double the throughput if clients agree to access up-to 90 seconds old data. The second part of the thesis deals with queries which access several complex objects in a transaction. These queries, which touch more than one complex object in a request, can also benefit from reduced latency by agreeing to receive response with relaxed consistency. To cater for these queries we have extended the MOFAC to work with relaxed consistency for distributed queries. This thesis introduces both the corresponding theoretical concepts for group valid interval and group consistency, and also devises concrete distributed algorithms for MOFAC and MOFAC with relaxed consistency. These algorithms are implemented in a distributed caching system based on the Java EE standard. The evaluation shows that these new freshness and consistency guarantees come for only a reasonable overhead as compared to standard cache invalidation.
21
Bellet, Aurélien. "Supervised metric learning with generalization guarantees." Phd thesis, Université Jean Monnet - Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00770627.
Повний текст джерелаАнотація:
In recent years, the crucial importance of metrics in machine learningalgorithms has led to an increasing interest in optimizing distanceand similarity functions using knowledge from training data to make them suitable for the problem at hand.This area of research is known as metric learning. Existing methods typically aim at optimizing the parameters of a given metric with respect to some local constraints over the training sample. The learned metrics are generally used in nearest-neighbor and clustering algorithms.When data consist of feature vectors, a large body of work has focused on learning a Mahalanobis distance, which is parameterized by a positive semi-definite matrix. Recent methods offer good scalability to large datasets.Less work has been devoted to metric learning from structured objects (such as strings or trees), because it often involves complex procedures. Most of the work has focused on optimizing a notion of edit distance, which measures (in terms of number of operations) the cost of turning an object into another.We identify two important limitations of current supervised metric learning approaches. First, they allow to improve the performance of local algorithms such as k-nearest neighbors, but metric learning for global algorithms (such as linear classifiers) has not really been studied so far. Second, and perhaps more importantly, the question of the generalization ability of metric learning methods has been largely ignored.In this thesis, we propose theoretical and algorithmic contributions that address these limitations. Our first contribution is the derivation of a new kernel function built from learned edit probabilities. Unlike other string kernels, it is guaranteed to be valid and parameter-free. Our second contribution is a novel framework for learning string and tree edit similarities inspired by the recent theory of (epsilon,gamma,tau)-good similarity functions and formulated as a convex optimization problem. Using uniform stability arguments, we establish theoretical guarantees for the learned similarity that give a bound on the generalization error of a linear classifier built from that similarity. In our third contribution, we extend the same ideas to metric learning from feature vectors by proposing a bilinear similarity learning method that efficiently optimizes the (epsilon,gamma,tau)-goodness. The similarity is learned based on global constraints that are more appropriate to linear classification. Generalization guarantees are derived for our approach, highlighting that our method minimizes a tighter bound on the generalization error of the classifier. Our last contribution is a framework for establishing generalization bounds for a large class of existing metric learning algorithms. It is based on a simple adaptation of the notion of algorithmic robustness and allows the derivation of bounds for various loss functions and regularizers.
22
Leighton, Glenn Robert. "Guarantee based finance for export credits." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320815.
Повний текст джерела
23
Kayembe, Grace Longwa. "The Fraud Exception in Bank Guarantee." Master's thesis, University of Cape Town, 2014. http://hdl.handle.net/11427/4645.
Повний текст джерела
24
Boyer, Eric B. "Multicast communication with guaranteed quality of service." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA277650.
Повний текст джерелаАнотація:
Thesis (M.S. in Electrical Engineering and Electrical Engineer) Naval Postgraduate School, December 1993.<br>Thesis advisor(s): Shridhar B. Shukla. "December 1993." Includes bibliographical references. Also available online.
25
Dahlfors, Gunnar, and Peter Jansson. "Essays in financial guarantees and risky debt." Doctoral thesis, Handelshögskolan i Stockholm, Finansiell Ekonomi (FI), 1994. http://urn.kb.se/resolve?urn=urn:nbn:se:hhs:diva-887.
Повний текст джерелаАнотація:
This dissertation consists of six separate papers dealing with the valuation of financial guarantees and risky debt contract. Each of these papers is independent and distinct. The main theme is the valuation of securities by contingent claims analysis (CCA). Paper 1: Valuation of Financial Guarantees – A Presentation and a Critique.One purpose of this paper is to derive a pricing formula for a deposit guarantee, when the assets of the bank exhibit downward jumps due to extraordinary loan defaults. In this respect, we use the framework of Merton (1976), where a stock option is priced under the assumption of a jump-diffusion process for the underlying stock. Paper 2: Valuation of Deposit Insurance – An Alternative Approach.This paper extends paper 1 in the respect that the guarantor, in this case a deposit insurance agency, will nullify the guarantee contract and liquidate the bank when it gets insolvent. The liquidation is assumed to involve some costs like legal and realization costs. In fact, since the guarantee contract will never get in-the-money, the guarantee will receive value only from these liquidation costs. Paper 3: Financial Guarantees and Asymmetric Information.In this paper, we make the assumption that the guarantor cannot observe the solvency process, unless it carries out audits. This is different from the normal perfect information assumption for this kind of analysis. Since audits are often costly, and this burdens the guarantee value, the guarantor will search for an audit strategy, which minimizes the guarantee value. Paper 4: Valuation of Barrier Contracts – A Simplified Approach.Many types of financial contracts can be classified as "barrier contracts". This description comes from their feature of allowing either contractual part to take some kind of action during the lifetime of the contract contingent on some pre-specified event. In this sense, the deposit insurance contract in analysed in paper 2 can be regarded as a barrier contract. The previous valuation models of barrier contracts are often considerably advanced and have tended to obscure the underlying economics. It is the path-dependence and stopping-time features that primarily make the derivation of these pricing formulas complicated. Our model simplifies this procedure by deriving the important "first passage time" distribution from a binomial model instead of using the reflection principle. Paper 5: Valuation of Risky Debt in the Presence of Jumps, Safety Barriers and Collaterals.This paper deals with different aspects of risky debt valuation with the CCA approach. The term. "risky", refers to the probability of default on the promised payment by the borrower. Paper 6: Portfolio Selection and the Pricing of Personal Loan Contracts.The CCA literature that follows Black and Scholes (1973), has mainly taken the underlying asset dynamics for given. Although it may be appropriate for stock options, we consider this assumption too simplifying with regards to personal loan contracts. It is obvious that the borrower’s consumption-investment decision affects his wealth process, on which the loan contract is contingent. Moreover, we believe that individuals actually have preferences to repay loans for different reasons such as the existence of reputational costs or legal penalties that affect the borrower in case of loan default.<br>Diss. av båda förf. Stockholm : Handelshögskolan
26
Karakozis, Pantelis. "Valuation and optimal allocation of loan guarantees." Thesis, Imperial College London, 1997. http://hdl.handle.net/10044/1/8061.
Повний текст джерела
27
Sember, Jeffery. "Guarantees concerning geometric objects with imprecise points." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/38084.
Повний текст джерелаАнотація:
Traditional geometric algorithms are often presented as if input imprecision does not exist, even though it is often unavoidable. We argue that in some cases, it may be desirable for geometric algorithms to treat this imprecision as an explicit component of the input, and to reflect this imprecision in the output. Starting with three problems from computational geometry whose inputs are planar point sets (Voronoi diagrams, convex hulls, and smallest bounding discs), we recast these as problems where each input point's location is imprecise, but known to lie within a particular region of uncertainty. Where algorithms to solve each of the original problems produce a single geometric object as output, the algorithms that we present typically produce either guaranteed or possible output objects. A guaranteed object represents qualities that can be guaranteed for every point set that is consistent with the uncertain regions, and a possible object represents qualities that exist for at least one such point set. By dealing with input imprecision explicitly, these guaranteed and possible objects can represent a more accurate view of what can be reliably inferred from the input data.
28
Weinberg, Daniela [Verfasser]. "Deciding Service Substitution - Termination guaranteed / Daniela Weinberg." München : Verlag Dr. Hut, 2012. http://d-nb.info/1029399352/34.
Повний текст джерела
29
Haydock, Jennifer. "Price-matching guarantees and imperfect consumer information." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.508417.
Повний текст джерела
30
Aiylam, Dhroova (Dhroova S. ). "Parameter estimation in HMMs with guaranteed convergence." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119735.
Повний текст джерелаАнотація:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (page 47).<br>The EM (Expectation-Maximization) algorithm is a heuristic for parameter estimation in statistical models with latent variables, where explicit computation of the maximum likelihood estimate (MLE) is infeasible. Although widely used in practice, the theoretical guarantees associated with EM are quite weak. We study the setting of a hidden Markov model (HMM) with two hidden states, where the (symmetric) transition matrix [mu] is unknown and observations are Gaussian with known covariance and unknown mean [mu]. The EM algorithm for HMMs, also known as the Baum-Welch algorithm, was previously studied by Yang, Balakrishnan, and Wainwright [1] but without global convergence guarantees. In this paper we propose a "local" version of the EM algorithm and prove absolute convergence of this algorithm to the true parameters ([mu], E) in both the population and finite-sample regime. To the best of our knowledge this is the first algorithm for simultaneous parameter estimation with global convergence guarantees. Additionally, we prove several theoretical results and supply some counterexamples for the ordinary Baum-Welch algorithm in this setting.<br>by Dhroova Aiylam.<br>M. Eng.
31
Kanno, Masaaki. "Guaranteed accuracy computations in systems and control." Thesis, University of Cambridge, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615686.
Повний текст джерела
32
Asif, Muhammad Haseeb. "FlinkNDB : Guaranteed Data Streaming Using External State." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291361.
Повний текст джерелаАнотація:
Apache Flink is a stream processing framework that provides a unified state management mechanism which, at its core, treats stream processing as a sequence of distributed transactions. Flink handles failures, re-scaling and reconfiguration seamlessly via a form of a two-phase commit protocol that periodically commits all past side effects consistently into the state backends. This involves invoking and combining checkpoints and, in time of need, redistributing the state to resume data pipelines. All the existing Flink state backend implementations, such as RocksDB, are embedded and coupled with the compute nodes. Therefore, recovery time is proportional to the state needed to be reconfigured and that can take from a few seconds to hours. If application logic is compute-heavy and Flink’s tasks are overloaded, scaling out compute pipeline means scaling out storage together with compute tasks and vice-versa because of the embedded state backends. It also introduces delays due to expensive state re-shuffle and moving large state on the wire. This thesis work proposes the decoupling of the state storage from compute to improve Flink’s scalability. It introduces the design and implementation of a new State backend, FlinkNDB, that decouples state storage from compute. Furthermore, we designed and implemented new techniques to perform snapshotting, and failure recovery to reduce the recovery time close to zero.<br>Apache Flink är ett strömbehandlingsramverk som tillhandahåller en enhetlig tillståndshanteringsmekanism som i sin kärna behandlar strömbehandling som en sekvens av distribuerade transaktioner. Flink hanterar fel, omskalning och omkonfigurering sömlöst via en form av ett tvåfas-engagemangsprotokoll som regelbundet begår alla tidigare biverkningar konsekvent i tillståndets backends. Detta innebär att man åberopar och kombinerar kontrollpunkter och vid behov omdistribuerar dess tillstånd för att återuppta dataledningar. Alla befintliga backendimplementeringar för Flink-tillstånd, som Rocks- DB, är inbäddade och kopplade till beräkningsnoderna. Därför är återhämtningstiden proportionell mot det tillstånd som behöver konfigureras om och det kan ta från några sekunder till timmar. Om applikationslogiken är beräkningstung och Flinks uppgifter är överbelastade, innebär utskalning av beräkningsrörledning att utskalning av lagring, tillsammans med beräkningsuppgifter och vice versa på grund av det inbäddade tillståndet i backend. Det introducerar också förseningar i förhållande till dyra tillståndsförflyttningar och flyttning av stora datamängder som upptar stora delar av bandbredden. Detta avhandlingsarbete föreslår frikoppling av tillståndslagring från beräkning för att förbättra Flinks skalbarhet. Den introducerar designen och implementeringen av ett nytt tillstånd i backend, FlinkNDB, som frikopplar tillståndslagring från beräkning. Avslutningsvis designade och implementerade vi nya tekniker för att utföra snapshotting och felåterställning för att minska återhämtningstiden till nära noll.
33
Wang, Zhan. "Guaranteed Localization and Mapping for Autonomous Vehicles." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS395.
Повний текст джерелаАнотація:
Avec le développement rapide et les applications étendues de la technologie de robot, la recherche sur le robot mobile intelligent a été programmée dans le plan de développement de haute technologie dans beaucoup de pays. La navigation autonome joue un rôle de plus en plus important dans le domaine de recherche du robot mobile intelligent. La localisation et la construction de cartes sont les principaux problèmes à résoudre par le robot pour réaliser une navigation autonome. Les techniques probabilistes (telles que le filtre étendu de Kalman et le filtre de particules) ont longtemps été utilisées pour résoudre le problème de localisation et de cartographie robotisées. Malgré leurs bonnes performances dans les applications pratiques, ils pourraient souffrir du problème d'incohérence dans les scénarios non linéaires, non gaussiens. Cette thèse se concentre sur l'étude des méthodes basées sur l'analyse par intervalles appliquées pour résoudre le problème de localisation et de cartographie robotisées. Au lieu de faire des hypothèses sur la distribution de probabilité, tous les bruits de capteurs sont supposés être bornés dans des limites connues. Sur la base d'une telle base, cette thèse formule le problème de localisation et de cartographie dans le cadre du problème de satisfaction de contraintes d'intervalle et applique des techniques d'intervalles cohérentes pour les résoudre de manière garantie. Pour traiter le problème du "lacet non corrigé" rencontré par les approches de localisation par ICP (Interval Constraint Propagation), cette thèse propose un nouvel algorithme ICP traitant de la localisation en temps réel du véhicule. L'algorithme proposé utilise un algorithme de cohérence de bas niveau et est capable de diriger la correction d'incertitude. Par la suite, la thèse présente un algorithme SLAM basé sur l'analyse d'intervalle (IA-SLAM) dédié à la caméra monoculaire. Une paramétrisation d'erreur liée et une initialisation non retardée pour un point de repère naturel sont proposées. Le problème SLAM est formé comme ICSP et résolu par des techniques de propagation par contrainte d'intervalle. Une méthode de rasage pour la contraction de l'incertitude historique et une méthode d'optimisation basée sur un graphique ICSP sont proposées pour améliorer le résultat obtenu. L'analyse théorique de la cohérence de la cartographie est également fournie pour illustrer la force de IA-SLAM. De plus, sur la base de l'algorithme IA-SLAM proposé, la thèse présente une approche cohérente et peu coûteuse pour la localisation de véhicules en extérieur. Il fonctionne dans un cadre en deux étapes (enseignement visuel et répétition) et est validé avec un véhicule de type voiture équipé de capteurs de navigation à l'estime et d'une caméra monoculaire<br>With the rapid development and extensive applications of robot technology, the research on intelligent mobile robot has been scheduled in high technology development plan in many countries. Autonomous navigation plays a more and more important role in the research field of intelligent mobile robot. Localization and map building are the core problems to be solved by the robot to realize autonomous navigation. Probabilistic techniques (such as Extented Kalman Filter and Particle Filter) have long been used to solve the robotic localization and mapping problem. Despite their good performance in practical applications, they could suffer the inconsistency problem in the non linear, non Gaussian scenarios. This thesis focus on study the interval analysis based methods applied to solve the robotic localization and mapping problem. Instead of making hypothesis on the probability distribution, all the sensor noises are assumed to be bounded within known limits. Based on such foundation, this thesis formulates the localization and mapping problem in the framework of Interval Constraint Satisfaction Problem and applied consistent interval techniques to solve them in a guaranteed way. To deal with the “uncorrected yaw” problem encountered by Interval Constraint Propagation (ICP) based localization approaches, this thesis proposes a new ICP algorithm dealing with the real-time vehicle localization. The proposed algorithm employs a low-level consistency algorithm and is capable of heading uncertainty correction. Afterwards, the thesis presents an interval analysis based SLAM algorithm (IA-SLAM) dedicates for monocular camera. Bound-error parameterization and undelayed initialization for nature landmark are proposed. The SLAM problem is formed as ICSP and solved via interval constraint propagation techniques. A shaving method for landmark uncertainty contraction and an ICSP graph based optimization method are put forward to improve the obtaining result. Theoretical analysis of mapping consistency is also provided to illustrated the strength of IA-SLAM. Moreover, based on the proposed IA-SLAM algorithm, the thesis presents a low cost and consistent approach for outdoor vehicle localization. It works in a two-stage framework (visual teach and repeat) and is validated with a car-like vehicle equipped with dead reckoning sensors and monocular camera
34
Choi, Ki-Seok. "Service level guarantee in capacitated supply chains." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/25583.
Повний текст джерела
35
Machado, Dias Diego. "Mechanising an algebraic rely-guarantee refinement calculus." Thesis, University of Newcastle upon Tyne, 2017. http://hdl.handle.net/10443/4016.
Повний текст джерелаАнотація:
Despite rely-guarantee (RG) being a well-studied program logic established in the 1980s, it was not until recently that researchers realised that rely and guarantee conditions could be treated as independent programming constructs. This recent reformulation of RG paved the way to algebraic characterisations which have helped to better understand the difficulties that arise in the practical application of this development approach. The primary focus of this thesis is to provide automated tool support for a rely-guarantee refinement calculus proposed by Hayes et. al., where rely and guarantee are defined as independent commands. Our motivation is to investigate the application of an algebraic approach to derive concrete examples using this calculus. In the course of this thesis, we locate and fix a few issues involving the refinement language, its operational semantics and preexisting proofs. Moreover, we extend the refinement calculus of Hayes et. al. to cover indexed parallel composition, non-atomic evaluation of expressions within specifications, and assignment to indexed arrays. These extensions are illustrated via concrete examples. Special attention is given to design decisions that simplify the application of the mechanised theory. For example, we leave part of the design of the expression language on the hands of the user, at the cost of the requiring the user to define the notion of undefinedness for unary and binary operators; and we also formalise a notion of indexed parallelism that is parametric on the type of the indexes, this is done deliberately to simplify the formalisation of algorithms. Additionally, we use stratification to reduce the number of cases in in simulation proofs involving the operational semantics. Finally, we also use the algebra to discuss the role of types in program derivation.
36
Erkinov, Otabek, and Отабек Ділшод угли Еркінов. "Aviation english as a guarantee of safety." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/50560.
Повний текст джерелаАнотація:
1. High Stakes in Language Proficiency. Flight Safety Digest, 2006, 25 (1-2). P.1-14 URL: https://flightsafety.org/aerosafety-world/publications/flight-safety-digest/ 2. Hamzah H., Fook Fei W. (2018) Miscommunication in Pilot-controller Interaction The Southeast Asian Journal of English Language Studies, 2018. 24(4) p. 199 – 213 3. Nemlii L. (2020) Aviation English Training for Aviation Personnel in Ukraine. Science and Education a New Dimension. – 2020. – № 235. – Р. 32-36 URL: https://www.researchgate.net/publication/345817750<br>English is the dominant language of aviation personal. Pilots and air traffic controllers controlling international flights have radio telephoning in Aviation English. They use a language which consists of Standard Phraseology and General English. The first is used in routine situations to be laconic and transmit information accurate. It is possible because words and phrases of Standard Phraseology have only one meaning. However, Standard Phraseology is not enough to control the air traffic in case of emergency situations. In this case General English is required.<br>Англійська мова є домінуючою мовою для комунікації авіаційного персоналу. Пілоти та диспетчери управління повітряного руху, що контролюють міжнародні рейси, ведуть радіообмін на авіаційній англійській мові. Вони використовують мову, яка складається із стандартної фразеології та загальної англійської мови. Перша використовується в рутинних ситуаціях, щоб бути лаконічним і передавати інформацію точно. Це можливо, оскільки слова та фрази Стандартної фразеології мають лише одне значення. Проте, стандартної фразеології недостатньо для управління повітряним рухом у надзвичайних ситуаціях. У цьому випадку потрібна загальна англійська мова.
37
Wiltsche, Clemens. "Assume-guarantee strategy synthesis for stochastic games." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:f4ec96ce-7032-4c5b-ac25-0e0b6764e3da.
Повний текст джерелаАнотація:
This thesis presents a framework for the automatic strategy synthesis from quantitative specifications, in order to control autonomous systems. We model systems as turn-based two-player zero-sum stochastic games, which are able to express both stochastic and nondeterministic environmental uncertainty. Given a system model and a specification, we define the strategy synthesis problem as that of finding a strategy for the system that is winning against every environment. Since large, complex systems are typically built from multiple components, we consider synthesis of strategies for the individual components separately, which can then be composed to a winning strategy for the full system. Modelling interaction between components is facilitated using assume-guarantee rules, which can express contracts such as "maintain the room temperature of at least 20°C, as long as the windows are closed at least 30% of the time." For the synthesis of strategies for the individual components, we develop synthesis algorithms for Boolean combinations of long-run objectives, specifically, maintaining above a threshold (i) a mean-payoff, almost surely; (ii) an expected mean-payoff; (iii) a ratio of rewards, almost surely; or (iv) a ratio of expected rewards. We implement our algorithms in the PRISM-games 2.0 tool and demonstrate their viability on four case studies.
38
Akbas, Mustafa Ilhan. "Evaluation Of Core Stateless Guaranteed Fair Network Architecture." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/2/12608027/index.pdf.
Повний текст джерелаАнотація:
The problem of providing Quality of Service (QoS) in the Internet has been an extremely active area of research and various mechanisms have been proposed related to this subject. Developing network applications have requirements such as bounded delay, jitter, minimum bandwidth and maximum loss rate. There is also a need to support large bandwidth networks because of growing link speeds. Previous QoS efforts did not fully satisfy all these needs of future networks but more recent approaches aim to be both scalable and rich in the provision of guaranteed services. Consequently core-stateless systems received much attention in recent years because of their scalability in supporting per-flow QoS. The property of not maintaining any per-flow state in the core routers is known as being core-stateless. In this thesis study, the need for core-stateless network architectures is pointed out and a literature survey about these schemes is carried out. Core-Stateless Guaranteed Fair (CSGF) network architecture, which provides deterministic fairness guarantees in a work-conserving manner, is selected and evaluated. Simulation studies about stateful Virtual Clock (VC) algorithm and CSGF&rsquo<br>s sub-protocols Core-Stateless Virtual Clock (CSVC), Core-Stateless Guaranteed Throughput (CSGT) and Core-Stateless Guaranteed Fairness (CSGF) are presented. Finally, the deficiencies in fairness of CSGF are demonstrated.
39
Björlin, Lidén Sara. "The Role of Service Guarantees in Managing Services." Doctoral thesis, Karlstads universitet, Institutionen för ekonomi, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-2573.
Повний текст джерелаАнотація:
Service guarantees have been argued to have many roles in managing services, for instance signal service quality, attract new customers, increase satisfaction and retention, and to differentiate the company from its competitors. Despite a growing interest from service organizations, research on service guarantees has been surprisingly scarce. The aim of this dissertation is to provide a wider understanding of the roles of service guarantees. Data is gathered from actual customers (as opposed to fictitious participants of an experiment) and/or employees regarding service guarantees in three different service contexts. The methods used to gather and analyze the data were manifold and includes personal interviews, Mystery Shopping observations, focus group interviews and a postal survey. The results represent new knowledge when it comes to the roles of service guarantees in managing services. Previous research has almost exclusively addressed pre-purchase effects of the service guarantee, but has failed to address the impact of the service guarantee after it has been used. Therefore, the most important contribution to service research of this dissertation concern the understanding of service guarantees “in action” and the post-use effects of a service guarantee in real service settings. Another contribution is the identification of the recovery paradox; that the customer is more satisfied with the service after he or she has used the service guarantee, than before he or she experienced the original service failure. This result strongly suggests that the use of a service guarantee can make a fruitful contribution in the managing of services.
40
Chen, Haiqing. "Providing packet-loss guarantees in differentiated services architectures." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59368.pdf.
Повний текст джерела
41
Chu, Jian. "New control-plane architecture for QoS-guaranteed Internet /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20CHU.
Повний текст джерела
42
Fuentes, Graciela. "Constitutional guarantees and normative limits to free communication." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=26444.
Повний текст джерелаАнотація:
The purpose of this work is to analyze the principles of human rights theory underlying the protection of freedom of expression and the normative limits imposed on communication. The analysis involves those principles argued in American and Canadian judicial review.<br>The curtailment of sexual expression is at the core of the discussion of the nature of human beings and their relationship with the state power. By analyzing the way in which governments ban sexual messages, one can infer with a great degree of accuracy how they will react toward other forms of expression. This connection can be established because arguments justifying restrictions on pornography may be extended to justify prohibitions on other form of communication.<br>Inasmuch as freedom of expression meets the basic need for communication inherent to autonomous and morally responsible individuals, any restriction on it must stem from the principle that rights-protection is the highest value as supreme law rather than from a majority assertion of what is good for the individual and society as a whole.
43
Tiwari, Prakriti. "Fulfilling efficiently SLA availability guarantees in backbone networks." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-27342.
Повний текст джерелаАнотація:
The availability and reliability of backbone networks is important tosociety. However, physical, software and unintentional human errorfailures affect the links and nodes in a backbone network. To overcomesuch failures in the network, recovery mechanisms such as Protectionand Restoration are utilized. Additionally, a concept of Service LevelAgreement (SLA) is introduced between the provider and the user whichdefines and guarantees the network availability requirements and penaltyschemes. In this thesis, fulfilling the SLA availability guarantee efficientlyin a backbone network is investigated.This thesis focuses on the problem of handling end-to-end path failureson backbone networks. Some of the popular existing recovery mechanismsto handle such failures are Dedicated Backup Path Protection (DBPP) andPath Restoration (PR). A high percentage of network survivability canbe achieved by DBPP with a reserved backup path for each provisionedconnection. Unfortunately, it is very costly and resource demanding.Whereas, a PR based solution consumes only the needed resources but itis very slow to recover from failure which might effect the SLA availabilityguarantee. The work in this thesis aims at providing a hybrid networkrecovery model that combines the benefits of both DBPP and PR. Thehybrid model switches between DBPP and PR according to the SLAavailability requirement over a contract period and the current networkconnection state (i.e. the remaining time of the SLA and current sum ofdowntimes (accumulated downtime)).Moreover, an analysis in the failure logs of UNINETT’s backbonenetwork is made to model the probability distribution of the accumulateddowntime that uses PR. A distribution fitting is made for modeling theconnection downtime data taken from UNINETT’s backbone networkwhere Weibull distribution proved to be a good approximation. Additionally,a model for distribution of accumulated downtime that usesDBPP for both non-simultaneous and simultaneous failures of the workingpath and backup path is provided. An in-depth explanation of howthese distributions models can be used in the design of hybrid models ispresented.Two hybrid models were approached in this thesis. The first hybridapproach used the DBPP scheme at the beginning of the SLA durationand then it switches to PR when the calculated SLA risk assessmentshows that the probability of violating the SLA requirement is lower attime t. The second hybrid approach used the PR scheme at the beginningof the SLA duration and then it switches to DBPP when the accumulateddowntime at time t reach near to the threshold of the SLA risk targetsuch that the probability of violating the SLA requirement is higher.The transition line which decides the switching between PR and DBPPare computed for each hybrid approach using the results obtained fromthe accumulated downtime distribution model of PR and DBPP. Thetransition line defined in this thesis provides information about when theconnection should switch between Protection and Restoration mechanismby knowing the network connection state. The computed transition lineswith a 1 percent SLA risk target is verified via discrete event simulationin DEMOS. The SLA risk target is the probability of failing the SLA,however the provider can tune the risk target by using an advancednetwork recovery mechanism (e.g Protection) for more or less time. Thesimulation results showed that the proposed hybrid models work well,fulfilling the SLA availability guarantee efficiently with respect to theresource utilization. In addition, the results also revealed that usingthe PR scheme at the beginning of the SLA contract provides threetimes better resource utilization than using the DBPP scheme at thebeginning. Cost analysis for network providers are made with differentSLA risk targets in order to find the optimal SLA risk target for networkproviders. The results from analysis suggested that the total cost fornetwork providers decreases with the increase of SLA risk target untilthe total cost reaches its minimum, then it starts to increase again.The result of this thesis might contribute to future research on developinga hybrid model to reach particular performance objectives incommunication networks.
44
Yang, Sheauwen. "Reserving, pricing and hedging for guaranteed annuity options." Thesis, Heriot-Watt University, 2001. http://hdl.handle.net/10399/1187.
Повний текст джерела
45
Roorda, Mauricio. "The role of guarantees in superior quality services." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/10710.
Повний текст джерела
46
謝宗佑. "Pricing guarantees linked to stochastic guaranteed rates of return." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/42827676966480017488.
Повний текст джерелаАнотація:
博士<br>國立政治大學<br>金融研究所<br>99<br>We derive the pricing formulas for the guarantees embedded in defined contribution (DC) pension plans with the guaranteed minimum rate of return set relative to a LIBOR interest rate. The guaranteed rate associated with a stochastic LIBOR interest rate has not yet been studied
in the relevant literature, particularly in the presence of stochastic interest rates. An extended LIBOR market model (LMM) is employed to price the interest rate guarantees embedded in DC pension plans under maturity and multi-period guarantees. The pricing formulas derived under
the extended LMM are more tractable and feasible for practice than those derived under the instantaneous short rate models or the HJM model. Calibration procedures are also discussed for practical implementation. Monte Carlo simulation is provided to evaluate the accuracy of the theoretical results.
47
ho, Chang ta, and 張大和. "The study batch type credit guarantees the case of the sme credit guarantee fund." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/57057033184795193596.
Повний текст джерела
48
Liao, Wei-Chih, and 廖偉志. "Evaluating Interest Rate Guarantee for a Defined Contribution Pension Plan: The Effects of Investment Strategies on Guaranteed Cost and Income Replacement Ratio." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/67801901987861201711.
Повний текст джерелаАнотація:
碩士<br>臺灣大學<br>財務金融學研究所<br>95<br>The paper focuses on evaluating interest rate guarantee cost and income replacement ratio for a defined contribution (DC) pension within different investment strategies. We investigated the guarantee cost with different investing strategies, including Buy and hold (BH) Constant Mixture (CM), Deterministic Lifestyle (DL), Constant Portion Portfolio Insurance (CPPI) and Time Invariant Portfolio Protection (TIPP) strategies. We used the Monte Carlo simulation to evaluate stock prices, bond prices and interest rates. We also assumed that the stochastic process can be applied to our model where we use Geometric Brownian Motion to execute the stock and bond value simulations. We also apply the CIR model to simulate bond prices and interest rates as another bond price simulation method for comparison purposes. Additionally, in this paper, we also enlarged the parameters on different pre-set weightings, risk multiples and floor rates to understand the latent impacts on guarantee cost and income replacement ratio in the sensitive analysis section. According to simulation results, we conclude by suggesting that government and insurance companies to design products with TIPP and DL traits rather than CIPP trait to lower the guarantee cost.
49
Jindrová, Lucie. "Bankovní záruka." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-310742.
Повний текст джерелаАнотація:
This thesis deals mostly with regulation of bank guarantee in Czech law, as well as with regulation on international level. The main aim of this work is to provide a complete perspective on bank guarantee, definition of its typical elements and its subjects and relations between the subjects, and to make classification of different kinds of bank guarantees. The work is divided into 12 main chapters and a great number of subchapters. Chapter one deals with a risk that is closely connected with bank guarantee, as bank guarantee is mostly used to secure risks. Chapter two is dedicated to historical development of bank guarantee and to previous regulation in the Code of International Business. Chapter three is focused on legislation of bank guarantee both in the Commercial Code and in other laws that regulate its use in the Czech Republic. This chapter is also concerned with the international law - mostly rules issued by the International Chamber of Commerce in Paris. Chapter four is mostly focused on characteristics of essential elements of bank guarantee, its differences from guarantee and its practical use. Chapters five and six are completely dedicated to establishment of bank guarantee and actions before its establishment. Chapter seven analyses subjects of bank guarantee and relationships between...
50
Bartholomew, Amy. "Justice without guarantees /." 2007. http://www.lib.umi.com/dissertations/gateway.
Повний текст джерелаАнотація:
Thesis (Ph. D.)--New School University, 2007.<br>Typescript. Includes bibliographical references (leaves 380-415). Also available in electronic format on the World Wide Web. Access restricted to users affiliated with the licensed institutions.