• Title/Summary/Keyword: Weighted Network

Search Result 517, Processing Time 0.031 seconds

Radionuclide identification based on energy-weighted algorithm and machine learning applied to a multi-array plastic scintillator

  • Hyun Cheol Lee ;Bon Tack Koo ;Ju Young Jeon ;Bo-Wi Cheon ;Do Hyeon Yoo ;Heejun Chung;Chul Hee Min
    • Nuclear Engineering and Technology
    • /
    • v.55 no.10
    • /
    • pp.3907-3912
    • /
    • 2023
  • Radiation portal monitors (RPMs) installed at airports and harbors to prevent illicit trafficking of radioactive materials generally use large plastic scintillators. However, their energy resolution is poor and radionuclide identification is nearly unfeasible. In this study, to improve isotope identification, a RPM system based on a multi-array plastic scintillator and convolutional neural network (CNN) was evaluated by measuring the spectra of radioactive sources. A multi-array plastic scintillator comprising an assembly of 14 hexagonal scintillators was fabricated within an area of 50 × 100 cm2. The energy spectra of 137Cs, 60Co, 226Ra, and 4K (KCl) were measured at speeds of 10-30 km/h, respectively, and an energy-weighted algorithm was applied. For the CNN, 700 and 300 spectral images were used as training and testing images, respectively. Compared to the conventional plastic scintillator, the multi-arrayed detector showed a high collection probability of the optical photons generated inside. A Compton maximum peak was observed for four moving radiation sources, and the CNN-based classification results showed that at least 70% was discriminated. Under the speed condition, the spectral fluctuations were higher than those under dwelling condition. However, the machine learning results demonstrated that a considerably high level of nuclide discrimination was possible under source movement conditions.

Efficient Security Mechanism using Light-weight Data Origin Authentication in Sensor Networks (경량화 데이터 origin 인증을 통한 효율적인 센서 네트워크 보안에 관한 연구)

  • Park, Min-Ho;Lee, Chung-Keun;Son, Ju-Hyung;Seo, Seung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.7A
    • /
    • pp.717-723
    • /
    • 2007
  • There are many weaknesses in sensor networks due to hardware limitation of sensor nodes besides the vulnerabilities of a wireless channel. In order to provide sensor networks with security, we should find out the approaches different from ones in existing wireless networks; the security mechanism in sensor network should be light-weighted and not degrade network performance. Sowe proposed a novel data origin authentication satisfying both of being light-weighted and maintaining network performance by using Unique Random Sequence Code. This scheme uses a challenge-response authentication consisting of a query code and a response code. In this paper, we show how to make a Unique Random Sequence Code and how to use it for data origin authentication.

Multiobjective Space Search Optimization and Information Granulation in the Design of Fuzzy Radial Basis Function Neural Networks

  • Huang, Wei;Oh, Sung-Kwun;Zhang, Honghao
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.4
    • /
    • pp.636-645
    • /
    • 2012
  • This study introduces an information granular-based fuzzy radial basis function neural networks (FRBFNN) based on multiobjective optimization and weighted least square (WLS). An improved multiobjective space search algorithm (IMSSA) is proposed to optimize the FRBFNN. In the design of FRBFNN, the premise part of the rules is constructed with the aid of Fuzzy C-Means (FCM) clustering while the consequent part of the fuzzy rules is developed by using four types of polynomials, namely constant, linear, quadratic, and modified quadratic. Information granulation realized with C-Means clustering helps determine the initial values of the apex parameters of the membership function of the fuzzy neural network. To enhance the flexibility of neural network, we use the WLS learning to estimate the coefficients of the polynomials. In comparison with ordinary least square commonly used in the design of fuzzy radial basis function neural networks, WLS could come with a different type of the local model in each rule when dealing with the FRBFNN. Since the performance of the FRBFNN model is directly affected by some parameters such as e.g., the fuzzification coefficient used in the FCM, the number of rules and the orders of the polynomials present in the consequent parts of the rules, we carry out both structural as well as parametric optimization of the network. The proposed IMSSA that aims at the simultaneous minimization of complexity and the maximization of accuracy is exploited here to optimize the parameters of the model. Experimental results illustrate that the proposed neural network leads to better performance in comparison with some existing neurofuzzy models encountered in the literature.

