Дисертації з теми "Assumption-Based"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-22 дисертацій для дослідження на тему "Assumption-Based".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Fan, Xiuyi. "Assumption-based argumentation dialogues." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/10560.
Повний текст джерелаHamlet, I. M. "Assumption based temporal reasoning in medicine." Thesis, University of Sussex, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235351.
Повний текст джерелаCyras, Kristijonas. "ABA+ : assumption-based argumentation with preferences." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/58340.
Повний текст джерелаDugdale, Julie Anne. "Cooperative problem-solving using assumption-based truth maintenance." Thesis, University of Buckingham, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.601371.
Повний текст джерелаDrummond, Mark Edwin. "Plan nets : a formal representation of action and belief for 'automatic planning systems'." Thesis, University of Edinburgh, 1986. http://hdl.handle.net/1842/19705.
Повний текст джерелаWaldvogel, Mark Carleton University Dissertation Computer Science. "Metaplanning using time-relation constraints and assumption-based reasoning." Ottawa, 1986.
Знайти повний текст джерелаBayer, S. G. M. "Practical zero-knowledge protocols based on the discrete logarithm assumption." Thesis, University College London (University of London), 2014. http://discovery.ucl.ac.uk/1416402/.
Повний текст джерелаTian, Chun. "Assumption-Based Runtime Verification of Finite- and Infinite-State Systems." Doctoral thesis, Università degli studi di Trento, 2022. https://hdl.handle.net/11572/357167.
Повний текст джерелаLiu, Huizeng. "Ocean color atmospheric correction based on black pixel assumption over turbid waters." HKBU Institutional Repository, 2019. https://repository.hkbu.edu.hk/etd_oa/623.
Повний текст джерелаSchulz, Claudia. "Developments in abstract and assumption-based argumentation and their application in logic programming." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/56062.
Повний текст джерелаDicke, Ralf. "Strategische Unternehmensplanung mit Hilfe eines Assumption-based-truth-maintenance-Systems (ATMS) : Formalisierung eines Kontingenzansatzes in Prädikatenlogik und Anpassungsplanung nach dem Net-change-Prinzip /." Wiesbaden : Dt. Univ.-Verl, 2007. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=015660763&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Повний текст джерелаGöpfert, Florian [Verfasser], Johannes [Akademischer Betreuer] Buchman, and Jintai [Akademischer Betreuer] Ding. "Securely Instantiating Cryptographic Schemes Based on the Learning with Errors Assumption / Florian Göpfert ; Johannes Buchman, Jintai Ding." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2016. http://d-nb.info/1121781764/34.
Повний текст джерелаSune, Dan. "Isolation of Multiple-faults with Generalized Fault-modes." Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1480.
Повний текст джерелаMost AI approaches for fault isolation handle only the behavioral modes OK and NOT OK. To be able to isolate faults in components with generalized behavioral modes, a new framework is needed. By introducing domain logic and assigning the behavior of a component to a behavioral mode domain, efficient representation and calculation of diagnostic information is made possible.
Diagnosing components with generalized behavioral modes also requires extending familiar characterizations. The characterizations candidate, generalized kernel candidate and generalized minimal candidate are introduced and it is indicated how these are deduced.
It is concluded that neither the full candidate representation nor the generalized kernel candidate representation are conclusive enough. The generalized minimal candidate representation focuses on the interesting diagnostic statements to a large extent. If further focusing is needed, it is satisfactory to present the minimal candidates which have a probability close to the most probable minimal candidate.
The performance of the fault isolation algorithm is very good, faults are isolated as far as it is possible with the provided diagnostic information.
Kraus, Daniel [Verfasser], Claudia [Akademischer Betreuer] [Gutachter] Czado, Roger [Gutachter] Cooke, and Matthias [Gutachter] Fischer. "D-vine copula based quantile regression and the simplifying assumption for vine copulas / Daniel Kraus ; Gutachter: Roger Cooke, Matthias Fischer, Claudia Czado ; Betreuer: Claudia Czado." München : Universitätsbibliothek der TU München, 2017. http://d-nb.info/1143125053/34.
Повний текст джерелаThan, Soe. "Teaching language-based approaches to literature in Thailand : an experimental study of the effectiveness of 'elementary' stylistic analysis and language-based approaches to teaching literature to EFL students at Assumption University, Thailand." Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416898.
Повний текст джерелаKamdem, Simo Freddy. "Model-based federation of systems of modelling." Thesis, Compiègne, 2017. http://www.theses.fr/2017COMP2374.
Повний текст джерелаThe engineering of complex systems and systems of systems often leads to complex modelling activities (MA). Some challenges exhibited by MA are: understanding the context where they are carried out and their impacts on the lifecycles of models they produce, and ultimately providing a support for mastering them. How to address these challenges with a formal approach is the central challenge of this thesis. In this thesis, after discussing the related works from systems engineering in general and the co-engineering of the system to be made (product) and the system for make (project) systems specifically, we position and develop a methodology named MODEF, that aims to master the operation of MA. MODEF consists in: (1) characterizing MA as a system (and more globally as a federation of systems) in its own right; (2) iteratively architecting this system through: the modelling of the conceptual content of the models produced by MA and their life cycles, the tasks carried out within MA and their effects on these life cycles; (3) specifying the expectations over these life cycles and; (4) analysing models (of MA) against expectations (and possibly tasks constraints) - to check how far expectations are achievable - via the synthesis of the acceptable behaviours. On a practical perspective, the exploitation of the results of the analysis allows figuring out what could happen with the modelling tasks and their impacts on the whole state of models they handle. We show on two case studies (the operation of a supermarket and the modelling of the functional coverage of a system) how this exploitation provides insightful data on how the system is end-to-end operated and how it can behave. Based on this information, it is possible to take some preventive or corrective actions on how the MA are carried out. On the foundational perspective, the formal semantics of three kinds of involved models and the expectations formalism are first discussed. Then the analysis and exploitation algorithms are presented. Finally this approach is roughly compared with model checking and systems synthesis approaches. Last but not least, two enablers whose first objectives are to ease the implementation of MODEF are presented. The first one is a modular implementation of MODEF's buildings blocks. The second one is a federated architecture (FA) of models which aims to ease working with formal models in practice. Despite the fact that FA is formalised within the abstract framework of category theory, an attempt to bridge the gap between abstraction and implementation is sketched via some basic data structures and base algorithms. Several perspectives related to the different components of MODEF conclude this work
"Stereo vision without the scene-smoothness assumption: the homography-based approach." 1998. http://library.cuhk.edu.hk/record=b5889749.
Повний текст джерелаThesis (M.Phil.)--Chinese University of Hong Kong, 1998.
Includes bibliographical references (leaves 65-66).
Abstract also in Chinese.
Acknowledgments --- p.ii
List Of Figures --- p.v
Abstract --- p.vii
Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- Motivation and Objective --- p.2
Chapter 1.2 --- Approach of This Thesis and Contributions --- p.3
Chapter 1.3 --- Organization of This Thesis --- p.4
Chapter 2 --- Previous Work --- p.6
Chapter 2.1 --- Using Grouped Features --- p.6
Chapter 2.2 --- Applying Additional Heuristics --- p.7
Chapter 2.3 --- Homography and Related Works --- p.9
Chapter 3 --- Theory and Problem Formulation --- p.10
Chapter 3.1 --- Overview of the Problems --- p.10
Chapter 3.1.1 --- Preprocessing --- p.10
Chapter 3.1.2 --- Establishing Correspondences --- p.11
Chapter 3.1.3 --- Recovering 3D Depth --- p.14
Chapter 3.2 --- Solving the Correspondence Problem --- p.15
Chapter 3.2.1 --- Epipolar Constraint --- p.15
Chapter 3.2.2 --- Surface-Continuity and Feature-Ordering Heuristics --- p.16
Chapter 3.2.3 --- Using the Concept of Homography --- p.18
Chapter 3.3 --- Concept of Homography --- p.20
Chapter 3.3.1 --- Barycentric Coordinate System --- p.20
Chapter 3.3.2 --- Image to Image Mapping of the Same Plane --- p.22
Chapter 3.4 --- Problem Formulation --- p.23
Chapter 3.4.1 --- Preliminaries --- p.23
Chapter 3.4.2 --- Case of Single Planar Surface --- p.24
Chapter 3.4.3 --- Case of Multiple Planar Surfaces --- p.28
Chapter 3.5 --- Subspace Clustering --- p.28
Chapter 3.6 --- Overview of the Approach --- p.30
Chapter 4 --- Experimental Results --- p.33
Chapter 4.1 --- Synthetic Images --- p.33
Chapter 4.2 --- Aerial Images --- p.36
Chapter 4.2.1 --- T-shape building --- p.38
Chapter 4.2.2 --- Rectangular Building --- p.39
Chapter 4.2.3 --- 3-layers Building --- p.40
Chapter 4.2.4 --- Pentagon --- p.44
Chapter 4.3 --- Indoor Scenes --- p.52
Chapter 4.3.1 --- Stereo Motion Pair --- p.53
Chapter 4.3.2 --- Hallway Scene --- p.56
Chapter 5 --- Summary and Conclusions --- p.63
Göpfert, Florian. "Securely Instantiating Cryptographic Schemes Based on the Learning with Errors Assumption." Phd thesis, 2016. https://tuprints.ulb.tu-darmstadt.de/5850/1/Thesis_f_goepfert.pdf.
Повний текст джерелаPERRY, Suzanne B. "Universal service in the European Union : policy goal or market-based assumption?" Doctoral thesis, 1999. http://hdl.handle.net/1814/5652.
Повний текст джерелаGuan, Chi-Hao, and 管紀豪. "A EUF-CMA RSA Signature Scheme based on Phi-Hiding Assumption and Trapdoor Hash Function in the Standard Model." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/67708044707947857243.
Повний текст джерела國立臺灣海洋大學
資訊工程學系
99
We propose an EUF-CMA signature scheme based on Φ-hiding assumption [13] in the standard model. At the mean time, we found the RSA cryptosystem has lossy property [35]. This discovery also found by Kiltz et al [27]. On the orher side, Shamir and Tauman has proposed OnLine/OffLine signature scheme [39]: When OffLine phase, decide the trapdoor hash value until OnLine phase compute the correspond preimage by trapdoor key. Using this primitive, many EUF-CMA signature scheme has been proposed such as [5]、[9]、[10]、[11]、[12]、[17]、[23]、[26]、[29]、[32]、[33]、[41]. We using the two general ideas and try to prove the security of RSA cryptosystem satisfy the EUF-CMA property in the standard model.
Lee, Yum-Min, and 李允民. "Parallel Solver for Three-dimensional Cartesian-grid Based Time-Dependent Schrödinger Equation and Its Applications in Laser-Molecule Interaction Study with Single-Action-electron Assumption." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/04845407827280731085.
Повний текст джерела國立交通大學
機械工程系所
97
A parallelized three-dimensional Cartesian-grid based time-dependent Schrödinger equation (TDSE) solver for molecules with single active electron assumption, assuming freezing the motion of nucleus is presented in this thesis. An explicit stagger-time algorithm is employed for time integration of the TDSE, in which the real and imaginary parts of the wave function are defined at alternative times, while a cell-centered finite-volume method is utilized for spatial discretization of the TDSE on Cartesian grids. The TDSE solver is then parallelized using domain decomposition method on distributed memory machines by applying a multi-level graph-partitioning technique. The solver is validated, using a H2+ molecule system, both by observing total electron probability and total energy conservation without laser interaction, and by comparing the ionization rates with previous 2D-axisymmetric simulation results with an aligned incident laser pulse. Parallel efficiency of this TDSE solver is presented and discussed, in which the parallel efficiency can be as high as 75% using 128 processors. Finally, examples of temporal evolution of probability distribution of laser incidence onto a H2+ molecule at inter-nuclei distance of 9 a.u. (��= 0�a and 90�a) and spectral intensities of harmonic generation at inter-nuclei distance of 2 a.u. (��= 0�a, 30�a, 60�a and 90�a) and the angle effect of laser incidence on ionization rate of N2, O2 and CO2 molecules are presented to demonstrate the capability of the current TDSE solver.
Grzywacz, Norberto M., and Ellen C. Hildreth. "The Incremental Rigidity Scheme for Recovering Structure from Motion: Position vs. Velocity Based Formulations." 1985. http://hdl.handle.net/1721.1/5610.
Повний текст джерела