• Journal of Korean Medical Ki-Gong Academy
• /
• v.22 no.1
• /
• pp.1-27
• /
• 2023

Objective : This paper provides a narrative review of the research literature on the neurophysiological and neurochemical mechanisms of local vibration while studying the treatment principles and mechanisms of Whidam's vibrator Sugi therapy. Methods : Searches related to vibration therapy research were conducted in PUBMED using "Vibration", "Whole Body Vibration", "Localized Vibration", and "Focal Vibration". The Conditions were limited to review and systematic review. Results : Roberto Casale's paper was selected as an inquiry task and reviewed critically and narratively by referring to other papers. The stimulation process of local vibration (LV) was broadly classified into receptor transmission (pain reception phase), ascending sensory pathway to the spinal cord (segmental phase), and action of the cortex and subcortical structures (systemic control phase) according to the pain pathway. In addition, the role of C-tactile mechanoreceptors, changes in neurotransmitters and neurohormones, LV stimulation below perception threshold (lower threshold), pain control and kinesiologic illusions were specially addressed. In addition, the expression and function of Piezo Channels were added to supplement the human pain and tactile sensing mechanism. Conclusions : LV exerts pain control mechanisms through different interactions that can interfere with pain transmission and pain perception. Since LV provides sufficient neurophysiological reasons for clinical application, it is necessary to expand the use of Whidam's vibrator Sugi therapy to a wider range of clinical applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3050-3063
• /
• 2023

Recommendation systems provide personalized products or services to online users by mining their past preferences. Collaborative filtering is a popular recommendation technique because it is easy to implement. However, with the rapid growth of the number of users in recommendation systems, collaborative filtering suffers from serious scalability and sparsity problems. To address these problems, a novel collaborative filtering recommendation algorithm is proposed. The proposed algorithm partitions the users using affinity propagation clustering, and searches for k nearest neighbors in the partition where active user belongs, which can reduce the range of searching and improve real-time performance. When predicting the ratings of active user's unrated items, mean deviation method is used to impute values for neighbors' missing ratings, thus the sparsity can be decreased and the recommendation quality can be ensured. Experiments based on two different datasets show that the proposed algorithm is excellent both in terms of real-time performance and recommendation quality.

• Phonetics and Speech Sciences
• /
• v.1 no.4
• /
• pp.73-84
• /
• 2009

Despite the growing interest among researchers in the field of second language (L2) phonological acquisition and its apparent contribution to linguistic and acquisition theories, there have been concerns about the lack of pedagogical application of the research findings in L2 classrooms (Levis, 1999, Derwing & Munro, 2005). Based on the belief that meeting an existing pedagogic need is something that should receive primary attention in SLA, this study attempts to bridge the gap between L2 pronunciation research and pronunciation pedagogy. In so doing, this study provides a narrative literature review of papers on L2 pronunciation published from 1994 to 2008 in Korea. The articles for review were retrieved from five database search engines. In addition, six journals where relevant articles most frequently appeared were selected and electronic searches of these six journals were conducted. A total of 117 articles which met the selection criteria were collected, and were reviewed to answer the following three research questions: a) What are the current research trends in L2 pronunciation in Korea? b) Do the research trends reflect a shift of focus on L2 pronunciation teaching? and c) What is the range of research practices in L2 pronunciation? The review of the papers indicates that the number of studies on L2 pronunciation increased sharply from 1999 to 2003. Some changes in research topics were also noticed. Research on segmental features of English was dominant from 1994 to 1998, but became more balanced with research on suprasegmentals from 2004 to 2008. This review also discusses the range of research practices in L2 pronunciation and makes suggestions for future directions in L2 pronunciation research.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1247-1253
• /
• 2015

An inverted index structure is widely used for efficient string similarity search. One of the main requirements of similarity search is a fast response time; to this end, most techniques use an in-memory index structure. Since the size of an inverted index structure usually very large, however, it is not practical to assume that an index structure will fit into the main memory. To alleviate this problem, we propose a novel technique that reduces the size of an inverted index. In order to reduce the size of an index, the proposed technique rearranges data strings so that the data strings containing the same q-grams can be placed close to one other. Then, the technique encodes those multiple strings into a range. Through an experimental study using real data sets, we show that our technique significantly reduces the size of an inverted index without sacrificing query processing time.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.4
• /
• pp.184-190
• /
• 2006

