• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.5
• /
• pp.1129-1140
• /
• 2017

Unidirectional data transmission system, which allows physical one way transmission, removes the backward link physically to prevent the intrusion from the outside through the network. However, the system is difficult to apply to the environment requiring either backward transmissions or bi-directional communications. In this paper, we proposed Limited Two-way communications system, called as LimTway, which only allows outbound TCP two-way communications. LimTway uses two one-way links(forward, backward). While the forward one-way link is staying to be activated so that an allowed outbound UDP traffic could be transmitted one-way always, the backward one-way link is activated while allowed outbound TCP sessions are established. In order to prevent the intrusion from the outside during the period, the software of LimTway is designed to allow only the transmissions of both outbound TCP two-way communication traffics and outbound UDP traffics.

• Journal of Korea Technology Innovation Society
• /
• v.1 no.1
• /
• pp.69-82
• /
• 1998

As a new medium for knowledge diffusion, E-Journal is expected to be a general type of scholarly communication. However, the techno - economic problems have hindered the advancement of the E-Journal. For the technical aspects, there are problems such as the standardization of document format, automatization of the document preparation, forward and backward link between documents. Also there are necessities for the support of the information infrastructure of digital library and information superhighway. For the economic domain, reengineering of total publishing cycle is considered and the new paradigm of peer review is analyzed. We pointed out that the main difficulties in the diffusion of E-Journal are on the promotion of service and technological advance, not the price and marketing strategy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.67-72
• /
• 2001

Convolutional code and turbo code are used in the forward and backward link of IMT-2000. In this research, we will be in consideration of Viterbi algorithm In this paper, we design Viterbi decoder with 3-bits soft decision and SMT for the convolutional code in the forward link and backward link of IMT-2000 system. The major parameters of 3-bits Viterbi decoder is determined by simulation to have identical performance with the 4-bit soft decision Viterbi decoder.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.483-486
• /
• 1988

Link-by-link and end-to-end signaling affect the probability of inefficient trunk seizure, the usage of backward signal features, post dialing delay, total signal information processing load, each differently. Considering the circumtances of the domestic public switched telephone network, we conclude that end-to-end signaling is better suited to the domestic network.

• Journal of Distribution Science
• /
• v.14 no.2
• /
• pp.41-45
• /
• 2016

Purpose - Finding an optimal path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node. Research design, data, and methodology - To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution. Results - First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network. Conclusions - We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them. Extending our models for visiting two or more destinations is one of the further research topics.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.85-96
• /
• 2004

Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.

• Journal of the Optical Society of Korea
• /
• v.17 no.1
• /
• pp.57-62
• /
• 2013

We have numerically implemented a receiver side all-optical signal processing method, i.e. optical backward propagation (OBP), by dispersion compensating fiber (DCF) and non-linear compensator (NLC) devised by effective negative Kerr non-linear coefficient using two highly non-linear fibers (HNLFs). The method is implemented for the post-processing of fiber transmission impairments, i.e. chromatic dispersion (CD) and non-linearities (NL). The OBP module is evaluated for dual-polarization (DP) m-ary (m=4,16,32,64,256) quadrature amplitude modulation (QAM) in 112 Gbit/s coherent transmission over 1200 km standard single mode fiber (SMF). We have also investigated an intensity limited optical backward propagation module (IL-OBP) by using a self-phase modulation-based optical limiter with an appropriate pre-chirping to compensate for the intensity fluctuations in the transmission link. Our results show that in highly non-linear sensitive 256QAM transmission, we have observed a 66% increase in the transmission distance by implementing IL-OBP as compared to conventional OBP.

• ETRI Journal
• /
• v.9 no.1
• /
• pp.84-96
• /
• 1987

The equality relation is very important in mechanical theorem proving procedures. A proposed inference rule called RHU-resolution is intended to extend the hyperparamodulation[23, 9] by introducing a bidirectional proof search that simultaneously employs a forward reasoning and a backward reasoning, and generalize it by incorporating beneflts of extended hyper steps with a preprocessing process, that includes a subsumption check in an equality graph and a high level planning. The forward reasoning in RHU-resolution may replace the role of the function substitution link.[9] That is, RHU-deduction without the function substitution link gets a proof. In order to control explosive generation of positive equalities by the forward reasoning, we haue put some restrictions on input clauses and k-pd links, and also have included a control strategy for a positive-positive linkage, like the set-of-support concept, A linking path between two end terms can be found by simple checking of linked unifiability using the concept of a linked unification. We tried to prevent redundant resolvents from generating by preprocessing using a subsumption check in the subsumption based eauality graph(SPD-Graph)so that the search space for possible RHU-resolution may be reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.74-90
• /
• 2014

Routing in mobile wireless sensor networks (MWSNs) is an extremely challenging issue due to the features of MWSNs. In this paper, we present a novel bio-inspired trusted routing protocol (B-iTRP) based on artificial immune system (AIS), ant colony optimization (ACO) and Physarum optimization (PO). For trust mechanism, B-iTRP monitors neighbors' behavior in real time and then assesses neighbors' trusts based on AIS. For routing strategy, each node proactively finds routes to the Sink based on ACO. When a backward ant is on the way to return source, it senses the energy residual and trust value of each node on the discovered route, and calculates the link trust and link energy of the route. Moreover, B-iTRP also assesses the availability of route based on PO to maintain the route table. Simulation results show how B-iTRP can achieve the effective performance compared to existing state-of-the-art algorithms.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.