• Journal of KIISE:Software and Applications
• /
• v.33 no.10
• /
• pp.877-885
• /
• 2006

Recently it is proposed that the Bayesian networks used as conversational agent for topic inference is useful but the Bayesian networks require much time to model, and the Bayesian networks also have to be modified when the scripts, the database for conversation, are added or modified and this hinders the scalability of the agent. This paper presents a method to improve the scalability of the agent by constructing the Bayesian network from scripts automatically. The proposed method is to model the structure of Bayesian networks hierarchically and to utilize Noisy-OR gate to form the conditional probability distribution table (CPT). Experimental results with ten subjects confirm the usefulness of the proposed method.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.85-97
• /
• 2005

In this paper, we construct the traffic information database by using the acquired data from the traffic information devices installed in road network, and, by referring to this database, propose the intersection simulation system which can dynamically manage the real-time traffic flow for each section of road from the intersections, This system consists of hierarchical 3 parts, The lower layer is the physical layer where the traffic information is acquired on an actual road. The traffic flow control framework exists in the middle layer. The framework supports the grouping of intersection, the collection of real-time traffic flow information, and the remote monitoring and control by using the traffic information of the lower layer, This layer is designed by extending the distributed object group framework we developed. In upper layer, the intersection simulator applications controlling the traffic flow by grouping the intersections exist. The components of the intersection application in our system are composed of the implementing objects based on the Time-triggered Message-triggered Object(TMO) scheme, The intersection simulation system considers the each intersection on road as an application group, and can apply the control models of dynamic traffic flow by the road's status. At this time, we use the real-time traffic information collected through inter-communication among intersections. For constructing this system, we defined the system architecture and the interaction of components on the traffic flow control framework which supports the TMO scheme and the TMO Support Middleware(TMOSM), and designed the application simulator and the user interface to the monitoring and the controlling of traffic flow.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.215-220
• /
• 2012

This paper proposes a ontology of tree structure approach for adaptive object recognition in a situation-variant environment. In this paper, we introduce a new concept, ontology of tree structure ontology, for context sensitivity, as we found that many developed systems work in a context-invariant environment. Due to the effects of illumination on a supreme obstinate designing context-sensitive recognition system, we have focused on designing such a context-variant system using ontology of tree structure. Ontology can be defined as an explicit specification of conceptualization of a domain typically captured in an abstract model of how people think about things in the domain. People produce ontologies to understand and explain underlying principles and environmental factors. In this research, we have proposed context ontology, context modeling, context adaptation, and context categorization to design ontology of tree structure based on illumination criteria. After selecting the proper light-ontology domain, we benefit from selecting a set of actions that produces better performance on that domain. We have carried out extensive experiments on these concepts in the area of object recognition in a dynamic changing environment, and we have achieved enormous success, which will enable us to proceed on our basic concepts.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.8 no.4
• /
• pp.51-62
• /
• 2004

Fuzzy supervisory control technique for the seismic response control of cable-stayed bridges subject to earthquakes is studied. The proposed technique is a hybrid control method, which adopts a hierarchical structure consisting of several sub-controllers and a fuzzy supervisor. Sub-controllers are independently designed to reduced the responses to be controlled of a cable-stayed bridge, and a fuzzy supervisor achieves improved seismic control performance by tuning the pre-designed sub-controllers. It is realized by converting static gains of the sub-controllers into time-varying dynamic gains through the fuzzy inference mechanism. To evaluate the feasibility of the proposed technique, the benchmark control problem of cable-stayed bridge proposed by Dyke et al. is adopted. The control variables for the seismic response control of the cable-stayed bridge are determined to be t도 shear forces and bending moments at the base of the towers, the longitudinal displacements at the top of the towers, the relative displacements between the deck and the tower, and the tensions in the stay cables. Comparative results between the fuzzy supervisory controller and LQG controller demonstrate the effectiveness of the proposed control technique.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.663-674
• /
• 2005

