• Title/Summary/Keyword: grouping mechanism

Search Result 50, Processing Time 0.025 seconds

In Silico Analysis of Lactic Acid Secretion Metabolism through the Top-down Approach: Effect of Grouping in Enzyme kinetics

  • Jin, Jong-Hwa;Lee, Jin-Won
    • Biotechnology and Bioprocess Engineering:BBE
    • /
    • v.10 no.5
    • /
    • pp.462-469
    • /
    • 2005
  • A top-down approach is known to be a useful and effective technique for the design and analysis of metabolic systems. In this Study, we have constructed a grouped metabolic network for Lactococcus lactis under aerobic conditions using grouped enzyme kinetics. To test the usefulness of grouping work, a non-grouped system and grouped systems were compared quantitatively with each other. Here, grouped Systems were designed as two groups according to the extent of grouping. The overall simulated flux values in grouped and non-grouped models had pretty similar distribution trends, but the details on flux ratio at the pyruvate branch point showed a little difference. This result indicates that our grouping technique can be used as a good model for complicated metabolic networks, however, for detailed analysis of metabolic network, a more robust mechanism Should be considered. In addition to the data for the pyruvate branch point analysis, Some major flux control coefficients were obtained in this research.

An efficient matching mechanism for real-time sensor data dissemination (실시간 센서 데이터 배포를 위한 효율적 매칭)

  • Seok, Bo-Hyun;Lee, Pill-Woo;Huh, Eui-Nam
    • Journal of Internet Computing and Services
    • /
    • v.9 no.1
    • /
    • pp.79-90
    • /
    • 2008
  • In the ubiquitous environment sensor network technologies have advanced for collecting information of the environment. With the rapid growth of sensor network technology, it is necessary and important to share the collected sensor data with a large base of diverse users. In order to provide dissemination of sensor data, we design an information dissemination system using an independent disseminator between provider and consumer. This paper describes how we designed the information dissemination system using one of the possible dissemination patterns for sensor networks, and an efficient matching algorithm called CGIM (Classed Grouping Index Matching) which employs a dynamic re-grouping scheme.

  • PDF

Multiple Ant Colony System (MACS) for the Dynamic Sectorization in Microcellular System (마이크로셀룰러 시스템에서 동적 섹터결정을 위한 MACS)

  • Kim, Sung-Soo;Hong, Soon-Jung;Ahn, Seung-Bum
    • IE interfaces
    • /
    • v.19 no.1
    • /
    • pp.1-8
    • /
    • 2006
  • The mobile communication network has to offer good quality of services (QoS), high capacity, and more coverage at a lower cost. However, with the increase of cellular user, the shortage of capacity due to unbalanced call distribution and lack of QoS are common. This paper deals with dynamic sectorization for efficient resource management to solve load unbalancing among microcells in CDMA (Code Division Multiple Access) microcellular system. Dynamic load balancing can be effected by grouping micro-cells properly and grouping can be developed through a routing mechanism. Therefore, we use ants and their routes to choose the optimum grouping of micro-cells into sectors using Multiple Ant Colony System (MACS)in this paper.

A Dynamic Grouping Mechanism in Wireless Sensor Networks (무선 센서 네트워크에서의 동적 그룹화 메커니즘)

  • Park, Kwang-Che;Kim, Hyon-Yul;Bae, Cheol-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.6 no.4
    • /
    • pp.208-215
    • /
    • 2013
  • In recent years, many applications in WSN have increasingly interested in data transfer reliability. In this paper, we propose a dynamic grouping transfer mechanism which maintains both reliability and energy efficiency in transmission from a source to a sink. The proposed scheme considers channel error of each node. Then it uses an end-to-end ACK transmission in a group and a hop-by-hop ACK transmission between groups. Consequently this mechanism minimize the cost of packet transfer along with enhancing the network lifetime and reliability.

An Efficient Group Key Distribution Mechanism for the Secure Multicast Communication in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 안전한 멀티캐스트 통신을 위한 효율적인 그룹 키 분배 방식)

  • Lim Yu-Jin;Ahn Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.339-344
    • /
    • 2006
  • Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

Genealogy grouping for services of message post-office box based on fuzzy-filtering (퍼지필터링 기반의 메시지 사서함 서비스를 위한 genealogy 그룹화)

  • Lee Chong-Deuk;Ahn Jeong-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.701-708
    • /
    • 2005
  • Structuring mechanism, important to serve messages in post-office box structure, is to construct the hierarchy of classes according to the contents of message objects. This Paper Proposes $\alpha$-cut based genealogy grouping method to cluster a lot of structured objects in application domain. The proposed method decides the relationship first by semantic similarity relation and fuzzy relation, and then performs the grouping by operations of search( ), insert() and hierarchy(). This hierarchy structure makes it easy to process group-related processing tasks such as answering queries, discriminating objects, finding similarities among objects, etc. The proposed post-office box structure may be efficiently used to serve and manage message objects by the creation of groups. The Proposed method is tested for 5500 message objects and compared with other methods such as non-grouping, BGM, RGM, OGM.

