• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2568-2584
• /
• 2015

Spectral clustering has become one of the most popular clustering approaches in recent years. Similarity graph constructed on the data is one of the key factors that influence the performance of spectral clustering. However, the similarity graphs constructed by existing methods usually contain some unreliable edges. To construct reliable similarity graph for spectral clustering, an efficient method based on Markov random walk (MRW) is proposed in this paper. In the proposed method, theMRW model is defined on the raw k-NN graph and the neighbors of each sample are determined by the probability of the MRW. Since the high order transition probabilities carry complex relationships among data, the neighbors in the graph determined by our proposed method are more reliable than those of the existing methods. Experiments are performed on the synthetic and real-world datasets for performance evaluation and comparison. The results show that the graph obtained by our proposed method reflects the structure of the data better than those of the state-of-the-art methods and can effectively improve the performance of spectral clustering.

• Phonetics and Speech Sciences
• /
• v.5 no.1
• /
• pp.91-98
• /
• 2013

This paper investigated Korean prosody as it relates to graded internal structure in an identification function. Within Korean prosody, variants regarded as dialectal variations can appear as different prosodic scales, which contain the range of within-category variations. The current experiment was intended to show how the prosodic scale corresponding to the range of within-category differences relates to f0 contours for speakers of two Korean dialects, North Kyungsang and South Cholla. In an identification task, participants responded by selecting an item from two answer choices. The probability of choosing the correct response from the two choices was computed by a logistic regression analysis using intercepts and slopes. That is, the correct response between two choices was used to show a linear line with an s-shape presentation. In this paper, to investigate the graded internal structure of labeling, 25%, 50%, and 75% of predicted probability were assessed. Listeners from North Kyungsang showed progressive variations, whereas listeners from South Cholla revealed random patterns in the internal structure of the identification function. In this paper, the results were plotted using scatterplot graphs, applying the range of within-category variation and predicted probability obtained from the logistic regression analyses. The scatterplot graphs showed the different degree of the responses for f0 scales (i.e., variations within categories). The results demonstrate that the gradient structures of native pitch accent users become more progressive in response to f0 scales.

• International journal of advanced smart convergence
• /
• v.13 no.2
• /
• pp.48-60
• /
• 2024

With the exponential growth of satellite data utilization, machine learning has become pivotal in enhancing innovation and cybersecurity in satellite systems. This paper investigates the role of machine learning techniques in identifying and mitigating vulnerabilities and code smells within satellite software. We explore satellite system architecture and survey applications like vulnerability analysis, source code refactoring, and security flaw detection, emphasizing feature extraction methodologies such as Abstract Syntax Trees (AST) and Control Flow Graphs (CFG). We present practical examples of feature extraction and training models using machine learning techniques like Random Forests, Support Vector Machines, and Gradient Boosting. Additionally, we review open-access satellite datasets and address prevalent code smells through systematic refactoring solutions. By integrating continuous code review and refactoring into satellite software development, this research aims to improve maintainability, scalability, and cybersecurity, providing novel insights for the advancement of satellite software development and security. The value of this paper lies in its focus on addressing the identification of vulnerabilities and resolution of code smells in satellite software. In terms of the authors' contributions, we detail methods for applying machine learning to identify potential vulnerabilities and code smells in satellite software. Furthermore, the study presents techniques for feature extraction and model training, utilizing Abstract Syntax Trees (AST) and Control Flow Graphs (CFG) to extract relevant features for machine learning training. Regarding the results, we discuss the analysis of vulnerabilities, the identification of code smells, maintenance, and security enhancement through practical examples. This underscores the significant improvement in the maintainability and scalability of satellite software through continuous code review and refactoring.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.25 no.4
• /
• pp.244-254
• /
• 2013

In this study, a method has been developed for estimating the change of nearshore random waves in response to sea-level rise, by extending the method proposed for regular waves by Townend in 1994. The relative changes in wavelength, refraction coefficient, shoaling coefficient, and wave height for random waves are presented as functions of relative change in water depth. The changes in wavelength and refraction coefficient are calculated by using the significant wave period and principal wave direction in the regular-wave formulas. On the other hand, the changes in shoaling coefficient and wave height are calculated by using the formulas proposed for shoaling and transformation of random waves in the nearshore area including surf zone. The results are proposed in the form of both formulas and graphs. In particular, the relative change in wave height is compared with the result for regular waves.

• The Mathematical Education
• /
• v.59 no.1
• /
• pp.47-62
• /
• 2020

Understanding the concept of probability distribution becomes more important. We considered probabilities defined in the sample space, the definition of discrete random variables, the probability of defined discrete probability distribution, and the relationship between them as knowledge of discrete probability distribution, and investigated the understanding degree of the mathematics preservice teachers. The results are as follows. Firstly, about 70% of preservice teachers who participated in this study expressed discrete probability distribution graphs in ordered pairs or continuous distribution. Secondly, with regard to the two factors for obtaining discrete probability distributions: probability for each element in the sample space and the concept of random variables that convert each element in the sample space into a real value, only 13% of the preservice teachers understood and addressed both factors. Thirdly, 39% of the preservice teachers correctly responded to whether different probability distributions can be defined for one sample space. Fourthly, when the probability of each fundamental event was determined to obtain the probability distribution of the discrete random variables defined in the undefined sample space, approximately 70% habitually calculated by the uniform probability. Finally, about 20% of preservice teachers understood the meaning and relationship of binomial distribution, discrete random variables, and sample space. In relation, clear definitions and full explanations of concept need to be provided from textbooks and a program to improve the understanding of preservice teachers need to be developed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1643-1660
• /
• 2016

