• Korean Journal of Child Studies
• /
• v.29 no.1
• /
• pp.293-303
• /
• 2008

The purpose of this study was to identify the relationships between children's information processing style and creativity. The subjects were 40 5-year-old kindergarten students in Busan. The K-ABC (Kaufman Assessment Battery for Children, 1987) test and Torrance's TTCT were used to examine the relationships between children's information processing style and creativity. This analysis showed no significant correlation between information processing style and creativity. On the other hand, the sequential processing style affected fluency and the simultaneous processing style affected originality, elaboration, and abstractness of titles.

• Korean Journal of Childcare and Education
• /
• v.9 no.2
• /
• pp.173-189
• /
• 2013

The purpose of this study was to examine the relationship between children's information processing ability and basic learning abilities. To collect the data, two tests were given to 99 children. The Korean K-ABC(Moon & Byun, 1997) and Pictorial Basic Learning Abilities for Children(Kim, 2011) were used to examine the relationship between children's information processing and basic learning abilities. The collected data were analyzed by correlation analysis and multiple regression analysis. According to the results of this study, there was a significant positive correlation between information processing(sequential processing, simultaneous processing) and basic learning abilities including reading, writing, and basic mathematics. And information processing significantly affected basic learning abilities. Namely, simultaneous processing explained 22% of basic learning abilities and by adding sequential processing, the explanation was increased to 25%. In conclusion, the results of this study suggest various implications about children's basic learning abilities. These implications will help teachers and parents to understand their children's learning.

• Journal of Intelligence and Information Systems
• /
• v.16 no.3
• /
• pp.55-75
• /
• 2010

Sequential pattern mining aims to discover interesting sequential patterns in a sequence database, and it is one of the essential data mining tasks widely used in various application fields such as Web access pattern analysis, customer purchase pattern analysis, and DNA sequence analysis. In general sequential pattern mining, only the generation order of data element in a sequence is considered, so that it can easily find simple sequential patterns, but has a limit to find more interesting sequential patterns being widely used in real world applications. One of the essential research topics to compensate the limit is a topic of weighted sequential pattern mining. In weighted sequential pattern mining, not only the generation order of data element but also its weight is considered to get more interesting sequential patterns. In recent, data has been increasingly taking the form of continuous data streams rather than finite stored data sets in various application fields, the database research community has begun focusing its attention on processing over data streams. The data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. In data stream processing, each data element should be examined at most once to analyze the data stream, and the memory usage for data stream analysis should be restricted finitely although new data elements are continuously generated in a data stream. Moreover, newly generated data elements should be processed as fast as possible to produce the up-to-date analysis result of a data stream, so that it can be instantly utilized upon request. To satisfy these requirements, data stream processing sacrifices the correctness of its analysis result by allowing some error. Considering the changes in the form of data generated in real world application fields, many researches have been actively performed to find various kinds of knowledge embedded in data streams. They mainly focus on efficient mining of frequent itemsets and sequential patterns over data streams, which have been proven to be useful in conventional data mining for a finite data set. In addition, mining algorithms have also been proposed to efficiently reflect the changes of data streams over time into their mining results. However, they have been targeting on finding naively interesting patterns such as frequent patterns and simple sequential patterns, which are found intuitively, taking no interest in mining novel interesting patterns that express the characteristics of target data streams better. Therefore, it can be a valuable research topic in the field of mining data streams to define novel interesting patterns and develop a mining method finding the novel patterns, which will be effectively used to analyze recent data streams. This paper proposes a gap-based weighting approach for a sequential pattern and amining method of weighted sequential patterns over sequence data streams via the weighting approach. A gap-based weight of a sequential pattern can be computed from the gaps of data elements in the sequential pattern without any pre-defined weight information. That is, in the approach, the gaps of data elements in each sequential pattern as well as their generation orders are used to get the weight of the sequential pattern, therefore it can help to get more interesting and useful sequential patterns. Recently most of computer application fields generate data as a form of data streams rather than a finite data set. Considering the change of data, the proposed method is mainly focus on sequence data streams.

• Korean Journal of Child Studies
• /
• v.16 no.2
• /
• pp.81-95
• /
• 1995

