• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.4 no.1
• /
• pp.3-4
• /
• 1994

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.29 no.2
• /
• pp.35-56
• /
• 2018

This study examines the current state of library related data opened through public data portals, and analyzes how much data is being utilized according to the type of releasing organization, and open level. In addition, we analyzed the subject cluster of data and the centrality of data by performing PathFinder Network analysis using keywords assigned to data by dividing the releasing subject into local government and national/public institutions. Based on this, the subject area of library - related data disclosed by local governments and national/public organizations is understood. And identify the main open body that should be opened first by linking with data utilization analysis result and then suggest implications for future improvement in connection with library big data business.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2009.05a
• /
• pp.196-199
• /
• 2009

높아지는 Graphic Processing Unit (GPU)의 연산 성능과 GPU에서의 범용 프로그래밍을 위한 개발 환경의 개발, 보급으로 인해 GPU를 일반연산에 활용하는 연구가 활발히 진행되고 있다. 이와같이 일반 연산에 활용되고 있는 GPU로 nVidia Tesla와 AMD/ATI의 FireStream 들이 있다. 특수목적 연산 장치인 GPU를 일반 연산을 위해 프로그래밍하기 위해서는 그에 맞는 프로그램 개발 환경이 필요한데 nVidia에서 개발한 CUDA (Compute Unified Device Architecture) 환경은 자사의 GPU 프로그램 개발을 위해 제공되는 개발 환경이다. CUDA 개발 환경은 nVidia GPU 프로그래밍 뿐만 아니라 차세대 이종 병렬 프로그램 개발 환경의 공개 표준으로 논의되고 있는 OpenCL (Open Computing Language) 와 유사한 특징을 보일 것으로 예상되기 때문에 그 중요성은 특정 GPU 에만 국한되지 않는다. 본 논문에서는 경로 적분 몬테 카를로 (Path Integral Monte Carlo) 방법을 CUDA 개발 환경을 사용하여 nVidia GPU 상에서 병렬화한 결과를 제시하였다.

• Journal of Electrochemical Science and Technology
• /
• v.10 no.4
• /
• pp.381-386
• /
• 2019

Zn-air battery uses oxygen from the air, and hence, air holes in it are kept open for cell operation. Therefore, loss of water by evaporation through the holes is inevitable. When the water is depleted, the battery ceases to operate. There are two water consumption routes in Zn-air batteries, namely, active path (electrolysis) and passive path (evaporation and corrosion). Water loss by the active path (electrolysis) is much faster than that by the passive path during the early stage of the cycles. The mass change by the active path slows after 10 h. In contrast, the passive path is largely constant, becoming the main mass loss path after 10 h. The active path contributes to two-thirds of the electrolyte consumption in 24 h of cell operation in 4.0 M KOH. Although water is an important component for the cell, water vapor does not influence the cell operation unless the water is nearly depleted. However, high oxygen concentration favors the discharge reaction at the cathode.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1111-1117
• /
• 2003

NURBS (Non Uniform Rational B-Spline) is widely used in CAD system and NC data for high speed machining. Conventional CAM system changes NURBS surface to tessellated meshes or Z-map model, and produces linear tool path. The linear tool path is not good for precise machining and high speed machining. In this paper, an algorithm to change linear tool path to NURBS one was studied, and the machining result of NURBS tool path was compared with that of linear tool path. The N-post, post-processing and virtual machining software was developed. The N-Post post-processes linear tool path to NURBS tool path and quickly shades machined product on OpenGL view and compares a machined product with original CAD surface. A virtual machined model of original tool path and post-processed tool path was compared to original CAD model. The machining error of post-processed NURBS tool path was reduced to 43%. The original tool path and NURBS tool path was used to machine general model using same machine tool and machining condition. The machining time of post-processed NURBS tool path was reduced up to 38%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.69-75
• /
• 2020

This paper introduces the parking guide service developed to address the inconvenience of parking in areas where demand for parking spaces is high, such as busy streets and tourist attractions. Due to difficulties in measuring and developing the actual parking lot while driving the car, we created a temporary parking lot and created Arduino RC Car to replace the actual car. Video processing based on Open CV allows users to identify the entire parking lot, parking space, and completed parking space, and track moving cars, and this information has been developed to enable users to see through the application. The application allows the user to book the desired parking space and introduce a way-finding algorithm to guide them through the optimal path to the selected parking compartment.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.460-475
• /
• 2016

