• 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.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.2 s.6
• /
• pp.199-211
• /
• 1995

Bus, Which is together with subway the main part of public transportation modes in the city, is reviewed for the development of an optimal feeder-bus service area. Based on the IDRISI of GIS package, and taking into account of the convenience of downtown-oriented public transportation users at peak time, a model for the development of feeder-bus service area and a solution and introduced. Major result in this study is as follows: Development is given to a model that is designed to overcome the shortage of the existing models, which has limits in simulating the real situation; Variables were used in combination so that bus and subway route, station spacing, and operating frequency can be determined simultaneously, which enables to elucidate the mutual relationship and the structure in public transportation system. A model for feeder-bus area development is also given applied to determination and opening of subway and urban express bus route and new transportation systems. The model developed in this paper is useful in the case of extension and opening of subway and urban express bus route and new transportation Systems.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.408-417
• /
• 2011

The stringent performance requirement for the high efficiency of routing protocols on the Internet can be satisfied by exploiting the threaded border gateway protocol (TBGP) on multi-cores, but the state-of-the-art TBGP performance is restricted by a mass of contentions when racing to access the routing table. To this end, the highly-efficient parallel access approach appears to be a promising solution to achieve ultra-high route processing speed. This study proposes a general routing table structure consisting of two-level tries for fast parallel access, and it presents a heuristic-based divide-and-recombine algorithm to solve a mass of contentions, thereby accelerating the parallel route updates of multi-threading and boosting the TBGP performance. As a projected TBGP, this study also modifies the table operations such as insert and lookup, and validates their correctness according to the behaviors of the traditional routing table. Our evaluations on a dual quad-core Xeon server show that the parallel access contentions decrease sharply by 92.5% versus the traditional routing table, and the maximal update time of a thread is reduced by 56.8 % on average with little overhead. The convergence time of update messages are improved by 49.7%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.5
• /
• pp.1311-1318
• /
• 2008

This study aims at proposing a method to guide people to the most efficient route in an emergency through addressing the limitations of the existing research and providing a solution. Most of the existing intelligent guidance system tend to guide people to the shortest-distance path to the exit. A problem lies to the fact that the shortest-distance path doest not gurantee the most efficient way of evacuation. Rather than taking the shortest-distance path, this research proposes a way of taking the shortest-time path by introducing a real time loop sensor.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.315-322
• /
• 1998

It is discussed how to route yard-side equipment during the loading operation in port container terminals. The number of containers to be picked up at each yard-bay, as well as the route of a yard-side equipment (for example, transfer crane or straddle carrier) in a yard, are determined. The objective of the problem is to minimize the total container handling time in the yard. An encoding method to represent nodes in the search space is introduced utilizing inherent properties of the optimal solution by which the search space is greatly reduced. A beam search algorithm is suggested. A numerical experiment is carried out to compared the performance of the beam search algorithm with those of other approaches.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1733-1739
• /
• 2006

This paper is concerned with multi-objective vehicle routing problem(VRP), in which objective of this problem is to minimize the total operating time of vehicles and the total tardiness of customers. A mixed integer programming formulation and a heuristic for practical use are suggested. The heuristic is based on the route-perturbation and route-improvement method(RPRI). Performances are compared with other heuristic appeared in the previous literature using the modified bench-mark data set. It is shown that the suggested heuristic give good solution within a short computation time by computational experiment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.3
• /
• pp.289-295
• /
• 2008

The shared-route decision algorithms in multicasting communications networks to provide the internet-based services such as IPTV, remote education/health, and internet broadcasting are presented. The three main measures of maximum delay, average delay and estimated delay between each node and member are adopted. Under the Mesh network with the uniform random cost between each node, the algorithm's performance is compared to the optimal solution with the minimum cost by all enumeration. The simulation results show that the algorithm using the estimated delay outperforms the other two methods.

• Journal of the military operations research society of Korea
• /
• v.30 no.2
• /
• pp.81-95
• /
• 2004

This paper presents optimal solutions for the following two problems ; (1) The vehicle routing problem with deadline considering homeward-route transport requirement, (2) The problem of (1) with relaxed constraint that the vehicle cannot visit the depot during the trip. That is, for the second problem, vehicle can visit the depot several times during the trip. The formulation and optimal solution we obtained outperform the existing ones proposed by other researchers in the sense of time and total distance traveled and the results can be applicable to short-haul local transport.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.249-263
• /
• 1997

This paper addresses the parts route selection and economic design in flexible manufactuirng system (FMS). Parts are processed through several stage workstations according to operation sequences. The machine of each workstation can do multiple operation functions. And the operation stage of a part can be processed in several workstations, which are non-identical in functional performance. The objective of this paper is to determine the processing routes of parts, number of machine at each workstation, number of vehicle and makespan time. Two models are suggested. One is assumed that the operation stage of parts can be processed at the only one among several available workstations. Other is assumed that the operation stage of parts is allowed to be processed at several workstations. Parts are transported by automated guided vehicles (AGVs). The decision criteria is to minimize the sum of processing cost, travel cost, setup cost and overhead cost. The formulation of models is represented. A solution algorithm is suggested, and a numerical example is shown.

• Journal of the Korean Ceramic Society
• /
• v.39 no.4
• /
• pp.336-340
• /
• 2002

Pure and nano-sized $TiO_2$ and $CaTiO_3$ powders were fabricated by a polymeric steric entrapment route and planetary milling process. An ethylene glycol was used as a polymeric carrier for the preparation of organic-inorganic precursors. Titanium isopropoxide and calcium nitrate were dissolved in liquid-type ethylene glycol without any precipitation. At the optimum amount of the polymer, the metal cations were dispersed in solution and a homogeneous polymeric network was formed. The dried precursor ceramic gels were turned to porous powders through calcination process. The porous powders were crystallized at low temperatures and the crystalline powders were planetary milled to nano size.