Log in

Relevant bibliographies by topics / Theory of Constraints / Journal articles

To see the other types of publications on this topic, follow the link: Theory of Constraints.

Journal articles on the topic 'Theory of Constraints'

Author: Grafiati

Published: 4 June 2021

Last updated: 29 May 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Theory of Constraints.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Abdurrahman, Israa B. "HOW HAS OPTIMALITY THEORY ACHIEVED THE GOALS OF LINGUISTIC THEORY." Al-Adab Journal, no. 111 (March 15, 2015): 1–16. http://dx.doi.org/10.31973/aj.v0i111.1530.

Full text

Abstract:

Optimality Theory (OT) is a grammatical framework of recent origin presented by Prince and Smolensky in 1993. The central idea of Optimality Theory is that surface forms of language reflect resolutions of conflicts between competing constraints. A surface form is ‘optimal’ in the sense that it incurs the least serious violations of a set of violable constraints, ranked in a language-specific hierarchy. Constraints are universal and languages differ in the ranking of constraints, giving priorities to some constraints over others. Such rankings are based on ‘strict’ domination: if one constraint outranks another, the higher-ranked constraint has priority, regardless of violations of the lower-ranked one. However, such violation must be minimal, which predicts the economy property of grammatical processes. This paper tries to seek the clues to prove that optimality theory achieves the goals of linguistic theory successfully

APA, Harvard, Vancouver, ISO, and other styles

2

Fischer, Thomas, and Laurence D. Richards. "From Goal-Oriented to Constraint-Oriented Design: The Cybernetic Intersection of Design Theory and Systems Theory." Leonardo 50, no. 1 (February 2017): 36–41. http://dx.doi.org/10.1162/leon_a_00862.

Full text

Abstract:

This article traces the changing notions of constraints in design and of systems since the mid-20th century in the intersection of design theory and systems theory. Taking a second-order cybernetic perspective, the article develops constraints as observer dependent and it analyzes conditions under which constraints tend to be beneficial or detrimental. Ethical implications of constraints in design processes are established with reference to system boundaries. Constraint-oriented design is discussed as an alternative to goal-oriented design, and a method called constraint reversal is introduced as a strategy of deliberate defiance of constraints to support design exploration.

APA, Harvard, Vancouver, ISO, and other styles

3

Guy, Gregory R. "Violable is variable: Optimality theory and linguistic variation." Language Variation and Change 9, no. 3 (October 1997): 333–47. http://dx.doi.org/10.1017/s0954394500001952.

Full text

Abstract:

ABSTRACTOptimality theory (OT) (McCarthy & Prince, 1993; Prince & Smolensky, 1993) has been proposed as a constraint-based theory of phonology in which the phonological facts of each language are accounted for by a language-specific ordering of a universal inventory of constraints. The constraints, expressing desirable (i.e., optimal) phonological states, evaluate possible candidate forms, selecting the optimal output. Any constraint may be violated by a surface form if it is overridden by a higherranked constraint; the ordinal sequence of constraints provides a weak quantification of constraint effects. Variability has been treated within OT by varying constraint orders. This model is analogous in several important respects to the variable rule model (VR) of Labov (1969) and Cedergren and Sankoff (1974). In VR, variable constraints express desirable phonological states which are variably realized on the surface, when not overridden by other constraints; constraints are probabilistically quantified. This article compares the OT and VR models, arguing that the VR model is superior on theoretical and empirical grounds: constraint effects in VR are stable, transparent, and learnable. Moreover, the probabilistic treatment of constraint effects allows VR to model successfully cases in which multiple violations of a single constraint lead to a cumulative reduction in likelihood of a form; such cases cannot be efficiently treated in OT.

APA, Harvard, Vancouver, ISO, and other styles

4

Hammersley, Richard, Nick Holmes, and Marie Reid. "Testing the Constraint Theory of Addiction: Cannabis Constraints Discriminate Users from Nonusers and Heavy from Light Users." Journal of Addiction 2020 (May 26, 2020): 1–9. http://dx.doi.org/10.1155/2020/3427270.

Full text

Abstract:

Constraint theory (Hammersley, 2014) offers a novel way of understanding addiction as a lack of cognitive, behavioural, and social constraints on substance use. Here, cannabis constraints were studied in a large online opportunity sample: N = 302; 205 men, 97 women. Age ranged from 14 to 60 years (mean = 25, SD = 8.0). Most participants were from UK or North America. Participants completed a questionnaire assessing 15 cannabis constraints and standard self-report frequency measures of drug use. Factor analysis of the constraint questionnaire found 15 factors, similar to those proposed theoretically. These factors could discriminate well between past and current users and heavy and light users. The best discriminator was concerns about the possibility of becoming addicted; the less concerned the heavier was use, although those who actually felt addicted were more concerned than others. Past users also constrained due to using legal highs instead, concerns about illegality, and using only when others used. Light users constrained due to availability and cost issues, as well as unpleasant effects. These findings suggest that there is utility in constraint theory and that heavy use occurs due to a relative lack of constraints.

APA, Harvard, Vancouver, ISO, and other styles

5

