• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.111-118
• /
• 2021

Banking systems are sensitive to data privacy since users' data, if not well protected, may be used to perform fake transactions. Blockchains, public and private, are frequently used in such systems thanks to their efficiency and high security. Public blockchains fail to fully protect users' data, despite their power in the accuracy of the transactions. The private blockchain is better used to protect the privacy of the sensitive data. They are not open and they apply authorization to login into the blockchain. However, they have a lower security compared to public blockchain. We propose in this paper a hybrid public-private architecture that profits from network virtualization. The main novelty of this proposal is the use of network virtualization that helps to reduce the complexity and efficiency of the computations. Simulations have been conducted to evaluate the performance of the proposed solution. Findings prove the efficiency of the scheme in reducing complexity and enhancing data privacy by guarantee high security. The contribution conducted by this proposal is that the results are verified by the centralized controller that ensures a correct validation of the resulted blockchains. In addition, computation complexity is to be reduced by profiting from the cooperation performed by the virtual agents.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2001.10a
• /
• pp.13.1-13
• /
• 2001

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.565-568
• /
• 2003

This paper presents a method that can be used to reduce the decoding computational complexity in turbo codes. To reduce the decoding complexity we proposed an adaptive sliding window method which control the learning period of Viterbi sliding window method depending on channel signal to interference ratio (SIR). When received signal to interference ratio (SIR) is relatively high, we can reduce the decoding complexity without a noticeable degradation of BER performance at CDMA cellular system with power control error.

• Journal of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.225-236
• /
• 2009

The equicontinuity and scattering properties of continuous semi-flows are studied on a compact metric space. The main results are obtained as follows: first, the complexity function defined by the spanning set is bounded if and only if the system is equicontinuous; secondly, if a continuous semi-flow is topologically weak mixing, then it is pointwise scattering; thirdly, several equivalent conditions for the time-one map of a continuous semi-flow to be scattering are presented; Finally, for a minimal continuous map it is shown that the "non-dense" requirement is unnecessary in the definition of scattering by using open covers.

• 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 Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1607-1616
• /
• 2006

The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.310-319
• /
• 2012

Next generation wireless receivers demand low computational complexity algorithms with high computing power in order to perform fast signal detections and error estimations. Several signal detection and estimation algorithms have been proposed for next generation wireless receivers which are primarily designed to provide reasonable performance in terms of signal to noise ratio (SNR) and bit error rate (BER). However, none of them have been chosen for direct implementation as they offer high computational complexity with relatively lower computing power. This paper presents a low-complexity power-efficient algorithm that improves the computing power and provides relatively faster signal detection for next generation wireless multiuser receivers. Measurement results of the proposed algorithm are provided and the overall system performance is indicated by BER and the computational complexity. Finally, in order to verify the low-complexity of the proposed algorithm we also present a formal mathematical proof.

• Archives of design research
• /
• v.14 no.1
• /
• pp.111-118
• /
• 2001

The primary purpose of this research is to identify effects of the complexity levels of visual factors on user's communication in the web-sites. In this study, six complexity levels of visual factors were manipulated with four items(graphics, moving graphics, size and links) to test communication effects. As a result, user's communication was influenced by the complexity of illustration. This result shows that web sites with moderate levels of illustration complexity are more preferred than with complex or simple levels of visual complexity.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.151-161
• /
• 2009

In this paper, we propose an adaptive multiview video coding scheme based on spatiotemporal correlation analyses using hierarchical B picture (AMVC-HBP) for the integrative encoding performances, including high compression efficiency, low complexity, fast random access, and view scalability, by integrating multiple prediction structures. We also propose an in-coding mode-switching algorithm that enables AMVC-HBP to adaptively select a better prediction structure in the encoding process without any additional complexity. Experimental results show that AMVC-HBP outperforms the previous multiview video coding scheme based on H.264/MPEG-4 AVC using the hierarchical B picture (MVC-HBP) on low complexity for 21.5%, on fast random access for about 20%, and on view scalability for 11% to 15% on average. In addition, distinct coding gain can be achieved by AMVC-HBP for dense and fast-moving sequences compared with MVC-HBP.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.54-60
• /
• 2021

Monte-Carlo GO is a computer GO program that is sufficiently competent without using knowledge expressions of IGO. Although it is computationally intensive, the computational complexity can be reduced by properly pruning the IGO game tree. Here, I achieve this by using a potential model based on the knowledge expressions of IGO. The potential model treats GO stones as potentials. A specific potential distribution on the GO board results from a unique arrangement of stones on the board. Pruning using the potential model categorizes legal moves into effective and ineffective moves in accordance with the potential threshold. Here, certain pruning strategies based on potentials and potential gradients are experimentally evaluated. For different-sized boards, including an official-sized board, the effects of pruning strategies are evaluated in terms of their robustness. I successfully demonstrate pruning using a potential model to reduce the computational complexity of GO as well as the robustness of this effect across different-sized boards.