• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.130-138
• /
• 2000

The paper describes a push system, a broadcasting system in the internet, which is developed for internet and intranet use. In this paper, we carried out research on the method to support the large number of users in the intranet environment. Particularly the paper analyzes the effects on the network traffic according to the number of the user connected to the push system and the frequency of the connections when push servers are distributed over the intranet. Push system described here uses two different kinds of channels, common channel and local channel. Common channel is the channel to be replicated among the push servers in the intranet. This paper shows that the method using the common channel synchronization is efficient in supporting the large number of intranet users. We introduce an algorithm to make the interconnections between channels efficiently amongpush servers distributed over the intranet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.563-572
• /
• 2013

Based on this paper, in case of the on-line account system in finance industry temporarily stops working because of the on-line data change from 00:00 to 00:30, it conducts in extra placement server and the director update is carried out via center cut or on-line server to make the service possible through customer director reproduction revision. So, from the simulation result in financial operating system, We retain the batch director & backup director securely about the important time data in each account classes on-line director without even one second interruption.

• Journal of Convergence Society for SMB
• /
• v.5 no.1
• /
• pp.13-18
• /
• 2015

The malware, as hackers generic name of executable code that is created for malicious purposes, depending on the presence or absence of a self-replicating ability infected subjects, and are classified as viruses, worms, such as the Trojan horse. Mainly Web page search and P2P use, such as when you use a shareware, has become penetration is more likely to occur in such a situation. If you receive a malware attack, whether the e-mail is sent it is automatically, or will suffer damage such as reduced system performance, personal information leaks. While introducing the current malware, let us examine the measures and describes the contents related to the malicious code.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.499-506
• /
• 2003

In this paper, we propose the shift and noise tolerance method using a virtual phase image and a joint transform correlator (JTC) architecture that can alleviate the need for an accurate optical axis alignment. An encrypted image is obtained by the Fourier transform of the product of a phase- encoded virtual image to camouflage the original one and a random phase image. Therefore, even if unauthorized users analyze the encrypted image, we can prevent the possibility of counterfeiting from unauthorized people using virtual image which dose not contain any information from the original image. We demonstrate the robustness to noise, to data loss and to shift of the encrypted image using a JTC in the proposed description technique.

• Convergence Security Journal
• /
• v.11 no.3
• /
• pp.85-90
• /
• 2011

JPMP SID Tag is the security senor tag to provides physical information protective function using sensor module, has impossible feature to copy and fake the data which is stored in the tag. So data which is stored in the JPMP SID Tag has authenticity, integrity, originality. Therefore JPMP SID Tag could be applied in the place where the security of data is demanded. This paper propose the system using the JPMP SID Tag to acquire and protect digital evidence where cause investigation of accident is necessary. Also, proposed systems is complement of software security with composition secondary control logic for JPMP SID tag access control.

• Korean Journal of Optics and Photonics
• /
• v.14 no.3
• /
• pp.249-254
• /
• 2003

In this paper, we propose an improved image encryption and decryption method using a phase-encoded virtual image and interference. An original image is simply decrypted by interfering a reference wave with the wave passing through a decrypting key and the encrypted image, where every image has grey level. The proposed encryption is performed by the multiplication of an encrypting key and a phase-encoded virtual image which dose not contain any information for the original image. Therefore even if unauthorized people analyze the encrypted image, they cannot reconstruct the original image. Also grey image encryption can improve the encryption level compared to binary image encryption. Computer simulation and optical experiments confirmed that the proposed technique is a simple for optical encryption.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.101-109
• /
• 2006

Recently, according to the number of internet in widely use and the development of the related application program, the distribution and use of multimedia content(text, images, video, audio etc.) is very easy. Digital signal may be easily duplicated and the duplicated data can have same quality of original data so that it is difficult to warrant original owner. For the solution of this problem, the protection method of copyright which is encipher and watermarking. Digital watermarking is used to protect IP(Intellectual Property) and authenticate the owner of multimedia content. In this paper, the proposed watermarking algerian embeds watermark into multiple lower bitplanes of digital image. In the proposed algorithm, original and watermark images are decomposed to bitplanes each other and the watermarking operation is executed in the corresponded bitplane. The position of watermark image embedded in each bitplane is used to the watermarking key and executed in multiple lower bitplane which has no an influence on human visual recognition. Thus this algorithm can present watermark image to the multiple inherent patterns and needs small watermarking quantity. In the experiment, the author confirmed that it has high robustness against attacks of JPEG, MEDIAN and PSNR but it is weakness against attacks of NOISE, RNDDIST, ROT, SCALE, SS on spatial domain when a criterion PSNR of watermarked image is 40dB.

• Journal of Korean Society of Forest Science
• /
• v.108 no.3
• /
• pp.302-310
• /
• 2019

Precise and fast identification of crop cultivars is essential for efficient breeding and plant breeders' rights. Traditional methods for identification of jujube cultivars are based on the evaluation of morphological characteristics. However, due to time constraints and environmental influences, it is difficult to distinguish cultivars using only morphological traits. In this study, we cloned fragments from improved inter simple sequence repeats (ISSR) analysis, and developed stably diagnostic sequence-characterized amplified region (SCAR) markers. The specific ISSR bands of jujube cultivars from Dalizao and Boeundaechu were purified, cloned, and sequenced. As a result, four clones labeled 827Dalizao550, 827Boeun750, 846Boeun700, and 847Dalizao850 were identified. In order to investigate whether they were specific for the jujube cultivar, four pairs of SCAR primers were then designed and polymerase chain reaction (PCR) amplifications were conducted to analyze 32 samples, including jujube and sour jujube. In the PCR amplification of the 827Dalizao550 SCAR marker, the specific bands with 550 bp were amplified in six samples (Dalizao, Sandonglizao, Dongzao, Yuanlin No. 2, Suanzao 2, Suanzao 4), but unexpected bands (490 bp) were amplified in the others. Moreover, in the PCR amplification of the 847Dalizao850 SCAR marker, the specific bands with 850 bp were found in three samples (Dalizao, Sandonglizao, and Dongzao) and 900 bp unexpected bands were amplified in five samples (Pozao, Suanzao 1, Suanzao 2, Suanzao 3, Suanzao 4). These results showed that newly developed markers could be useful as a fast and reliable tool to identify jujube cultivars. However, further identification of polymorphic information and the development of SCAR markers are required for the identification of more diverse cultivars.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.273-279
• /
• 2003

Hypercube multicomputers have been drawing considerable attention from many researchers due to their regular structure and short diameter. One of keys to the performance of Hypercube is the efficiency of communication among processors. Among several communication patterns, multicast is important, which is found in a variety of applications as data replication and signal processing. As the number of processors increases, the probability of occurrences of fault components also increases. So it would be desirable to design an efficient scheme that multicasts messages in the presence of faulty component. In fault-tolerant routing and multicast, there are local information based scheme, global information based scheme and limited information based scheme in terms of information. In general, limited information is easy to obtain and maintain by compressing information in a concise format. In this paper, we propose a new routing scheme and a new multicast scheme using recently proposed fully reachability information scheme and new local information scheme. The proposed multicast scheme increases multicast success possibility and reduce deroute cases. Experiments show that multicast success possibility can increase at least 15% compared to previous method.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.915-920
• /
• 2005

In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.