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

This paper deals with the car paint sequencing problem (CPSP) that the entrance sequence is to same colored group with maximum sequenced cars for the buffer arriving cars from the body shop. This problem classified by NP-complete problem because of the exact solution has not obtained within polynomial time. CPSP is aim to minimum pugging number that each pugging must be performs at color changing time in order to entirely cleaning the remaining previous color. To be obtain the minimum number of moving distance with window concept and minimum number of pugging, this paper sorts same color and arriving sequence. Then we basically decide the maximum length section color time to winner team using stage race method. For the case of the loser team with no more racing or yield to loser team and more longer stage in upcoming racing, the winner team give way to loser team. As a result, all cars(runners) are winner in any stage without fail. For n cars, the proposed algorithm has a advantage of simple and fast with O(nlogn) polynomial time complexity, this algorithm can be get the minimum number of moving distance and purging for all of experimental data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1840-1848
• /
• 2017

Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.211-218
• /
• 2015

This paper introduces a 'divide-and-conquer' algorithm to the travelling salesman problem (TSP). Top 10n are selected beforehand from a pool of n(n-1) data which are sorted in the ascending order of each vertex's distance. The proposed algorithm then firstly selects partial paths that are interconnected with the shortest distance $r_1=d\{v_i,v_j\}$ of each vertex $v_i$ and assigns them as individual regions. For $r_2$, it connects all inter-vertex edges within the region and inter-region edges are connected in accordance with the connection rule. Finally for $r_3$, it connects only inter-region edges until one whole Hamiltonian cycle is constructed. When tested on TSP-1(n=26) and TSP-2(n=42) of real cities and on a randomly constructed TSP-3(n=50) of the Euclidean plane, the algorithm has obtained optimal solutions for the first two and an improved one from that of Valenzuela and Jones for the third. In contrast to the brute-force search algorithm which runs in n!, the proposed algorithm runs at most 10n times, with the time complexity of $O(n^2)$.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.24 no.3
• /
• pp.58-72
• /
• 2021

In July 2021, UNCTAD classified Korea as a developed country. After the Korean War in the 1950s, economic development was promoted despite difficult conditions, resulting in epoch-making national growth. However, in order to respond to the rapidly changing global economy, it is necessary to continuously study the domestic industrial ecosystem and prepare strategies for continuous change and growth. This study analyzed the industrial ecosystem of the automobile industry where it is possible to obtain transaction data between companies by applying complexity spatial network analysis. For data, 295 corporate data(node data) and 607 transaction data (link data) were used. As a result of checking the spatial distribution by geocoding the address of the company, the automobile industry-related companies were concentrated in the Seoul metropolitan area and the Southeastern(Dongnam) region. The node importance was measured through degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality, and the network structure was confirmed by identifying density, distance, community detection, and assortativity and disassortivity. As a result, among the automakers, Hyundai Motor, Kia Motors, and GM Korea were included in the top 15 in 4 indicators of node centrality. In terms of company location, companies located in the Seoul metropolitan area were included in the top 15. In terms of company size, most of the large companies with more than 1,000 employees were included in the top 15 for degree centrality and betweenness centrality. Regarding closeness centrality and eigenvector centrality, most of the companies with 500 or less employees were included in the top 15, except for automakers. In the structure of the network, the density was 0.01390522 and the average distance was 3.422481. As a result of community detection using the fast greedy algorithm, 11 communities were finally derived.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.93-101
• /
• 2012

Due to complexity of indoor space, the demand of Location Based Services (LBS) in indoor space is increasing as well as outdoor. However, it includes privacy problems of exposing personal location. Location K-anonymity technology is a method to solve the privacy problems with cloaking their locations by Anonymized Spatial Region(ASR). It guarantees K users within a region containing the location of a given user. However previous researches have dealt the problems based on Euclidean distance in outdoor space, and cannot be applied in indoor space where there are constraints of movement such as walls. For this reason, we propose in this paper a K-anonymity for cloaking indoor location in consideration of structures and representation of indoor space. The basic concept of our approach is to introduce a hierarchical structure as ASR for including K-1 users for cloaking their locations. We also proposed a cost model by K and attributes of hierarchical structure to analyze the performance of the method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.10
• /
• pp.858-866
• /
• 2013

