• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제23권1호
• /
• pp.61-72
• /
• 2016

In this paper, a boundary version of the Schwarz lemma for the holom- rophic function satisfying f(a) = b, |a| < 1, b ∈ ℂ and ℜf(z) > α, 0 ≤ α < |b| for |z| < 1 is invetigated. Also, we estimate a modulus of the angular derivative of f(z) function at the boundary point c with ℜf(c) = a. The sharpness of these inequalities is also proved.

• 대한수학회보
• /
• 제50권4호
• /
• pp.1357-1365
• /
• 2013

We find a lower bound on the number of real/inert imagi-nary/ramified imaginary quadratic extensions of the function field $\mathbb{F}_q(t)$ whose ideal class groups have an element of a fixed order, where $q$ is a power of 2.

• 산업경영시스템학회지
• /
• 제13권22호
• /
• pp.35-42
• /
• 1990

This paper deals with a single machine scheduling problem with a quadratic penalty function of completion times. The objective is to find a optimal sequence which minimizes the total penalty. A new type of node elimination procedure and precedence relation is developed that determines the ordering between adjacent jobs and is incorporated into a branch and bound algorithm. In addition, modified penalty function is considered and numerical examples are provided to test the effectiveness of the optimum algorithm.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1994년도 추계학술대회 논문집
• /
• pp.210-216
• /
• 1994

The velocity fields can be composed by nodal points using shape function. Forging load and deformed profile are obtained by minimizing total energy consumption rate which is function of unknown velocities at each nodal points. The velocity and stremiline distribution can also be investigated at the deformation profile. The effectiveness of proposed method in this paper is demonstrated by comparing with those of FEM and experiment, that is the results of upset forging problem. Obtained results are compared with FEM and experiment and fairly good agreement is found between them.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.777-780
• /
• 1993

Three optical fuzzy calculating modules, MAX/MIN, NOT/THROUGH, and SUP/THROUGH operating modules, are proposed. The MAX/MIN operating on inputted 2 membership functions. The NOT/THROUGH operating module calculates the complement of the membership function. The SUP/THROUGH operating module outputs an image representing the supremum (least upper bound) of the membership function. The THROUGH operation passes the image of the inputted membership function from the entrance to the exit. This paper demonstrates that these modules can output the image into which the modules transform inputted images on the basis of operation on fuzzy logic.

• 대한기계학회논문집A
• /
• 제34권2호
• /
• pp.191-201
• /
• 2010

본 연구는 비스플라인 근사기법을 사용한 분지한계법 기반의 새로운 전역 최적화 알고리즘에 관한 것이다. 본 연구에서는 알고리즘 구성 요소 및 이들의 구현 내용에 관한 상세히 설명한다. 핵심 요소로서, 상호분리되는 부공간으로의 설계 공간의 분할 작업이 있고, 이들 분할 부공간의 한계값 계산 작업이 있는데, 이들 모두는 실수형 비스플라인 볼륨모델에 의해 구현된다. 본 연구 알고리즘은 다양한 테스트 문제들을 가지고 해의 정확성, 함수호출 회수, 알고리즘 수행시간, 메모리 사용량, 알고리즘 수렴성 등 그 계산 성능들을 평가한다. 이러한 평가 결과는 제안 알고리즘이 직관에 의존하지 않는 완전 알고리즘이며, 대용량의 최적화 문제에도 높은 가능성이 있음을 보여주는 것이다.

• 한국정보통신학회논문지
• /
• 제14권2호
• /
• pp.277-286
• /
• 2010

