• Title/Summary/Keyword: best route

Search Result 190, Processing Time 0.038 seconds

Synthesis and Characterization of Phase Pure NiO Nanoparticles via the Combustion Route using Different Organic Fuels for Electrochemical Capacitor Applications

  • Srikesh, G.;Nesaraj, A. Samson
    • Journal of Electrochemical Science and Technology
    • /
    • v.6 no.1
    • /
    • pp.16-25
    • /
    • 2015
  • Transition metal oxide nanocrystalline materials are playing major role in energy storage application in this scenario. Nickel oxide is one of the best antiferromagnetic materials which is used as electrodes in energy storage devices such as, fuel cells, batteries, electrochemical capacitors, etc. In this research work, nickel oxide nanoparticles were synthesized by combustion route in presence of organic fuels such as, glycine, glucose and and urea. The prepared nickel oxide nanoparticles were calcined at 600℃ for 3 h to get phase pure materials. The calcined nanoparticles were preliminarily characterized by XRD, particle size analysis, SEM and EDAX. To prepare nickel oxide electrode materials for application in supercapacitors, the calcined NiO nanoparticles were mixed with di-methyl-acetamide and few drops of nafion solution for 12 to 16 h. The above slurry was coated in the graphite sheet and dried at 50℃ for 2 to 4 h in a hot air oven to remove organic solvent. The dried sample was subjected to electrochemical studies, such as cyclic voltammetry, AC impedance analysis and chrono-coulometry studies in KOH electrolyte medium. From the above studies, it was found that nickel oxide nanoparticles prepared by combustion synthesis using glucose as a fuel exhibited resulted in low particle diameter (42.23 nm). All the nickel oxide electrodes have shown better good capacitance values suitable for electrochemical capacitor applications.

Design and Implementation of a Service Platform that Recommends the Optimal Shortest Distance as a Patrol Route

  • Jo, Yu-min;Jang, Ye-jin;Paik, Jong-ho
    • Journal of Internet Computing and Services
    • /
    • v.23 no.1
    • /
    • pp.1-9
    • /
    • 2022
  • Recently, interest in living safety and crime prevention is increasing. The reality is that most women have anxiety about social safety and ultimately want a safe return to home. As a result of these issues, the Seoul Metropolitan Government and the National Police Agency are implementing various services to alleviate them. However, there are limitations such as that the service can be used only during a limited time or the process of checking whether the patrol is really completed is complicated. Therefore, in this paper, we propose a service platform that overcomes these limitations and suggests the best and shortest patrol route to the police based on the desired patrol location applied by citizens. It is designed based on the MVC pattern, and the functions are divided for each user. It is hoped that the platform will reduce crime rates and allow citizens to ultimately return home with peace of mind. Also we expect that the police will ablet to find places where they did not know about or need to patrol with more attention through the recommended route of the platform, which will be helpful in their task.

An Efficient MPLS Routing System for Supporting QoS and Best-Effort Services (QoS 서비스와 최선형 서비스를 위한 효율적인 MPLS 라우팅 시스템)

  • Jeon, Hahn-Earl;Kim, Sung-Dae;Shin, Yong-Chul;Lee, Jai-Yong;Kim, Hyung-Taek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.71-79
    • /
    • 2003
  • As the traffic grows rapidly in the Internet, the QoS guarantee of the flows and the traffic engineering problems have become very important issues. MPLS has more advantages to solve the problems than existing IP routing because of its use of multiple paths between the source and destination pairs Particularly, the availability of Constraint-based Shortest Path First(CSPF) algorithm and explicit route in MPLS made the problem referred above to be solved efficiently. However, the CSPF algorithm has the characteristic of selecting the shortest path of all paths which meet the traffics' QoS constraints Therefore, even though there are alternative paths to route traffic, alternate QoS paths may not be found and best-effort traffic will be dropped during congestion period In this paper, we present the network resource optimization method related to the traffic engineering by using load balancing through routing in MPLS network.

A Novel Route to New Bis(benzopyrano) Fused Dihydropyridines Using Dry Media

  • Kidwai, Mazaahir;Rastogi, Shweta;Mohan, Richa
    • Bulletin of the Korean Chemical Society
    • /
    • v.25 no.1
    • /
    • pp.119-121
    • /
    • 2004
  • A new and efficient synthesis of the novel bioactive bis(benzopyrano) fused dihydropyridines is described. The conventionally developed route is a two step multicomponent condensation reaction. This is latter modified by a one pot microwave (MW) assisted reaction using inorganic solid support via the arylidene derivative intermediate. With this environmentally benign approach, the reaction time is brought down from hours to minutes along with a yield enhancement. Furthermore, the role of different solid supports is studied and it is concluded that the acidic alumina is the best solid support for the present investigation.

