• 제목/요약/키워드: centralized algorithm

Search Result 211, Processing Time 0.031 seconds

Comparison of Spatial and Frequency Images for Character Recognition (문자인식을 위한 공간 및 주파수 도메인 영상의 비교)

  • Abdurakhmon, Abduraimjonov;Choi, Hyeon-yeong;Ko, Jaepil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.439-441
    • /
    • 2019
  • Deep learning has become a powerful and robust algorithm in Artificial Intelligence. One of the most impressive forms of Deep learning tools is that of the Convolutional Neural Networks (CNN). CNN is a state-of-the-art solution for object recognition. For instance when we utilize CNN with MNIST handwritten digital dataset, mostly the result is well. Because, in MNIST dataset, all digits are centralized. Unfortunately, the real world is different from our imagination. If digits are shifted from the center, it becomes a big issue for CNN to recognize and provide result like before. To solve that issue, we have created frequency images from spatial images by a Fast Fourier Transform (FFT).

  • PDF

Controller Backup and Replication for Reliable Multi-domain SDN

  • Mao, Junli;Chen, Lishui;Li, Jiacong;Ge, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.12
    • /
    • pp.4725-4747
    • /
    • 2020
  • Software defined networking (SDN) is considered to be one of the most promising paradigms in the future. To solve the scalability and performance problem that a single and centralized controller suffers from, the distributed multi-controller architecture is adopted, thus forms multi-domain SDN. In a multi-domain SDN network, it is of great importance to ensure a reliable control plane. In this paper, we focus on the reliability problem of multi-domain SDN against controller failure from perspectives of backup controller deployment and controller replication. We firstly propose a placement algorithm for backup controllers, which considers both the reliability and the cost factors. Then a controller replication mechanism based on shared data storage is proposed to solve the inconsistency between the active and standby controllers. We also propose a shared data storage layout method that considers both reliability and performance. Besides, a fault recovery and repair process is designed based on the controller backup and shared data storage mechanism. Simulations show that our approach can recover and repair controller failure. Evaluation results also show that the proposed backup controller placement approach is more effective than other methods.

Concurrency Conflicts Resolution for IoT Using Blockchain Technology

  • Morgan, Amr;Tammam, Ashraf;Wahdan, Abdel-Moneim
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.331-340
    • /
    • 2021
  • The Internet of Things (IoT) is a rapidly growing physical network that depends on objects, vehicles, sensors, and smart devices. IoT has recently become an important research topic as it autonomously acquires, integrates, communicates, and shares data directly across each other. The centralized architecture of IoT makes it complex to concurrently access control them and presents a new set of technological limitations when trying to manage them globally. This paper proposes a new decentralized access control architecture to manage IoT devices using blockchain, that proposes a solution to concurrency management problems and enhances resource locking to reduce the transaction conflict and avoids deadlock problems. In addition, the proposed algorithm improves performance using a fully distributed access control system for IoT based on blockchain technology. Finally, a performance comparison is provided between the proposed solution and the existing access management solutions in IoT. Deadlock detection is evaluated with the latency of requesting in order to examine various configurations of our solution for increasing scalability. The main goal of the proposed solution is concurrency problem avoidance in decentralized access control management for IoT devices.

A study on the design and implementation of a virus spread prevention system using digital technology (디지털 기술을 활용한 바이러스 확산 방지 시스템 설계 및 구현에 관한 연구)

  • Ji-Hyun, Yoo
    • Journal of IKEEE
    • /
    • v.26 no.4
    • /
    • pp.681-685
    • /
    • 2022
  • Including the COVID-19 crisis, humanity is constantly exposed to viral infections, and efforts are being made to prevent the spread of infection by quickly isolating infected people and tracing contacts. Passive epidemiological investigations that confirm contact with an infected person through contact have limitations in terms of accuracy and speed, so automatic tracking methods using various digital technologies are being proposed. This paper verify contact by utilizing Bluetooth Low Energy (BLE) technology and present an algorithm that identifies close contact through analysis and correction of RSSI (Received Signal Strength Indicator) values. Also, propose a system that can prevent the spread of viruses in a centralized server structure.

Peer to Peer Search Algorithm based on Advanced Multidirectional Processing (개선된 다방향 프로세싱 기반 P2P 검색 알고리즘)

  • Kim, Boon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.133-139
    • /
    • 2009
  • A P2P technology in distributed computing fields is presented various methods to share resources between network connected peers. This is very efficient that a degree of resources to good use as compared with peers by using centralized network by a few servers. However peers to compose P2P system is not always online status, therefore it is difficult to support high reliability to user. In our previous work of this paper, it is contributing to reduce the loading rates to select of new resource support peer but a selection method the peers to share works to download resources is very simple that it is just selected about peer to have lowest job. In this paper, we reduced frequency offline peers by estimate based on a average value of success rates for peers.

