• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.60-68
• /
• 2012

Current wireless sensor networks are considered to support more complex operations ranging from military to health care which require energy-efficient and timely transmission of large amounts of data. In this paper, we propose an adaptive temporal suppression algorithm which exploits a temporal correlation among sensor readings. The proposed scheme can significantly reduce the number of transmitted sensor readings by sensor node, and consequently decrease the energy consumption and delay. Instead of transmitting all sensor readings from sensor node to sink node, the proposed scheme is to selectively transmit some elements of sensor readings using the adaptive temporal suppression, and the sink node is able to reconstruct the original data without deteriorating data quality by linear interpolation. In our proposed scheme, sensing data stream at sensor node is divided into many small sensing windows and the transmission ratio in each window is decided by the window complexity. It is defined as the number of a fluctuation point which has greater absolute gradient than threshold value. We have been able to achieve up about 90% communication reduction while maintaining a minimal distortion ratio 6.5% in 3 samples among 4 ones.

• Journal of Technology Innovation
• /
• v.27 no.3
• /
• pp.27-52
• /
• 2019

This research studied the determinants of private R&D investment by examining the innovation strategies of 481 small and medium enterprises (SMEs, their employee size is 5 or more and less than 300) in Busan, South Korea. The data is derived from the Technology Survey of Small and Medium Enterprises in 2001 and 2003. Three explanatory variables for the innovation strategies are the R&D portfolio, the organization (personnel) for R&D, and the strategic role of CEO for innovation. The technological levels of industries are controlled in the linear regression model. The dependent variable is the total private R&D investment of a firm in the given fiscal year. The empirical results indicate that the private R&D investment positively correlates with the complexity of the R&D portfolio, the formal organization for R&D team, and the increase of R&D personnel. The formal organization for R&D team and the number of R&D personnel are correlated with the increase of private R&D investment across the four groups in the manufacturing sector but not in the service sector. These findings suggest that the innovation policy needs to target firms who have complex R&D portfolios, the formal organization of R&D teams, and sufficient R&D personnel in order to increase the private R&D investment of SMEs in regions, with consideration of industrial characteristics.

• Journal of Life Science
• /
• v.28 no.5
• /
• pp.587-596
• /
• 2018

This study aims to observe changes in heart-rate variability (HRV) indices induced by e-cigarette and conventional-cigarette smoking and to compare the differences in acute cardiac autonomic regulation. All participants (n=41) were exposed to both e-cigarette smoke (ES) and conventional cigarette smoke (CS) in a randomized crossover trial. HRV analysis was performed during each smoking session based on a recorded r-r interval 10 minutes before smoking and at specified recovery periods (REC1, 0-5 min; REC2, 5-10 min; REC3, 10-15 min; REC4, 15-20 min; REC5, 20-25 min; and REC6, 25-30 min). ES led to a significantly increased cardiac sympathetic index (LF/HF ratio) compared with the baseline, and it shifted the sympathovagal balance toward sympathetic predominance, including reduction in the complexity of the interbeat interval (SampEn). In REC1 after ES, only decreases of parasympathetic indices such as rMSSD, pNN50, HF, and SD1 were indicated. CS sessions produced not only an increased LF/HF ratio during smoking and recovery periods (REC1 and REC4) but also enhanced sympathetic predominance on autonomic balance during smoking and recovery periods (REC1, REC2, and REC4). In the CS trials, parasympathetic indices of time and non-linear analysis (rMSSD, pNN50, and SD1) were decreased during smoking and in REC1 to REC5. SampEn was also reduced during smoking and REC1 to REC4. Acute sympathoexcitatory effects induced by e-cigarette use produced statistically significant results. Parasympathetic withdrawal after smoking suggests that e-cigarettes may cause increased cardiovascular risk.

• Korean Chemical Engineering Research
• /
• v.53 no.2
• /
• pp.236-242
• /
• 2015

We present two data-driven modeling methods, partial least square (PLS) and artificial neural network (ANN), to predict the major operating and performance variables of a polymer electrolyte membrane (PEM) fuel cell stack. PLS and ANN models were constructed using the experimental data obtained from the testing of a 30 kW-class PEM fuel cell stack, and then were compared with each other in terms of their prediction and computational performances. To reduce the complexity of the models, we combined a variables importance on PLS projection (VIP) as a variable selection method into the modeling procedure in which the predictor variables are selected from a set of input operation variables. The modeling results showed that the ANN models outperformed the PLS models in predicting the average cell voltage and cathode outlet temperature of the fuel cell stack. However, the PLS models also offered satisfactory prediction performances although they can only capture linear correlations between the predictor and output variables. Depending on the degree of modeling accuracy and speed, both ANN and PLS models can be employed for performance predictions, offline and online optimizations, controls, and fault diagnoses in the field of PEM fuel cell designs and operations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.209-216
• /
• 2009

The repeater for wireless broadband internet (Wibro) system using OFDM demands the short processing delay to eliminate inter-symbol interference resulted from the time delay greater than the guard time. Towards this, the total system delay of repeater is expected to be minimized as possible as it can without distorting signal quality. In general, the FIR-type of filter is commonly deployed as a channelization filter, but due to its large amount of coefficients for producing prerequisite filter response the excessive large time delay occurs. To withstand this problem, the paper proposes the method for designing IIR filter whose response almost identical to that of the original filter. Moreover, in order to linearize the phase response of the designed IIR filter, this paper also introduce the way of designing the all-pass filter to be cascaded works for linearizing phase response of the channelization as well as the de-channelization filter. To achieve the further improvement in linearization of the phase response and reduction of the overall complexity, this paper tries to transform the integrated IIR filter group into the structure in polyphase style. The computer simulation verifies that the integrated IIR filter group designed in this paper reveals the relatively short processing delay without harming the acceptible signal quality.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.113-120
• /
• 2013

