• Title/Summary/Keyword: Rank Algorithm

Search Result 282, Processing Time 0.024 seconds

An Analysis of Detection of Malicious Packet Dropping and Detour Scheme in IoT based on IPv6 (IPv6 기반의 사물인터넷 환경에서 악성 노드의 패킷 유실 공격 탐지 및 우회 기법 분석)

  • Choi, Jaewoo;Kwon, Taekyoung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.3
    • /
    • pp.655-659
    • /
    • 2016
  • In this paper, we propose new detection and detour methods against packet drop attacks for availability in the Internet of Things (IoT) based on the IEEE 802.15.4e and RPL protocol standards that employ IPv6. We consider the rank value of RPL and the consecutive packet drops to improve the detection metrics, and also take into account the use of both sibling and child nodes on a RPL routing path to construct the detour method. Our simulation results show that the proposed detection method is faster than the previous result, and the detour method improves the detour success rate.

Recommendation of Personalized Surveillance Interval of Colonoscopy via Survival Analysis (생존분석을 이용한 맞춤형 대장내시경 검진주기 추천)

  • Gu, Jayeon;Kim, Eun Sun;Kim, Seoung Bum
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.2
    • /
    • pp.129-137
    • /
    • 2016
  • A colonoscopy is important because it detects the presence of polyps in the colon that can lead to colon cancer. How often one needs to repeat a colonoscopy may depend on various factors. The main purpose of this study is to determine personalized surveillance interval of colonoscopy based on characteristics of patients including their clinical information. The clustering analysis using a partitioning around medoids algorithm was conducted on 625 patients who had a medical examination at Korea University Anam Hospital and found several subgroups of patients. For each cluster, we then performed survival analysis that provides the probability of having polyps according to the number of days until next visit. The results of survival analysis indicated that different survival distributions exist among different patients' groups. We believe that the procedure proposed in this study can provide the patients with personalized medical information about how often they need to repeat a colonoscopy.

The Image and Visual Preference for Urban Setting : Focused on Outdoor Spaces of Urban Office Buildings (도시환경의 이미지 및 시각적 선호도에 관한 연구 -도시 업무용 건물의 외부공간을 중심으로-)

  • 이선화;김유일;서주환
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.26 no.3
    • /
    • pp.134-142
    • /
    • 1998
  • THe purpose of this study is to suggest the major determinants of visual preference in the outdoor spaces of urban office buildings. For this, the spatial image was analyzed by the factor analysis algorithm. The level of visual preferences was measured by a slide simulation test, and these data were analyzed by the multiple regressioni. The result of this study can be summarized as follows; Factors covering the spatial image were found to be 'mystery','changeability','coherence' and 'legibility'. T.V. was obtained as 58.4%. Outdoor spaces of urban office buildings were classified into four groups by the multi dimensional scaling method. As for the analysis of imageability in each spatial type, the factor scores of measuring high values were different for all types. Type II, IV obtained higher rank of visual preference and type III, I obtained lower. For all types, the factors of visual preference were found to be 'mystery','changeability','coherence' and 'legibility'. The visual preference determinants of urban setting focused on outdoor spaces of urban office buildings may be the major factors which must be considered in planning and designing as the functional basis for the quantitative analysis.

  • PDF

Efficient Kernel Based 3-D Source Localization via Tensor Completion

  • Lu, Shan;Zhang, Jun;Ma, Xianmin;Kan, Changju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.1
    • /
    • pp.206-221
    • /
    • 2019
  • Source localization in three-dimensional (3-D) wireless sensor networks (WSNs) is becoming a major research focus. Due to the complicated air-ground environments in 3-D positioning, many of the traditional localization methods, such as received signal strength (RSS) may have relatively poor accuracy performance. Benefit from prior learning mechanisms, fingerprinting-based localization methods are less sensitive to complex conditions and can provide relatively accurate localization performance. However, fingerprinting-based methods require training data at each grid point for constructing the fingerprint database, the overhead of which is very high, particularly for 3-D localization. Also, some of measured data may be unavailable due to the interference of a complicated environment. In this paper, we propose an efficient kernel based 3-D localization algorithm via tensor completion. We first exploit the spatial correlation of the RSS data and demonstrate the low rank property of the RSS data matrix. Based on this, a new training scheme is proposed that uses tensor completion to recover the missing data of the fingerprint database. Finally, we propose a kernel based learning technique in the matching phase to improve the sensitivity and accuracy in the final source position estimation. Simulation results show that our new method can effectively eliminate the impairment caused by incomplete sensing data to improve the localization performance.

