Log in

Relevant bibliographies by topics / Area constraint / Journal articles

To see the other types of publications on this topic, follow the link: Area constraint.

Journal articles on the topic 'Area constraint'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 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 'Area constraint.'

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

LIN, CHANG-TZU, DE-SHENG CHEN, and YI-WEN WANG. "MODERN FLOORPLANNING WITH BOUNDARY AND FIXED-OUTLINE CONSTRAINTS VIA GENETIC CLUSTERING ALGORITHM." Journal of Circuits, Systems and Computers 15, no. 01 (February 2006): 107–27. http://dx.doi.org/10.1142/s0218126606002940.

Full text

Abstract:

Typical floorplanning problem concerns a series of objectives, such as area, wirelength and routability, etc., without any specific constraint in a free-outline style. Entering SOC era; however, modern floorplanning takes more care of providing extra options, such as boundary constraint for I/O connections and fixed-outline constraint for hierarchical designs. It has been empirically shown that one of the modern constraints extremely restricts the solution space; that is, a large number of randomly generated floorplans might be infeasible. This paper tackles modern floorplanning with both boundary and fixed-outline constraints. A novel genetic clustering algorithm was proposed to guarantee to produce slicing floorplans with satisfying boundary constraint. By analyzing the properties of the slicing floorplan, the algorithm is effective to cluster the boundary-constrained modules into four constrained sub-floorplans. Afterward, the four sub-floorplans were combined to satisfy the boundary constraint. We then extend the algorithm with minor modification to enable the slicing floorplans with boundary constraint to be gradually fit into the desirable fixed outline. The methods were verified by using the MCNC and GSRC benchmarks, and the empirical results show that our methods can obtain promising solutions using short time.

APA, Harvard, Vancouver, ISO, and other styles

2

Sharma, Manisha, and Manjaree Pandit. "Reserve Constrained Multi-Area Economic Dispatch Employing Evolutionary Approach." International Journal of Applied Evolutionary Computation 1, no. 3 (July 2010): 49–69. http://dx.doi.org/10.4018/jaec.2010070103.

Full text

Abstract:

The objective of Multi-area economic dispatch (MAED) is to determine the generation levels and the interchange power between areas that minimize fuel costs, while satisfying power balance and generating limit and transmission constraints. If an area with excess power is not adjacent to a power deficient area, or the tie-line between the two areas is at transmission limit, it is necessary to find an alternative path between these two areas to transmit additional power. When a MAED problem is solved with spinning reserve constraints, the problem becomes further complicated. The power allocation to each unit is done in such a manner that after supplying the total load, some specified reserve is left behind. In this paper, the authors compare classic PSO and DE strategies and their variants for reserve constrained MAED. The superior constraint handling capability of these techniques enables them to produce high quality solutions. The performance is tested on a 2-area system having 4 generating units and a 4-area, 16-unit system.

APA, Harvard, Vancouver, ISO, and other styles

3

Ferone, Vincenzo, Bernd Kawohl, and Carlo Nitsch. "Generalized elastica problems under area constraint." Mathematical Research Letters 25, no. 2 (2018): 521–33. http://dx.doi.org/10.4310/mrl.2018.v25.n2.a9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Denzler, Jochen. "Opial's inequality for zero-area constraint." Mathematical Inequalities & Applications, no. 3 (2004): 337–54. http://dx.doi.org/10.7153/mia-07-36.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ferone, Vincenzo, Bernd Kawohl, and Carlo Nitsch. "The elastica problem under area constraint." Mathematische Annalen 365, no. 3-4 (September 5, 2015): 987–1015. http://dx.doi.org/10.1007/s00208-015-1284-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Torres-Rojo, Juan M., and J. Douglas Brodie. "Adjacency constraints in harvest scheduling: an aggregation heuristic." Canadian Journal of Forest Research 20, no. 7 (July 1, 1990): 978–86. http://dx.doi.org/10.1139/x90-131.

Full text

Abstract:

An heuristic for adjacency constraint aggregation is proposed. The heuristic is composed of two procedures. Procedure 1 consists of identifying harvesting areas for which it is not necessary to write adjacency constraints. Procedure 2 consists of writing one adjacency constraint for each one of the harvesting areas not identified in procedure 1. Such adjacency constraints consider all the adjacency relations between the harvesting area and its surrounding areas. The heuristic is based on the concept of penalties and the four-color theorem. The aggregated constraints present fewer variables per constraint than the aggregator described by B.J. Meneghin, M.W. Kirby, and J.G. Jones (1988. USDA For. Serv. Rocky Mt. For. Range Exp. Stn. Gen. Tech. Rep. RM-161. pp. 46–53) and can easily be generated mechanically from the adjacency matrix. In addition, the proposed heuristic does not require the tedious task of identifying type 1 and 2 constraints as with Meneghin's algorithm. Hence the combinatorial work to compute the aggregated constraints is reduced significantly. Comparisons showed that the proposed heuristic requires about a third of the constraints required by the conventional adjacency constraint formulation and about the same number of constraints as the procedure suggested by B.J. Meneghin, M.W. Kirby, and J.G. Jones (1988).

APA, Harvard, Vancouver, ISO, and other styles

7

Imtiaz, MA, and S. Rana. "Problems Faced by the Small Scale Dairy Owners in Receiving Veterinary Services in Selected Areas of Chittagong." Bangladesh Journal of Veterinary Medicine 12, no. 1 (September 16, 2014): 63–65. http://dx.doi.org/10.3329/bjvm.v12i1.20465.

Full text

Abstract:

This study investigated the problems faced by the small scale dairy owners in receiving veterinary services in selected areas of Chittagong (Chittagong metropolitan area, Sitakunda and Patiya Upazila). A pre-tested structured questionnaire data were collected from a sample of 45 farmers during November 2012 to January 2013. A four (0-3) point rating scale was used to evaluate the constraint as high (3), moderate (2), low (1) and absence of any constraint (0). The highest ranking constraint was unavailability of veterinarian in the farm area with higher service charge on specialist doctor followed by no emergency doorstep services, poor services in local veterinary hospital, ineffectiveness at artificial insemination, high cost for drugs and vaccines and lack of illiteracy among the livestock owners These findings will help to redesign and rectify the condition of present veterinary constraints in selected areas of Chittagong, Bangladesh.DOI: http://dx.doi.org/10.3329/bjvm.v12i1.20465 Bangl. J. Vet. Med. (2014). 12 (1): 63-65

APA, Harvard, Vancouver, ISO, and other styles

8

Fernando, J. A., and J. S. N. Jean. "Processor array design with FPGA area constraint." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 18, no. 3 (March 1999): 253–64. http://dx.doi.org/10.1109/43.748156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Leloudas, Stavros N., Giorgos A. Strofylas, and Ioannis K. Nikolos. "Constrained airfoil optimization using the area-preserving free-form deformation." Aircraft Engineering and Aerospace Technology 90, no. 6 (September 3, 2018): 914–26. http://dx.doi.org/10.1108/aeat-10-2016-0184.

Full text

Abstract:

Purpose The purpose of this paper is the presentation of a technique to be integrated in a numerical airfoil optimization scheme, for the exact satisfaction of a strict equality cross-sectional area constraint. Design/methodology/approach An airfoil optimization framework is presented, based on Area-Preserving Free-Form Deformation (AP FFD) technique. A parallel metamodel-assisted differential evolution (DE) algorithm is used as an optimizer. In each generation of the DE algorithm, before the evaluation of the fitness function, AP FFD is applied to each candidate solution, via coupling a classic B-Spline-based FFD with an area correction step. The area correction step is achieved by solving a sub problem, which consists of computing and applying the minimum possible offset to each one of the free-to-move control points of the FFD lattice, subject to the area preservation constraint. Findings The proposed methodology is able to obtain better values of the objective function, compared to both a classic penalty function approach and a generic framework for handling constraints, which suggests the separation of constraints and objectives (separation-sub-swarm), without any loss of the convergence capabilities of the DE algorithm, while it also guarantees an exact area preservation. Due to the linearity of the area constraint in each axis, the extraction of an inexpensive closed-form solution to the sub problem is possible by using the method of Lagrange multipliers. Practical implications AP FFD can be easily incorporated into any 2D shape optimization/design process, as it is a time-saving and easy-to-implement repair algorithm, independent from the nature of the problem at hand. Originality/value The proposed methodology proved to be an efficient tool in facing airfoil design problems, enhancing the rigidity of the optimal airfoil by preserving its cross-sectional area to a predefined value.

APA, Harvard, Vancouver, ISO, and other styles

10

Avila Carhullanqui, H., A. Bonini Neto, and D. A. Alves. "Continuation power flow considering area net interchange constraint." International Journal of Electrical Power & Energy Systems 70 (September 2015): 118–26. http://dx.doi.org/10.1016/j.ijepes.2015.01.042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Xu, Ai Gong, Yang Cui, and Xin Sui. "Open-Pit Mine Fine DEM Model Establishment and Updating." Advanced Materials Research 524-527 (May 2012): 508–14. http://dx.doi.org/10.4028/www.scientific.net/amr.524-527.508.

Full text

Abstract:

In view of open-pit mine complex special terrain, to improved method of constructing triangulated irregular net and combined with the extended boundary, that can remission the phenomenon that steps were flattened and the problem of inefficiency mining area model update. Using constrained triangulated irregular net once generation algorithm, through extraction of spatial data, establish topological relationships and spatial indexing, eventually build a constraints of triangulated irregular net within the boundary constraint line. Combining extended boundary with the triangulated irregular net generated algorithm, can realize the establishment partial model as well as partial and overall model splicing. Thus enhanced the efficiency of the mining area overall model updating.

APA, Harvard, Vancouver, ISO, and other styles

12

Oleynik, Yu A., and A. A. Zuenko. "Global constraints in modeling and solving problems within the Constraint Programming paradigm." Transaction Kola Science Centre 11, no. 8-2020 (December 16, 2020): 67–83. http://dx.doi.org/10.37614/2307-5252.2020.8.11.006.

Full text

Abstract:

At the moment, constraint programming technology is a powerful tool for solving combinatorial search and combinatorial optimization problems. To use this technology, any task must be formulated as a task of satisfying constraints. The role of the concept of global constraints in modeling and solving applied problems within the framework of the constraint programming paradigm can hardly be overestimated. The procedures that implement the algorithms of filtering global constraints are the elementary “building blocks” from which the model of a specific applied problem is built. Algorithms for filtering global constraints, as a rule, are supported by the corresponding developed theories that allow organizing high-performance computing. The choice of a particular software library is primarily determined by the extent to which the set and method of implementing global constraints corresponds tothe level of modern research in this area. The main focus of this article is focused on an overview of global constraints that are implemented within the most popular constraint programming libraries: Choco, GeCode, JaCoP, MiniZinc.

APA, Harvard, Vancouver, ISO, and other styles

13

Smith, R. W., M. Webb, D. Kidd, and D. B. Hannaway. "Mapping suitability of pasture species using fine-scale soils and rainfall data." Crop and Pasture Science 70, no. 12 (2019): 1175. http://dx.doi.org/10.1071/cp18573.

Full text

Abstract:

