• The Journal of the Acoustical Society of Korea
• /
• v.30 no.5
• /
• pp.265-272
• /
• 2011

In most of the ISF (or LSF) based real time speech codec, SVQ (split vector quantization) method is used to decrease the quantizer complexity and memory size of codebook. However, it produces drawback that the level of correlation between code vectors can not be used during vector splits. This paper presents a new method of adaptive ISF vector quantization, which compensates the drawbacks of SVQ structured quantizer for wideband speech codec. In each different frame, the proposed method makes use of the correlation between splitted vectors by adaptively changing codebook distribution according to ordering property of ISF. The algorithm is evaluated in AMR-WB, and shows about 1.5 bit per frame improvement.

• Journal of Practical Engineering Education
• /
• v.12 no.1
• /
• pp.41-47
• /
• 2020

This study aims to investigate effects of brain-based learning. 27 primary studies were selected through rigorous search process and analyzed through meta-analytic methods. Research findings are as follows. First, the total effect size was .67. Second, the effect of dependent variables was academic achievement, cognitive domain, and affective domain in order. Third, with respect to types of cognitive domain, the effect was self-regulation, creativity, competence, communication, and research ability in order. Fourth, the effect of affective domains was sociality, learning interest, and subject attitude in order. Fifth, regarding development of cognitive ability, the effect size was combined, brain training, learning environments, and right brain activities in order. Sixth, the effect of learning activities was memory improvement and attention enhancement in order.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10B
• /
• pp.630-638
• /
• 2005

As real-time media applications based on IP multicast networks spread widely, the end-to-end QoS (quality of service) provisioning for these applications have become very important. To guarantee the end-to-end QoS of multi-party media applications, it is essential to monitor the time-varying status of both network metrics (i.e., delay, jitter and loss) and system metrics (i.e., CPU and memory utilization). In this paper, targeting the multicast-enabled AG (Access Grid) group collaboration tool based on multi-Party real-time media services, a hybrid monitoring scheme that can monitor the status of both multicast network and node system is investigated. It combines active monitoring and passive monitoring approaches to measure multicast network. The active monitoring measures network-layer metrics (i.e., network condition) with probe packets while the passive monitoring checks application-layer metrics (i.e., user traffic condition by analyzing RTCP packets). In addition, it measures node system metrics from system API. By comparing these hybrid results, we attempt to pinpoint the causes of performance degradation and explore corresponding reactions to improve the end-to-end performance. The experimental results show that the proposed hybrid monitoring can provide useful information to coordinate the performance improvement of multi-party real-time media applications.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.710-718
• /
• 2000

Many multiprocessing systems have been developed to exploit the parallelism and to improve the performance. However, the naive multiprocessing schemes were not successful as many researchers thought, due to the heavy cost of communication and synchronization resulting from parallelization. In this paper, we will identify the reasons for the poor performance and the compiler requirements for the performance improvement. We realized that the decisions for multiprocessing should be derived by the overhead information. We applied this idea to the automatic parallelizing compiler, SUIF. We substituted the original backend of SUIF with our backend using MPI, and gave it the capability to validate parallelization decisions based on overhead parameters. This backend converts the intermediate code containing spacification of parallelizable regions into the distributed-memory based parallel program with MPI function calls without excessive parallelization that may cause performance degradation.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.522-529
• /
• 2015

Ever since the R-tree was proposed to index multi-dimensional data, many efforts have been made to improve its query performances. One common trend to improve query performance is to parallelize query processing with the use of multi-core architectures. To this end, a GPU-base R-tree has been recently proposed. However, even though a GPU-based R-tree can exhibit an improvement in query performance, it is limited in its ability to handle large volumes of data because GPUs have limited physical memory. To address this problem, we propose MGR-tree (Multi-GPU R-tree), which can manage large volumes of data by dividing nodes into multiple GPUs. Our experiments show that MGR-tree is up to 9.1 times faster than a sequential search on a GPU and up to 1.6 times faster than a conventional GPU-based R-tree.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.469-480
• /
• 2008

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. To reduce the number of disk accesses, each node caches database pages in its memory buffer. Since a particular page may be cached simultaneously in different nodes, cache consistency should be maintained to ensure that nodes can always access the most recent version of database pages. Most cache consistency schemes proposed in the SD cluster adopted LRU as a buffer replacement algorithm. In this paper, we first present four buffer replacement algorithms that consider the characteristics of the SD cluster. Then we compare the performance of the buffer replacement algorithms. We perform the experiments on a variety of cluster configurations and database workloads. The experiment results show that the proposed algorithms achieve performance improvement up to 5 times of LRU algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

