• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.4
• /
• pp.239-250
• /
• 2013

Context-aware mobile computing has become the primary approach to realize automatic, autonomous, and user-centric computing in the context of largely increasing the amount of mobile devices used that embed available sensors. However, designing an inference engine nonetheless requires the tasks of analyzing contexts, situations that can be inferred, etc. Moreover, a mobile device has limited resources and limited computation capability, which results in recognizing the common sense of its unsuitable environment for processing inference. Hence, we propose context-situation reasoning elements and their formal models in this paper, and we verify the formal models' applicability by applying them to an example. Finally, we design and implement an inference engine that realize the context-situation inference elements in computing environment, and we experiment an example by using the proposed inference engine to verify applicability and reusability of the inference engine.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.49-61
• /
• 2003

Electronic voting schemes must provide universal verifiability and receipt-freeness, as well as basic properties such as privacy, eligibility, to make the election fair and transparent. But it is difficult to provide both universal verifiability and receipt-freeness because they are mutually contradictory in their objective. To date, most electronic voting schemes provide only one of these properties and those few that provide both properties are not practical due to heavy computational load. In this paper, we present an efficient electronic voting scheme that provides both properties. The proposed scheme uses a trusted third party called HR(Honest Randomizer) and requires only one-way untappable channels from HRs to voters. Among the schemes that assume only one-way untappable channel this scheme requires the least amount of computation. Among the schemes that provide both properties, this scheme uses the weakest physical assumption. We also discuss the security of the system and compare our scheme with other related schemes.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.611-616
• /
• 2014

Rabin fingerprinting used for chunking requires the largest amount computation time in data deduplication, In this paper, therefore, we proposed parallel Rabin fingerprinting on GPGPU for efficient data deduplication. In addition, for efficient parallelism in Rabin fingerprinting, four issues are considered. Firstly, when dividing input data stream into data sections, we consider the data located near the boundaries between data sections to calculate Rabin fingerprint continuously. Secondly, we consider exploiting the characteristics of Rabin fingerprinting for efficient operation. Thirdly, we consider the chunk boundaries which can be changed compared to sequential Rabin fingerprinting when adapting parallel Rabin fingerprinting. Finally, we consider optimizing GPGPU memory access. Parallel Rabin fingerprinting on GPGPU shows 16 times and 5.3 times better performance compared to sequential Rabin fingerprinting on CPU and compared to parallel Rabin fingerprinting on CPU, respectively. These throughput improvement of Rabin fingerprinting can lead to total performance improvement of data deduplication.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.406-413
• /
• 2001

Ordinary high-speed block matching algorithms have a disadvantage that they need to get MAD (Mean Absolute Distance) as many as the number of search points due to comparing the MAD between the current frame's search block and the reference frame's search block. To solve such disadvantage of high-speed block matching algorithm, the proposed high-speed DS algorithm employs a MMAD calculation method using a specific characteristic that neighboring pixels have almost same values. In this thesis, we can get rid of unnecessary MAD calculation between the search point block by the new calculation method which uses the previously calculated MAD as the current search point and by breaking from the established MAD calculation method which calculates the MAD of a new search point by each search stage. Comparing with the established high-speed block matching algorithm, this new calculation's estimated movement error was shown as similar, and th total calculation amount decreased by $2FN^2Ep$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10A
• /
• pp.823-829
• /
• 2011

Recently, wireless body area network (WBAN) has received much attention as an application for the ubiquitous healthcare system. In WBAN, each sensor nodes and a personal base station such as PDA have an energy constraint and computation overhead should be minimized due to node's limited computing power and memory constraint. The reliable data transmission also must be guaranteed because it handles vital signals. In this paper, we propose a systematic network coding scheme for WBAN to reduce the network coding overhead as well as total energy consumption for completion the transmission. We model the proposed scheme using Markov chain. To minimize the total energy consumption for completing the data transmission, we made the problem as a minimization problem and find an optimal solution. Our simulation result shows that large amount of energy reduction is achieved by proposed systematic network coding. Also, the proposed scheme reduces the computational overhead of network coding imposed on each node by simplify the decoding process.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.31-39
• /
• 2011

