• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.460-466
• /
• 2007

There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.40-45
• /
• 2015

Online social networks(OSN) are very popular nowadays. As OSNs grows, the commercial markets are expanding their social commerce by applying Influence Maximization. However, in reality, there exist more than two players(e.g., commercial companies or service providers) in this same market sector. To address the Influence Maximization problem between adversaries, we first introduced Influence Maximization against the social adversaries' problem. Then, we proposed an algorithm that could efficiently solve the problem efficiently by utilizing social network properties such as Betweenness Centrality, Clustering Coefficient, Local Bridge and Ties and Triadic Closure. Moreover, our algorithm performed orders of magnitudes better than the existing Greedy hill climbing algorithm.

• The Journal of Society for e-Business Studies
• /
• v.17 no.4
• /
• pp.117-140
• /
• 2012

This study focuses on the use of competitive analysis to identify the effective benchmarking target through consulting techniques to derive improvements. After developed using DEA(Date Envelopment Analysis) the relative efficiency analysis tool for competitor analysis to apply in consulting on-site or within the organization, this study compared the new techniques and the existing techniques. This study was carried out as follows. First, through a review of the literature, consulting competitive analysis techniques and methodologies relative efficiency analysis technique DEA for research scholars examined. Second, DEA-based competitive analysis, multidimensional efficiency analysis is presented. Third, The case study was conducted to determine the suitability and practicality of this analysis method for public company "A".

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1457-1464
• /
• 2011

In this paper, we go one step further in that the number of competitive layers is not determined by experience but can be determined by fuzzy control rules based on input pattern information. In our method, we design a set of membership functions and corresponding rules and used Max-Min reasoning proposed by Mamdani. Also, we use centroid method as a defuzzification. In experiment that has various patterns of English inputs, this new method works beautifully to determine the number of competitive layers and also efficient in overall accuracy as a result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.359-365
• /
• 2008

CP(Counterpropagation)알고리즘은 서로 다른 두 개의 신경망이 하나로 결합 된 혼합형 모델로서, 다른 신경망 모델에 비해 비교적 단순하고 빠른 학습 속도를 보인다. 그러나 CP 알고리즘은 다양한 패턴이 입력되면 충분한 경쟁층의 수가 설정되지 않아 학습이 불안정하고, 출력층에서 연결강도를 조정할 때 일반적인 학습률 조정방법으로 불안정한 학습 결과를 보인다. 이러한 문제점을 해결하기 위해 다수의 경쟁층을 설정하여 경쟁층에서 패턴 분류의 정확성을 높이고, 입력 벡터와 승자 뉴런의 대표 벡터간의 차이와 승자 빈도수를 반영하여 학습률을 동적으로 조정하여 경쟁층에서의 학습이 안정적으로 진행되도록 하고, 출력층에서 연결강도를 조정할 때 모멘텀(momentum)학습법을 적용한 개선된 CP 알고리즘이 제안되었다. 본 논문에서는 개선된 CP 알고리즘에서 경쟁층의 수를 효율적으로 설정하기 위해 퍼지 제어 기법을 이용하여 경쟁층의 수를 결정하는 방법을 제안한다. 제안된 방법은 CP 알고리즘에 입력되는 패턴의 정보를 이용하여 퍼지 소속 함수를 설계하고 입력에 대한 소속도를 계산한 후, 퍼지 제어 규칙을 적용하고, Mamdani의 Min_Max 추론 방법으로 추론한다. 퍼지 추론을 통해 최종적으로 얻어진 값을 무게 중심법으로 비퍼지화 하여 최종적으로 개선된 CP 알고리즘의 경쟁층의 수를 결정하는데 적용한다. 제안된 방법의 학습 및 인식 성능을 평가하기 위해, 숫자, 영어 등과 같이 다양한 패턴을 실험에 적용한 결과, 제안된 방법이 경쟁층의 수를 결정하는데 효과적임을 확인할 수 있었다.

• Journal of Korea Port Economic Association
• /
• v.31 no.3
• /
• pp.75-91
• /
• 2015

This study aims to assess the competitiveness of 30 logistics centers that operate in the hinterland of the North Container Port at Busan New Port. Thirty-two key factors were selected from previous studies to analyze and improve competitiveness and expand business opportunities in the hinterland. Suggestions from logistics experts were also canvassed. These variables were then put through first- and second-factor analysis to verify validity and measure confidence levels; they were later categorized into five factors and 15 sub-factors impacting on competitiveness. The categorized factors were compared using the analytic hierarchy process (AHP) to assess the importance of each factor and sub-factor in the case of logistics centers in the North Container hinterland of Busan New Port. The findings indicate that factors related to the securing of significant amounts of container cargoes were of greater importance. On the other hand, relatively basic factors proved to be less important in improving the competitiveness of the port hinterland.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.423-434
• /
• 2007

Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

• Journal of the Economic Geographical Society of Korea
• /
• v.8 no.2
• /
• pp.267-284
• /
• 2005

This study analyzes the effects of localities' competitiveness which can contribute to employment growth in industries, on economic development in the local jurisdictions. For this analysis, such competitiveness is measured by competitive shares calculated from the application of a shift-share method to the employment growth in industries each locality witnessed over the 1990s. And we use annual population growth rate and average annual per capita income (substituted by per capita head tax derived from income tax) of the early 2000s as variables of local economic development. The analysis targets 167 local jurisdictions in Korea for the employment growth in industries, and is mainly placed in a spatial econometric setting. The results of analysis are as follows : The competitive share of manufacturing has the effect of increasing annual population growth rate whereas that of construction has a negative effect on the population growth rate. As well, the competitive shares of manufacturing and of construction negatively influence average annual per capita income while that of community, social and personal services positively affects the income.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.34-39
• /
• 2006

IEEE 802.11e 무선LAN 매체접근제어(MAC) 통신규약의 분산조정함수(DCF)의 성능은 경쟁노드수가 증가할수록 급격히 떨어진다. 이러한 문제점을 해결하기 위해서 채널의 유휴슬롯시간(Idle Time)을 측정해서 최소 경쟁윈도($CW_{min}$)를 조절하는 방식이 제시되었다. 이러한 방식을 각 부류별로 서비스 품질이 보장되는 IEEE 802.11e 네트워크로 확장하여 성능을 최대화하는 기법을 이 논문에서 다루겠다. 각 부류별로 서비스품질은 유지하면서 네트워크 전체의 성능을 높일 수 있는 최적의 경쟁윈도 크기를 찾아내는 기법을 보이도록 하겠다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.255-258
• /
• 2001

This introduces a improved method of the forward kinematics analysis, which finds the 6DOF motions and velocities from the given six cylinder lengths in the Steward platform. The numerical method(Newton Raphson Mehotd)of the forward kinematics analysises has the disadvantage of the long calculated time. To overcome this, we propose the competitive method that determine a proper initial value. Through the competitive method, we can select a proper initial value so that the calculate time is reduced. therefore we can give the property of the real time process to the forward kinematics analysis. We show the result comparing between general Newton-Raphson method and proposed one. From the result we verify the performance of the proposed method.