• Journal of the Korean School Mathematics Society
• /
• v.14 no.3
• /
• pp.339-354
• /
• 2011

The purpose of this paper is to find out the effective teaching method and improvement for managing the special lecture of basic mathematics which is grouped by the level of low achievement students who are matriculants. From the result, we want to know how the lecture with teaching method of differentiated learning affect on the students, especially who have under achievement, to be interested and confidential in mathematics.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.50 no.2
• /
• pp.142-146
• /
• 2005

Thirty-two germplasms of Korean adlay landraces were examined to analyse the genetic relationship through the amplified fragment length polymorphism (AFLP) approach. Total number of AFLP products generated by 12 selective primer combinations was 882. The number of polymorphic fragments by each primer combination greatly varied from 4 to 51 with a mean of 20.3, bands visible on the polyacrylamide gel. A genetic similarity coefficient was used for cluster analysis following UPGMA (unweighted pair grouping method of averages) method. The resulting clusters were represented in the form of a dendrogram. The clustering was not tight in the dendrogram. There was generally no clear grouping of the adlay according to the geographic regions in which germplasms were collected. The present AFLP analysis imply that although Korean adlay displayed a larger amount of AFLP variation within germplasms, the variation was shown independently without reflecting a clinal variation. This study demonstrated that AFLP method can be used to examine the genetic relationships among different germplasms of adlay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.177-180
• /
• 2002

In this paper, an effective digital watermarking method for copyright protection of binary image data is proposed. First, a binary image is grouped into feature regions which have geometrical features and general one. The watermark for authentication is embedded in general regions in order to preserve geometrical features regions. We have used run-length code and special runs for grouping feature regions and general one. For invisibility of watermark, we have embedded the watermark considering transition sensitivity of each pixel in general regions. The proposed method is applied to some binary image such as character, signature, seal, and fingerprint image to evaluate performance. By the experimental results, the proposed method preserve feature regions of original image and have higher invisibility of watermarks.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.8
• /
• pp.86-96
• /
• 2000

The representative area among the ones whose cost increases as the integration ratio increases is the test area. As the relative cost of hardware decreases, the BIST method has been focued on as the future-oriented test method. The biggest drawback of it is the increasing test time to obtain the acceptable fault coverage. This paper proposed a BIST implementation method to reduce the test times. This method uses an input grouping and test point insertion method, in which the definition of test point is different from the previous one. That is, the test points are defined on the basis of the internal nodes which are the reference points of the input grouping and are merging points of the grouped signals. The main algorithms in the proposed method were implemented with C-language, and various circuits were used to apply the proposed method for experiment. The results showed that the test time could be reduced to at most $1/2^{40}$ of the pseudo-random pattern case and the fault coverage were also increased compared with the conventional BIST method. The relative hardware overhead of the proposed method to the circuit under test decreases as th e size of the circuit to be tested increases, and the delay overhead by the BIST utility is negligible compared to that of the original circuit. That means, the proposed method can be applied efficiently to large VLSI circuits.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.247-261
• /
• 2002

Aggregation is an important operation that affects the performance of OLAP systems. In this paper we define a new class of aggregation queries, called range-groupby queries, and present a method for processing them. A range-groupby query is defined as a query that, for an arbitrarily specified region of an n-dimensional cube, computes aggregations for each combination of values of the grouping attributes. Range-groupby queries are used very frequently in analyzing information in MOLAP since they allow us to summarize various trends in an arbitrarily specified subregion of the domain space. In MOLAP applications, in order to improve the performance of query processing, a method of maintaining precomputed aggregation results, called the prefix-sum array, is widely used. For the case of range-groupby queries, however, maintaining precomputed aggregation results for each combination of the grouping attributes incurs enormous storage overhead. Here, we propose a fast algorithm that can compute range-groupby queries with minimal storage overhead. Our algorithm maintains only one prefix-sum away and still effectively processes range-groupby queries for all possible combinations of the grouping attributes. Compared with the method that maintains a prefix-sum array for each combination of the grouping attributes in an n-dimensional cube, our algorithm reduces the space overhead by (equation omitted), while accessing a similar number of cells.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.143-146
• /
• 2008