Species composition is limiting production in >65% of pastures in Tasmania, Australia—a situation not unique to Tasmania. There are many reasons for degradation and poor persistence of improved pastures, with species selection crucial. Selection currently relies on producers making an assessment based on experience, external advice from agronomists and seed merchants, and experimental trial data. This project sought to assess the benefit of using fine-scale soils data and long-term rainfall data to determine the suitability of pasture species at a farm level across >3 Mha of agricultural land in Tasmania. Suitability rules were developed for perennial ryegrass (Lolium perenne L.) and lucerne (Medicago sativa L.) involving growth responses to soil characteristics (pH, soil depth, electrical conductivity, drainage, and coarse fragments) and average annual rainfall. Suitability classes were defined as well suited, suitable, moderately suitable, and unsuitable, with additional subclasses to account for soil limitations that could be mitigated through management. Soil grids were generated using digital soil mapping techniques from ~6500 new and existing site data sources spread across Tasmania. Rainfall data from 539 Bureau of Meteorology rainfall-recording sites were modelled using regression kriging interpolation. Soil pH was found to be a major constraint on lucerne, with 61.3% of the land area having a pH <5.7. Ameliorating the soil with lime could reduce this constraint to 33.5% of the land area. Drainage was another major constraint on lucerne suitability, with 37.8% of land constrained by imperfectly or poorly drained soils. Improving drainage by installing surface or underground drains could reduce the affected area to 22.1%. The mapping showed that perennial ryegrass was constrained by soil pH, with 38.2% of land having a pH <5.5. However, liming could reduce this constraint to just 9.6%. Accurate identification of the likely constraints on pasture production and persistence before sowing and choice of appropriate species and management intervention will result in fewer failed sowings and greater productivity. The feasibility of expanding this approach is being assessed for a larger area of south-eastern Australia and across a wider range of pasture species.

APA, Harvard, Vancouver, ISO, and other styles

14

Atanackovic, Teodor, and Alexander Seyraniany. "Bimodal optimization with constraints: Critical value of the constraint and post-critical configurations." Theoretical and Applied Mechanics 38, no. 2 (2011): 107–24. http://dx.doi.org/10.2298/tam1102107a.

Full text

Abstract:

By using a method based on Pontryagin?s principle, formulated in [13], and [14] we study optimal shape of an elastic column with constraints on the minimal value of the cross-sectional area. We determine the critical value of the minimal cross-sectional area separating bi from unimodal optimization. Also we study the post-critical shape of optimally shaped rod and find the preferred configuration of the bifurcating solutions from the point of view of minimal total energy.

APA, Harvard, Vancouver, ISO, and other styles

15

OSTROWSKI, MAX, and TORSTEN SCHAUB. "ASP modulo CSP: The clingcon system." Theory and Practice of Logic Programming 12, no. 4-5 (July 2012): 485–503. http://dx.doi.org/10.1017/s1471068412000142.

Full text

Abstract:

AbstractWe present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.

APA, Harvard, Vancouver, ISO, and other styles

16

Yang, Zhengquan, Qing Zhang, and Zengqiang Chen. "Formation Control of Multi-Agent Systems with Region Constraint." Complexity 2019 (December 4, 2019): 1–6. http://dx.doi.org/10.1155/2019/8481060.

Full text

Abstract:

In this paper, the formation problem for multi-agent systems with region constraint is studied while few researchers consider this problem. The goal is to control all multi-agents to enter the constraint area while reaching formation. Each agent is constrained by a common convex set. A formation control law is presented based on local information of the neighborhood. It is proved that the positions of all the agents would converge to the set constraint while reaching formation. Finally, two numerical examples are presented to illustrate the validity of the theoretical results.

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Jie, and Lei Wang. "Effect Range of the Material Constraint-I. Center Crack." Materials 12, no. 1 (December 25, 2018): 67. http://dx.doi.org/10.3390/ma12010067.

Full text

Abstract:

Material constraints are important factor effects on the fracture behavior of welded joints. The effect range of the material constraint is an important and interesting issue which needs to be clarified, including whether the effect range of a material constraint exists or not, who will affect it, and whether the material constraint is affected by the no adjacent area or not. In this study, different basic models which reflect different single metallic welded joints, bimetallic welded joints and dissimilar metal welded joints were designed, and the fracture resistance curves and crack tip strain fields of the different models with various material constraints were calculated. Based on the results, the questions above were answered. This study has significance for developing solid mechanics, optimizing joint design, structure integrity assessment, and so on.

APA, Harvard, Vancouver, ISO, and other styles

18

Lee, Jae–Hyoung. "Study on Travel Constraint Factors for Taean Tourist Area." Convergence Tourism Contents Society 4, no. 1 (June 30, 2018): 43–51. http://dx.doi.org/10.22556/jctc.2018.4.1.43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Freeman, A., W. T. K. Johnson, B. Huneycutt, R. Jordan, S. Hensley, P. Siqueira, and J. Curlander. "The "Myth" of the minimum SAR antenna area constraint." IEEE Transactions on Geoscience and Remote Sensing 38, no. 1 (2000): 320–24. http://dx.doi.org/10.1109/36.823926.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

GOERDT, ANDREAS. "On Random Betweenness Constraints." Combinatorics, Probability and Computing 19, no. 5-6 (October 5, 2010): 775–90. http://dx.doi.org/10.1017/s0963548310000313.

Full text

Abstract:

Ordering constraints are formally analogous to instances of the satisfiability problem in conjunctive normal form, but instead of a boolean assignment we consider a linear ordering of the variables in question. A clause becomes true given a linear ordering if and only if the relative ordering of its variables obeys the constraint considered.The naturally arising satisfiability problems are NP-complete for many types of constraints. We look at random ordering constraints. Previous work of the author shows that there is a sharp unsatisfiability threshold for certain types of constraints. The value of the threshold, however, is essentially undetermined. We pursue the problem of approximating the precise value of the threshold. We show that random instances of the betweenness constraint are satisfiable with high probability if the number of randomly picked clauses is ≤0.92n, where n is the number of variables considered. This improves the previous bound, which is <0.82n random clauses. The proof is based on a binary relaxation of the betweenness constraint and involves some ideas not used before in the area of random ordering constraints.

