• East Asian mathematical journal
• /
• 제33권1호
• /
• pp.83-102
• /
• 2017

The main purpose of this paper is to introduce a pair new class of primal and dual problem associated with an operator. We prove the sufficient optimality theorem, weak duality theorem and strong duality theorem for these problems. The equivalence between the generalized optimization problems and the generalized variational inequality problems is studied in ordered topological vector space modeled in Hilbert spaces. We introduce the concept of partial differential associated (PDA)-operator, PDA-vector function and PDA-antisymmetric function to show the existence of a new class of function called, ($T_{\eta};{\xi}_{\theta}$)-invex functions. We discuss first and second kind of ($T_{\eta};{\xi}_{\theta}$)-invex functions and establish their existence theorems in ordered topological vector spaces.

• 대한수학회논문집
• /
• 제22권2호
• /
• pp.247-258
• /
• 2007

In this paper a new class of system of generalized nonlinear variational inequalities involving strongly monotone, relaxed co coercive and relaxed generalized monotone mappings in Hilbert spaces is introduced and studied. Based on the projection method, an equivalence between the system of generalized nonlinear variational inequalities and the fixed point problem is established, which is used to suggest some new iterative algorithms for computing approximate solutions of the system of generalized nonlinear variational inequalities. A few sufficient conditions which ensure the existence and uniqueness of solution of the system of generalized nonlinear variational inequalities are given, and the convergence analysis of iterative sequences generated by the algorithms are also discussed.

• 한국CDE학회논문집
• /
• 제5권3호
• /
• pp.263-275
• /
• 2000

Multidisciplinary design optimization(MDO) can yield optimal design considering all the disciplinary requirements concurrently. A method to implement the collaborative optimization(CO) approach, one of the MDO methodologies, is developed using a pre-compiler “EzpreCompiler”, a design optimization library “EzOptimizer”, and a common object request broker architecture(CORBA) in distributed computing environment. The CO approach is applied to a mathematical example to show its applicability and equivalence to standard optimization(SO) formulation. In a realistic engineering problem such as optimal design of a two-member hub frame, optimal design of a speed reducer and initial design of a bulk carrier, the CO yields better results than the SO. Furthermore, the CO allows the distributed processing using the CORBA, which leads to reduction of overall computation time.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.521-521
• /
• 2000

This paper investigates the problem of robust H$_{\infty}$ filter with FIR(Finite Impulse Response) structure for linear continuous time-varying systems with sampled-data measurements. It is assumed that the system is subject to real time-varying uncertainty which is represented by the state-space model having parameter uncertainty. The robust H$_{\infty}$ FIR filter is proposed for the continuous-time linear parameter uncertain systems. It is also derived from the equivalence relationship between the robust linear H$_{\infty}$ FIR filter and the robust linear H$_{\infty}$ filter with sampled-data measurements.

• 전자공학회논문지A
• /
• 제28A권9호
• /
• pp.680-684
• /
• 1991

The scattering problem of a transverse electric (TE) plane wave by strip grating with a dielectric slab over a ground plane is analyzed by the method of moments. By use of equivalence principle, surface magnetic current density on the shorted slot is expanded in a series of Chebyshev polynomial a satisfying the appropriate edge condition. Numerical results for reflection coefficient are obtained and compared with other available results. Our numerical results obtained from the present method are in good agreement with other result available in the literature.

• 대한전자공학회논문지
• /
• 제27권11호
• /
• pp.20-24
• /
• 1990

본 논문에서는 유전체 판상의 스트립 회절격자에 의한 TE 평면파의 산란문제에 관한 효율적인 수렴해를 제시하였다. 본 논문의 방법은 등가 원리에 따라서 단락된 슬롯 위에 놓여진 등가 자계 전류를 적절한 모서리 조건을 만족하는 Chebyshev 다항식의 급수로서 전개하는데 기초를 둔다. 본 논문의 정확도와 수렴 속도를 입증하기 위해 반사 계수와 투과 계수에 대한 수치적인 결과를 계산하여 다른 결과와 비교하였다.

• 전기학회논문지
• /
• 제60권3호
• /
• pp.625-631
• /
• 2011

This paper presents a discrete-time output feedback consensus algorithm for Multi-Agent Systems (MAS). Under the assumption that an agent is aware of the relative state information about its neighbors, a state feedback consensus algorithm is designed based on Linear Matrix Inequality (LMI) method. In general, however, it is possible to obtain its relative output information rather than the relative state information. To reconcile this problem, an Unknown Input Observer (UIO) is employed in this paper. To this end, first it is shown that the relative state information can be estimated using the UIO and the measured relative output information. Then a certainty-equivalence type output feedback consensus algorithm is proposed by combining the LMI-based state feedback consensus algorithm with the UIO. Finally, simulation results are given to illustrate that the proposed method successfully achieves the state consensus.

• 한국IT서비스학회지
• /
• 제6권1호
• /
• pp.151-158
• /
• 2007

D-class computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and search for equivalent $n{\times}n$ Boolean matrices according to a specific equivalence relation. It is easy to see that even multiplying all $n{\times}n$ Boolean matrices with themselves shows exponential time complexity and D-Class computation was left an unsolved problem due to its computational complexity. The vector-based multiplication theory shows that the multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices can be done much more efficiently. However, D-Class computation requires computation of equivalent classes in addition to the efficient multiplication. The paper discusses a theory and an algorithm for efficient D-class computation, and shows execution results of the algorithm.

• 한국IT서비스학회지
• /
• 제7권4호
• /
• pp.221-230
• /
• 2008

Green's relations are five equivalence relations that characterize the elements of a semigroup in terms of the principal ideals. The J relation is one of Green's relations. Although there are known algorithms that can compute Green relations, they are not useful for finding all J relations in the semigroup of all $n{\times}n$ Boolean matrices. Its computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices. The size of the semigroup of all $n{\times}n$ Boolean matrices grows exponentially as n increases. It is easy to see that it involves exponential time complexity. The computation of J relations over the $5{\times}5$ Boolean matrix is left an unsolved problem. The paper shows theorems that can reduce the computation time, discusses an algorithm for efficient J relation computation whose design reflects those theorems and gives its execution results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3533-3549
• /
• 2019

A big database utilizes the establishing network technology, and it became an emerging trend in the computing field. Therefore, there is a necessity for an optimal and effective data distribution approach to deal with this trend. This research presents the practical perspective of designing and implementing distributed database features. The proposed system has been establishing the satisfying, reliable, scalable, and standardized use of information. Furthermore, the proposed scheme reduces the vast and recurring efforts for designing an individual system for each university, as well as it is effectively participating in solving the course equivalence problem. The empirical finding in this study shows the superiority of the distributed system performance based on the average response time and the average waiting time than the centralized system. The system throughput also overcomes the centralized system because of data distribution and replication. Therefore, the analyzed data shows that the centralized system thrashes when the workload exceeds 60%, while the distributed system becomes thrashes after 81% workload.