Relevant bibliographies by topics / Constraint-based method

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Constraint-based method'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Constraint-based method.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Constraint-based method"

1

Verle, A., X. Michel, P. Maurine, N. Azémard, and D. Auvergne. "Delay bounds based constraint distribution method." IEE Proceedings - Computers and Digital Techniques 152, no. 6 (2005): 765. http://dx.doi.org/10.1049/ip-cdt:20050026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

LIU, Ying, Meiping WU, Xiaoping HU, and Hongwei XIE. "Contour Constraint Based Geomagnetic Matching Method." Chinese Journal of Space Science 27, no. 6 (2007): 505. http://dx.doi.org/10.11728/cjss2007.06.505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

LI, Zhu, Kojiro TOMOTSUNE, Yoichi TOMIOKA, and Hitoshi KITAZAWA. "Template Matching Method Based on Visual Feature Constraint and Structure Constraint." IEICE Transactions on Information and Systems E95.D, no. 8 (2012): 2105–15. http://dx.doi.org/10.1587/transinf.e95.d.2105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Duan, Jin, Xiao Ming Chen, Hu Qi, and Yun Gui Li. "Boundary-Constraint Meshing Based on Paving Method." Applied Mechanics and Materials 627 (September 2014): 262–67. http://dx.doi.org/10.4028/www.scientific.net/amm.627.262.

Full text
Abstract:
This paper would modify thepaving method of Blacker and Stephenson [1] to generate boundary-constraint quad-mesh for arbitrary plane geometry. The basic idea for the present method is to classify the initial boundaries into closed borders and open borders.The closed borders aredescribed in a manner just the same as the paving method while the open borders areheuristically modeled as cracks with zero-width.And then the two kinds of borders aredelicatelyconnected each other to generate a new kind of boundary, named generalized closed boundary. Based on the newboundaries, the paving methodin Ref. [1] is adopted and modified slightly to generate quadrilateral elements by layering the geometry from the boundary toward the interior. And finally some meshing examples would be presented to illustrate the availability and power of the modified paving method.
APA, Harvard, Vancouver, ISO, and other styles
5

WEI Wei, GUO Chen, and DUAN Xiaodong. "Tolerance Constraint-based Assembly Method in Virtual Assembly." INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences 4, no. 22 (December 31, 2012): 649–57. http://dx.doi.org/10.4156/aiss.vol4.issue22.81.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

LI Wen, 李雯, 蔡宁 CAI Ning, 林斌 LIN Bin, and 曹向群 CAO Xiang-qun. "Adaptive Phase Unwrapping Method Based on Geometric Constraint." ACTA PHOTONICA SINICA 48, no. 8 (2019): 810001. http://dx.doi.org/10.3788/gzxb20194808.0810001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bale, Rahul, Neelesh A. Patankar, Niclas Jansson, Keiji Onishi, and Makoto Tsubokura. "Stencil Penalty approach based constraint immersed boundary method." Computers & Fluids 200 (March 2020): 104457. http://dx.doi.org/10.1016/j.compfluid.2020.104457.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang Xiaoleng, 王小冷, 杨凌辉 Yang Linghui, 林嘉睿 Lin Jiarui, 任永杰 Ren Yongjie, and 尹. 彤. Yin Tong. "Calibration method of circumference receiver based on circumference constraint location method." Infrared and Laser Engineering 45, no. 7 (2016): 0717004. http://dx.doi.org/10.3788/irla201645.0717004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ye, Tie Li, Lu Ling An, Li Gao, and Qing Liang Zeng. "Constraint-Based Synchronous Fitting of Surfaces." Key Engineering Materials 419-420 (October 2009): 437–40. http://dx.doi.org/10.4028/www.scientific.net/kem.419-420.437.

Full text
Abstract:
Constraint-based model reconstruction is one of the key research problems in recent reverse engineering. Surfaces of structural parts are mostly quadratic and have mutual constraints. Aiming at this feature, the paper proposes a method for conducting constraint-based synchronous fitting on multiple surfaces. Synchronous fitting is carried out through constraint optimization method, the constraints among surfaces can be maintained and the original design intents incarnated.
APA, Harvard, Vancouver, ISO, and other styles
10

Lakmazaheri, Sivand. "Constraint-based reasoning via Grobner Bases." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 11, no. 1 (January 1997): 5–15. http://dx.doi.org/10.1017/s0890060400001803.