van de Laar, Thijs, İsmail Şenöz, Ayça Özçelikkale, and Henk Wymeersch. "Chance-Constrained Active Inference." Neural Computation 33, no. 10 (September 16, 2021): 2710–35. http://dx.doi.org/10.1162/neco_a_01427.

Full text

Abstract:

Abstract Active inference (ActInf) is an emerging theory that explains perception and action in biological agents in terms of minimizing a free energy bound on Bayesian surprise. Goal-directed behavior is elicited by introducing prior beliefs on the underlying generative model. In contrast to prior beliefs, which constrain all realizations of a random variable, we propose an alternative approach through chance constraints, which allow for a (typically small) probability of constraint violation, and demonstrate how such constraints can be used as intrinsic drivers for goal-directed behavior in ActInf. We illustrate how chance-constrained ActInf weights all imposed (prior) constraints on the generative model, allowing, for example, for a trade-off between robust control and empirical chance constraint violation. Second, we interpret the proposed solution within a message passing framework. Interestingly, the message passing interpretation is not only relevant to the context of ActInf, but also provides a general-purpose approach that can account for chance constraints on graphical models. The chance constraint message updates can then be readily combined with other prederived message update rules without the need for custom derivations. The proposed chance-constrained message passing framework thus accelerates the search for workable models in general and can be used to complement message-passing formulations on generative neural models.

APA, Harvard, Vancouver, ISO, and other styles

6

Johnston, Hunter, Carl Leake, Yalchin Efendiev, and Daniele Mortari. "Selected Applications of the Theory of Connections: A Technique for Analytical Constraint Embedding." Mathematics 7, no. 6 (June 12, 2019): 537. http://dx.doi.org/10.3390/math7060537.

Full text

Abstract:

In this paper, we consider several new applications of the recently introduced mathematical framework of the Theory of Connections (ToC). This framework transforms constrained problems into unconstrained problems by introducing constraint-free variables. Using this transformation, various ordinary differential equations (ODEs), partial differential equations (PDEs) and variational problems can be formulated where the constraints are always satisfied. The resulting equations can then be easily solved by introducing a global basis function set (e.g., Chebyshev, Legendre, etc.) and minimizing a residual at pre-defined collocation points. In this paper, we highlight the utility of ToC by introducing various problems that can be solved using this framework including: (1) analytical linear constraint optimization; (2) the brachistochrone problem; (3) over-constrained differential equations; (4) inequality constraints; and (5) triangular domains.

APA, Harvard, Vancouver, ISO, and other styles

7

Adams, Jeffrey D., and Daniel E. Whitney. "Application of Screw Theory to Constraint Analysis of Mechanical Assemblies Joined by Features." Journal of Mechanical Design 123, no. 1 (August 1, 1999): 26–32. http://dx.doi.org/10.1115/1.1334858.

Full text

Abstract:

Screw Theory is used to provide mathematical models of assembly features, allowing the determination of positioning constraints imposed on one part in an assembly by another part based on the geometry of the features that join them. Several feature types have been modeled, and it is easy to model new ones. A user of this theory is able to combine members of this set to join two parts and then determine whether or not the defined feature set over-, under-, or fully-constrains the location and orientation of the part. The ability to calculate the state of constraint of parts in an assembly is useful in supporting quantitative design of properly constrained assemblies in CAD systems. Locational over-constraint of parts can lead to assembleability problems or require deformation of parts in order to complete the assembly.

APA, Harvard, Vancouver, ISO, and other styles

8

Rahman, Shams‐ur. "Theory of constraints." International Journal of Operations & Production Management 18, no. 4 (April 1998): 336–55. http://dx.doi.org/10.1108/01443579810199720.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Stoi, Roman, and Boris A. Kühnle. "Theory of Constraints." Controlling 14, no. 1 (2002): 55–56. http://dx.doi.org/10.15358/0935-0381-2002-1-55.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Blackstone, John. "Theory of Constraints." Scholarpedia 5, no. 5 (2010): 10451. http://dx.doi.org/10.4249/scholarpedia.10451.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Pawlak, Roberta. "Theory of Constraints." JONA: The Journal of Nursing Administration 46, no. 11 (November 2016): 558–60. http://dx.doi.org/10.1097/nna.0000000000000404.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Chakraborty, Uttam. "Optimality Theory in Bangla Phonology: Introducing Specific Constraints." Paripex - Indian Journal Of Research 3, no. 5 (January 15, 2012): 131–32. http://dx.doi.org/10.15373/22501991/may2014/43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Santos, Eduardo, Agnelo Vieira, Sauro Schaidt, and Eduardo Loures. "Modeling constraint-based processes: A supervisory control theory application." Computer Science and Information Systems 11, no. 4 (2014): 1229–47. http://dx.doi.org/10.2298/csis131029026s.

Full text

Abstract:

