• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.450-454
• /
• 2015

In this paper, when points with weights are given in a plane, for an arbitrary constant r, we shall find a square area S such that the sum of weights of points belonging to S is maximized. If the length of the side of S is not given, the problem to find arbitrary rectangular area has been studied. In this paper, we will consider the problem to find a square area with a side of a length r when a constant r is given. We will solve the one dimensional problem in dynamic environment and propose an algorithm with the time complexity of O(nlogn+rn).

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.2
• /
• pp.99-105
• /
• 2012

The focus of this paper is a proposal for a computationally efficient dynamic subcarrier allocation (DSA) algorithm for orthogonal frequency-division multiple access (OFDMA) systems. The proposed DSA algorithm considerably reduces the computational complexity and the amount of channel quality information (CQI) compared to amplitude craving greedy (ACG) algorithms, which use full CQI. At the same time, the performance of the proposed algorithm closely appear to ACG algorithms. Moreover, the authors present a new bandwidth-assignment algorithm produced by modifying bandwidth assignment based on the signal-to-noise ratio (BABS). This modified BABS algorithm enables the proposed DSA algorithm to produce a strong outage performance gain over the conventional scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.924-930
• /
• 2015

In this paper, we propose a novel approach of low computational complexity to improve the speech quality of the small acoustic equipment in noisy environment. The conventional gain control algorithm suppresses the noise of input signal, and then the part of wide dynamic range compression (WDRC) amplifies the undesired signal. The proposed algorithm controls the gain of hearing aids according to speech present probability by using the output of a voice activity detection (VAD). The performance of the proposed scheme is evaluated under various noise conditions by using objective measurement and yields superior results compared with the conventional algorithm.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.15-20
• /
• 2012

As Internet protocol and wireless communications have developed, the number of different types of mobile services has increased gradually. Existing priority-computing schemes cannot satisfy the dynamic requirements of supporting multiple services in future wireless communication systems, because the currently used factors, mainly user priority, are relatively simple and lack relevancy. To solve this problem and provide the desired complexity, dynamic behavior, and fairness features of 3G and beyond 3G mobile communication systems, this paper proposes a novel cross-layer dynamic integrated priority-computing scheme that computes the priority based on a variety of factors, including quality of service requirements, subscriber call types, waiting time, movement mode, and traffic load from the corresponding layers. It is observed from simulation results that the proposed dynamic integrated priority scheme provides enhanced performance.

• Physical Therapy Rehabilitation Science
• /
• v.7 no.3
• /
• pp.109-113
• /
• 2018

Objective: The purpose of this study was to investigate the effects of fall experience and task complexity on gait performance in community-dwelling persons with chronic hemiparetic stroke. Design: Cross-sectional study. Methods: Thirty-three persons who had a history of stroke participated in this study. The participants included 18 persons (aged mean 54.0, mean score of 24.6 points on the Montreal Cognitive Assessment, MoCA) with fall experience (faller group) and 15 persons (aged mean 53.7, mean score of 24.7 points on the MoCA) without fall experience (non-faller group) in the previous six months. This study measured balance and gait performance at two different conditions (with/without 70% of water filled in a 200 cc cup). The participants were clinically assessed using the 10-meter walk test (10MWT), 6-minute walk test (6MWT), Berg Balance scale (BBS), Dynamic Gait Index (DGI), and Timed Up-and-Go (TUG) test. Results: After analyzation, persons in the faller group performed significantly better on the 10MWT, 6MWT, BBS, DGI, and the TUG test in the no-cup-carrying condition than those in the cup-carrying condition (p<0.05). The persons in the non-faller group also performed significantly better in all outcome measures with the no-cup-carrying condition than those in the cup-carrying condition (p<0.05). However, there was no interaction between fall experience and task complexity in the two groups. Conclusions: Our results showed that balance and gait performance depended on fall experience and task complexity but fall experience did not interact with task complexity. Clinicians should consider fall prevention and task complexity during therapeutic approaches in persons with hemiparetic stroke.

• Journal of Drive and Control
• /
• v.17 no.1
• /
• pp.44-50
• /
• 2020

For the requirement of accurate tracking control and the safety of physical human-robot interaction, torque control is basically desirable for humanoid robots. Because of the complexity of humanoid robot dynamics, the TDC (time-delay control) is practical because it does not require a dynamic model. However, there occurs a considerable error due to discontinuous non-linearities. To solve this problem, the TDC-FLC (fuzzy logic compensator) is applied to humanoid robots. The applied controller contains three factors: a TDE (time-delay estimation) factor, a desired error dynamic factor, and FLC to suppress the TDE error. The TDC-FLC is easy to execute because it does not require complicated humanoid dynamic calculations and the heuristic fuzzy control rules are intuitive. TDC-FLC is implemented on the whole body of a humanoid, not on biped legs even though it is performed by a virtual humanoid robot. The simulation results show the validity of the TDC-FLC for humanoid robots.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.2
• /
• pp.87-95
• /
• 2003

Dynamic Programming Matching (DPM) is a mathematical optimization technique for sequentially structured problems, which has, over the years, played a major role in providing primary algorithms in pattern recognition fields. Most practical applications of this method in signature verification have been based on the practical implementational version proposed by Sakoe and Chiba [9], and il usually applied as a case of slope constraint p = 0. We found, in this case, a modified version of DPM by applying a heuristic (forward seeking) implementation is more efficient, offering significantly reduced processing complexity as well as slightly improved verification performance.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.428-430
• /
• 2006

This paper proposes a new means of performance optimization for multimedia algorithm utilizing the Microscopic DVS (Dynamic Voltage Scaling). The Microscopic DVS technique controls the operating frequency and the supply voltage levels dynamically according to the processing requirement for each frame of multimedia data. The huffman decoding algorithm of MPEG-2 AAC audio decoder is optimized to maximize the power saving efficiency of Microscopic DVS technique. The experimental results show the reduction of computational complexity by more than 30% and the reduction of power consumption by more than 17% compared with those of the conventionally fast method.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.12
• /
• pp.544-546
• /
• 2006

This paper proposes a new means of performance optimization for multimedia algorithm utilizing the Microscopic DVS (Dynamic Voltage Scaling). The Microscopic DVS technique controls the operating frequency and the supply voltage levels dynamically according to the processing requirement for each frame of multimedia data. The huffman decoding algorithm of MPEG-2 AAC audio decoder is optimized to maximize the power saving efficiency of Microscopic DVS technique. The experimental results show the reduction of computational complexity by more than 30% and the reduction of power consumption by more than 17% compared with those of the conventionally fast method.