• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.79-84
• /
• 2016

In this paper we consider the problem of finding the triplet (S,${\pi}$,f), where $S{\subseteq}V$, ${\pi}$ is a sequence of nodes in S and $f:V{\backslash}S{\rightarrow}S$ for a given complete graph G=(V,E). In particular, there exist two costs, $c^V_{uv}$ and $c^D_{uv}$ for $(u,v){\in}E$, and the cost of triplet (S,${\pi}$,f) is defined as $\sum_{i=1}^{{\mid}S{\mid}}c^V_{{\pi}(i){\pi}(i+1)}+2$ ${\sum_{u{\in}V{\backslash}S}c^D_{uf(u)}$. This problem is motivated by the integrated routing of the vehicle and drone for urban delivery services. Since a well-known NP-complete TSP (Traveling Salesman Problem) is a special case of our problem, we cannot expect to have any polynomial-time algorithm unless P=NP. Furthermore, for practical purposes, we may not rely on time-exhaustive enumeration method such as branch-and-bound and branch-and-cut. This paper suggests the simple heuristic which is motivated by the MST (minimum spanning tree)-based approximation algorithm and neighborhood search heuristic for TSP.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2701-2710
• /
• 1997

Recursive circulant graph has recently developed as a new model of multiprocessors, and drawn considerable attention to supercomputing, In this paper, we investigate the routing of a message i recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along paths, where the ith packet will traverse along the ith path $(o{\leq}i{\leq}m-1)$. In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of $(n{\times}n)$ matrices, we present $O(n^2)$ parallel routing algorithm on recursive circulant network.

• Journal of the Korean association of regional geographers
• /
• v.16 no.5
• /
• pp.590-609
• /
• 2010

The purpose of the study is to propose and evaluate Exploratory Spatial Data Analysis(ESDA) methods for examining age-specific population migration characteristics. First, population migration pyramid which is a pyramid-shaped graph designed with in-migration, out-migration, and net migration by age (or age group), was developed as a tool exploring age-specific migration propensities and structures. Second, various spatial statistics techniques based on local indicators of spatial association(LISA) such as Local Moran''s $I_i$, Getis-Ord ${G_i}^*$, and AMOEBA were suggested as ways to detect spatial dusters of age-specific net migration rate. These ESDA techniques were applied to age-specific population migration of Daegu Metropolitan City. Application results demonstrated that suggested ESDA methods can effectively detect new information and patterns such as contribution of age-specific migration propensities to population changes in a given region, relationship among different age groups, hot and cold spot of age-specific net migration rate, and similarity between age-specific spatial clusters.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.21-34
• /
• 2002

In this paper we propos a new hardware architecture of modular exponentiation using a division chain method which has been proposed in (2). Modular exponentiation using the division chain is performed by receding an exponent E as a mixed form of multiplication and addition with divisors d=2 or $d=2^I +1$ and respective remainders r. This calculates the modular exponentiation in about $1.4log_2$E multiplications on average which is much less iterations than $2log_2$E of conventional Binary Method. We designed a linear systolic array multiplier with pipelining and used a horizontal projection on its data dependence graph. So, for k-bit key, two k-bit data frames can be inputted simultaneously and two modular multipliers, each consisting of k/2+3 PE(Processing Element)s, can operate in parallel to accomplish 100% throughput. We propose a new encoding scheme to represent divisors and remainders of the division chain to keep regularity of the data path. When it is synthesized to ASIC using Samsung 0.5 um CMOS standard cell library, the critical path delay is 4.24ns, and resulting performance is estimated to be abort 140 Kbps for a 1024-bit data frame at 200Mhz clock In decryption process, the speed can be enhanced to 560kbps by using CRT(Chinese Remainder Theorem). Futhermore, to satisfy real time requirements we can choose small public exponent E, such as 3,17 or $2^{16} +1$, in encryption and verification process. in which case the performance can reach 7.3Mbps.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.551-563
• /
• 2011

Let ${\kappa}$ be a positive integer and let G be a simple graph with vertex set V(G). A function f : V (G) ${\rightarrow}$ {-1, 1} is called a signed total ${\kappa}$-dominating function if ${\sum}_{u{\in}N({\upsilon})}f(u){\geq}{\kappa}$ for each vertex ${\upsilon}{\in}V(G)$. A set ${f_1,f_2,{\ldots},f_d}$ of signed total ${\kappa}$-dominating functions of G with the property that ${\sum}^d_{i=1}f_i({\upsilon}){\leq}1$ for each ${\upsilon}{\in}V(G)$, is called a signed total ${\kappa}$-dominating family (of functions) of G. The maximum number of functions in a signed total ${\kappa}$-dominating family of G is the signed total k-domatic number of G, denoted by $d^t_{kS}$(G). In this note we initiate the study of the signed total k-domatic numbers of graphs and present some sharp upper bounds for this parameter. We also determine the signed total signed total ${\kappa}$-domatic numbers of complete graphs and complete bipartite graphs.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2007.06a
• /
• pp.511-512
• /
• 2007

The monitoring system has won acceptance as a premium mark that identifies the highest standard of product quality in advanced industry. The TOP features with multi-I/O ports and VGA & RCA TV-out ports supporting mirroring & multiple dual-display modes by windows 0/5. With the choice of versatile stands, panel mount, or VESA wall-mount swing arm and connecting to modem. Wireless keyboard, Customer Display and Card Reader, is your idea Panel system for the application of TOP(Touch Operation Pannel), KIOSK, or Office / Factory Automation. TOP is the hardware and software product that transacts all kind of functions for advanced technology equipment to button, switch, voice and graph etc so that let consumer use easily Industrial HMI System Touch Panel. System characteristics: Easy of use and flexibility to the user, Present a high value solution and advanced function for many Application, Factory Automation, Office Automation, Building Automation System, Information Service System, etc. Analog Touch - 2MB Flash Memory for Saving Screen Data - RS-232C/422 Serial Port - Multi Language Support.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.147-147
• /
• 2021

A partition of water distribution network (WDN) into district metered areas (DMAs) brings the efficiency and efficacy for water network operation and management (O&M), especially in monitoring pressure and leakage. Traditionally, the DMA configurations (i.e., number, shape, and size of DMAs) are permanent and cannot be changed occasionally. This leads to changes in water quality and reduced network redundancy lowering network resilience against abnormal conditions such as water demand variability and mechanical failures. This study proposes a framework to automatically divide a WDN into dynamic DMA configurations, in which the DMA layouts can self-adapt in response to abnormal scenarios. To that aim, a complex graph theory is adopted to sectorize a WDN into multiscale DMA layouts. Then, different failure-based scenarios are investigated on the existing DMA layouts. Here, an optimization-based model is proposed to convert existing DMA layouts into dynamic layouts by considering existing valves and possibly placing new valves. The objective is to minimize the alteration of flow paths (i.e., flow direction and velocity in the pipes) while preserving the hydraulic performance of the network. The proposed method is tested on a real complex WDN for demonstration and validation of the approach.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.6
• /
• pp.655-662
• /
• 2003

A rigorous field analysis by the non-decaying mode and the contour graph method is presented for dielectric-rod loaded cylindrical cavity resonators. Resonant frequencies and the lowest order modes for this resonator are calculated. The mode charts are presented to design the resonators. TE mode(transverse electric or H mode, having no Ez), TM mode(transverse magnetic or I mode, having no ㎐) and HEM mode(hybrid electromagnetic mode, having non-zero Ez and ㎐) are analyzed in detail using non-decaying mode method. The mode charts are completed. The validity of the theory is confirmed by experiments. The results were on the whole satisfactory. Experimental measurements show excellent agrement with the numerical results. The average error of TE, TM, and HEM mode is about 0.20 %, 0.14 %, and 0.28 %, respectively.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.5 no.1
• /
• pp.27-33
• /
• 2011

Estimating algorithm of physical activity energy expenditure and physical activity intensity was implemented by using a tri-axial accelerometer motion detector of the SVM(Signal Vector Magnitude) of 3-axis(x, y, z). A total of 10 participants(5 males and 5 females aged between 20 and 30 years). The ActiGraph(LLC, USA) and Fitmeter(Fit.life, korea) was positioned anterior superior iliac spine on the body. The activity protocol consisted of three types on treadmill; participants performed three treadmill activity at three speeds(3, 5, 8 km/h). Each activity was performed for 7 minutes with 4 minutes rest between each activity for the steady state. These activities were repeated four weeks. Algorithm for METs, kcal and intensity of activities were implemented with ActiGraph and Fitmeter correlation between the data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.950-975
• /
• 2016

Device-to-Device (D2D) communication underlaying cellular networks is a promising add-on component for future radio communication systems. It provides more access opportunities for local device pairs and enhances system throughput (ST), especially when mobile relays (MR) are further enabled to facilitate D2D links when the channel condition of their desired links is unfavorable. However, mutual interference is inevitable due to spectral reuse, and moreover, selecting a suitable transmission mode to benefit the correlated resource allocation (RA) is another difficult problem. We aim to optimize ST of the hybrid system via joint consideration of mode selection (MS) and RA, which includes admission control (AC), power control (PC), channel assignment (CA) and relay selection (RS). However, the original problem is generally NP-hard; therefore, we decompose it into two parts where a hierarchical structure exists: (i) PC is mode-dependent, but its optimality can be perfectly addressed for any given mode with additional AC design to achieve individual quality-of-service requirements. (ii) Based on that optimality, the joint design of MS, CA and RS can be viewed from the graph perspective and transferred into the maximum weighted independent set problem, which is then approximated by our greedy algorithm in polynomial-time. Thanks to the numerical results, we elucidate the efficacy of our mechanism and observe a resulting gain in MR-aided D2D communication.