Constraint-based processes require a set of rules that limit their behavior to certain boundaries. In these processes, the control flow is defined implicitly as a set of constraints or rules, and all possibilities that do not violate any of the given constraints are allowed to be executed. The present paper proposes a new approach to deal with constraint-based processes. The proposed approach is based on Supervisory Control Theory, a formal foundation for building controllers for discrete-event systems. The controller proposed in this paper monitors and restricts execution sequences of activities such that constraints are always obeyed. We demonstrate that our approach may be used as a declarative language for constraint-based processes. In order to provide support for users of such processes and to facilitate the using of our control approach, we offer a set of constraints modeled by automata. This set encompasses the constraints frequently needed in workflow system.

APA, Harvard, Vancouver, ISO, and other styles

14

Mortari, Daniele, and Carl Leake. "The Multivariate Theory of Connections." Mathematics 7, no. 3 (March 22, 2019): 296. http://dx.doi.org/10.3390/math7030296.

Full text

Abstract:

This paper extends the univariate Theory of Connections, introduced in (Mortari, 2017), to the multivariate case on rectangular domains with detailed attention to the bivariate case. In particular, it generalizes the bivariate Coons surface, introduced by (Coons, 1984), by providing analytical expressions, called constrained expressions, representing all possible surfaces with assigned boundary constraints in terms of functions and arbitrary-order derivatives. In two dimensions, these expressions, which contain a freely chosen function, g ( x , y ) , satisfy all constraints no matter what the g ( x , y ) is. The boundary constraints considered in this article are Dirichlet, Neumann, and any combinations of them. Although the focus of this article is on two-dimensional spaces, the final section introduces the Multivariate Theory of Connections, validated by mathematical proof. This represents the multivariate extension of the Theory of Connections subject to arbitrary-order derivative constraints in rectangular domains. The main task of this paper is to provide an analytical procedure to obtain constrained expressions in any space that can be used to transform constrained problems into unconstrained problems. This theory is proposed mainly to better solve PDE and stochastic differential equations.

APA, Harvard, Vancouver, ISO, and other styles

15

MAGRI, GIORGIO. "Idempotency in Optimality Theory." Journal of Linguistics 54, no. 1 (March 20, 2017): 139–87. http://dx.doi.org/10.1017/s0022226717000019.

Full text

Abstract:

Anidempotentphonological grammar maps phonotactically licit forms faithfully to themselves. This paper establishes tight sufficient conditions for idempotency in (classical) Optimality Theory. Building on Tesar (2013), these conditions are derived in two steps. First, idempotency is shown to follow from a general formal condition on the faithfulness constraints. Second, this condition is shown to hold for a variety of faithfulness constraints which naturally arise within McCarthy & Prince’s (1995) Correspondence Theory of faithfulness. This formal analysis provides an exhaustive toolkit for modelingchain shifts, which have proven recalcitrant to a constraint-based treatment.

APA, Harvard, Vancouver, ISO, and other styles

16

Burness, Phillip, and Kevin McMullin. "Post-nasal voicing in Japanese classifiers as exceptional triggering: implications for Indexed Constraint Theory." Canadian Journal of Linguistics/Revue canadienne de linguistique 65, no. 4 (November 9, 2020): 471–95. http://dx.doi.org/10.1017/cnj.2020.26.

Full text

Abstract:

AbstractIndexed constraints are often used in constraint-based phonological frameworks to account for exceptions to generalizations. A point of contention in the literature on constraint indexation revolves around indexed markedness constraints. While some researchers argue that only faithfulness constraints should be indexed, others argue that markedness constraints should be eligible for indexation as well. This article presents data from Japanese for which a complete synchronic analysis requires indexed markedness constraints but argues that such constraints are only necessary in cases where a phonological repair applies across a morpheme boundary. We then demonstrate that algorithms for learning grammars with indexed constraints can be augmented with a bias towards faithfulness indexation and discuss the advantages of incorporating such a bias, as well as its implications for the debate over the permissibility of indexed markedness constraints.

APA, Harvard, Vancouver, ISO, and other styles

17

Nwokedi, Theophilus C., Donald I. Kalu, Callistus C. Igboanusi, Gbasibo L. Addah, and C. U. Odumodu. "Constraint Theory Approach Analysis of the Nigerian Shipbuilding Industry." LOGI – Scientific Journal on Transport and Logistics 10, no. 1 (May 1, 2019): 50–61. http://dx.doi.org/10.2478/logi-2019-0006.

Full text

Abstract:

Abstract Nigeria has been unable to develop a viable ship building industry over the years notwithstanding several efforts of government at achieving that. The study aimed to identify and determine the principal component constraints to ship building development in Nigeria. Adopting the theory of constraint approach, survey research design was used in which primary data were obtained from questionnaire responses from employees and management staff of shipyards in the ship building clusters in Lagos, Port-Harcourt and Warri. The data collected were analyzed using principal component factor analysis, analysis of variance and pie-chart. It was found that the principal component constraints to the development of the ship building sector in Nigeria include financial constraint with Eigen value of 31.23%, infrastructural constraint with Eigenvalue of 26.35% and poor skill and technical know-how with Eigen value of 16.23%. This implies that financial constraints, poor skill and lack of technical know-how and infrastructural constraints contribute a cumulative Eigen value of 74.259% and thus constitute the dominant constraints impeding the performance of ship yards, ship building and repair sector in Nigeria. Development of national ship building and dry-docking funding scheme, ship building research and training center among other things were recommended.

