• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.411-416
• /
• 2007

The General security method of wireless network provides a confidentiality of communication contents based on the cryptographic stability against a malicious host. However, this method exposes the logical and physical addresses of both sender and receiver, so transmission volume and identification of both may be exposed although concealing that content. Covered address scheme that this paper proposes generates an address to which knapsack problem using super increasing sequence is applied, and replaces the addresses of sender and receiver with addresses from super increasing sequence. Also, proposed method changes frequently secret addresses, so a malicious user cannot watch a target system or try to attack the specific host. Proposed method also changes continuously a host address that attacker takes aim at. Accordingly, an attacker who tries to use DDoS attack cannot decide the specific target system.

• 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.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.481-484
• /
• 2005

Inherent opportunities on research for restoring high resolution image from low resolution images are increasing in these days. Super resolution image reconstruction is the process of combining multiple low resolution images to form a higher resolution one. To achieve super resolution reconstruction, proper observation model which is based on subpixel shift information is required. In this context, the importance of the subpixel registration cannot be estimated because subpixel shift information cannot be obtained from original image. This paper presents a regularized adaptive super resolution reconstruction method based on phase correlated subpixel registration, where the Constrained Least Squares(CLS) Restoration is adopted as a post process.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.67-69
• /
• 2005

현재까지의 보안 라우팅 프로토콜은 유무선에 관계 없이 페이로드 부분은 암호화가 되더라도 패킷 헤더의 내용이 평문 형태로 무방비하게 노출되며 라우팅 경로가 안전하게 보장되더라도 악의적인 노드에게 경로가 알려지는 것을 차단 할 수 없다. 또한 유선 환경과는 달리 Ad-hoc 네트워크와 같은 무선 상황에서는 전파의 전방향성 때문에 송수신 범위 내에 있는 노드들이 평문 형태의 라우팅 정보 및 송수신 노드의 정보를 수집하는 것을 방지 할 수 없다. 본 논문에서 제안하는 은닉 라우팅 프로토콜은 한쌍의 노드가 비대칭키 암호화 알고리즘을 통해 공유한 초증가 수열을 통해 송수신 노드를 은닉하면서도 정당한 수신 노드만 자신이 수신 노드임을 알 수 있는 기법을 제공함으로서 악의적인 노드가 라우팅 경로에 대한 정보를 수집하는 것을 원천적으로 차단한다.

• Journal of Microbiology and Biotechnology
• /
• v.21 no.1
• /
• pp.55-61
• /
• 2011

Forty yeast strains isolated from soils taken from different locations in Egypt were tested for their P-solubilizing activities on the basis of analyzing the clear zone around colonies growing on a tricalcium phosphate medium after incubation for 5 days at $25^{\circ}C$, denoted as the solubilization index (SI). Nine isolates that exhibited P-solubilization potential with an SI ranging from 1.19 to 2.76 were genetically characterized as five yeasts belonging to the genus Saccharomyces cerevisiae and four non-Saccharomyces, based on a PCR analysis of the ITS1-26S region amplied by SC1/SC2 species-specific primers. The highest P-solubilization efficiency was demonstrated by isolate PSY- 4, which was identified as Saccharomyces cerevisiae by a sequence analysis of the variable D1/D2 domain of the 26S rDNA. The effects of single and mixed inoculations with yeast PSY-4 and Bacillus polymyxa on the P-uptake and growth of corn were tested in a greenhouse experiment using different levels of a phosphorus chemical fertilizer (50, 100, and 200 kg/ha super phosphate 15.5% $P_2O_5$). The results showed that inoculating the corn with yeast PSY-4 or B. polymyxa caused significant increases in the shoot and root dry weights and P-uptake in the shoots and roots. The P-fertilization level also had a significant influence on the shoot and root dry weights and P-uptake in the shoots and roots when increasing the P-level from 50 up to 200 kg/ha. Dual inoculation with yeast strain PSY-4 and B. polymyxa at a P-fertilization level of 200 kg/ha gave higher values for the shoot and root dry weights and P-uptake in the shoots and roots, yet these increases were nonsignificant when compared with dual inoculation with yeast strain PSY-4 and B. polymyxa at a P-fertilization level of 100 kg/ha. The best increases were obtained from dual inoculation with yeast strain PSY-4 and B. polymyxa at a P-fertilization level of 100 kg/ha, which induced the following percentage increases in the shoot and root dry weights, and P-uptake in the shoots and roots; 16.22%, 46.92%, 10.09%, and 31.07%, respectively, when compared with the uninoculated control (fertilized with 100 kg/ha).