• Imaging Science in Dentistry
• /
• v.33 no.3
• /
• pp.151-159
• /
• 2003

Purpose: The purpose of this study is to evaluate the effectiveness and usefulness of newly developed personal computer-based software to eliminate the linear artifacts by the metal restorations. Materials and Methods: A 3D CT image was conventionally reconstructed using ADVANTAGE WINDOWS 2.0 3D Analysis software (GE Medical System, Milwaukee, USA) and eliminated the linear artifacts manually. Next, a 3D CT image was reconstructed using V-works 4.0/sup TM/(Cybermed Inc., Seoul, Korea) and the linear artifacts eliminated manually in the axial images by a skillful operator using a personal computer. A 3D CT image was reconstructed using V-works 4.0/sup TM/(Cybermed Inc., Seoul, Korea) and the linear artifacts were removed using a simplified algorithm program to eliminate the linear artifacts automatically in the axial images using a personal computer, abbreviating the manual editing procedure. Finally, the automatically edited reconstructed 3D images were compared to the manually edited images. Results and Conclusion: We effectively eliminated the linear artifacts automatically by this algorithm, not by the manual editing procedures, in some degree. But programs based on more complicated and accurate algorithms may lead to a nearly flawless elimination of these linear artifacts automatically.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.1
• /
• pp.63-71
• /
• 2012

Most of sensor networks are difficult to be debugged, verified, and upgraded once they are deployed in the fields, for they are usually deployed in real world and large scale. Therefore, before deploying the sensor networks, we should test and verify them sufficiently in realistic testbeds. However, since we need to control physical environments which interact with sensor networks, it takes much of time and cost to test and verify sensor networks at the level of resource-constrained sensor nodes in such environments. This paper proposes an efficient software framework for evaluating and verifying sensor networks in the view points of network and application operations (i.e., accuracy of sensing algorithms). Applying the proposed software framework to the development of a simulator for a smart parking application based on wireless sensor network, this paper verifies the feasibility of the proposed framework.

• KIISE Transactions on Computing Practices
• /
• v.21 no.9
• /
• pp.616-621
• /
• 2015

Recently developed software systems have many components, and their complexity is thus increasing. Last year, about 375 bug reports in one day were reported to a software repository in Eclipse and Mozilla open source projects. With so many bug reports submitted, developers' time and efforts have increased unnecessarily. Since the bug severity is manually determined by quality assurance, project manager or other developers in the general bug fixing process, it is biased to them. They might also make a mistake on the manual decision because of the large number of bug reports. Therefore, in this study, we propose an approach of bug severity prediction to solve these problems. First, we find similar topics within a new bug report and reduce the candidate reports of the topic by using the meta field of the bug report. Next, we train the reduced reports by applying Naive Bayes Multinomial. Finally, we predict the severity of the new bug report. We compare our approach with other prediction algorithms by using bug reports in open source projects. The results show that our approach better predicts bug severity than other algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.5
• /
• pp.649-657
• /
• 2018

It is essential that weapons which are mounted on aircraft need to prove its reliability and safety during its developments. A guided missile should have high reliability and safety throughout various tests which are including ground tests, captive flight tests, detailed technical tests and operational tests. In these various tests, it is vital that software of each component in the guided missile should be easily updated in order to correct algorithms or errors. In this paper, we propose a software update technique based on MDTP(mass data transfer protocol) which are defined in MIL-STD-1760. The proposed techniques have the following advantages: First, software of each unit in a weapon can be updated through a test equipment without disassemble a guided missile. Second, development periods for a software update can be reduced by reusing MDTP. Third, we can easily maintenance of the software because it is based on standard. We proved its efficiency and validity through experiments. Therefore, the proposed technique should be effectively utilized for software update of a weapon mounted on an aircraft during development processes.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.190-203
• /
• 2015

