• Communications for Statistical Applications and Methods
• /
• v.1 no.1
• /
• pp.41-51
• /
• 1994

We consider nonparametric procedures for the selection and ranking problems. Tukey's generalized lambda distribution is condidered as the distribution for the score function because the distribution can approximate many well-known contionuous distributions. Also we compare these procedures in terms of efficiency, defined by the ratio of a probability of a correct selection divided by the expected selected subset size.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.77-81
• /
• 1996

Considering the human visual masking property, a modified relationship between the activity function and the visibility threshold is developed. This leads to a novel objective appraisal method for blocking effects in a lossy subimage coding by virtue of the human visual sensitivity. The appraisal criterion is examined using a series of reconstructed images that are DCT-coded at various bit rates. Experimental results show that the presented blocking effect measure well agrees with the subjective ranking.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2101-2123
• /
• 2023

Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.3
• /
• pp.60-67
• /
• 2016

In cumulative transfer functions, as number of transfer increase, the impact of individual transfer to transfer cost increase linearly or non linearly. This function can effectively explain various passengers's travel behavior who choose their travel routes in integrated transit line networks including bus and railway modes. Using the function, it is possible to simulate general situations such that even though more travel times are expected, less number of transfer routes are preferred. However, because travel cost with cumulative transfer function is known as non additive cost function types in route search algorithms, finding an optimal route in integrated transit networks is confronted by the insolvable enumeration of all routes in many cases. This research proposes a methodology for finding an optimal path considering cumulative transfer function. For this purpose, the reversal phenomenon of optimal path generated in route search process is explained. Also a heuristic methodology for selecting an optimal route among multiple routes predefined by the K path algorithm. The incoming link based entire path deletion method is adopted for finding K ranking path thanks to the merit of security of route optimality condition. Through case studies the proposed methodology is discussed in terms of the applicability of real situations.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.9 no.1
• /
• pp.122-130
• /
• 2001

In order to improve the efficiency of the design process and the quality of the resulting design, this study proposes a design method for determining design variables of an automotive wheel-bearing unit of double-row angular-contact ball bearing type by using a genetic algorithm. The desired performance of the wheel-bearing unit is to maximize system life while satisfying geometrical and operational constraints without enlarging mounting spae. The use of gradient-based optimization methods for the design of the unit is restricted because this design problem is characterized by the presence of discrete design variables such as the number of balls and standard ball diameter. Therefore, the design problem of rolling element bearings is a constrained discrete optimization problem. A genetic algorithm using real coding and dynamic mutation rate is used to efficiently find the optimum discrete design values. To effectively deal with the design constraints, a ranking method is suggested for constructing a fitness function in the genetic algorithm. A computer program is developed and applied to the design of a real wheel-bearing unit model to evaluate the proposed design method. Optimum design results demonstrate the effectiveness of the design method suggested in this study by showing that the system life of an optimally designed wheel-bearing unit is enhanced in comparison with that of the current design without any constraint violations.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2001.11a
• /
• pp.166-171
• /
• 2001

In order to improve the efficiency of the design process and the quality of the resulting design for the application-based exclusive rolling element bearings, this study propose design methodologies by using a genetic-based combinatorial optimization. By the presence of discrete variables such as the number of rolling element (standard component) and by the engineering point of views, the design problem of the rolling element bearing can be characterized by the combinatorial optimization problem as a fully discrete optimization. A genetic algorithm is used to efficiently find a set of the optimum discrete design values from the pre-defined variable sets. To effectively deal with the design constraints and the multi-objective problem, a ranking penalty method is suggested for constructing a fitness function in the genetic-based combinatorial optimization. To evaluate the proposed design method, a robust performance analyzer of ball bearing based on quasi-static analysis is developed and the computer program is applied to some design problems, 1) maximize fatigue life, 2) maximize stiffness, 3) maximize fatigue life and stiffness, of a angular contact ball bearing. Optimum design results are demonstrate the effectiveness of the design method suggested in this study. It believed that the proposed methodologies can be effectively applied to other multi-objective discrete optimization problems.

• Journal of Intelligence and Information Systems
• /
• v.26 no.3
• /
• pp.171-191
• /
• 2020