Connectivity and trust in social networks have been exploited to propose applications on top of these networks, including routing, Sybil defenses, and anonymous communication systems. In these networks, and for such applications, connectivity ensures good performance of applications while trust is assumed to always hold, so as collaboration and good behavior are always guaranteed. In this paper, we study the impact of differential behavior of users on performance in typical social network-enabled routing applications. We classify users into either collaborative or rational (probabilistically collaborative) and study the impact of this classification and the associated behavior of users on the performance of such applications, including random walk-based routing, shortest path based routing, breadth-first-search based routing, and Dijkstra routing. By experimenting with real-world social network traces, we make several interesting observations. First, we show that some of the existing social graphs have high routing costs, demonstrating poor structure that prevents their use in such applications. Second, we study the factors that make probabilistically collaborative nodes important for the performance of the routing protocol within the entire network and demonstrate that the importance of these nodes stems from their topological features rather than their percentage of all the nodes within the network.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.1-8
• /
• 2006

This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control structure. A resource should be allocated for the processing of each job, and the required processing time of the job can be varied by the resource allocation decision. Each resource has several inherent restrictions such as the functional, geographical, positional and other operational characteristics. The algorithm suggested in this paper selects an effective resource for each job by considering the precedence constraint and the resource characteristics such as processing time and the inherent restrictions. To investigate the performance of the proposed algorithm, several numerical tests are performed for four different workflow graphs including standard, parallel and two series-parallel structures. In the tests, the solutions by the proposed algorithm are compared with random and optimal solutions which are obtained by a random selection rule and a full enumeration method respectively.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.949-958
• /
• 2005

In the paper we study key agreement schemes when a party needs to establish a session key with each of several parties, thus having multiple session keys. This situation can be represented by a graph, tailed a key graph, where a vertex represents a party and an edge represents a relation between two parties sharing a session key. graphs to establish all session keys corresponding to all edges in a key graph simultaneously in a single session. A key agreement protocol of a key graph is a natural extension of a two-party key agreement protocol. We propose a new key exchange model for key graphs which is an extension of a two-party key exchange model. using the so-called randomness re-use technique which re-uses random values to make session keys for different sessions, we suggest two efficient key agreement protocols for key graphs based on the decisional Diffie-Hellman assumption, and prove their securities in the key exchange model of key graphs. Our first scheme requires only a single round and provides key independence. Our second scheme requires two rounds and provides forward secrecy. Both are proven secure In the standard model. The suggested protocols are the first pairwise key agreement protocols and more efficient than a simple scheme which uses a two-party key exchange for each necessary key. Suppose that a user makes a session key with n other users, respectively. The simple scheme's computational cost and the length of the transmitted messages are increased by a factor of n. The suggested protocols's computational cost also depends on n, but the length of the transmitted messages are constant.

• Geotechnical Engineering
• /
• v.5 no.1
• /
• pp.27-34
• /
• 1989

This study presents a probabilistic analysis of the stability of homogeneous soil slopes during earthquakes. The stability of the slope is measured through its probability of failure rather than the customary factor of safety. The maximum horizontal ground acceleration is deterimined with Donovan and McGuire equation. The earthquake magnitude (m) is a random variable the Probability density function f(m) has been obtained with a use of Richter law. The potential failure surfaces are taken to be of an exponential shape (log-spiral) , Uncertainties of the shear strength parameters along potential failure surface are expressed by one-dimensional random field model. From a first order analysis the mean and variance of safety margin is osculated. The dependence on significant seismic parameters of the probability of failure of the slope is examined and the results are presented in a number of graphs and tables. On the base of the results obtained in this study, it is concluled that (1) the present model is useful in assessing the reliability of soil slopes under both static and seismic conditions: and (2) the probability of failure of a soil slope is greatly affected by the values of the seismic parameters that are associated with it.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.47-55
• /
• 2022

Recently, researches on the prediction of sea water temperature using artificial intelligence models has been actively conducted in Korea. However, most researches in the sea around the Korean peninsula mainly focus on predicting sea surface temperatures. Unlike previous researches, this research predicted the vertical sea water temperature profile of the East Sea, which is very important in submarine operations and anti-submarine warfare, using XBT(eXpendable Bathythermograph) data and machine learning models(RandomForest, XGBoost, LightGBM). The model was trained using XBT data measured from sea surface to depth of 200m in a specific area of the East Sea, and the prediction accuracy was evaluated through MAE(Mean Absolute Error) and vertical sea water temperature profile graphs.