• Title/Summary/Keyword: global minimization

Search Result 82, Processing Time 0.026 seconds

A Study on the Environmental Consciousness of University Students for Sustainable Development (지속가능한 발전을 위한 대학생의 환경의식에 관한 연구)

  • Lim, Mann-Taek;Kim, Gon
    • KIEAE Journal
    • /
    • v.1 no.2
    • /
    • pp.37-45
    • /
    • 2001
  • As the global environmental crisis has been emerged as an important problem threatening the survival of the mankind, the environmental problems are recognized as a great issue governing the destiny of the whole mankind as well as a national problem. Therefore, more active attitude playing a leading role of global and local environmental preservation is required, escaping from conventional passive position for the minimization of economic damages according to global environment regulations. This study evaluates the 150 university students' consciousnesses and attitudes of the seriousness, major policies and issues of environmental pollutions, extracts their consciousness of environment and practicable tasks for the 21st century and is to give the basic reference materials of environmental policy development.

  • PDF

A quasistatic crack propagation model allowing for cohesive forces and crack reversibility

  • Philip, Peter
    • Interaction and multiscale mechanics
    • /
    • v.2 no.1
    • /
    • pp.31-44
    • /
    • 2009
  • While the classical theory of Griffith is the foundation of modern understanding of brittle fracture, it has a number of significant shortcomings: Griffith theory does not predict crack initiation and path and it suffers from the presence of unphysical stress singularities. In 1998, Francfort and Marigo presented an energy functional minimization method, where the crack (or its absence) as well as its path are part of the problem's solution. The energy functionals act on spaces of functions of bounded variations, where the cracks are related to the discontinuity sets of such functions. The new model presented here uses modified energy functionals to account for molecular interactions in the vicinity of crack tips, resulting in Barenblatt cohesive forces, such that the model becomes free of stress singularities. This is done in a physically consistent way using recently published concepts of Sinclair. Here, for the consistency of the model, it becomes necessary to allow for crack reversibility and to consider local minimizers of the energy functionals. The latter is achieved by introducing different time scales. The model is solved in its global as well as in its local version for a simple one-dimensional example, showing that local minimization is necessary to yield a physically reasonable result.

Loss Minimization In Distribution Systems Using Reactive Tabu Search (Reactive Tabu Search 알고리즘을 이용한 배전계통의 손실 최소화)

  • 최상열;장경일;신명철
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.17 no.5
    • /
    • pp.80-87
    • /
    • 2003
  • Network reconfiguration in distribution systems is realized by changing the status of sectiona1izing switches, and is usually done for loss minimization or load balancing in the system This parer presents an approach for loss minization in distribution systems using reactive tabu search. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. Reactive tabu search can give convergence property by using reaction and escape mechanism. Therefore, it can find global optimal solution regardless of initial system configuration. To demonstrate the validity of the proposed algorithm, numerical calculations are carried out the 32 bus system models.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

Effective Mesh Optimization Rule for finite Element Method Using Energy Minimization (최소 에너지 원리를 이용한 효율적인 유한요소 격자 생성에 관한 연구)

  • 박시형;김지환
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.04a
    • /
    • pp.361-368
    • /
    • 2002
  • A new remeshing algorithm based on the energy minimization is proposed for the finite element method. This utilizes the variation of mapping function between the master and global elements. The resultant equations are only the other form of the governing equations. However the equations have an important information about the relations between the elements. By assuming the solutions of the governing equations, these relations are used very usefully for the mesh optimization. The explicit formulations are presented for the relations of 1-dimensional equations and some examples are solved for comparison with the other methods. In addition, 2-dimensional expansion is presented for the general use.

  • PDF

Setup Minimization Problem in a Diverging Point of the Conveyor System (컨베이어 시스템 분기점에서의 셋업 최소화 문제)

  • Kim, Hyoungtae;Han, Yong-Hee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.95-108
    • /
    • 2013
  • The problem of constrained sequencing of a set of jobs on a conveyor system with the objective of minimizing setup cost is investigated in this paper. A setup cost is associated with extra material, labor, or energy required due to the change of attributes in consecutive jobs at processing stations. A finite set of attributes is considered in this research. Sequencing is constrained by the availability of conveyor junctions. The problem is motivated by the paint purge reduction problem at a major U.S. automotive manufacturer. We first model a diverging junction with a sequence-independent setup cost and predefined attributes as an assignment problem and this model is then extended for a more general situation by relaxing the initial assumptions in various ways.

Chaotic Search Algorithm for Network Reconfiguration in Distribution Systems (배전계통 최적구성을 위한 카오스 탐색법 응용)

  • 이상봉;유석구
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.6
    • /
    • pp.325-332
    • /
    • 2003
  • The loss minimization is one of the most important problems to save the operational cost in distribution systems. This paper presents an efficient method for optimal feeder reconfiguration of distribution systems. Chaos search algorithm (CSA) is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. In optimization problem, the CSA searches the global optimal solution on the basis of regularity in chaotic motions and easily escapes from local or near optimal solution. The CSA is tested on 15 buses and 32 buses distribution systems, and the results indicate that it is able to determine appropriate switching options for global optimum reconfiguration.

Finite Element Analysis and Local a Posteriori Error Estimates for Problems of Flow through Porous Media (다공매체를 통과하는 유동문제의 유한요소해석과 부분해석후 오차계산)

  • Lee, Choon-Yeol
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.5
    • /
    • pp.850-858
    • /
    • 1997
  • A new a posteriori error estimator is introduced and applied to variational inequalities occurring in problems of flow through porous media. In order to construct element-wise a posteriori error estimates the global error is localized by a special mixed formulation in which continuity conditions at interfaces are treated as constraints. This approach leads to error indicators which provide rigorous upper bounds of the element errors. A discussion of a compatibility condition for the well-posedness of the local error analysis problem is given. Two numerical examples are solved to check the compatibility of the local problems and convergence of the effectivity index both in a local and a global sense with respect to local refinements.

GLOBAL CONVERGENCE OF A MODIFIED BFGS-TYPE METHOD FOR UNCONSTRAINED NON-CONVEX MINIMIZATION

  • Guo, Qiang;Liu, Jian-Guo
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.325-331
    • /
    • 2007
  • To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

An Algorithm for the Singly Linearly Constrained Concave Minimization Problem with Upper Convergent Bounded Variables (상한 융합 변수를 갖는 단선형제약 오목함수 최소화 문제의 해법)

  • Oh, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.5
    • /
    • pp.213-219
    • /
    • 2016
  • This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.