APA, Harvard, Vancouver, ISO, and other styles

18

Plenert, Gerhard. "Optimizing theory of constraints when multiple constrained resources exist." European Journal of Operational Research 70, no. 1 (October 1993): 126–33. http://dx.doi.org/10.1016/0377-2217(93)90237-h.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Ma, Xinwu, and Lu Sun. "An automatic approach to constrained quadrilateral mesh generation." Engineering Computations 37, no. 3 (November 7, 2019): 929–51. http://dx.doi.org/10.1108/ec-03-2019-0114.

Full text

Abstract:

Purpose Arbitrary constraints might be included into the problem domain in many engineering applications, which represent specific features such as multi-domain interfaces, cracks with small yield stresses, stiffeners attached on the plate for reinforcement and so on. To imprint these constraints into the final mesh, additional techniques need to be developed to treat these constraints properly. Design/methodology/approach This paper proposes an automatic approach to generate quadrilateral meshes for the geometric models with complex feature constraints. Firstly, the region is decomposed into sub-regions by the constraints, and then the quadrilateral mesh is generated in each sub-region that satisfies the constraints. A method that deals with constraint lines and points is presented. A distribution function is proposed to represent the distribution of mesh size over the region by using the Laplace equation. The density lines and points can be specified inside the region and reasonable mesh size distribution can be obtained by solving the Laplace equation. Findings An automatic method to define sub-regions is presented, and the user interaction can be avoided. An algorithm for constructing loops from constraint lines is proposed, which can deal with the randomly distributed constraint lines in a general way. A method is developed to deal with constraint points and quality elements can be generated around constraint points. A function defining the distribution of mesh size is put forward. The examples of constrained quadrilateral mesh generation in actual engineering analysis are presented to show the performance of the approach. Originality/value An automatic approach to constrained quadrilateral mesh generation is presented in this paper. It can generate required quality meshes for special applications with complex internal feature constraints.

APA, Harvard, Vancouver, ISO, and other styles

20

Parczewski, Jan, and Wojciech Blajer. "On Realization of Program Constraints: Part I—Theory." Journal of Applied Mechanics 56, no. 3 (September 1, 1989): 676–79. http://dx.doi.org/10.1115/1.3176145.

Full text

Abstract:

The problem of realization of program constraints is considered. The classical theory approach based on replacing the constriant reactions by adequate control forces has been generalized to the case when the control forces are not collinear with program constraint vectors or, in the extreme, when the control forces do not project in these directions at all (control forces are tangent to constraint manifolds). A classification of possible ways of program constraint realization is proposed and a general solution of the problem is presented.

APA, Harvard, Vancouver, ISO, and other styles

21

Xiong, Tao, Liping Chen, Jianwan Ding, Yizhong Wu, and Wenjie Hou. "Recognition of Kinematic Joints of 3D Assembly Models Based on Reciprocal Screw Theory." Mathematical Problems in Engineering 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/1761968.

Full text

Abstract:

Reciprocal screw theory is used to recognize the kinematic joints of assemblies restricted by arbitrary combinations of geometry constraints. Kinematic analysis is common for reaching a satisfactory design. If a machine is large and the incidence of redesign frequent is high, then it becomes imperative to have fast analysis-redesign-reanalysis cycles. This work addresses this problem by providing recognition technology for converting a 3D assembly model into a kinematic joint model, which is represented by a graph of parts with kinematic joints among them. The three basic components of the geometric constraints are described in terms of wrench, and it is thus easy to model each common assembly constraint. At the same time, several different types of kinematic joints in practice are presented in terms of twist. For the reciprocal product of a twist and wrench, which is equal to zero, the geometry constraints can be converted into the corresponding kinematic joints as a result. To eliminate completely the redundant components of different geometry constraints that act upon the same part, the specific operation of a matrix space is applied. This ability is useful in supporting the kinematic design of properly constrained assemblies in CAD systems.

APA, Harvard, Vancouver, ISO, and other styles

22

Wei, Junbao, Haiyan Li, Ming Guo, Jing Li, and Huang Huang. "Backstepping Control Based on Constrained Command Filter for Hypersonic Flight Vehicles with AOA and Actuator Constraints." International Journal of Aerospace Engineering 2021 (September 2, 2021): 1–16. http://dx.doi.org/10.1155/2021/8620873.

Full text

Abstract:

An antisaturation backstepping control scheme based on constrained command filter for hypersonic flight vehicle (HFV) is proposed with the consideration of angle of attack (AOA) constraint and actuator constraints of amplitude and rate. Firstly, the HFV system model is divided into velocity subsystem and height subsystem. Secondly, to handle AOA constraint, a constrained command filter is constructed to limit the amplitude of the AOA command and retain its differentiability. And the constraint range is set in advance via a prescribed performance method to guarantee that the tracking error of the AOA meets the constraint conditions and transient and steady performance. Thirdly, the proposed constrained command filter is combined with the auxiliary system for actuator constraints, which ensures that the control input meets the limited requirements of amplitude and rate, and the system is stable. In addition, the tracking errors of the system are proved to be ultimately uniformly bounded based on the Lyapunov stability theory. Finally, the effectiveness of the proposed method is verified by simulation.