The purpose of this study was to examine the feasibility of validating the Kaufman Assessment Battery for Children(K-ABC) with Korean preschoolers. Subjects were 197 preschoolers of 3,4 and 5 years of age. The mean of the MPC(Mental Processing Composite) scores was 111.7 and SD was 12.26. According to the item discriminant method, most subtests of Sequential Processing and the triangle subtest of Simultaneous Processing were significant, but the other subtests were insignificant. All subtests were highly correlated with MPC, and both the Sequential Processing Scale and Simultaneous Processing Scale were highly correlated with MPC; but the correlation between the two scales was low. Internal consistency was satisfactory on both scales(Cronbach' ${\alpha}$=.76 -.86). A further study is needed to diminish cultural discriminants and to include more samples from diverse subject groups.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.4
• /
• pp.403-410
• /
• 1999

In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.2064-2068
• /
• 2010

In this paper, we introduced a sequential intelligent image analysis system(SIIAS). This system is implemented using PTZ camera with intelligent analysis algorithm and TI's Davinci DM6446. Enter, abandon, removal and cross functions are included in our system. These functions can be used individually or in combination for object monitoring and tracking. Sequential intelligent function processing is more efficient than the previous one by virtue of accurate observation, wide area monitoring and low cost.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.11
• /
• pp.43-49
• /
• 2018

In this paper, we propose a displacement measurement method based on deep learning using image data obtained from tensile tests of a material specimen. We focus on the fact that the sequential images during the tension are generated and the displacement of the specimen is represented in the image data. So, we designed sample generation model which makes sequential images of specimen. The behavior of generated images are similar to the real specimen images under tensile force. Using generated images, we trained and validated our model. In the deep neural network, sequential images are assigned to a multi-channel input to train the network. The multi-channel images are composed of sequential images obtained along the time domain. As a result, the neural network learns the temporal information as the images express the correlation with each other along the time domain. In order to verify the proposed method, we conducted experiments by comparing the deformation measuring performance of the neural network changing the displacement range of images.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.477-484
• /
• 2004

The technique of sequential pattern mining means generating a set of inter-transaction patterns residing in time-dependent data. This paper proposes a new method for generating sequential patterns with the use of Hellinger measure. While the current methods are generating single dimensional sequential patterns within a single attribute, the proposed method is able to detect multi-dimensional patterns among different attributes. A number of heuristics, based on the characteristics of Hellinger measure, are proposed to reduce the computational complexity of the sequential pattern systems. Some experimental results are presented.

• Korean Journal of Computational Design and Engineering
• /
• v.16 no.3
• /
• pp.236-245
• /
• 2011

Many researchers have recently studied multi-level formulation strategies to solve the MDO problems and they basically distributed the coupling compatibilities across all disciplines, while single-level formulations concentrate all the controls at the system-level. In addition, approximation techniques became remedies for computationally expensive analyses and simulations. This paper studies comparisons of the MDO methods with respect to computing performance considering both conventional sequential and modem distributed/parallel processing environments. The comparisons show Individual Disciplinary Feasible (IDF) formulation is the most efficient for sequential processing and IDF with approximation (IDFa) is the most efficient for parallel processing. Results incorporating to popular design examples show this finding. The author suggests design engineers should firstly choose IDF formulation to solve MDO problems because of its simplicity of implementation and not-bad performance. A single drawback of IDF is requiring more memory for local design variables and coupling variables. Adding cheap memories can save engineers valuable time and effort for complicated multi-level formulations and let them free out of no solution headache of Multi-Disciplinary Analysis (MDA) of the Multi-Disciplinary Feasible (MDF) formulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.448-459
• /
• 2012

It is important to understand how we can deal with elements for the modeling of neural networks when we are investigating the dynamical performance and the information processing capabilities. The information processing capabilities of model neural networks will change for different response, synaptic weights or learning rules. Using the statistical neurodynamics method, we evaluate the capabilities of neural networks in order to understand the basic concept of parallel distributed processing. In this paper, we explain the results of theoretical analysis of the effects of the hysteretic property on the performance of sequential associative neural networks.