• International Journal of Computer Science & Network Security
• /
• v.24 no.6
• /
• pp.67-76
• /
• 2024

The Internet of Things (IoT) has revolutionized communication and device operation, but it has also brought significant security challenges. IoT networks are structured into four levels: devices, networks, applications, and services, each with specific security considerations. Personal Area Networks (PANs), Local Area Networks (LANs), and Wide Area Networks (WANs) are the three types of IoT networks, each with unique security requirements. Communication protocols such as Wi-Fi and Bluetooth, commonly used in IoT networks, are susceptible to vulnerabilities and require additional security measures. Apart from physical security, authentication, encryption, software vulnerabilities, DoS attacks, data privacy, and supply chain security pose significant challenges. Ensuring the security of IoT devices and the data they exchange is crucial. This paper utilizes the Random Forest Algorithm from machine learning to detect anomalous data in IoT devices. The dataset consists of environmental data (temperature and humidity) collected from IoT sensors in Oman. The Random Forest Algorithm is implemented and trained using Python, and the accuracy and results of the model are discussed, demonstrating the effectiveness of Random Forest for detecting IoT device data anomalies.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.180-191
• /
• 2008

An Adaptive Random Testing (ART) is one of test case generation algorithms that are designed to detect common failure patterns within input domain. The ART algorithm shows better performance than that of pure Random Testing (RT). Distance-bases ART (D-ART) and Restriction Random Testing (RRT) are well known examples of ART algorithms which are reported to have good performances. But significant drawbacks are observed as quadratic runtime and non-uniform distribution of test case. They are mainly caused by a huge amount of distance computations to generate test case which are distance based method. ART through Iterative Partitioning (IP-ART) significantly reduces the amount of computation of D-ART and RRT with iterative partitioning of input domain. However, non-uniform distribution of test case still exists, which play a role of obstacle to develop a scalable algerian. In this paper we propose a new ART method which mitigates the drawback of IP-ART while achieving improved fault-detection capability. Simulation results show that the proposed one has about 9 percent of improved F-measures with respect to other algorithms.

• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.131-142
• /
• 2016

We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.725-741
• /
• 1997

This paper considers the problem of deriving exponential probability inequalities for product symmetric Poisson processes. As an application they are used to show the existence of regular version of some product process derived from L$\acute{e}$vy process.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.111-114
• /
• 2008

The existence of noise bands may deform the typical shape of the spectrum, making the accuracy of clustering degraded. This paper proposes a statistical approach to remove noise bands in hyperspectral data using the correlation coefficient of bands as an indicator. Considering each band as a random variable, two adjacent signal bands in hyperspectral data are highly correlative. On the contrary, existence of a noise band will produce a low correlation. For clustering, the unsupervised ${\kappa}$-nearest neighbor clustering method is implemented in accordance with three well-accepted spectral matching measures, namely ED, SAM and SID. Furthermore, this paper proposes a hierarchical scheme of combining those measures. Finally, a separability assessment based on the between-class and the within-class scatter matrices is followed to evaluate the applicability of the proposed noise band removal method. Also, the paper brings out a comparison for spectral matching measures.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.195-200
• /
• 2008

The accuracy of classifying pixels in HIRIS images is usually degraded by noisy bands since noisy bands may deform the typical shape of spectral reflectance. Proposed in this paper is a statistical method for noisy band removal which mainly makes use of the correlation coefficients between bands. Considering each band as a random variable, the correlation coefficient measures the strength and direction of a linear relationship between two random variables. While the correlation between two signal bands is high, existence of a noisy band will produce a low correlation due to ill-correlativeness and undirectedness. The application of the correlation coefficient as a measure for detecting noisy bands is under a two-pass screening scheme. This method is independent of the prior knowledge of the sensor or the cause resulted in the noise. The classification in this experiment uses the unsupervised k-nearest neighbor algorithm in accordance with the well-accepted Euclidean distance measure and the spectral angle mapper measure. This paper also proposes a hierarchical combination of these measures for spectral matching. Finally, a separability assessment based on the between-class and within-class scatter matrices is followed to evaluate the performance.

