Log in

Relevant bibliographies by topics / Multiple constraints / Journal articles

Journal articles on the topic 'Multiple constraints'

To see the other types of publications on this topic, follow the link: Multiple constraints.

Author: Grafiati

Published: 4 June 2021

Last updated: 30 January 2023

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 'Multiple 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

Gan, Yan, Junxin Gong, Mao Ye, Yang Qian, Kedi Liu, and Su Zhang. "GANs with Multiple Constraints for Image Translation." Complexity 2018 (December 9, 2018): 1–12. http://dx.doi.org/10.1155/2018/4613935.

Full text

Abstract:

Unpaired image translation is a challenging problem in computer vision, while existing generative adversarial networks (GANs) models mainly use the adversarial loss and other constraints to model. But the degree of constraint imposed on the generator and the discriminator is not enough, which results in bad image quality. In addition, we find that the current GANs-based models have not yet been implemented by adding an auxiliary domain, which is used to constrain the generator. To solve the problem mentioned above, we propose a multiscale and multilevel GANs (MMGANs) model for image translation. In this model, we add an auxiliary domain to constrain generator, which combines this auxiliary domain with the original domains for modelling and helps generator learn the detailed content of the image. Then we use multiscale and multilevel feature matching to constrain the discriminator. The purpose is to make the training process as stable as possible. Finally, we conduct experiments on six image translation tasks. The results verify the validity of the proposed model.

APA, Harvard, Vancouver, ISO, and other styles

2

Brosowsky, Mathis, Florian Keck, Olaf Dünkel, and Marius Zöllner. "Sample-Specific Output Constraints for Neural Networks." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 8 (May 18, 2021): 6812–21. http://dx.doi.org/10.1609/aaai.v35i8.16841.

Full text

Abstract:

It is common practice to constrain the output space of a neural network with the final layer to a problem-specific value range. However, for many tasks it is desired to restrict the output space for each input independently to a different subdomain with a non-trivial geometry, e.g. in safety-critical applications, to exclude hazardous outputs sample-wise. We propose ConstraintNet—a scalable neural network architecture which constrains the output space in each forward pass independently. Contrary to prior approaches, which perform a projection in the final layer, ConstraintNet applies an input-dependent parametrization of the constrained output space. Thereby, the complete interior of the constrained region is covered and computational costs are reduced significantly. For constraints in form of convex polytopes, we leverage the vertex representation to specify the parametrization. The second modification consists of adding an auxiliary input in form of a tensor description of the constraint to enable the handling of multiple constraints for the same sample. Finally, ConstraintNet is end-to-end trainable with almost no overhead in the forward and backward pass. We demonstrate ConstraintNet on two regression tasks: First, we modify a CNN and construct several constraints for facial landmark detection tasks. Second, we demonstrate the application to a follow object controller for vehicles and accomplish safe reinforcement learning in this case. In both experiments, ConstraintNet improves performance and we conclude that our approach is promising for applying neural networks in safety-critical environments.

APA, Harvard, Vancouver, ISO, and other styles

3

TYAN, CHING-YU, PAUL P. WANG, and DENNIS R. BAHLER. "THE DESIGN OF AN ADAPTIVE MULTIPLE AGENT FUZZY CONSTRAINT-BASED CONTROLLER (MAFCC) FOR A COMPLEX HYDRAULIC SYSTEM." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 04, no. 06 (December 1996): 537–51. http://dx.doi.org/10.1142/s0218488596000299.

Full text

Abstract:

In this paper, we present a complete design framework for an adaptive multiple agent fuzzy constraint-based controller (MAFCC) based on fuzzy penumbra constraint processing in each fuzzy constraint subnetwork collaborating with a connected constraint network and its corresponding semantic modeling in a first-order predicate calculus (FOPC) language, with application to a complex hydraulic system. The concept of “multiple agent” and “fuzzy constraint subnetwork” in a complex control system is introduced and some basic definitions of penumbra fuzzy constraint processing in a constraint subnetwork and the collaboration with an overall connected constraint network and its semantic modeling are addressed. As a result, a human agent interacts with system agents and allows the constraints to be added or deleted on-line according to the constraints imposed from the outside environment. Near-optimal system performance is accomplished by restricting all the penumbra constraints to be satisfied in each constraint subnetwork simultaneously which are interconnected as a result of constraints that exist between each of them. Following the principle of constraint satisfaction and fuzzy local propagation reasoning, each individual system agent is now constrained to behave in a certain fashion as dictated by the overall constraint network. In addition, the constraint network in MAFCC system provides an update strategy which makes a real time adaptive hydraulic control for all 20 cities possible.

