• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• Science of Emotion and Sensibility
• /
• v.8 no.1
• /
• pp.63-74
• /
• 2005

This research basically defines that relationship among simplicity/complexity, other product aesthetics and consumer preference. The goal of this research is to find answer 'How much the simplicity/complexity influence expressed functional shapes on products?' and 'What is relationship between simplicity/complexity and consumer preference?' This is process that first we make categorize products by analysis, and second we analyze each category group for fading propensity from consumers, and finally we verify through design process.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.3
• /
• pp.427-435
• /
• 2015

This paper presents a high-throughput low-complexity decoder architecture and design technique to implement successive-cancellation (SC) polar decoding. A novel merged processing element with a one's complement scheme, a main frame with optimal internal word length, and optimized feedback part architecture are proposed. Generally, a polar decoder uses a two's complement scheme in merged processing elements, in which a conversion between two's complement and sign-magnitude requires an adder. However, the novel merged processing elements do not require an adder. Moreover, in order to reduce hardware complexity, optimized main frame and feedback part approaches are also presented. A (1024, 512) SC polar decoder was designed and implemented using 40-nm CMOS standard cell technology. Synthesis results show that the proposed SC polar decoder can lead to a 13% reduction in hardware complexity and a higher clock speed compared to conventional decoders.

• Korean Journal of Applied Biomechanics
• /
• v.29 no.4
• /
• pp.247-254
• /
• 2019

Objective: The goal of this study was to determine the center of pressure (CoP) complexity pattern in approximate entropy technique between genders at different conditions of running speed. Background: It is conducted to evaluate the complexity pattern of CoP in the increment of running speed to have insights to injury prediction, stability, and auxiliary aids for the foot. Method: Twenty men (age=22.3±1.5 yrs.; height=176.4±5.4 cm; body weight=73.9±8.2 kg) and Twenty women (age=20.8±1.2 yrs.; height=162.8±5.2 cm; body weight=55.0±6.3 kg) with heel strike pattern were recruited for the study. While they were running at 2.22, 3.33, 4.44 m/s speed on a treadmill (instrumented dual belt treadmills, USA) with a force plate, CoP data were collected for the 10 strides. The complexity pattern of the CoP was analyzed using the ApEn technique. Results: The ApEn of the medial-lateral and antero-posterior CoP in the increment of running speed showed significantly difference within genders (p<.05), but there were not statistically significant between genders at all conditions of running speed. Conclusion: Based on the results of this study, CoP complexity pattern in the increment of running speed was limited to be characterized between genders as an indicator to judge the potential injury and stability. Application: In future studies, it is needed to investigate the cause of change for complexity of CoP at various running speed related to this study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1702-1721
• /
• 2019

A workflow process (or business process) management system helps to define, execute, monitor and manage workflow models deployed on a workflow-supported enterprise, and the system is compartmentalized into a modeling subsystem and an enacting subsystem, in general. The modeling subsystem's functionality is to discover and analyze workflow models via a theoretical modeling methodology like ICN, to graphically define them via a graphical representation notation like BPMN, and to systematically deploy those graphically defined models onto the enacting subsystem by transforming into their textual models represented by a standardized workflow process definition language like XPDL. Before deploying those defined workflow models, it is very important to inspect its syntactical correctness as well as its structural properness to minimize the loss of effectiveness and the depreciation of efficiency in managing the corresponding workflow models. In this paper, we are particularly interested in verifying very large-scale and massively parallel workflow models, and so we need a sophisticated analyzer to automatically analyze those specialized and complex styles of workflow models. One of the sophisticated analyzers devised in this paper is able to analyze not only the structural complexity but also the data-sequence complexity, especially. The structural complexity is based upon combinational usages of those control-structure constructs such as subprocesses, exclusive-OR, parallel-AND and iterative-LOOP primitives with preserving matched pairing and proper nesting properties, whereas the data-sequence complexity is based upon combinational usages of those relevant data repositories such as data definition sequences and data use sequences. Through the devised and implemented analyzer in this paper, we are able eventually to achieve the systematic verifications of the syntactical correctness as well as the effective validation of the structural properness on those complicate and large-scale styles of workflow models. As an experimental study, we apply the implemented analyzer to an exemplary large-scale and massively parallel workflow process model, the Large Bank Transaction Workflow Process Model, and show the structural complexity analysis results via a series of operational screens captured from the implemented analyzer.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.296-296
• /
• 1999

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.10a
• /
• pp.36-48
• /
• 1994

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.4
• /
• pp.499-506
• /
• 2012

In this paper, we analyze the effects of phase noise and frequency offset that cause performance degradation. Basically, we like to propose reduced PNFS(Phase Noise and Frequency offset Suppression) algorithm. The OFDM system is seriously affected by ICI component such as phase noise, frequency offset and Doppler effects. Especially, complicated processing algorithm with high complexity was required it in order to compensate those ICI components. So, we propose PNFS algorithm that can decrease complexity and compensate ICI components. We propose a method decreased complexity by approximation of parameters that affect slightly performance change and compare the quantity of conventional and revised PNFS algorithm. Also, simulation shows that BER performance of revised PNFS algorithm can be improved slightly.

• Korean Journal of Applied Biomechanics
• /
• v.29 no.2
• /
• pp.113-119
• /
• 2019

Objective: The purpose of this study was to investigate the effect of the falls on the center of pressure (CoP) complexity during gait using non-linear approximate entropy (ApEn). Method: 20 elderly women with experience of falling ($age=72.55{\pm}5.42yrs$; $height=154.40{\pm}4.26cm$; $body\;weight=57.40{\pm}6.21kg$; $preferred\;gait\;speed=0.52{\pm}0.17m/s$) and 20 elderly women with no experience of falling ($age=71.90{\pm}2.90yrs$; $height=155.28{\pm}4.73cm$; $body\;weight=56.70{\pm}5.241kg$; $preferred\;gait\;speed=0.56{\pm}0.13m/s$) were recruited for the study. While they were walking at their preferred gait speed on a treadmill (instrumented dual belt treadmills, Bertec, USA) with a force plate CoP data were collected for the 20 strides. The complexity of the CoP was analyzed using the ApEn technique. Results: The ApEn of the medial-lateral CoP in the fallers showed smaller about 16% compared to the non-fallers (p<.05). The ApEn of the antero-posterior CoP of the fallers showed smaller about 12% compared to the non-fallers, but the difference was not statistically significant. Conclusion: Based on the results of this study, the reduction of the medio-lateral CoP complexity in the elderly gait would be an index to determine the potential fall.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1837-1860
• /
• 2020

We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.