• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.51-68
• /
• 2020

In this paper, the author considers the nonparametric regression model with negatively orthant dependent random variables. The wavelet procedures are developed to estimate the regression function. For the wavelet estimator of unknown function g(·), the almost sure consistency is derived and the complete consistency is established under the mild conditions. Our results generalize and improve some known ones for independent random variables and dependent random variables.

• Journal of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.327-349
• /
• 2021

In this paper, we main study the strong law of large numbers and complete convergence for weighted sums of asymptotically almost negatively associated (AANA, in short) random variables, by using the Marcinkiewicz-Zygmund type moment inequality and Roenthal type moment inequality for AANA random variables. As an application, the complete consistency for the weighted linear estimator of nonparametric regression models based on AANA errors is obtained. Finally, some numerical simulations are carried out to verify the validity of our theoretical result.

• Journal of the Korean Data and Information Science Society
• /
• v.3 no.1
• /
• pp.25-31
• /
• 1992

Some results relating to $C_{0}(R)\;and\;L^{1}(R)$ spaces with application to kernel density estimators will be introduced. First, random elements in $C_{0}(R)\;and\;L^{1}(R)$ are discussed. Then, complete convergence limit theorems are given to show that these results can be used in establishing uniformly consistency and $L^{1}$ consistency.

• IE interfaces
• /
• v.16 no.2
• /
• pp.229-239
• /
• 2003

The On-Line Analytical Processing (OLAP) tools access data from the data warehouse for complex data analysis, such as multidimensional data analysis, and decision support activities. Current research has lead to new developments in all aspects of data warehousing, however, there are still a number of problems that need to be solved for making data warehousing effective. View maintenance, one of them, is to maintain view in response to updates in source data. Keeping the view consistent with updates to the base relations, however, can be expensive, since it may involve querying external sources where the base relations reside. In order to reduce maintenance costs, it is possible to maintain the views using information that is strictly local to the data warehouse. This process is usually referred to as "self-maintenance of views". A number of algorithm have been proposed for self maintenance of views where they keep some additional information in data warehouse in the form of auxiliary views. But those algorithms did not consider a consistency of materialized views using view self-maintenance. The purpose of this paper is to research consistency problem when self-maintenance of views is implemented. The proposed "conveyor algorithm" will resolved a complete consistency of materialized view using self-maintenance with considering network delay. The rationale for conveyor algorithm and performance characteristics are described in detail.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.33-40
• /
• 2004

According as client/server is generalized by development of computer performance and information communication technology, Servers uses local cache for extensibility and early response time, and reduction of limited bandwidth. Consistency of cached data need between server and client this time and much technique are proposed according to this. This Paper improved update frequency cache consistency in old. Existent consistency techniques is disadvantage that response time is late because synchronous declaration or abort step increases because delaying write intention declaration. Techniques that is proposed in this paper did to perform referring update time about object that page request or when complete update operation happens to solve these problem. Therefore, have advantage that response is fast because could run write intention declaration or update by sel_mode electively asynchronously when update operation consists and abort step decreases and clearer selection.

• Journal of the Korean Statistical Society
• /
• v.32 no.1
• /
• pp.33-46
• /
• 2003

The continual reassessment method (CRM) provides a Bayesian estimation of the maximum tolerated dose (MTD) in phase I clinical trials. The CRM has been proposed as an alternative design of the standard design. The CRM has been modified to improve practical feasibility and, recently, the likelihood approach CRM has been proposed. In this paper we investigate the consistency and asymptotic normality of the modified likelihood approach CRM in which the maximum likelihood estimate is used instead of the posterior mean. Small-sample properties of the consistency is examined using complete enumeration. Both the asymptotic results and their small-sample properties show that the modified CRML outperforms the standard design.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.492-501
• /
• 2002

An asynchronous trigger processor (ATP) is a oftware system that processes triggers after update transactions to databases are complete. In an ATP, discrimination networks are used to check the trigger conditions efficiently. Discrimination networks store their internal states in memory nodes. TriggerMan is an ATP and uses Gator network as the .discrimination network. The changes in databases are delivered to TriggerMan in the form of tokens. Processing tokens against a Gator network updates the memory nodes of the network and checks the condition of a trigger for which the network is built. Parallel token processing is one of the methods that can improve the system performance. However, uncontrolled parallel processing breaks trigger processing semantic consistency. In this paper, we propose four trigger processing consistency levels that allow parallel token processing with minimal anomalies. For each consistency level, a parallel token processing technique is developed. The techniques are proven to be valid and are also applicable to materialized view maintenance.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2075-2082
• /
• 1998

Rule-based knowledge representHtion is, the most popular technique for ,storage and manipulation of domain knowledge in expert system. By the way, the amount of knowledge increases more and more in this representatiun technique, it, relationship becomes complex, and even its contents can be modified. This is the reason why rule-based knowledge representation technique requires a verification ,system which can maintain consistency and completeness of knowledge base. This paper is to propose a verification system for consistency and completeness of knowledge base to promote the efficiency and reliability of expert system. After verifying the potential errors both in structure and in semantics whenever a new rule is added, this system renders knowledge base consistent and complete by correcting them automatically or by making expert correct them if it fails.

• Journal of Climate Change Research
• /
• v.7 no.4
• /
• pp.485-492
• /
• 2016

For reporting national greenhouse gas inventory in forest sector, the forest growing stock from the National Forest Inventory (NFI) system has used as activity data sources. The National Forest Inventory system was changed from rotation system by province to annual system by 5 years across the country. The forest growing stocks based on the new inventory system produced a different trend compared to the previous estimations. This study was implemented to recalculate previous forest growing stocks for time series consistency at a national level. The recalculation of forest growing stock was conducted in an overlap approach by the IPCC guideline. In order to support the more consistency data, we used calibration factors between applied stand volumes in 1985 and 2012, respectively. As a result, the time series of recalculated forest growing stock was to be consistency using the overlap approach and the calibration factor with the lower middle/middle site index. According to the applied overlap period, however, we will recalculate activity data using more complete data from national forest inventory system.

• Communications for Statistical Applications and Methods
• /
• v.26 no.6
• /
• pp.635-644
• /
• 2019

Class probability is a fundamental target in classification that contains complete classification information. In this article, we propose a class probability estimation method when the predictor is functional. Motivated by Wang et al. (Biometrika, 95, 149-167, 2007), our estimator is obtained by training a sequence of functional weighted support vector machines (FWSVM) with different weights, which can be justified by the Fisher consistency of the hinge loss. The proposed method can be extended to multiclass classification via pairwise coupling proposed by Wu et al. (Journal of Machine Learning Research, 5, 975-1005, 2004). The use of FWSVM makes our method model-free as well as computationally efficient due to the piecewise linearity of the FWSVM solutions as functions of the weight. Numerical investigation to both synthetic and real data show the advantageous performance of the proposed method.