APA, Harvard, Vancouver, ISO, and other styles

23

Aloufi, Aliaa. "Ponapean Song Meter in Optimality Theory." Advances in Language and Literary Studies 12, no. 3 (June 30, 2021): 46. http://dx.doi.org/10.7575/aiac.alls.v.12n.3.p.46.

Full text

Abstract:

The exploration of poetry and songs has been essential to the progress of generative metrical theory that is concerned with the linguistic study of versification. The main issue is that the majority of work is highly concentrated on English poetry. Research on the poetic meter of other languages is thus crucial for a sufficient understanding of meter and metrical rules even though other perspectives and theoretical approaches are utilised. Bearing such a goal in mind, the current study aims to examine the meter in Ponapean songs in the light of Optimality Theory. It found that Ponapean songs are regulated by poetic meter that constrains both the size of the line with a fixed number of morae as well as the prominence that requires stressed morae. The proposed OT analysis derives the restriction on the size of the line with minimality and maximality constraints along with obligatoriness and alignment constraints that account for the prominence. Further rhythmic constraints are needed to regulate the alteration between stressed and unstressed morae. OT is shown in this study to be a framework which is capable of predicting the well-formed nature of rhythmic meter that constrains both the phonological constituency and prominence with regard to Ponapean songs. The proposed analysis might be used for other rhythmic meter that constrains the size and prominence at the same metric level, such as Luganda.

APA, Harvard, Vancouver, ISO, and other styles

24

Domes, Ferenc, and Arnold Neumaier. "Constraint propagation on quadratic constraints." Constraints 15, no. 3 (August 26, 2009): 404–29. http://dx.doi.org/10.1007/s10601-009-9076-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

CASANA, R., B. M. PIMENTEL, and G. E. R. ZAMBRANO. "THE SCHWINGER MODEL ON THE NULL-PLANE." International Journal of Modern Physics E 16, no. 09 (October 2007): 2993–97. http://dx.doi.org/10.1142/s0218301307008896.

Full text

Abstract:

We study the Schwinger Model on the null-plane using the Dirac method for constrained systems. The fermion field is analyzed using the natural null-plane projections coming from the γ-algebra and it is shown that the fermionic sector of the Schwinger Model has only second class constraints. However, the first class constraints are exclusively of the bosonic sector. Finally, we establish the graded Lie algebra between the dynamical variables, via generalized Dirac bracket in the null-plane gauge, which is consistent with every constraint of the theory.

APA, Harvard, Vancouver, ISO, and other styles

26

BRACKEN, PAUL. "CONSTRAINT STRUCTURE AND QUANTIZATION OF A NON-ABELIAN GAUGE THEORY BY MEANS OF DIRAC BRACKETS." Modern Physics Letters A 24, no. 32 (October 20, 2009): 2611–21. http://dx.doi.org/10.1142/s0217732309031818.

Full text

Abstract:

An SO(3) non-Abelian gauge theory is introduced. The Hamiltonian density is determined and the constraint structure of the model is derived. The first-class constraints are obtained and gauge-fixing constraints are introduced into the model. Finally, using the constraints, the Dirac brackets can be determined and a canonical quantization is found using Dirac's procedure.

APA, Harvard, Vancouver, ISO, and other styles

27

Bradley, Seamus. "Constraints on Rational Theory Choice." British Journal for the Philosophy of Science 68, no. 3 (September 1, 2017): 639–61. http://dx.doi.org/10.1093/bjps/axv063.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Ray, Amitava, Bijan Sarkar, and Subir Kumar Sanyal. "An improved theory of constraints." International Journal of Accounting & Information Management 16, no. 2 (October 10, 2008): 155–65. http://dx.doi.org/10.1108/18347640810913816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Pottier, François. "Simplifying Subtyping Constraints: A Theory." Information and Computation 170, no. 2 (November 2001): 153–83. http://dx.doi.org/10.1006/inco.2001.2963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

COLWYN JONES, T., and DAVID DUGDALE. "THEORY OF CONSTRAINTS: TRANSFORMING IDEAS?" British Accounting Review 30, no. 1 (March 1998): 73–91. http://dx.doi.org/10.1006/bare.1997.0061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Breunlin, Douglas C. "TOWARD A THEORY OF CONSTRAINTS." Journal of Marital and Family Therapy 25, no. 3 (July 1999): 365–82. http://dx.doi.org/10.1111/j.1752-0606.1999.tb00254.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Newell, K. M., R. E. A. Van Emmerik, and P. V. McDonald. "Biomechanical constraints and action theory." Human Movement Science 8, no. 4 (August 1989): 403–9. http://dx.doi.org/10.1016/0167-9457(89)90045-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sarvi, Fahimeh, Majid Monemzadeh, and Salman Abarghouei Nejad. "A Gauged Open 2-Brane String in thep-Brane Background." Advances in High Energy Physics 2016 (2016): 1–6. http://dx.doi.org/10.1155/2016/4638596.

Full text

Abstract:

We make a gauge theory from the Openp-brane system and map it into the Open 2-Brane one. Due to the presence of second-class constraints in this model, we encounter some problems during the procedure of quantization. In this regard, considering boundary conditions as Dirac conditions, one can drive the constrained structure of the model at first. Then, with the help of BFT formalism of constraint systems, the Open 2-Brane model is embedded into an extended phase space. For this purpose, we introduce some tensor fields to convert ungauged theory into the gauged one. This is the novel part of our research, while mostly scalar and vector fields are used to convert second-class constraints into first ones.

APA, Harvard, Vancouver, ISO, and other styles

34

Relich, Marcin. "An evaluation of project completion with application of fuzzy set theory." Management 16, no. 1 (May 1, 2012): 216–29. http://dx.doi.org/10.2478/v10286-012-0016-6.

Full text

Abstract:

An evaluation of project completion with application of fuzzy set theoryThe project management contains such elements as management of time, cost, communications, procurement, quality, risk or scope of project. Each of these fields can be considered as a set of constraints, and then there is a possibility to verify their fulfillment in sense of an enterprise's constraints and its environment. These constraints determine a completion of project activities and its success or failure, finally. The paper aims to present a problem of project management in terms of fuzzy constraints satisfaction problem, and then the using of constraint programming techniques to the evaluation of project completion. A fuzzy constraints satisfaction problem enables a description of data in distinct, as well as imprecise form, in a unified framework. It seems especially important in case of unique activities of project, when their estimation is based on linguistic information from experts.

APA, Harvard, Vancouver, ISO, and other styles

35

de Carvalho, Joaquim Brandao. "Formally-grounded phonology: From constraint-based theories to theory-based constraints." Studia Linguistica 56, no. 3 (December 2002): 227–63. http://dx.doi.org/10.1111/1467-9582.00093.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Gupta, Ajay. "Modified Theory of Constraints Heuristics(MTOCh1) Keeping Complete Shipment as Constraint." Universal Journal of Management 4, no. 12 (December 2016): 670–77. http://dx.doi.org/10.13189/ujm.2016.041203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Vaysman, Olga. "Against Richness of the Base: Evidence from Nganasan." Annual Meeting of the Berkeley Linguistics Society 28, no. 1 (August 14, 2002): 327. http://dx.doi.org/10.3765/bls.v28i1.3848.

Full text

Abstract:

Since Optimality Theory is a highly output-oriented grammatical theory, the strongest hypothesis is that all systematic, language-particular patterns are the result of output constraints, and that there is no other place from which such patterns can derive. In particular, input is not a level of derivation that can be constrained. This principle is known as Richness of the Base hypothesis, and it states that there are no constraints on the input structure of words, and that all linguistic constraints are statements on the surface structure only. In other words, Richness of the Base attributes all systematic phonological patterns to constraint rankings, not to difference in inputs. In this paper, I consider some consonant gradation facts from a Uralic Samoyedic language Nganasan, and argue that (at least the strict interpretation of) the Richness of the Base hypothesis runs into problems when we deal with full range of relevant data from this language, namely isolated words, compounds, and borrowings.

APA, Harvard, Vancouver, ISO, and other styles

38

Bennett, Wm G., and Natalie DelBusso. "Summing constraints in and across properties." Phonology 37, no. 3 (August 2020): 367–81. http://dx.doi.org/10.1017/s0952675720000172.

Full text

Abstract:

Work in Optimality Theory on the constraint set, Con, has often raised the question of whether certain types of constraints have multiple specific versions or are single general constraints that effectively sum the violations of specific variants. Comparing and evaluating analyses that differ in this way requires knowing the effect of this kind of summing on the full typology, which itself depends on the relationship of summands in the full system. Such relationships can be difficult to ascertain from inspecting violation profiles alone. This paper uses Property Theory to analyse the systematic effects of summing constraints in two distinct kinds of relationships: (i) across distinct properties, and (ii) within a constraint class in a single property. The results show how these two types collapse the typology in different, yet predictable, ways. Property Analysis provides a key to identifying constraint relationships and so to delineating the effect of summing.

APA, Harvard, Vancouver, ISO, and other styles

39

Gupta, Mahesh C., and Lynn H. Boyd. "Theory of constraints: a theory for operations management." International Journal of Operations & Production Management 28, no. 10 (September 12, 2008): 991–1012. http://dx.doi.org/10.1108/01443570810903122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

HOFFMANN, CHRISTOPH M., and ROBERT JOAN-ARINYO. "Symbolic Constraints in Constructive Geometric Constraint Solving." Journal of Symbolic Computation 23, no. 2-3 (February 1997): 287–99. http://dx.doi.org/10.1006/jsco.1996.0089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

GITMAN, D. M., and I. V. TYUTIN. "SYMMETRIES AND PHYSICAL FUNCTIONS IN GENERAL GAUGE THEORY." International Journal of Modern Physics A 21, no. 02 (January 20, 2006): 327–60. http://dx.doi.org/10.1142/s0217751x06024979.

Full text

Abstract:

