• Journal of Integrative Natural Science
• /
• v.2 no.4
• /
• pp.289-292
• /
• 2009

Perchlorosilanes are useful precursors for the synthesis of hydrosilanes for the fabrication of electronic devices such as silicon thin-film transistors and silicon nanoparticles. For this solution process, requirements of precursors applicable to solution process are relatively low volatile and soluble in common organic solvents. In this work, the decaphenylcyclopentasilane has been obtained from the reaction of the lithium wire and dichlorodiphenylsilane. The reaction of decaphenylcyclopentasilane with lewis acid catalyst, HCl/$AlCl_3$, gives the perchlorocyclopentasilane. Decaphenylcyclopentasilane exhibits an unusual optical property. Its optical property was characterized by UV-vis and fluorescence spectroscopy. Absorption wavelength maxima for the decaphenylcyclopentasilane was 272 nm. Decaphenylcyclopentasilane displayed an emission band at 741 nm with excitation wavelength of 272 nm.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2020.11a
• /
• pp.42-43
• /
• 2020

Lauric acid (LA) which is also known as dodecanoic acid has been selected as the phase change material (PCM) owing to eco-friendly in nature. A systematic study has been conducted for encapsulation of LA (core) with silicon dioxide (SiO2) as shell material. Different core-shell ratio was chosen to microencapsulate the LA with 10 ml of tetraethyl orthosilicate (TEOS) as the precursor solution for the formation of SiO2. The synthesis of microencapsulated LA was carried out at 2.5 pH of precursor solution. The synthesized microencapsulated LA are characterized by Fourier transform infrared spectroscope (FT-IR) and X-Ray Diffraction (XRD) which confirmed the presence of SiO2 shell on the surface of LA.

• The Journal of Economics, Marketing and Management
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2016

The purpose of this paper is to discuss the methodology of optimizing delivery route scheduling using a capacity integer linear programming problem model developed to a previous case study. The methodology suggests a two-stage decision: the first, automatic, where the manager will obtain guidance generated by the solution of the linear programming model, later they could use post-optimization techniques to fine tune to the best operational solution. This study has the goal to reduce the size of service companies' ground transportation fleets, aiming not only to reduce costs and increase competitive advantages but also to lower levels of air pollution and its consequences, traffic and, therefore, the levels of carbon dioxide, allowing for a reduction in envir onmental disasters.

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.37-45
• /
• 2005

This paper presents a relationship between Nash bargaining game and Wardrop user equilibrium, which has been widely used in transportation modeling for route choice problem. Wardrop user equilibrium assumes that drivers in road network have perfect information on the traffic conditions and they choose their optimal paths without cooperation each other. In this regards, if the bargaining game process is introduced in route choice modeling, we may avoid the strong assumptions to some extent. For such purpose, this paper derives a theorem that Nash bargaining solution is equivalent to Wardrop user equilibrium as the barging process continues and prove it with some numerical examples. The model is formulated based on two-person bargaining game. and n-person game is remained for next work.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• 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 Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.344-351
• /
• 2016

In the point of view of a train operator, the main concern with a train operation is not only to maintain a time schedule, but also to decrease the energy consumption as much as possible. Generally for a manual drive, a train conductor controls the train acceleration and deceleration by controlling the notches not to exceed the regulation velocity by considering the given maximum velocity profile for an operation route. For this case, the guideline for a conductor is needed to choose the proper notches by applying the notch optimization so as to drive at the regulation velocity and minimize energy consumption simultaneously. In this paper, the real-time notch optimization plan is suggested using a genetic algorithm that optimizes the notches for the remaining route in real time when the event occurs that track information or regulation velocity profile of the remaining route changes during train operation as well as a normal operation situation. An energy saving effect and the convergence behavior of the optimal solution obtained was analyzed in a genetic algorithm.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• Journal of the Ergonomics Society of Korea
• /
• v.28 no.3
• /
• pp.63-71
• /
• 2009

A car navigation system as an in-vehicle route guidance information (RGI) offers a state-of-the-art technological solution to driver navigation in an unfamiliar area. However, the RGI is provided by some pre-determined options in terms of the interface between a driver and a car navigation system. Drivers occasionally pass the target intersection owing to non- or late- recognizing it. This paper is examined the position of driver's turn signal operation and intersection recognition approaching at the target intersection which is difficult to identify, as a fundamental research on developing the additional RGI connecting with the turn signal control. The field experiment was conducted to measure distances of the turn signal operation and the intersection recognition from the target intersection according to left turns, right turns, and landmarks at adjacent intersection. And glance behavior to the car navigation display was evaluated by using an eye camera. The results of the field study indicate that, most case of driving, drivers operate the turn signal until 40m to 50m before coming to the target intersection. The driving simulator experiment was performed to examine the effectiveness of providing the additional RGI when drivers did not operate the turn signal approaching at the target intersection based on the results of the field study. To provide the additional RGI is effective for the intersection identification and recognition, and expected to improve the traffic safety and the comfort for drivers.