Recently, Lee et al. have proposed an algorithm utilizing the signals from different paths by using bottom mounted simple linear array to estimate 3-D location of oceanic target. But this algorithm assumes that sound velocity is constant along depth of sea. Consequently, serious performance loss is appeared in real oceanic environment that sound speed is changed variously. In this paper, we present a 3-D near field localization algorithm for inhomogeneous sound speed. The proposed algorithm adopt localization function that utilize ray propagation model for multipath environment with linear sound speed profile(SSP), after that, the proposed algorithm searches for the instantaneous azimuth angle, range and depth from the localization cost function. Several simulations using linear SSP and non linear SSP similar to that of real oceans are used to demonstrate the performance of the proposed algorithm. The estimation error in range and depth is decreased by 100m and 50m respectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.9
• /
• pp.243-250
• /
• 2021

Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.139-145
• /
• 2012

Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot $P_0$ and continually divides into 2. This method searches the minimum value $L$ and maximum value $H$ in the length n of list $A$. Then compute the initial pivot key $P_0=(H+L)/2$ and swaps $a[i]{\geq}P_0$,$a[j]<P_0$ until $i$=$j$ or $i$>$j$. After the swap, the length of list $A_0$ separates in two lists $a[1]{\leq}A_1{\leq}a[j]$ and $a[i]{\leq}A_2{\leq}a[n]$ and the pivot values are selected by $P_1=P_0/2$, $P_2=P_0+P_1$. This process repeated until the length of partial list is two. At the length of list is two and $a$[1]>$a$[2], swaps as $a[1]{\leftrightarrow}a[2]$. This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity $O(n^2)$ to $O(n{\log}n)$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.5
• /
• pp.107-112
• /
• 2020

Recently, unstructured data is rapidly being produced based on web-based services. NoSQL systems and key value stores that process unstructured data as key and value pairs are widely used in various applications. In this paper, a study was conducted on a skip list used for in-memory data management in an LSM-tree based key value store. The skip list used in the key value store is an insertion-based skip list that does not allow overwriting and processes all changes only by inserting. This behavior can support Multi-Version Concurrency Control (MVCC), which can simultaneously process multiple read/write requests through snapshot isolation. However, since duplicate keys exist in the skip list, the performance significantly degrades due to unnecessary node visits during a list traverse. In particular, serious overhead occurs when a range query or scan operation that collectively searches a specific range of data occurs. This paper proposes a newly designed Stride SkipList to reduce this overhead. The stride skip list additionally maintains an indexing pointer for the last node of the same key to avoid unnecessary node visits. The proposed scheme is implemented using RocksDB's in-memory component, and the performance evaluation shows that the performance of SCAN operation improves by up to 350 times compared to the existing skip list for various workloads.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.6
• /
• pp.2465-2471
• /
• 2013

This paper develops a travel time prediction algorithm that can be used for real-time application. The algorithm searches for the most similar pattern in historical travel time database as soon as a series of real-time data become available. Artificial neural network approach is then taken to forecast travel time in the near future. To examine the performance of this algorithm, travel time data from Gyungbu Highway were obtained and the algorithm is applied. The evaluation shows that the algorithm could predict travel time within 4% error range if comparable patterns are available in the historical travel time database. This paper documents the detailed algorithm and validation procedure, thereby furnishing a key to generating future travel time information.

• Journal of Power Electronics
• /
• v.17 no.2
• /
• pp.476-489
• /
• 2017

Under partial shading conditions (PSCs), multiple maximums may be exhibited on the P-U curve of string inverter photovoltaic (PV) systems. Under such conditions, heuristic methods are invalid for extracting a global maximum power point (GMPP); intelligent algorithms are time-consuming; and model-based methods are complex and costly. To overcome these shortcomings, a novel hybrid MPPT (MPF-IP&O) based on a model-based peak forecasting (MPF) method and an improved perturbation and observation (IP&O) method is proposed. The MPF considers the influence of temperature and does not require solar radiation measurements. In addition, it can forecast all of the peak values of the PV string without complex computation under PSCs, and it can determine the candidate GMPP after a comparison. Hence, the MPF narrows the searching range tremendously and accelerates the convergence to the GMPP. Additionally, the IP&O with a successive approximation strategy searches for the real GMPP in the neighborhood of the candidate one, which can significantly enhance the tracking efficiency. Finally, simulation and experiment results show that the proposed method has a higher tracking speed and accuracy than the perturbation and observation (P&O) and particle swarm optimization (PSO) methods under PSCs.