• 산경연구논집
• /
• 제12권3호
• /
• pp.31-41
• /
• 2021

Purpose: The purpose of this paper is to analyze the impact of the minimum wage policy and the employment labor force in Myanmar by exploring firms' actions such as installing supplementary machines to substitute for labor resources and by addressing gender issues in employment. Research design, data, and methodology: This paper applies a fixed-effect estimation method by using the World Bank's enterprise panel data set surveyed in Myanmar. Results: Findings suggest that the minimum wage reduces both full-time and part-time employment, while the first minimum wage policy increases overall female employment. The adverse impacts are more pronounced for female employees of Joint Venture enterprises and enterprises located in the less-populated regions. Investment in capital such as equipment and machinery increase to substitute for labor after the minimum wage policy implementation; as a result, full-time employment slightly decreases. Conclusions: Appropriate measures concerning the minimum wage policy must be prepared by the government and institutions related to the labor union to serve the well-being of employees. Government of Myanmar should fix the minimum wage in a reasonable period based on the fiscal year for both employers and employees to prevent possible issues and losses resulting from the minimum wage being set.

• 정보처리학회논문지B
• /
• 제15B권6호
• /
• pp.609-612
• /
• 2008

G = (V, E) 를 단순 무방향성 그래프라 하자. Minimum Vertex Cover (MVC) 문제는 C 를 V 의 부분 집합이라 할 때 모든 간선들이 C 내의 최소 한 개 정점과 인접하게 되는 최소 집합 C 를 계산하는 것이다. 다른 많은 그래프 이론 문제와 마찬가지로 본 문제도 NP-hard 문제임이 증명되었다. 본 논문에서는 MVC 문제를 위한 LeafGA 라는 새로운 유전 알고리즘을 제시하며 또한 제시된 알고리즘을 널리 알려 진 기준 그래프들에 적용함으로써 그 효용성을 보인다.

• 한국IT서비스학회지
• /
• 제11권1호
• /
• pp.141-153
• /
• 2012

USM(Unit Service Management System) is the development tool and methodology to handling the event process in a U-City integrated platform by using the minimum unit services. USM can be one of the SOA development methodology. Minimum unit service has a minimum business logic that can be executed with input and output parameters. Minimum unit service consists of three parts : service profile, service input and output parameters and service execution information. USM provides two types of the execution method. One is module execution and the other is web service execution. The development of the event sinario by the USM development methodology can reduce the cost and duration of the u-service development by raising the rate of reusing minimum unit service.

• 한국컴퓨터산업학회논문지
• /
• 제3권1호
• /
• pp.35-44
• /
• 2002

주어진 다각형의 내부를 경로를 따라 이동하면서 감시하는 경비원 경로는 길이의 최소화 또는 링크의 최소화 등으로 구분할 수 있다. 최소링크를 가진 경비원 경로(watchman route with minimum route)는 경로의 방향 전환 횟수가 최소인 경비원 경로이며, 약 가시성 다각형(weakly visible polygon)은 서로 약 가시성을 가진 두개의 체인으로 구성된 다각형이다. 본 논문에서는 n개의 꼭지점을 가진 약 가시성 다각형의 최소 링크를 가진 경비원 경로를 구하는 Ο($n^2$) 시간의 알고리즘을 제시한다.

• 한국소음진동공학회논문집
• /
• 제11권9호
• /
• pp.431-438
• /
• 2001

