• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.139-148
• /
• 2011

This paper presents the minimum-cost network selection scheme which determines the transmission instance in the multi-band maritime communication system, so that the shipment-related real-time information can be transmitted within the maximum allowed period. The transmission instances and the corresponding network selection process are modeled by a Markov Decision Process (MDP), for the channel model in the 2-state Markov chain, which can be solved by stochastic dynamic programming. It derives the minimum-cost network selection rule, which can reduce the network cost significantly as compared with the straight-forward scheme with a periodic transmission.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.1
• /
• pp.27-33
• /
• 2012

Let $f$ be a difeomorphism of a closed $n$ -dimensional smooth manifold M, and $p$ be a hyperbolic periodic point of $f$. Let ${\Lambda}(p)$ be a closed set which containing $p$. In this paper, we show that (i) if $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$, then ${\Lambda}(p)$ is the chain component which contains $p$. (ii) suppose $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$. Then if $f|_{\Lambda(p)}$ has the $C^{1}$-stably shadowing property then it is hyperbolic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• Journal of Korean Society of Transportation
• /
• v.28 no.5
• /
• pp.91-106
• /
• 2010

Recently, interest in supply chain management is rising along with the increasing oil prices and traffic congestion. In particular, people started studying the issue, but realized that advantageous strategies for suppliers and retailers are not always advantageous to a carrier. Therefore, in this study the atuhors set up a simulation scenario to understand delivery vehicle routing problems under various inventory policies, namely Economic Order Quantity (EOQ) and Periodic Order Quantity (POQ) and network configurations. First, the authors made a virtual supply chain. Then they analyzed characteristics of delivery vehicle routing under various inventory policies (EOQ and POQ) and network configurations. As a result, the POQ inventory policy decreases the number of vehicles, the number of drivers, and the service time of vehicles. Also, the centralized network increases the load factor of vehicles and decreases the service time of vehicles. In other words, the centralized network and the POQ inventory policy are better for the carrier. These results show a savings of 15,556,806 won ($13,389.10) in a month: a reduction of 17%.

• Journal of the Korean association of regional geographers
• /
• v.2 no.1
• /
• pp.133-150
• /
• 1996

This study is to clarify the market cycle of travelling merchants and the spatial behavior of consumer's commodity purchasing. its reasons and purchasing region of each commodity in Chongsan of Chongsan Myun(village) periodic markets, that is one of the lowest central places in Okchon county. The data used are the results of interviews with 58 travelling merchants on June 22 and July 17, 1994, and questionaire survey taken to parents of students of Chongsan middle school of Chongsan Myun in Okchon county. Study area is typical agricultural regions taking the role of central places to provide rural service and is comparatively important periodic markets. Some of findings are summarized as follows: (1) Until 1980's. appearance of closed periodic markets is caused by the population decrease in rural region, income increase, and rising of living level according to the Five Years Planning of Economic Development, appearance of chain stores of agricultural co-coperative and of supermarkets,. changes in distribution mechanisim by increasing consignment volume of agricultural products through agricultural co-coperative, and the development of transportation in Okchon county. These, too, became the reasons for the decline of the Chongsan periodic markets in Okchon county. (2) Most of the travelling merchants visiting the Chongsan periodic markets are in their 50's of age, and they sell the miscellaneous commodities and agricultural products. And about one-fourths of travelling merchants reside in regions with periodic markets and in Okchon of higher order central places. (3) Travelling routes visting periodic markets can be simplified to five types. Major types of travelling routes are Chongsan periodic market$\rightarrow$Wonnam$\rightarrow$Boun, and Chongsan periodic market$\rightarrow$Yungdong$\rightarrow$Yongsan. The patterns of travelling merchants visiting periodic markets are classified into the type of everyday visiting of periodic markets over three days of five days from merchant's residence to market, and the type of merchants or consumers visiting one day's of five days. On days that travelling merchants don't visit periodic markets they purchase the commodities in Seoul, Taejon and Chongju. (4) Consumers who use periodic markets are from thirties to fifties years of age and most of them are employed in agriculture. Consumers visit periodic markets on foot or by bus, and visit two or three times in a month, and mainly purchase the commodities for one or two hours from about ten o'clock in the morning. (5) Consumers purchase the necessaries of life in periodic markets, and other commodities are purchased in Taejon city, Youngdong, and Boun Eup(town). But consumers purchase the goods(convenience goods, shopping goods, and specialied goods) largerly in Chongsan, because additional expense and disadvantage after service with poor transportation service for purchased goods in others regions. Therefore, the hierarchies of central places by the consumer's purchasing behaviour can not be seem in dewellers in Chongsan and Chongseong Myun.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.4
• /
• pp.519-525
• /
• 2008

