• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.327-336
• /
• 2012

Let {$X_{ni}$, $i{\geq}1$, $n{\geq}1$} be an array of rowwise and pairwise negatively quadrant dependent random variables with mean zero, {$a_{ni}$, $i{\geq}1$, $n{\geq}1$} an array of weights and {$b_n$, $n{\geq}1$} an increasing sequence of positive integers. In this paper we consider some results concerning complete convergence of ${\sum}_{i=1}^{bn}a_{ni}X_{ni}$.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.1
• /
• pp.1-6
• /
• 2010

The Analytic Hierarchy Process (AHP) has been applied widely in various decision making fields. One of advantages of the AHP is the consistency test. However, it has several problems such as the limit of its concept, the limit of 9 scales and stern criteria, contradictory pairwise comparison. In this paper, we propose new criteria for the consistency with more realistic and ideal conditions. To derive the criteria, we conduct the simulation and use the bootstrap method, which is one of resampling techniques in the simulation area.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Annual Conference of KIPS
• /
• 2005.11a
• /
• pp.873-876
• /
• 2005

무선 센서 네트워크 (Wireless Sensor Network)에서 기존에 존재하는 대부분의 보안 프로토콜들은 대칭적인 공유키(symmetric pairwise key) 설정에 기반하고 있다. 그러나 이러한 프로토콜들은 노드 전복 (node compromising), 그리고 과중한 트래픽의 문제점을 안고 있다. 더욱이, 대칭키 방법을 이용한 브로드캐스트 메시지 인증은 자원이 제약된 센서네트워크에서 적용하기에는 너무 복잡하다. 본 논문은 공개키를 이용한 공유키(Pairwise Key) 설정에 기반한 보안 프로토콜들을 제안한다. 특히 경량성을 위하여 타원 곡선 암호 (Ellptic Curve Cryptography)를 채택하였다. 제안 프로토콜은 공유키 설정과 브로드캐스트 메시지 인증을 위하여 각각 Elliptic Curve Diffie-Hellman (ECDH)과 Elliptic Curve Digital Signature Algorithm (ECDSA)를 이용한다. 더욱이, 분산된 rekeying 메커니즘 (decentralized rekeying mechanism)을 도입함으로써 TinySec 의 성능을 향상시킨다.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.5
• /
• pp.375-383
• /
• 2006

Presented in this paper is a new fast and robust algorithm generating NC tool path for 2D pockets with islands. The input shapes are composed of line segments and circular arcs. The algorithm has two steps: creation of successive offset loops and linking the loops to a tool path. A modified pairwise technique is developed in order to speed up and stabilize the offset process, and the linking algorithm is focused on avoiding thin-wall cutting and minimizing tool retractions. The proposed algorithm has been implemented in C++ and some illustrative examples are presented to show the practical strength of the algorithm.

• Transactions of Materials Processing
• /
• v.12 no.5
• /
• pp.465-472
• /
• 2003

Engineering design can be viewed as a decision making process, which involves the nonlinear tradeoffs task among the multiple conflicting attributes and considers the robustness of design. In order to obtain best engineering design, methodology for accurate assessment of his/her preference about the multiple attributes is required. Conventionally, intuitive procedures based on lottery questions are used to elicit the designer's preference structure: however, they can lead to inconsistent and inexact preference results due to the rank reversal problems derived from the designer's big cognitive burden. In this paper, alternatively, a design methodology based on multiattribute utility function through the pairwise comparison among alternatives is presented. The proposed procedure is applied to an actual injection mold design with the aid of the CAE simulation and the result is discussed.

• Journal of the military operations research society of Korea
• /
• v.28 no.2
• /
• pp.34-55
• /
• 2002

This paper deals with the multiple attribute decision making problem when a decision maker incompletely articulates his/her preferences about the attribute weight and alternative value. Furthermore, we consider the attribute tree which is structured hierarchically. Techniques for establishing dominance with linear partial information are proposed in a hierarchically structured attribute tree. The linear additive value function under certainty is used in the model. The incompletely specified information constructs a feasible region of linear constraints and therefore the pairwise dominance relationship between alternatives leads to intractable non-linear programming. Hence, we propose solution techniques to handle this difficulty. Also, to handle the tree structure, we break down the attribute tree into sub-trees. Due to there cursive structure of the solution technique, the optimization results from sub-trees can be utilized in computing the value interval on the topmost attribute. The value intervals computed by the proposed solution techniques can be used to establishing the pairwise dominance relation between alternatives. In this paper, pairwise dominance relation will be represented as strict dominance and weak dominance, which ware already defined in earlier researches.

• The Journal of Natural Sciences
• /
• v.11 no.1
• /
• pp.15-17
• /
• 1999

Let {f(n)} be an increasing sequence such that f(n)>0 for each n and f(n)$\rightarrow$$\infty$. Let {X$_n$,n$\geq1$} be a sequence of pairwise independent random variables. In this paper we give sufficient conditions on {X$_n$,n$\geq1$} such that $sum_{i=1}^n$(X$_i$-EX$_i$)/f(n) converges to zero almost surely.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.1165-1168
• /
• 2007

센서노드들이 배치되었을 때 초기 보안 요구사항은 이웃 노드 사이의 보안키를 안전하고 효율적으로 설정하는 것이다. 이를 위해 본 논문에서는 클러스터 단위로 직접키를 공유함으로써 공유하는 센서 수를 줄임과 동시에 다항식이 노출 되어도 전체 센서 네트워크에 끼치는 영향을 최소화하여 안전성을 보장하게하고 컴퓨팅 오버헤드를 줄일 수 있게 하였다. 또한 가용성 보장을 위해 불필요한 키관리 동작을 지양하고 센서 노드의 에너지 소모를 감소시키기 위하여 근접 클러스터 헤더 노드와의 사전 키 분배를 통해 경로키를 설정하게 함으로써 센서노드간의 안전하고 효율적인 pairwise key 설정을 통해 안전한 통신이 가능하게 하였다.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.473-480
• /
• 2005

We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism we create bivariate Polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other's transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and tine for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.