This paper present experimental results of source identification for non-minimum phase system. Generally, a causal linear system may be described by matrix form. The inverse problem is considered as a matrix inversion. Direct inverse method can\`t be applied for a non-minimum phase system, the reason is that the system has ill-conditioning. Therefore, in this study to execute an effective inversion, SVD inverse technique is introduced. In a Non-minimum phase system, its system matrix may be singular or near-singular and has one more very small singular values. These very small singular values have information about a phase of the system and ill-conditioning. Using this property we could solve the ill-conditioned problem of the system and then verified it for the practical system(cantilever beam). The experimental results show that SVD inverse technique works well for non-minimum phase system.

• Journal of Computational Design and Engineering
• /
• 제3권2호
• /
• pp.132-139
• /
• 2016

In this paper, a minimum time path planning strategy is proposed for multi points manufacturing problems in drilling/spot welding tasks. By optimizing the travelling schedule of the set points and the detailed transfer path between points, the minimum time manufacturing task is realized under fully utilizing the dynamic performance of robotic manipulator. According to the start-stop movement in drilling/spot welding task, the path planning problem can be converted into a traveling salesman problem (TSP) and a series of point to point minimum time transfer path planning problems. Cubic Hermite interpolation polynomial is used to parameterize the transfer path and then the path parameters are optimized to obtain minimum point to point transfer time. A new TSP with minimum time index is constructed by using point-point transfer time as the TSP parameter. The classical genetic algorithm (GA) is applied to obtain the optimal travelling schedule. Several minimum time drilling tasks of a 3-DOF robotic manipulator are used as examples to demonstrate the effectiveness of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1609-1612
• /
• 1997

Kinematically redundantant manipulators have a nimber of potential advantages over nonredundant ones. Questions associated with manipulability measures for (non)redundant manipulators derived by minimum 2-norm solution and minimum infinity-norm solution in unit joint velocity are examined in detail.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.53-75
• /
• 2004

First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in a modified network. In section 5 we present several parallel preflow algorithms that solve the minimum flow problem. Finally, we present an application of the minimum flow problem.

• 한국수자원학회논문집
• /
• 제40권9호
• /
• pp.735-742
• /
• 2007

본 연구에서는 실제 대형 상수관망에서 보다 효율적이면서도 정확한 신뢰도를 추정할 수 있는 segment를 기반으로 한 minimum cutset 방법을 제안하였다. 기존의 상수관망에서 minimum outset을 기반으로 한 모형은 상수관을 minimum outset의 최소단위로 다루어 상수관 파괴에 따른 피해영역을 과소산정할 수 있는 문제점을 가지고 있다. 그러나 제안된 신뢰도 추정 모형은 기존 신뢰도 추정 모형과 달리, 상수관 파괴에 따른 피해영역을 현실적으로 추정하기 위하여 segment와 unintended isolation, 그리고 수리학적 피해인 압력저하영역을 도입하였다. 또한 minimum cutset 방법에서 정의될 수 있는 minimum cutset을 상수관망 내 일부 절점의 비정상 상태를 야기하는 segment 1개로 정의하였으며 정의된 minimum outset의 동시파괴조합의 확률을 고려하기 위하여 success mode approach를 적용하였다. 제안된 모형은 제수밸브의 위치와 수를 고려하여 상수관 파괴에 따른 피해영역을 추정하며, 실제 대형 상수관망인 Chester Water Authority에 적용한 결과, 기존 신뢰도 추정 모형과 비교할 때 보다 실제적인 피해영역의 추정과 이에 따른 신뢰도의 추정이 가능하였다.

• 대한전기학회논문지
• /
• 제41권9호
• /
• pp.1021-1030
• /
• 1992

When using a least squares estimator with exponential forgetting factor to identify continuous-time deterministic system, the problem of determining minimum eigenvalue is described in this paper. It is well known fact that the convergence rate of parameter estimates relies on various factors consisting of the estimator and especially, theirproperties can be directly affected by all eigenvalues in the parameter error differential equation. Fortunately, there exists only one adjusting eigenvalue in the given estimator and then, the parameter convergence rates depend on this minimum eigenvalue. In this note, a new result to determine the minimum eigenvalue is proposed. Under the assumption that the input has as many spectral lines as the number of parameter estimates, it can be proven that the minimum eigenvalue converges to a constant value, which is a function of the forgetting factor and the parameter estimates number.