• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.35-46
• /
• 2010

Sequential pattern mining is one of the essential data mining tasks, and it is widely used to analyze data generated in various application fields such as web-based applications, E-commerce, bioinformatics, and USN environments. Recently data generated in the application fields has been taking the form of continuous data streams rather than finite stored data sets. Considering the changes in the form of data, many researches have been actively performed to efficiently find sequential patterns over data streams. However, conventional researches focus on reducing processing time and memory usage in mining sequential patterns over a target data stream, so that a research on mining more interesting and useful sequential patterns that efficiently reflect the characteristics of the data stream has been attracting no attention. This paper proposes a mining method of sequential patterns over data streams with a gap constraint, which can help to find more interesting sequential patterns over the data streams. First, meanings of the gap for a sequential pattern and gap-constrained sequential patterns are defined, and subsequently a mining method for finding gap-constrained sequential patterns over a data stream is proposed.

• Geophysics and Geophysical Exploration
• /
• v.2 no.4
• /
• pp.191-201
• /
• 1999

The interpretation of resistivity data has, so far, mainly been made under the assumption that the earth is of relatively simple structure and then using one or two-dimensional inversion scheme. Since real earth structure and topography are fully three-dimensional and very complicated In nature, however, such assumptions often lead to misinterpretation of the earth structures. In such situations, three-dimensional inversion is probably the only way to get correct image of the earth. In this study, we have developed a three-dimensional inversion code using the finite element solution for the forward problem. The forward modeling algorithm simulates the real field situation with irregular topography. The inverse problem is solved iteratively using the least-squares method with smoothness constraint. Our inversion scheme employs ACB (Active Constraint Balancing) to enhance the resolving power of the inversion. Including Irregular surface topography in the inversion, we can accurately define the earth structures without artifact in the numerical tests. We could get reasonable image of earth structure by Inverting the real field data sets taken over highway bridge construction site.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1034-1039
• /
• 2004

Since the major reason of the detection failure is from the consecutive data transitions, it is desirable to limit the MTR(maximum transition run) within two. Therefore, we propose a new MTR code that limits the MTR constraint to 2 and k-constraint to 8. In addition, DC-free coding is performed to overcome the media noise that exits in low frequency of perpendicular recording system. We use a GS (Guided Scrambling) for DC-free coding, and the performance of the code is compared with that of the rate 819 code used in the conventional recording channel by a computer simulation.

• Environmental Engineering Research
• /
• v.21 no.4
• /
• pp.409-419
• /
• 2016

As a major energy consumption province, the issue about the carbon emissions in Hebei Province, China has been concerned by the government. The carbon emissions can be effectively reduced due to a more rational energy consumption structure. Thus, in this paper the constraint of low carbon emissions is considered as a foundation and four energies--coal, petroleum, natural gas and electricity including wind power, nuclear power and hydro-power etc are selected as the main analysis objects of the adjustment of energy structure. This paper takes energy cost minimum and carbon trading cost minimum as the objective functions based on the economic growth, energy saving and emission reduction targets and constructs an optimization model of energy consumption structure. And empirical research about energy consumption structure optimization in 2015 and 2020 is carried out based on the energy consumption data in Hebei Province, China during the period 1995-2013, which indicates that the energy consumption in Hebei dominated by coal cannot be replaced in the next seven years, from 2014 to 2020, when the coal consumption proportion is still up to 85.93%. Finally, the corresponding policy suggestions are put forward, according to the results of the energy structure optimization in Hebei Province.

• Journal of Family Resource Management and Policy Review
• /
• v.17 no.1
• /
• pp.241-263
• /
• 2013