APA, Harvard, Vancouver, ISO, and other styles

4

Huang, C. W., and K. W. Chou. "Volume Adjustable Topology Optimization with Multiple Displacement Constraints." Journal of Mechanics 34, no. 6 (August 18, 2017): 759–70. http://dx.doi.org/10.1017/jmech.2017.68.

Full text

Abstract:

AbstractMost topology optimization methods seek optimal topologies that satisfy a minimum compliance with a pre-specified volume constraint in the design domain. However, practical designs often include various functional constraints and the optimal solid volume ratios are unknown a priori, which implies a gap between topology optimization methods and practical designs in industries. This paper studies the performance-based topology optimization (PTO) problem that searches for the optimal topology with minimum compliance to satisfy the pre-specified functional constraints without a pre-specified volume constraint. A novel element-based evolutionary switching method (ESM), which can automatically adjust solid volume ratio and material distribution, is developed and implemented using the commercial finite element software ABAQUS. The effects of displacement constraints on the optimal topologies are investigated, and the differences between PTO problems and the topology optimization problem which has a volume constraint are discussed. Numerical examples demonstrate that the optimal topologies are mainly determined by the load pattern and locally changed with respect to the location of the active displacement constraints. In addition, the displacement constraints to a large extent control the solid volume ratio of optimal topologies according to the allowable displacements in PTO problems. Finally, the proposed ESM could provide conservative solutions to the topology optimization with multiple displacement constraints problems.

APA, Harvard, Vancouver, ISO, and other styles

5

Yu, Chun-Mei, Dang-Jun Zhao, and Ye Yang. "Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method." International Journal of Aerospace Engineering 2019 (May 2, 2019): 1–9. http://dx.doi.org/10.1155/2019/1414279.

Full text

Abstract:

A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal load, and multiple no-fly zones. The Chebyshev-Gauss Legend (CGL) node points are used to transcribe the original dynamic constraint into algebraic equality constraint; therefore, a nonlinear programming (NLP) problem is concave and time-consuming to be solved. The iterative linearization and convexification techniques are proposed to convert the concave constraints into convex constraints; therefore, a sequential convex programming problem can be efficiently solved by convex algorithms. Numerical results and a comparison study reveal that the proposed method is efficient and effective to solve the problem of reentry trajectory optimization with multiple constraints.

APA, Harvard, Vancouver, ISO, and other styles

6

Huang, Yue. "Heterogeneous Data Clustering Considering Multiple User-provided Constraints." International Journal of Computers Communications & Control 14, no. 2 (April 14, 2019): 170–82. http://dx.doi.org/10.15837/ijccc.2019.2.3419.

Full text

Abstract:

Clustering on heterogeneous networks which consist of multi-typed objects and links has proved to be a useful technique in many scenarios. Although numerous clustering methods have achieved remarkable success, current clustering methods for heterogeneous networks tend to consider only internal information of the dataset. In order to utilize background domain knowledge, we propose a general framework for clustering heterogeneous data considering multiple user-provided constrains. Specifically, we summarize that three types of manual constraints on the object can be used to guide the clustering process. Then we propose the User- HeteClus algorithm to solve the key issues in the case of star-structure heterogeneous data, which incorporating the user constraint into similarity measurement between central objects. Experiments on a real-world dataset show the effectiveness of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

7

Barhorst, A. A., and L. J. Everett. "Contact/Impact in Hybrid Parameter Multiple Body Mechanical Systems." Journal of Dynamic Systems, Measurement, and Control 117, no. 4 (December 1, 1995): 559–69. http://dx.doi.org/10.1115/1.2801115.

Full text

Abstract:

The multiple motion regime (free/constrained) dynamics of hybrid parameter multiple body (HPMB) systems is addressed. Impact response has characteristically been analyzed using impulse-momentum techniques. Unfortunately, the classical methods for modeling complex HPMB systems are energy based and have proven ineffectual at modeling impact. The problems are exacerbated by the problematic nature of time varying constraint conditions. This paper outlines the reformulation of a recently developed HPMB system modeling methodology into an impulse-momentum formulation, which systematically handles the constraints and impact. The starting point for this reformulation is a variational calculus based methodology. The variational roots of the methodology allows rigorous equation formulation which includes the complete nonlinear hybrid differential equations and boundary conditions. Because the methodology presented in this paper is formulated in the constraint-free subspace of the configuration space, both holonomic and nonholonomic constraints are automatically satisfied. As a result, the constraint-addition/deletion algorithms are not needed. Generalized forces of constraint can be directly calculated via the methodology, so the condition for switching from one motion regime to another is readily determined. The resulting equations provides a means to determine after impact velocities (and velocity fields for distributed bodies) which provide the after collision initial conditions. Finally the paper demonstrates, via example, how to apply the methodology to contact/impact in robotic manipulators and structural systems.