In the DVB-S2, which is the technical specification of the second generation digital video broadcasting via satellite, APSK modulation scheme along with LDPC coding schemes are defined. APSK is a multi-lelvel PSK modulation scheme and decoding of LDPC coded signal requires soft decision information. Therefore, the APSK demodulator at the receiver should have capability of estimating soft information. In this paper, we introduce a method to estimate soft information by using simple distance estimation, and show that this method overestimates the soft information. Subsequently, this overestimated soft information leads to performance degradation. In order to overcome this problem, we propose a scaling method to improve the performance at the receiver In addition, we show that the proposed scaling scheme enables us to estimate the soft information with linear order complexity and produce the performance close to the maximum likelihood detection.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.3
• /
• pp.83-90
• /
• 2020

Prototype selection offers the advantage of ensuring low learning time and storage space by selecting the minimum data representative of in-class partitions from the training data. This paper designs a new training data generation method using hyper-rectangles that can be applied to general classification algorithms. Hyper-rectangular regions do not contain different class data and divide the same class space. The median value of the data within a hyper-rectangle is selected as a prototype to form new training data, and the size of the hyper-rectangle is adjusted to reflect the data distribution in the class area. A set cover optimization algorithm is proposed to select the minimum prototype set that represents the whole training data. The proposed method reduces the time complexity that requires the polynomial time of the set cover optimization algorithm by using the greedy algorithm and the distance equation without multiplication. In experimented comparison with hyper-sphere prototype selections, the proposed method is superior in terms of prototype rate and generalization performance.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.4
• /
• pp.190-196
• /
• 2011

Bandwidth extension is a technique to improve speech quality and intelligibility, extending from 300-3400 Hz narrowband speech to 50-7000 Hz wideband speech. This paper designs an artificial bandwidth extension (ABE) module embedded in the AMR (adaptive multi-rate) decoder, reducing LPC/LSP analysis and algorithm delay of the ABE module. We also introduce a fast search codebook mapping method for ABE, and design a low power BWE technique based on the AMR decoder. The proposed ABE method reduces the computational complexity and the algorithm delay, respectively, by 28 % and 20 msec, compared to the traditional DTE (decode then extend) method. We also introduce a weighted classified codebook mapping method for constructing the spectral envelope of the wideband speech signal.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.2
• /
• pp.32.3-33
• /
• 2015

There exist scaling relations that link the mass of supermassive black holes with both the velocity dispersion and the mass of the central stellar cusp of their host galaxies. This implies that these two components grow in tandem. Feedback from actively accreting supermassive black holes (AGN), in the form of multi-phase gas outflows, has been argued to be the agent of this co-evolution. Here we employ the powerful GMOS integral field spectroscopy unit on the 8.2m Gemini-North telescope to investigate ionized gas outflows of luminous Type 2 AGN in the local Universe (z<0.1). Our sample of 6 galaxies is drawn from the Sloan Digital Sky Survey (SDSS) and was selected based on their [OIII] dust-corrected luminosity (>1042 erg/s) and signatures of outflows in the [OIII] line profile of their spatially integrated SDSS spectra. These are arguably the best candidates to explore AGN feedback in action since they are < 1% of a large local type 2 AGN SDSS sample selected based on their [OIII] kinematics. We combine a careful spectral decomposition of the [OIII] and $H{\alpha}$ line profiles with spatial information on ~0.5kpc scales to understand the outflow kinematics and energetics in these objects. We find clear evidence for strong outflows in [OIII] and occasionally $H{\alpha}$ that are clearly driven by the ionizing radiation of the AGN. We kinematically and spatially decompose outflowing and rotating ionized gas components. We find [OIII] to be a better tracer of AGN outflows, while $H{\alpha}$ appears to be strongly affected by both stellar rotation and outflows induced by ongoing star formation. The observed kinematics and spatial distribution of the ionized gas imply a large opening angle for the outflow. Finally, we find the projected outflow velocity to decrease as a function of distance, while its dispersion shows a more complex structure with a potentially initially increasing trend (out to 0.5-1kpc distances).

• 한국정보교육학회:학술대회논문집
• /
• 2010.08a
• /
• pp.185-192
• /
• 2010

The purpose of this paper is to suggest design principles for videoconferencing using an English Native Speaker. For this, Design-Based Research which is emerging newly was applied. During the research period of 3 months, several English classes were recorded. After finishing each class, Korean teacher and Native teacher wrote reflective diary and a researcher implemented interviews to students who had this class. Based on these data, this class was divided into 3 steps which is consisted of before class, under class, and after class. And then a research analysed patterns of this class, errors, and interactivity etc. The result of this paper, because a Korean teacher and students in the classroom meet a Native speaker in the distance through the videoconferencing system, teachers who design this class should consider many aspects due to the complexity of this.