• Bulletin of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.191-207
• /
• 2000

Let R be a ommutative ring with unity and F a finite free R-module. For a nonnegative integer r, there exists a natural filtration of$S_r(S_2F)$ such that its associated graded module is isomorphic to $\Sigma_{{\lambda}{\epsilon}{\tau}_r}\;L_{\lambda}F$, where ${\Gamma}_{\gamma}$ set of partitions such that $$\mid${\lambda}$\mid$-2r,{{\widetilde}{\lambda}}-{{\widetilde}{\lambda}}_1},...,{{\widetilde}{\lambda}}_k},\;each\;{{\widetilde}{\lambda}}_t}$,is even. We call such filtrations plethysm formulas. We extend the above plethysm formula to the version of chain complexes. By plethysm formula we mean the composition of universally free functors. $Let{\emptyset}:G->F$ be a morphism of finite free R-modules. We construct the natural decomposition of $S_{r}(S_2{\emptyset})$,up to filtrations, whose associated graded complex is isomorphic to ${\Sigma}_{{\lambda}{\varepsilon}{\tau}}_r}\;L_{\lambda}{\emptyset}$.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.3
• /
• pp.83-90
• /
• 2020

Prototype selection offers the advantage of ensuring low learning time and storage space by selecting the minimum data representative of in-class partitions from the training data. This paper designs a new training data generation method using hyper-rectangles that can be applied to general classification algorithms. Hyper-rectangular regions do not contain different class data and divide the same class space. The median value of the data within a hyper-rectangle is selected as a prototype to form new training data, and the size of the hyper-rectangle is adjusted to reflect the data distribution in the class area. A set cover optimization algorithm is proposed to select the minimum prototype set that represents the whole training data. The proposed method reduces the time complexity that requires the polynomial time of the set cover optimization algorithm by using the greedy algorithm and the distance equation without multiplication. In experimented comparison with hyper-sphere prototype selections, the proposed method is superior in terms of prototype rate and generalization performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2327-2340
• /
• 2000

Existing bulk loading algorithms for multi-dimensional index structures suffer from satisfying both index construction time and retrieval perfonnancc. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both constnlCtion time and search performance. To improve the construction time, we don't sort whole data set and use bisectiou algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. We show that the proposed algorithm is superior to existing algorithms in terms of construction time and search perfomlance through various experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1669-1679
• /
• 1996

In this paper, we address the problem of how to replace huffers in multimedia database systems with time-varying skewed data access. The access pattern in the multimedia database system to support audio-on-demand and video-on-demand services is generally skewed with a few popular objects. In addition the access pattem of the skewed objects has a time-varying property. In such situations, our analysis indicates that conventional LRU(least Recently Used) and LFU(Least Frequently Used) schemes for buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural suited. We propose a new buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural Networks)using a neural network for multimedia database systems with time-varying skewed data access. The major role of our neural network classifies multimedia objects into two classes:a hot set frequently accessed with great popularity and a cold set randomly accessed with low populsrity. For the classification, the inter-arrival time values of sample objects are employed to train the neural network.Our algorithm partitions buffers into two regions to combine the best roperties of LRU and LFU.One region, which contains the 핫셋 objects, is managed by LFU replacement and the other region , which contains the cold set objects , is managed by LRUreplacement.We performed simulation experiments in an actual environment with time-varying skewed data accsee to compare our algorithm to LRU, LFU, and LRU-k which is a variation of LRU. Simulation resuults indicate that our proposed algorthm provides better performance as compared to the other algorithms. Good performance of the neural network-based replacement scheme means that this new approach can be also suited as an alternative to the existing page replacement and prefetching algorithms in virtual memory systems.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.315-319
• /
• 2015

This paper addresses the design and implementation of an Android application for real-time precise motion control. To provide stable real-time performance, we implemented the application in two parts: Android service in the form of a daemon process, which periodically transfers a set of position commands for all motors through a real-time fieldbus, and Android UI application, which generates and delivers the set of position commands to the Android service. To support such a real-time motion control application, we use multi-core partitioning, which partitions the processor cores into a real-time partition to be used by the real-time motion control service and a non-real-time partition to be used by the Android application, and set up a shared buffer between them for communication. Our experiments show that we can obtain a motion control period of 2 ms with 99% task activation jitters less than ${\pm}55{\mu}s$ for a configuration where each of the four threads controls two motors in a group.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.30-33
• /
• 2001

