• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.788-791
• /
• 2005

Nodal displacements are referred to the Initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian formulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid fer structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacements and traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One closed loop structure undergoing large deformations is analyzed to demonstrate the efficiency and validity of the proposed method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.179-186
• /
• 2021

We have been developed the smart tourism app and the Instagram and YouTube contents to provide personalized tourism information and travel product information to individual tourists. In this paper, we develop a rule-based smart tourism chatbot with the khaiii (Kakao Hangul Analyzer III) morphological analyzer and Neo4J graph database. In the proposed chatbot system, we use a morpheme analyzer, a proper noun dictionary including tourist destination names, and a general noun dictionary including containing frequently used words in tourist information search to understand the intention of the user's question. The tourism knowledge base built using the Neo4J graph database provides adequate answers to tourists' questions. In this paper, the nodes of Neo4J are Area based on tourist destination address, Contents with property of tourist information, and Service including service attribute data frequently used for search. A Neo4J query is created based on the result of analyzing the intention of a tourist's question with the property of nodes and relationships in Neo4J database. An answer to the question is made by searching in the tourism knowledge base. In this paper, we create the tourism knowledge base using more than 1300 Jeju tourism information used in the smart tourism app. We plan to develop a multilingual smart tour chatbot using the named entity recognition (NER), intention classification using conditional random field(CRF), and transfer learning using the pretrained language models.

• Journal of The Korean Association For Science Education
• /
• v.25 no.2
• /
• pp.122-132
• /
• 2005

Graphing abilities are critical to understand and convey information in science. And then, to what extent are secondary students in science courses able to understand line graphs? To find clues about the students' interpretation processes of the information in science-related line graphs, this study has the following research question: Is there a difference between the levels of complexity of good and poor readers as they use the thinking aloud method for studying cognitive processes? The present study was designed to provide evidence for the hypothesis that good line graph readers use a specific graph interpretation process when reading and interpreting line graphs. With the aid of the thinking aloud method we gained deeper insight into the interpretation processes of good and poor graph readers while verifying verbal statements with respect to line graphs. The high performing students tend to read much more information and more trend-related information than the low performing students. We support the assumption of differential line graph schema existing in the high performing students in conjunction with general graph schema. Also, high performing students tend to think aloud much more metacognitively than low performing students. High performing students think aloud a larger quantity of information from line graphs than low performing students, and more trend-related sentences than value-related sentences from line graphs. The differences of interpretation processes revealed between good and poor graph readers while reading and interpreting line graphs have implications for instructional practice as well as for test development and validation. Teaching students to read and interpret graphs flexibly and skillfully is a particular challenge to anyone seriously concerned with good education for students who live in an technological society.

• Journal of Power Electronics
• /
• v.9 no.6
• /
• pp.854-865
• /
• 2009

Super-lift dc-dc converters are a series of advanced step-up dc-dc topologies that provide high voltage transfer gains by super-lift techniques. This paper presents a developed graphical modelling method for super-lift converters and gives a thorough analysis with a consideration of the effects caused by parasitic parameters and diodes' forward voltage drop. The general guidelines for constructing and deriving graphical models are provided for system analysis. By applying it to examples, the proposed method shows the advantages of high convenience and feasibility. Both the circuit simulation and experimental results are given to support the theoretical analysis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.1-10
• /
• 1998

We consider the precedence-constrained knapsack problem. which is a knapsack problem with precedence constraints imposed on the set of variables. Especially, we focus on the case where the precedence constraints cir be represented as a bipartite graph, which occurs most frequently in applications. Based on the previous studios for the general case, we specialize the polyhedral results on the related polytope and derive stronger results on the facet-defining properties of the inequalities.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1033-1048
• /
• 2020

We synthesize the recent work done on conditionally defined Lucas and Fibonacci numbers, tying together various definitions and results generalizing the linear recurrence relation. Allowing for any initial conditions, we determine the generating function and a Binet-like formula for the general sequence, in both the positive and negative directions, as well as relations among various sequence pairs. We also determine conditions for periodicity of these sequences and graph some recurrent figures in Python.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1243-1253
• /
• 2008

In this paper, we construct one-factorizations of given complete graphs of even order. These constructions partition the edges of the complete graph into one-factors and triples. Our new constructions of one-factors and triples can be applied to a recursive construction of Steiner triple systems for all possible orders ${\geq}$15.

• IE interfaces
• /
• v.7 no.3
• /
• pp.227-237
• /
• 1994

In this study, graphic environment for system monitoring is designed that can efficiently manage monitoring data. And also system informations are inplemented to database for reliability and a utility management software is developed to monitor systems on graphic environment and RDBMS (Relational DataBase Management System). Specially, system status informations are presented in the forms of animation, graph, value, icon, and voice message. Status data and general basic informations of system can be all the times updated and indexly reported on database.

• Journal of Life Science
• /
• v.18 no.4
• /
• pp.565-571
• /
• 2008

Due to rapid development of bioinformatics technologies, various biological data have been produced in silico. So now days complicated and large scale biodata are used to accomplish requirement of researcher. Developing visualization and annotation tool using them is still hot issues although those have been studied for a decade. However, diversity and various requirements of users make us hard to develop general purpose tool. In this paper, I propose a novel system, Genome Viewer and Annotation tool (GenoVA), to annotate and visualize among genomes using known information and multiple relation graph. There are several multiple alignment tools but they lose conserved area for complexity of its constrains. The GenoVA extracts all associated information between all pair genomes by extending pairwise alignment. High frequency conserved area and high BLAST score make a block node of relation graph. To represent multiple relation graph, the system connects among associated block nodes. Also the system shows the known information, COG, gene and hierarchical path of block node. In this case, the system can annotates missed area and unknown gene by navigating the special block node's clustering. I experimented ten bacteria genomes for extracting the feature to visualize and annotate among them. GenoVA also supports simple and rough computational annotation of new genome.

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.189-200
• /
• 2020

Let G be a simple connected graph with n vertices and m edges. Denote by d₁ ≥ d₂ ≥ ⋯ ≥ d_n > 0 and d(e₁) ≥ d(e₂) ≥ ⋯ ≥ d(e_m) sequences of vertex and edge degrees, respectively. If vertices v_i and v_j are adjacent, we write i ~ j. The general sum-connectivity index is defined as 𝒳_α(G) = ∑_i~j(d_i + d_j)^α, where α is an arbitrary real number. Firstly, we determine a relation between 𝒳_α(G) and 𝒳_α-1(G). Then we use it to obtain some new bounds for 𝒳_α(G).