Localization and size estimation for breaks in nuclear power plants

  • Lin, Ting-Han;Chen, Ching;Wu, Shun-Chi;Wang, Te-Chuan;Ferng, Yuh-Ming
    • Nuclear Engineering and Technology
    • /
    • v.54 no.1
    • /
    • pp.193-206
    • /
    • 2022
  • Several algorithms for nuclear power plant (NPP) break event detection, isolation, localization, and size estimation are proposed. A break event can be promptly detected and isolated after its occurrence by simultaneously monitoring changes in the sensing readings and by employing an interquartile range-based isolation scheme. By considering the multi-sensor data block of a break to be rank-one, it can be located as the position whose lead field vector is most orthogonal to the noise subspace of that data block using the Multiple Signal Classification (MUSIC) algorithm. Owing to the flexibility of deep neural networks in selecting the best regression model for the available data, we can estimate the break size using multiple-sensor recordings of the break regardless of the sensor types. The efficacy of the proposed algorithms was evaluated using the data generated by Maanshan NPP simulator. The experimental results demonstrated that the MUSIC method could distinguish two near breaks. However, if the two breaks were close and of small sizes, the MUSIC method might wrongly locate them. The break sizes estimated by the proposed deep learning model were close to their actual values, but relative errors of more than 8% were seen while estimating small breaks' sizes.

Association Modeling on Keyword and Abstract Data in Korean Port Research

  • Yoon, Hee-Young;Kwak, Il-Youp
    • Journal of Korea Trade
    • /
    • v.24 no.5
    • /
    • pp.71-86
    • /
    • 2020
  • Purpose - This study investigates research trends by searching for English keywords and abstracts in 1,511 Korean journal articles in the Korea Citation Index from the 2002-2019 period using the term "Port." The study aims to lay the foundation for a more balanced development of port research. Design/methodology - Using abstract and keyword data, we perform frequency analysis and word embedding (Word2vec). A t-SNE plot shows the main keywords extracted using the TextRank algorithm. To analyze which words were used in what context in our two nine-year subperiods (2002-2010 and 2010-2019), we use Scattertext and scaled F-scores. Findings - First, during the 18-year study period, port research has developed through the convergence of diverse academic fields, covering 102 subject areas and 219 journals. Second, our frequency analysis of 4,431 keywords in 1,511 papers shows that the words "Port" (60 times), "Port Competitiveness" (33 times), and "Port Authority" (29 times), among others, are attractive to most researchers. Third, a word embedding analysis identifies the words highly correlated with the top eight keywords and visually shows four different subject clusters in a t-SNE plot. Fourth, we use Scattertext to compare words used in the two research sub-periods. Originality/value - This study is the first to apply abstract and keyword analysis and various text mining techniques to Korean journal articles in port research and thus has important implications. Further in-depth studies should collect a greater variety of textual data and analyze and compare port studies from different countries.

