• Title/Summary/Keyword: Function Point Method

Search Result 1,523, Processing Time 0.04 seconds

NEW INTERIOR POINT METHODS FOR SOLVING $P_*(\kappa)$ LINEAR COMPLEMENTARITY PROBLEMS

  • Cho, You-Young;Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.13 no.3
    • /
    • pp.189-202
    • /
    • 2009
  • In this paper we propose new primal-dual interior point algorithms for $P_*(\kappa)$ linear complementarity problems based on a new class of kernel functions which contains the kernel function in [8] as a special case. We show that the iteration bounds are $O((1+2\kappa)n^{\frac{9}{14}}\;log\;\frac{n{\mu}^0}{\epsilon}$) for large-update and $O((1+2\kappa)\sqrt{n}log\frac{n{\mu}^0}{\epsilon}$) for small-update methods, respectively. This iteration complexity for large-update methods improves the iteration complexity with a factor $n^{\frac{5}{14}}$ when compared with the method based on the classical logarithmic kernel function. For small-update, the iteration complexity is the best known bound for such methods.

  • PDF

A Study for ATC Computation Using an Energy Function Method (에너지함수법을 이용한 ATC 계산에 관한 연구)

  • Kim, Yang-Il;Jeong, Sung-Won;Gim, Jae-Hyeon
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.465-466
    • /
    • 2007
  • Available transfer capability(ATC) quantifies the viable increase in real power transfer from one point to another in a power system. ATC calculation has predominantly focussed on steady-state viability. In many power systems, point-to-point transfer is not restricted by steady-state limits, but by undesirable dynamic behavior following large disturbance. In this paper, an energy function method for transient stability ATC computation is proposed, which utilizes a between the potential energy and energy function.

  • PDF

Improved Function Point Measurement Model for Software Size Estimation (소프트웨어 규모 산정을 위한 개선된 기능 점수 측정 모델)

  • Jung, In-Yong;Woo, Doug-Je;Park, Jin-Hyeong;Jeong, Chang-Sung
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.115-126
    • /
    • 2009
  • A software size estimation has to be analyzed in the beginning of the software life-cycle and helpful to the prediction of its size and cost. The software cost has been calculated by estimating software size from the user's point of view since the function point method based on international standards was introduced for the estimation of software size in 2004. However, the current function point method is not easy to be exploited for unfamiliar user, and has a problem that it cannot estimate the proper size for software such as engineering software, scientific calculations and simulation with complicated internal computational logic. This paper presents an improved model which can simplify the existing function point measurement procedure, and perform the estimation of software size in easy and fast way at the initial stage of project. Moreover, it presents a mathematical weighted value calculation model which can solve the problem of the fixed complexity weighted value and reflect the characteristics of organization as its data is pilled up. Our evaluation shows that the presented model has advantage that it can measure the size more rapidly than the existing FPA methods and has more correlation with LOC.

  • PDF

Faster MapToPoint over $F_{3^m}$ for Pairing-based Cryptosystems (페어링 암호 시스템을 위한 $F_{3^m}$에서의 효율적인 MapToPoint 방법)

  • Park, Young-Ho;Cho, Young-In;Chang, Nam-Su
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.6
    • /
    • pp.3-12
    • /
    • 2011
  • A hashing function that maps arbitrary messages directly onto curve points (MapToPoint) has non-negligible complexity in pairing-based cryptosystems. Unlike elliptic curve cryptosystems, pairing-based cryptosystems require the hashing function in ternary fields. Barreto et al. observed that it is more advantageous to hash the message to an ordinate instead of an abscissa. So, they significantly improved the hashing function by using a matrix with coefficients of the abscissa. In this paper, we improve the method of Barreto et al. by reducing the matrix. Our method requires only 44% memory of the previous result. Moreover we can hash a message onto a curve point 2~3 times faster than Barreto's Method.

DESCRIPTIONS OF ATTACK ANGLE AND IDEAL LIFT COEFFICIENT FOR VARIOUS AIRFOIL PROFILES IN WIND TURBINE BLADE

  • JAEGWI GO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.27 no.1
    • /
    • pp.75-86
    • /
    • 2023
  • The angle of attack is highly sensitive to pitch point in the airfoil shape and the decline of pitch point value induces smaller angle of attack, which implies that airfoil profile possessing closer pitch point to the airfoil tip reacts more sensitively to upcoming wind. The method of conformal transformation functions is employed for airfoil profiles and airfoil surfaces are expressed with a trigonometric series form. Attack angle and ideal lift coefficient distributions are investigated for various airfoil profiles in wind turbine blade regarding conformal transformation and pitch point. The conformed angle function representing the surface angle of airfoil shape generates various attack angle distributions depending on the choice of surface angle function. Moreover, ideal attack angle and ideal lift coefficient are susceptible to the choice of airfoil profiles and uniform loading area. High ideal attack angle signifies high pliability to upcoming wind, and high ideal lift coefficient involves high possibility to generate larger electric energy. According to results obtained pitch point, airfoil shape, uniform loading area, and the conformed airfoil surface angle function are crucial factors in the determination of angle of attack.