APA, Harvard, Vancouver, ISO, and other styles

21

Harris, Ian G., and Alex Orailoglu. "Module Selection in Microarchitectural Synthesis for Multiple Critical Constraint Satisfaction." VLSI Design 5, no. 2 (January 1, 1997): 167–82. http://dx.doi.org/10.1155/1997/81902.

Full text

Abstract:

Accurate design descriptions during synthesis allow efficient use of resources. The appropriate use of distinct implementations of RTL operators helps generate optimal VLSI designs. The system presented here utilizes libraries composed of multiple modules with identical functionality, but distinct performance and area characteristics. Such libraries allow the generation of an accurate estimate of the area and delay of the final design during synthesis. Full use of the module selection capability is possible by allowing the user to specify a total area limit rather than a detailed allocation. Consequently, tradeoffs between different allocations can be fully explored. Scheduling, module selection, and allocation are performed simultaneously to achieve optimal use of area and delay, and to facilitate the incorporation of lower level design considerations into behavioral synthesis. Synthesis decisions are made in a time-constrained and area-constrained fashion, by using both constraints to identify and avoid infeasible design possibilities. Module selection, scheduling, and allocation for pipelined designs is also implemented. Experimental results show that the use of module selection and time-and-area-constrained synthesis results in an area/delay design curve which is superior to the results of traditional systems.

APA, Harvard, Vancouver, ISO, and other styles

22

Daniar, Sabah, Mojtaba Shiroei, and Rahmat Aazami. "Multivariable predictive control considering time delay for load-frequency control in multi-area power systems." Archives of Control Sciences 26, no. 4 (December 1, 2016): 527–49. http://dx.doi.org/10.1515/acsc-2016-0029.

Full text

Abstract:

Abstract In this paper, a multivariable model based predictive control (MPC) is proposed for the solution of load frequency control (LFC) in a multi-area interconnected power system. The proposed controller is designed to consider time delay, generation rate constraint and multivariable nature of the LFC system, simultaneously. A new formulation of the MPC is presented to compensate time delay. The generation rate constraint is considered by employing a constrained MPC and economic allocation of the generation is further guaranteed by an innovative modification in the predictive control objective function. The effectiveness of proposed scheme is verified through time-based simulations on the standard 39-bus test system and the responses are then compared with the proportional-integral controller. The evaluation of the results reveals that the proposed control scheme offers satisfactory performance with fast responses.

APA, Harvard, Vancouver, ISO, and other styles

23

Wang, Yu Han, Jing Chun Feng, Sun Chao, and Ming Chen. "Research on Five-Axis Dual-NURBS Adaptive Interpolation Algorithm for Flank Milling." Key Engineering Materials 443 (June 2010): 330–35. http://dx.doi.org/10.4028/www.scientific.net/kem.443.330.

Full text

Abstract:

In order to exploit the advantages of five-axis flank milling method for space free surface machining to the full, a definition of non-equidistant dual-NURBS tool path is presented first. On this basis, the constraint of velocity of points on the tool axis and the constraint of scanning area of the tool axis are deduced. Considering both of these constraints, an adaptive feed five-axis dual-NURBS interpolation algorithm is proposed. The simulation results show that the feedrate with the proposed algorithm satisfies both of the constraints and the machining time is reduced by 38.3% in comparison with the constant feed interpolator algorithm.

APA, Harvard, Vancouver, ISO, and other styles

24

Tandel, V. B. "Constraints Analysis of Shrimp Farming in the Coastal Belt of South Gujarat." International Journal for Research in Applied Science and Engineering Technology 9, no. VII (July 30, 2021): 2968–70. http://dx.doi.org/10.22214/ijraset.2021.37036.

Full text

Abstract:

The study examined the constraints analysis of shrimp farming in the coastal belt of South Gujarat. From the South Gujarat region, mainly four districts, namely, Valsad, Navsari, Surat, and Bharuch districts, were selected purposively to study the socio-economic characteristics of shrimp farmers. From each district, two talukas were selected purposively according to the availability of shrimp farmers. After that, two villages from each taluka and from each village, fifteen farmers were selected by simple random sampling (SRS) method. Thus, a total of 240 shrimp farmers were selected for this study. The present study was the vital work in this area which revealed that the disease problem was ranked as the most crucial constraint followed by poor quality of seeds. Feed cost was a third major constraint as reported by shrimp farmers in the study area. The other important constraints identified in the study area were lack of credit, lack of co-operation among shrimp producer’s, lack of technical guidance, involvement of middleman, lack of quality control agencies, lack of government support and losses due to theft that resulted in low productivity etc.

APA, Harvard, Vancouver, ISO, and other styles

25

Liu, Ya Mei, Cong Min Lv, and Hong Fei Wang. "Research on China Imaging Altimeter Planning Problem for Area Target Observation." Applied Mechanics and Materials 667 (October 2014): 230–36. http://dx.doi.org/10.4028/www.scientific.net/amm.667.230.

Full text

Abstract:

The China Imaging Altimeter (CIALT) mission planning problem has complexity constraints. Overlap observation play a role in area target observation. Based on the analysis, the space gird was constructed. A calculation method for coverage percentage based on grid space statistic is proposed. A mathematical model of mission planning is established. A solving method combines constraint propagation algorithm and greedy algorithm is proposed. An area target mission with one month’s observation period was planned. The results showed that the method realized the goal that maximizing area target coverage in the shortest possible time and form the unique planning results at same observation requirements. It is applicable to CIALT area target observation planning.