Computation of Optimal Path for Pedestrian Reflected on Mode Choice of Public Transportation in Transfer Station (대중교통 수단선택과 연계한 복합환승센터 내 보행자 최적경로 산정)

  • Yoon, Sang-Won;Bae, Sang-Hoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.6 no.2
    • /
    • pp.45-56
    • /
    • 2007
  • As function and scale of the transit center get larger, the efficient guidance system in the transit center is essential for transit users in order to find their efficient routes. Although there are several studies concerning optimal path for the road, but insufficient studies are executed about optimal path inside the building. Thus, this study is to develop the algorithm about optimal path for car owner from the basement parking lot to user's destination in the transfer station. Based on Dijkstra algorithm which calculate horizontal distance, several factors such as fatigue, freshness, preference, and required time in using moving devices are objectively computed through rank-sum and arithmetic-sum method. Moreover, optimal public transportation is provided for transferrer in the transfer station by Neuro-Fuzzy model which is reflected on people's tendency about public transportation mode choice. Lastly, some scenarios demonstrate the efficiency of optimal path algorithm for pedestrian in this study. As a result of verification the case through the model developed in this study is 75 % more effective in the scenario reflected on different vertical distance, and $24.5\;{\sim}\;107.7\;%$ more effective in the scenario considering different horizontal distance, respectively.

  • PDF

Measuring the Goodness of Fit of Link Reduction Algorithms for Mapping Intellectual Structures in Bibliometric Analysis (계량서지적 분석에서 지적구조 매핑을 위한 링크 삭감 알고리즘의 적합도 측정)

  • Lee, Jae Yun
    • Journal of the Korean Society for information Management
    • /
    • v.39 no.2
    • /
    • pp.233-254
    • /
    • 2022
  • Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.

Speech extraction based on AuxIVA with weighted source variance and noise dependence for robust speech recognition (강인 음성 인식을 위한 가중화된 음원 분산 및 잡음 의존성을 활용한 보조함수 독립 벡터 분석 기반 음성 추출)

  • Shin, Ui-Hyeop;Park, Hyung-Min
    • The Journal of the Acoustical Society of Korea
    • /
    • v.41 no.3
    • /
    • pp.326-334
    • /
    • 2022
  • In this paper, we propose speech enhancement algorithm as a pre-processing for robust speech recognition in noisy environments. Auxiliary-function-based Independent Vector Analysis (AuxIVA) is performed with weighted covariance matrix using time-varying variances with scaling factor from target masks representing time-frequency contributions of target speech. The mask estimates can be obtained using Neural Network (NN) pre-trained for speech extraction or diffuseness using Coherence-to-Diffuse power Ratio (CDR) to find the direct sounds component of a target speech. In addition, outputs for omni-directional noise are closely chained by sharing the time-varying variances similarly to independent subspace analysis or IVA. The speech extraction method based on AuxIVA is also performed in Independent Low-Rank Matrix Analysis (ILRMA) framework by extending the Non-negative Matrix Factorization (NMF) for noise outputs to Non-negative Tensor Factorization (NTF) to maintain the inter-channel dependency in noise output channels. Experimental results on the CHiME-4 datasets demonstrate the effectiveness of the presented algorithms.

Industrial Technology Leak Detection System on the Dark Web (다크웹 환경에서 산업기술 유출 탐지 시스템)

  • Young Jae, Kong;Hang Bae, Chang
    • Smart Media Journal
    • /
    • v.11 no.10
    • /
    • pp.46-53
    • /
    • 2022
  • Today, due to the 4th industrial revolution and extensive R&D funding, domestic companies have begun to possess world-class industrial technologies and have grown into important assets. The national government has designated it as a "national core technology" in order to protect companies' critical industrial technologies. Particularly, technology leaks in the shipbuilding, display, and semiconductor industries can result in a significant loss of competitiveness not only at the company level but also at the national level. Every year, there are more insider leaks, ransomware attacks, and attempts to steal industrial technology through industrial spy. The stolen industrial technology is then traded covertly on the dark web. In this paper, we propose a system for detecting industrial technology leaks in the dark web environment. The proposed model first builds a database through dark web crawling using information collected from the OSINT environment. Afterwards, keywords for industrial technology leakage are extracted using the KeyBERT model, and signs of industrial technology leakage in the dark web environment are proposed as quantitative figures. Finally, based on the identified industrial technology leakage sites in the dark web environment, the possibility of secondary leakage is detected through the PageRank algorithm. The proposed method accepted for the collection of 27,317 unique dark web domains and the extraction of 15,028 nuclear energy-related keywords from 100 nuclear power patents. 12 dark web sites identified as a result of detecting secondary leaks based on the highest nuclear leak dark web sites.