• Title/Summary/Keyword: Optimal Path

Search Result 1,226, Processing Time 0.021 seconds

Character Segmentation using Side Profile Pattern (측면윤곽 패턴을 이용한 접합 문자 분할 연구)

  • Jung Minchul
    • Journal of Intelligence and Information Systems
    • /
    • v.10 no.3
    • /
    • pp.1-10
    • /
    • 2004
  • In this paper, a new character segmentation algorithm of machine printed character recognition is proposed. The new approach of the proposed character segmentation algorithm overcomes the weak points of both feature-based approaches and recognition-based approaches in character segmentation. This paper defines side profiles of touching characters. The character segmentation algorithm gives a candidate single character in touching characters by side profiles, without any help of character recognizer. It segments touching characters and decides the candidate single character by side profiles. This paper also defines cutting cost, which makes the proposed character segmentation find an optimal segmenting path. The performance of the proposed character segmentation algorithm in this paper has been obtained using a real envelope reader system, which can recognize addresses in U.S. mail pieces and sort the mail pieces. 3359 mail pieces were tested. The improvement was from $68.92\%\;to\;80.08\%$ by the proposed character segmentation.

  • PDF

Equal Energy Consumption Routing Protocol Algorithm Based on Q-Learning for Extending the Lifespan of Ad-Hoc Sensor Network (애드혹 센서 네트워크 수명 연장을 위한 Q-러닝 기반 에너지 균등 소비 라우팅 프로토콜 기법)

  • Kim, Ki Sang;Kim, Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.10
    • /
    • pp.269-276
    • /
    • 2021
  • Recently, smart sensors are used in various environments, and the implementation of ad-hoc sensor networks (ASNs) is a hot research topic. Unfortunately, traditional sensor network routing algorithms focus on specific control issues, and they can't be directly applied to the ASN operation. In this paper, we propose a new routing protocol by using the Q-learning technology, Main challenge of proposed approach is to extend the life of ASNs through efficient energy allocation while obtaining the balanced system performance. The proposed method enhances the Q-learning effect by considering various environmental factors. When a transmission fails, node penalty is accumulated to increase the successful communication probability. Especially, each node stores the Q value of the adjacent node in its own Q table. Every time a data transfer is executed, the Q values are updated and accumulated to learn to select the optimal routing route. Simulation results confirm that the proposed method can choose an energy-efficient routing path, and gets an excellent network performance compared with the existing ASN routing protocols.

An Energy- Efficient Optimal multi-dimensional location, Key and Trust Management Based Secure Routing Protocol for Wireless Sensor Network

  • Mercy, S.Sudha;Mathana, J.M.;Jasmine, J.S.Leena
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3834-3857
    • /
    • 2021
  • The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

Neighbor-Based Probabilistic Rebroadcast Routing Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks

  • Harum, Norharyati;Hamid, Erman;Bahaman, Nazrulazhar;Ariff, Nor Azman Mat;Mas'ud, Mohd Zaki
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.1-8
    • /
    • 2021
  • In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

Determination of Ship Collision Avoidance Path using Deep Deterministic Policy Gradient Algorithm (심층 결정론적 정책 경사법을 이용한 선박 충돌 회피 경로 결정)

  • Kim, Dong-Ham;Lee, Sung-Uk;Nam, Jong-Ho;Furukawa, Yoshitaka
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.56 no.1
    • /
    • pp.58-65
    • /
    • 2019
  • The stability, reliability and efficiency of a smart ship are important issues as the interest in an autonomous ship has recently been high. An automatic collision avoidance system is an essential function of an autonomous ship. This system detects the possibility of collision and automatically takes avoidance actions in consideration of economy and safety. In order to construct an automatic collision avoidance system using reinforcement learning, in this work, the sequential decision problem of ship collision is mathematically formulated through a Markov Decision Process (MDP). A reinforcement learning environment is constructed based on the ship maneuvering equations, and then the three key components (state, action, and reward) of MDP are defined. The state uses parameters of the relationship between own-ship and target-ship, the action is the vertical distance away from the target course, and the reward is defined as a function considering safety and economics. In order to solve the sequential decision problem, the Deep Deterministic Policy Gradient (DDPG) algorithm which can express continuous action space and search an optimal action policy is utilized. The collision avoidance system is then tested assuming the $90^{\circ}$intersection encounter situation and yields a satisfactory result.

Analytic simulator and image generator of multiple-scattering Compton camera for prompt gamma ray imaging

  • Kim, Soo Mee
    • Biomedical Engineering Letters
    • /
    • v.8 no.4
    • /
    • pp.383-392
    • /
    • 2018
  • For prompt gamma ray imaging for biomedical applications and environmental radiation monitoring, we propose herein a multiple-scattering Compton camera (MSCC). MSCC consists of three or more semiconductor layers with good energy resolution, and has potential for simultaneous detection and differentiation of multiple radio-isotopes based on the measured energies, as well as three-dimensional (3D) imaging of the radio-isotope distribution. In this study, we developed an analytic simulator and a 3D image generator for a MSCC, including the physical models of the radiation source emission and detection processes that can be utilized for geometry and performance prediction prior to the construction of a real system. The analytic simulator for a MSCC records coincidence detections of successive interactions in multiple detector layers. In the successive interaction processes, the emission direction of the incident gamma ray, the scattering angle, and the changed traveling path after the Compton scattering interaction in each detector, were determined by a conical surface uniform random number generator (RNG), and by a Klein-Nishina RNG. The 3D image generator has two functions: the recovery of the initial source energy spectrum and the 3D spatial distribution of the source. We evaluated the analytic simulator and image generator with two different energetic point radiation sources (Cs-137 and Co-60) and with an MSCC comprising three detector layers. The recovered initial energies of the incident radiations were well differentiated from the generated MSCC events. Correspondingly, we could obtain a multi-tracer image that combined the two differentiated images. The developed analytic simulator in this study emulated the randomness of the detection process of a multiple-scattering Compton camera, including the inherent degradation factors of the detectors, such as the limited spatial and energy resolutions. The Doppler-broadening effect owing to the momentum distribution of electrons in Compton scattering was not considered in the detection process because most interested isotopes for biomedical and environmental applications have high energies that are less sensitive to Doppler broadening. The analytic simulator and image generator for MSCC can be utilized to determine the optimal geometrical parameters, such as the distances between detectors and detector size, thus affecting the imaging performance of the Compton camera prior to the development of a real system.

