• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2357-2364
• /
• 2008

In this paper, we consider the problem of exploiting a taxonomy of propositionalized attributes in order to generate compact and robust classifiers. We introduce Propositionalized Attribute Taxonomy guided Naive Bayes Learner (PAT-NBL), an inductive learning algorithm that exploits a taxonomy of propositionalized attributes as prior knowledge to generate compact and accurate classifiers. PAT-NBL uses top-down and bottom-up search to find a locally optimal cut that corresponds to the instance space from propositionalized attribute taxonomy and data. Our experimental results on University of California-Irvine (UCI) repository data set, show that the proposed algorithm can generate a classifier that is sometimes comparably compact and accurate to those produced by standard Naive Bayes learners.

• The Bulletin of The Korean Astronomical Society
• /
• v.36 no.2
• /
• pp.108.2-108.2
• /
• 2011

We investigate decaying magnetohydrodynamic (MHD) turbulence by including the effects of expansion and collapse of the background medium. The problem has two time scales, the eddy turn-over time($t_{eddy}$) and the expansion/collapse time scale(${\tau}_H$). The turbulence is expected to behave differently in two regimes of $t_{eddy}$ < ${\tau}_H$ and $t_{eddy}$ > ${\tau}_H$. For instance, for $t_{eddy}$ < ${\tau}_H$, the turbulence would decay more or less as in a static medium. On the other hand, for $t_{eddy}$ > ${\tau}_H$, the effects of expansion and collapse would be dominant. We examine the properties of turbulence in the regimes of $t_{eddy}$ < ${\tau}_H$ and $t_{eddy}$ > ${\tau}_H$. Based on it, we derive a scaling for the time evolution of flow velocity and magnetic field.

• Journal of the Korean Geographical Society
• /
• v.30 no.2
• /
• pp.120-131
• /
• 1995

To analyze mobility patterns, this study used three Constraint (Capability Constraint, Coupling Constraint, Authority Constraint) models which were proposed in Dr. Hagerstrand's Time-space theory. This paper shows that three constraint models have some effects upon mobility by age. In this study, Capability Constraint means a certain special constraint that is what we can't do during proceeding basic natural urges like sleep, fare, etc. Coupling constraint is a physical one. Each person limits the action range for staying on a special place in special time. For instance, students have to stay in school so that they have mobility constraints. Authority Constraint is a social one. When we use urban facilities or traffic, we may be controlled by mobility sphere by an agreement or a social position. It is social agreement that the opening hour of a store, the time table of mass-transportation and a social positional control that the personal income, the standard of education. In this study it has been in a process of determination of the cluster number that degree of influences a social constraint to mobility. Considering the mobility constraint of characteristics of space divides urban and rural, people in urban area have higher mobility rate than in rural area. Resuets of determination of the cluster, show similar mobility pattern. People in urban area are connected verity of mobility which related to urban space structures with determination of cluste-number. That is to say, mobility patterns can be changed by space charactcristics. Constraints by sex and age are also social constraints and they are influenced by mobility patterns. For instance, females at the age of twenties have similar mobility pattern to the same age male but they have sudden changes after thirty's age. Male entertains a similar pattern without restriction of age. That is to say, management by sex as a social constraint affects mobility. To establish more realistic traffie policy, mobility formation should be reflected to the space in a view of social-behavioral science. To embody this, some problems should be investigated as follows. 1. As a problem of methodology, if sufficient samples ensured, we could subdivide clusters and could open up a new method of analyzing the mobility clusters by using the neuro-network. 2. Extracting actions connected with mobility and finding life cycle which is classified by daily cluste-characteristics, suitable counterproposal could be presented to the traific policy.

• The Korean Journal of Air & Space Law and Policy
• /
• v.6
• /
• pp.137-147
• /
• 1994