Full text
Abstract:
AbstractConstraint-based reasoning is a problem-solving approach based on deductive reasoning. In this approach, a problem is modeled in terms of hypotheses and conclusion constraints, and it is solved via constraint satisfaction. The ability to handle linear and nonlinear algebraic constraints is essential for successful application of constraint-based reasoning in engineering. Due to the scarcity of algebraic techniques for satisfying nonlinear constraints, little attention has been paid to the use of constraint-based reasoning for solving nonlinear problems. This paper examines the use of the Grobner Bases method for satisfying nonlinear constraints in the context of constraint-based reasoning. After a brief introduction to the Grobner Bases method and its role in constraint-based reasoning, two examples are presented. The first example illustrates the use of Grobner bases, in the context of constraint-based reasoning, for reasoning about the behavior of beams. The second example illustrates the geometry configuration of truss structures via constraint-based reasoning.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Constraint-based method"

1

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.

Full text
Abstract:
This thesis examines the composition of three different musical works through the use of my constraint-based patterns. I have explored the patterns through spreadsheets and also SuperCollider: a software for algorithmic composition and audio synthesis. The aim is to find how the patterns can be used to reach clear contrasts while maintaining coherence in the music, as well as finding challenges and possibilities within the patterns, while exploring how evaluation of the artistic results can contribute to improved methods. While I see the main method as autoethnographical, with the core focus on composing, I have also used feedback from other composers, and through focus groups, as a way to collect data. Throughout this thesis I describe my process of constructing patterns and composing music, accompanied by my reasoning and relevant feedback. My results from analyzing feedback, score and patterns are that while some ways of using the patterns are well suited for achieving contrast and coherence, problems arose related to (among other things) musical form and predictability. Evaluation through feedback and interviews resulted in a better understanding of the patterns, and different workflows allowed for different viability in the evaluation. The most valuable insight is that the greater the amount of composition parameters which are controlled through constraint-based patterns, the simpler each individual composition parameter has to be in order to reach contrasting results that I find satisfying. My conclusion is that I can therefore design each individual composition parameter with high coherence to reach contrasting results when the composition parameters are applied on the same musical structure.
APA, Harvard, Vancouver, ISO, and other styles
2

Leach, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kö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.

Full text
Abstract:
As more robots and sensors are deployed in work and home environments, there is a growing need for these devices to act with some degree of autonomy to fulfill their purpose. Automated planning can be used to synthesize plans of action that achieve this. The main challenge addressed in this thesis is to consider how the automated planning problem changes when considered in the context of environments that are populated by humans. Humans have their own plans, and automatically generated plans should not interfere with these. We refer to this as social acceptability. Opportunities for proactive behavior often arise during execution. The planner should be able to identify these opportunities and proactively plan accordingly. Both social acceptability and proactivity require the planner to identify relevant situations from available information. We refer to this capability as context-awareness, and it may require complex inferences based on observed human activities. Finally, planning may have to consider cooperation with humans to reach common goals or to enable robots and humans to support one another. This thesis analyzes the requirements that emerge from human-aware planning — what it takes to make automated planning socially acceptable, proactive, context aware, and to make it support cooperation with humans. We formally state the human-aware planning problem, and propose a planning and execution framework for human-aware planning that is based on constraint reasoning and flaw-resolution techniques, and which fulfills the identified requirements. This approach is modular and extendable: new types of constraints can be added and solvers can be exchanged and re-arranged. This allows us to address the identified requirements for humanaware planning. In particular, we introduce Interaction Constraints (ICs) for this purpose, and propose patterns of Ics for social acceptability, proactivity, and contextawareness. We also consider cooperative plans in which certain actions are assigned to humans and the implications that this has. We evaluate the proposed methods and patterns on a series of use cases, as well as a variety of domains including a real-world robotic system. We evaluate the proposed methods and patterns on a series of use cases, as well as a variety of domains including a real-world robotic system. introduce Interaction Constraints (ICs) for this purpose, and propose patterns of ICs for social acceptability, proactivity, and context-awareness. We also consider cooperative plans in which certain actions are assigned to humans and the implications that this has. We evaluate the proposed methods and patterns on a series of use cases, as well as a variety of domains including a real-world robotic system.
APA, Harvard, Vancouver, ISO, and other styles
4

