• The Journal of Information Systems
• /
• v.5
• /
• pp.149-173
• /
• 1996

This paper focus on the development of object-oriented model bases for Structured Modeling. For the model base organization, object modeling techniques and model typing concept which is similar to data typing concept are used. Structured modeling formalizes the notion of a definitional system as a way of dscribing models. From the object-oriented concept, a structured model can be represented as follows. Each group of similar elements(genus) is represented by a composite class. Other type of genera can be represented in a similar manner. This hierarchical class composition gives rise to an acyclic class-composition graph which corresponds with the genus graph of structured model. Nodes in this graph are instantiated to represent the elemental graph for a specific model. Taking this class composition process one step further, we aggregate the classes into higher-level composite classes which would correspond to the structured modeling notion of a module. Finally, the model itself is then represented by a composite class having attributes each of whose domain is a composite class representing one of the modules. The resulting class-composition graph represent the modular tree of the structured.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.1
• /
• pp.1-7
• /
• 2011

Most of expert systems use the text-oriented knowledge bases. However, knowledge management using the knowledge bases is considered as a huge burden to the knowledge workers because it includes some troublesome works. It includes chasing and/or checking activities on Consistency, Redundancy, Circulation, and Refinement of the knowledge. In those cases, we consider that they could reduce the burdens by using relational database management systems-based knowledge management infrastructure and convert the knowledge into one of easy forms human can understand. Furthermore they could concentrate on the knowledge itself with the support of the systems. To meet the expectations, in this study, we have tried to develop a general-purposed knowledge conversion tool for expert systems. Especially, this study is focused on the knowledge conversions among text-oriented knowledge base, relational database knowledge base, and decision tree.

• The Mathematical Education
• /
• v.39 no.2
• /
• pp.145-150
• /
• 2000

In this paper, we study the subject-matter knowledge related to the problem about rational exponent with negative bases. From the school mathematics point of view, we first investigate the meaning of the extensions of the number systems. We analyze the intrinsic meaning involved in the (-8)$^{1}$ 3) through the natural interpretation of rational exponent with negative bases by the complex number. we explain why it is important for a teacher to have the subject-matter knowledge in order to detect and correct student\`s mistake and misunderstanding.

• Journal of Ocean Engineering and Technology
• /
• v.17 no.1
• /
• pp.67-71
• /
• 2003

This paper presents the use of an evert system to automate process planning of block assembly, a task that is usually completed manually. In order to determine the sequence of assembly operation, a search method guided by rules, such as merging of related operations, grouping of similar operations, and precedence rules based on know-hows and geometrical reasoning, is used. In this paper, the expert system developed is explained in detail regarding a global database, control strategies, and rule bases. For verification purposes, the evert system has been applied to simple examples. Since the rule bases are isolated from the inference engine in the developed system, it is easy to add more rules in the future.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.225-228
• /
• 2001

DNA computing has been applied to the problem of getting an optimal solution since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems. This paper presents DNA coding method for finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms (GA). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses a tool of calculation or Information store with DNA molecules and four-type bases denoted by the symbols of A(Ademine), C(Cytosine), G(Guanine) and T(Thymine). The same operators, selection, crossover, mutation, are applied to the both DNA coding algorithm and genetic algorithms. The results show that the DNA based algorithm performs better than GA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.758-761
• /
• 2003

The goal of the research is to study and describe a new stressed state of High Temperature Superconducting (High-T$_{c}$) YBCO Films, to create of SQUIDs (Superconducting Quantum Interference Device) on the bases of these films with maximal sensitivity. With the experimental investigation of the stressed films grown by laser ablation method and its properties, the fabrication of the dc-SQUIDs with maximal sensitivity on the bases of the stressed YBCO films were carried out. The stressed film having the value of the critical current density J$_{c}$=3ㆍ$10^{5}$A/$\textrm{cm}^2$ was the more stable than others.ers.s.

• Journal of the Korean Society of Industry Convergence
• /
• v.2 no.1
• /
• pp.105-112
• /
• 1999

Model predicting the respiration rate of pear under modified LDPE film pouch has been developed. The assumptions of the model have three bases; 1) respiration rate is depending on $CO_2$ and $O_2$ concentration in the package, 2) the oxidation of glucose in pear generates carbon dioxides, and 3) gases permeation through the package film bases on the Langmuir adsorption theory and Fick's law. The simulated results agreed fairly well with the experimental data so as this model to be useful in designing the modified atmospheric packaging system.

• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.861-877
• /
• 2010

The works of Erd$\ddot{o}$s et al. about expansions of 1 with respect to a non-integer base q, referred to as q-expansions, are investigated to determine how far they continue to hold when the number 1 is replaced by a positive number x. It is found that most results about q-expansions for real numbers greater than or equal to 1 are in somewhat opposite direction to those for real numbers less than or equal to 1. The situation when a real number has a unique q-expansion, and when it has exactly two q-expansions are studied. The smallest base number q yielding a unique q-expansion is determined and a particular sequence is shown, in certain sense, to be the smallest sequence whose corresponding base number q yields exactly two q-expansions.

• Journal of Microbiology and Biotechnology
• /
• v.1 no.4
• /
• pp.256-260
• /
• 1991

In B. subtilis, $\alpha$-amylase synthesis is regulated by amyR located directly on the upstream of amyE. Three different amyR alleles have been reported, amyR1, amyR2 and amyR3. Strains bearing the gra-10 mutation which confers derepression for catabolite repression has GlongrightarrowA transition mutation at ＋5 of amyR1. S1 nuclease mapping demonstrated that transcription initiated at 8 bases downstream from the -10 region of putative E$\sigma^{A}$ promoter P1 in amyR1 and gra-10. In amyR2, the major transcription initiatd at the same place and the minor, 10 bases downstream from -10 of P2. The transcript from P2 contributed approximately 15-20% of total amyE mRNA. S1 nuclease protection experiment indicated that amyE mRNA levels corresponded to the rate of synthesis assumed by specific activities of $\alpha$-amylase in culture supernatants, suggesting that $\alpha$-amylase synthesis is regulated at the level of transcription.n.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.2
• /
• pp.245-253
• /
• 2009

A new hard problem called the vector decomposition problem (VDP) was recently proposed by Yoshida et al., and it was asserted that the VDP is at least as hard as the computational Diffie-Hellman problem (CDHP) under certain conditions. Kwon and Lee showed that the VDP can be solved in polynomial time in the length of the input for a certain basis even if it satisfies Yoshida's conditions. Extending our previous result, we provide the general condition of the weak instance for the VDP in this paper. However, when the VDP is practically used in cryptographic protocols, a basis of the vector space ${\nu}$ is randomly chosen and publicly known assuming that the VDP with respect to the given basis is hard for a random vector. Thus we suggest the type of strong bases on which the VDP can serve as an intractable problem in cryptographic protocols, and prove that the VDP with respect to such bases is difficult for any random vector in ${\nu}$.