APA, Harvard, Vancouver, ISO, and other styles

26

Mizutani, Yoshibumi, and Yasuyuki Goto. "Area-decomposition type load frequency control considering generation rate constraint." IEEJ Transactions on Power and Energy 105, no. 4 (1985): 399–405. http://dx.doi.org/10.1541/ieejpes1972.105.399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Zhang, Yuanhui, Yan Li, Bo Xie, Xiaolu Li, and Junjiang Zhu. "Pupil localization algorithm combining convex area voting and model constraint." Pattern Recognition and Image Analysis 27, no. 4 (October 2017): 846–54. http://dx.doi.org/10.1134/s1054661817040216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Peyran, O., Z. Zeng, and W. Zhuang. "Area Optimization of Delay-Optimized Structures Using Intrinsic Constraint Graphs." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23, no. 6 (June 2004): 888–906. http://dx.doi.org/10.1109/tcad.2004.828124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Zhendong Wang, 王振东, 靖旭 Xu Jing, 孙国栋 Guodong Sun, 程乙轮 Yilun Cheng, 喻璐璐 Lulu Yu, 管雯璐 Wenlu Guan, 秦来安 Laian Qin, et al. "Image Dehazing of Dark Channels Based on Area Contrast Constraint." Chinese Journal of Lasers 46, no. 8 (2019): 0810003. http://dx.doi.org/10.3788/cjl201946.0810003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mizutani, Yoshifumi, and Yasuyuki Goto. "Area decomposition type load frequency control under generation rate constraint." Electrical Engineering in Japan 105, no. 4 (1985): 61–66. http://dx.doi.org/10.1002/eej.4391050408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Lamm, Tobias, and Jan Metzger. "Minimizers of the Willmore functional with a small area constraint." Annales de l'Institut Henri Poincare (C) Non Linear Analysis 30, no. 3 (May 2013): 497–518. http://dx.doi.org/10.1016/j.anihpc.2012.10.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Filippi, Patrick, Edward J. Jones, Bradley J. Ginns, Brett M. Whelan, Guy W. Roth, and Thomas F. A. Bishop. "Mapping the Depth-to-Soil pH Constraint, and the Relationship with Cotton and Grain Yield at the Within-Field Scale." Agronomy 9, no. 5 (May 21, 2019): 251. http://dx.doi.org/10.3390/agronomy9050251.

Full text

Abstract:

Subsoil alkalinity is a common issue in the alluvial cotton-growing valleys of northern New South Wales (NSW), Australia. Soil alkalinity can cause nutrient deficiencies and toxic effects, and inhibit rooting depth, which can have a detrimental impact on crop production. The depth at which a soil constraint is reached is important information for land managers, but it is difficult to measure or predict spatially. This study predicted the depth in which a pH (H2O) constraint (>9) was reached to a 1-cm vertical resolution to a 100-cm depth, on a 1070-hectare dryland cropping farm. Equal-area quadratic smoothing splines were used to resample vertical soil profile data, and a random forest (RF) model was used to produce the depth-to-soil pH constraint map. The RF model was accurate, with a Lin’s Concordance Correlation Coefficient (LCCC) of 0.63–0.66, and a Root Mean Square Error (RMSE) of 0.47–0.51 when testing with leave-one-site-out cross-validation. Approximately 77% of the farm was found to be constrained by a strongly alkaline pH greater than 9 (H2O) somewhere within the top 100 cm of the soil profile. The relationship between the predicted depth-to-soil pH constraint map and cotton and grain (wheat, canola, and chickpea) yield monitor data was analyzed for individual fields. Results showed that yield increased when a soil pH constraint was deeper in the profile, with a good relationship for wheat, canola, and chickpea, and a weaker relationship for cotton. The overall results from this study suggest that the modelling approach is valuable in identifying the depth-to-soil pH constraint, and could be adopted for other important subsoil constraints, such as sodicity. The outputs are also a promising opportunity to understand crop yield variability, which could lead to improvements in management practices.

APA, Harvard, Vancouver, ISO, and other styles

33

Silva, João B. C., Walter E. Medeiros, and Valéria C. F. Barbosa. "Potential‐field inversion: Choosing the appropriate technique to solve a geologic problem." GEOPHYSICS 66, no. 2 (March 2001): 511–20. http://dx.doi.org/10.1190/1.1444941.

Full text

Abstract:

To produce a unique and stable solution in potential‐field interpretation, an inversion method must introduce particular constraints. These constraints will inevitably restrict the type of geological setting where the method may be applied. We present a nonmathematical overview of most stabilizing constraints used in inversion methods. Our purpose is to demonstrate that the inversion results are valuable only if the mathematical stabilizing constraints are translated from the geological setting. We identify five basic types of constraints: (1) lower and upper bounds of parameter estimates; (2) proximity of a parameter estimate to a specified value; (3) proximity between pairs of parameter estimates; (4) concentration of the anomalous source about a geometrical element such as an axis; and (5) source compactness. In practice, if used in isolation, constraints (1), (2), (4), and (5) will not produce geologically meaningful results, regardless of the geological setting of the interpretation area. Constraint (3) may produce geologically meaningful results if the anomalous source has a spatially smooth attribute such as the physical property. We illustrate that constraints 1–4, if used in isolation, cannot delineate the geometry of a simulated sill intruded into a sedimentary basin. The basic constraints may (and should) be combined in inversion to produce geologically meaningful results. We present two examples of effective constraint combination: (1) proximity to a specific value and mass concentration about an axis (used to delineate the thickness variation of a sill intruded in a sedimentary basin) and (2) inequality, proximity of a parameter estimate to a specified value, and proximity between pairs of parameter estimates (used to map a discontinuous basement relief). Usually, the stabilizing constraints are too restrictive to hold at all points of a given geological environment. In this case, we use different constraints in different sub‐areas. Each constraint is based on its compatibility with the actual geology of the subarea.