The facial recognition algorithms using Gabor wavelet based face graph produce very good performance while they have some weakness such as a large amount of computation and an irregular result depend on initial location. We proposed a fully automatic facial recognition algorithm using a Gabor feature based geometric deformable face graph matching. The initial location and size of a face graph can be selected using Adaboost detection results for speed-up. To find the best face graph with the face model graph by updating the size and location of the graph, the geometric transformable parameters are defined. The best parameters for an optimal face graph are derived using an optimization technique. The simulation results show that the proposed algorithm can produce very good performance with recognition rate 96.7% and recognition speed 0.26 sec for FERET database.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.562-569
• /
• 2019

Raman spectroscopy has been receiving increased attention as a standoff explosive detection technique. In addition, there is a growing need for a fast search method that can identify raman spectrum for measured chemical substances compared to known raman spectra in large database. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet spectra. To overcome this problem, we presented the MPS Sort with Sorted Variance+PDS method for the fast algorithm to search for the closet spectra in the last paper. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely spectra and save a great deal of computation time. In this paper, we present two new methods for the fast algorithm to search for the closet spectra. the PCA+PDS algorithm reduces the amount of computation by reducing the dimension of the data through PCA transformation with the same result as the distance calculation using the whole data. the Hierarchical Cluster Tree algorithm makes a binary hierarchical tree using PCA transformed spectra data. then it start searching from the clusters closest to the input spectrum and do not calculate many spectra that can not be candidates, which save a great deal of computation time. As the Experiment results, PCA+PDS shows about 60.06% performance improvement for the MPS Sort with Sorted Variance+PDS. also, Hierarchical Tree shows about 17.74% performance improvement for the PCA+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.607-616
• /
• 2005

Due to the limited resources in thin-client and the large amount of computation for decoding MPEG media, it is not easy to support the QoS stream media to clients. To solve the problems, the terminal servers would be charged for decoding the MPEG media and thin-clients have a role to update only the changed areas in their screen. However, these previous approaches cause severely low video quality. In addition, since servers perform all procedures to decode MPEG media, they are easily saturated even under a small number of clients. In this paper, the sources of the low video duality are investigated in the previous thin-clients' solutions working in wireless and wired environments. From the detailed experiments, an intelligent media player is proposed to achieve the QoS streams by supporting both the enhanced video duality and the audio synchronized with video frames.

• Asian-Australasian Journal of Animal Sciences
• /
• v.13 no.8
• /
• pp.1147-1153
• /
• 2000

A total of 9,540 pigs were evaluated for their growth performance to provide information on the development of different feeding strategies to support maximum rate of protein deposition (PD). Large variations in growth performance and protein deposition rate were found in the population used in this study (ADG from 701 to 974 g/day; ADFI from 1,726 to 2,498 g/day; Feed/gain from 2.10 to 2.90; Backfat thickness from 12.4 to 20.5 mm and PD rate from 103 to 153 g/day). It was found that ADG was positively correlated to PD ($R^2=0.9362$, p<0.0001) while FCR was negatively correlated to PD ($R^2=0.4031$, p<0.0001). Backfat thickness was negatively correlated to PD ($R^2=0.7024$, p<0.0001) and to ADG ($R^2=0.5096$, p<0.0001). The estimated lysine requirement based on PD rate also showed large variation (12.37 to 18.38 g/day true ileal digestible lysine on average between 25 and 100 kg), thus strongly indicated the need of separate feeding strategies for each group of pigs. When pigs were divided into three categories according to estimated whole body PD rate, the group of pigs with the highest PD rate grew faster by 6.3 and 13.9% than pigs with intermediate and low PD rate, respectively. Feed utilization was also more efficient in pigs with a high PD rate. It appeared that pigs with high PD rate maintained higher PD rate especially in the later stage of their life. Pigs with high PD rate require an extra amount of 1.2 and 2.4 g/true digestible lysine per day and 0.4 and 0.8% more lysine in the diet than pigs with intermediate and low PD rate during the growing-finishing period respectively. Results of this study suggest that there is a need for separate feeding strategies for individual group of pigs with different PD rate. It should be noted that average value for each group presented in this report is not the adequate amount for an animals potential for maximum PD rate. With recent development in growth modeling and access to computer technologies to facilitate computation, pork producers can easily estimate pigs protein deposition rate and thus can make their own feeding strategies.