APA, Harvard, Vancouver, ISO, and other styles

8

Galison, Peter. "Multiple Constraints, Simultaneous Solutions." PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988, no. 2 (January 1988): 157–63. http://dx.doi.org/10.1086/psaprocbienmeetp.1988.2.192880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Coroianu, Lucian, Robert Fullér, Marek Gagolewski, and Simon James. "Constrained ordered weighted averaging aggregation with multiple comonotone constraints." Fuzzy Sets and Systems 395 (September 2020): 21–39. http://dx.doi.org/10.1016/j.fss.2019.09.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kong, Feng, and Dong Dou. "Resource-Constrained Project Scheduling Problem under Multiple Time Constraints." Journal of Construction Engineering and Management 147, no. 2 (February 2021): 04020170. http://dx.doi.org/10.1061/(asce)co.1943-7862.0001990.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

12

Srivatsan, R., D. A. Hoeltzel, and A. Das. "An Analytical Method for the Identification of Redundant Constraints in Multiple-Loop Spatial Mechanisms." Journal of Mechanical Design 115, no. 2 (June 1, 1993): 324–31. http://dx.doi.org/10.1115/1.2919195.

Full text

Abstract:

An analytical method for the explicit identification of redundant constraints in multiple-loop spatial mechanisms is presented. The kinematic constraint equations for each independent loop of multiple-loop mechanisms are developed. The independence of these equations is established and used to detect the presence of redundant constraints. The nature of the redundant constraints present is indicated by the type of redundant kinematic constraint equations present. Interaction of the constraints of adjacent loops in a multiple-loop mechanism also has to be taken into account. An example which illustrates the identification of redundant constraints in a cardan joint has been included to demonstrate the utility of this approach for real-world mechanism design problems. General guidelines for the elimination of redundant constraints, following their identification, are also provided.

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Chengming, Li Liu, Zhaoxin Dai, and Xiaoli Liu. "Different Sourcing Point of Interest Matching Method Considering Multiple Constraints." ISPRS International Journal of Geo-Information 9, no. 4 (March 31, 2020): 214. http://dx.doi.org/10.3390/ijgi9040214.

Full text

Abstract:

Point of interest (POI) matching is critical but is the most technically difficult part of multi-source POI fusion. The accurate matching of POIs from different sources is important for the effective reuse of POI data. However, the existing research on POI matching usually adopts weak constraints, which leads to a low POI matching accuracy. To address the shortcomings of previous studies, this paper proposes a POI matching method with multiple determination constraints. First, according to various attributes (name, class, and spatial location), a new calculation model considering spatial topology, name role labeling, and bottom-up class constraints is established. In addition, the optimal threshold values corresponding to the different attribute constraints are determined. Second, according to the multiattribute constraint values and optimal thresholds, a constraint model with multiple strict determination constraints is proposed. Finally, actual POI data from Baidu Map and Gaode Map in Dongying city is used to validate the method. Comparing to the existing method, the accuracy and recall of the proposed method increase 0.3% and 7.1%, respectively. The experimental results demonstrate that the proposed POI matching method attains a high matching accuracy and high feasibility.

APA, Harvard, Vancouver, ISO, and other styles

14

Yu, Haidong, Jian Zhang, and Hao Wang. "Dynamic performance of over-constrained planar mechanisms with multiple revolute clearance joints." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 232, no. 19 (October 30, 2017): 3524–37. http://dx.doi.org/10.1177/0954406217738032.

Full text

Abstract:

The clearances of joints in a rigid multibody system may deteriorate the motion accuracy and even cause vibrations, noise and fatigue failure of structures. In over-constrained mechanisms, the number of degree-of-freedoms is more than that of independent coordinates which leads to numerical challenges in solving the underdetermined force equilibrium equations. A comprehensive study on the dynamic model and the performance of an over-constrained planar parallelogram mechanism with multiple clearance joints is presented in this paper. Since a common angular coordinate exists in the clearance joint associated with the redundant constraint, the degree-of-freedoms are revised by eliminating the number of redundant constraints. In planar analysis, the location of mass center and the orientation of the body reference with respect to the inertial frame are selected as the generalized coordinates of the components. Clearance joints are equivalent as the spring-damper elements and the contact forces are introduced into the dynamic equations by force constraints. The developed computational algorithm is implemented by MATLAB and may analyze the dynamic performance of this mechanism due to the elimination of kinematic constraints and the nonlinear contact-impact behavior in the clearance joints. Meanwhile, an orthogonal experimental design based on a quantitative analysis method demonstrates that the clearance size and the location of clearance joints affect the kinematic accuracy and counterbalance moment of the mechanism.

