• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.1 no.1
• /
• pp.16-28
• /
• 1991

Knapsack public-key cryptosystems are based on the knapsack problem which is NP-complete. aii of the knapsack problem, are known to be insecure. However, the Chor and Rivest knapsack cryptosystem based on arithmetic in finite field is secure against all known cryptosystem based on arithmetic in a finite field is secure against all known cryptanalytic attacks. We suggest a new msthod of attack on knapsack cryptosystem which is based on the relaxation of a quadratic 0-1 integer optimization problem. We show that under certain condirions some bits of the solution of knapsack problem can be determined by using persistency property of linear relaxation. Also we propose a new Chor-Rivest system, this new cryptosystem reduces the number of calculation of discrete logarithms which are necessary for the implemention in a multi-user system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.207-215
• /
• 2015

This paper proposes a solution-yielding linear time algorithm to NP-complete Sudoku, to which no polynomial time algorithm has been proposed. The proposed algorithm is performed on blocks in the descending order of the number of clues they contain. It firstly determines all numbers that could possibly occur in the blank rows and columns of each block. By deriving an intersecting value of corresponding rows and columns, it assigns the final number for each blank. When tested on the traditional $9{\times}9$ Sudoku, the proposed algorithm has succeeded in obtaining the solution through performance of 9 times, the exact number of the blocks. Test results on modified Jigsaw Sudoku (9 blocks) and Hypersudoku (13 blocks) also show its success in deriving the solutions by execuring 9 and 13 times respectively. Accordingly, this paper proves that the Sudoku problem is in fact P-problem.

• Journal of Acupuncture Research
• /
• v.30 no.3
• /
• pp.61-73
• /
• 2013

Objectives : This study was designed to evaluate the effects of Phaseoli Semen Herbal-acupuncture(PS-HA) at $KI_{10}$ in acute nephritis induced by lipopolysaccharide(LPS) in rat. Methods : The rats were divided into 5 groups, which were control, LPS, PS-HA, NP and saline group. LPS, PS-HA, NP and saline groups were given LPS to induce acute nephritis and control group did not receive LPS. LPS group did not receive any treatment after the onset of acute nephritis. PS-HA, NP and saline group received PS-HA, normal acupuncture, and saline injection at $KI_{10}$ three times per week, respectively. To evaluate the effect of PS-HA at $KI_{10}$, the complete blood count, BUN, creatinine, TNF-${\alpha}$, and CINC-1 in serum were measured. To show its effect on renal function, creatinine, and total protein in urine was measured as well as urine output. The level of myeloperoxidase in renal tissue was quantified and complete histology was done in kidney samples obtained from the rats. Results : PS-HA group showed a significant reduction in the proportion of WBC and neutrophil, serum BUN, TNF-${\alpha}$, and CINC-1 compared to LPS group. Furthermore, a significant increase in urine output and a decrease in urinary creatinine level, MPO in renal tissue, and number of neutrophils at glomerulus was observed in PS-HA group compared to LPS group Conclusions : PS-HA at $KI_{10}$ was shown to have a significantly effect on treating LPS induced acute nephrits. Therefore, future study is needed to further evaluate the clinical usefulness of PS-HA at $KI_{10}$ in treating acute nephritis.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.9-14
• /
• 2022

This paper presents a subset sum problem (SSP) algorithm which takes the time complexity of O(nlogn). The SSP can be classified into either super-increasing sequence or random sequence depending on the element of Set S. Additive algorithm that runs in O(nlogn) has already been proposed to and utilized for the super-increasing sequence SSP, but exhaustive Brute-Force method with time complexity of O(n2ⁿ) remains as the only viable algorithm for the random sequence SSP, which is thus considered NP-complete. The proposed subtractive algorithm basically selects a subset S comprised of values lower than target value t, then sets the subset sum less the target value as the Residual r, only to remove from S the maximum value among those lower than t. When tested on various super-increasing and random sequence SSPs, the algorithm has obtained optimal solutions running less than the cardinality of S. It can therefore be used as a general algorithm for the SSP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.165-170
• /
• 2023

This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn²).

• Journal of Power Electronics
• /
• v.16 no.3
• /
• pp.946-959
• /
• 2016

A novel Virtual Space Vector (VSV) modulation strategy for complete control of potential neutral point (NP) issues is proposed in this paper. The neutral point potential balancing problems of multi-level converters, which include elimination of low frequency oscillations and self-balancing for NP dc unbalance, are investigated first. Then a set of improved virtual space vectors with dynamic adjustment factors are introduced and a multi-objective optimization algorithm which aims to optimize these adjustment factors is presented in this paper. The improved virtual space vectors and the multi-objective optimization algorithm constitute the novel Virtual Space Vector modulation. The proposed novel Virtual Space Vector modulation can simultaneously recover NP dc unbalance and eliminate low frequency oscillations of the neutral point. Experiment results show that the proposed strategy has excellent performance, and that both of the neutral point potential issues can be solved.

• Cross-Cultural Studies
• /
• v.52
• /
• pp.393-416
• /
• 2018

Negative Stripping Construction in English involves the disjunction but, the adverb not, and a constituent NP. This construction is an incomplete sentence although it delivers a complete sentential meaning. Interpretation of this construction may be ambiguous in that the constituent NP can either be construed as the subject, or as the complements including the object. To generate such sentences and resolve the issue of ambiguity, we propose a construction-based analysis under direct interpretation approach, rejecting previous analyses based on deletion approaches. In so doing, we suggest a negative stripping construction rule that can account for ambiguous meaning. This rule further can enable us to explain syntactic structures and readings of Negative Stripping Construction.

• IMMUNE NETWORK
• /
• v.23 no.4
• /
• pp.32.1-32.15
• /
• 2023

Most influenza vaccines currently in use target the highly variable hemagglutinin protein to induce neutralizing antibodies and therefore require yearly reformulation. T cell-based universal influenza vaccines focus on eliciting broadly cross-reactive T-cell responses, especially the tissue-resident memory T cell (T_RM) population in the respiratory tract, providing superior protection to circulating memory T cells. This study demonstrated that intramuscular (i.m.) administration of the adenovirus-based vaccine expressing influenza virus nucleoprotein (rAd/NP) elicited weak CD8 T_RM responses in the lungs and airways, and yielded poor protection against lethal influenza virus challenge. However, a novel "prime-and-deploy" strategy that combines i.m. vaccination of rAd/NP with subsequent intranasal administration of an empty adenovector induced strong NP-specific CD8⁺ T_RM cells and provided complete protection against influenza virus challenge. Overall, our results demonstrate that this "prime-and-deploy" vaccination strategy is potentially applicable to the development of universal influenza vaccines.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.696-703
• /
• 2017

In this paper, we show how to design based on solving Sudoku problem that is one of the NP-complete problems like Go. We show how to use greedy method which can minimize depth based on tree expansion and how to apply heuristic algorithm for pruning unnecessary branches. As a result of measuring the performance of the proposed method for solving of Sudoku problems, this method can reduce the number of function call required for solving compared with the method of heuristic algorithm or recursive method, also this method is able to reduce the 46~64 depth rather than simply expanding the tree and is able to pruning unnecessary branches. Therefore, we could see that it can reduce the number of leaf nodes required for the calculation to 6 to 34.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.