• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.179-184
• /
• 2006

An intuitive understanding of the dynamic pattern generation in asymmetric networks may be considered an essential component in developing models for the dynamic information processing. It has been reported that the neural network with cyclic connections generates multiple limit cycles. The dynamics of discrete time network with cyclic connections has been investigated intensively. However, the dynamics of a cyclic connection neural network in continuous-time has not been well-known due to the considerable complexity involved in its calculation. In this paper, the dynamic behavior of a continuous-time cyclic connection neural network, in which each neuron is connected only to its nearest neurons with binary synaptic weights of ${\pm}1$, has been investigated. Furthermore, the dynamics and stability of the network have been analyzed using a piece-wise linear approximation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.72-80
• /
• 2009

Look-up table based inverse halftoning from the digital color halftone image is proposed in this paper, which uses vector adaptive filter for the nonexisting patterns in the table. Halftone image is obtained from a continuous -tone image, which can be restored into continuous one from the digital binary image by way of inverse halftoning method. Look-up table based method usually processes fast and has even performances over the various halftoning. The numbers of pixels in the pattern of table and the method how to define the table elements for each R, G, B channels can effect largely for its performance. The proposed method uses 16 pixels in the table considering the diversity of the expressions from their patterns and with memory size as well. This also proposed how to combine R, G, B channels into one. Experimental results showed the better performance in the expression of colors, better color restoration and the short processing time compared with the conventional ones.

• Transactions on Electrical and Electronic Materials
• /
• v.3 no.1
• /
• pp.30-37
• /
• 2002

A focusing grating coupler (FGC) was not fabricated by the 'Continuous Path Control'writing strategy but by an electron-beam lithography system of more general exposure mode, which matches not only the address grid with the grating period but also an integer multiple of the address grid resolution (5 nm). To more simplify the fabrication, we are able to reduce a process step without large decrease of pattern quality by excluding a conducting material or layer such as metal (Al, Cr, Au), which are deposited on top or bottom of an e-beam resist to prevent charge build-up during e-beam exposure. A grating pitch period and an aperture feature size of the FGC designed and fabricated by e-beam lithography and reactive ion etching were ranged over 384.3 nm to 448.2 nm, and 0.5 $\times$ 0.5 mm$^2$area, respectively. This fabrication method presented will reduce processing time and improve the grating quality by means of a consideration of the address grid resolution, grating direction, pitch size and shapes when exposing. Here our investigations concentrate on the design and efficient fabrication results of the FGC for coupling from slab waveguide to a spot in free space.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.987-994
• /
• 2018

In this paper, an automatic transmission system of traffic information is presented. Here, a traffic event is defined as an obstacle to an emergency vehicle such as an ambulance or a fire truck. When a traffic event is detected from a video recorded by a black box installed in a vehicle, the implemented system automatically transmits a proof image and corresponding information to the control center through an e-mail. For this purpose, we realize an algorithm of identifying the numbers and a character from the license plate, and an algorithm for determining the occurrence of a traffic event. To report the event, a function for automatic transmission of the text and image files through e-mail and file transfer protocol (FTP) is also appended. Therefore, if the traffic event is extended and applied to the presented system, it will be possible to establish a convenient reporting system for the violation of various traffic regulations. In addition, it will contribute to significantly reduce the number of traffic violations against the regulations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.5
• /
• pp.744-752
• /
• 2012

In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as an one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problems. In data preprocessing part, Principal Component Analysis(PCA) which is generally used in face recognition, which is useful to express some classes using reduction, since it is effective to maintain the rate of recognition and to reduce the amount of data at the same time. However, because of there of the whole face image, it can not guarantee the detection rate about the change of viewpoint and whole image. Thus, to compensate for the defects, Linear Discriminant Analysis(LDA) is used to enhance the separation of different classes. In this paper, we combine the PCA&LDA algorithm and design the optimized pRBFNNs for recognition module. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as two kinds of polynomials such as constant, and linear. The coefficients of connection weight identified with back-propagation using gradient descent method. The output of the pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to face image(ex Yale, AT&T) datasets and then demonstrated from the viewpoint of the output performance and recognition rate.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.6
• /
• pp.1079-1090
• /
• 2014

