• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.1
• /
• pp.47-52
• /
• 2010

The low power of ultra-wideband (UWB) signal makes the acquisition of UWB signal be a more challenging task. In this paper, we propose the method of high order template signal technique that reduces the synchronization time. Experimental results are presented to show the improvements of performance in the mean acquisition time (MAT) and the probability of detection. The performance compared with the serial search, the truly random search and the random permutation search. It is shown that over typical UWB multipath channels, a random permutation search scheme may yield lower MAT than serial search.

• Communications for Statistical Applications and Methods
• /
• v.23 no.2
• /
• pp.105-117
• /
• 2016

In the paper, as a sequence of the first tutorial, we discuss sufficient dimension reduction methodologies used to estimate central subspace (sliced inverse regression, sliced average variance estimation), central mean subspace (ordinary least square, principal Hessian direction, iterative Hessian transformation), and central $k^{th}$-moment subspace (covariance method). Large-sample tests to determine the structural dimensions of the three target subspaces are well derived in most of the methodologies; however, a permutation test (which does not require large-sample distributions) is introduced. The test can be applied to the methodologies discussed in the paper. Theoretical relationships among the sufficient dimension reduction methodologies are also investigated and real data analysis is presented for illustration purposes. A seeded dimension reduction approach is then introduced for the methodologies to apply to large p small n regressions.

• Communications for Statistical Applications and Methods
• /
• v.23 no.6
• /
• pp.563-574
• /
• 2016

In this study, we propose several simultaneous tests to detect the difference between means and variances for the two-sample problem when the underlying distribution is normal. For this, we apply the likelihood ratio principle and propose a likelihood ratio test. We then consider a union-intersection test after identifying the likelihood statistic, a product of two individual likelihood statistics, to test the individual sub-null hypotheses. By noting that the union-intersection test can be considered a simultaneous test with combination function, also we propose simultaneous tests with combination functions to combine individual tests for each sub-null hypothesis. We apply the permutation principle to obtain the null distributions. We then provide an example to illustrate our proposed procedure and compare the efficiency among the proposed tests through a simulation study. We discuss some interesting features related to the simultaneous test as concluding remarks. Finally we show the expression of the likelihood ratio statistic with a product of two individual likelihood ratio statistics.

• Journal of the Korean Statistical Society
• /
• v.29 no.4
• /
• pp.423-433
• /
• 2000

In this paper, we consider applying the bootstrap method to the median test procedures for right censored data. For doing this, we show that the median test statistics can be represented by the differences of two sampler medians. Then we review to the re-sampling methods for censored dta and propose the test procedures under the location translation assumption and Behrens-Fisher problem. Also we compare our procedures with other re-sampling method, which is so-called permutation test through an example. Finally we show the validity of bootstrap median test procedure in the appendix.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.10
• /
• pp.27-35
• /
• 2021

Local search has been used to solve various combinatorial optimization problems. One of the most important factors in local search is the method of generating a neighbor solution. In this paper, we propose neighbor generation strategies of local search for permutation-based combinatorial optimization, and compare the performance of each strategies targeting the traveling salesman problem. In this paper, we propose a total of 10 neighbor generation strategies. Basically, we propose 4 new strategies such as Rotation in addition to the 4 strategies such as Swap which have been widely used in the past. In addition, there are Combined1 and Combined2, which are made by combining basic neighbor generation strategies. The experiment was performed by applying the basic local search, but changing only the neighbor generation strategy. As a result of the experiment, it was confirmed that the performance difference is large according to the neighbor generation strategy, and also confirmed that the performance of Combined2 is the best. In addition, it was confirmed that Combined2 shows better performance than the existing local search methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.2
• /
• pp.183-191
• /
• 2023

Cryptographic algorithms require extensive computational resources and rely on complex mathematical principles for security. However, IoT devices have limited resources, leading to insufficient computing power. As a result, lightweight cryptography has emerged, which uses fewer computational resources. NIST organized a competition to standardize lightweight cryptography and TinyJAMBU, one of the algorithms in the competition, is a permutation-based algorithm that repeats many permutation operations. In this paper, we implement TinyJAMBU on an 8-bit AVR processor with a proposedtechnique that includes a reverse shift method and precomputing some operations in a fixed key and nonce environment. Our techniques showed a maximum performance improvement of 7.03 times in permutation operations and 5.87 times in the TinyJAMBU algorithm, improving up to 9.19 times in a fixed key and nonce environment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.13-18
• /
• 1986

This paper is concerned with flow-shop permutation scheduling problem. This paper presents an algorithm for the minimum makespan sequence. The efficiency of proposed algorithm is demonstrated by comparisons with the existing algorithms: Johnson's, branch & bound method, and heuristic algorithms. The proposed algorithm is more effective than the other algorithms. A numerical example is given to illustrate the procedure.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.195-197
• /
• 1987

A new method of model reduction, based on the differentiation of polynomials, is Introduced by Gutman(1982). Without the reciprocal transformation, and the differentiation of the numerator and denominator polynomials of the transfer function, used by Gutman, the lower-order system can be obtained by the permutation of the order of numerator and denominator and the number of differentiation.

• The Korean Journal of Applied Statistics
• /
• v.25 no.2
• /
• pp.269-277
• /
• 2012

In microarray data analysis, recent efforts have focused on the discovery of gene sets from a pathway or functional categories such as Gene Ontology terms(GO terms) rather than on individual gene function for its direct interpretation of genome-wide expression data. We introduce a meta-analysis method that combines $p$-values for changes of each gene in the group. The method measures the significance of overall treatment-induced change in a gene group. An application of the method to a real data demonstrates that it has benefits over other statistical methods such as Fisher's exact test and permutation methods. The method is implemented in a SAS program and it is available on the author's homepage(http://cafe.daum.net/go.analysis).

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.641-652
• /
• 2016

This paper proposes a method to generate test scripts in an automatic manner, based on checklist used for testing embedded systems in the fields. The proposed method can reduce the mistakes which may be introduced during manual generation. In addition, it can generate test scripts to test various mode combinations, which is not possible to be tested by the typical checklist. The test commands in a checklist are transformed into a test script suit referencing the signal values defined in a test command dictionary. In addition, the method to generate test scripts in sequential, double permutation and random manners is proposed useful to test the inter-operations between modes, a series of operations for a specific behavior. The proposed method is implemented and the feasibility is shown through the experiments.