The inflection S-shaped software reliability growth model (SRGM) proposed by Ohba (1984) is one of the well- known SRGMs. This paper deals with the optimal software release problem with regard to the expected software cost under this model based on the Bayesian approach. To reflect the effect of the learning experience for the updated software system, we consider several improvement factors to adjust the values of parameters characterizing the inflection S-shaped SRGM. Appropriate prior distributions are assumed for such factors and the expected total software cost is formulated. The optimal release time is shown to be finite and uniquely determined. Because of the flexibility of prior distributions, the proposed Bayesian methods may be applied in many different situations. Numerical results are presented on the basis of the real data.

Intrusion detection system (IDS) has played a central role as an appliance to effectively defend our crucial computer systems or networks against attackers on the Internet. The most widely deployed and commercially available methods for intrusion detection employ signature-based detection. However, they cannot detect unknown intrusions intrinsically which are not matched to the signatures, and their methods consume huge amounts of cost and time to acquire the signatures. In order to cope with the problems, many researchers have proposed various kinds of methods that are based on unsupervised learning techniques. Although they enable one to construct intrusion detection model with low cost and effort, and have capability to detect unforeseen attacks, they still have mainly two problems in intrusion detection: a low detection rate and a high false positive rate. In this paper, we present a new clustering method to improve the detection rate while maintaining a low false positive rate. We evaluated our method using KDD Cup 1999 data set. Evaluation results show that superiority of our approach to other existing algorithms reported in the literature.

In this paper, we discuss noise reduction approaches to improving range images using a nonlinear 2D Kalman filter. First, we propose the nonlinear 2D Kalman filter, which can reduce noise in the range image using an estimated edge vector and a nonlinear function that does not distort sharp edges. Second, we evaluate reduction of the additive noise in a test range image using the mean square error (MSE). Third, we discuss the detection rate and the number of false detections in the estimated range image. Fourth, a simulation example demonstrating the performance of the proposed 2D Kalman filter for a real range image having abrupt changes is presented. Finally, simulation results are presented which show that the estimated image of the nonlinear 2D Kalman filter is effective in reducing the amount of noise, while causing minimal smoothing of the abrupt changes.