• The Journal of Korean Physical Therapy
• /
• v.30 no.5
• /
• pp.193-198
• /
• 2018

Purpose: The purpose of this study was to analysis of effectiveness between cognitive function assessment scores and gaming cognitive rehabilitation system in children with intellectual impairment. Methods: Five children (male=5, $age=10.00{\pm}0.80$) with intellectual impairment participated in this study and were randomly assigned to the experiment that played (received) gaming cognitive rehabilitation system (Neuroworld). The children were applied 2 times a week for 30 minutes during 3 months. The children were assessed K-WSIC-VI (Korean-Wechsler intelligence scale for children-fourth edition) and recorded that gained score in gaming cognitive rehabilitation system before and after intervention. K-WSIC-VI contained five primary index scores: verbal comprehension index, visual spatial index, fluid reasoning index, working memory index, and processing speed index. Gaming cognitive rehabilitation system scoring was composed visual recall, target recall, sequence recall, selective attention, continuous attention, and exploration. Results: In the intelligence quotient (IQ) of K-WSIC-VI, there were significant increased in all children. The visual recall item was highest effective in all children. However, sequential recall showed the lowest improvement in all children. The performance speed of selective attention item was decreased, this means that children's skills have improved. Also, their ability to explore has improved significantly. Conclusion: In conclusion, gaming cognitive rehabilitation system was significant effectiveness in cognitive function in some categories for children with intellectual impairment. However, the visual recall and performance speed don't represent of all cognitive function. Therefore, further studies will need to verify by applying more subject and longer duration.

• Journal of Sericultural and Entomological Science
• /
• v.42 no.2
• /
• pp.120-125
• /
• 2000

This study was designed to investigate the effects of silk fibroin (Mw 500) powder (SFP) on lipofuscin, acetylcholine (ACh) and its related enzyme activities in brain of rats. Sprague-Dawley (SD) male rats (160$\pm$10 g) were fed basic diet (control group), and experimental diets (SFP-2.5 and SFp-5.0 groups) added 2.5 and 5.0 g/kg BW/day for 6 weeks. In case of liver membranes, lipofuscin (LF) levels resulted in a considerable decreases (11.5% and 13.8%, respectively) in SFP-2.5 and SFP-5.0 groups compared with control group. But in case of brain as the most sensitive organ, LF levels were remarkably inhibited about 18.3% and 21.7% in SFP-2.5 and SFP-5.0 groups compared with control group. Acetylcholine (ACh) levels were considerable decrease (3.0% and 9.2%, respectively) in brain membranes of SFP-2.5 and SFP-5.0 groups compared with control group. choine acetyltranferase (ChAT) activities as a synthesis enzyme of ACh, and acetylcholinesterase (AChE) activities as a hydrolysis enzyme resulted in a slight increases (2.4% and 3.0%, 4.6% and 6.3%, respectively), but significance difference between ChAT and AChE activities by SFP administration could be not obtained. Monoamine oxidase-B (MAO-B) activities were significantly inhibited (9.5% and 12.6%, respectively) in brain of SEP-2.5 and SFP-5.0 groups compared with control group. These results suggest that inhibiting effects of LF accumulation and MAO-B activity of silk fibroin(SFP) may play a pivotal role in protecting learning memory impairments by attenuating a various age-related changes for improvement of brain function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9B
• /
• pp.914-922
• /
• 2009

In this paper, we propose a matrix based real-time pattern matching method, called MDPI, for real-time intrusion detection on several Gbps network traffic. Particularly, in order to minimize a kind of overhead caused by buffering, reordering, and reassembling under the circumstance where the incoming packet sequence is disrupted, MDPI adopts independent partial matching in the case dealing with pattern matching matrix. Consequently, we achieved the performance improvement of the amount of 61% and 50% with respect to TCAM method efficiency through several experiments where the average length of the Snort rule set was maintained as 9 bytes, and w=4 bytes and w=8bytes were assigned, respectively, Moreover, we observed the pattern scan speed of MDPI was 10.941Gbps and the consumption of hardware resource was 5.79LC/Char in the pattern classification of MDPI. This means that MDPI provides the optimal performance compared to hardware complexity. Therefore, by decreasing the hardware cost came from the increased TCAM memory efficiency, MDPI is proven the cost effective high performance intrusion detection technique.