APA, Harvard, Vancouver, ISO, and other styles

15

Nilasari, Laylatul Febriana, Kiswara Agung Santoso, and Abduh Riski. "PENERAPAN DRAGONFLY OPTIMIZATION ALGORITHM (DOA) PADA PERMASALAHAN MULTIPLE CONSTRAINTS BOUNDED KNAPSACK." Majalah Ilmiah Matematika dan Statistika 19, no. 1 (March 1, 2019): 39. http://dx.doi.org/10.19184/mims.v19i1.17264.

Full text

Abstract:

Optimization is very useful in almost all fields in running a business effectively and efficiently to achieve the desired results. This study solves the problem of multiple constraints bounded knapsack by implementing DOA. The problem of multiple constraints bounded knapsack has more than ones constraint with objects that are entered into the storage media, the dimensions can be partially or completely included, but the number of objects is limited. The purpose of this study is to determine the results of using DOA to solve multiple constraits bounded knapsack and the effectiveness of DOA compared to the results of the Simplex method. The data used in this study are primary data. There are ten parameters to be tested, namely population parameters, maximum iteration, s, a, c, f, e and range. The trial results of the ten parameters show that the best value of the parameters is neither too large nor too small. If the best value is too large then the position of the dragonfly will be randomized so that it is not clear the position of the dragonfly and if it is too small the best value then the change is not visible. In addition, based on the results of the final experiment it can be seen that DOA is less effective in solving multiple constraints bounded knapsack problems, because of many experiments there is no solution similar to Simplex. DOA approach to optimal, seen from a small deviation. Keywords: DOA, Knapsack, Multiple constraints bounded knapsack problem.

APA, Harvard, Vancouver, ISO, and other styles

16

Chen, Zhiping, Shen Peng, and Abdel Lisser. "A sparse chance constrained portfolio selection model with multiple constraints." Journal of Global Optimization 77, no. 4 (March 17, 2020): 825–52. http://dx.doi.org/10.1007/s10898-020-00901-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Li, Dong, Suping Peng, Rui Zhang, Yinling Guo, Yongxu Lu, and Xiaoqin Cui. "Prestack seismic inversion with structural constraints." Interpretation 9, no. 2 (May 1, 2021): T495—T506. http://dx.doi.org/10.1190/int-2020-0209.1.

Full text

Abstract:

Prestack seismic inversion usually suffers from a lower signal-to-noise ratio, which could result in unstable inversion results. The conventional multitrace lateral constrained inversion blurs steeply dipping layers, whereas the simple structural constrained inversion is affected by noise. To solve this issue, an inversion method with multiple constraints is proposed, which include (1) a local smoothing operator is used to suppress the inversion anomalies caused by data noise, (2) a difference operator is used to protect the stratum boundary, and (3) a structural dipping constraint is used to enhance the characterization of the possible dipping stratum. The multiconstraint inversion (MCI) method suppresses the inversion anomalies caused by data noise without blurring the stratum boundary. The effects of different constraints in the inversion process and the influence of noise on the inversion results are analyzed. In MCI, the regularization coefficient of each constraint operator is dynamically changed, thereby controlling the significance of each regularization term in the inversion. The proposed algorithm is tested on synthetic and field data, which demonstrate its effectiveness and improved accuracy on the inversion results.

APA, Harvard, Vancouver, ISO, and other styles

18

