• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.319-322
• /
• 2010

Extended PLR grammars are currently the largest subclass of LR grammars whose grammars are transformed into LL grammars satisfying covering property. This paper suggests a simplified covering transformation of the original covering transformation for extended PLR grammars. The proposed covering transformation reduces the original four rule types to the three rule types.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1410-1422
• /
• 2015

In order to design a system, software developers use an object model such as the UML class diagram. Object-Relational Transformation Methodology (ORTM) is a methodology to transform the relationships that are expressed in the object model into relational database tables, and it is applied for the implementation of the designed system. Previous ORTM studies have suggested a number of transformation methods to represent one relationship. However, there is an implementation problem that is difficult to apply because the usage criteria for each transformation method do not exist. Therefore, this paper proposes a binary decision diagram-based modeling rule for each relationship. Hence, we define the conditions for distinguishing the transformation methods. By measuring the query execution time, we also evaluate the modeling rules that are required for the verification. After evaluation, we re-define the final modeling rules which are represented by propositional logic, and show that our proposed modeling rules are useful for the implementation of the designed system through a case study.

• Journal of KIISE:Software and Applications
• /
• v.29 no.7
• /
• pp.510-520
• /
• 2002

This paper proposes a transformation-based approach to design constraint-based analyses for Java at a coarser granularity. In this approach, we design a less or equally precise but more efficient version of an original analysis by transforming the original construction rules into new ones. As applications of this rule transformation, we provide two instances of analysis design by rule-transformation. The first one designs a sparse version of class analysis for Java and the second one deals with a sparse exception analysis for Java. Both are designed based on method-level, and the sparse exception analysis is shown to give the same information for every method as the original analysis.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.1
• /
• pp.98-103
• /
• 1989

A new system for logic optimization at gate-level is proposed in this paper. Ths system is rule-based, i which the rules represent the local trnsformation replacing a portion of circuits with the simplified equivalent circuits. In this system, 'rule generalization' and 'local optimization' are proposed for effective pattern matching. Rule generalization is used to reduce the circuit-search for pattern matching, and local optimization, to exclude unnecessary circuit-search. In additionk, in order to reduce unnecessary trial of pattern matching, the matching order of circuit patern is included in the rule descriptions. The effectiveness of this system is shown by its application ot the circuits which are generated by a hardware compiler.

• Journal of the Korean Society for Heat Treatment
• /
• v.32 no.1
• /
• pp.17-28
• /
• 2019

Jominy hardenability curves of low alloy steel containing less than 5 wt.% of alloying elements in total were calculated by applying Scheil's rule of additivity to pre-calculated isothermal transformation curve. Isothermal transformation curve for each phase in steel was approximated as a simple mathematical equation by using Kirkaldy's approach and all coefficients in the equation were estimated from experimental temperature-time-transformation (TTT) and/or continuous cooling transformation (CCT) data in the literature. Then jominy test with simple boundary conditions was performed in computer by applying the finite difference scheme. The resultant cooling curves at each location along a longitudinal direction of Jominy bar were applied to calculate phase fractions as well as mechanical properties such as micro Vickers hardness. The simulated results were compared with experimental CCT data and Jominy curves in the literature.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.12
• /
• pp.2247-2250
• /
• 2007

This paper presents an automated API translator for embedded software development based on a model-driven approach. Since MDA(Model Driven Architecture) provides little support for the development of embedded software, we propose a new approach containing its advantages. First, we define #generic APIs# which do not depend on any RTOS#s but provide most of typical RTOS services. We can describe RTOS-related behaviors of target application using these generic APIs in a CIC(Common Intermediate Code). Then, we propose a transformation tool for translating between a CIC using generic APIs and a C-code for specific RTOS. The proposed API translator converts them using XML transformation rule which is defined outside. It indicates that an API translator extends to other RTOS#s by modifying or adding the transformation rule. From the experiment. we validate the proposed method.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2005.05a
• /
• pp.787-788
• /
• 2005

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.211-218
• /
• 1994

In this paper we develope a hybrid learning rule to improve the robustness of multi-layer Perceptions. In most neural networks the activation of a neuron is deternined by a nonlinear transformation of the weighted sum of inputs to the neurons. Investigating the behaviour of activations of hidden layer neurons a new learning algorithm is developed for improved robustness for multi-layer Perceptrons. Unlike other methods which reduce the network complexity by putting restrictions on synaptic weights our method based on error-backpropagation increases the complexity of the underlying proplem by imposing it saturation requirement on hidden layer neurons. We also found that the additional gradient-descent term for the requirement corresponds to the Hebbian rule and our algorithm incorporates the Hebbian learning rule into the error back-propagation rule. Computer simulation demonstrates fast learning convergence as well as improved robustness for classification and hetero-association of patterns.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.86-89
• /
• 2000

In this paper, we consider a fuzzy system representation for polynomials of two variables. The representation we use is an exact transformation of the corresponding cubic spline interpolation function. We examine some of the properties of their fuzzy rule tables md prove that the rule table is symmetric or antisymmetric depending on whether the polynomial is symmetric or antisymmetric. A few examples are included to verify our proof. These results not only provide some insights on properties of the cubic spline interpolation coefficients but also provide some help in setting up fuzzy rule tables for functions of two variables.

• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.133-146
• /
• 2011

We employ a hyperbolic tangent function to construct nonlinear transformations which are useful in numerical evaluation of weakly singular integrals and Cauchy principal value integrals. Results of numerical implementation based on the standard Gauss quadrature rule show that the present transformations are available for the singular integrals and, in some cases, give much better approximations compared with those of existing non-linear transformation methods.