Westphal, Matthias [Verfasser], and Bernhard [Akademischer Betreuer] Nebel. "Qualitative constraint-based reasoning: methods and applications." Freiburg : Universität, 2015. http://d-nb.info/1119805627/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Niu, 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.

Full text
Abstract:
Software testing remains one of the most important but expensive approaches to ensure high-quality software today. In order to reduce the cost of testing, over the last several decades, various techniques such as formal verification and inductive learning have been used for test automation in previous research. In this thesis, we present a specification-based black-box testing approach, learning-based testing (LBT), which is suitable for a wide range of systems, e.g. procedural and reactive systems. In the LBT architecture, given the requirement specification of a system under test (SUT), a large number of high-quality test cases can be iteratively generated, executed and evaluated by means of combining inductive learning with constraint solving. We apply LBT to two types of systems, namely procedural and reactive systems. We specify a procedural system in Hoare logic and model it as a set of piecewise polynomials that can be locally and incrementally inferred. To automate test case generation (TCG), we use a quantifier elimination method, the Hoon-Collins cylindric algebraic decomposition (CAD), which is applied on only one local model (a bounded polynomial) at a time. On the other hand, a reactive system is specified in temporal logic formulas, and modeled as an extended Mealy automaton over abstract data types (EMA) that can be incrementally learned as a complete term rewriting system (TRS) using the congruence generator extension (CGE) algorithm. We consider TCG for a reactive system as a bounded model checking problem, which can be further reformulated into a disunification problem and solved by narrowing. The performance of the LBT frameworks is empirically evaluated against random testing for both procedural and reactive systems (executable models and programs). The results show that LBT is significantly more efficient than random testing in fault detection, i.e. less test cases and potentially less time are required than for random testing.
QC 20111012
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
This thesis is devoted to the study and application of constraint-based metabolic models. The objective was to find simple ways to handle the difficulties that arise in practice due to uncertainty (knowledge is incomplete, there is a lack of measurable variables, and those available are imprecise). With this purpose, tools have been developed to model, analyse, estimate and predict the metabolic behaviour of cells. The document is structured in three parts. First, related literature is revised and summarised. This results in a unified perspective of several methodologies that use constraint-based representations of the cell metabolism. Three outstanding methods are discussed in detail, network-based pathways analysis (NPA), metabolic flux analysis (MFA), and flux balance analysis (FBA). Four types of metabolic pathways are also compared to clarify the subtle differences among them. The second part is devoted to interval methods for constraint-based models. The first contribution is an interval approach to traditional MFA, particularly useful to estimate the metabolic fluxes under data scarcity (FS-MFA). These estimates provide insight on the internal state of cells, which determines the behaviour they exhibit at given conditions. The second contribution is a procedure for monitoring the metabolic fluxes during a cultivation process that uses FS-MFA to handle uncertainty. The third part of the document addresses the use of possibility theory. The main contribution is a possibilistic framework to (a) evaluate model and measurements consistency, and (b) perform flux estimations (Poss-MFA). It combines flexibility on the assumptions and computational efficiency. Poss-MFA is also applied to monitoring fluxes and metabolite concentrations during a cultivation, information of great use for fault-detection and control of industrial processes. Afterwards, the FBA problem is addressed.
Llaneras 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
APA, Harvard, Vancouver, ISO, and other styles
8

Andereck, Michael. "Procedural Terrain Generation Based on Constraint Paths." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1388357258.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bonfietti, Alessio <1981&gt. "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.

Full text
Abstract:
This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assignment to a set of activities, to be indefinitely repeated, subject to precedence and resource capacity constraints. In this work we present two constraint programming frameworks facing two different types of cyclic problems. In first instance, we consider the disjunctive RA&CSP, where the allocation problem considers unary resources. Instances are described through the Synchronous Data-flow (SDF) Model of Computation. The key problem of finding a maximum-throughput allocation and scheduling of Synchronous Data-Flow graphs onto a multi-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms. We propose an exact (complete) algorithm for the computation of a maximum-throughput mapping of applications specified as SDFG onto multi-core architectures. Results show that the approach can handle realistic instances in terms of size and complexity. Next, we tackle the Cyclic Resource-Constrained Scheduling Problem (i.e. CRCSP). We propose a Constraint Programming approach based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. The proposed approaches have been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances achieving good results on practical size problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Bonfietti, Alessio <1981&gt. "Constraint based methods for allocation and scheduling of periodic applications." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5503/.

