• International Journal of Computer Science & Network Security
• /
• v.24 no.10
• /
• pp.147-153
• /
• 2024

The problem of handling uncertain data has been attracting the attention of researchers. This paper mainly focuses on uncertain data clustering and noise data streams. Therefore, we will provide a framework to realize the effect of uncertainty. Nowadays, a large number of tenders are present which measure the data roughly. As, sensors normally have distortion in their results cause of the imprecisions transmission in data and retrieval. Mostly these errors are identified. This information is used for minimizing process to advance results according to quality. In this paper, we compare general methods of monitor uncertainty, which have described in the different research papers.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.117-130
• /
• 2006

With the rapid development of technologies related to Ubiquitous Sensor Network (USN), sensors are being utilized in various application areas. In general, the data sensed by each sensor node on ubiquitous sensor networks are stored into the central server for efficient search. Because update is delayed to reduce the cost of update in this environment, uncertain data can be stored in the central server. In addition, Uncertain data make query processing produce wrong results in the central server. Thus, this paper examines how to process uncertain data in ubiquitous sensor networks and suggests a new index for efficient processing of uncertain data. The index reduces the cost of update by delaying update in uncertainty areas. Uncertainty areas are areas where uncertain data are likely to exist. In addition, it solves the problem of low accuracy in search resulting from update delay by delaying update only for specific update areas. Lastly, we analyze the performance of the index and prove the superiority of its performance by comparing its performance evaluation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.118.2-118
• /
• 2002

Uncertain time delay happens when the process reads the sensor data and sends the control input to the plant located at a remote site in distributed control system. As in the case of data network using TCP/IP, VDN that integrates both device network and data network has uncertain tim e delay. Uncertain time delay can cause degradation in stability of distributed control system based on VDN. This paper investigates the transmission characteristic of VDN and suggests a control scheme based on the Smith's predictor to minimize the effect of uncertain time delay. The validity of the proposed control scheme is demonstrated with tracking position control of experiments.

• Journal of the Korean Data and Information Science Society
• /
• v.6 no.2
• /
• pp.17-27
• /
• 1995

We propose a framework for representing and processing uncertain knowledge on the basis of constraint satisfaction. A system of equations and/or inequalities can be considered as a set of constraints that should be solved, and each constraint in the set is transformed into a corresponding logical formula which can be solved through a constraint solving program. Most of rule-based systems, for instance, use a simple probabilistic theory in order to maintain uncertain knowledge, therefore uncertain knowledge can be represented and processed in the constraint satisfaction program quite efficiently.

• Journal of the Korean Society of Safety
• /
• v.18 no.3
• /
• pp.154-160
• /
• 2003

Uncertain time delay happens when the process reads the sensor data and sends the control input to the plant located at a remote site in distributed control system. As in the case of data network using TCP/IP, VDN that integrates both device network and data network has uncertain time delay. Uncertain time delay can cause degradation in performance and stability of distributed control system based on VDN. This paper first investigates the transmission characteristic of VDN and suggests a control scheme based on the Smith's predictor to minimize the effect of uncertain varying time delay. The validity of the proposed control scheme is demonstrated with real-time velocity control of DC servo motor located in remote site.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.41-45
• /
• 2013

Age replacement policy is a commonly policy in maintenance management of spare part. It means that a spare part is always replaced at failure or fixed time after its installation, whichever occurs first. An optimal age replacement policy of spare parts concerns with finding the optimal replacement time determined by minimizing the expected cost per unit time. The age of the part was generally assumed to be a random variable in the past literatures, but in many situations, there are few or even no observed data to estimate the probability distribution of part's lifetime. In order to solve this phenomenon, a new uncertain age replacement policy has been proposed recently, in which the age of the part was assumed to be an uncertain variable. This paper discusses the optimal age replacement policies by dealing with the parts' lifetimes as different distributed uncertain variables. Several results on the optimal age replacement time are provided when the lifetimes are described by the uncertain linear, zigzag and lognormal distributions.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.1
• /
• pp.1-7
• /
• 1997

The inference process for medical expert system is mostly formed by diagnostic knowledge on the if-then rule base. Oriental medicine diagnostic knowledge, however, may involve uncertain knowledge caused by ambiguous concept. In this paper, we analyze an oriental medicine diagnostic process by a rule-based inference system, and propose a method for representing and processing uncertain oriental medicine diagnostic knowledge using CLP( R ) which is a kind of constraint satisfaction program.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2301-2306
• /
• 2005

Even if there are lots of researches on localization using 2D range finder in static environment, very few researches have been reported for robust real-time localization of mobile robot in uncertain and dynamic environment. In this paper, we present a new localization method based on ICP(Iterative Closest Point) algorithm for navigation of mobile robot under dynamic or uncertain environment. The ICP method is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. We use the method to align global map with 2D scanned data from range finder. The proposed algorithm accelerates the processing time by uniformly sampling the line fitted data from world map of mobile robot. A data filtering method is also used for threshold of occluded data from the range finder sensor. The effectiveness of the proposed method has been demonstrated through computer simulation and experiment in an office environment.

• Interaction and multiscale mechanics
• /
• v.1 no.1
• /
• pp.103-121
• /
• 2008

This paper presents an optimization-based method for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain braced frame. Based on a non-stochastic modeling of uncertainty, we assume that the parameters both of brace stiffnesses and external forces are uncertain but bounded. A brace member represents the sum of the stiffness of the actual brace and the contributions of some non-structural elements, and hence we assume that the axial stiffness of each brace is uncertain. By using the $\mathcal{S}$-lemma, we formulate a semidefinite programming (SDP) problem which provides an outer approximation of the minimal bounding ellipsoid. The minimum bounding ellipsoids are computed for a braced frame under several uncertain circumstances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.147-169
• /
• 2024

In pace with the development of network technology at lightning speed, social networks have been extensively applied in our lives. However, as social networks retain a large number of users' sensitive information, the openness of this information makes social networks vulnerable to attacks by malicious attackers. To preserve the link privacy of individuals in social networks, an uncertain graph method based on node random response is devised, which satisfies differential privacy while maintaining expected data utility. In this method, to achieve privacy preserving, the random response is applied on nodes to achieve edge modification on an original graph and node differential privacy is introduced to inject uncertainty on the edges. Simultaneously, to keep data utility, a divide and conquer strategy is adopted to decompose the original graph into many sub-graphs and each sub-graph is dealt with separately. In particular, only some larger sub-graphs selected by the exponent mechanism are modified, which further reduces the perturbation to the original graph. The presented method is proven to satisfy differential privacy. The performances of experiments demonstrate that this uncertain graph method can effectively provide a strict privacy guarantee and maintain data utility.