• Journal of Electrochemical Science and Technology
• /
• v.2 no.3
• /
• pp.157-162
• /
• 2011

We report a simple route for synthesizing multi-dimensional structured silicon anode materials from commercially available bulk silicon powders via metal-assisted chemical etching process. In the first step, silver catalyst was deposited onto the surface of bulk silicon via a galvanic displacement reaction. Next, the silver-decorated silicon particles were chemically etched in a mixture of hydrofluoric acid and hydrogen peroxide to make multi-dimensional silicon consisting of one-dimensional silicon nanowires and micro-scale silicon cores. As-synthesized silicon particles were coated with a carbon via thermal decomposition of acetylene gas. The carbon-coated multi-dimensional silicon anodes exhibited excellent electrochemical properties, including a high specific capacity (1800 mAh/g), a stable cycling retention (cycling retention of 89% after 20 cycles), and a high rate capability (71% at 3 C rate, compared to 0.1 C rate). This process is a simple and mass-productive (yield of 40-50%), thus opens up an effective route to make a high-performance silicon anode materials for lithiumion batteries.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.08a
• /
• pp.167-176
• /
• 2004

The authors have newly developed the “Port Traffic Management System (PTMS)”. The PTMS provides each ship with the detailed planned routes of all the ships entering/leaving the port. This system also has a function to predict the encounter situations between own ship and other ships in the future. Based on information of the present positions, speeds and planned routes of the own ship and other ships, it is possible to predict when and where the own ship will have dangerous encounters with other ships in the future. The software of PTMS was developed from 2001. Then onboard experiments using small training ships equipped with actual AIS were performed in June 2003. From the results of these onboard experiments, the usefulness of PTMS was clarified. In addition to these onboard experiments, the effectiveness of PTMS was confirmed by comprehensive simulator experiments. In the simulator experiments, captains/pilot maneuvered a training ship/container ship in congested waters using PTMS. [t was assumed that all ships have PTMS and send their planned routes. After the simulator experiments, captains/pilot suggested that it is very beneficial if the optimal route of own ship can be automatically calculated. In response to this suggestion, software to calculate the optimal route of own ship using Dynamic Programming was developed. This software calculates the minimum time route from the present position to the destination keeping the danger of collision against other ships under predetermined level. From the result of calculations for multi-encounter situations, it was confirmed that the developed software can provide safe and time-saving route.

• Korean Journal of Metals and Materials
• /
• v.50 no.12
• /
• pp.931-937
• /
• 2012

The microstructure of Cu-15 wt%Ag composites fabricated by equal channel angular pressing (ECAP) with intermediate heat treatment at $320^{\circ}C$ was investigated by transmission electron microscopy (TEM) observations. Ag precipitates with a thickness of 20-40 nm were observed in the eutectic region of the Cu-15 wt%Ag composite solution treated at $700^{\circ}C$ before ECAP. The Cu matrix and Ag precipitates had a cube on cube orientation relationship. ECAPed composites exhibited ultrafine-grained microstructures with the shape and distribution dependent on the processing routes. For route A in which the sample was pressed without rotation between each pass, the Cu and Ag grains were elongated along the shear direction and many micro-twins were observed in elongated Cu grains as well as in Ag filaments. The steps were observed on coherent twin boundaries in Cu grains. For route Bc in which the sample was rotated by 90 degrees after each pass, a subgrain structure with misorientation of 2-4 degree by fragmentation of the large Cu grains were observed. For route C in which the sample was rotated by 180 degrees after each pass, the microstructure was similar to that of the route A sample. However, the thickness of the elongated grains along the shear direction was wider than that of the route A sample and the twin density was lower than the route A sample. It was found that more microtwins were formed in ECAPed Cu-15 wt%Ag than in the drawn sample. Grain boundaries were observed in relatively thick and long Ag filaments in Cu-15 wt%Ag ECAPed by route C, indicating the multi-crystalline nature of Ag filaments.

• Journal of the Korea Society for Simulation
• /
• v.13 no.2
• /
• pp.53-63
• /
• 2004

In ad hoc networks, the link survivability is firstly considered if a routing between two mobile nodes takes place through wireless environments, because all of mobile nodes participating in a connection dynamically move to anywhere. Also, mobile nodes have multi-role to implement a communication without a static system supported by wired networks. Hence, it is difficult that all mobile nodes continuously provide a reliable connection when the nodes operate each role for the connection. Therefore, it is desired to maximize the lifetime of a route as long as possible for the reliable communication. In this paper, we propose a proactive link management scheme that can provide the continuous route supported by the link handover. It consider the wireless link quality and the power lifetime of a node so that the link handover is implemented for the link survivability without disconnecting the route on the communication.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.13-26
• /
• 2000

Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of the Korean association of regional geographers
• /
• v.14 no.5
• /
• pp.587-603
• /
• 2008

The Woong-Chi region is located between Wan-ju and Jin-an had experienced transportation route change from past continuously. The difference of relative height especially steep slope of western side is given to the most difficulty for transportation route open in Woong-Chi region. For the overcome this restraint geomorphological condition, multi-route were developed according to available purpose in walking period. They effort to decrease of slope and curve in route continual1y, and only used the conditioned route for automobile from 1910s in automobile period. The social aspect in transportation route change on this region is, firstly, the transportation route has trend from variety to simplicity. Secondary, new transportation route is opened by social needs such as traffic accident and social big event. Thirdly, the regional range was extended for overcome restraint condition. Fourthly, the rise and fall of route related settlement is influenced by transportation route change. The used technical method for the overcome the geomorphological condition is make a tunnel, alleviate the curve radius, alleviate the slop and consider the direction of the sunny than shady side.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1534-1541
• /
• 1996

Routing security is the confidentiality of route taken by the data transmitted over communication networks. If the route is detected by an adversary, the probability is high that the data lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to a destination node using the shortest direct path. Furthermore, if we use a number of secret routes from a node to a destination node, data security is much stronger since we can transmit partial data rather than entire data along a secret route. Finally, the idea above is implemented on MRNS Network.