Full text
Abstract:
This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assignment to a set of activities, to be indefinitely repeated, subject to precedence and resource capacity constraints. In this work we present two constraint programming frameworks facing two different types of cyclic problems. In first instance, we consider the disjunctive RA&CSP, where the allocation problem considers unary resources. Instances are described through the Synchronous Data-flow (SDF) Model of Computation. The key problem of finding a maximum-throughput allocation and scheduling of Synchronous Data-Flow graphs onto a multi-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms. We propose an exact (complete) algorithm for the computation of a maximum-throughput mapping of applications specified as SDFG onto multi-core architectures. Results show that the approach can handle realistic instances in terms of size and complexity. Next, we tackle the Cyclic Resource-Constrained Scheduling Problem (i.e. CRCSP). We propose a Constraint Programming approach based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. The proposed approaches have been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances achieving good results on practical size problem.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Constraint-based method"

1

S, Smith Steven, and United States. National Aeronautics and Space Administration., eds. Investigations into generalization of constraint-based scheduling theories with applications to space telescope observation scheduling: Final report for NASA contract # NCC 2-531. [Washington, DC: National Aeronautics and Space Administration, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kim, Daegyu. Mapping based constraint handling methods for evolutionary algorithms. 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hooker, John. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley & Sons, Incorporated, John, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hooker, John. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley & Sons, Incorporated, John, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hooker, John. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley-Interscience, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Scott, Peter. The Hard Sell. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198783817.003.0009.

Full text
Abstract:
The vacuum cleaner was an archetypal new economy product of the early twentieth century. It offered both major time savings and qualitative advantages over previous household cleaning methods—the brush, broom, and manual carpet sweeper—and was sold in a novel way (by household demonstration). The direct sales techniques pioneered by vacuum manufacturers in the United States were to have a profound impact on the way vacuums were sold in Britain, and globally. Yet by 1939 their household diffusion was relatively slow compared to refrigerators or washing machines. This chapter explores why the industry evolved a structure based on high prices, high cost distribution methods (door-to-door sales), and a strong emphasis on non-price competition, based on differentiation through features. It also shows how door-to-door selling eventually came to constitute both a key firm-level competitive advantage and a substantial industry-level constraint on product diffusion.
APA, Harvard, Vancouver, ISO, and other styles
7

Sorabji, Richard. Freedom of Speech and Expression. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780197532157.001.0001.

Full text
Abstract:
This book on freedom of speech and expression starts (chapter 1) with an inter-cultural history of this valued right through the ages and then recalls (chapter 2) the benefits for which we rightly value it. But what about speech that frustrates these benefits? Supporters of the benefits of free speech have reason to exercise voluntary self-restraint on speech which frustrates the benefits. They should also cultivate a second remedy: the art, illustrated in chapter 1, and called by Gandhi the art of ‘opening ears’, by other kinds of speech and conduct. Such voluntary methods are to be preferred to legal constraints. But (chapter 3) legal constraint is sometimes necessary. In the twenty-first century, social media funding based on manipulation of personal speech data requires skilful legislation and enforcement in favour of social media that protect freedoms.
APA, Harvard, Vancouver, ISO, and other styles
8

Bennett, D. Scott. Teaching the Scientific Study of International Processes. Oxford University Press, 2017. http://dx.doi.org/10.1093/acrefore/9780190846626.013.314.

Full text
Abstract:
The Scientific Study of International Processes (SSIP) is an approach aimed at teaching of international politics scientifically. Teaching scientifically means teaching students how to use evidence to support or disprove some particular logical argument or hypothesis that reaches some level of generalization about relationships between concepts. Closely related to simply asking what evidence there is, is teaching students to address the breadth, depth, and quality of that evidence. The scientific approach may also draw attention to the logic of arguments and policies. Are policies, positions, and the arguments behind them logical? Or is some policy or position based on assumptions that are not logically related, or only true if certain auxiliary assumptions hold true? Teaching methods for SSIP include comparative case studies, experiments and surveys, data sets, and game theory and simulation. Instructors also face several challenges when seeking to teach scientifically, and in particular when they try to make time to teach methodology as part of an international politics course. Some problems are relatively easily overcome just by focusing on effective teaching. Other are unique to SSIP and cannot be dealt with quite so easily. Among these are the need to appeal to a broad audience, and dealing with students' negative reactions to the term “science” and the constraint of finite time in a course.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Constraint-based method"