Clearly there are many legal arguments and criticisms surrounding the proposals for change in the Warsaw Convention and the need for a radical review. The question remains is unlimited liability the answer or should there be some other form of supplemental compensation and if so, what limits should be applicable. It does seem that the adopted limits of the Convention are seen by many as the first line of defence, which, dependent on political and cultural differences, the legal interpretation of contractual wording and the legal system globally have resulted in enormous differences in compensation paid whether or not the Convention limits were imposed. An example of this is in the United States, which highlights the significance of the problem in that domestic travellers without Convention Limits can, through the American legal system, obtain compensation in the multi-million dollar area for a death claim, whereas a passenger t1ying internationally would in the first instance be subject to Convention Limits. expensive legal action through litigation. To date, we can advise that insurers have not charged additional premium for unlimited liability coverage. Insurance rates as we have stated are hardening considerably. To date, average rate increases have been plus 56% for aircraft hull and plus 45% for liabilities. Insurers last year suffered global losses of around US $ 1.1 Billion against a premium income of US $ 800,000. The target premium income for 1993 is believed to be in the region of US $1.4 Billion.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.350-355
• /
• 1997

The problem of mathematical model for an unknown system by measureing its input-output data pairs is generally referred to as state estimates. The state estimation problem is often of importance in its own right since we may want to know the value of the states. For instance, in navigation, we may take noisy positional fixes using satelite or radar navigation, and the estimator can use these measurements to provide accurate estimates of current position, hedaing, and velocity. And the state estimates can also be used for control purposes. Then it is very important to know the state of plant. In this paper, the theory of the minimization of a loss function was used to design the fuzzy system. Here, the used teory is Least Square Esimation method. This parametrization has the Linear in the parameters charcteristic that allows standard parameter estimation technique to be used to estimate the parameters of the fuzzy system. The combination of the fuzzy system and the estimation m thod then performs as a nonlinear estimator. If several fuzzy label are defined for the input variables at the antecedent part, the fuzzy system then behaves as a collection of nonlinear estimators where different regions of rules have different parameters. In simulation results, the fuzzy model controlled a difference in the structure between the actual plant and the fuzzy estimator. It is also proved that the fuzzy system is equivalent to its transformed system. therefore we was able to get the state space equation of system with the estimated paramater.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.2
• /
• pp.13-21
• /
• 1996

The necessity and usefulness of higher-order neural networks have been well-known since early days of neurocomputing. However the explosive number of terms has hampered the design and training of such networks. In this paper we present an evolutionary learning method for efficiently constructing problem-specific higher-order neural models. The crux of the method is the neural tree representation employing both sigma and pi units, in combination with the use of an MDL-based fitness function for learning minimal models. We provide experimental results in classification and prediction problems which demonstrate the effectiveness of the method. I. Introduction topology employs one hidden layer with full connectivity between neighboring layers. This structure has One of the most popular neural network models been very successful for many applications. However, used for supervised learning applications has been the they have some weaknesses. For instance, the fully mutilayer feedforward network. A commonly adopted connected structure is not necessarily a good topology unless the task contains a good predictor for the full *d*dWs %BH%W* input space.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2732-2753
• /
• 2019

With the application of wireless sensor networks in the fields of ecological observation, defense military, architecture and urban management etc., the security problem is becoming more and more serious. Characteristics and constraint conditions of wireless sensor networks such as computing power, storage space and battery have brought huge challenges to protection research. Inspired by the danger theory in biological immune system, this paper proposes an intrusion detection model for wireless sensor networks. The model abstracts expressions of antigens and antibodies in wireless sensor networks, defines meanings and functions of danger signals and danger areas, and expounds the process of intrusion detection based on the danger theory. The model realizes the distributed deployment, and there is no need to arrange an instance at each sensor node. In addition, sensor nodes trigger danger signals according to their own environmental information, and do not need to communicate with other nodes, which saves resources. When danger is perceived, the model acquires the global knowledge through node cooperation, and can perform more accurate real-time intrusion detection. In this paper, the performance of the model is analyzed including complexity and efficiency, and experimental results show that the model has good detection performance and reduces energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.169-179
• /
• 2009