Let f be a diffeomorphisms of a compact $C^{\infty}$ manifold, and let p be a hyperbolic periodic point of f. In this paper, we prove that if generically, f is tame diffeomorphims then the following conditions are equivalent: (i) f is ${\Omega}$-stable, (ii) f has the $C^1$-stable shadowing property (iii) f has the $C^1$-stable inverse shadowing property.

• Bulletin of the Korean Chemical Society
• /
• v.13 no.6
• /
• pp.665-669
• /
• 1992

We consider the problem of a random walker on a one-dimensional lattice (N sites) confronting a centrally-located deep trap (trapping probability, T=1) and N-1 adjacent sites at each of which there is a nonzero probability s(0 < s < 1) of the walker being trapped. Exact analytic expressions for < n > and the average number of steps required for trapping for arbitrary s are obtained for two types of finite boundary conditions (confining and reflecting) and for the infinite periodic chain. For the latter case of boundary condition, Montroll's exact result is recovered when s is set to zero.

• Korean Journal of Microbiology
• /
• v.47 no.4
• /
• pp.328-334
• /
• 2011

Leucine zipper motif consists of multiple periodic leucine residues, which forms amphipathic alpha helix. The hydrophobic nature of leucine zipper motif can dimerize proteins which contain this motif. Leucine zipper motif addition at C-terminus of single-chain Fv (ScFv) antibody induces its dimerization. Since the dimeric ScFv antibody contains two antigen binding sites (bivalency) like Y-shaped complete antibody, it could increase avidity. As a result, it could show higher antigen binding activity than monomeric ScFv antibodies. Based on this concept, monomeric chicken 8C3 ScFv antibody previously developed from chicken hybridoma was dimerized by the addition of leucine zipper motif at C-terminus of ScFv antibody. The dimeric 8C3 ScFv antibody specifically reacted with Eimerian sporozoite which causes Avian Coccidiosis. As expected, dimeric 8C3 ScFv antibody showed 3-folds higher antigen binding activity than monomer due to increased avidity. In addition, protien yields of dimer expression were 2-folds higher than monomer.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.81-87
• /
• 2001

In a dynamically changing environment, the manager of a maintenance and remodeling (M/R) program is confronted with an increasing complexity of coordinating and cooperating multi-resource constrained multiple projects. The root causes of the complexity, uncertainty and interdependence, cause an internal disruption of an activity and chain reactions of disturbance propagation that deteriorate the stability and manageability of the program. This paper evaluates previous endeavors to apply production control and management techniques to the construction industry, and investigates the possibility of applying other management concepts and theories to organizational program management. In particular, this paper proposes a buffer allocation model by which periodic buffers are allocated in the flows of program constraint resources to stabilize a program master schedule instead of protecting individual activities. Comparative experiments by Monte Carlo simulations illustrate improved performance of the proposed model in terms of program's goals: productivity, flexibility, and long-term stability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.2
• /
• pp.77-85
• /
• 2014

Recently, utilization of MIMO(Multi-Input Multi-Output) system using array antennas is evaluated significantly according to the extension of high-capacity and high-speed communication services. However, MIMO system has disadvantages such as high-complexity and high-power-consumption, because RF(Radio Frequency) chain is required as antenna number, and several array antenna is used in conventional MIMO system. In order to solve these problems, research about beamspace MIMO system using ESPAR(Electronically Steerable Parasitic Array Radiator) antenna that has single RF chain by using one active antenna and several parasitic elements has been studied actively. Beamspace MIMO system using ESPAR antenna is possible to solve the problems of conventional MIMO system, because this system is composed by single RF chain. In this paper, in order to improve the system security, chaos communication algorithm that has characteristics such as non-periodic, non-predictability, easy implementation and initial condition is applied to QPSK (Quadrature Phase Shift Keying) modulated beamspace MIMO system. We design the chaos QPSK modulated beamspace MIMO system, and evaluate SER performance of this system.