1

Sharma, Vasudev, Abhinav Nagpal, and Balakrushna Tripathy. "A Fuzzy Constraint Based Outlier Detection Method." In Intelligent Computing Methodologies, 515–27. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26766-7_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Zhen, Qinchuan Li, and Huafeng Ding. "Constraint Screw-Based Method for Type Synthesis." In Theory of Parallel Mechanisms, 325–64. Dordrecht: Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-4201-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Unno, Hiroshi, Tachio Terauchi, and Eric Koskinen. "Constraint-Based Relational Verification." In Computer Aided Verification, 742–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_35.

Full text
Abstract:
AbstractIn recent years they have been numerous works that aim to automate relational verification. Meanwhile, although Constrained Horn Clauses ($$\mathrm {CHCs}$$ CHCs ) empower a wide range of verification techniques and tools, they lack the ability to express hyperproperties beyond k-safety such as generalized non-interference and co-termination.This paper describes a novel and fully automated constraint-based approach to relational verification. We first introduce a new class of predicate Constraint Satisfaction Problems called $$\mathrm {pfwCSP}$$ pfwCSP where constraints are represented as clauses modulo first-order theories over predicate variables of three kinds: ordinary, well-founded, or functional. This generalization over $$\mathrm {CHCs}$$ CHCs permits arbitrary (i.e., possibly non-Horn) clauses, well-foundedness constraints, functionality constraints, and is capable of expressing these relational verification problems. Our approach enables us to express and automatically verify problem instances that require non-trivial (i.e., non-sequential and non-lock-step) self-composition by automatically inferring appropriate schedulers (or alignment) that dictate when and which program copies move. To solve problems in this new language, we present a constraint solving method for $$\mathrm {pfwCSP}$$ pfwCSP based on stratified CounterExample-Guided Inductive Synthesis (CEGIS) of ordinary, well-founded, and functional predicates.We have implemented the proposed framework and obtained promising results on diverse relational verification problems that are beyond the scope of the previous verification frameworks.
APA, Harvard, Vancouver, ISO, and other styles
4

Cai, Lijun, Tinghao Yu, Tingqin He, Lei Chen, and Meiqi Lin. "Active Learning Method for Constraint-Based Clustering Algorithms." In Web-Age Information Management, 319–29. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39958-4_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Candeago, Lorenzo, Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, and Albert Rubio. "Speeding up the Constraint-Based Method in Difference Logic." In Theory and Applications of Satisfiability Testing – SAT 2016, 284–301. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40970-2_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ranji Ranjithan, S., S. Kishan Chetan, and Harish K. Dakshina. "Constraint Method-Based Evolutionary Algorithm (CMEA) for Multiobjective Optimization." In Lecture Notes in Computer Science, 299–313. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44719-9_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Das, Mouli, Subhasis Mukhopadhyay, and Rajat K. De. "A Constraint Based Method for Optimization in Metabolic Pathways." In Lecture Notes in Computer Science, 193–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-11164-8_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Abbasian, Reza, and Malek Mouhoub. "A New GA-Based Method for Temporal Constraint Problems." In Recent Trends in Applied Artificial Intelligence, 252–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38577-3_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Jinlong, Aili Shen, and Guanzhou Lu. "Reference Point Based Constraint Handling Method for Evolutionary Algorithm." In Advances in Swarm and Computational Intelligence, 294–301. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20466-6_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Michalik, P., and B. Bruderlin. "A Constraint-Based Method for Sculpting Free-Form Surfaces." In Geometric Modelling, 249–65. Vienna: Springer Vienna, 2001. http://dx.doi.org/10.1007/978-3-7091-6270-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Constraint-based method"

1