We propose a system aimed at achieving high energy-delay efficiency by using adaptive victim caches. Particularly, we investigate methods to improve the hit rates in the first level of memory hierarchy, which reduces the number of accesses to mort power consuming memory structures such as L2 cache. Victim cache is a memory element for reducing conflict misses in a direct-mapped L1 cache. We present two techniques to fill the victim cache with the blocks that have higher probability to be re-reqeusted by processor. Hit-based victim cache ks tilled with the blocks which were referenced frequently by processor. Replacement-based victim cache is filled with the blocks which were evicted from the sets where block replacements had happened frequently According to our simulations, replacement-based victim cache scheme outperforms the conventional victim cache scheme about $2\%$ on average and refutes the power consumption by up to $8\%$.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.556-565
• /
• 2009

In this paper, we propose a CAD software framework to automatically generate a shop drawing. Shop drawing is to draw the geometric figures representing an arrangement of steel bars for a concrete building on its structural design, based on its construction specifications and the design rules, and its well-formed process lead to be automated. A key point of the design automation is to minimize the user interactions by automatically recognizing the design specifications and to finally generate the shape of the geometric figures. The graphic pipeline of the proposed framework consists of four stages; a specification DB, specification extraction, binding, and rendering. To effectively extract all specifications only for a figure from the DB and bind them to its shape, we use a hierarchical approach; the specifications are classified into three common, structural, and figure classes, and each attribute is extracted in design phases. Based on our framework, we implemented a specialized CAD for shop drawing using AutoCAD and could easily update it according to user's demands.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.15-22
• /
• 2004

This paper presents the channel analysis considering power distribution network(PDN) system of PCB. For achieve the target PDN system we proposed the useful design approach for acquiring the characteristic target of power distribution network in overall frequency ranges. The proposed method is based on the hierarchical approach related to frequency ranges and the path-based equivalent circuit model to consider the interference of the current paths between the decoupling capacitors and the board through it is a lumped model for fast and easy calculation, experimental results show that the proposed model is almost as precise as the numerical analysis. The analysis of PDN system shows that although the effective inductance of package dominatly affects the power noise and the signal transfer through data channel, the board PDNs also can not be neglected for achieving the accurate channel signaling. Therefore, we must design concurrently the chip, package, and board from the initial spec design of high speed digital system.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.573-584
• /
• 2003

Recent massive data generation by genomics and proteomics requires bioinformatic tools to extract the biological meaning from the massive results. Here we introduce ROSPath, a database system to deal with information on reactive oxygen species (ROS)-mediated cell signaling pathways. It provides a structured repository for handling pathway related data and tools for querying, displaying, and analyzing pathways. ROSPath data model provides the extensibility for representing incomplete knowledge and the accessibility for linking the existing biochemical databases via the Internet. For flexibility and efficient retrieval, hierarchically structured data model is defined by using the object-oriented model. There are two major data types in ROSPath data model: ‘bio entity’ and ‘interaction’. Bio entity represents a single biochemical entity: a protein or protein state involved in ROS cell-signaling pathways. Interaction, characterized by a list of inputs and outputs, describes various types of relationship among bio entities. Typical interactions are protein state transitions, chemical reactions, and protein-protein interactions. A complex network can be constructed from ROSPath data model and thus provides a foundation for describing and analyzing various biochemical processes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.204-211
• /
• 2011

Embedded systems require intensively complex and high power dissipating modules that have the capability of real-time high performance data processing, wide bandwidth communication, and low power consumption. However, the current battery technology has not been developed as much as meeting the requirements of portable embedded systems for long system lifetime. In this paper, new approach that operates with low energy consumption is proposed to overcome the situation while guaranteeing detection accuracy. The designed method associates a variety of detection algorithms hierarchically to detect events happening around the system. The Change for energy consumption characteristics is shown with change for probabilistic characteristics and those relationships are analytically explained from experiments. Furthermore, several techniques to consume low energy and achieve high detection accuracy are described, depending on the event static or dynamic characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1285-1296
• /
• 2011

Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.