Route Selection of the Welfare-type Community Bus in Nagasaki City

  • Yugeta, Shouhei;Watanabe, Kohei;Gotoh, Keinosuke
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.531-533
    • /
    • 2003
  • This study aims at discussing the future trend of the community bus and attempted to route selection by using GIS for the welfare-type community bus, which satisfies the need of elderly and physically handicapped persons in Nagasaki City. In doing so, we have conducted field survey in some sample cities of Kyushu, Japan for taking lessons from the present state analysis of community bus already operating there. As a result of the study, we have been able to identify some best possible routes for the community bus operation in Nagasaki City, which meets the requirement of the welfare community as well as of the general passengers.

  • PDF

A Study on the Optimal Probability Distribution for the Time Interval Between Ships on the Traffic Route of the Busan North Port (부산 북항 통항 선박간의 시간간격 최적 확률분포에 관한 연구)

  • Kim, Jong-Kwan
    • Journal of Navigation and Port Research
    • /
    • v.43 no.6
    • /
    • pp.413-419
    • /
    • 2019
  • Traffic routes typically have heavy traffic. Especially, the entrance of the route has a high risk of accidents occurring because of ships entering and exiting the port. However, almost of studies have focused on the distribution of traffic on the route. Thus, studies on the distribution between ships for passing through the route are insufficient. The purpose of this study was to analysis the traffic in the Busan north port No.1 route for one week. Based on present traffic conditions, one gate line was settled on the route with an analysis of traffic conditions. Based on the analysis data, each optimal time probability distribution between ships was divided into inbound/outbound and traffic volume. An analysis of the optimal probability distribution, was applied to 31 probability distributions divided into bounded, unbounded, non-negative, and advanced probability distribution. The KS test was applied for identifying three major optimal time probability distributions. According to the KS test results, the Wakeby distribution is the best optimal time probability distribution on the designated route. Although the optimal time probability distribution for other transportation studies such as on vehicles on highways is a non-negative probability distribution, this distribution is an advanced probability distribution. Thus, the application of major probability distribution for using other transportation studies is not applicable to this study Additionally, the distance between ships in actual traffic surveys and the distance estimated by the optimal probability distribution were compared. As a result of the comparison, those distances were fairly similar. However, this study was conducted in only one major port. Thus, it is necessary to investigate the time between ships and calculate a traffic volume on varying routes in future studies.

Development of HAZMAT Information System (수송안전정보시스템 개발)

  • 안승범;김시곤;김용진;홍우식
    • Journal of the Korea Safety Management & Science
    • /
    • v.6 no.2
    • /
    • pp.49-65
    • /
    • 2004
  • Ministry of Environment developed ‘Emergency Response Information System (ERIS)’ in 2001, which is in operation. As a next step, currently National Emergency Response Information System (NERIS) is being developed. The main difference among ERIS and NERIS is to enhance the system in the national level, including transportation of hazardous materials. This paper introduces concepts and methods applied to NERIS, especially HAZMAT, and the information system, operating strategies. Based on GIS and transportation-network data, the best route can be offered using Risk Analysis. Strategies for reporting and first-response information systems are also designed for emergencies in the paper.

Two axis control characteristics of linear motor feed system (리니어모터 이송시스템의 2축제어특성에 관한 연구)

  • 유송민;신관수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2002.10a
    • /
    • pp.405-410
    • /
    • 2002
  • Linear motor food system control algorithm was extended to the two axis system. Among several factors considered, overshoot of the response was the most important one in minimizing position tracking error. Balance between overshoot and settling time has to be adjusted to guarantee to best tracking performance. Tracking route was carefully executed to eliminate the possible error during the machining process. Even though there exists slight discrepancy between desired mute and cutting track at the corner, precision machining could be implemented using the cutting scheme introduced.

  • PDF

Improved Ad Hoc On-demand Distance Vector Routing(AODV) Protocol Based on Blockchain Node Detection in Ad Hoc Networks

  • Yan, Shuailing;Chung, Yeongjee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.46-55
    • /
    • 2020
  • Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

Ant Colony System for Vehicle Routing Problem with Time Window (시간제약이 있는 차량경로문제에 대한 개미군집 시스템 해법)

  • Lee, Sang-Heon;Lee, Seung-Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.1
    • /
    • pp.153-165
    • /
    • 2009
  • This paper apollos an ant colony system (ACS) for the vehicle routing problem with time window (VRPTW). The VRPTW is a generalization of the VRP where the service of a customer can begin within the time windows defined by the earliest and latest times when the customer will permit the start of service. The ACS has been applied effectively in geographical environment such as TSP or VRP by meta-heuristic that imitate an ant's biologic special duality in route construction, 3 saving based ACS (SB-ACS) is introduced and its solution is improved by local search. Through iterative precesses, the SB-ACS is shown to drive the best solution. The algorithm has been tested on 56 Solomon benchmarking problems and compared to the best-known solutions on literature. Experimental results shows that SB-ACS algorithm could obtain food solution in total travel distance minimization.