Landa, Ricardo, Carlos A. Coello Coello, and Gregorio Toscano-Pulido. "Goal-constraint: Incorporating preferences through an evolutionary ε-constraint based method." In 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2013. http://dx.doi.org/10.1109/cec.2013.6557642.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Louberry, Christine, Philippe Roose, and Marc Dalmau. "Qos-based design method for constraint device based applications." In the 4th international workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1568192.1568194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Yuexing, Zuxing Gu, Xi Cheng, Min Zhou, Xiaoyu Song, Ming Gu, and Jiaguang Sun. "A Constraint-Pattern Based Method for Reachability Determination." In 2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC). IEEE, 2017. http://dx.doi.org/10.1109/compsac.2017.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Han, Tingting, Hongxun Yao, Yanhao Zhang, and Pengfei Xu. "A spatial-temporal constraint-based action recognition method." In 2013 20th IEEE International Conference on Image Processing (ICIP). IEEE, 2013. http://dx.doi.org/10.1109/icip.2013.6738570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Xiaoling, Changguo Guo, Huaimin Wang, Zhendong Li, and Zhiwen Yang. "A constraint optimization based virtual network mapping method." In 2012 International Conference on Graphic and Image Processing, edited by Zeng Zhu. SPIE, 2013. http://dx.doi.org/10.1117/12.2011106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Qiang, Zhenping, Hui Liu, Xu Chen, Zhenhong Shang, and Lingjun Zeng. "An image restoration method based on sparse constraint." In Fifth International Conference on Digital Image Processing, edited by Yulin Wang and Xie Yi. SPIE, 2013. http://dx.doi.org/10.1117/12.2030581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Acharya, Arunasish, Smita Sadhu, and T. K. Ghoshal. "State inequality constraint based method for rail navigation." In 2010 Annual IEEE India Conference (INDICON). IEEE, 2010. http://dx.doi.org/10.1109/indcon.2010.5712612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liu Guo-qi, Zhu Zhi-liang, and Li Dancheng. "Adaptive service selection method based on user's constraint information." In 2011 International Conference on System Science, Engineering Design and Manufacturing Informatization (ICSEM). IEEE, 2011. http://dx.doi.org/10.1109/icssem.2011.6081306.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Dong, Fanzhi Meng, Fang Lou, Chunrui Zhang, and Yuan Liu. "An attack decision method based on constraint condition correlation." In 2016 First IEEE International Conference on Computer Communication and the Internet (ICCCI). IEEE, 2016. http://dx.doi.org/10.1109/cci.2016.7778970.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liang, Ximing, Wen Long, Haoyu Qn, and Shanchun Li. "A Novel Constraint-Handling Method Based on Evolutionary Algorithm." In 2009 Second International Conference on Intelligent Computation Technology and Automation. IEEE, 2009. http://dx.doi.org/10.1109/icicta.2009.40.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Constraint-based method"

1

Wilkowski, G. M., D. Rudland, P. Mincer, B. Metrovich, and D. Rider. ASME-PVP05 Brittle-to-Ductile Fracture Initiation Transition Temperature for Old Linepipe w Surface-Crack. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), January 2005. http://dx.doi.org/10.55274/r0011772.

Full text
Abstract:
Much work has been done to assess constraint effects on the crack-driving force for specimens and cracks in pipes. The material's transition temperature where the fracture process changes from ductile tearing to cleavage fracture at crack initiation is affected by the constraint conditions but is a material property that cannot be determined analytically. This paper presents a methodology to account for constraint effects to predict the lowest temperature where ductile fracture initiation occurs and relates that temperature back to Charpy impact data for X60 and lower grades, particularly for older vintage linepipe materials. The method involves a series of transition temperature shifts to account for thickness effects, strain-rate effects, and constraint effects to give a master curve of transition temperatures from Charpy data to through-wall-cracked or surface-cracked pipes (with various a/t values) under quasi-static loading. These transition temperature shifts were based on hundreds of pipe tests and thousands of specimen tests over several decades of work by numerous investigators. This method is being validated by examining 1927 and 1948 vintage linepipe steels. In addition, data have been developed on the 1927 vintage pipe material to assess the effect of the bluntness of a corrosion flaw on the lowest temperature where ductile fracture will still initiate under quasi-static loading. An additional transition temperature shift occurs as a function of the bluntness of the flaw.
APA, Harvard, Vancouver, ISO, and other styles
2

Wijaya, Ignasius P. A., Eric Kreiger, and Asuf Masud. An elastic-inelastic model and embedded bounce-back control for layered printing with cementitious materials. Engineer Research and Development Center (U.S.), January 2024. http://dx.doi.org/10.21079/11681/48091.