MYERS, GENE, SANFORD SELZNICK, ZHENG ZHANG, and WEBB MILLER. "Progressive Multiple Alignment with Constraints." Journal of Computational Biology 3, no. 4 (January 1996): 563–72. http://dx.doi.org/10.1089/cmb.1996.3.563.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Kurlander, David, and Steven Feiner. "Inferring constraints from multiple snapshots." ACM Transactions on Graphics 12, no. 4 (October 1993): 277–304. http://dx.doi.org/10.1145/159730.159731.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Trommer, Jochen. "Constraints on multiple-feature mutation." Lingua 122, no. 11 (September 2012): 1182–92. http://dx.doi.org/10.1016/j.lingua.2012.05.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Jiao, Ying, Olivier Klopfenstein, and Peter Tankov. "Hedging under multiple risk constraints." Finance and Stochastics 21, no. 2 (March 13, 2017): 361–96. http://dx.doi.org/10.1007/s00780-017-0326-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Prasanth, Ravi K., and Mario A. Rotea. "Interpolation with multiple norm constraints." Mathematics of Control, Signals, and Systems 10, no. 2 (June 1997): 165–87. http://dx.doi.org/10.1007/bf01213384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bauer, Mark. "Multiple Realizability, Constraints, and Identity." Pacific Philosophical Quarterly 94, no. 4 (May 22, 2013): 446–64. http://dx.doi.org/10.1111/papq.12008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Patt-Shamir, Boaz, and Dror Rawitz. "Video distribution under multiple constraints." Theoretical Computer Science 412, no. 29 (July 2011): 3717–30. http://dx.doi.org/10.1016/j.tcs.2011.03.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pan, Yiyong. "Lagrangian Relaxation for the Multiple Constrained Robust Shortest Path Problem." Mathematical Problems in Engineering 2019 (June 27, 2019): 1–13. http://dx.doi.org/10.1155/2019/3987278.

Full text

Abstract:

The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered. Nonlinear optimization model is developed to model constrained robust shortest path problem. The dual nature of the proposed problem is deduced based on the Lagrangian duality theory. An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem. An extension problem that considers multiple constraints is discussed. Numerical studies indicate that the proposed algorithm is efficient in terms of obtaining the close-to-optimal solutions within reasonable computational times.

APA, Harvard, Vancouver, ISO, and other styles

26

Williams, Carmen Braun. "Counseling African American Women: Multiple Identities-Multiple Constraints." Journal of Counseling & Development 83, no. 3 (July 2005): 278–83. http://dx.doi.org/10.1002/j.1556-6678.2005.tb00343.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Fan, Yafeng, Jing Jiang, and Zuohao Hu. "More or less? The effects of financial constraints on variety-seeking behavior." Journal of Contemporary Marketing Science 3, no. 2 (July 6, 2020): 195–205. http://dx.doi.org/10.1108/jcmars-01-2020-0004.

Full text

Abstract:

PurposeIn daily life, consumers usually experience economic limitations on their consumption, which in turn results in experiencing financial constraints. The purpose of this article is to examine how feeling financially constrained influences variety seeking in consumption.Design/methodology/approachThe authors conducted three experiments to test the proposed hypotheses by applying multiple methods of manipulation of financial constraints and different measures of variety seeking.FindingsThe authors found that feeling financially constrained increases consumers’ insecurity, which in turn decreases their variety-seeking behavior. Additionally, the authors noted that individuals’ positive illusion could moderate the aforementioned effect. The negative effect of financial constraints on variety seeking only existed among consumers with a low positive illusion.Practical implicationsThe findings in this article could help marketers attain a better understanding of consumers’ choices under financial constraints and could help retailers optimize their product lines and distribution.Originality/valueThis research marks the first attempt to examine the relationship between financial constraint and variety seeking. The findings make for a valuable addition to both the financial constraint and variety-seeking literature reviews. The research study also extends the literature on how insecurity and positive illusion influence individuals’ decisions in the consumption context.

APA, Harvard, Vancouver, ISO, and other styles

28

Karlsson, Fred. "Constraints on multiple initial embedding of clauses." International Journal of Corpus Linguistics 12, no. 1 (March 16, 2007): 107–18. http://dx.doi.org/10.1075/ijcl.12.1.07kar.

Full text

Abstract:

The received view is that there are no constraints on clausal embedding complexity in sentences. This hypothesis will be challenged here on empirical grounds from the viewpoint of multiple initial embedding of clauses. The data come from the British National Corpus, Brown, LOB, and philological scholarship. The results extend to several other ‘Standard Average European’ (SAE) languages like Finnish, German, Latin, and Swedish. There is a precise quantitative constraint on the degree of initial clausal embedding, and that limit is two. In double initial embeddings, a qualitative constraint prescribes that typically the highest embedded clause is an if-clause. The lower embedded clause should be the sentential subject of the if-clause. Here is a real example of a maximally complex, prototypical, initial clausal embedding in mainstream SAE: [Main [Init–1 If [Init–2 what is tantamount to dictatorship …] continues in a union] it can …] (LOB). Multiple initial self-embeddings are prohibited.

APA, Harvard, Vancouver, ISO, and other styles

29

Beatens, Jan. "Expanding the Field of Constraint: Novelization as an Example of Multiply Constrained Writing." Tekstualia 1, no. 60 (May 5, 2020): 113–40. http://dx.doi.org/10.5604/01.3001.0014.1366.

Full text

