• Title/Summary/Keyword: Multiple constraints

Search Result 542, Processing Time 0.036 seconds

A Process-centric Simulation Modeling Method Improving Product, Process, and Facility Information Representation Method (제품, 공정, 설비 정보 표현 방법을 개선한 공정 중심 시뮬레이션 모델링 방법)

  • Baek, Seon-Jung;Oh, Daekyun;Lee, Dong Kun;Lee, Philippe;Ryu, Cheolho;Woo, Jong Hun;Jeong, Yong-Kuk
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.4
    • /
    • pp.421-431
    • /
    • 2017
  • A process-centric simulation modeling method has been proposed to define a shipbuilding simulation model. Existing modeling methods have limitations for expressing various production information for a shipyard. The advanced process-centric modeling method proposed in this paper offers an improvement, effectively representing production information and constraints for a shipyard. To achieve this, a method and diagram components to define a process-centric simulation model in detail have been suggested. The modeling method can assign priorities when multiple products and facilities are assigned to the process. And layer concept was applied to express simulation model with hierarchical structure. To verify the effectiveness of the modeling method, comparative analysis has been performed and the actual shipbuilding process has been modeled using the proposed method. When a single facility was used for various purposes, we found that the proposed method was more advantageous than existing methods. As a result, it was possible to express constraints and flows that were difficult to identify with existing process-centric simulation modeling methods, and the methods were improved for use in shipyard production planning verification simulations.

A Study on the Introduction of Linear Programming Model into the Management of Korean Coastal and Offshore Fisheries (한국 연근해어업의 합리적 관리를 위한 LP모형의 도입방안에 관한 연구)

  • 박장일
    • The Journal of Fisheries Business Administration
    • /
    • v.25 no.1
    • /
    • pp.37-59
    • /
    • 1994
  • Many studies to cope with the present problems of Korean coastal and offshore fisheries has been performed, but these were done partly in necessities and general studies for Korean inshore and offshore fisheries are in early stage. Most of these studies adopted analytical way of approach for each fishery individually and they could not reflect the effect of correlated interaction among fisheries on the several common species/stocks, and thus optimal effort allocation was impossible. To consider general fisheries and optimal effort allocation among competing mixed species, a linear programming (LP) approach is applied in this study and introduced into 16 important inshore and offshore fisheries with 13 constraining species which were chosen by annual yield order. This study is not based on the biological interaction among species (i.e., prey - predator system) but the technological interaction between species and fishing efforts. For the application of LP model in these fisheries, the standardization of fishing efforts through different fishing gears could not be successful and a new way of effort standardization through CPUE for vessel tonnage was originated. Total standardized fishing effort on a particular species i, Ei, is computed as the linear summation of standardized fishing effort generated by each fishery j. That is, (equation omitted) where $f_{j}$ is the total vessel tonnage of fishery j and aij is the coefficients contributing to the standardized fishing effort per ton for species i taken in fishery j. The total fishing effort level on species i due to both directed fishing and by - catch can thus be accounted in the aij's. Optimal effort allocation among the j fisheries may be considered a minimizing problem (minimize $\Sigma$ $f_{j}$), subject to the constraints that standardized fishing effort levels on particular species are maintained at, above, and below certain predefined levels. Fishing effort goals for individual species can be based on various biological and/or economic criteria, i.e., fishing effort level generating maximum sustainable yield and/or maximum economic yield. But in this study the $F_{0.1}$ criteria which was accepted as an approximate level for $F_{mey}$ by Outland and Boerema's (1973) study. The findings of this study are, (1) LP model can be applied to the Korean inshore and offshore fisheries giobally. (2) Through a new way of combining multiple different fisheries' efforts for a particular species together generating standardized fishing effort, Schaefer curve could be applied to the complex system successfully. (3) The results of this study for total reduction scale were mostly the same as those of prior studies, but different much from the individual scales of reduction. This study showed the necessities for exploitation of more concrete parameters to put into consideration of profitability of fisheries and social factors, and this model can be modified according to the actual constraints. Also, considering the age structure of stocks, this model can be developed into better one for better fisheries management.ent.

  • PDF

Hardware-Software Cosynthesis of Multitask Multicore SoC with Real-Time Constraints (실시간 제약조건을 갖는 다중태스크 다중코어 SoC의 하드웨어-소프트웨어 통합합성)

  • Lee Choon-Seung;Ha Soon-Hoi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.592-607
    • /
    • 2006
  • This paper proposes a technique to select processors and hardware IPs and to map the tasks into the selected processing elements, aming to achieve high performance with minimal system cost when multitask applications with real-time constraints are run on a multicore SoC. Such technique is called to 'Hardware-Software Cosynthesis Technique'. A cosynthesis technique was already presented in our early work [1] where we divide the complex cosynthesis problem into three subproblems and conquer each subproblem separately: selection of appropriate processing components, mapping and scheduling of function blocks to the selected processing component, and schedulability analysis. Despite good features, our previous technique has a serious limitation that a task monopolizes the entire system resource to get the minimum schedule length. But in general we may obtain higher performance in multitask multicore system if independent multiple tasks are running concurrently on different processor cores. In this paper, we present two mapping techniques, task mapping avoidance technique(TMA) and task mapping pinning technique(TMP), which are applicable for general cases with diverse operating policies in a multicore environment. We could obtain significant performance improvement for a multimedia real-time application, multi-channel Digital Video Recorder system and for randomly generated multitask graphs obtained from the related works.

