• The KIPS Transactions:PartD
• /
• v.13D no.6 s.109
• /
• pp.839-846
• /
• 2006

Context-aware adaptive service for overcoming the limitations of wireless devices and maintaining adequate service levels in changing environments is becoming an important issue. However, most existing studies concentrate on an adaptation module on the client, proxy, or server. These existing studies thus suffer from the problem of having the workload concentrated on a single system when the number of users increases md, and as a result, increases the response time to a user's request. Therefore, in this paper the adaptation module is dispersed and arranged over the client, proxy, and server. The module monitors the contort of the system and creates a proposition as to the dispersed adaptation system in which the most adequate system for conducting operations. Through this method faster adaptation work will be made possible even when the numbers of users increase, and more stable system operation is made possible as the workload is divided. In order to evaluate the proposed system, a prototype is constructed and dispersed operations are tested using multimedia based learning content, simulating server overload and compared the response times and system stability with the existing server based adaptation method. The effectiveness of the system is confirmed through this results.

• The Journal of the Korea Contents Association
• /
• v.11 no.11
• /
• pp.49-61
• /
• 2011

In recent, library is considered as an integrated knowledge convergence center that can respond to various requests about information service of users. Therefor it is necessary to establish a novel information system based on information communications technologies of the era. In other words, it is currently required to develop mobile information service available in portable devices such as smart phones or tablet PCs, and to establish information system reflecting cloud computing, SaaS, Annotation, and Library 2.0 etc. In this paper we design and implement a library information system using collective intelligence and cloud computing. This information system can be adapted for the varieties of mobile service paradigm and abruptly increasing amount of electronic materials. Advantages of this concept model are resource sharing, multi-tenant supporting, configuration, and meta-data supporting etc. In addition it can offer software on-demand type user services. In order to test the performance of our system, we perform an effectiveness analysis and TTA authentication test. The average response time corresponding to variance of data reveals 0.692 seconds which is very good performance in timing effectiveness point of view. And we detect maturity level-3 or 4 authentication in TTA tests such as SaaS maturity, performance, and application programs.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.22-31
• /
• 2007

The proposed algorithm in this paper is based on the wavelet decomposition and the energy computation of composed blocks so the amount of calculation and complexity is minimized by adaptively replacing the DWT coefficients and managing the resources effectively. We are now living in the world of a lot. of multimedia applications for many digital electric appliances and mobile devices. Among so many multimedia applications, the digital image compression is very important technology for digital cameras to store and transmit digital images to other sites and JPEG2000 is one of the cutting edge technology to compress still images efficiently. The digital cm technology is mainly using the digital image compression features so that those images could be efficiently saved locally and transferred to other sites without any losses. JPEG2000 standard is applicable for processing the digital images usefully to keep, send and receive through wired and/or wireless networks. The discrete wavelet transform (DWT) is one of the main differences to the previous digital image compression standard such as JPEG, performing the DWT to the entire image rather than splitting into many blocks. Several digital images m tested with this method and restored to compare to the results of conventional DWT which shows that the proposed algorithm get the better result without any significant degradation in terms of MSE & PSNR and the number of zero coefficients when the energy based adaptive DWT is applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.365-373
• /
• 2003

In this paper, we design a versatle RS decoder which can decode RS codes of any block length n as well as any message length k, based on a modified Euclid's algorithm (MEA). This unique feature is favorable for a shortened RS code of any block length it eliminates the need to insert zeros before decoding a shortened RS code. Furthermore, the value of error correcting capability t can be changed in real time at every codeword block. Thus, when a return channel is available, the error correcting capability can be adaptiverly altered according to channel state. The decoder permits 4-step pipelined processing : (1) syndrome calculation (2) MEA block (3) error magnitude calculation (4) decoder failure check. Each step is designed to form a structure suitable for decoding a RS code with varying block length. A new architecture is proposed for a MEA block in step (2) and an architecture of outputting in reversed order is employed for a polynomial evaluation in step (3). To maintain to throughput rate with less circuitry, the MEA block uses not only a multiplexing and recursive technique but also an overclocking technique. The adaptive RS decoder over GF($2^8$) with the maximal error correcting capability of 10 has been designed in VHDL, and successfully synthesized in a FPGA.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.8
• /
• pp.195-202
• /
• 2018