Design and Evaluation of a Weighted Intrusion Detection Method for VANETs (VANETs을 위한 가중치 기반 침입탐지 방법의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.181-188
    • /
    • 2011
  • With the rapid proliferation of wireless networks and mobile computing applications, the landscape of the network security has greatly changed recently. Especially, Vehicular Ad Hoc Networks maintaining network topology with vehicle nodes of high mobility are self-organizing Peer-to-Peer networks that typically have short-lasting and unstable communication links. VANETs are formed with neither fixed infrastructure, centralized administration, nor dedicated routing equipment, and vehicle nodes are moving, joining and leaving the network with very high speed over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connection without centralized control. In this paper, we propose a weighted intrusion detection method using rough set that can identify malicious behavior of vehicle node's activity and detect intrusions efficiently in VANETs. The performance of the proposed scheme is evaluated by a simulation study in terms of intrusion detection rate and false alarm rate for the threshold of deviation number ${\epsilon}$.

Efficient Security Mechanism using Light-weight Data Origin Authentication in Sensor Networks (경량화 데이터 Origin 인증을 통한 효율적인 센서 네트워크 보안에 관한 연구)

  • Park, Min-Ho;Lee, Chung-Keun;Son, Ju-Hyung;Seo, Seung-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5A
    • /
    • pp.402-408
    • /
    • 2007
  • There are many weaknesses in sensor networks due to hardware limitation of sensor nodes besides the vulnerabilities of a wireless channel. In order to provide sensor networks with security, we should find out the approaches different from ones in existing wireless networks; the security mechanism in sensor network should be light-weighted and not degrade network performance. Sowe proposed a novel data origin authentication satisfying both of being light-weighted and maintaining network performance by using Unique Random Sequence Code. This scheme uses a challenge-response authentication consisting of a query code and a response code. In this paper, we show how to make a Unique Random Sequence Code and how to use it for data origin authentication.

An Estimated Closeness Centrality Ranking Algorithm and Its Performance Analysis in Large-Scale Workflow-supported Social Networks

  • Kim, Jawon;Ahn, Hyun;Park, Minjae;Kim, Sangguen;Kim, Kwanghoon Pio
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1454-1466
    • /
    • 2016
  • This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.

A Study on Rate-Based Congestion Control Using EWMA for Multicast Services in IP Based Networks (IP 기반 통신망의 멀티캐스팅 서비스를 위한 지수이동 가중평판을 이용한 전송률기반 폭주제어에 관한 연구)

  • Choi, Jae-Ha;Lee, Seng-Hyup;Chu, Hyung-Suk;An, Chong-Koo;Shin, Soung-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.8 no.1
    • /
    • pp.39-43
    • /
    • 2007
  • In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

  • PDF

Feature selection and Classification of Heart attack Using NEWFM of Neural Network (뉴럴네트워크(NEWFM)를 이용한 심근경색의 특징추출과 분류)

  • Yoon, Heejin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.151-155
    • /
    • 2019
  • Recently heart attack is 80% of the sudden death of elderly. The causes of a heart attack are complex and sudden, and it is difficult to predict the onset even if prevention or medical examination is performed. Therefore, early diagnosis and proper treatment are the most important. In this paper, we show the accuracy of normal and abnormal classification with neural network using weighted fuzzy function for accurate and rapid diagnosis of myocardial infarction. The data used in the experiment was data from the UCI Machine Learning Repository, which consists of 14 features and 303 sample data. The algorithm for feature selection uses the average of weight method. Two features were selected and removed. Heart attack was classified into normal and abnormal(1-normal, 2-abnormal) using the average of weight method. The test result for the diagnosis of heart attack using a weighted fuzzy neural network showed 87.66% accuracy.

Informetric Analysis of Regional Studies: Focused on Incheon Area (지역 연구에 대한 계량정보적 분석 - 인천 지역을 중심으로 -)

  • Cho, Jane
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.55 no.1
    • /
    • pp.323-341
    • /
    • 2021
  • Various research are being published in the areas of humanities, history, aviation/ports, and regional development, centering on the Incheon area which has issues such as large-scale ports and airports, archipelago, and urban regeneration. This study explored the scope of the subject and the distribution of researchers using a informetric analysis focusing on the studies of Incheon. Specifically, this study extracted authors from about 500 Incheon-related research papers listed in the Korean journal's citation index and analyzed the co-author relationship network to understand the cooperative behavior between authors' institutions. In addition, by extracting keywords from the articles and performing a weighted network (PFNET) analysis on the relationship between keywords, the intellectual structure was analyzed. As a result, it was found that Inha University and Incheon National University showed a high TBC, and Incheon Development Institute showed the high NNC. Meanwhile, the intellectual structure of Incheon-related research was found to be composed of 11 thematic clusters, and the social issues of Incheon, ports, and aviation were analyzed as representative clusters.

Development of daily solar flare peak flux forecast models for strong flares

  • Shin, Seulki;Lee, Jin-Yi;Chu, Hyoung-Seok;Moon, Yong-Jae;Park, JongYeob
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.40 no.1
    • /
    • pp.64.3-64.3
    • /
    • 2015
  • We have developed a set of daily solar flare peak flux forecast models for strong flares using multiple linear regression and artificial neural network methods. We consider input parameters as solar activity data from January 1996 to December 2013 such as sunspot area, X-ray flare peak flux and weighted total flux of previous day, and mean flare rates of McIntosh sunspot group (Zpc) and Mount Wilson magnetic classification. For a training data set, we use the same number of 61 events for each C-, M-, and X-class from Jan. 1996 to Dec. 2004, while other previous models use all flares. For a testing data set, we use all flares from Jan. 2005 to Nov. 2013. The best three parameters related to the observed flare peak flux are weighted total flare flux of previous day (r = 0.51), X-ray flare peak flux (r = 0.48), and Mount Wilson magnetic classification (r = 0.47). A comparison between our neural network models and the previous models based on Heidke Skill Score (HSS) shows that our model for X-class flare is much better than the models and that for M-class flares is similar to them. Since all input parameters for our models are easily available, the models can be operated steadily and automatically in near-real time for space weather service.

  • PDF