• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.134-147
• /
• 2009

Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the wellknown Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2C
• /
• pp.192-199
• /
• 2008

In ultra-wideband (UWB) systems, conventionally, the synchronization is to align time phases of a locally generated template and any of multipath components to within an allowable range. However, the synchronization with a low-power multipath component could incur significant performance degradation in receiver operation (e.g., detection) after the synchronization. On the other hand, the synchronization with a high-power multipath component can improve the performance in receiver operation after the synchronization. Generally, the first one among multipath components has the largest power. Thus, the synchronization with the first path component can make better performance than that with low-power component in receiver operation after the synchronization, Based on which, we first propose an optimal decision rule based on a maximum likelihood (ML) approach, and then, develope a simpler suboptimal decision rule for selecting the first path component. Simulation results show that the system has good demodulation performance, which uses new synchronization definition and the proposed decision rules have better performance than that of the conventional decision rule in UWB multipath channels. Between macroblocks in the previous and the current frame. On video samples with high motion and scene change cases, experimental results show that (1) the proposed algorithm adapts the encoded bitstream to limited channel capacity, while existing algorithms abruptly excess the limit bit rate; (2) the proposed algorithm improves picture quality with $0.4{\sim}0.9$dB in average.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.111-129
• /
• 1994

In this study, we develope a revised model as well as application of decision problem under ambiguity based on the subjectively weighted linear utility medel. Bayes'rule is used when there are ambiguous probabilities on a decision problem and test information is available. A procedure for assessing the ambiguity aversion function is also presented. Decision problem of chemical corporation is used for an illustration of the application of the subjectively weighted linear utility model using Bayesian approach. We present the optimal decisiond using newly developed model. We also perform the sensitivity analysis to assure ourselves about the conclusion we obtianed on degree of ambiguity aversion due to characterize parameter of subjectively weighted linear utility model.

• Journal of the Korea Safety Management & Science
• /
• v.12 no.3
• /
• pp.333-339
• /
• 2010

Data mining is the process of finding and analyzing data from a big database and summarizing it into useful information for a decision-making. A variety of data mining techniques have been being used for wide range of industries. One application of those is especially so for gathering meaningful information from process data in manufacturing factories for quality improvement. The purpose of this paper is to provide a methodology to improve manufacturing quality of fuel tanks which are auto-parts. The methodology is to analyse influential attributes and establish a model for optimal manufacturing condition of fuel tanks to improve the quality using decision tree, association rule, and feature selection.

• Journal of Advanced Navigation Technology
• /
• v.11 no.1
• /
• pp.105-111
• /
• 2007

This paper is concerned with fuzzy inference-based optimal sub-bands decision scheme which is to be embedded the watermark. It concentrated not only on design of fuzzy inference algorithm but also on human visual parameters (HVP), such as contrast sensitivity, texture degree. In the first, such human visual parameters as contrast sensitivity, texture degree as well as statistical characteristics are involved to select the optimal coefficients region. Secondly, fuzzy if - then rule which can be able to adapt the wide variety of environments is developed. The performance of proposed approach is evaluated with respect to the imperceptibility and correctness of watermark. According to some experimental results, contrast sensitivity function is superior in smooth image. On the other hand, statistical characteristics provide good results in rough images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.649-664
• /
• 2011

Cooperative spectrum sensing (CSS) with decision fusion is considered as a key technology for tackling the challenges caused by fading/shadowing effects and noise uncertainty in spectrum sensing in cognitive radio. However, most existing solutions assume an error-free decision transmission, which is obviously not the case in realistic scenarios. This paper extends the general decision-fusion-based CSS scheme by considering the fading/shadowing effects and noise corruption in the common control channels. With this more practical model, the fusion centre first estimates the local decisions using a binary minimum error probability detector, and then combines them to get the final result. Theoretical analysis and simulation of this CSS scheme are performed over typical channels, which suggest some performance deterioration compared with the pure case that assumes an error-free decision transmission. Furthermore, the fusion strategy optimization in the proposed cooperation model is also investigated using the Bayesian criteria. The numerical results show that the total error rate of noisy CSS is higher than that of the pure case, and the optimal values of fusion parameter in the counting rule under both cases decrease as the local detection threshold increases.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.4
• /
• pp.101-111
• /
• 2014

Spatial events are predictable using data mining classification algorithms. Decision trees have been used as one of representative classification algorithms. And they were normally used in the classification tasks that have label class values. However since using rule ranking methods, spatial prediction have been applied in the spatial prediction problems. This paper compared rule ranking methods for the spatial prediction application using a decision tree. For the comparison experiment, C4.5 decision tree algorithm, and rule ranking methods such as Laplace, M-estimate and m-branch were implemented. As a spatial prediction case study, landslide which is one of representative spatial event occurs in the natural environment was applied. Among the rule ranking methods, in the results of accuracy evaluation, m-branch showed the better accuracy than other methods. However in case of m-brach and M-estimate required additional time-consuming procedure for searching optimal parameter values. Thus according to the application areas, the methods can be selectively used. The spatial prediction using a decision tree can be used not only for spatial predictions, but also for causal analysis in the specific event occurrence location.

• Communications for Statistical Applications and Methods
• /
• v.2 no.1
• /
• pp.145-154
• /
• 1995

Empirical Bayes approach is applied to estimation of the binomial parameter when there is a cost for observations. Both the sample size and the decision rule for estimating the parameter are determined stochastically by the data, making the result more useful in applications. Our empirical Bayes problems with non-iid components are compared to the usual empirical Bayes problems with iid components. The asymptotic optimal procedure with a computer simulation is given.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.497-509
• /
• 2008

Various algorithms and architectures for efficient packet classification have been widely studied. Packet classification algorithms based on a decision tree structure such as HiCuts and HyperCuts are known to be the best by exploiting the geometrical representation of rules in a classifier. However, the algorithms are not practical since they involve complicated heuristics in selecting a dimension of cuts and determining the number of cuts at each node of the decision tree. Moreover, the cutting is not efficient enough since the cutting is based on regular interval which is not related to the actual range that each rule covers. In this paper, we proposed a new efficient packet classification algorithm using a range cutting. The proposed algorithm primarily finds out the ranges that each rule covers in 2-dimensional prefix plane and performs cutting according to the ranges. Hence, the proposed algorithm constructs a very efficient decision tree. The cutting applied to each node of the decision tree is optimal and deterministic not involving the complicated heuristics. Simulation results for rule sets generated using class-bench databases show that the proposed algorithm has better performance in average search speed and consumes up to 3-300 times less memory space compared with previous cutting algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1259-1268
• /
• 2002

One of the major goals suggested in distributed system is to improve the performance of the system through the load balancing of whole system. Load balancing among systems improves the rate of processor utilization and reduces the turnaround time of system. In this paper, we design the rule of decision-making and information interchange based on knowledge based mechanism which makes optimal load balancing by sharing the future load state information inferred from past and present information of each nodes. The result of performance evaluation shows that utilization of processors is balanced, the processing time is improved and reliability and availability of systems are enhanced. The proposed mechanism in this paper can be utilized in the design of load balancing algorithm in distributed operating systems.