Abstract: The present disclosure relates to an electronic block kit system for scratch programming. And more particularly, the present disclosure relates to an electronic block kit system which includes electronic blocks of hardware shapes each corresponding to instruction blocks of the scratch programming, which are used in the program coding education, and executes a program controlling a sprite in accordance with a program flow chart when the electronic blocks are connected along the program flowchart. The electronic block kit system includes: a master electronic block connected to the smart terminal and configured to form a data communication path with the smart terminal and receive a supply voltage; and a plurality of slave electronic blocks. The slave electronic block can be combined with one of the master electronic block and a different slave electronic block.

Abstract: The present disclosure relates to an electronic block kit system for scratch programming. And more particularly, the present disclosure relates to an electronic block kit system which includes electronic blocks of hardware shapes each corresponding to instruction blocks of the scratch programming, which are used in the program coding education, and executes a program controlling a sprite in accordance with a program flow chart when the electronic blocks are connected along the program flowchart. The electronic block kit system includes: a master electronic block connected to the smart terminal and configured to form a data communication path with the smart terminal and receive a supply voltage; and a plurality of slave electronic blocks. The slave electronic block can be combined with one of the master electronic block and a different slave electronic block.

Abstract: Disclosed herein is a dynamic update cube and hybrid query search method for range-sum queries. The present invention relates to a hybrid query search method, which provides a precise answer or an approximate answer with respect to On-Line Analytic Processing (OLAP) queries by using a delta (?)-tree, which has a multidimensional index structure and a prefix-sum cube, so as to effectively support range-sum queries widely used in opinion decisions in enterprises. In the dynamic update cube and hybrid query search method for range-sum queries, a prefixed-sum cube is dense and the dynamic update cube is sparse, such that whenever a data cube changes, the prefixed sum cube is not directly updated and instead, the changes of the data cube are stored in a ?-Tree and the ?-Tree is managed.

Abstract: An apparatus and method for performing similarity searches using hyper-rectangle based multidimensional data segmentation partitions a data set representable by a multidimensional data sequence, such as a video stream, into segments in consideration of the temporal relationship between points, and groups similar segments in one sequence into the same cluster so as to efficiently search a database for a multidimensional data sequence similar to a given query sequence.

Abstract: Disclosed herein is an apparatus and method for similarity searches using hyper-rectangle based multidimensional data segmentation. The similarity search apparatus has MBR generation means, first sequence pruning means, second sequence pruning means, and subsequence finding means. The MBR generation means segments a multidimensional data sequence to be partitioned into subsequences, and represents each subsequence by each Minimum Bounding Rectangle (MBR), such that sets of MBRs are generated from the multidimensional data sequence, and the MBR sets are stored in a database. The first sequence pruning means prunes irrelevant data sequences using a distance Dmbr between MBRs extracted from an inputted query sequence and the MBR sets stored in the database in a multidimensional Euclidean space.

Abstract: Disclosed herein is an apparatus and method for hyper-rectangle based multidimensional data segmentation and clustering. The segmentation apparatus has threshold calculation means, segment generation means, geometric condition determination means, segment merging means, and segment updating means. The threshold calculation means inputs a multidimensional sequence Si and the minimum number of points per segment minPts, and calculates bounding threshold values for a volume and an edge. The segment generation means initialize a segment set and an outlier set to empty sets and generates a current segment using a first point of the sequence Si. The geometric condition determination means determines whether a next point of the sequence Si satisfies a geometric condition using the bounding threshold values for the volume and the edge. The segment merging means merges the next point of the sequence Si into the current segment if geometric condition is satisfied.

Abstract: Disclosed herein is an apparatus and method for similarity searches using hyper-rectangle based multidimensional data segmentation. The similarity search apparatus has MBR generation means, first sequence pruning means, second sequence pruning means, and subsequence finding means. The MBR generation means segments a multidimensional data sequence to be partitioned into subsequences, and represents each subsequence by each Minimum Bounding Rectangle (MBR), such that sets of MBRs are generated from the multidimensional data sequence, and the MBR sets are stored in a database. The first sequence pruning means prunes irrelevant data sequences using a distance Dmbr between MBRs extracted from an inputted query sequence and the MBR sets stored in the database in a multidimensional Euclidean space.

Abstract: Disclosed herein is a dynamic update cube and hybrid query search method for range-sum queries. The present invention relates to a hybrid query search method, which provides a precise answer or an approximate answer with respect to On-Line Analytic Processing (OLAP) queries by using a delta (&Dgr;)-tree, which has a multidimensional index structure and a prefix-sum cube, so as to effectively support range-sum queries widely used in opinion decisions in enterprises. In the dynamic update cube and hybrid query search method for range-sum queries, a prefixed-sum cube is dense and the dynamic update cube is sparse, such that whenever a data cube changes, the prefixed sum cube is not directly updated and instead, the changes of the data cube are stored in a &Dgr;-Tree and the &Dgr;-Tree is managed.