The aim of the present paper is to describe the symmetry structure of a general gauge (singular) theory, and, in particular, to relate the structure of gauge transformations with the constraint structure of a theory in the Hamiltonian formulation. We demonstrate that the symmetry structure of a theory action can be completely revealed by solving the so-called symmetry equation. We develop a corresponding constructive procedure of solving the symmetry equation with the help of a special orthogonal basis for the constraints. Thus, we succeed in describing all the gauge transformations of a given action. We find the gauge charge as a decomposition in the orthogonal constraint basis. Thus, we establish a relation between the constraint structure of a theory and the structure of its gauge transformations. In particular, we demonstrate that, in the general case, the gauge charge cannot be constructed with the help of some complete set of first-class constraints alone, because the charge decomposition also contains second-class constraints. The above-mentioned procedure of solving the symmetry equation allows us to describe the structure of an arbitrary symmetry for a general singular action. Finally, using the revealed structure of an arbitrary gauge symmetry, we give a rigorous proof of the equivalence of two definitions of physicality condition in gauge theories: one of them states that physical functions are gauge-invariant on the extremals, and the other requires that physical functions commute with FCC (the Dirac conjecture).

APA, Harvard, Vancouver, ISO, and other styles

42

KHEYFETS, ARKADY, DANIEL E. HOLZ, and WARNER A. MILLER. "THE ISSUE OF TIME EVOLUTION IN QUANTUM GRAVITY." International Journal of Modern Physics A 11, no. 16 (June 30, 1996): 2977–3002. http://dx.doi.org/10.1142/s0217751x96001450.

Full text

Abstract:

We discuss the relation between the concept of time and the dynamic structure of quantum gravity. We briefly review the problems of time associated with the standard procedures of gravity quantization. By explicitly utilizing York’s analysis of the geometrodynamic degrees of freedom, and imposing the constraints as expectation value equations, we describe a new procedure of gravity quantization. In particular, this “minimally constrained canonical” quantization procedure leads to a linear Schrödinger equation augmented by the super-Hamiltonian and supermomentum constraints imposed on expectation values. This approach supplies a description of time evolution in quantum geometrodynamics free from the standard problems of time associated with canonical approaches. Furthermore, the theory is applicable to the full theory of general relativity, without the need to impose symmetries or reduce dimensionality. Using this method we arrive at an analytic expression for the quantum evolution of the Kasner cosmology, as well as a numerically generated solution of the quantized Taub model. The key new feature of this approach is that we impose the constraints weakly — instead of the quantum-mechanical wave function satisfying the constraints exactly, it need only satisfy them on average. Thus the constraints only constrain the observables.

APA, Harvard, Vancouver, ISO, and other styles

43

TROMBETTONI, GILLES, and MARTA WILCZKOWIAK. "GPDOF — A FAST ALGORITHM TO DECOMPOSE UNDER-CONSTRAINED GEOMETRIC CONSTRAINT SYSTEMS: APPLICATION TO 3D MODELING." International Journal of Computational Geometry & Applications 16, no. 05n06 (December 2006): 479–511. http://dx.doi.org/10.1142/s0218195906002154.

Full text

Abstract:

Our approach exploits a general-purpose decomposition algorithm, called GPDOF, and a dictionary of very efficient solving procedures, called r-methods, based on theorems of geometry. GPDOF decomposes an equation system into a sequence of small subsystems solved by r-methods, and produces a set of input parameters.1. Recursive assembly methods (decomposition-recombination), maximum matching based algorithms, and other famous propagation schema are not well-suited or cannot be easily extended to tackle geometric constraint systems that are under-constrained. In this paper, we show experimentally that, provided that redundant constraints have been removed from the system, GPDOF can quickly decompose large under-constrained systems of geometrical constraints. We have validated our approach by reconstructing, from images, 3D models of buildings using interactively introduced geometrical constraints. Models satisfying the set of linear, bilinear and quadratic geometric constraints are optimized to fit the image information. Our models contain several hundreds of equations. The constraint system is decomposed in a few seconds, and can then be solved in hundredths of seconds.

APA, Harvard, Vancouver, ISO, and other styles

44

Gouskova, Maria. "Relational hierarchies in Optimality Theory: the case of syllable contact." Phonology 21, no. 2 (August 2004): 201–50. http://dx.doi.org/10.1017/s095267570400020x.

Full text

Abstract:

A number of phonological laws require adjacent elements to stand a certain distance apart from each other on some prominence scale. For example, according to the Syllable Contact Law, the greater the sonority slope between the coda and the following onset, the better. Languages such as Faroese, Icelandic, Sidamo, Kazakh and Kirghiz select different thresholds for an acceptable sonority slope. This article proposes a theory for deriving hierarchies of relational constraints such as the Syllable Contact Law from prominence scales in the constraint set CON in Optimality Theory. The proposal is compared to two alternative approaches, non-hierarchical constraints and the local conjunction of constraint hierarchies, which are argued to make undesirable empirical and theoretical predictions.

APA, Harvard, Vancouver, ISO, and other styles

45

MANCARELLA, PAOLO, GIACOMO TERRENI, FARIBA SADRI, FRANCESCA TONI, and ULLE ENDRISS. "The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments." Theory and Practice of Logic Programming 9, no. 6 (August 14, 2009): 691–750. http://dx.doi.org/10.1017/s1471068409990093.

