• Journal of Communications and Networks
• /
• 제16권1호
• /
• pp.81-91
• /
• 2014

This paper proposes hidden-node aware grouping (HAG) algorithm to enhance the performance of institute of electrical and electronics engineers (IEEE) 802.15.4 networks when they undergo either severe collisions or frequent interferences by hidden nodes. According to the degree of measured collisions and interferences, HAG algorithm dynamically transforms IEEE 802.15.4 protocol between a contention algorithm and a contention-limited one. As a way to reduce the degree of contentions, it organizes nodes into some number of groups and assigns each group an exclusive per-group time slot during which only its member nodes compete to grab the channel. To eliminate harmful disruptions by hidden nodes, especially, it identifies hidden nodes by analyzing the received signal powers that each node reports and then places them into distinct groups. For load balancing, finally it flexibly adapts each per-group time according to the periodic average collision rate of each group. This paper also extends a conventional Markov chain model of IEEE 802.15.4 by including the deferment technique and a traffic source to more accurately evaluate the throughput of HAG algorithm under both saturated and unsaturated environments. This mathematical model and corresponding simulations predict with 6%discrepancy that HAG algorithm can improve the performance of the legacy IEEE 802.15.4 protocol, for example, even by 95% in a network that contains two hidden nodes, resulting in creation of three groups.

• 한국전산구조공학회논문집
• /
• 제24권2호
• /
• pp.141-148
• /
• 2011

본 논문에서는 기둥축소량 보정의 효율성을 증진시키기 위한 방안으로서 유사한 축소 경향을 보이는 기둥들을 동일 그룹으로 묶는 기둥의 최적그루핑기법에 대하여 연구하였다. 기둥의 최적그루핑은 무감독학습에 의해 입력데이타의 패턴을 스스로 분류할 수 있는 코호넨의 자기조직화 형상지도 알고리즘을 이용하였다. 본 연구에 적용된 코호넨 네트워크는 두 개의 입력뉴런과 분류할 기둥그룹 개수만큼의 출력뉴런으로 구성된다. 입력뉴런에는 기둥축소량의 정규화된 평균과 표준편차가 입력되며, 출력뉴런에는 각 기둥이 속하게 될 기둥그룹이 출력된다. 제안된 알고리즘을 실제 축소량 해석이 수행된 두 개의 건물에 적용하여 그 적용성을 평가하였다. 적용결과 동일 그룹으로 분류된 기둥들은 서로 인접하고 있으며 서로 다른 기둥그룹끼리는 교차하지 않는 등 유사한 축소 경향을 보였다. 이로부터 본 연구의 기둥축소량의 최적그루핑 알고리즘은 충분한 실무적용성이 있음을 확인하였다.

• 대한전자공학회논문지SP
• /
• 제48권6호
• /
• pp.124-132
• /
• 2011

현대 전자전에서 레이더 신호 환경은 매우 복잡하고 고밀도화 되어 가고 있다. 이러한 신호로부터 원래의 방사체로 각각 분리하여 분석하고 식별하기 위한 전자전지원을 위해서는 신뢰성있는 신호분석 기법이 요구된다. 본 논문에서는 전자전지원의 신호분석 단계에서 신뢰성을 보장하며 신호처리 비용을 줄일 수 있는 새로운 레이더 신호 그룹화 알고리즘을 제안하였다. 제안된 기법은 주파수 변조 특성에 대한 통계적 분포 특성을 활용하여 수신 신호로부터 커널 밀도 추정 방식을 이용하여 신호 그룹화한다. 제안된 기법에 대해 실험 결과를 통해 우수한 성능을 보유함을 확인하였다.

• 한국안전학회지
• /
• 제20권4호
• /
• pp.130-137
• /
• 2005

Decision tree algorithm is one of the data mining techniques, which conducts grouping or prediction into several sub-groups from interested groups. This technique can analyze a feature of type on groups and can be used to detect differences in the type of industrial accidents. This paper uses C4.5 algorithm for the feature analysis. The data set consists of 24,887 features through data selection from total data of 25,159 taken from 2 year observation of industrial accidents in Korea For the purpose of this paper, one target value and eight independent variables are detailed by type of industrial accidents. There are 222 total tree nodes and 151 leaf nodes after grouping. This paper Provides an acceptable level of accuracy(%) and error rate(%) in order to measure tree accuracy about created trees. The objective of this paper is to analyze the efficiency of the C4.5 algorithm to classify types of industrial accidents data and thereby identify potential weak points in disaster risk grouping.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2003년도 추계학술대회 및 정기총회
• /
• pp.259-262
• /
• 2003

Group technology(GT) is a manufacturing philosophy which identifies and exploits the similarity of parts and processes in design and manufacturing. A specific application of GT is cellular manufacturing. the first step in the preliminary stage of cellular manufacturing system design is cell formation, generally known as a machine-part cell formation(MPCF). This paper presents and tests a grouping gentic algorithm(GGA) for solving the MPCF problem and uses the measurements of e(ficacy. GGA's replacement heuristic used similarity coefficients is presented.

• 한국경영과학회지
• /
• 제20권3호
• /
• pp.61-75
• /
• 1995

In a microcellular personal communication service (PCS) it is required to minimize the paging and location updating signals. We propose a multi-layered location registration scheme to reduce the paging and updating signals. In this scheme the subscribers are grouped by their characteristics (velocity and call arrival rate) and are served by appropriately sized location registration area. In order to group the subscriber, we define subscriber grouping problem (SGP). Proposition are examined to solve the grouping problem. The performance of the proposed subscriber grouping algorithm is tested with examples. Simulation results indicate that the subscriber grouping procedure is effective for designing the multi-layered location registration scheme.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 추계학술대회 학술발표 논문집
• /
• pp.85-88
• /
• 2000

본 논문은 Threshold Logic Unit(TLU)를 기본 뉴런으로 하여 최소화된 이진신경회로망을 합성하는 방법인 MSP Term Grouping(MTG) 알고리즘의 time complexity를 분석하고자 한다. 이를 전체 패턴 탐색을 통한 이진신경회로망 합성의 경우와 비교하여 MTG 알고리즘의 효용성을 보여준다.

• 대한산업공학회지
• /
• 제31권1호
• /
• pp.20-26
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• 대한산업공학회지
• /
• 제27권3호
• /
• pp.281-288
• /
• 2001

We consider in this article a multi-objective part-machine grouping problem in which parts have alternative process plans and expected annual demand of each part is known. This problem is characterized as optimally determining part sets and corresponding machine cells such that total sum of distance (or dissimilarity) between parts and total sum of load differences between machines are simultaneously minimized. Two heuristic algorithms are proposed, and examples are given to compare the performance of the algorithms.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.123-132
• /
• 1998

The group formation problem of the machine and part is a very important issue in the planning stage of cellular manufacturing systems. This paper investigates Self-Organizing Map(SOM) neural networks approach to machine-part grouping problem. We present a two-phase algorithm based on SOM for grouping parts and machines. SOM can learn from complex, multi-dimensional data and transform them into visually decipherable clusters. Output layer in SOM network is one-dimensional structure and the number of output node has been increased sufficiently to spread out the input vectors in the order of similarity. The proposed algorithm performs remarkably well in comparison with many other algorithms for the well-known problems shown in previous papers.