Full text
Abstract:
This paper presents a finite-deformation model for extrusion-based layered printing with cementitious materials. The evolution of mechanical properties as the printed material cures and stiffens results in nonphysical reduction in the magnitude of elastic strains when standard constitutive models are employed. This elastic recovery of the printing induced deformation contradicts the experimentally observed behavior of the printed cementitious materials that harden at a nearly-frozen deformed state. A thermodynamically motivated constraint on the evolution of elastic strains is imposed on the constitutive model to remedy the nonphysical bounce-back effect. An algorithm that is based on a strain-projection technique for the elastic part of deformation is developed that complements the inelastic response given by the Drucker–Prager model. It is then embedded in a finite strain finite element framework for the modeling and simulation of cure hardening and inelastic response of the early age cementitious materials. A ghost mesh method is proposed for continuous layer-wise printing of the material without the need for intermittent mesh generation technique or adaptive remeshing methods. The model is validated via comparison with experimental data and representative test cases are presented that investigate the mathematical and computational attributes of the proposed model.
APA, Harvard, Vancouver, ISO, and other styles
3

Chell, G. Graham. L52310 Criteria for Evaluating Failure Susceptibility Due to Crack Defects Phase II. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), October 2010. http://dx.doi.org/10.55274/r0010691.

Full text
Abstract:
Seam cracks can pose a serious threat to the integrity of electric resistance welded (ERW) liquid and gas pipelines. Of concern to the industry is not just the assessment of cracks under service conditions, but also ways that may be used to establish the remaining lives of pipelines based on the results of a hydrostatic pressure test. An accurate crack assessment procedure is required. The main objective of Phase II is to validate the J-based crack assessment method developed in Phase I by using it to predict the results of full-scale burst tests on seam-welded pressurized pipes containing axial surface flaws. The comparisons between measured and predicted burst test conditions demonstrated that the Level 3C (J-based) assessment resulted in conservatively calculated critical burst conditions when fracture toughness values measured using highly constrained bend specimens were used in the analysis. This initial validation exercise highlighted some of the difficulties that may be encountered when attempting to validate the accuracy of advanced flaw assessment methodologies using vintage thin-walled pipe sections containing axial cracks. A second set of validation calculations were performed using modified material properties chosen to compensate for the effects of (a) extraneous plastic strains on stress-strain curves measured on flattened tensile specimens and (b) plastic constraint effects, and the J-based Level 3C assessment methodology developed in Phase I predicted accurate critical flaw sizes and critical pressures for the burst test pipe samples.
APA, Harvard, Vancouver, ISO, and other styles
4

Tiku, Sanjay, Nick Pussegoda (Archived), Morvarid Ghovanlou, and W. R. Tyson. PR-214-114509-R01 Standardization of Weld Testing for Fracture Toughness using Single Edge Notched Tests. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), April 2019. http://dx.doi.org/10.55274/r0011578.

Full text
Abstract:
Fracture toughness of steels is conventionally measured using bend specimens and provides a conservative estimate of toughness when the actual loading is in tension. There has been wide-spread interest in characterizing the toughness that occurs with reduced constraint to better reflect constraint conditions typical of a relatively shallow girth weld flaw. Recent developments in fracture toughness testing and analysis of tension loaded specimens have led to publications by CANMET Materials Technology Laboratory (now CanmetMATERIALS, CMAT) and ExxonMobil Upstream Research Company (ExxonMobil) toward development of a single-specimen procedure. As part of an initiative to enhance the state of the art in strain-based design and assessment methods, with the intent of providing support for the standardization of appropriate weld testing methods, BMT Canada Ltd (BMT), under a Pipeline Research Council International (PRCI) project, has combined the two single-specimen approaches and developed a recommended practice for fracture toughness testing using single-edge-notched tension SENT (or SE(T)) samples with fixed grip loading. The procedure has been assessed by means of a round robin test program involving laboratories from around the world. Girth welds were fabricated and base metal, heat affected zone and weld center line specimens were prepared and sent to round robin participants. For the round robin program all the participants used a double clip gauge arrangement for direct CTOD measurement and electric potential drop or unloading compliance methods for crack growth measurement. In this paper, the results of the round robin test program including comparison of J and CTOD resistance curves will be presented and discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

TEACHING-LEARNING BASED OPTIMIZATION METHOD CONSIDERING BUCKLING AND SLENDERNESS RESTRICTION FOR SPACE TRUSSES. The Hong Kong Institute of Steel Construction, March 2022. http://dx.doi.org/10.18057/ijasc.2022.18.1.3.