Full text

Abstract:

AbstractWe present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Finally, we describe the CIFF system, comparing it with state-of-the-art abductive systems and answer set solvers and showing how to use it to program some applications.

APA, Harvard, Vancouver, ISO, and other styles

46

Yang, B. "Eigenvalue Inclusion Principles for Distributed Gyroscopic Systems." Journal of Applied Mechanics 59, no. 3 (September 1, 1992): 650–56. http://dx.doi.org/10.1115/1.2893773.

Full text

Abstract:

In his famous treatise The Theory of Sound, Rayleigh enunciated an eigenvalue inclusion principle for the discrete, self-adjoint vibrating system under a constraint. According to this principle, the natural frequencies of the discrete system without and with the constraint are alternately located along the positive real axis. Although it is commonly believed that the same rule also applied for distributed vibrating systems, no proof has been given for the distributed gyroscopic system. This paper presents several eigenvalue inclusion principles for a class of distributed gyroscopic systems under pointwise constraints. A transfer function formulation is proposed to describe the constrained system. Five types of nondissipative constraints and their effects on the system natural frequencies are studied. It is shown that the transfer function formulation is a systematic and convenient way to handle constraint problems for the distributed gyroscopic system.

APA, Harvard, Vancouver, ISO, and other styles

47

Kelly, Matthew C., and René H. Germain. "Applying Theory of Constraints to Timber Harvesting." Croatian journal of forest engineering 41, no. 1 (November 5, 2019): 59–69. http://dx.doi.org/10.5552/crojfe.2020.534.

Full text

Abstract:

Logging firms are a critical link in wood supply chains, connecting forest landowners with markets for wood products. Improving operational planning can benefit individual logging firms as well as the larger wood supply chain in which they operate. Applying concepts from Theory of Constraints (TOC) to timber harvesting may help achieve greater predictability and efficiency when planning harvest operations. However, examples that demonstrate how TOC can improve logging operations are lacking. This study focuses on the analysis of production and activity data collected during the harvest of a temperate mixed hardwood forest in the Northeast United States using a chainsaw-forwarder system through a TOC lens. Specifically, the drum-buffer-rope (DBR) method was used to reschedule operator and machine activities such that a consistent flow of wood from stump to landing was maintained despite anticipated production setbacks. The results of this case study provide insights into the usefulness of applying TOC to logging operations. In particular, logging businesses must be able to estimate machine and operator productivity within a given harvest context to identify and exploit system constraints, while taking full advantage of unused capacity of any non-constraint functions.

APA, Harvard, Vancouver, ISO, and other styles

48

Potts, Christopher, and Geoffrey K. Pullum. "Model theory and the content of OT constraints." Phonology 19, no. 3 (December 2002): 361–93. http://dx.doi.org/10.1017/s0952675703004408.

Full text

Abstract:

We develop an extensible description logic for stating the content of optimality-theoretic constraints in phonology, and specify a class of structures for interpreting it. The aim is a transparent formalisation of OT. We show how to state a wide range of constraints, including markedness, input–output faithfulness and base–reduplicant faithfulness. However, output–output correspondence and ‘intercandidate’ sympathy are revealed to be problematic: it is unclear that any reasonable class of structures can reconstruct their proponents' intentions. But our contribution is positive. Proponents of both output–output correspondence and sympathy have offered alternatives that fit into the general OT picture. We show how to state these in a reasonable extension of our formalism. The problematic constraint types were developed to deal with opaque phenomena. We hope to shed new light on the debate about how to handle opacity, by subjecting some common responses to it within OT to critical investigation.

APA, Harvard, Vancouver, ISO, and other styles

49

Ren, Xiu. "Multi-Project Human Resource Constrained Allocation Based on Theory of Constraints." International Journal of u- and e- Service, Science and Technology 9, no. 9 (September 30, 2016): 383–94. http://dx.doi.org/10.14257/ijunesst.2016.9.9.35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

LYAKHOVICH, SIMON L., and ROBERT MARNELIUS. "EXTENDED OBSERVABLES IN HAMILTONIAN THEORIES WITH CONSTRAINTS." International Journal of Modern Physics A 16, no. 26 (October 20, 2001): 4271–96. http://dx.doi.org/10.1142/s0217751x01005316.

Full text

Abstract:

In a classical Hamiltonian theory with second-class constraints the phase space functions on the constraint surface are observables. We give general formulas for extended observables, which are expressions representing the observables in the enveloping unconstrained phase space. These expressions satisfy in the unconstrained phase space a Poisson algebra of the same form as the Dirac bracket algebra of the observables on the constraint surface. The general formulas involve new differential operators that differentiate the Dirac bracket. Similar extended observables are also constructed for theories with first-class constraints which, however, are gauge-dependent. For such theories one may also construct gauge-invariant extensions with similar properties. Whenever extended observables exist the theory is expected to allow for a covariant quantization. A mapping procedure is proposed for covariant quantization of theories with second-class constraints.

APA, Harvard, Vancouver, ISO, and other styles

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!