• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.128-138
• /
• 2007

With the development of broadcasting technology from analogue to interactive digital, the number of TV channels and contents provided to audience is increasing in a rapid speed. In this multi-media and multi-channel world, it is difficult to adapt to the increase of TV channel numbers and their contents merely using remote controller to search channels. Due to this reason, EPG (Electronic Program Guide) has been one of the essential services providing convenience to audience. So EPG complying with European DVB-MHP specifications, which will be also our domestic standard, is proposed in this paper. In order to provide audiences with DiTV contents they preferred, we apply collaborative filtering algorithm to recommend contents according to preference value of audience group with similar preference. And we use JavaXlet application which is based on MHP to implement this EPG, while the result can be verified by OpenMHP emulator.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.293-302
• /
• 2002

Gradual scene change detection is known as more difficult problem then abrupt scene change detection on video data analysis for contents based retrieval. In this paper, we present a new method for scene change detection far both abrupt and gradual change using the variable dynamic threshold arid cut frame difference (CFD). For this, We present the characteristics arid mathematical models of gradual transitions anti then, how can be detected by the CFD. And also we present new scene change detection algorithm based on cut frame difference. By the experimental result using real world video data indicate that the proposed method detect various scene changes both abrupt and gradual change efficiently without time-consuming computation and any dependency on a kind of gradual change effects.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.411-417
• /
• 2006

Motion Estimation (ME) is an important part of video coding process and it takes the largest amount of computation in video compression. Half-pixel and quarter-pixel motion estimation can improve the video compression rate at the cost of higher computational complexity In this paper, we suggest a new efficient low-complexity algorithm for half-pixel and quarter pixel motion estimation. It is based on the experimental results that the sum of absolute differences(SAD) shows parabolic shape and thus can be approximated by using interpolation techniques. The sub-pixel motion vector is searched from the minimum SAD integer-pixel motion vector. The sub-pixel search direction is determined toward the neighboring pixel with the lowest SAD among 8 neighbors. Experimental results show that more than 20% reduction in computation time can be achieved without affecting the quality of video.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.451-459
• /
• 2007

RFID it reads information which is it writes, the semiconductor chip for and the radio frequency system which uses the hazard antenna it has built-in transmission of information it talks. Formation which is transmitted like this collection and America which it filtrates wey the RFID search service back to inform the location of the server which has commodity information which relates with an object past record server. The hazard where measurement analysis result the leader for electronic interference does not occur consequently together from with verification test the power level which is received from the antenna grade where it stands must maintain minimum -55dBm and the electronic interference will not occur with the fact that, antenna and reel his recognition distance the maximum 7m until the recognition which is possible but smooth hazard it must stand and and with the fact that it will do from within and and and 3-4m it must be used Jig it is thought.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.10
• /
• pp.39-46
• /
• 1999

In this paper, we propose new hardware architecture of a fast searcher for an initial code acquisition in wideband CDMA wireless local loop systems. The proposed searcher uses double-dwell serial search algorithm and has N active correlators for the high performance code acquisition. Since the N active correlators are designed with pipelined architecture, it is possible to reduce the hardware complexity with only one energy calculation. Our architecture is designed using VHDL to meet wideband CDMA wireless local loop standard and verified under JTC wideband channels. Average code acquisition time of the proposed fast searcher which has 16 correlators is about 40 seconds in case of initial installation and 0.16 seconds when a base station is known. The verified fast searcher is synthesized with in $0.6\mu\textrm{m}$ LG library. The synthesized searcher has 15.8K rates when the number of 4he correlators is 16.

• Journal of The Korean Association of Information Education
• /
• v.20 no.4
• /
• pp.333-340
• /
• 2016

When elementary students write their own sentences, it is often educationally beneficial to compare them with other people's similar sentences. However, it is impractical for use in most classrooms, because it is burdensome for teachers to look up all of the sentences written by students. To cope with this problem, we propose a novel approach for automatic selection of similar sentences based on a three-step process: 1) extracting the subword units from the word-level sentences, 2) training the model with the encoder-decoder architecture, and 3) using the approximate k-nearest neighbor search algorithm to find the similar sentences. Experimental results show that the proposed approach achieves the accuracy of 75% for our test data.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.751-756
• /
• 2003

Ant Colony Optimization (ACO) is new meta heuristics method to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was firstly proposed for tackling the well known Traveling Salesman Problem (TSP) . In this paper, we introduce Multi Colony Ant Model that achieve positive interaction and negative interaction through Intensification and Diversification to improve original ACS performance. This algorithm is a method to solve problem through interaction between ACS groups that consist of some agent colonies to solve TSP problem. In this paper, we apply this proposed method to TSP problem and evaluates previous method and comparison for the performance and we wish to certify that qualitative level of problem solution is excellent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1197-1205
• /
• 2007

An adaptive K-best detection scheme is proposed for MIMO systems. The proposed scheme changes the number of survivor paths, K based on the degree of the reliability of Zero-Forcing (ZF) estimates at each K-best step. The critical drawback of the fixed K-best detection is that the correct path's metric may be temporarily larger than K minimum paths metrics due to imperfect interference cancellation by the incorrect ZF estimates. Based on the observation that there are insignificant differences among path metrics (ML distances) when the ZF estimates are incorrect, we use the ratio of the minimum ML distance to the second minimum as a reliability indicator for the ZF estimates. So, we adaptively select the value of K according to the ML distance ratio. It is shown that the proposed scheme achieves the significant improvement over the conventional fixed K-best scheme. The proposed scheme effectively achieves the performance of large K-best system while maintaining the overall average computation complexity much smaller than that of large K system.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.181-190
• /
• 2004

The docking and in silico ligand screening procedures can select small sets of lead -like candidates from large libraries of either commercially or synthetically available compounds; however, the vast number of such molecules make the potential size of this task enormous. To accelerate the discovery of drugs to inhibit several targets, we have exploited massively distributed computing to screen compound libraries virtually. The Korea@HOME project was launched in Feb. 2002, and one year later, more than 1200 PC's have been recruited. This has created a 31 -gigaflop machine that has already provided more than 1400 hours of CPU time. It has all owed databases of millions of compounds to be screened against protein targets in a matter of days. Now, the virtual screening software suitable for distributed environments is developed by BMD. It has been evaluated in terms of the accuracy of the scoring function and the search algorithm for the correct binding mode.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.4
• /
• pp.630-648
• /
• 1992

The minimum weight design for simply-supported isotropic or symmetrically laminated stiffened cylindrical shells subjected to various loads (axial compression or combined loads) is studied by a nonlinear mathematical search algorithm. The minimum weight design in accomplished with the CONMIN optimizer by Vanderplaats. Several types of buckling modes with maximum allowable stresses and strains are included as constraints in the minimum weight design process, such as general buckling, panel buckling with either stingers or rings smeared out, local skin buckling, local crippling of stiffener segments, and general, panel and local skin buckling including stiffener rolling. The approach allows the consideration of various shapes of stiffening members. Rectangular, I, or T type stringers and rectangular rings are used for stiffened cylindrical shells. Several design examples are analyzed and compared with those in the previous literatures. The unstiffened glass/epoxy, graphite/epoxy(T300/5208), and graphite/epoxy aluminum honeycomb cylindrical shells and stiffened graphite/epoxy cyindrical shells under axial compression are analyzed through the present approach.