• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.1
• /
• pp.91-98
• /
• 2013

The rigorous requirements of modern spacecraft missions necessitate a precise attitude determination strategy. This paper mainly researches that, based on three space-borne attitude sensors: 3-axis rate gyros, 3-antenna GPS receiver and star-sensor. To obtain global attitude estimation after an information fusion process, a feedback-involved Federated Kalman Filter (FKF), consisting of two subsystem Kalman filters (Gyros/GPS and Gyros/Star-sensor), is established. In these filters, the state equation is implemented according to the spacecraft's kinematic attitude model, while the residual error models of GPS and star-sensor observed attitude are utilized, to establish two observation equations, respectively. Taking the sensors' different update rates into account, these two subsystem filters are conducted under a variable step size state prediction method. To improve the fault tolerant capacity of the attitude determination system, this paper designs malfunction warning factors, based on the principle of ${\chi}^2$ residual verification. Mathematical simulation indicates that the information fusion strategy overwhelms the disadvantages of each sensor, acquiring global attitude estimation with precision at a 2-arcsecs level. Although a subsystem encounters malfunction, FKF still reaches precise and stable accuracy. In this process, malfunction warning factors advice malfunctions correctly and effectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.7 s.337
• /
• pp.1-6
• /
• 2005

Now that the reduction of the cell size in order to serve the increasing subscribers has raised the frequency of the location update, it has increased the cost of location management. In this paper, we show that the location management strategy based on the call arrival probability(CAP) can reduce the cost of the location management by analyzing that cost in this strategy which was proposed in [1] to reduce the cost of the location management in mobile communication. And we compare the location management cost by analyzing with that by simulating.

• IE interfaces
• /
• v.16 no.4
• /
• pp.507-514
• /
• 2003

In personal communication systems location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. The rest of cells in the location area are included into the second paging area. To reduce the paging cost the first paging area is decided by reflecting various residence patterns of mobile terminals. For an incoming call, the sequential paging is performed in the order of the paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than an existing strategy that uses the anchor cell in the location area.

• Journal of Aerospace System Engineering
• /
• v.10 no.1
• /
• pp.8-14
• /
• 2016

The optimal estimation of a bearing only target tracking problem be achieved through the solution of the Fokker-Planck equation and the Bayesian update. Recently, a nonlinear filtering algorithm using a direct quadrature method of moments in which the associated Fokker-Planck equation can be propagated efficiently and accurately was proposed. Although this approach has demonstrated its promising in the field of nonlinear filtering in several examples, the "degeneracy" phenomenon, similar to that which exists in a typical particle filter, occasionally appears because only the weights are updated in the modified Bayesian rule in this algorithm. Therefore, in this paper to enhance the performance, a more stable measurement update process based upon the update equation in the Extended Kalman filters and a more accurate initialization and re-sampling strategy for weight and abscissas are proposed. Simulations are used to show the effectiveness of the proposed filter and the obtained results are promising.

• The Journal of Information Technology and Database
• /
• v.3 no.1
• /
• pp.3-24
• /
• 1996

Databases are critical to business information systems, and RDBMS is most widely used for the database system. Normalization has been designed to control various anomalies(insert, update, and delete anomalies). However, normalized database design does not account for the tradeoffs necessary for the performance. In this research, we develop a model for database design by denormalization of duplicating attributes in order to reduce frequent join processes. In this mood, we consider insert, update, delete, and query costs. The anomaly and data inconsistency are removed by additional disk I/O which is necessary for each update and insert transaction. We propose a branch and bound method for this model, and show considerable cost reduction.

• Journal of Industrial Technology
• /
• v.27 no.A
• /
• pp.141-147
• /
• 2007

In this paper, we define the multi-states exponential cell resident time mobility model for describing the mobility characteristics of mobile user and analyzed the total cost of the hybrid method using multi-states cell resident time. Generally, the mobile user has three states for its movement, such as staying, walking and driving. This multi-states cell resident time based hybrid method reflects the movement characteristics of mobile user and adapts the location update period according to the states of mobility speed. As a results of the performance analysis, we can get the optimum parameters of the hybrid method for multi-states based mobile users.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.27-36
• /
• 2004

Frequent occurrence of binding update messages may incur high overhead in Mobile IP supporting users mobility. Thus, it needs to develop algorithms to deal with the situation. In this paper, we propose new lifetime assignment schemes for dynamic binding update considering the locality property related with mobile node's movement. Each mobile node maintains a profile which is based on log containing useful information about its visiting subnets. That is, it determines dynamic binding update lifetime for currently visiting subnet by computing past mean resident time recorded in the profile. In addition, we note that the resident time depends on the time when each node enters a subnet and thus, we devise another lifetime assignment algorithm. Extensive experiments are made to compare our schemes with existing Mobile IPv6 where major facts for performance comparison are both the number of binding update messages and the number of binding request messages. From the results, we come to know that our schemes obtain highly considerable performance improvements in terms of communication cost by decreasing the number of those messages.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.505-515
• /
• 2004

One of the most important issue in location-aware computing is tracking moving objects efficiently. To this end, an efficient protocol which updates location information in a location server is highly needed. In fact, the performance of a location update strategy highly depends on the assumed mobility pattern. In most existing works, however, the mobility issue has been disregarded and too simplified as linear function of time. In this paper, we propose a new mobility model, called state-based mobility model (SMM) to provide more generalized framework for both describing the mobility and updating location information of complexly moving objects. We also introduce the state-based location update protocol (SLUP) based on this mobility model. Using experimental comparison, we illustrate that the proposed technique is many times better in reducing location update cost and the communication bandwidth consumption.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.159-159
• /
• 2004

With the increasing number of subscribers in the mobile communication, the reduction of the cell size and the increment of roaming frequency have increased the cost of location management. In order to reduce the cost of location management, we propose a new strategy of location management. In this scheme, whether the terminal executes location update or not is decided both by the call arrival probability in a new LA and by the number of location updates which are unexecuted despite that the terminal moved into a new LA. The call arrival probability is computed using the predicted information about the terminal mobility pattern. We simulated to evaluate our strategy's performance. In the high mobility prediction level, this scheme reduces the cost of location update considerably. Even though it is in the low mobility prediction level, the cost does not exceed that of IS-41 at most. This scheme also showed better performance, compared with that of AS(Alternative Strategy) which requires an overhead such as predicted information maintenance.