This paper proposes an algorithm that proves an NP-complete 4-color theorem by employing a linear time complexity where $O(n)$. The proposed algorithm accurately halves the vertex set V of the graph $G=(V_1,E_1)$ into the Maximum Independent Set (MIS) $\bar{C_1}$ and the Minimum Vertex Cover Set $C_1$. It then assigns the first color to $\bar{C_1}$ and the second to $\bar{C_2}$, which, along with $C_2$, is halved from the connected graph $G=(V_2,E_2)$, a reduced set of the remaining vertices. Subsequently, the third color is assigned to $\bar{C_3}$, which, along with $C_3$, is halved from the connected graph $G=(V_3,E_3)$, a further reduced set of the remaining vertices. Lastly, denoting $C_3$ as $\bar{C_4}$, the algorithm assigns the forth color to $\bar{C_4}$. The algorithm has successfully obtained the chromatic number ${\chi}(G)=4$ with 100% probability, when applied to two actual map and two planar graphs. The proposed "four color algorithm", therefore, could be employed as a general algorithm to determine four-color for planar graphs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1908-1924
• /
• 2001

Interoperability and inter-working in the various network and media environment with different technology background is very important to enlarge the opportunity of service access and to increase the competitive power of service. The ITU-T and advanced counties are planning ahead for provision of GII enabling user to access advanced global communication services supporting multimedia communication applications, embracing all modes of information. In this paper, we especially forced the heterogeneity of end user applications for multimedia networking. The heterogeneity has several technical aspects, like different medium access methods, heterogeneous coding algorithms for audio-visual data and so on. Among these elements, we have been itemized bit rate shaping algorithm on the compressed moving video. Previous manipulations of video has been done on the uncompressed signal domain. That is, compressed video should be converted to linear PCM signal. To do such a procedures, we should decode, manipulate and then encode the video to compressed signal once again. The traditional approach for processing the video signa1 has several critical weak points, requiring complexity to implement, degradation of image quality and large processing delay. The bit rate shaping algorithm proposed in this paper process the manipulation of moving video on the completely compressed domain to cope with above deficit. With this algorithms. we could realized efficient video bit rate shaping and the result of software simulation shows that this method has significant advantage than that of pixel oriented algorithms.

• Journal of Korean Society for Geospatial Information Science
• /
• v.11 no.4 s.27
• /
• pp.21-27
• /
• 2003

The rational polynomial coefficients(RPC) model is a generalized sensor model that is used as an alternative for the physical sensor model for IKONOS-2 and QuickBird. As the number of sensors increases along with greater complexity, and as the need for standard sensor model has become important, the applicability of the RPC model is also increasing. The RPC model can be substituted for all sensor models, such as the projective camera the linear pushbroom sensor and the SAR This paper is aimed at generating a RPC model from the physical sensor model of the KOMPSAT-1(Korean Multi-Purpose Satellite) and aerial photography. The KOMPSAT-1 collects $510{\sim}730nm$ panchromatic images with a ground sample distance (GSD) of 6.6m and a swath width of 17 km by pushbroom scanning. We generated the RPC from a physical sensor model of KOMPSAT-1 and aerial photography. The iterative least square solution based on Levenberg-Marquardt algorithm is used to estimate the RPC. In addition, data normalization and regularization are applied to improve the accuracy and minimize noise. And the accuracy of the test was evaluated based on the 2-D image coordinates. From this test, we were able to find that the RPC model is suitable for both KOMPSAT-1 and aerial photography.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.325-338
• /
• 2004

A data warehouse stores information that is collected from multiple, heterogeneous information sources for the purpose of complex querying and analysis. Information in the warehouse is typically stored In the form of materialized views, which represent pre-computed portions of frequently asked queries. One of the most important tasks of designing a warehouse is the selection of materialized views to be maintained in the warehouse. The goal is to select a set of views so that the total query response time over all queries can be minimized while a limited amount of time for maintaining the views is given(maintenance-cost view selection problem). In this paper, we propose an efficient solution to the maintenance-cost view selection problem using a genetic algorithm for computing a near-optimal set of views. Specifically, we explore the maintenance-cost view selection problem in the context of OR view graphs. We show that our approach represents a dramatic improvement in terms of time complexity over existing search-based approaches that use heuristics. Our analysis shows that the algorithm consistently yields a solution that only has an additional 10% of query cost of over the optimal query cost while at the same time exhibits an impressive performance of only a linear increase in execution time. We have implemented a prototype version of our algorithm that is used to evaluate our approach.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.465-475
• /
• 2022

Due to the impact of COVID-19, people are paying attention to convenience and health, and the use of IoT devices to help them is increasing. In order to embed a lightweight security element in IoT devices that need to handle sensitive information even with limited resources, the development of a lightweight S-box is essential. Until 2021, it was common to develop a lightweight 4-bit S-box by a heuristic method, and to develop an extended structure or repeat the same operation for a larger size lightweight S-box. However, in January 2022, a paper that proposed a heuristic algorithm to find an 8-bit S-box with better differential uniformity and linearity than the S-box generated with an MISTY extended structure, although non-bijective, was published [1]. The heuristic algorithm proposed in this paper generates an S-box by adding AND operations one by one. Whenever an AND operation is added, they use a method that pre-removes the S-box for which the calculated differential uniformity does not reach the desired criterion. In this paper, we improve the performance of this heuristic algorithm. By increasing the amount of pre-removal using not only differential uniformity but also other differential property, and adding a process of calculating linearity for pre-removing, it is possible to satisfy not only differential security but also linear security.