이동통신 시스템에서 발생하는 큰 문제점 중의 하나는 다중 경로에 의한 신호 진폭의 감쇄 현상인 페이딩을 들수 있다. 이 때 동기시스템에서 maximum a posteriori 신호 위상 추정값의 분산에 대한 Cramer-Rao bound를 고찰하여 수신신호의 위상을 추정한다. 나카가미 페이딩 채널에서의 위상의 분산값에 대한 Cramer-Rao 하한치를 발견하기 위해서 위상에 대한 확률 밀도 함수를 이용한다. 또한 순서통계량을 이용하여 일반화된 선택 합성기법에 대한 오류 확률식을 유도하여 적절한 다이버시티 가짓수를 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2074-2093
• /
• 2022

RSA is known as one of the best techniques for securing secret information across an unsecured network. The private key which is one of private parameters is the aim for attackers. However, it is exceedingly impossible to derive this value without disclosing all unknown parameters. In fact, many methods to recover the private key were proposed, the performance of each algorithm is acceptable for the different cases. For example, Wiener's attack is extremely efficient when the private key is very small. On the other hand, Fermat's factoring can quickly break RSA when the difference between two large prime factors of the modulus is relatively small. In general, if all private parameters are not disclosed, attackers will be able to confirm that the private key is unquestionably inside the scope [3, n - 2], where n is the modulus. However, this scope has already been reduced by increasing the greatest lower bound to [d_il, n - 2], where d_il ≥ 3. The aim of this paper is to decrease the least upper bound to narrow the scope that the private key will remain within this boundary. After finishing the proposed method, the new scope of the private key can be allocated as [d_il, d_ir], where d_ir ≤ n - 2. In fact, if the private key is extremely close to the new greatest lower bound, it can be retrieved quickly by performing a brute force attack, in which d_ir is decreased until it is equal to the private key. The experimental results indicate that the proposed method is extremely effective when the difference between prime factors is close to each other and one of two following requirement holds: the first condition is that the multiplier of Euler totient function is very close to the public key's small value whereas the second condition is that the public key should be large whenever the multiplier is far enough.

• Journal of Power Electronics
• /
• 제18권5호
• /
• pp.1380-1397
• /
• 2018

The synchronous reluctance motor (SynRM) servo-drive system has highly nonlinear uncertainties owing to a convex construction effect. It is difficult for the linear control method to achieve good performance for the SynRM drive system. The nonlinear backstepping control system using upper bound with switching function is proposed to inhibit uncertainty action for controlling the SynRM drive system. However, this method uses a large upper bound with a switching function, which results in a large chattering. In order to reduce this chattering, a nonlinear backstepping control system using an adaptive law is proposed to estimate the lumped uncertainty. Since this method uses an adaptive law, it cannot achiever satisfactory performance. Therefore, a nonlinear backstepping control system using a reformed recurrent Hermite polynomial neural network with an adaptive law and an error estimated law is proposed to estimate the lumped uncertainty and to compensate the estimated error in order to enhance the robustness of the SynRM drive system. Further, the reformed recurrent Hermite polynomial neural network with two learning rates is derived according to an increment type Lyapunov function to speed-up the parameter convergence. Finally, some experimental results and a comparative analysis are presented to verify that the proposed control system has better control performance for controlling SynRM drive systems.

• 전기학회논문지
• /
• 제65권1호
• /
• pp.16-22
• /
• 2016

This paper addresses the load usage scheduling in the HEMS for residential power consumers. The HEMS would lead the residential users to change their power usage, so as to minimize the cost in response to external information such as a time-varying electricity price, the outside temperature. However, there may be a consumer's inconvenience in the change of the power usage. In order to improve this, it is required to understand the pattern of load usage according to the external information. Therefore, this paper suggests a methodology to model the load usage pattern, which classifies home appliances according to external information affecting the load usage and models the usage pattern for each appliance based on a copula function representing the correlation between variables. The modeled pattern would be reflected as a constraint condition for an optimal load usage scheduling problem in HEMS. To explain an application of the methodology, a case study is performed on an electrical water heater (EWH) and an optimal load usage scheduling for EHW is performed based on the branch-and-bound method. From the case study, it is shown that the load usage pattern can contribute to an efficient power consumption.