A Design of Service Migration Mechanism in HTML5-based Convergence Service (HTML5 기반 융합 서비스의 서비스이동 메커니즘 설계)

  • Choi, Hun-Hoi;Song, Eun-Ji;Kim, Geun-Hyung;Kim, Hwa-Sook;Cho, Ki-Seong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.540-551
    • /
    • 2012
  • Recently, the W3C has developed the HTML5 standard which gives the basis for providing various web applications on the web environments. Because of the advent of the smart devices and the broadband wireless network, users can accesse the web applications on the smart devices at anytime and anywhere. In addition, the demand on the multiscreen services, which enables users to use the appropriate device to their situation, has increased, since users have various smart devices. In this paper, we propose the grouping mechanism of web objects on the HTML5 based web platform, the extraction mechanism of the web object information which is used to create the web object on other devices, and the web object creation mechanism based on the received web object information. In addition, we propose the web service migration architecture between devices on the open web platform and implement the grouping, extraction and creation mechanism of the web objects on the test web document and generic web document with Chrome extension. Finally, we implement the delivery mechanism of the web object information between devices using the node.js and the WebSocket technologies.

Research on supporting the group by clause reflecting XML data characteristics in XQuery (XQuery에서의 XML 데이터 특성을 고려한 group by 지원을 위한 질의 표현 기법에 대한 연구)

  • Lee Min-Soo;Cho Hye-Young;Oh Jung-Sun;Kim Yun-Mi;Song Soo-Kyung
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.501-512
    • /
    • 2006
  • XML is the most popular platform-independent data expression which is used to communicate between loosely coupled heterogeneous systems such as B2B Applications or Workflow systems. The powerful query language XQuery has been developed to support diverse needs for querying XML documents. XQuery is designed to configure results from diverse data sources into a uniquely structured query result. Therefore, it became the standard for the XML query language. Although the latest XQuery supports heavy search functions including iterations, the grouping mechanism for data is too primitive and makes the query expression difficult and complex. Therefore, this work is focused on supporting the groupby clause in the query expression to process XQuery grouping. We suggest it to be a more efficient way to process grouping for restructuring and aggregation functions on XML data. We propose an XQuery EBNF that includes the groupby clause and implemented an XQuery processing system with grouping functions based on the eXist Native XML Database.

Grouping Method based on Adaptive Load Balancing for the Intelligent Resource Management of a Cloud System (클라우드 시스템의 지능적인 자원관리를 위한 적응형 부하균형 기반 그룹화 기법)

  • Mateo, Romeo Mark A.;Yang, Hyun-Ho;Lee, Jae-Wan
    • Journal of Internet Computing and Services
    • /
    • v.12 no.3
    • /
    • pp.37-47
    • /
    • 2011
  • Current researches in the Cloud focus on the appropriate interactions of cloud components in a large-scale system implementation. However, the current designs do not include intelligent methods like grouping the similar service providers based on their properties and integrating adaptive schemes for load distribution which can promote effective sharing of resource. This paper proposes an efficient virtualization of services by grouping the cloud providers to improve the service provisioning. The grouping of cloud service providers based on a cluster analysis collects the similar and related services in one group. The adaptive load balancing supports the service provisioning of the cloud system where it manages the load distribution within the group using an adaptive scheme. The proposed virtualization mechanism (GRALB) showed good results in minimizing message overhead and throughput performance compared to other methods.

Efficient Grouping of Wireless Terminals for Long Distance High-Rate Transmission in IEEE 802.11 (IEEE 802.11의 원거리 고속 데이터 전송을 위한 무선 단말들의 효율적인 그룹화 알고리즘)

  • Woo Sung-Je;Lee Tae-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.6 s.324
    • /
    • pp.25-31
    • /
    • 2004
  • fireless LAN can offer high data rate communication between wireless terminals. In IEEE 802.11 wireless LAN, a basic service unit is called a Basic Service Set (BSS), which consists of one AP and more than one wireless terminals. Terminals far from the AP may not communicate with high data rate because signal strength is weakened as they move away from the AP. In this paper we propose a method to permit high speed data transmission by grouping terminals and by using part of wireless terminals as repeaters. We analyze the proposed and algorithm via simulations. Our proposed grouping mechanism is shown to be an effective way to increase the distance for high rate transmission.