• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.219-227
• /
• 2002

The post-clustering algorithms, which cluster the result of Web search engine, have some different requirements from conventional clustering algorithms. In this paper, we propose the new post-clustering algorithm satisfying those of requirements as many as possible. The proposed fuzzy Concept ART is the form of combining the concept vector having several advantages in document clustering with fuzzy ART known as real time clustering algorithms on the basis of fuzzy set theory. Moreover we show that it can be applicable to general-purpose clustering as well as post clustering.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.2
• /
• pp.237-242
• /
• 2003

In this paper, we propose a new adaptive intrusion detection algorithm based on clustering: Kernel-ART, which is composed of the on-line clustering algorithm, ART (adaptive resonance theory), combining with mercer-kernel and concept vector. Kernel-ART is not only satisfying all desirable characteristics in the context of clustering-based IDS but also alleviating drawbacks associated with the supervised learning IDS. It is able to detect various types of intrusions in real-time by means of generating clusters incrementally.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.167-180
• /
• 1996

In the scalar processing oriented machine scalar operations must be performed for the vector processing as many as the number of vector components. So called a vector processing mechanism by the von Neumann operational principle. Accessing vector data hasto beperformed by theevery pointing ofthe instruction or by the address calculation of the ALU, because there is only a program counter(PC) for the sequential counting of the instructions as a memory accessing device. It should be here proposed that an access unit dimensionally to address components has to be designed for the compensation of the organizational hardware defect of the conventional concept. The necessity for the vector structuring has to be implemented in the instruction set and be performed in the mid of the accessing data memory overlapped externally to the data processing unit at the same time.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.108-118
• /
• 1994

By using a concept of interrelation vector between line segments a new algorithm for partial shape recognition of two-dimensional objects is introduced. The interrelation vector which is invariant under translation rotation and scaling of a pair of line segments is used as a feature information for polygonal shape recognition. Several useful properties of the interrelation vector are also derived in relation to efficient partial shape recognition. The proposed algorithm requires only small space of storage and is shown to be computationally simple and efficient.

• ETRI Journal
• /
• v.30 no.5
• /
• pp.738-740
• /
• 2008

In this paper, block constrained trellis coded vector quantization (BC-TCVQ) is presented for quantizing the line spectrum frequency parameters of the wideband speech codec. Both a predictive structure and a safety-net concept are combined into BC-TCVQ to develop the predictive BC-TCVQ. The performance of this quantization is compared with that of the linear predictive coding vector quantizer used in the AMRWB codec, demonstrating reductions in spectral distortion.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.661-679
• /
• 1995

The concept of the structure conformal vector field C on a Sasakian manifold M is defined. The existence of such a C on M is determined by an exterior differential system in involution. In this case M is a foliate manifold and the vector field C enjoys the property to be exterior concurrent. This allows to prove some interesting properties of the Ricci tensor and Obata's theorem concerning isometries to a sphere. Different properties of the conformal Lie algebra induced by C are also discussed.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.60-62
• /
• 2001

This paper shows the optimal bidding strategy determination method using Nash equilibrium concept by defining bidding strategy vector. This vector is 2-dimension vector whose components are generation amount and generation cost. Thereby we are able to make all possible strategies and their's payoff table. And then we erase dominated strategies one by one so that we obtain Nash equilibrium, the optimal bidding strategy of generation bidding game.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.49-58
• /
• 2010

In this paper, we consider and study a new class of generalized vector quasi-variational type inequalities and obtain some existence theorems for both under compact and noncompact assumptions in topological vector spaces without using monotonicity. For the noncompact case, we use the concept of escaping sequences.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.405-414
• /
• 2016

IC-implementations provide high performance for solving the high computational cost of pattern matching but have relative low flexibility for satisfying different applications. In this paper, we report an associative memory architecture for k nearest neighbor (KNN) search, which is one of the most basic algorithms in pattern matching. The designed architecture features reconfigurable vector-component parallelism enabled by programmable switching circuits between vector components, and a dedicated majority vote circuit. In addition, the main time-consuming part of KNN is solved by a clock mapping concept based weighted frequency dividers that drastically reduce the in principle exponential increase of the worst-case search-clock number with the bit width of vector components to only a linear increase. A test chip in 180 nm CMOS technology, which has 32 rows, 8 parallel 8-bit vector-components in each row, consumes altogether in peak 61.4 mW and only 11.9 mW for nearest squared Euclidean distance search (at 45.58 MHz and 1.8 V).

• Journal of the Korean Society of Propulsion Engineers
• /
• v.23 no.4
• /
• pp.10-20
• /
• 2019

Recently, fluidic thrust vector control has become a core technique to control multifarious air vehicles, such as supersonic aircraft and modern rockets. Fluidic thrust vector control using the shock vector concept has many advantages for achieving great vectoring performance, such as fast vectoring response, simple structure, and low weight. In this paper, computational fluid dynamics methods are used to study a three-dimensional rectangular supersonic nozzle with a slot injector. To evaluate the reliability and stability of computational methodology, the numerical results were validated with experimental data. The pressure distributions along the upper and lower nozzle walls in the symmetry plane showed an excellent match with the test results. Several numerical simulations were performed based on the shear stress transport(SST) $k-{\omega}$ turbulence model. The effect of the momentum flux ratio was investigated thoroughly, and the performance variations have been clearly illustrated.