Data mining is a technique to get the useful information that can be utilized for marketing and pattern analysis by processing the data that we have. However, when we use this technique, data provider's personal data can be leaked by accident. To protect these data from leakage, there were several techniques have been studied to preserve privacy. Vertically partitioned data is a state called that the data is separately provided to various number of user. On these vertically partitioned data, there was some methods developed to distinguishing kth element and (k+1) th element by using score. However, in previous method, we can only use on two-party case, so in this paper, we propose the extended technique by using paillier cryptosystem which can use on multi-party case.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.2
• /
• pp.99-102
• /
• 2012

The performance of P2P application services may be improved by reducing unnecessary inter-network traffic through intelligent peer selection. However, since a logical link between peers in a P2P overlay network is composed of a set of physical links in an underlay network, the traffic pattern determined by the sending rates of selected peers imposes loads on each underlay links. Thus, if the sending rates are not determined carefully, the loads between underlay links may not be balanced, which means some links are underloaded while the other links are congested. In this paper, we take an optimization approach to determine the sending rates of peers strategically to avoid the inefficient use of underlay links. The proposed scheme also guarantee the minimum receiving rates of peers while minimizing the maximum link utilization of underlay links, which is beneficial both to P2P applications and an underlay network.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.147-154
• /
• 2008

Along with the trend of internet use, various web application developments have been performed to provide information that was managed in the internal database on the web by making a web server page. However, in most cases, a direct program was made without a systematic developmental methodology or with the application of a huge developmental methodology that is inappropriate and decreased the efficiency of the development. A web application that fails to follow a systematic developmental methodology and uses a script language can decrease the productivity of the program development, maintenance, and reuse. In this thesis, the auto writing tool for a dynamic web server page was designed and established by using a database for web application development based on a fast and effective script. It suggests a regularized script model and makes a standardized script for the data bound control tag creator by analyzing a dynamic web server page pattern with the database in order to contribute to productivity by being used in the web application development and maintenance.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.11
• /
• pp.499-508
• /
• 2015

High utility itemset(HUI) mining refers to the discovery of itemsets with high utilities which are not less than a user-specified minimum utility threshold, by considering both the quantities and weight factors of items in a transaction database. Recently the utility-list based HUI mining algorithms have been proposed to avoid numerous candidate itemsets and the algorithms need the costly join operations. In this paper, we propose a new HUI mining algorithm, using the utility-list with additional attributes of transaction utility and common utility of itemsets. The new algorithm decreases the number of join operations and efficiently prunes the search space. Experimental results on both synthetic and real datasets show that the proposed algorithm outperforms other recent algorithms in runtime, especially when datasets are dense or contain many long transactions.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.381-394
• /
• 2009

As a technique to enhance reusability for the created artifacts in software modeling process, the model driven method such like MDA has been applied. Unfortunately, the hierarchical and systematic MDA based development technique using UML is poor yet. This causes the problem that the MDA modeling with high consistency and reusability based on MDA metamodel is not being realized. To solve this problem, this paper proposes a MDA (PIM/PSM) component modeling technique using 2+1 view integrated metamodel. At first, the meta-architecture view model which can represents development process view and MVC view is defined. Then, the hierarchical integrated metamodels per view are addressed separately for modeling process and MVC at metamodel level on the hierarchy of the defined meta-architecture view model. These metamodels are defined hierarchically by layering the modeling elements in PIM and PSM pattern for UML models and GUI models. Appling the proposed metamodel to an ISMS application system, it is shown as a component modeling case study based on MDA. Through this approach, we are able to perform a component model with consistency and hierarchy corresponding to development process and MVC way. Accordingly, this may improve more independence and reusability of model.