Communication log data consist of communication events such as sending and receiving e-mail or instance message and visiting web sites, etc. Many countries including USA and EU enforce the retention of these data on the communication service providers for the purpose of investigating or detecting criminals through the Internet. Because size of the retained data is very large, the efficient method for extracting valuable information from the data is needed for Law Enforcement Authorities to use the retained data. This paper defines the Interactive Communication Sequence Patterns(ICSPs) that is the important information when each communication event in communication log data consists of sender, receiver, and timestamp of this event. We also define a Mining(FDICSP) problem to discover such patterns and propose a method called Fast Discovering Interactive Communication Sequence Pattern(FDICSP) to solve this problem. FDICSP focuses on the characteristics of ICS to reduce the search space when it finds longer sequences by using shorter sequences. Thus, FDICSP can find Interactive Communication Sequence Patterns efficiently.

• International Journal of Aeronautical and Space Sciences
• /
• v.8 no.1
• /
• pp.10-20
• /
• 2007

For spacecraft attitude control, reaction wheel (RW) steering laws with more than three wheels for three-axis attitude control can be derived by using a control allocation (CA) approach.1-2 The CA technique deals with a problem of distributing a given control demand to available sets of actuators.3-4 There are many references for CA with applications to aerospace systems. For spacecraft, the control torque command for three body-fixed reference frames can be constructed by a combination of multiple wheels, usually four-wheel pyramid sets. Multi-wheel configurations can be exploited to satisfy a body-axis control torque requirement while satisfying objectives such as minimum control energy.1-2 In general, the reaction wheel steering laws determine required torque command for each wheel in the form of matrix pseudo-inverse. In general, the attitude control command is generated in the form of a feedback control. The spacecraft body angular rate measured by gyros is used to estimate angular displacement also.⁵ Combination of the body angular rate and attitude parameters such as quaternion and MRPs(Modified Rodrigues Parameters) is typically used in synthesizing the control command which should be produced by RWs.¹ The attitude sensor signals are usually corrupted by noise; gyros tend to contain errors such as drift and random noise. The attitude determination system can estimate such errors, and provide best true signals for feedback control.⁶ Even if the attitude determination system, for instance, sophisticated algorithm such as the EKF(Extended Kalman Filter) algorithm⁶, can eliminate the errors efficiently, it is quite probable that the control command still contains noise sources. The noise and/or other high frequency components in the control command would cause the wheel speed to change in an undesirable manner. The closed-loop system, governed by the feedback control law, is also directly affected by the noise due to imperfect sensor characteristics. The noise components in the sensor signal should be mitigated so that the control command is isolated from the noise effect. This can be done by adding a filter to the sensor output or preventing rapid change in the control command. Dynamic control allocation(DCA), recently studied by Härkegård, is to distribute the control command in the sense of dynamics⁴: the allocation is made over a certain time interval, not a fixed time instant. The dynamic behavior of the control command is taken into account in the course of distributing the control command. Not only the control command requirement, but also variation of the control command over a sampling interval is included in the performance criterion to be optimized. The result is a control command in the form of a finite difference equation over the given time interval.⁴ It results in a filter dynamics by taking the previous control command into account for the synthesis of current control command. Stability of the proposed dynamic control allocation (CA) approach was proved to ensure the control command is bounded at the steady-state. In this study, we extended the results presented in Ref. 4 by adding a two-step dynamic CA term in deriving the control allocation law. Also, the strict equality constraint, between the virtual and actual control inputs, is relaxed in order to construct control command with a smooth profile. The proposed DCA technique is applied to a spacecraft attitude control problem. The sensor noise and/or irregular signals, which are existent in most of spacecraft attitude sensors, can be handled effectively by the proposed approach.