APA, Harvard, Vancouver, ISO, and other styles

34

H. Ad Suhadak, F., K. A. Zakaria, M. B. Ali, and M. A. Yusuff. "Stress Analysis of Automobile Steering Knuckle Using Finite Element Method." International Journal of Engineering & Technology 7, no. 3.17 (August 1, 2018): 28. http://dx.doi.org/10.14419/ijet.v7i3.17.16617.

Full text

Abstract:

This paper aims in identifying effect of constraint point against critical area of 1300 cc national car steering knuckle using finite element method. The material of this steering knuckle is cast iron ASTM A536. The steering knuckle is modeled using a computer aided design software and the dimensions is assigned according to 3D scanning files. Meanwhile, steering knuckle is simulate using commercial finite element software where the load is assigned based on three conditions of constraints. The three conditions are fixed at hub, fixed hub and brake clamp and fixed at hub, brake clamp and steering arm of steering knuckle. Result shows that the positions of constraint points are significantly effect on stress value of steering knuckle. By acknowledging the presence or absent the effect of constraint on steering knuckle will aid in detecting critical area on this steering knuckle. Thus, approach could be conducted to optimize and enhance the life cycle of a steering knuckle. The data will be further utilized in testing the steering knuckle under variable amplitude strain signal.

APA, Harvard, Vancouver, ISO, and other styles

35

Sayidov, Azimjon, Meysam Aliakbarian, and Robert Weibel. "Geological Map Generalization Driven by Size Constraints." ISPRS International Journal of Geo-Information 9, no. 4 (April 24, 2020): 284. http://dx.doi.org/10.3390/ijgi9040284.

Full text

Abstract:

Geological maps are an important information source used in the support of activities relating to mining, earth resources, hazards, and environmental studies. Owing to the complexity of this particular map type, the process of geological map generalization has not been comprehensively addressed, and thus a complete automated system for geological map generalization is not yet available. In particular, while in other areas of map generalization constraint-based techniques have become the prevailing approach in the past two decades, generalization methods for geological maps have rarely adopted this approach. This paper seeks to fill this gap by presenting a methodology for the automation of geological map generalization that builds on size constraints (i.e., constraints that deal with the minimum area and distance relations in individual or pairs of map features). The methodology starts by modeling relevant size constraints and then uses a workflow consisting of generalization operators that respond to violations of size constraints (elimination/selection, enlargement, aggregation, and displacement) as well as algorithms to implement these operators. We show that the automation of geological map generalization is possible using constraint-based modeling, leading to improved process control compared to current approaches. However, we also show the limitations of an approach that is solely based on size constraints and identify extensions for a more complete workflow.

APA, Harvard, Vancouver, ISO, and other styles

36

Lu, Chengpeng, Wei Ji, Zhiliang Liu, Shuheng Dong, and Bing Xue. "Synergistic Evaluation and Constraint Factor Analysis on Urban Industrial Ecosystems of Traditional Industrial Area in China." Complexity 2020 (July 1, 2020): 1–16. http://dx.doi.org/10.1155/2020/3805454.

Full text

Abstract:

Industrial ecology is an advanced form and ideal model of modern industrial development, in which the industrial ecosystem is the core. Based on the PSR model, this paper builds a comprehensive evaluation index system for urban industrial ecosystem development and selects 14 prefecture-level cities in Liaoning Province of the traditional industrial area in Northeastern China as cases to calculate the development level of its industrial ecosystem during 2000–2018 using an improved Topsis method and then to conduct a spatial visualization analysis. Finally, based on the “stress-state-response” subsystem, this paper diagnoses the constraints for industrial ecosystem development, which can provide a reference basis for decision-making in industrial ecology of traditional industrial area represented by those in Northeast China. The results show the following: (1) From 2000 to 2018, the industrial ecology of the 14 cities in Liaoning Province was at a medium level. Except for Shenyang and Dalian with the rapid development, the difference of industrial ecosystem development for other cities was relatively small. (2) From 2000 to 2018, the industrial ecosystem development of each city was in a status of “either increasing, or decreasing, or fluctuating,” which generally raised first and then decreased. Regarding spatial difference, the development exhibited a “center-periphery” pattern, with Shenyang and Dalian as the “dual-core” that were increasingly strengthened with significantly high-level industrial ecology. (3) At system level, PSR constraint grades for the industrial ecosystem development in the 14 cities of Liaoning Province were different. Constraint grades in the pressure subsystem, the state subsystem, and the response subsystem for the industrial ecosystem of Liaoning were 45.73%, 20.01%, and 34.34%, respectively, indicating that the lack of human response to the ecological environment and the pressure of human activities on the ecological environment during the industrial economy development were the main constraints affecting the process of industrial ecology in these cities. (4) Due to the differences in geographical environments, economic bases, industrial structures, and local development contexts, the major constraint factors of industrial ecosystem development in different cities are significantly different and complicated; however, there are five factors that are generally considered as major constraint factors in all cities, i.e., regional GDP, number of labor force employed in the secondary industrial sector, gross investment in fixed assets, amount of industrial sulfur dioxide removal, and production value from “three-wastes” comprehensive utilization. At last, this paper puts forward some recommendations and suggestions for providing scientific support for industrial ecosystem construction in the traditional industrial area of Northeastern China.

APA, Harvard, Vancouver, ISO, and other styles

37