Full text
Abstract:
The structural performance of a building is a function of several parameters and constraints whose association may offer non unique solutions which, however, meet the design requirements. Therefore, an optimization routine is needed to determine the best solution within the set of available alternatives. In this study, the TLBO method was implemented for weight-based optimization of space trusses. The algorithm applies restrictions related to the critical buckling load as well as the slenderness ratio, which are the basis to obtain reliable and realistic results. To assess the capability of the TLBO method, two reference cases and a transmission tower are subjected to the optimization analysis. In the transmission tower analysis, however, a more realistic approach is adopted as it also considers, through a safety factor, the plastic behavior in the critical buckling load constraint. With no optimization, the ideal weight increases by 101.36% when the critical buckling load is considered in the first two cases, which is consistent with the expected behavior. If the slenderness of the elements is also restricted, the ideal weight now rises by 300.78% from the original case and by 99.04% from the case where only the critical buckling load restriction is applied. Now, considering the critical buckling load and slenderness restriction with the TLBO method applied, a 18.28% reduction in the ideal weight is verified. In fact, the proposed optimization procedure converged to a better solution than that of the reference study, which is based on the genetic algorithms method.
APA, Harvard, Vancouver, ISO, and other styles
6

HIGH PRECISION IDENTIFICATION METHOD OF MASS AND STIFFNESS MATRIX FOR SHEAR-TYPE FRAME TEST MODEL. The Hong Kong Institute of Steel Construction, June 2023. http://dx.doi.org/10.18057/ijasc.2023.19.2.6.

Full text
Abstract:
In the direct method of identifying the physical parameters of the shear-type frame structures through the frequencies and modes from the experimental modal analysis (EMA), the accuracy of the lumped mass depends on the initial mass, while the identified mass matrix and stiffness matrix are prone to generate some matrix elements without any physical meaning. In this paper, based on the natural frequencies and modes obtained from the EMA, an iterative constrained optimization solution for correcting mass matrix and a least squares solution for the lateral stiffness are proposed. The method takes the total mass of the test model as the constraint condition and develops an iterative correction method for the lumped mass, which is independent of the initial lumped mass. When the measured modes are exact, the iterative solution converges to the exact solution. On this basis, the least squares calculation equation of the lateral stiffness is established according to the natural frequencies and modes. Taking the numerical model of a 3-story steel frame structure as an example, the influence of errors of measured modes on the identification accuracy is investigated. Then, a 2-story steel frame test model is used to identify the mass matrix and stiffness matrix under three different counterweights. Numerical and experimental results show that the proposed method has good accuracy and stability, and the identified mass matrix and stiffness matrix have clear physical significance.
APA, Harvard, Vancouver, ISO, and other styles
7

BOND-SLIP TESTING AND PERFORMANCE EVALUATION OF SEMI-RIGID FLANGE FOLDED WEB SHEAR KEYS. The Hong Kong Institute of Steel Construction, December 2022. http://dx.doi.org/10.18057/ijasc.2022.18.4.3.

Full text
Abstract:
The shear key is crucial to the overall mechanical performance of the structure. A new type of semi-rigid connector-flange folded web shear key was proposed to determine the effective unity of higher bearing capacity and deformation. A total of five groups of specimens were designed, and the push-out test method was used to evaluate the ultimate bearing capacity, bond-slip process, failure mode, and strain distribution of the new shear key. The results show that before sliding, the embedded effect of the concrete and shear key is significant, and it has a significant sliding stiffness. After sliding, the steel plate in the middle of the opening of the outer folded plate buckles, which shows certain semi-rigid characteristics. Compared with equal-area studs, the bearing capacity of the new shear key is increased by more than 40%, and the deformation capacity exceeds 60 %, indicating good bond-slip performance. The constraint range of the shear key is greatly improved compared with the stud, and a trapezoidal area of constraint centered on the shear key is formed, accounting for more than half of the area of the concrete slab. Based on an experimental study, a practical calculation method of ultimate bearing capacity of the shear key is proposed, which can meet engineering safety requirements. Based on the analysis of bond-slip characteristics of different forms of shear keys, compared with the rigid T-shaped shear key, the slip load and ultimate bearing capacity of the new shear key are found to be increased by 39 % and 74 %, respectively, and the deformation capacity is increased more than 10-fold. Compared with the flexible stud shear connectors, the sliding load is increased by 86 %, the ultimate bearing capacity is increased more two-fold, and the stiffness is increased by nearly five times. The device exhibits good comprehensive performance.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Constraint-based method' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography