• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.91-102
• /
• 2012

Network port scan attack is the method for finding ports opening in a local network. Most existing IDSs(intrusion detection system) record the number of packets sent to a system per unit time. If port scan count from a source IP address is higher than certain threshold, it is regarded as a port scan attack. The degree of risk about source IP address performing network port scan attack depends on attack count recorded by IDS. However, the measurement of risk based on the attack count may reduce port scan detection rates due to the increased false negative for slow port scan. This paper proposes a method of summarizing 4 types of information to differentiate network port scan attack more precisely and comprehensively. To integrate the riskiness, we present a risk index that quantifies the risk of port scan attack by using PCA. The proposed detection method using risk index shows superior performance than Snort for the detection of network port scan.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2038-2057
• /
• 2017

Gaussian learning is a new technology in the computational intelligence area. However, this technology weakens the learning ability of a particle swarm and achieves a lack of diversity. Thus, this paper proposes a vector Gaussian learning strategy and presents an effective approach, named particle swarm optimization based on vector Gaussian learning. The experiments show that the algorithm is more close to the optimal solution and the better search efficiency after we use vector Gaussian learning strategy. The strategy adopts vector Gaussian learning to generate the Gaussian solution of a swarm's optimal location, increases the learning ability of the swarm's optimal location, and maintains the diversity of the swarm. The method divides the states into normal and premature states by analyzing the state threshold of the swarm. If the swarm is in the premature category, the algorithm adopts an inertia weight strategy that decreases linearly in addition to vector Gaussian learning; otherwise, it uses a fixed inertia weight strategy. Experiments are conducted on eight well-known benchmark functions to verify the performance of the new approach. The results demonstrate promising performance of the new method in terms of convergence velocity and precision, with an improved ability to escape from a local optimum.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.19-25
• /
• 2004

In this paper, we propose optimal and suboptimal serial code acquisition schemes for chip-asynchronous direct-sequence spread-spectrum systems. The conventional serial code acquisition scheme is to compare each value of correlator outputs with a threshold individually. However, such a scheme is optimum only under the chip-synchronous assumption which is actually very difficult to be held prior to acquisition at the receiver because the signal-to-noise ratios before despreading are very low. In this paper, an optimal serial code acquisition scheme is derived based on the maximum-likelihood criterion under the more realistic and general chip-asynchronous environments. A suboptimal scheme, which is simpler but yields comparable performance to the optimal one, is also derived based on the criterion of local detection power Numerical results show that, under the chip-asynchronous environments, both the optimal and suboptimal serial code acquisition schemes outperform the conventional serial code acquisition scheme.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.13
• /
• pp.1013-1032
• /
• 2000

At present, the scale of Electronic Commerce through internet has been rapidly increasing due to the development of information & communication technology, and aggregated to 2.4 billion dollar in America last year (1998). The market scale of worldwide electronic commerce is also presumed to be about 130 billion dollar in 2000, and to occupy more than 20% of the whole world trade in world 2020. Since the right of trademark, despite of being effective only in registered nations on the principle of territorialism, is unified on the cyber space of internet without domestic barrier or local limitation which make it easier to conduct the distribution of information rapidly through the address-internet domain name, those are very important that the systematic dispute-solving plan on problems such as decision of its Act and international jurisdiction to be established, in an effort to prevent the newly emerging dispute instances such as trademark infringement and improper competitiveness. In addition, it is natural that on the threshold of the electronic commerce age which formed with an unified area without the worldwide specific regulation, each country including us makes haste with the enactment of "electronic commerce Act" aiming at coming into force in 1999, in keeping with getting through "non-tariff law on electronic commerce" by U. S. parliament on May, 1998. In view of the properties of electronic commerce transactions through internet, there are the large curtailment of distributive channel, surmounting of restrictions on transaction area, space and time and the easy feedback with consumer and the cheap-required capital, from which the problems may arise - registration of trademark, the trademark infringement of domain name and the protection of prestigious trademark. Therefore, it is necessary to take the counter-measure, with a view of reviewing the infringement of trademark and domain name and the instances of each national precedent and to preventing the disputes. The improvement of the persistent system should be needed to propel the harmonious protection of those holding trademark right's credit and demanders' expectant profit by way of the righteous use of trademark.

• Journal of Advanced Navigation Technology
• /
• v.18 no.4
• /
• pp.304-311
• /
• 2014

In this paper, we propose a ultra sound inspection technique for automatic defect detection and classification in aircraft composite materials. Using local maximum values of ultra sound wave, we choose peak values for defect detection. Distance data among peak values are used to construct histogram and to determine surface and back-wall echo from the floor of composite materials. C-scan image is then composed through this method. A threshold value is determined by average and variance of the peak values, and defects are detected by the values. PCA(principal component analysis) and QDA(quadratic discriminant analysis) are carried out to classify the types of defects. In PCA, 512 dimensional data are converted into 30 PCs(Principal Components), which is 99% of total variances. Computational cost and misclassification rate are reduced by limiting the number of PCs. A decision boundary equation is obtained by QDA, and defects are classified by the equation. Experimental result shows that our proposed method is able to detect and classify the defects automatically.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.587-594
• /
• 2005

This paper proposes a multi-level thresholding method for image segmentation using fuzzy clustering algorithm in transition region. Most of threshold-based image segmentation methods determine thresholds based on the histogram distribution of a given image. Therefore, the methods have difficulty in determining thresholds for real-image, which has a complex and undistinguished distribution, and demand much computational time and memory size. To solve these problems, we determine thresholds for real-image using fuzzy clustering algorithm after extracting transition region consisting of essential and important components in image. Transition region is extracted based on Inか entropy, which is robust to noise and is well-known as a tool that describes image information. And fuzzy clustering algorithm can determine optimal thresholds for real-image and be easily extended to multi-level thresholding. The experimental results demonstrate the effectiveness of the proposed method for performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.546-554
• /
• 2011

Near targets in the infrared (IR) images have the steady feature for inner region and the transient feature for the boundary region. Based on these features, this paper proposes a new method to extract the fine target shape of near targets in the IR images. First, we detect the boundary region of the candidate targets using the local variance weighted information entropy (WIE) of the original images. And then, a coarse target region can be estimated based on the labeling of the boundary region. For the coarse target region, we use the opening filter with an adaptive structure element to extract the fine target shape. The decision of the adaptive structure element size is optimized for the width information of target boundary by calculating the average WIE in the enlarged windows. The experimental results show that a proposed method has better extraction performance than the previous threshold algorithms.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.134-144
• /
• 2008

A city is the center of all the economic activities, politics, administration and creation of cultures, and it is also a social community. It is also an environment in which human beings live and act, and thus, psychological and emotional pleasure are greatly demanded. Facilities of cities, buildings and harmonizing each and every structures with the environment sets up the image and the identity of a city because they are the most important visual structuring elements in cityscapes. Currently, most of the cities in Korea including Seoul, are in discordance with their natural environment because of all different sorts of buildings and signboards are jumbled up close together. The traditional, local colors have disappeared form those cities and all cities look the same. It is hard to find traditional beauty and identities of the cities in Korea, and the Korean cities are not even close to the threshold of other foreign cities. In order to solve these problems, there is a dire need of improving the modification of cityscapes in the long run. This research aims to understand the current abstruse situation Korean cities are in, analyze their problems and describe actual methods of improving those cities so that they can have a more ordered and organized structures. Also, this research should be used as a data of future researches based on citiscapes.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.95-105
• /
• 2014

In this paper, we present a novel ant-based hierarchical clustering algorithm, where ants repeatedly hop from one node to another over a weighted directed graph of k-nearest neighborhood obtained from a given dataset. We introduce a notion of node pheromone, which is the summation of amount of pheromone on incoming arcs to a node. The node pheromone can be regarded as a relative density measure in a local region. After a finite number of ants' hopping, we remove nodes with a small amount of node pheromone from the directed graph, and obtain a group of strongly connected components as clusters. We iteratively do this removing process from a low value of threshold to a high value, yielding a hierarchy of clusters. We demonstrate the performance of the proposed algorithm with synthetic and real data sets, comparing with traditional clustering methods. Experimental results show the superiority of the proposed method to the traditional methods.