Dell’Amico, Mauro, and Matteo Magnani. "Solving a Real-Life Distributor’s Pallet Loading Problem." Mathematical and Computational Applications 26, no. 3 (July 19, 2021): 53. http://dx.doi.org/10.3390/mca26030053.

Full text

Abstract:

We consider the distributor’s pallet loading problem where a set of different boxes are packed on the smallest number of pallets by satisfying a given set of constraints. In particular, we refer to a real-life environment where each pallet is loaded with a set of layers made of boxes, and both a stability constraint and a compression constraint must be respected. The stability requirement imposes the following: (a) to load at level k+1 a layer with total area (i.e., the sum of the bottom faces’ area of the boxes present in the layer) not exceeding α times the area of the layer of level k (where α≥1), and (b) to limit with a given threshold the difference between the highest and the lowest box of a layer. The compression constraint defines the maximum weight that each layer k can sustain; hence, the total weight of the layers loaded over k must not exceed that value. Some stability and compression constraints are considered in other works, but to our knowledge, none are defined as faced in a real-life problem. We present a matheuristic approach which works in two phases. In the first, a number of layers are defined using classical 2D bin packing algorithms, applied to a smart selection of boxes. In the second phase, the layers are packed on the minimum number of pallets by means of a specialized MILP model solved with Gurobi. Computational experiments on real-life instances are used to assess the effectiveness of the algorithm.

APA, Harvard, Vancouver, ISO, and other styles

38

Wu, Wenjia, Junzhou Luo, Kai Dong, Ming Yang, and Zhen Ling. "Energy-Efficient User Association with Congestion Avoidance and Migration Constraint in Green WLANs." Wireless Communications and Mobile Computing 2018 (June 28, 2018): 1–10. http://dx.doi.org/10.1155/2018/9596141.

Full text

Abstract:

Green wireless local area networks (WLANs) have captured the interests of academia and industry recently, because they save energy by scheduling an access point (AP) on/off according to traffic demands. However, it is very challenging to determine user association in a green WLAN while simultaneously considering several other factors, such as avoiding AP congestion and user migration constraints. Here, we study the energy-efficient user association with congestion avoidance and migration constraint (EACM). First, we formulate the EACM problem as an integer linear programming (ILP) model, to minimize APs’ overall energy consumption within a time interval while satisfying the following constraints: traffic demand, AP utilization threshold, and maximum number of demand node (DN) migrations allowed. Then, we propose an efficient migration-constrained user reassociation algorithm, consisting of two steps. The first step removes k AP-DN associations to eliminate AP congestion and turn off as many idle APs as possible. The second step reassociates these k DNs according to an energy efficiency strategy. Finally, we perform simulation experiments that validate our algorithm’s effectiveness and efficiency.

APA, Harvard, Vancouver, ISO, and other styles

39

Yu, Hsin-Hao, Declan P. Rowley, Nicholas S. C. Price, Marcello G. P. Rosa, and Elizabeth Zavitz. "A twisted visual field map in the primate dorsomedial cortex predicted by topographic continuity." Science Advances 6, no. 44 (October 2020): eaaz8673. http://dx.doi.org/10.1126/sciadv.aaz8673.

Full text

Abstract:

Adjacent neurons in visual cortex have overlapping receptive fields within and across area boundaries, an arrangement theorized to minimize wiring cost. This constraint is traditionally thought to create retinotopic maps of opposing field signs (mirror and nonmirror visual field representations) in adjacent areas, a concept that has become central in current attempts to subdivide the extrastriate cortex. We simulated the formation of retinotopic maps using a model that balances constraints imposed by smoothness in the representation within an area and by congruence between areas. As in the primate cortex, this model usually leads to alternating mirror and nonmirror maps. However, we found that it can also produce a more complex type of map, consisting of sectors with opposing field sign within a single area. Using fully quantitative electrode array recordings, we then demonstrate that this type of inhomogeneous map exists in the controversial dorsomedial region of the primate extrastriate cortex.

APA, Harvard, Vancouver, ISO, and other styles

40

Zhou, Xue Feng, Peng Huang, Gong Zhang, and Xian Shuai Chen. "Stability Analysis of Biped Walking." Advanced Materials Research 569 (September 2012): 420–27. http://dx.doi.org/10.4028/www.scientific.net/amr.569.420.

Full text

Abstract:

Tipping-over and slipping, which are related to zero moment point (ZMP) and frictional constraint respectively, are the most two common instability forms of biped robotic walking. Conventional criterion of stability is not sufficient in some cases, since it neglects frictional constraint or considers only translational friction. The goal of this article is to fully address frictional constraints in biped walking and develop corresponding stability criteria. Frictional constraints for biped locomotion are first analyzed and the method to obtain the closed-form solutions of the frictional force and moment for a biped robot with rectangular or circular feet is then presented. The maximum frictional force and moment are calculated in the case of ZMP at the center of contact area. Experiments are conducted to verify the effectiveness of our stability analysis.

APA, Harvard, Vancouver, ISO, and other styles

41

Crowe, Kevin, John Nelson, and Mark Boyland. "Solving the area-restricted harvest-scheduling model using the branch and bound algorithm." Canadian Journal of Forest Research 33, no. 9 (September 1, 2003): 1804–14. http://dx.doi.org/10.1139/x03-101.

Full text

Abstract:

There are two broad approaches to the discrete optimization problem of harvest scheduling with adjacency constraints: the unit-restricted model and the area-restricted model. In this paper two formulations of the area-restricted model are solved using the branch and bound algorithm. These formulations are tested on a set of approximately 30 tactical planning problems that range in size from 346 to 6093 polygons scheduled over three time periods. Our results show that these formulations can be used to solve small- and medium-sized harvest-scheduling problems optimally, or near-optimally, within reasonable periods of computing time. Solution quality and computing time were found to be sensitive to the initial age-class distribution of the forest and the mean polygon size relative to the maximum opening size. In addition, computation of the opening size constraints was found to be very sensitive to the maximum number of polygons in an opening constraint.