With the development of location-based applications such as smart phones and GPS navigation, active research is being conducted to protect location and trajectory privacy. To receive location-related services, users must disclose their exact location to the server. However, disclosure of users' location exposes not only their locations but also their trajectory to the server, which can lead to concerns of privacy violation. Furthermore, users request from the server not only location information but also multimedia information (photographs, reviews, etc. of the location), and this increases the processing cost of the server and the information to be received by the user. To solve these problems, this study proposes the EGTC (Enhanced Grid-based Trajectory Cloaking) technique. As with the existing GTC (Grid-based Trajectory Cloaking) technique, EGTC method divides the user trajectory into grids at the user privacy level (UPL) and creates a cloaking region in which a random query sequence is determined. In the next step, the necessary information is received as index by considering the sub-grid cell corresponding to the path through which the user wishes to move as c(x,y). The proposed method ensures the trajectory privacy as with the existing GTC method while reducing the amount of information the user must listen to. The excellence of the proposed method has been proven through experimental results.

• International Area Studies Review
• /
• v.15 no.2
• /
• pp.125-150
• /
• 2011

As the economy grows, there is a concern that the economic development causes a productivity reduction because of the service intensive growth. However, the economy of developed countries encounter with the productivity growth as their economy grows, which phenomenon called Baumol's paradox. Oulton (1999, 2001) find out the reason of Baumol's paradox in a forward and backward chain effects. So, this paper is aimed at verifying the theory of Oulton (1999, 2001). Moreover, we test the difference effect between a consumer service and producer service input using a dummy variable. We use the Input-Output Table (1990, 1995, 2000, 2005) that is offered by the Bank of Korea to accomplish the purpose of our research that is represented above. We find out that the Korea's intermediate producer service inputs cause a multifactor productivity growth. That result is matched with the Oulton (1999, 2001)'s theory. But, the intermediate consumer service inputs don't have a significant effect on a multifactor productivity. The result of verifying the effect of intermediate producer service inputs among industries shows that the effects on manufacture industries are less than other industries.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.329-337
• /
• 2017

This paper proposes a search method that explores parameters C and σ values of support vector machines (SVM) to improve performance while maintaining search accuracy. A traditional grid search method requires tremendous computational times because it searches all available combinations of C and σ values to find optimal combinations which provide the best performance of SVM. To address this issue, this paper proposes a deep search method that reduces computational time. In the first stage, it divides C-σ- accurate metrics into four regions, searches a median value of each region, and then selects a point of the highest accurate value as a start point. In the second stage, the selected start points are re-divided into four regions, and then the highest accurate point is assigned as a new search point. In the third stage, after eight points near the search point. are explored and the highest accurate value is assigned as a new search point, corresponding points are divided into four parts and it calculates an accurate value. In the last stage, it is continued until an accurate metric value is the highest compared to the neighborhood point values. If it is not satisfied, it is repeated from the second stage with the input level value. Experimental results using normal and defect bearings show that the proposed deep search algorithm outperforms the conventional algorithms in terms of performance and search time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• Journal of Energy Engineering
• /
• v.25 no.4
• /
• pp.103-109
• /
• 2016

Polyethylene pipes has useful benefits which are anti-corrosive and flexible material, so it is used to gas pipes but also class 3 water pipes of nuclear power plant, process pipes of petrochemical plant and chemical plant. So the usage of polyethylene pipes is widely increased. But it has been limited for the usage of polyethylene, because it can not be directly detected to fusion joints by using non destructive evaluation. Polyethylene pipes are connected by two methods, one is butt fusion and the other is electrofusion. Butt fusion is widely used to connecting the pipes. It is proposed to method for determining the reliability of joints in this study that is detection of the melt flow zone at fusion joints. In this study, middle density polyethylene is used, outside diameter of the test specimen is 225mm and thickness is 20.5mm. Speed of ultrasonic of this test specimen is 2,200m/s. Test specimens were fabricated by varying the heating time which means from 0% to 130% applying time through heating plate to polyethylene for detecting melt flow zone. Also 4 additional test specimens were made, one was made that not scrapping attached surface of pipes but applying 100% of the proper heating time and the others were made to include of soil, gravel and vinly tape paper at fusion joints, that were also applied 100% of proper heating time. Ultrasonic testing to measure the melt flow zone of 20 test specimens was conducted by using 3.5MHz and 5.0MHz ultrasonic probes and melt flow zone measuring was conducted to three times at different point to one specimen. To differentiate the melt flow zone signal, post image processing was equally conducted to all test results and image levels, contrast, sharpen, threshold were adopted to all teat results and the test results were displayed gray scale. From the results, for the shorter heating times the reflection area of multiple echo have been increased, so the data was obtained from the position where it can be eliminated as much as possible. At 80% of proper heating time(168 sec.), the signal of melt flow zone was obtained clearly, so measuring could be conducted. From 7% of proper heating time(15 sec.) to shorter heating times. we could not obtain the signal because test specimen was not fused. From the result, we can verify that measuring of melt flow zone by using phased array ultrasonic imaging method is possible. And we can verify to complete and incomplete butt fusion by measuring the melt flow zone.