• Asia-Pacific Journal of Business
• /
• v.13 no.2
• /
• pp.107-122
• /
• 2022

Purpose - This study aims to develop machine learning models to predict administrative issue designation in KOSDAQ Market using financial data. Design/methodology/approach - Employing four classification techniques including logistic regression, support vector machine, random forest, and gradient boosting to a matched sample of five hundred and thirty-six firms over an eight-year period, the authors develop prediction models and explore the practicality of the models. Findings - The resulting four binary selection models reveal overall satisfactory classification performance in terms of various measures including AUC (area under the receiver operating characteristic curve), accuracy, F1-score, and top quartile lift, while the ensemble models (random forest and gradienct boosting) outperform the others in terms of most measures. Research implications or Originality - Although the assessment of administrative issue potential of firms is critical information to investors and financial institutions, detailed empirical investigation has lagged behind. The current research fills this gap in the literature by proposing parsimonious prediction models based on a few financial variables and validating the applicability of the models.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.2
• /
• pp.135-144
• /
• 2003

Traffic performance in a microcellular system is much more affected by cell dwell time and channel holding time in each cell. Cell dwell time of a call is characterized by its mobility pattern, i.e., stochastic changes of moving speed and direction. Cell dwell time provides important information for other analyses on traffic performance such as channel holding time, handover rate, and the average number of handovers per call. In the next generation mobile communication system, the cell size is expected to be much smaller than that of current one to accommodate the increase of user demand and to achieve high bandwidth utilization. As the cell size gets small, traffic performance is much more affected by variable mobility of users, especially by that of pedestrians. In previous work, analytical models are based on simple probability models. They provide sufficient accuracy in a simple second-generation cellular system. However, the role of them is becoming invalid in a picocellular environment where there are rapid change of network traffic conditions and highly random mobility of pedestrians. Unlike in previous work, we propose an improved probability model evolved from so-called Random walk model in order to mathematically formulate variable mobility of pedestrians and analyze the traffic performance. With our model, we can figure out variable characteristics of pedestrian mobility with stochastic correlation. The above-mentioned traffic performance measures are analyzed using our model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.53-64
• /
• 2021

Depression is one of the most important psychiatric disorders worldwide. Most depression-related data mining and machine learning studies have been conducted to predict the presence of depression or to derive individual risk factors. However, since depression is caused by a combination of various factors, it is necessary to identify the complex relationship between the factors in order to establish effective anti-depression and management measures. In this study, we propose a methodology for identifying and interpreting patterns of depression expressions using the method of deriving random forest rules, where the random forest rule consists of the condition for the manifestation of the depressive pattern and the prediction result of depression when the condition is met. The analysis was carried out by subdividing into 4 groups in consideration of the different depressive patterns according to gender and age. Depression rules derived by the proposed methodology were validated by comparing them with the results of previous studies. Also, through the AUC comparison test, the depression diagnosis performance of the derived rules was evaluated, and it was not different from the performance of the existing PHQ-9 summing method. The significance of this study can be found in that it enabled the interpretation of the complex relationship between depressive factors beyond the existing studies that focused on prediction and deduction of major factors.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.5
• /
• pp.430-437
• /
• 2016

In general, noise measurement results show larger random ripple than those of the network analyzer. The reason for the lager random ripple of the noise measurements is considered that the general noise measurements uses absolute measured noise powers, while the network analyzer measures using a ratio of the measured powers. In this paper, a novel measurement method of noise correlation matrix using relative noise ratios is proposed. Proposed method measures the five noise powers of DUT for the five input impedance variations and the four relative noise ratios are formed using the five measured noise powers. The four noise ratios are used to compute the noise correlation matrix and noise parameters. The resulting noise parameters for a 0.5 dB attenuator show good agreements with theoretical values calculated by S-parameters. Also, the noise parameters of an active DUT with a noise figure of less than 1 dB are measured and the measured results show a small random ripple as expected and their values are physically acceptable. In conclusion, the proposed method can be applied to the noise parameter measurements for DUT with a noise figure below 1 dB.