• 제목/요약/키워드: graph convergence

검색결과 190건 처리시간 0.025초

The Comparison of the 3D graph for the energy-equal of LEACH-Mobile

  • Jang, Seong Pil;Jung, Kye-Dong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • 제6권1호
    • /
    • pp.57-67
    • /
    • 2017
  • In this paper, propose an algorithm to improve network lifetime by equally consuming energy of LEACH - Mobile sensor nodes. LEACH is one of energy efficient protocols. However, we did not consider the mobility of nodes. Therefore, the transmission reception success rate of the moving data is reduced. LEACH-Mobile is a protocol that has improved the drawbacks of these LEACH. However, since LEACH-Mobile has a larger number of data packets and consumes more energy than LEACH, it has a disadvantage that the lifetime of the network is short. In order to improvement these disadvantage, Based on the average of the remaining energy of the node, cluster heads are elected with a number of nodes whose energies are larger than the average of the remaining energy from the member nodes. After that, by trying to increase the lifetime of the network by equalizing the remaining energy. In to confirm whether improve the lifetime of the network, In this paper, the number of nodes and the position of all nodes are varied for each specific round, the rest energy is equalized, and the algorithm which uniformly selected the cluster head is compared with LEACH.

Physiological Functionalities and Anti-oxidant activity of heated radish extract

  • Kim, Hyun-Kyoung
    • International journal of advanced smart convergence
    • /
    • 제7권2호
    • /
    • pp.38-46
    • /
    • 2018
  • This study proceeded an experiment that can increase such physiological properties of heated radish extract. During the extraction of radish, including the byproduct, an increase in antioxidant properties of radish according the heating temperature was performed. Upon the extracts of radish bark and radish green extract(mucheong), the physiological functionalities and antioxidant activity were investigated. As a result, the color of radish ethanol extract in dependence of heating temperature, showed light brown color at low heating temperature and black color from $150^{\circ}C$. The total polyphenol content significantly increased as a result of heat treatment; 6.7 times and 22 times higher than the control at $110^{\circ}C$ and $150^{\circ}C$, respectively. DPPH radical scavenging ability and antioxidant property increased with increasing heating temperature; in comparison to heat-treated radish at $110^{\circ}C$ and $150^{\circ}C$, $IC_{50}$ decreased by 1/22 times. $IC_{50}$ of the control was 23times higher than $150^{\circ}C$ heat treated radish (Control $IC_{50}$:130.305). According to the graph that represents ABTS activity, antioxidant activity increased in dependence of heat treatment likewise to the total polyphenol content and DDPH radical scavenging activity. Upon heat treatment at $150^{\circ}C$, antioxidant activity in consequence of ABTS assay increased 23 times higher than the control.

특허 분석을 활용한 ITS 녹색 기술 예측 (Forecasting of Green Technologies on Intelligent Transportation System using Patent Analysis)

  • 이주현;이철웅
    • 한국컴퓨터정보학회논문지
    • /
    • 제19권2호
    • /
    • pp.233-241
    • /
    • 2014
  • 본 논문에서는 "Co-word" 특허분석방법과 "기술로드맵(technique road-map)" 그리고 특허활성화 라이프 사이클그래프 및 추세분석을 활용하여 ITS(Intelligent Transportation System)의 미래녹색기술에 대해 예측한다. 분석 결과 미래의 ITS 녹색 기술 분야의 발달로 탄소배출 절감 효과가 발생하기 때문에 환경 보호에 도움을 줄 것으로 예측 되었으며, 미래의 ITS 녹색 기술은 fuel saving 분야에 대한 성장이 클 것으로 예상되었다. 또한 fuel saving 분야는 미래의 IT 기술과의 융합으로 인해 더욱 실용적인 기술 분야로 발전할 수 있을 것으로 예측 되었다.

Maximum Node Interconnection by a Given Sum of Euclidean Edge Lengths

  • Kim, Joonmo;Oh, Jaewon;Kim, Minkwon;Kim, Yeonsoo;Lee, Jeongeun;Han, Sohee;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • 제17권4호
    • /
    • pp.246-254
    • /
    • 2019
  • This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments

  • Chao, Nan;Liu, Yong-kuo;Xia, Hong;Peng, Min-jun;Ayodeji, Abiodun
    • Nuclear Engineering and Technology
    • /
    • 제51권3호
    • /
    • pp.825-836
    • /
    • 2019
  • One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