Time pressure and financial burden have been reported as the main constraints on leisure participation. The purpose of this study was to explore a typology of leisure constraints, investigate the characteristics of leisure constraint types, and analyze the differences in leisure participation by the types of leisure constraints for married employees. The data source for this research was the 2009 Time Use Survey conducted by the Korea National Statistical Office (KNSO). Married employees aged 20 to 59 years completed 13,476 time diaries (7,984 for male, 5,492 for female), which were analyzed using chi-square, cluster analysis, and ANOVA analysis. Leisure constraints were classified into five types in two categories, working time per week and personal income for both males and females respectively. The three types for both males and females were time-income constraints, income constraints, and general constraints, with an additional type for men, $time^+$-income constraints, and an additional type for women, time constraint. The most common type was general constraints, for both males and females. Each type was further differentiated by the following socio-economic variables: age, educational level, job type, and weekly day-off. The study found that participation in study, sports, and religious activities varied with the types of leisure constraints.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.4
• /
• pp.409-416
• /
• 2009

Standard procedures for a fracture toughness testing require very severe restrictions for the specimen geometry to eliminate a size effect on the measured properties. Therefore, the used standard fracture toughness data results in the integrity assessment being irrationally conservative. However, a realistic fracture in general structures, such as in nuclear power plants, may develop under the low constraint condition of a large scale yielding with a shallow surface crack. In this paper, cleavage fracture toughness tests have been made on side-grooved PCVN (precracked charpy V-notch) type specimens (10 by 10 by 55 mm) with various crack depths. The constraint effects on the crack depth ratios were evaluated quantitatively by the developed scaling method using the 3-D finite element method. After the fracture toughness correction from scaling model, the statistical size effects were also corrected according to the standard ASTM E 1921 procedure. The results were evaluated through a comparison with the $T_0$ of the standard CT specimen. The corrected $T_0$ for all of the PCVN specimens showed a good agreement to within $5.4^{\circ}C$ regardless of the crack depth, while the averaged PCVN $T_0$ was $13.4^{\circ}C$ higher than the real CT test results.

• Journal of the Korean Home Economics Association
• /
• v.42 no.12 s.202
• /
• pp.231-251
• /
• 2004

The purpose of this study us to determine the adolescents' leisure activity pattern, leisure constraints and leisure satisfaction and to identify the relevant variables. The subjects were middle and high school students. The data was collected by using the questionnaire and the final 741 cases were analyzed by SPSS Win 10.0 program. The major findings were as follows: 1. The adolescents' leisure activity hours were 2.27hours/day(weekday), 4.20hours/day(Saturday) and 5.35hours/day(Sunday). On weekdays, female students spent more time for leisure activity than male students. The most frequent activities were watching TV and playing computer. 2. The adolescents' leisure constraints were social-economic, psychological and situational. The degree of the adolescents' situational constraint was the highest. 3. The adolescents' leisure satisfactions were leisure use, leisure condition and leisure meaning. The adolescents' degree of leisure meaning satisfaction was relatively high. 4. The major related variable influencing the leisure satisfaction were psychological constraint, situational constraint and gender.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.439-448
• /
• 1999

In this paper, two optimization algorithms based on artificial neural networks and genetic algorithms are proposed for cellular radio channel assignment problems. The channel assignment process is characterized as minimization of the energy function which represents constraints of the channel assignment problems. All three constraints such as the co-channel constraint, the adjacent channel constraint and the co-site channel constraint are considered. In the neural networks approach, certain techniques such as the forced assignment and the changing cell order are developed, and in the genetic algorithms approach, data structure and proper genetic operators are developed to find optimal solutions, As simulation results, the convergence rates of the two approaches are presented and compared.

• IE interfaces
• /
• v.16 no.4
• /
• pp.485-495
• /
• 2003

This paper reports on the application of the integration of mathematical programming model and database in a decision support system (DSS) for the planning of the multi-reservoir operating system. The DSS is based on a multi-objective, mixed-integer goal programming (MIGP) model, which can generate efficient solutions via the weighted-sums method (WSM). The major concern of this study is seamless, efficient integration between the mathematical model and the database, because there are significant differences in structure and content between the data for a mathematical model and the data for a conventional database application. In order to load the external optimization results on the database, we developed a systematic way of naming variable/constraint so that a rapid identification of variables/constraints is possible. An efficient database structure for planning of the multi-reservoir operating system is presented by taking advantage of the naming convention of the variable/constraint.