• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.593-600
• /
• 2018

Cellular automata (CA) have been applied to effective cryptographic system design. CA is superior in randomness to LFSR due to the fact that its state is updated simultaneously by local interaction. To apply these CAs to the cryptosystem, a study has been performed how to synthesize CA corresponding to given polynomials. In this paper, we analyze the recurrence relations of the characteristic polynomial of the 90 UCA and the characteristic polynomial of the 90/150 CA whose transition rule is <$00{\cdots}001$>. And we synthesize the 90/150 CA corresponding to the trinomials $x^{2^n}+x+1(n{\geq}2)$ satisfying f(x)=f(x+1) using the 90 UCA transition rule blocks and the special transition rule block. We also analyze the properties of the irreducible factors of trinomials $x^{2^n}+x+1$ and propose a 90/150 CA synthesis algorithm corresponding to $x^{2^n}+x^{2^m}+1(n{\geq}2,n-m{\geq}2)$.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.787-797
• /
• 2007

In this paper, the following fourth-order rational difference equation $$x_{n+1}=\frac{{x_n^b}+x_n-2x_{n-3}^b+a}{{x_n^bx_{n-2}+x_{n-3}^b+a}$$, n=0, 1, 2,..., where a, b ${\in}$ [0, ${\infty}$) and the initial values $X_{-3},\;X_{-2},\;X_{-1},\;X_0\;{\in}\;(0,\;{\infty})$, is considered and the rule of its trajectory structure is described clearly out. Mainly, the lengths of positive and negative semicycles of its nontrivial solutions are found to occur periodically with prime period 15. The rule is $1^+,\;1^-,\;1^+,\;4^-,\;3^+,\;1^-,\;2^+,\;2^-$ in a period, by which the positive equilibrium point of the equation is verified to be globally asymptotically stable.

• Journal of the Korea Convergence Society
• /
• v.8 no.2
• /
• pp.27-33
• /
• 2017

To efficiently provide cloud computing services to users over the Internet, IT resources must be configured in the data center based on virtualization and distributed computing technology. This paper focuses specifically on the problem that new training data can be added at any time in a wide range of fields, and new attributes can be added to training data at any time. In such a case, rule generated by the training data with the former attribute set can not be used. Moreover, the rule can not be combined with the new data set(with the newly added attributes). This paper proposes further development of the new inference engine that can handle the above case naturally. Rule generated from former data set can be combined with the new data set to form the refined rule.

• Journal of Digital Contents Society
• /
• v.17 no.2
• /
• pp.81-88
• /
• 2016

The general frequent pattern mining considers frequency and support of items. To extract useful information, it is necessary to consider frequency and weight of items that reflects the changing of user interest as time passes. The suitable services considering time or location is requested by user so that the weighted mining method is necessary. We propose a method of weighted frequent pattern mining based on service ontology. The weight considering time and location is given to service items and it is applied to association rule mining method. The extracted rule is combined with stored service rule and it is based on timely service to offer for user.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.285-290
• /
• 2009

An association rule mining has been studied to find hidden data pattern in data mining. A realization of fast processing method have became a big issue because it treated a great number of transaction data. The time which is derived by association rule finding method geometrically increase according to a number of item included data. Accordingly, the process to reduce the number of rules is necessarily needed. We propose the T-algorithm that is efficient rule reduction algorithm. The T-algorithm can reduce effectively the number of association rules. Because that the T-algorithm compares transaction data item with binary format. And improves a support and a confidence between items. The performance of the proposed T-algorithm is evaluated from a simulation.

• Korean Institute of Interior Design Journal
• /
• v.25 no.2
• /
• pp.112-122
• /
• 2016

The study aims to furnish the data for the study of invigorating communities of various ages including old people living alone. Furthermore, it seems that the laddering method and kj method can be useful for the study of various attitude survey. This study attempted to extract necessary factors for space for community behavior of elderly people living alone using laddering survey method and KJ rule on a sample of elderly people who live alone in three different rental housings. The keywords that were drawn from the perception survey through laddering were divided into small, middle and large classification using KJ rule. Mostly identical keywords were extracted in the three complexes, implying that there is no difference of perception among the three complexes in this survey. According to the large classification where KJ rule was applied, there were six necessary factors for space for community activity of elderly people living alone in rental housing including spatial consideration, communication, resting space, nature-friendliness, health promotion and Secure identity, which were the same for all of the three complexes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.127-136
• /
• 2005

In this paper, a new architecture and comprehensive design methodology of genetically optimized Rule-based Fuzzy Polynomial Neural Networks(gRFPNN) are introduced and a series of numeric experiments are carried out. The architecture of the resulting gRFPNN results from asynergistic usage of the hybrid system generated by combining rule-based Fuzzy Neural Networks(FNN) with polynomial neural networks (PNN). FNN contributes to the formation of the premise part of the overall rule-based structure of the gRFPNN. The consequence part of the gRFPNN is designed using PNNs. At the premise part of the gRFPNN, FNN exploits fuzzy set based approach designed by using space partitioning in terms of individual variables and comes in two fuzzy inference forms: simplified and linear. As the consequence part of the gRFPNN, the development of the genetically optimized PNN dwells on two general optimization mechanism: the structural optimization is realized via GAs whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the gRFPNN, the models are experimented with the use of several representative numerical examples. A comparative analysis shows that the proposed gRFPNN are models with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• Steel and Composite Structures
• /
• v.46 no.3
• /
• pp.403-416
• /
• 2023

This paper summarised and re-examined the theoretical basis of the commonly used design rule developed by Cochrane in the 1920s to consider staggered bolt holes in tension members, i.e., the s²/4g rule. The rule was derived assuming that the term two times the bolt hole diameter (2d₀) in Cochrane's original equation could be neglected, and assuming a value of 0.5 for the fractional deduction of a staggered hole in assessing the net section area. Although the s²/4g rule generally provides good predictions of the staggered net section area, the above-mentioned assumptions used in developing the rule are doubtful, in particular for a connection with a small gauge-to-bolt-hole diameter (g/d₀) ratio. It was found that the omission of 2d₀ in Cochrane's original equation appreciably overestimates the net section area of a staggered bolted connection with a small g/d₀ ratio. However, the assumed value of 0.5 for the fractional deduction of a staggered hole underestimates the staggered net section area for small g/d₀ ratios. To improve the applicability of the above two assumptions, a modified design equation, which covers a full range of g/d₀ ratio, was proposed to accurately predict the staggered net section area and was validated by the existing test data from the literature and numerical data derived from this study. Finally, a reliability analysis of the test and numerical data was conducted, and the results showed that the reliability of the modified design equation for evaluating the net section resistance of staggered bolted connections can be achieved with the partial factor of 1.25.

• Journal of KIBIM
• /
• v.9 no.2
• /
• pp.21-28
• /
• 2019

Recently, many scan projects are gradually increasing for maintenance, construction. The scan data contains useful data, which can be generated in the target application from the facility, space. However, modeling the scan data required for the application requires a lot of cost. In example, the converting 3D point cloud obtained from scan data into 3D object is a time-consuming task, and the modeling task is still very manual. This research proposes Scan-to-Geometry Mapping Rule Definition (S2G-MD) which maps point cloud data to geometry for irregular building plane objects. The S2G-MD considers user use case variability. The method to define rules for mapping scan to geometry is proposed. This research supports the reverse engineering semi-automatic process for the building planar geometry from the user perspective.

• Structural Engineering and Mechanics
• /
• v.23 no.1
• /
• pp.29-42
• /
• 2006

This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.