A Stable Multilevel Partitioning Algorithm for VLSI Circuit Designs Using Adaptive Connectivity Threshold (가변적인 연결도 임계치 설정에 의한 대규모 집적회로 설계에서의 안정적인 다단 분할 방법)

  • 임창경;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.10
    • /
    • pp.69-77
    • /
    • 1998
  • This paper presents a new efficient and stable multilevel partitioning algorithm for VLSI circuit design. The performance of multilevel partitioning algorithms that are proposed to enhance the performance of previous iterative-improvement partitioning algorithms for large scale circuits, depend on choice of construction methods for partition hierarchy. As the most of previous multilevel partitioning algorithms forces experimental constraints on the process of hierarchy construction, the stability of their performances goes down. The lack of stability causes the large variation of partition results during multiple runs. In this paper, we minimize the use of experimental constraints and propose a new method for constructing partition hierarchy. The proposed method clusters the cells with the connection status of the circuit. After constructing the partition hierarchy, a partition improvement algorithm, HYIP$^{[11]}$ using hybrid bucket structure, unclusters the hierachy to get partition results. The experimental results on ACM/SIGDA benchmark circuits show improvement up to 10-40% in minimum outsize over the previous algorithm $^{[3] [4] [5] [8] [10]}$. Also our technique outperforms ML$^{[10]}$ represented multilevel partition method by about 5% and 20% for minimum and average custsize, respectively. In addition, the results of our algorithm with 10 runs are better than ML algorithm with 100 runs.

  • PDF

Cost-Based Directed Scheduling : Part II, An Inter-Job Cost Propagation Algorithm (비용기반 스케줄링 : Part II, 작업간 비용 전파 알고리즘)

  • Suh, Min-Soo;Kim, Jae-Kyeong
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.1
    • /
    • pp.117-129
    • /
    • 2008
  • The cost-based scheduling work has been done in both the Operations Research (OR) and Artificial Intelligence (AI) literature. To deal with more realistic problems, AI-based heuristic scheduling approach with non-regular performance measures has been studied. However, there has been little research effort to develop a full inter-job cost propagation algorithm (CPA) for different jobs having multiple downstream and upstream activities. Without such a CPA, decision-making in scheduling heuristics relies upon local, incomplete cost information, resulting in poor schedule performance from the overall cost minimizing objective. For such a purpose, we need two types of CPAs : intra-job CPA and inter-job CPA. Whenever there is a change in cost information of an activity in a job in the process of scheduling, the intra-job CPA updates cost curves of other activities connected through temporal constraints within the same job. The inter-job CPA extends cost propagation into other jobs connected through precedence relationships. By utilizing the cost information provided by CPAs, we propose cost-based scheduling heuristics that attempt to minimize the total schedule cost. This paper develops inter-job CPAs that create and update cost curves of each activity in each search state, and propagate cost information throughout a whole network of temporal constraints. Also we propose various cost-based scheduling heuristics that attempt to minimize the total schedule cost by utilizing the cost propagation algorithm.

  • PDF

Influence of Internal and External Capacity on Adults' Food Waste Disposal Capacity (내적역량과 외적역량이 성인의 식품 쓰레기 처분에 대한 실천역량에 미치는 영향)

  • Kim, Ji Eun;Choi, Kyoung Sook
    • Korean Journal of Community Nutrition
    • /
    • v.26 no.6
    • /
    • pp.455-466
    • /
    • 2021
  • Objectives: The purpose of this study was to investigate the effects of internal and external capacity on the practical capacity for food waste disposal in adults. Methods: The study subjects were 410 adults who answered a structured questionnaire. The survey was conducted in January 2021. Data were analyzed through descriprive analysis, t-test, ANOVA, and multiple regression analysis using the SPSS Win 24.0. Results: First, in the analysis of internal capacity, attitude (3.95 out of 5 points) scored higher than knowledge (3.59 points). Attitudes showed significant differences according to gender (P < 0.001), age (P < 0.001), and income (P < 0.001). Knowledge showed significant differences according to gender (P < 0.01) and age (P < 0.05). Second, in the analysis of capacity, market constraints (3.73 points) scored the highest, followed by institutional conditions (3.48 points) and reference group (3.36 points). Market constraints differed according to gender (P < 0.001), and institutional conditions differed according to income (P < 0.001). There was a significant difference in the reference group according to the level of education (P < 0.05) and income (P < 0.05). Third, the practical capacity scores appeared in the order of separating discharge behavior, using behavior, purchasing behavior, and leadership behavior. Separating discharge behavior showed significant differences according to gender (P < 0.001), education level (P < 0.05), and income (P < 0.01). Using behavior showed a difference according to gender (P < 0.01), and purchasing behavior showed a significant difference according to income (P < 0.05). Leadership behavior showed no difference according to demographic factors. Fourth, internal capacity and external capacity showed a significant positive relationship with practical capacity. Factors affecting purchasing behavior were knowledge, attitude, institutional conditions, and reference group, and their explanatory power was 53%. Factors influencing using behavior were knowledge, attitude, institutional conditions, and reference group, and had an explanatory power of 37%. Leadership behavior was influenced by institutional conditions and the reference group, with an explanatory power of 31%. Conclusions: Internal capacity, external capacity, and practical capacity show differences according to demographic factors. Factors influencing the practical capacity of adults were knowledge, attitude, institutional conditions, and reference group.