Development of a Multi-objective function Method Based on Pareto Optimal Point (Pareto 최적점 기반 다목적함수 기법 개발에 관한 연구)

  • Na, Seung-Soo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.42 no.2 s.140
    • /
    • pp.175-182
    • /
    • 2005
  • It is necessary to develop an efficient optimization technique to optimize the engineering structures which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of engineering structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points by spreading point randomly entire the design spaces. In this paper, a Pareto optimal based multi-objective function method (PMOFM) is developed by considering the search direction based on Pareto optimal points, step size, convergence limit and random search generation . The PMOFM can also apply to the single objective function problems, and can consider the discrete design variables such as discrete plate thickness and discrete stiffener spaces. The design results are compared with existing Evolutionary Strategies (ES) method by performing the design of double bottom structures which have discrete plate thickness and discrete stiffener spaces.

A Function Evaluation by Fuzzy Set in Value Engineering (가치공학(VE)에 있어 Fuzzy Set을 이용한 기능평가 방법)

  • 이근희;이동형
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.13 no.22
    • /
    • pp.43-50
    • /
    • 1990
  • In conventional function analysis, the function values are evaluated by experts, which are treated as exact values. For many cases, it is often difficult to evaluate the function values of a certain subject because the criteria of evaluation are very vague. This paper presents a new function evaluation method using fuzzy set. The purpose of the method is to minimize the difference among experts by recognizing an intersection point of membership function as a representative value.

  • PDF

A LARGE-UPDATE INTERIOR POINT ALGORITHM FOR $P_*(\kappa)$ LCP BASED ON A NEW KERNEL FUNCTION

  • Cho, You-Young;Cho, Gyeong-Mi
    • East Asian mathematical journal
    • /
    • v.26 no.1
    • /
    • pp.9-23
    • /
    • 2010
  • In this paper we generalize large-update primal-dual interior point methods for linear optimization problems in [2] to the $P_*(\kappa)$ linear complementarity problems based on a new kernel function which includes the kernel function in [2] as a special case. The kernel function is neither self-regular nor eligible. Furthermore, we improve the complexity result in [2] from $O(\sqrt[]{n}(\log\;n)^2\;\log\;\frac{n{\mu}o}{\epsilon})$ to $O\sqrt[]{n}(\log\;n)\log(\log\;n)\log\;\frac{m{\mu}o}{\epsilon}$.

An Economic Dispatch Algorithm as Combinatorial Optimization Problems

  • Min, Kyung-Il;Lee, Su-Won;Moon, Young-Hyun
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.4
    • /
    • pp.468-476
    • /
    • 2008
  • This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the $\lambda$-P table method is used to calculate ED for the fitness function of GA. The $\lambda$-P table method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with three kinds of ED problems, namely ED considering valve-point effects (EDVP), ED with multiple fuel units (EDMF), and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all three ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.

A Study on Decision of Optimal Point of Single Facility Location when the Application Region is Divided into Two (장애물이 있는 경우 단일설비의 최적위치의 결정에 관한 연구)

  • 강성수
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.5 no.7
    • /
    • pp.9-15
    • /
    • 1982
  • The rectilinear-distance location problem combines the property of being a very appropriate distance measure for a large number of location problems and the property of being very simple to treat analytically. An obvious question to be asked at the optimal point which is obtained by the rectilinear distance method is, "what if the point is not available as a location site\ulcorner." The point may, for example, be inaccessible or may coincide with the location of another structure, a river, or a municipal park. In this case, one approach that may be employed is to construct contour lines (also called iso-cost or level curves) of the cost function. Contour lines provide considerable insight into the shape of the surface of the total cost function as well as a useful means of evaluating alternative locations for the new facility. But, when there is an obstacle which divides the application area into two. The optimal location(which is acquired by the rectilinear distance method) is not coincide with the minimal cost point and the contour line is occasionally of no use, this paper shows the method of finding a way to decide an optimal point of single facility location in this case.this case.

  • PDF