The fashion consumer purchase patterns and influencing factors through big data - Based on sequential pattern analysis -

  • Ki Yong Kwon
    • The Research Journal of the Costume Culture
    • /
    • v.31 no.5
    • /
    • pp.607-626
    • /
    • 2023
  • This study analyzes consumer fashion purchase patterns from a big data perspective. Transaction data from 1 million transactions at two Korean fashion brands were collected. To analyze the data, R, Python, the SPADE algorithm, and network analysis were used. Various consumer purchase patterns, including overall purchase patterns, seasonal purchase patterns, and age-specific purchase patterns, were analyzed. Overall pattern analysis found that a continuous purchase pattern was formed around the brands' popular items such as t-shirts and blouses. Network analysis also showed that t-shirts and blouses were highly centralized items. This suggests that there are items that make consumers loyal to a brand rather than the cachet of the brand name itself. These results help us better understand the process of brand equity construction. Additionally, buying patterns varied by season, and more items were purchased in a single shopping trip during the spring season compared to other seasons. Consumer age also affected purchase patterns; findings showed an increase in purchasing the same item repeatedly as age increased. This likely reflects the difference in purchasing power according to age, and it suggests that the decision-making process for pur- chasing products simplifies as age increases. These findings offer insight for fashion companies' establishment of item-specific marketing strategies.

What Do The Algorithms of The Online Video Platform Recommend: Focusing on Youtube K-pop Music Video (온라인 동영상 플랫폼의 알고리듬은 어떤 연관 비디오를 추천하는가: 유튜브의 K POP 뮤직비디오를 중심으로)

  • Lee, Yeong-Ju;Lee, Chang-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.4
    • /
    • pp.1-13
    • /
    • 2020
  • In order to understand the recommendation algorithm applied to the online video platform, this study examines the relationship between the content characteristics of K-pop music videos and related videos recommended for playback on YouTube, and analyses which videos are recommended as related videos through network analysis. As a result, the more liked videos, the higher recommendation ranking and most of the videos belonging to the same channel or produced by the same agency were recommended as related videos. As a result of the network analysis of the related video, the network of K-pop music video is strongly formed, and the BTS music video is highly centralized in the network analysis of the related video. These results suggest that the network between K-pops is strong, so when you enter K-pop as a search query and watch videos, you can enjoy K-pop continuously. But when watching other genres of video, K-pop may not be recommended as a related video.

Multicast Group Partitioning Algorithm using Status or Receivers in Content Delivery WDM Network (콘텐츠 전달 WDM망에서 수신기의 상태를 고려한 멀티캐스트 그룹화 알고리즘)

  • Kyohong Jin;Jindeog Kim
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1256-1265
    • /
    • 2003
  • Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.

  • PDF

Update Propagation of Replicated Data in a Peer-to-Peer Environment (Peer-to-Peer 환경에서 중복된 데이터의 갱신 전파 기법)

  • Choi Min-Young;Cho Haeng-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.311-322
    • /
    • 2006
  • Peer-to-peer (P2P) systems have become a popular medium through which to share huge amounts of data. On the basis of network topology, P2P systems are divided into three types: centralized, structured distribution, unstructured distribution. Unstructured P2P systems such as Gnutella are novel in the sense that they are extensible and reliable. However, as the number of nodes increases, unstructured P2P systems would suffer from the high complexity of search operations that have to scan the network to find the required data items. Efficient replication of data items can reduce the complexity, but it introduces another problem of maintaining consistency among replicated data items when each data item could be updated. In this paper, we propose a new update propagation algorithm that propagates an updated data item to all of its replica. The proposed algorithm can reduce the message transfer overhead by adopting the notion of timestamp and hybrid push/pull messaging.

A Cooperative Spectrum Sensing and Dynamic Spectrum Decision Methods for Heterogeneous Cognitive Radio Network (이종 인지 라디오 네트워크에서 협력 스펙트럼 센싱 및 동적 스펙트럼 결정 방법)

  • Kim, Nam-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7A
    • /
    • pp.560-568
    • /
    • 2012
  • Spectrum sensing and spectrum decision are the main functions that cognitive radios (CRs) have to perform in order to get the best available spectrum band for the establishment of a wireless communication. These problems are worsened in the presence of users with different demands and spectrum channels with different properties in a heterogeneous network. The primary objective in this work is to design and simulate a new spectrum decision algorithm for heterogeneous cognitive radio system. To this end, first, we consider all cognitive users are separated into different traffic classes according to their Quality of Service (QoS). The cognitive users within one traffic class perform spectrum sensing in centralized group-based cooperative spectrum sensing system and the users of different traffic classes share the sensing results. Second, we propose a novel use of the Analytic Hierarchy Process (AHP) to optimally select available bands according to user requirements and detected spectrum channel characteristics (SCC). In this paper, utility function is used as spectrum decision algorithm. Simulation results demonstrate that the proposed method shows can effectively select the best available spectrum channels with a low complexity.