In this paper, It presents the method the player will be able to confront when the NPC approach to the player, the NPC which have the property which is similar form grouping. The property of the NPC follows in quality of Game and it decides with separate way. To attribute of the NPC it is composed of conduct pattern, an attack pattern and the weapon pattern back. It considers a priority on the group wild middle which is formed and it judges the attack yes or no of the player. The method that proposed will play an important role in development of a 3D FPS games.

• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.140-151
• /
• 2014

Storing, and the loading and unloading of materials at production sites in the manufacturing sector for mass production is a critical problem that affects various aspects: the layout of the factory, line-side space, logistics, workers' work paths and ease of work, automatic procurement of components, and transfer and supply. Traditionally, the nesting problem has been an issue to improve the efficiency of raw materials; further, research into mainly 2D optimization has progressed. Also, recently, research into the expanded usage of 3D models to implement packing optimization has been actively carried out. Nevertheless, packing algorithms using 3D models are not widely used in practice, due to the large decrease in efficiency, owing to the complexity and excessive computational time. In this paper, the problem of efficiently loading and unloading freeform 3D objects into a given container has been solved, by considering the 3D form, ease of loading and unloading, and packing density. For this reason, a Group Packing Approach for workers has been developed, by using analyzed truck packing work patterns and Group Technology, which is to enhance the efficiency of storage in the manufacturing sector. Also, an algorithm for 3D packing has been developed, and implemented in a commercial 3D CAD modeling system. The 3D packing method consists of a grouping algorithm, a sequencing algorithm, an orientating algorithm, and a loading algorithm. These algorithms concern the respective aspects: the packing order, orientation decisions of parts, collision checking among parts and processing, position decisions of parts, efficiency verification, and loading and unloading simulation. Storage optimization and examination of the ease of loading and unloading are possible, and various kinds of engineering analysis, such as work performance analysis, are facilitated through the intelligent 3D packing method developed in this paper, by using the results of the 3D model.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.43-56
• /
• 2004

The KHCM procedure is a micro level analysis at signalized intersections requiring a lot of input variables and complex computations. The research was to investigate the possibility of simplifying the analysis procedures by using the generalized or the combined variables that less influence on the adjusted traffic volume and through-car equivalents of left or right turns. It was also tried to make lane grouping into directional flow ratio(v/s) based on a field surveys. The maximum and minimum values of each variables were compared with each other through the KHCM analysis procedures in terms of control delay. The lane grouping and the synthetical influence of a simplified method was evaluated with the scenario built in prevailing maximum and minimum conditions. The study showed that the control delay was not significantly sensitive to the selected variables and the lane grouping and their synthetical influence as well.

• The Korean Journal of Applied Statistics
• /
• v.22 no.6
• /
• pp.1177-1190
• /
• 2009

The traffic operating speed is one of important information to measure a road capacity. When we supply the information of the road of high traffic by using navigation, offering the present traffic information and the forecasted future information are the outstanding functions to serve the more accurate expected times and intervals. In this study, we proposed the traffic speed forecasting model using the accumulated traffic speed data of the road and highway and forecasted the average speed for each the road and high interval and each time interval using Fourier transformation and time series regression model with trigonometrical function. We also propose the proper method of missing data imputation and treatment for the outliers to raise an accuracy of the traffic speed forecasting and the speed grouping method for which data have similar traffic speed pattern to increase an efficiency of analysis.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.2
• /
• pp.245-255
• /
• 2013

The object of study is to propose a method for grouping R, F, and M in RFM model. Our model uses 6 levels using standard normal distribution. First level is upper 2.5% and second level next 13.5%, third level next 34%, fourth level next 34%, fifth level next 13.5%, sixth level next 2.5%. Values are symmetric and limits are clear. We compare proposed model with traditional 5 level model and 10 level model using NDSL data of KISTI. Proposed model divides most clearly the distribution of the RFM function for all cases of weights, because it uses the distribution of customers. Comparison studies of our model with grouping using cluster analysis and studies on weights of RFM model are needed.