Free and open source software (FOSS) has created a large pool of source codes that can be easily copied to create new applications. However, a copy should preserve copyright notice and license of the original file unless the license explicitly permits such a change. Through software evolution, it is challenging to keep original licenses or choose proper licenses. As a result, there are many potential license violations. Despite the fact that violations can have high impact on protecting copyright, identification of violations is highly complex. It relies on manual inspections by experts. However, such inspection cannot be scaled up with open source software released daily worldwide. To make this process scalable, we propose the following two methods: use machine-based algorithms to narrow down the potential violations; and guide non-experts to manually inspect violations. Using the first method, we found 219 projects (76.6%) with potential violations. Using the second method, we show that the accuracy of crowds is comparable to that of experts. Our techniques might help developers identify potential violations, understand the causes, and resolve these violations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1761-1784
• /
• 2017

In order to improve the embedding rate of reversible watermarking algorithm for digital image and enhance the imperceptibility of the watermarked image, an adaptive reversible image watermarking algorithm based on DE is proposed. By analyzing the traditional DE algorithm and the generalized DE algorithm, an improved difference expansion algorithm is proposed. Through the analysis of image texture features, the improved algorithm is used for embedding and extracting the watermark. At the same time, in order to improve the embedding capacity and visual quality, the improved algorithm is optimized in this paper. Simulation results show that the proposed algorithm can not only achieve the blind extraction, but also significantly heighten the embedded capacity and non-perception. Moreover, compared with similar algorithms, it is easy to implement, and the quality of the watermarked images is high.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.344-350
• /
• 2006

The software GPS receivers based on the SDR technology provide the ability to easily adapt the other signal processing algorithms without changing or modifying the hardware of the GPS receiver. However, it is difficult to implement the software GPS receivers using a commercial processor because of the heavy computational burden for processing the GPS signals in real-time. This paper proposes an efficient GPS signal processing scheme to reduce the computational burden for processing the GPS signals in the software GPS receiver, which uses a fundamental notion compressing the replica signals and the encoded look-up table method to generate correlation values between GPS signals and replica signals. In this paper, it is explained that the computational burden of the proposed scheme is much smaller than that of the typical GPS signal processing scheme. Finally, the processing time of the proposed scheme is compared with that of the typical scheme, and the improvement in the aspect of the computational burden is also shown.

• Journal of Information Technology Services
• /
• v.11 no.1
• /
• pp.211-221
• /
• 2012

Many metric-based classification models have been proposed to predict fault-proneness of software module. This paper presents two prediction models using Bayesian classifier which is one of the most popular modern classification algorithms. Bayesian model based on Bayesian probability theory can be a promising technique for software quality prediction. This is due to the ability to represent uncertainty using probabilities and the ability to partly incorporate expert's knowledge into training data. The two models, Na$\ddot{i}$veBayes(NB) and Bayesian Belief Network(BBN), are constructed and dimensionality reduction of training data and test data are performed before model evaluation. Prediction accuracy of the model is evaluated using two prediction error measures, Type I error and Type II error, and compared with well-known prediction models, backpropagation neural network model and support vector machine model. The results show that the prediction performance of BBN model is slightly better than that of NB. For the data set with ambiguity, although the BBN model's prediction accuracy is not as good as the compared models, it achieves better performance than the compared models for the data set without ambiguity.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.335-343
• /
• 2014

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1059-1070
• /
• 2005

For genetic algorithms, the population may get stuck in a local optimum. The population can escape from this after a long duration. This phenomenon is called punctuated equilibrium. The punctuated equilibria observed in nature and computational ecosystems are known to be well described by diffusion equations. In this paper, simple genetic algorithms are theoretically analyzed to show that they can also be described by a diffusion equation. When fitness is the function of unitation, this analysis can be further refined to make the parameters of genetic algorithms appear in this equation. Using theoretical results on the diffusion equation, the duration of equilibrium is shown to be exponential of such parameters as population size, 1/(mutation probability), and potential barrier. This is corroborated by simulation results for bistable potential landscapes with one local optimum and one global optimum.