This study focused on digital music, which is the most valuable cultural asset in the modern society and occupies a particularly important position in the flow of the Korean Wave. Digital music was collected based on the "Gaon Chart," a well-established music chart in Korea. Through this, the changes in the ranking of the music that entered the chart for 73 weeks were collected. Afterwards, patterns with similar characteristics were derived through time series cluster analysis. Then, a descriptive analysis was performed on the notable features of each pattern. The research process suggested by this study is as follows. First, in the data collection process, time series data was collected to check the ranking change of digital music. Subsequently, in the data processing stage, the collected data was matched with the rankings over time, and the music title and artist name were processed. Each analysis is then sequentially performed in two stages consisting of exploratory analysis and explanatory analysis. First, the data collection period was limited to the period before 'the music bulk buying phenomenon', a reliability issue related to music ranking in Korea. Specifically, it is 73 weeks starting from December 31, 2017 to January 06, 2018 as the first week, and from May 19, 2019 to May 25, 2019. And the analysis targets were limited to digital music released in Korea. In particular, digital music was collected based on the "Gaon Chart", a well-known music chart in Korea. Unlike private music charts that are being serviced in Korea, Gaon Charts are charts approved by government agencies and have basic reliability. Therefore, it can be considered that it has more public confidence than the ranking information provided by other services. The contents of the collected data are as follows. Data on the period and ranking, the name of the music, the name of the artist, the name of the album, the Gaon index, the production company, and the distribution company were collected for the music that entered the top 100 on the music chart within the collection period. Through data collection, 7,300 music, which were included in the top 100 on the music chart, were identified for a total of 73 weeks. On the other hand, in the case of digital music, since the cases included in the music chart for more than two weeks are frequent, the duplication of music is removed through the pre-processing process. For duplicate music, the number and location of the duplicated music were checked through the duplicate check function, and then deleted to form data for analysis. Through this, a list of 742 unique music for analysis among the 7,300-music data in advance was secured. A total of 742 songs were secured through previous data collection and pre-processing. In addition, a total of 16 patterns were derived through time series cluster analysis on the ranking change. Based on the patterns derived after that, two representative patterns were identified: 'Steady Seller' and 'One-Hit Wonder'. Furthermore, the two patterns were subdivided into five patterns in consideration of the survival period of the music and the music ranking. The important characteristics of each pattern are as follows. First, the artist's superstar effect and bandwagon effect were strong in the one-hit wonder-type pattern. Therefore, when consumers choose a digital music, they are strongly influenced by the superstar effect and the bandwagon effect. Second, through the Steady Seller pattern, we confirmed the music that have been chosen by consumers for a very long time. In addition, we checked the patterns of the most selected music through consumer needs. Contrary to popular belief, the steady seller: mid-term pattern, not the one-hit wonder pattern, received the most choices from consumers. Particularly noteworthy is that the 'Climbing the Chart' phenomenon, which is contrary to the existing pattern, was confirmed through the steady-seller pattern. This study focuses on the change in the ranking of music over time, a field that has been relatively alienated centering on digital music. In addition, a new approach to music research was attempted by subdividing the pattern of ranking change rather than predicting the success and ranking of music.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.6 s.22
• /
• pp.63-71
• /
• 2004

This study is an analysis the function Analysis Patterns for the effective application of VE(Value Engineering) and a presentation of the function analysis methods. 1. The function analysis of VE activities can be summarized 6 patterns as follows ; a generated ideas without function analysis process, a function analysis make use of inspection tools for generated idea, an illogical jump as a using of subjective terms, a using of duplication terms for same functions, a subjective ranking as function definitions for function analysis, and a large classification for a for approaching function definition. 2. In order for the effective function analysis, the process requires as follows; a check level by project advanced, a reclassified main nouns in the order of frequency of use, a main check objects by concepts of importance and satisfaction degree. It is not only good for the effective function analysis, it also induces effective turn out of the FAST Diagram for function arrangement.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.3
• /
• pp.163-173
• /
• 2011

This paper, as a case study on the evaluation of nationwide-unit forest functions, targeting the entire Gyeongsangnam-do region, examined the integration measures for the evaluation of national, public and private forest functions, as well as GIS data problems and GIS data building methods. Also, the distribution and characteristics of Gyeongsangnam-do's forest functions were examined. First, as integration measures for forest function evaluation, evaluation unit was proposed as watershed unit, and GIS techniques were proposed to correct some patterns of errors shown in the watershed maps. Also, of GIS data used for forest function evaluation, maps of locations of saw mills to be revised, expressway interchange location maps, and population distribution maps were built nationwide. Based on watershed units, the forest functions of 20 cities and counties in Gyeongsangnam-do were evaluated, revealing that wood production function and forest recreation function potentials, high-ranking was high distributed throughout the site, while most functions potentials, low-ranking was low distributed. In forest function maps with the application of priority by city and gun, the area size was ranked in the order of forest recreation, timber production, natural conservation, water yield, living environment conservation, and prevention of natural disaster. Case analysis results for large areas can be used in evaluating nationwide forest functions.