An Analysis of Computerized Implementation of Film Colored Overlays Based on Optical Characteristics and User Preference (필름 색 오버레이의 광학적 특성과 사용자 선택을 반영한 컴퓨터 구현성 분석)

  • Jang, Young-Gun;Park, Chan-Khon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.223-232
    • /
    • 2014
  • The feasibility of a virtual colored overlay is based on constraints of computer and user preference and it is evaluated for people with Scotopic Sensitivity Syndrome. We draw ${\alpha}$ and chromaticities of virtual colored overlay which will be implemented on IT devices by measuring optical characteristics of 2 representative film overlays and simulating them. We analyzed the influence of two illuminating conditions on the virtual colored overlay. We find that it is possible to get the multiple combinations of alpha and source RGB values to match a chromaticity which is presented in CIE-Luv color space under ideal white condition of display, a user can select one among them with respect to clarity and comfort. Under 100 lx difference of illumination conditions, the changes of chromaticities are negligible, but luminances are increased $37.8cd/m^2$ average(std 2.006) at high illumination condition.

A reliable quasi-dense corresponding points for structure from motion

  • Oh, Jangseok;Hong, Hyunggil;Cho, Yongjun;Yun, Haeyong;Seo, Kap-Ho;Kim, Hochul;Kim, Mingi;Lee, Onseok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3782-3796
    • /
    • 2020
  • A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

Optimization of long span portal frames using spatially distributed surrogates

  • Zhang, Zhifang;Pan, Jingwen;Fu, Jiyang;Singh, Hemant Kumar;Pi, Yong-Lin;Wu, Jiurong;Rao, Rui
    • Steel and Composite Structures
    • /
    • v.24 no.2
    • /
    • pp.227-237
    • /
    • 2017
  • This paper presents optimization of a long-span portal steel frame under dynamic wind loads using a surrogate-assisted evolutionary algorithm. Long-span portal steel frames are often used in low-rise industrial and commercial buildings. The structure needs be able to resist the wind loads, and at the same time it should be as light as possible in order to be cost-effective. In this work, numerical model of a portal steel frame is constructed using structural analysis program (SAP2000), with the web-heights at five locations of I-sections of the columns and rafters as the decision variables. In order to evaluate the performance of a given design under dynamic wind loading, the equivalent static wind load (ESWL) is obtained from a database of wind pressures measured in wind tunnel tests. A modified formulation of the problem compared to the one available in the literature is also presented, considering additional design constraints for practicality. Evolutionary algorithms (EA) are often used to solve such non-linear, black-box problems, but when each design evaluation is computationally expensive (e.g., in this case a SAP2000 simulation), the time taken for optimization using EAs becomes untenable. To overcome this challenge, we employ a surrogate-assisted evolutionary algorithm (SAEA) to expedite the convergence towards the optimum design. The presented SAEA uses multiple spatially distributed surrogate models to approximate the simulations more accurately in lieu of commonly used single global surrogate models. Through rigorous numerical experiments, improvements in results and time savings obtained using SAEA over EA are demonstrated.

An Application of Minimum Support Stabilizer as a Model Constraint in Magnetotelluric 2D Inversion (최소모델영역 연산자를 모델제한조건으로 적용한 2차원 MT 역산)

  • Lee, Seong-Kon
    • Journal of the Korean earth science society
    • /
    • v.30 no.7
    • /
    • pp.834-844
    • /
    • 2009
  • Two-dimensional magnetotelluric (MT) inversion algorithm using minimum support (MS) stabilizer functional was implemented in this study to enhance the contrast of inverted images. For this implementation, this study derived a formula in discrete form for creeping model updates in the least-squares linearized inversion. A spatially varying regularization parameter determination algorithm, which is known as ACB (Active Constraint Balancing), was also adopted to stabilize the inversion process when using MS stabilizer as a model constraint. Inversion experiments for a simple isolated body model show well the feature of MS stabilizer in concentrating the anomalous body compared with the second-order derivative model constraint. This study also compared MS stabilizer and the second-order derivative model constraints for a model having multiple anomalous bodies to show the applicability of the algorithm into field data.