• 한국생물공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.783-784
• /
• 2003

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.391-398
• /
• 2010

Because mobile sensor network is different with the existing wireless sensor network with fixed nodes, it is more difficult to implement a positioning algorithm in mobile sensor network than in mobile sensor network. In case of fast moving node, a positioning algorithm may be not completed in a given time. In this paper we present the positioning algorithm that improves performance and can complete a computation in time on mobile sensor network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1529-1532
• /
• 2004

A Mobile Ad Hoc NETwork (MANET) is a collection of wireless mobile nodes that forms a temporary network without the need for any existing network infrastructure or centralized administration. Therefore, such a network is designed to operate in a highly dynamic environment due to node mobility. In mobile ad hoc network, frequent topological changes cause routing a challenging problem and without the complete view of the network topology, establishing the shortest path from the source node to the destination node is difficult. In this paper, we suggest a routing approach which utilizes location information to setup the shortest possible path between the source node and the destination node. Location information is obtained through Global Positioning System (GPS) and this geographical coordinate information of the destination node is used by the source node and intermediate nodes receiving route request messages to determine the shortest path to the destination from current node.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.704-710
• /
• 2007

This paper examines the operations of private housing developers (PHDs) based on Social Network Theory. PHDs need to choose the best consultants, contractors and suppliers (CCS) to make sure the project run and complete successfully. PHDs gather the scarce resources from the external environment through personal network. This research used the social network method which relies on alliances based on network, social, tie and trust. The more people/firm PHDs network with, the better chances of finding the right CCS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.12
• /
• pp.885-893
• /
• 2006

The Bayesian network(BN) has emerged in recent years as a powerful technique for handling uncertainty iii complex domains. Parameter learning of BN to find the most proper network from given data set has been investigated to decrease the time and effort for designing BN. Off-line learning needs much time and effort to gather the enough data and since there are uncertainties in real world, it is hard to get the complete data. In this paper, we propose an online learning method of Bayesian network parameters from incomplete data. It provides higher flexibility through learning from incomplete data and higher adaptability on environments through online learning. The results of comparison with Voting EM algorithm proposed by Cohen at el. confirm that the proposed method has the same performance in complete data set and higher performance in incomplete data set, comparing with Voting EM algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.411-417
• /
• 2008

This paper proposes BSFP (Bluetooth Scatternet Formation Protocol), which establishes a multi-hop bluetooth scatternet. BSFP independently operates on each bluetooth device, does not require any information on neighbor devices at the very beginning, and can establish a scatternet even though all the devices are spreaded beyond the bluetooth transmission range. BSFP is composed of the following three stages; 1) Init stage to investigate neighbor nodes, 2) Ready stage to establish a scatternet using gathered local information at each node, and 3) Complete stage to use the determined scatternet links. In BSFP, the scatternet formation time does not significantly affected by the number of bluetooth devices and a robust mobile ad hoc network is formed because BSFP formulates a scatternet with many adjacent links to neighbor devices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• MALSORI
• /
• no.50
• /
• pp.51-69
• /
• 2004

In this paper, we present a one-pass semi-dynamic network decoding framework that inherits both advantages of fast decoding speed from static network decoders and memory efficiency from dynamic network decoders. Our method is based on the novel language model network representation that is essentially of finite state machine (FSM). The static network derived from the language model network [1][2] is partitioned into smaller subnetworks which are static by nature or self-structured. The whole network is dynamically managed so that those subnetworks required for decoding are cached in memory. The network is near-minimized by applying the tail-sharing algorithm. Our decoder is evaluated on the 25k-word Korean broadcast news transcription task. In case of the search network itself, the network is reduced by 73.4% from the tail-sharing algorithm. Compared with the equivalent static network decoder, the semi-dynamic network decoder has increased at most 6% in decoding time while it can be flexibly adapted to the various memory configurations, giving the minimal usage of 37.6% of the complete network size.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1031-1033
• /
• 1996

Now is an automation age. Therefore it is required that machine can do work which was done by men. Artificial Neural Network was developed by the necessity of this purpose. This paper shows a Predictive Control with a Neural Network. The Neural Network learns an Inverted Pendulum in various situations. Then, it has a power to predict the next state after accept the current state. And the Neural Network directs the Bang-Bang Controller to give input to a plant. It seems like that a human expert looks the state of a plant and then controls the plant. It is used a Feedforward Neural Network and shown control state according to the learning. We could get a satisfactory results after complete learning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.379-394
• /
• 2012

The ever-increasing demand for H.264 scalable video coding (H.264/SVC) distribution motivates researchers to devise ways to enhance the quality of video delivered on the Internet. Furthermore, researchers and practitioners in general depend on computer simulators to analyze or evaluate their designed network architecture or proposed protocols. Therefore, a complete toolset, which is called myEvalSVC, for evaluating the delivered quality of H.264/SVC transmissions in a simulated environment is proposed to help the network and video coding research communities. The toolset is based on the H.264 Scalable Video coding streaming Evaluation Framework (SVEF) and extended to connect to the NS2 simulator. With this combination, people who work on video coding can simulate the effects of a more realistic network on video sequences resulting from their coding schemes, while people who work on network technology can evaluate the impact of real video streams on the proposed network architecture or protocols. To demonstrate the usefulness of the proposed new toolset, examples of H.264/SVC transmissions over 802.11 and 802.11e are provided.