APA, Harvard, Vancouver, ISO, and other styles

42

Ovharhe, Oghenero Joseph. "Evaluation of Fadama III Project in the Niger Delta Area of Nigeria: Constraints and Strategies Perceptions." Asian Journal of Agriculture and Rural Development 10, no. 2 (July 11, 2020): 541–49. http://dx.doi.org/10.18488/journal.ajard.2020.102.541.549.

Full text

Abstract:

The study evaluated the constraints to the Fadama III project in some Niger Delta areas; namely, Akwa Ibom, Bayelsa, and the Delta States of Nigeria. A multistage sampling process was engaged to choose a sample of 420 respondents for the study. Data analyzed was done using means and ANOVA. Results obtained revealed that some constraint such as inadequate fund (x ̅=3.78), inadequate inputs support (x ̅=3.35) and high bureaucracy of donor agencies (x ̅=3.31) were identified as serious constraints by the respondents. The pooled mean constraints of respondents in the study area were Bayelsa, 2.40; Akwa Ibom, 2.32; and Delta, 2.24 accordingly. High values were placed on proposed strategies to overcome Fadama III constraints such as the conduct of regular farmers training sessions (mean=3.36) and improved FUG management team (mean = 3.30). The study concluded that some constraints are serious and others not serious; and accepted the null hypothesis (p>0.05) that there was no significant variation in the constraints facing the Fadama III project among the selected Niger Delta States. The study noted that there should be more support in the provision of farm inputs and assets to catapult productivity and timely delivery of advisory support.

APA, Harvard, Vancouver, ISO, and other styles

43

Belenkie, Israel, Rozsa Sas, Jamie Mitchell, Eldon R. Smith, and John V. Tyberg. "Opening the pericardium during pulmonary artery constriction improves cardiac function." Journal of Applied Physiology 96, no. 3 (March 2004): 917–22. http://dx.doi.org/10.1152/japplphysiol.00722.2003.

Full text

Abstract:

During acute pulmonary hypertension, both the pericardium and the right ventricle (RV) constrain left ventricular (LV) filling; therefore, pericardiotomy should improve LV function. LV, RV, and pericardial pressures and RV and LV dimensions and LV stroke volume (SV) were measured in six anesthetized dogs. The pericardium was closed, the chest was left open, and the lungs were held away from the heart. Data were collected at baseline, during pulmonary artery constriction (PAC), and after pericardiotomy with PAC maintained. PAC decreased SV by one-half. RV diameter increased, and septum-to-LV free wall diameter and LV area (our index of LV end-diastolic volume) decreased. Compared with during PAC, pericardiotomy increased LV area and SV increased 35%. LV and RV compliance (pressure-dimension relations) and LV contractility (stroke work-LV area relations) were unchanged. Although series interaction accounts for much of the decreased cardiac output during acute pulmonary hypertension, pericardial constraint and leftward septal shift are also important. Pericardiotomy can improve LV function in the absence of other sources of external constraint to LV filling.

APA, Harvard, Vancouver, ISO, and other styles

44

Li Yiming, Li Yi, and Zhou Mingtian. "Application of Area Predicted TCG Algorithm in Floorplanning with Boundary Constraint." International Journal of Advancements in Computing Technology 3, no. 5 (June 30, 2011): 208–15. http://dx.doi.org/10.4156/ijact.vol3.issue5.24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Kim, Yonghwan, Sanghoon Kwak, and Taewhan Kim. "Synthesis of Adaptable Hybrid Adders for Area Optimization under Timing Constraint." ACM Transactions on Design Automation of Electronic Systems 17, no. 4 (October 2012): 1–29. http://dx.doi.org/10.1145/2348839.2348847.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Tomkos, I., D. Vogiatzis, C. Mas, I. Zacharopoulos, A. Tzanakaki, and E. Varvarigos. "Performance engineering of metropolitan area optical networks through impairment constraint routing." IEEE Communications Magazine 42, no. 8 (August 2004): S40—S47. http://dx.doi.org/10.1109/mcom.2004.1321386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Strzelecki, Paweł, and Heiko von der Mosel. "Global curvature for surfaces and area minimization under a thickness constraint." Calculus of Variations and Partial Differential Equations 25, no. 4 (February 22, 2006): 431–67. http://dx.doi.org/10.1007/s00526-005-0334-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jun''an Wu, 武军安, 郭锐 Rui Guo, 刘荣忠 Rongzhong Liu, 柯尊贵 Zungui Ke, and 赵旭 Xu Zhao. "Edge area constraint guided filter depth image super-resolution reconstruction algorithm." Infrared and Laser Engineering 50, no. 1 (2021): 20200081. http://dx.doi.org/10.3788/irla.34_2020-0081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Jun''an Wu, 武军安, 郭锐 Rui Guo, 刘荣忠 Rongzhong Liu, 柯尊贵 Zungui Ke, and 赵旭 Xu Zhao. "Edge area constraint guided filter depth image super-resolution reconstruction algorithm." Infrared and Laser Engineering 50, no. 1 (2021): 20200081. http://dx.doi.org/10.3788/irla20200081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

MORISHITA, Naoyuki, Shinji NISHIWAKI, Kazuhiro IZUI, and Tsuguo KONDOH. "Topology Optimization in Navier-Stokes equation under the projected area constraint." Proceedings of Mechanical Engineering Congress, Japan 2020 (2020): J01216. http://dx.doi.org/10.1299/jsmemecj.2020.j01216.

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!