Teses / dissertações sobre o tema "Constraint-based method"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 31 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Constraint-based method".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.
Lilja, Robin. "Constraint-Based Patterns : An examination of an algorithmic composition method". Thesis, Luleå tekniska universitet, Institutionen för ekonomi, teknik, konst och samhälle, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-85001.
Texto completo da fonteLeach, Austin M. "A NEW CONSTRAINT BASED FRACTURE PREDICTION METHODOLOGY FOR DUCTILE MATERIALS CONTAINING SURFACE CRACKS [FLAWS]". Master's thesis, Mississippi State : Mississippi State University, 2004. http://library.msstate.edu/etd/show.asp?etd=etd-07122004-155332.
Texto completo da fonteKöckemann, Uwe. "Constraint-based Methods for Human-aware Planning". Doctoral thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-51437.
Texto completo da fonteWestphal, Matthias [Verfasser], e Bernhard [Akademischer Betreuer] Nebel. "Qualitative constraint-based reasoning: methods and applications". Freiburg : Universität, 2015. http://d-nb.info/1119805627/34.
Texto completo da fonteKim, Dae Gyu. "Mapping based constraint handling methods for evolutionary algorithms". Thesis, University of Sussex, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.311406.
Texto completo da fonteNiu, Fei. "Learning-based Software Testing using Symbolic Constraint Solving Methods". Licentiate thesis, KTH, Teoretisk datalogi, TCS, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-41932.
Texto completo da fonteQC 20111012
Llaneras, Estrada Francisco. "Interval and Possibilistic Methods for Constraint-Based Metabolic Models". Doctoral thesis, Universitat Politècnica de València, 2011. http://hdl.handle.net/10251/10528.
Texto completo da fonteLlaneras Estrada, F. (2011). Interval and Possibilistic Methods for Constraint-Based Metabolic Models [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/10528
Palancia
Andereck, Michael. "Procedural Terrain Generation Based on Constraint Paths". The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1388357258.
Texto completo da fonteBonfietti, Alessio <1981>. "Constraint based methods for allocation and scheduling of periodic applications". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5503/1/Bonfietti_Alessio_Tesi.pdf.
Texto completo da fonteBonfietti, Alessio <1981>. "Constraint based methods for allocation and scheduling of periodic applications". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5503/.
Texto completo da fonteWedig, Sean A. "SpecTackle: Inferring Partial Specifications Through Constraint-Based Dynamic Analysis". The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1345515046.
Texto completo da fonteSadeghi, Rezvan. "Consistency of global and local scheduling decisions in semiconductor manufacturing". Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEM023.
Texto completo da fonteThe operational level in semiconductor manufacturing can be divided into a global level and a local level. The global level refers to the scheduling decisions and production control for the whole manufacturing facility (fab), while the local level deals with those issues in each work area. The global level provides objectives or constraints for the local level. In this thesis, we propose a general framework which aims at supporting and controlling the decisions taken at the local level to deal with consistency problems between global and local scheduling decisions. The framework is composed of two layers. The bottom layer includes local policies used in each work center. The top layer consists of global objectives, global information and a global strategy which is the core of this framework. The proposed global strategy aims at controlling local policies as well as production processes. The idea is to periodically run the global strategy while production is performed to guide the production process towards achieving global objectives, and thus ensuring consistency between decisions taken at the global and local levels. We propose two types of global strategy: (1) An evaluation-based strategy which aims at improving the production process with no guarantee to determine an optimal solution and (2) An optimization-based strategy, based on a Linear Programming model. In order to evaluate the performance of the proposed framework, we develop a data-driven generic simulation model for semiconductor manufacturing facilities. The simulation model is a combination of Agent-Based and Discrete Event modelling methods developed with the software AnyLogic. Since the standard solver IBM ILOG CPLEX is used to solve the linear programming model, we describe its integration with AnyLogic. A set of experiments on industrial instances are presented and discussed. In addition, this thesis deals with the management of time constraints. In a semiconductor manufacturing facility, time constraints are associated to two process steps to ensure the yield and quality of lots. A time constraint corresponds to a maximum time that a lot can spend between the two steps. If a time constraint is not satisfied by a lot, this lot will be scrapped or reprocessed. Therefore, because manufacturing equipment is expensive and cycle times must be minimized, efficiently controlling the start of lots in time constraints is important. We propose an approach which estimates the probability of satisfying a time constraint before starting a lot in the first step of the time constraint. This approach was implemented and validated on industrial constraints
Lu, Wei. "Integer Programming-based Methods for Computing Minimum Reaction Modifications of Metabolic Networks for Constraint Satisfaction". 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/199436.
Texto completo da fonteMaung, David. "Tile-based Method for Procedural Content Generation". The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1461077485.
Texto completo da fonteTeran, Villegas Oswaldo Ramon. "Emergent tendencies in multi-agent-based simulations using constraint-based methods to effect practical proofs over finite subsets of simulation outcomes". Thesis, Manchester Metropolitan University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343494.
Texto completo da fonteBaghaei, Nilufar. "A collaborative constraint-based intelligent system for learning object-oriented analysis and design using UML". Thesis, University of Canterbury. Computer Science and Software Engineering, 2007. http://hdl.handle.net/10092/1204.
Texto completo da fonteRiahi, Vahid. "Constraint Directed Scheduling". Thesis, Griffith University, 2019. http://hdl.handle.net/10072/386545.
Texto completo da fonteThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Inst Integrated&IntelligentSys
Science, Environment, Engineering and Technology
Full Text
Li, Honghao. "Interpretable biological network reconstruction from observational data". Electronic Thesis or Diss., Université Paris Cité, 2021. http://www.theses.fr/2021UNIP5207.
Texto completo da fonteThis thesis is focused on constraint-based methods, one of the basic types of causal structure learning algorithm. We use PC algorithm as a representative, for which we propose a simple and general modification that is applicable to any PC-derived methods. The modification ensures that all separating sets used during the skeleton reconstruction step to remove edges between conditionally independent variables remain consistent with respect to the final graph. It consists in iterating the structure learning algorithm while restricting the search of separating sets to those that are consistent with respect to the graph obtained at the end of the previous iteration. The restriction can be achieved with limited computational complexity with the help of block-cut tree decomposition of the graph skeleton. The enforcement of separating set consistency is found to increase the recall of constraint-based methods at the cost of precision, while keeping similar or better overall performance. It also improves the interpretability and explainability of the obtained graphical model. We then introduce the recently developed constraint-based method MIIC, which adopts ideas from the maximum likelihood framework to improve the robustness and overall performance of the obtained graph. We discuss the characteristics and the limitations of MIIC, and propose several modifications that emphasize the interpretability of the obtained graph and the scalability of the algorithm. In particular, we implement the iterative approach to enforce separating set consistency, and opt for a conservative rule of orientation, and exploit the orientation probability feature of MIIC to extend the edge notation in the final graph to illustrate different causal implications. The MIIC algorithm is applied to a dataset of about 400 000 breast cancer records from the SEER database, as a large-scale real-life benchmark
Loxton, Ryan Christopher. "Optimal control problems involving constrained, switched, and delay systems". Thesis, Curtin University, 2010. http://hdl.handle.net/20.500.11937/1479.
Texto completo da fonteHu, Yi-Ting, e 胡伊婷. "A Method-Level Unit Testing Tool Based on Object Constraint Language and Constraint Logic Programming". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/74068935574139087346.
Texto completo da fonte國立中正大學
資訊工程所
98
Software testing is the main activity to ensure the quality of software. This thesis applies a black-box testing technique to automatically generate test cases based on the preconditions and postconditions in the Design by Contract software development approach. It uses Object Constraint Language to specify the preconditions and postconditions of Java methods. This thesis develops an automatic testing tool to generate Java test classes for the Java classes under test. The testing framework is based on the JUnit framework. The automatic generation of test input and expected output for each test case is based on the powerful constraint solving capability of constraint logic programming. This approach can generate the test input and expected output simultaneously.
CHANG, CHENG-HUNG, e 張振鴻. "Constraint-Based Test Case Generation for White-Box Method-Level Unit Testing". Thesis, 2017. http://ndltd.ncl.edu.tw/handle/36b93f.
Texto completo da fonte國立中正大學
資訊工程研究所
105
This thesis defines the test case generation problem as a constraint satisfaction problem, and implements a constraint-based test case generator for white-box method-level unit testing. A test case contains a test input and the corresponding expected output. For test inputs, this tool first transforms the source program into a constraint model called a constraint logic graph. A constraint logic graph describes graphically the actual behaviors of a method or the constraint logic relationships between the inputs and the actual outputs of the method. On the constraint logic graph, this tool then performs equivalence class partitioning of the actual behaviors and test coverage criteria management using graph-based approaches to generate a small-quantity and wide-coverage group of representative behaviors for testing. The problem of generating the input for a representative behavior can be defined as a constraint satisfaction problem. This constraint satisfaction problem can be described and solved by a constraint logic programming language. For expected outputs, the expected behaviors of a method defined by the Object Constraint Language can also be viewed as a constraint satisfaction problem. Because the Object Constraint Language is non-executable, this tool will transform the specification described by the Object Constraint Language into an executable specification described by a constraint logic programming language. Given an input, the executable specification can be solved to generate the corresponding expected output. One of the features of this tool is that it uses an uniformed constraint-based approach to generate both test inputs and expected outputs for white-box method-level unit testing. Keywords- unit testing, white-box testing, constraint-based testing,test case generation, method-level testing, constraint logic programming
Horng, Chu Bong, e 朱邦弘. "A graph-theoretical method for verifying, validating and refining constraint-based knowledge bases". Thesis, 1995. http://ndltd.ncl.edu.tw/handle/15725063054087520550.
Texto completo da fonte國立臺灣科技大學
工程技術研究所
83
Verification, validation and refinement of a knowledge base have played such an important role in the development of a knowledge-based system that researchers have recently put much emphasis on the task. To ensure the reliability and to enhance the performance of a knowledge-based system, we need formal and systematical methods to verify, validate and refine the involved knowledge base. This thesis proposes an approach based on the graph-theoretical method to verify, validate and refine a knowledge base that is represented by GASE-net, a net-based knowledge representation scheme. The approach converts a GASE- net into a constraints-based form (named V-net), and then utilizes a graph-theoretical process to find potential structural and/or functional anomalies via the constraint relationships. The approach is applied during knowledge acquisition so as to ensure the correctness and validity of a knowledge base incrementally, which in turns reduces the complexity of the involved operations. A knowledge verification, validation and refinement system (VARY) is proposed to realize the approach. Its integration into a knowledge acquisition tool is also discussed.
Lin, Chih-Yuan, e 林志遠. "A Black-Box Method-Level Test Case Generator Based on Constraint Logic Programming". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/69222561756871618394.
Texto completo da fonte國立中正大學
資訊工程研究所
99
Software testing is the main activity to ensure the quality of software. This article proposes a testing framework that applies a black-box testing technique to automatically generate test cases for Java methods. The specification of Java methods is based on the Design by Contract software development approach. This article uses UML class diagrams and the Object Constraint Language to describe the specification of Java methods. The automatic generation of test cases is based on the unification mechanism and the powerful constraint solving mechanism of constraint logic programming. A novel characteristic of this approach is that the test input and its corresponding expected output of a test case are simultaneously generated in a unified fashion.
Huang, Chin-Jan, e 黃群然. "Skull Stripping Based on a Cluster-Constraint Watershed Method for MR T1-Weighted Image". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/87206207958444014060.
Texto completo da fonte國立陽明大學
醫學工程研究所
99
The purpose of skull-stripping is to remove non-brain tissue from a head image and retain brain tissue only. It has played an important role in neuroimage analyses because it’s a basic preliminary step in many clinical applications. There are also many applications benefit from the ability to accurately segment brain from non-brain tissue, such as registration, cortical flattening algorithm and brain atrophy estimation. But skull-stripping has been a tricky and challenging problem all along due to the complexity of human brain structure, variety of individual characteristics and variable parameters of MR scanners. This study proposes a semi-automatic method to perform skull-stripping in T1-weighted magnetic resonance(MR)head images. We first apply a series of pre-processing steps combining bilateral filtering and fuzzy possibilistic c-means to smooth noise and cluster images. Then we apply watershed algorithm to segment clustered images into several regions. Finally, a post-merging step merges brain-like regions, and then a morphology processing refines the brain region to a final result. Experimental results suggest that our algorithm is potentially accurate, robust, and fast for automatically skull-stripping MR head image volumes.
Chang, Chi-Kuang, e 張智光. "Design and Implementation of a Constraint-Based Test Case Generator for Black-Box Method-Level Unit Testing". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/06190123901503326640.
Texto completo da fonte國立中正大學
資訊工程研究所
103
Software testing is still the main approach to ensuring software quality. Software testing involves the formulation of the test case generation problem: The specification of the software behaviors; the partitioning of software behaviors into equivalence classes; the management of test coverage criteria to achieve specified software quality; the determination of test input and expected output for a representative software behavior in an equivalence class; the construction of a test fixture for this representative software behavior. We design and implement a constraint-based test case generator for black-box method-level unit testing. The test case generation problem is formulated as a constraint satisfaction problem. The software behaviors are specified using the Universal Modeling Language class diagrams and the Object Constraint Language. The partitioning of software behaviors into equivalence classes and the management of test coverage criteria are based on constraint logic graphs. A constraint logic graph can be viewed as a succinct graphical representation of the disjunctive normal form of a logic constraint expression. Each complete path in the constraint logic graph corresponds to a conjunctive clause in the disjunctive normal form and corresponds to a test case. The determination of the test input and expected output for this test case is formulated as a constraint satisfaction problem in constraint logic programming predicates. Constraint logic programming provides powerful constraint solving capability and can solve the test input and expected output simultaneously. The construction of the test fixture for this test case is also formulated as a constraint satisfaction problem and solved by constraint logic programming. The constraint-based test case generator can run in console mode or in a plugin for Eclipse integrated development environment. Console mode supports fast test case generation and verification. The plugin for Eclipse supports a user-friendly interface integrated with development environment. In the future, this constraint-based test case generator can be easily extended to support test case generation for white-box method-level unit testing, test case generation for class-level unit testing. and test case
WANG, CHIEN-LUNG, e 王建瓏. "Supporting Array Data Type in Constraint-Based Test Case Generation for Black-Box Method-Level Unit Testing". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/h6b857.
Texto completo da fonte國立中正大學
資訊工程研究所
107
Test case generation for collections like arrays is more sophisticated than that for scalars. This issue is more challenging in black-box testing than in white-box testing because the specification usually does not describe how collections will be processed. This thesis proposes a constraint-based approach to generate test cases for arrays in black-box method-level unit testing. The constraint-based framework uses the object constraint language as the specification language. This thesis extends the object constraint language to support array data type. This thesis supports static arrays, dynamic fixed-size arrays, and dynamic variable-szie arrays. The constraint-based framework then converts the constraint-based specification for a method into a constraint-based test model, called a constraint logic graph. This thesis performs equivalence class partitioning, boundary value analysis, and test coverage criteria management of black-box unit testing on the constraint logic graph. The constraint-based framework then formulates the test case generation for a method as a set of constraint satisfaction problems generated from the constraint logic graph. The test case generation for arrays involves both the size of the array and the values of array elements. These constraint satisfaction problems are then solved using the constraint logic programming to generate the test cases. This thesis implements the corresponding constraint logic predicate for each array operation supported in the object constraint language. This thesis also performs a preliminary evaluation of the constraint-based framework using a suite of Java benchmarks. Keyword: Constraint-based testing; black-box testing; method-level unit testing; test case generation; array data type
Chen, Yu-Ting, e 陳昱廷. "Regularized Semi-Dense Map Reconstruction from a Monocular Sequence based on Piecewise Planar Constraint and Gauss Newton Method". Thesis, 2016. http://ndltd.ncl.edu.tw/handle/69236153826950334115.
Texto completo da fonte國立臺灣大學
電機工程學研究所
104
Three-dimensional environment reconstruction from a monocular camera has been a popular and a challenge research topic in past few years. This technique can be applied to unmanned vehicles to perform automatic navigation, environment exploration and automatic obstacle avoidance. In addition, it can also be applied to augmented reality. Since the camera is not equipped with an inertial measurement unit (IMU), it is necessary to locate the camera position and map the environment simultaneously. In this thesis, the camera pose estimation is based on feature based method [24: Lepetit et al. 2009] and direct method [1: Engel et al. 2014]. The camera localization thread is depend on the semi-dense map which is the high gradient area in image and is easily to become noisy. Hence, a method that can regularize the reconstructed semi-dense map without affect the accuracy of the camera pose localization is proposed in this thesis. The regularization method can eliminate the noise and smooth the semi-dense map. Furthermore, the regularization method is related to the photometric information between two images, unlike other methods only using the information of the depth and spatial relation. The reconstruction algorithm can be divide into three parts: stereo matching, piecewise planar constraint, and plane optimization. Since the high gradient areas are always narrow and hard to apply the piecewise planar constraint, a stereo matching method that can broaden the high gradient area by using their nearby low gradient pixels is proposed. After the semi-dense map is reconstructed, the semi-dense map will propagate to the piecewise planar constraint which can estimate the initial piecewise planes for each pixel. Finally, the optimization method is applied to optimize each estimated piecewise plane. In this thesis, the proposed stereo matching is composed of prior depth of ORB feature [27: Rublee et al. 2011], KD-Tree [36: Bentley 1975], Priority Queue and the entropy of the histogram of oriented gradient. The aim is to match the low gradient area around the high gradient area between two images correctly by using the epipolar geometry. It is hard to match two textureless areas between two images, so the best nearby texture area is searched to do the matching procedure. Firstly, if one pixel does not hold an inverse depth hypothesis, the nearby ORB features which has initial depth knowledge is used to initiate the inverse depth value, which can shorter the epipolar line searching length and improve the accuracy of the matching result. Searching the texture area which contains high gradient pixel is done by using k nearest neighbor search with KD-Tree, and sorting the searched pixels in accordance with the gradient magnitude by the priority queue. If the searched point passes the stereo searching constraint, the searched high gradient point will form a 5×5 pixels template and be used to do the stereo line searching. The corresponding points are considered to be matched if the residual between the templates in two image pass the stereo matching threshold which will change with the value of the searching region’s entropy of the histogram of oriented gradient. In the regularization part of this thesis, each tiny piece of point cloud projected from the image in 3D coordinate is assumed to fit a plane. The corresponding size in the image of each piece is set to 5×5 pixels. Since the assumption will not hold if the piece is in the border between two different objects or the discontinuous area, the planar constraint is applied to discriminate the non-planar region. After passing the planar constraint, Gauss-Newton method is used to minimize the photometric error between the two patches which projected from the piece in 3D coordinate in two images and the optimal parameters of the plane can be obtained. Afterwards, the optimal parameters are used to eliminate the noises and smooth the point cloud. The experimental results demonstrate that the proposed regularization algorithm can eliminate most of the noises and reconstruct a more clearly point cloud.
Smith, Graham J. "Multiuser constraint based 3D scene construction". 2001. http://wwwlib.umi.com/cr/yorku/fullcit?pMQ67751.
Texto completo da fonteTypescript. Includes bibliographical references (leaves 92-95). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ67751.
Michalik, Pavol Brüderlin Beat. "Methods for constraint-based conceptual free-form surface design /". 2003. http://www.gbv.de/dms/ilmenau/toc/374818258.PDF.
Texto completo da fonteHeldt, Corinna Melanie [Verfasser]. "Constraint-based methods for phasing in crystallography / Corinna Melanie Heldt". 2010. http://d-nb.info/1012625702/34.
Texto completo da fonteMichalik, Pavol [Verfasser]. "Methods for constraint based conceptual free-form surface design / vorgelegt von Pavol Michalik". 2003. http://d-nb.info/980463955/34.
Texto completo da fonte