Mesoporous Control Effect of Porous Carbon Nanofibers for Electrical Double-Layer Capacitors (전기 이중층 커패시터를 위한 다공성 탄소나노섬유의 메조 기공 제어 효과)

  • Jo, Hyun-Gi;Shin, Dong-Yo;Ahn, Hyo-Jin
    • Korean Journal of Materials Research
    • /
    • v.29 no.3
    • /
    • pp.167-174
    • /
    • 2019
  • To improve the performance of carbon nanofibers as electrode material in electrical double-layer capacitors (EDLCs), we prepare three types of samples with different pore control by electrospinning. The speciments display different surface structures, melting behavior, and electrochemical performance according to the process. Carbon nanofibers with two complex treatment processes show improved performance over the other samples. The mesoporous carbon nanofibers (sample C), which have the optimal conditions, have a high sepecific surface area of $696m^2g^{-1}$, a high average pore diameter of 6.28 nm, and a high mesopore volume ratio of 87.1%. In addition, the electrochemical properties have a high specific capacitance of $110.1F\;g^{-1}$ at a current density of $0.1A\;g^{-1}$ and an excellent cycling stability of 84.8% after 3,000 cycles at a current density of $0.1A\;g^{-1}$. Thus, we explain the improved electrochemical performance by the higher reaction area due to an increased surface area and a faster diffusion path due to the increased volume fraction of the mesopores. Consequently, the mesoporous carbon nanofibers are demonstrated to be a very promising material for use as electrode materials of high-performance EDLCs.

Planning and Evaluation of Synthetic Forest Road Network using GIS (GIS를 이용한 복합임도망의 계획 및 평가)

  • Kweon, Hyeongkeun;Seo, Jung Il;Lee, Joon-Woo
    • Journal of Korean Society of Forest Science
    • /
    • v.108 no.1
    • /
    • pp.59-66
    • /
    • 2019
  • This study was conducted to evaluate the effect of the synthetic forest road network by calculating the optimal road density and layout of the forest road network in order to construct the systematic road network in the forested area. For this, five comparative routes were additionally planed and compared through evaluation indicators. As a result, the optimum road density of the study site was estimated to be 18.4 m/ha, and the synthetic forest road network was the best in the four indicators such as average skidding distance, standard deviation of skidding distance, development index, and circuity factor. In addition, the synthetic forest road network was comparable to the main road network by about 4 %p in the timber volume available and potential area size for logging, but the construction cost of the road was about 20 %p lower. It showed a synthetic forest road network was better in terms of economy.

Performance Enhancement Scheme for RR Protocol in MIPv6 (MIPv6에서 RR프로토콜 성능개선 방안)

  • 이달원;황일선;손승원;조인준
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.5
    • /
    • pp.49-56
    • /
    • 2004
  • An Internet draft, named RR(Return Routability) protocol, proposed to IETF mobileip WG, in order to establish an optimal path to MN(Mobile Node) by securely sending the BU(Binding Update) message to CN(Correspondent Node). However, it has some problems with initiating the protocol by the MN: it causes to increases in communication load in the home network, to increases communication delay between MN and CN, and increases in communication load due to unnecessary message exchanges. To resolve the problems, this paper proposes an alternative scheme for the RR protocol in MIPv6. The proposed scheme is devised to start the protocol by HA on receiving the first packet from CN. It decreases the route optimization overhead by reducing the number of BU messages as well as the communication time. Beside these advantages, this scheme provides the same security grade as the original RR protocol.

Energy Efficient Route Search Using Marine Data (해양 데이터를 활용한 에너지 효율적인 최적 항로 탐색)

  • Kim, Seong-Ho;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.1
    • /
    • pp.44-49
    • /
    • 2020
  • Recently, one of the major issues of shipbuilding and marine is the reduction of air and marine pollution emission to ships. In response, the International Maritime Organization (IMO) has concluded an international convention (MARPOL) to prevent pollution from ships. A Annex Six of The Convention restricts and regulates air and marine pollution of ship from exhausting gases. To this end, it is required to apply EEDI (Energy Efficiency Design Indicators) to the construction of new ships, and to minimize the emission of environmental pollutants by recommending the application of EEOI (Energy Efficiency Operation Indicators) to operational ships. Therefore, in this study, we propose to calculate the grade of operating efficiency (EG) of ships based on actual operational data for transport ships and to provide energy-efficient optimal path search information through analysis of marine environment data.