금속 필러가 첨가된 Pb-B-O계 유리와 Ni-Cr 합금 와이어 간의 전기 화학적 반응과 단락 거동 (Electrochemical Reaction and Short-Circuit Behavior between Lead Borate Glass Doped with Metal Filler and Ni-Cr Alloy Wire)

  • 최진삼;다타치카 나까야마
    • 한국재료학회지
    • /
    • 제31권8호
    • /
    • pp.471-479
    • /
    • 2021
  • The electrochemical reaction between lead borate glass frit doped with Sn metal filler and Ni-Cr wire of a J-type resistor during a term of Joule heating is investigated. The fusing behavior in which the Ni-Cr wire is melted is not observed for the control group but measured for the Sn-doped specimen under 30 V and 500 mA. The Sn-doped lead borate glass frit shows a fusing property compared with other metal-doped specimens. Meanwhile, the redox reaction significantly contributes to the fusing behavior due to the release of free electrons of the metal toward the glass. The electrons derived from the glass, which used Joule heat to reach the melting point of Ni-Cr wire, increase with increasing corrosion rate at interface of metal/glass. Finally, the confidence interval is 95 ± 1.959 %, and the adjusted regression coefficient, R in the optimal linear graph, is 0.93, reflecting 93% of the data and providing great potential for fusible resistor applications.

Maximum Terminal Interconnection by a Given Length using Rectilinear Edge

  • Kim, Minkwon;Kim, Yeonsoo;Kim, Hanna;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • 제19권2호
    • /
    • pp.114-119
    • /
    • 2021
  • This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R2. Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout.

Analysis of Weights and Feature Patterns in Popular 2D Deep Neural Networks Models for MRI Image Classification

  • Khagi, Bijen;Kwon, Goo-Rak
    • Journal of Multimedia Information System
    • /
    • 제9권3호
    • /
    • pp.177-182
    • /
    • 2022
  • A deep neural network (DNN) includes variables whose values keep on changing with the training process until it reaches the final point of convergence. These variables are the co-efficient of a polynomial expression to relate to the feature extraction process. In general, DNNs work in multiple 'dimensions' depending upon the number of channels and batches accounted for training. However, after the execution of feature extraction and before entering the SoftMax or other classifier, there is a conversion of features from multiple N-dimensions to a single vector form, where 'N' represents the number of activation channels. This usually happens in a Fully connected layer (FCL) or a dense layer. This reduced 2D feature is the subject of study for our analysis. For this, we have used the FCL, so the trained weights of this FCL will be used for the weight-class correlation analysis. The popular DNN models selected for our study are ResNet-101, VGG-19, and GoogleNet. These models' weights are directly used for fine-tuning (with all trained weights initially transferred) and scratch trained (with no weights transferred). Then the comparison is done by plotting the graph of feature distribution and the final FCL weights.

Maximum Node Interconnection by a Given Sum of Euclidean Edge Lengths in a Cluster Node Distribution

  • Kim, Yeonsoo;Kim, Minkwon;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • 제20권2호
    • /
    • pp.90-95
    • /
    • 2022
  • This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

추천 분야에서의 지식 그래프 기반 어텐션 네트워크 모델 성능 향상 기법 연구 (A Study on Augmentation Method for Improving the Performance of the Knowledge Graph Based Attention Network Model)

  • 김경태;민찬욱;김진우;안진현;전희국;임동혁
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2022년도 추계학술발표대회
    • /
    • pp.603-605
    • /
    • 2022
  • 추천시스템은 개개인의 성향에 따른 맞춤화 추천이 가능하기 때문에 음악, 영상, 뉴스 등 많은 분야에서 관심을 받고 있다. 일반적인 추천시스템 모델은 블랙박스 모델이기 때문에 추천 결과에 따른 원인 도출을 할 수 없다. 하지만 XAI 의 모델은 이러한 블랙박스 모델의 단점을 해결하고자 제안되었다. 그 중 KGAT 는 Attention Score 를 기반으로 추천 결과에 따른 원인을 알 수 있다. 이와 같은 AI, XAI 등의 딥 러닝 모델에서 각각의 활성화 함수는 상황에 따라 상이한 성능을 나타낸다. 이러한 이유로 인해 데이터에 맞는 활성화 함수를 적용해보는 다양한 시도가 필요하다. 따라서 본 논문은 XAI 추천시스템 모델인 KGAT 의 성능 개선을 위해 여러 활성화 함수를 적용해보고, 실험을 통해 수정한 모델의 성능이 개선됨을 보인다.