The existing Proxy Mobile IPv6 suffers from a long handover latency which in turn causes significant packet loss that is unacceptable for seamless realtime services such as multimedia streaming. This paper proposes an OpenFlow-enabled proxy mobile IPv6 (OF-PMIPv6) in which the control of access gateways is centralized at an OpenFlow controller of a foreign network. The proposed OF-PMIPv6 separates the control path from the data path by performing the mobility control at the controller, whereas the data path remains direct between a mobile access gateway and a local mobility anchor in an IP tunnel form. A group of simple OpenFlow-enabled access gateways performs link-layer control and monitoring activities to support a comprehensive mobility of mobile nodes, and communicates with the controller through the standard OpenFlow protocol. The controller performs network-layer mobility control on behalf of mobile access gateways and communicates with the local mobility anchor in the Proxy Mobile IPv6 domain. Benefiting from the centralized view and information, the controller caches the authentication and configuration information and reuses it to significantly reduce the handover latency. An analytical analysis of the proposed OF-PMIPv6 reactive and proactive handover schemes shows 43% and 121% reduction in the handover latency, respectively, for highly utilized network. The results gathered from the OF-PMIPv6 testbed suggest similar performance improvements.

• Journal of the Chungcheong Mathematical Society
• /
• v.4 no.1
• /
• pp.103-113
• /
• 1991

Some properties of a path space and the fundamental group ${\sigma}(X,x_0,G)$ of a topological transformation group (X, G, ${\pi}$) are described. It is shown that ${\sigma}(X,x_0,H)$ is a normal subgroup of ${\sigma}(X,x_0,G)$ if H is a normal subgroup of G ; Let (X, G, ${\pi}$) be a transformation group with the open action property. If every identification map $p:{\Sigma}(X,x,G)\;{\longrightarrow}\;{\sigma}(X,x,G)$ is open for each $x{\in}X$, then ${\lambda}$ induces a homeomorphism between the fundamental groups ${\sigma}(X,x_0,G)$ and ${\sigma}(X,y_0,G)$ where ${\lambda}$ is a path from $x_0$ to $y_0$ in X ; The space ${\sigma}(X,x_0,G)$ is an H-space if the identification map $p:{\Sigma}(X,x_0,G)\;{\longrightarrow}\;{\sigma}(X,x_0,G)$ is open in a topological transformation group (X, G, ${\pi}$).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.109-117
• /
• 2014

In navigation route planning systems using A* algorithms, the cardinality of an Open list, which is a list of candidate nodes through which a terminal node can be accessed, increases as the path length increases. In this paper, a method of alternately utilizing the Dijkstra's algorithm and the A* algorithm to reduce the cardinality of the Open list is investigated. In particular, by employing a depth parameter, named Level, the two algorithms are alternately performed depending on the Level's value. Using the hybrid searching approach, the Open list constructed in the Dijkstra's algorithm is transferred into the Open list of the A* algorithm, and consequently, the unconstricted increase of the cardinality of the Open list of the former algorithm can be avoided and controlled appropriately. In addition, an optimal or nearly optimal path similar to the Dijkstra's route, but not available in the A* algorithm, can be found. The experimental results, obtained with synthetic and real-life benchmark data, demonstrate that the computational cost, measured with the number of nodes to be compared, was remarkably reduced compared to the traditional searching algorithms, while maintaining the similar distance to those of the latter algorithms. Here, the values of Level were empirically selected. Thus, a study on finding the optimal Level values, while taking into consideration the actual road conditions remains open.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.2
• /
• pp.102-111
• /
• 2004

In this paper, the efficient layout method for generating common and continuous cutting path of flat-bar profile. The ‘flat -bar’ is a stiffener and has long rectangular shape. This paper describes a fast nesting algorithm of the flat-bar, and a procedure to generate cutting path of gas/plasma torch, which is operated by a NC (numerically controlled) gas/plasma cutting machine. By using this common and continuous path, the machining-time for cutting and the maintenance-cost of plasma-torch could be reduced. Proposed procedures are written in C-language and applied to the Interactive Flat-Bar-Nesting System executable on Open VMS with X-Window system.