The number of hidden neurons of the feed-forward neural networks is generally decided on the basis of experience. The method usually results in the lack or redundancy of hidden neurons, and causes the shortage of capacity for storing information of learning overmuch. This research proposes a new method for optimizing the number of hidden neurons bases on information entropy, Firstly, an initial neural network with enough hidden neurons should be trained by a set of training samples. Second, the activation values of hidden neurons should be calculated by inputting the training samples that can be identified correctly by the trained neural network. Third, all kinds of partitions should be tried and its information gain should be calculated, and then a decision-tree correctly dividing the whole sample space can be constructed. Finally, the important and related hidden neurons that are included in the tree can be found by searching the whole tree, and other redundant hidden neurons can be deleted. Thus, the number of hidden neurons can be decided. In the case of building a neural network with the best number of hidden units for tea quality evaluation, the proposed method is applied. And the result shows that the method is effective

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2006.05a
• /
• pp.99-100
• /
• 2006

The concept of dental clinic have been changed along the advanced dental science to meet the need of setting up high-technology-digital appliances. As the general idea about the dental clinic has been changed from systematic connection, the expansion of zoning needs to become more accurate and mote detailed. In the spacious waiting room. the interment cafe has been established to supply the information services, and the various multi-imaged channels, which were built in, will relieve the boredom of the waiting time. The formation of water space leads to the effect of humidification and makes parents share visual and auditory sympathy All of the unit-chairs attached cameras in the consultation room enables people to diagnose more quickly and precisely through the computerized system. Partitions have been set of to put it in and to help diagnosis process to be done smoothly in the formational space. The whole atmosphere is intended to be harmony with the natural surroundings in Je-Ju. It will inspire people visiting this clinic to image the deep blue sea in Je-Ju. By using projective non-material a lot, especially material wooden windows and doors, it is believed to create the bright and stable atmosphere. It will lead patients feel comfortable.

• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.1-11
• /
• 2003

This paper is introduced about Design driven testing, for real time system, based on use case approaches, We focuses on a part of an extended use case approach for real time software development, which partitions design schema into layered design component architecture of functional components called "design component", We developed a use case action matrix to contain a collection of related scenarios each describing a specific variant of an executable sequence of use case action units, which reflected the behavioral properties of the real time system design, in this paper, we attempt to apply real time system with design driven testing with test plan metrics which is introduced which produces an ordering of this scenario set to enhance productivity and both promote and capitalize on test case reusability of existing scenarios.scenarios.

• Journal of Korea Multimedia Society
• /
• v.22 no.11
• /
• pp.1269-1279
• /
• 2019

In medical image analysis, segmentation is considered as a vital process since it partitions an image into coherent parts and extracts interesting objects from the image. In this paper, we consider automatic segmentations of OCT retinal images to find six layer boundaries using convolutional neural networks. Segmenting retinal images by layer boundaries is very important in diagnosing and predicting progress of eye diseases including diabetic retinopathy, glaucoma, and AMD (age-related macular degeneration). We applied well-known CNN architecture for general image segmentation, called Segnet, U-net, and CNN-S into this problem. We also proposed a shortest path-based algorithm for finding the layer boundaries from the outputs of Segnet and U-net. We analysed their performance on public OCT image data set. The experimental results show that the Segnet combined with the proposed shortest path-based boundary finding algorithm outperforms other two networks.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.1-11
• /
• 1999

This paper introduces orthogonally multiplexed modulation and demodulation methods based on Wavelet Packet Bases and particularly describes Wavelet Packet Modulation (WPM) techniques that provide the designer of transmission signal set in time-frequency domain with tree structural information which can be adapted to given channel characterristics. Multi-dimensional signaling methods are also contrasted to common and different characteristics of conventional QAM. multi-tone modulation methods. The paper addresses the mothod how to find a best tree structure that has more adaptivity to impulse and narrowband tone pulse noises using a tunning algorithm which arbitrarily partitions the time-frequency space and makes a suitable orthogonal signaling waveforms. Simulation results exhibits a favorable performance over existing mod/demod methods specially for narrowband tone pulse and impulse interferences.