Abstract:

This essay deals with the question of the multiple constraints that determine the production of highly commercialized literature, namely, novelization. As a literary genre, novelization is easy to defi ne: it is the novelistic adaptation of an original fi lm or, more specifi cally, of the screenplay of this fi lm. As a cultural practice, however, novelization is hardly known, given its lack of prestige, hence its near-absence in the scholarly fi eld (novelizations seem so „bad” that nobody thinks they deserve any serious interest). In cultural and institutional terms, novelizations are blatant examples of commercial literature, that is, literature not written at the initiative of an idividual author eager to give a personal form to certain ideas or feelings but ordered by a publisher to fulfi ll certain commercial needs. Despite all the prejudices against the genre, however, novelization is a fascinating literary practice which can fruitfully be studied via the notion of constraint. At the same time, the notion of constraint can be usefully enriched by the example of novelization, which brings to the fore aspects that are less clearly seen when one focuses on high or elite literature. The essay presents, fi rst, some aspects of the genre, which is less simple or homogeneous than it may appear. Second, it discusses a seminal article that has opened the mainly form-oriented domain of constrained writing to the broader fi eld of cultural and institutional constraints: R.A. Peterson’s „Five Constraints on the Production of Culture: Law, Technology, Market, Organizational Structure, and Occupational Careers” (1982). Third, the essay offers a comparative analysis of the novelization genre in various cultural environments, reusing Peterson’s set of institutional and cultural constraints. The case study of novelization demonstrates that constrained writing is not simply a matter of obeying internal formal constraints, as is generally believed, but also of following external, institutional constraints: the latter are less known due to the fact that the most often cited and studied examples of constrained writing belong to literary genres or domains where these external constraints are less directly felt.

APA, Harvard, Vancouver, ISO, and other styles

30

Chevalier, Aline, and Julien Cegarra. "A Constraint-Satisfaction Approach to Studying the Management of Multiple Objectives in Design Problem-Solving." Psychological Reports 99, no. 2 (October 2006): 488–93. http://dx.doi.org/10.2466/pr0.99.2.488-493.

Full text

Abstract:

How professional and novice designers manage multiple objectives through constraint satisfaction was studied. An objective is defined as a network of constraints; a constraint is characterized as related to a source (internal or external) and an addressee (e.g., client or user). It has been shown that designers favour objectives related to external constraint (e.g., data from the task) and to the client. Generally, client and external constraints are identical. To study the management of multiple objectives, fifteen web site designers were instructed to design a site according to user's objectives or client's objectives. Our results indicate that the validity status allocated to constraints is more determined by the status of the addressee than by the status of the source, whatever the objective condition that must be satisfied. Possible methodological generalizations are discussed.

APA, Harvard, Vancouver, ISO, and other styles

31

Haraguchi, Kazuya, and Yuichi Sato. "SAMPLING SITE LOCATION PROBLEM IN LAKE MONITORING HAVING MULTIPLE PURPOSES AND CONSTRAINTS." Journal of the Operations Research Society of Japan 53, no. 4 (2010): 289–304. http://dx.doi.org/10.15807/jorsj.53.289.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Zhuang, Yongjie, and Yangfan Liu. "A constrained adaptive active noise control filter design method via online convex optimization." Journal of the Acoustical Society of America 152, no. 4 (October 2022): A98. http://dx.doi.org/10.1121/10.0015669.

Full text

Abstract:

In practical active noise control (ANC) applications, various types of constraints may need to be satisfied, e.g., robust stability, disturbance enhancement, and filter output power constraint. Some adaptive filters such as leaky LMS have been developed to apply required constraints indirectly. However, when multiple constraints are required simultaneously, satisfactory noise performance is difficult to achieve by tuning only one leaky factor. Another filter design approach that may achieve better noise control performance is to solve a constrained optimization problem. But the computational complexity of solving such a constrained optimization problem for ANC applications is usually too high even for offline design. Recently, a convex optimization reformulation is proposed which significantly reduces the required computational effort in solving constrained optimization problems for active noise control applications. In the current work, a constrained adaptive ANC filter design method is proposed. The previously proposed convex formulation is improved so that it can be implemented in real-time. The optimal filter coefficients are then redesigned continuously using online convex optimization when the environment is time-varying.

APA, Harvard, Vancouver, ISO, and other styles

33

