• East Asian mathematical journal
• /
• v.31 no.1
• /
• pp.33-40
• /
• 2015

We study the geometry of r-lightlike submanifolds M of a semi-Riemannian manifold $\bar{M}$ with a semi-symmetric non-metric connection subject to the conditions; (a) the screen distribution of M is totally geodesic in M, and (b) at least one among the r-th lightlike second fundamental forms is parallel with respect to the induced connection of M. The main result is a classification theorem for irrotational r-lightlike submanifold of a semi-Riemannian manifold of index r admitting a semi-symmetric non-metric connection.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.299-310
• /
• 2001

In this paper, we study the methodology of distributing the requests of clients based on the state of real server in the LVS(Linux virtual server) clustering system. The WLC(weighted least connection) algorithm in the LVS cluster system is studied. The load distributing algorithm which assigns a weight into each real server is devised by considering the load of real servers. The load test is executed to estimate the load of real servers using a load generating tool. Throughout the result of the experiment, we suggest new load distributing algorithm based on the usage of physical memory of each real server. It is shown that the correction potentiality of new algorithm is somewhat better than that of the WLC algorithm.

• Journal of the Korean Statistical Society
• /
• v.4 no.1
• /
• pp.39-56
• /
• 1975

Ever since Gauss discussed the least-squares method in 1812 and Bertrand translated Gauss's work in French, the least-squares method has been used for various economic analysis. The justification of the least-squares method was given by Markov in 1912 in connection with the previous discussion by Gauss and Bertrand. The main argument concerned the problem of obtaining the best linear unbiased estimates. In some modern language, the argument can be explained as follow.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.427-432
• /
• 2005

I studied about existent load distribution algorithms and the WLC(Weighted Least Connection) algerian that is using much at present to distribute the connection request of users to real servers efficiently in web cluster system. The efficiency of web cluster system is fallen by load imbalance between servers, because there is problem In inaccurate load status measuring of servers and measuring timing at these load distribution algorithms. In this paper, I suggest an algorithm that distributes load base on various load state of servers by real time using broadcasting RPC(Remote Procedure Call) when a user requests connection, and implement a prototype and experiment its performance. The experiment result shows that load imbalance phenomenon between reai sowers was improved greatly than existing method, and performance of web cluster system was improved by efficiency that response time is shortened.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.144-151
• /
• 2010

The shadowing effects lead to the serious power losses of the PV module. The shadowing effects are caused by several factors such as leafs, dust, antenna and clouds. The dye-sensitized solar cells are more economical than the conventional silicon solar cell that's why the dye-sensitized solar cells are recently focused on. We carried out research on the efficiency of the dye-sensitized solar cell depending on the level of shadow changing the formula of the circuit. The research on the efficiency of the large dye-sensitized solar cell depending on the level of shadow focused on commercialization was carried out. As the results, it is known that the series and parallel connection method is the best choice for the least losses of PV module assemblies. It is especially known that one more series connection is the best choice for the least losses about shadowing effects and current losses in the series and parallel connection.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.199-201
• /
• 2006

웹 클러스터 시스템은 여러 대의 서버로 부하를 분산시키는 시스템이다. 부하 분산 알고리즘으로 가중치를 부여하고 연결 수가 가장 적은 리얼 서버를 선출하는 방식인 가중치 기반 최소-연결(WLC: Weighted Least-Connection) 스케줄링 알고리즘을 가장 많이 사용하고 있다. 이 알고리즘은 동시 사용자 수가 많은 웹 클러스터 시스템에 새로운 리얼 서버가 추가될 경우 새로운 서버에게 웹 요청을 집중적으로 할당하여 해당 서버에 과부하를 발생시키는 문제점이 있다. 본 논문에서는 새로운 리얼 서버에게 발생하는 과부하를 줄이기 위해, 웹 요청이 새로운 리얼 서버에게 연속적으로 할당되면 해당 서버를 스케줄링에서 잠시 제외되도록 하는 개선된 WLC 스케줄링 알고리즘을 제안한다.

• Communications for Statistical Applications and Methods
• /
• v.28 no.1
• /
• pp.21-37
• /
• 2021

There is a direct connection between linear discriminant analysis (LDA) and linear regression since the direction vector of the LDA can be obtained by the least square estimation. The connection motivates the penalized LDA when the model is high-dimensional where the number of predictive variables is larger than the sample size. In this paper, we study the penalized LDA for a class of penalties, called the moderately clipped LASSO (MCL), which interpolates between the least absolute shrinkage and selection operator (LASSO) and minimax concave penalty. We prove that the MCL penalized LDA correctly identifies the sparsity of the Bayes direction vector with probability tending to one, which is supported by better finite sample performance than LASSO based on concrete numerical studies.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.639-647
• /
• 2002

Efforts to obtain more power for unit root tests have continued. Pantula at el.(1994) compared empirical powers of several unit root test statistics and addressed that the weighted symmetric estimator(WSE) and the unconditional maximum likelihood estimator(UMLE) are the best among them. One can easily see that the powers of these two statistics are almost the same. In this paper we explain a connection between WSE and UMLE and suggest a unit root test statistic which may explain the connection between them.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.124-126
• /
• 1989

Inverse kinematic problem is a crucial point for robot manipulator control. In this paper, to implement the Jacobian control technique we used the Hopfield(Tank)'s neural network. The states of neurons represent joint veocities, and the connection weights are determined from the current value of the Jacobian matrix. The network energy function is constructed so that its minimum corresponds to the minimum least square error. At each sampling time, connection weights and neuron states are updated according to current joint position. Inverse kinematic solution to the planar redundant manipulator is solved by computer simulation.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.729-736
• /
• 2003

With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.