Yu, Hao, and Vincent K. N. Lau. "Rank-Constrained Schur-Convex Optimization With Multiple Trace/Log-Det Constraints." IEEE Transactions on Signal Processing 59, no. 1 (January 2011): 304–14. http://dx.doi.org/10.1109/tsp.2010.2084997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Mensah, Joseph Agyapong, Louis Asiedu, Felix O. Mettle, and Samuel Iddi. "Assessing the Performance of DWT-PCA/SVD Face Recognition Algorithm under Multiple Constraints." Journal of Applied Mathematics 2021 (September 20, 2021): 1–12. http://dx.doi.org/10.1155/2021/7060270.

Full text

Abstract:

Many architectures of face recognition modules have been developed to tackle the challenges posed by varying environmental constraints such as illumination, occlusions, pose, and expressions. These recognition systems have mainly focused on a single constraint at a time and have achieved remarkable successes. However, the presence of multiple constraints may deteriorate the performance of these face recognition systems. In this study, we assessed the performance of Principal Component Analysis and Singular Value Decomposition using Discrete Wavelet Transform (DWT-PCA/SVD) for preprocessing face recognition algorithm on multiple constraints (partially occluded face images acquired with varying expressions). Numerical evaluation of the study algorithm gave reasonably average recognition rates of 77.31% and 76.85% for left and right reconstructed face images with varying expressions, respectively. A statistically significant difference was established between the average recognition distance of the left and right reconstructed face images acquired with varying expressions using pairwise comparison test. The post hoc analysis using the Bonferroni simultaneous confidence interval revealed that the significant difference established through the pairwise comparison test was mainly due to the sad expressions. Although the performance of the DWT-PCA/SVD algorithm declined as compared to its performance on single constraints, the algorithm attained appreciable performance level under multiple constraints. The DWT-PCA/SVD recognition algorithm performs reasonably well for recognition when partial occlusion with varying expressions is the underlying constraint.

APA, Harvard, Vancouver, ISO, and other styles

35

Ge, Dongming, Guanghui Sun, and Hamid Reza Karimi. "Robust Anti-Windup Control Considering Multiple Design Objectives." Mathematical Problems in Engineering 2012 (2012): 1–13. http://dx.doi.org/10.1155/2012/586279.

Full text

Abstract:

A new saturation control technique is proposed to design multiobjective and robust anti-windup controllers for linear systems with input saturations. Based on the characterization of saturation nonlinearities and modeling uncertainties via integral quadratic constraints (IQCs), this method considers a mixedH2/H∞performance indexes while maintaining dynamic constraints on the controller. The analysis and synthesis conditions are presented in terms of scaled linear matrix inequalities (LMIs). The proposed control algorithm can improve the performance of the input-constrained system while also guaranteeing robustness with respect to the modeling uncertainties. Finally, a numerical example is given to illustrate the effectiveness of the developed techniques.

APA, Harvard, Vancouver, ISO, and other styles

36

Moorthy, Yamuna K., Sakuntala S. Pillai, and G. Shiny. "Energy-Efficient Multiple Relay Selection in Cognitive Radio Networks." Defence Science Journal 68, no. 3 (April 16, 2018): 295. http://dx.doi.org/10.14429/dsj.68.11758.

Full text

Abstract:

Cognitive Radios play very important role in military applications due to their capability to adapt intelligently according to the prevailing environmental conditions. Relays form the main communication enablers in infrastructure-less networks. In this paper, relay selection for increasing the energy efficiency of a cognitive radio network is considered. The proposed approach considers the multiple - relay selection scheme with strict outage probability constraints. Energy maximisation is posed as an optimisation problem, the solution to which shows that relay selection under outage constraints is different from the one without such a constraint. It can be observed from the simulations that energy efficiency and outage behaviour follows trade-off relations. Moreover, the original Branch and Bound algorithm has been re-designed for faster convergence. It has also been demonstrated that when strict outage constraints are imposed, the optimal number of relays selected will be more in comparison to the case where there is no outage consideration.

APA, Harvard, Vancouver, ISO, and other styles

37

Miguel de Almeida Areias, Pedro, Timon Rabczuk, and Joaquim Infante Barbosa. "The extended unsymmetric frontal solution for multiple-point constraints." Engineering Computations 31, no. 7 (September 30, 2014): 1582–607. http://dx.doi.org/10.1108/ec-10-2013-0263.

Full text

Abstract:

Purpose – The purpose of this paper is to discuss the linear solution of equality constrained problems by using the Frontal solution method without explicit assembling. Design/methodology/approach – Re-written frontal solution method with a priori pivot and front sequence. OpenMP parallelization, nearly linear (in elimination and substitution) up to 40 threads. Constraints enforced at the local assembling stage. Findings – When compared with both standard sparse solvers and classical frontal implementations, memory requirements and code size are significantly reduced. Research limitations/implications – Large, non-linear problems with constraints typically make use of the Newton method with Lagrange multipliers. In the context of the solution of problems with large number of constraints, the matrix transformation methods (MTM) are often more cost-effective. The paper presents a complete solution, with topological ordering, for this problem. Practical implications – A complete software package in Fortran 2003 is described. Examples of clique-based problems are shown with large systems solved in core. Social implications – More realistic non-linear problems can be solved with this Frontal code at the core of the Newton method. Originality/value – Use of topological ordering of constraints. A-priori pivot and front sequences. No need for symbolic assembling. Constraints treated at the core of the Frontal solver. Use of OpenMP in the main Frontal loop, now quantified. Availability of Software.

APA, Harvard, Vancouver, ISO, and other styles

38

Geirsson, Heimir. "Multiple Realizability, Physical Constraints, and Possibilities." Southwest Philosophy Review 27, no. 2 (2011): 53–56. http://dx.doi.org/10.5840/swphilreview201127237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Tistarelli, M. "Multiple constraints to compute optical flow." IEEE Transactions on Pattern Analysis and Machine Intelligence 18, no. 12 (1996): 1243–50. http://dx.doi.org/10.1109/34.546260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Chern, Maw-Sheng, and Rong-Hong Jan. "Reliability Optimization Problems with Multiple Constraints." IEEE Transactions on Reliability 35, no. 4 (1986): 431–36. http://dx.doi.org/10.1109/tr.1986.4335497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Pisinger, David. "Budgeting with bounded multiple-choice constraints." European Journal of Operational Research 129, no. 3 (March 2001): 471–80. http://dx.doi.org/10.1016/s0377-2217(99)00451-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

van Buuren, Stef, and Jan de Leeuv. "Equality Constraints in Multiple Correspondence Analysis." Multivariate Behavioral Research 27, no. 4 (October 1992): 567–83. http://dx.doi.org/10.1207/s15327906mbr2704_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

CHAPMAN, S. J., and S. E. MCBURNIE. "Integral constraints in multiple-scales problems." European Journal of Applied Mathematics 26, no. 5 (January 13, 2015): 595–614. http://dx.doi.org/10.1017/s0956792514000412.

Full text

Abstract:

Asymptotic homogenisation via the method of multiple scales is considered for problems in which the microstructure comprises inclusions of one material embedded in a matrix formed from another. In particular, problems are considered in which the interface conditions include a global balance law in the form of an integral constraint; this may be zero net charge on the inclusion, for example. It is shown that for such problems care must be taken in determining the precise location of the interface; a naive approach leads to an incorrect homogenised model. The method is applied to the problems of perfectly dielectric inclusions in an insulator, and acoustic wave propagation through a bubbly fluid in which the gas density is taken to be negligible.

APA, Harvard, Vancouver, ISO, and other styles

44

Guang-yuan, Li, Cao Dan-yang, and Guo Jian-wei. "Association Rules Mining with Multiple Constraints." Procedia Engineering 15 (2011): 1678–83. http://dx.doi.org/10.1016/j.proeng.2011.08.313.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Chen, An, Thai Nguyen, and Mitja Stadje. "Risk management with multiple VaR constraints." Mathematical Methods of Operations Research 88, no. 2 (May 9, 2018): 297–337. http://dx.doi.org/10.1007/s00186-018-0637-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Goel, Tirupam, Ulf Lewrick, and Nikola Tarashev. "Bank capital allocation under multiple constraints." Journal of Financial Intermediation 44 (October 2020): 100844. http://dx.doi.org/10.1016/j.jfi.2019.100844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Badler, Norman, Kamran Manoochehri, and Graham Walters. "Articulated Figure Positioning by Multiple Constraints." IEEE Computer Graphics and Applications 7, no. 6 (June 1987): 28–38. http://dx.doi.org/10.1109/mcg.1987.276894.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Gibbs, Raymond W. "Multiple Constraints in Theories of Metaphor." Discourse Processes 48, no. 8 (October 27, 2011): 575–84. http://dx.doi.org/10.1080/0163853x.2011.606105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Wainberg, Michael, and Vaughn Betz. "Robust Optimization of Multiple Timing Constraints." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 34, no. 12 (December 2015): 1942–53. http://dx.doi.org/10.1109/tcad.2015.2440316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Spivey-Knowlton, Michael, and Julie C. Sedivy. "Resolving attachment ambiguities with multiple constraints." Cognition 55, no. 3 (June 1995): 227–67. http://dx.doi.org/10.1016/0010-0277(94)00647-4.

Full text

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!