Multiple Heuristics and Their Combination for Automatic WordNet Mapping

This paper presents an automatic construction of Korean WordNet from pre-existing lexical resources. We develop a set of automatic word sense disambiguation techniques to link a Korean word sense collected from a bilingual machine-readable dictionary to a single corresponding English WordNet synset. We show how individual links provided by each word sense disambiguation method can be non-linearly combined to produce a Korean WordNet from existing English WordNet for nouns.     

Maintaining mobile transactional consistency in hybrid broadcast environments

Recently there have been attempts in several research areas at efficiently utilizing the resources of mobile computers. Considering the properties in mobile computing environments, push-based data dissemination systems have lately attracted considerable attention. However, skewed access patterns among mobile clients makes response time worse, and they prefer to send data requests to the server explicitly through an uplink channel. A broadcast supporting an uplink channel is called a hybrid broadcast. In this paper, we devise new transaction processing algorithms for hybrid broadcasts. It is assumed that data objects that the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand service. That is, clients have to explicitly request data objects in Pull_Data. Maintaining transactional consistency in this environment without much additional cost is our main concern. Finally, we evaluate performance behavior through simulation study.Received: 15 November 2002, Published online: 5 August 2004This work was done as part of the Information & Communication Fundamental Technology Research Program, supported by the Ministry of Information & Communication in the Republic of Korea.     

Discovery of fuzzy temporal association rules

We propose a data mining system for discovering interesting temporal patterns from large databases. The mined patterns are expressed in fuzzy temporal association rules which satisfy the temporal requirements specified by the user. Temporal requirements specified by human beings tend to be ill-defined or uncertain. To deal with this kind of uncertainty, a fuzzy calendar algebra is developed to allow users to describe desired temporal requirements in fuzzy calendars easily and naturally. Fuzzy operations are provided and users can define complicated fuzzy calendars to discover the knowledge in the time intervals that are of interest to them. A border-based mining algorithm is proposed to find association rules incrementally. By keeping useful information of the database in a border, candidate itemsets can be computed in an efficient way. Updating of the discovered knowledge due to addition and deletion of transactions can also be done efficiently. The kept information can be used to help save the work of counting and unnecessary scans over the updated database can be avoided. Simulation results show the effectiveness of the proposed system. A performance comparison with other systems is also given.     

Scene-adaptive transform domain video partitioning

An adaptive mechanism for video partitioning in the transform domain is proposed. Different quantitative measures for motion complexity and activity levels in a scene are defined, based on which a video scene can be consistently categorised into identifiable classes. Further, the video quality, as measured by the mean square error (MSE) is related to certain parameters used in video partitioning. Adaptability is realized by tailoring the parameters of the video partitioning algorithm to the specific characteristics of the video scene, as embodied in the video scene class and the video quality. Experimental results are included.     

Optimizing real-time equational rule-based systems

Analyzing and reducing the execution-time upper bound of real-time rule-based expert systems is a very important task because of the stringent timing constraints imposed on this class of systems. We present a new runtime optimization to reduce the execution-time upper bound of real-time rule-based expert systems. In order to determine rules to be evaluated at runtime, a predicate dependency list, which consists of a predicate, its active rule set and corresponding inactive rule set, is created for each predicate in a real-time rule-based program. Based on the predicate dependency list and the current value of each variable, the new runtime optimization dynamically selects rules to be evaluated at runtime. For the timing analysis of the proposed algorithm, we introduce a predicate-based rule dependency graph, a predicate-based enable-rule graph, and their construction algorithm. We also discuss the bounded time of the equational logic rule-based program using the predicate-based rule dependency graph as well as the predicate-based enable-rule graph. The implementation and performance evaluation of the proposed algorithm using both synthetic and practical real-time rule-base programs are also presented. The performance evaluation shows that the runtime optimizer reduces the number of rule evaluations and predicate evaluations as well as the response time upper bound significantly, and the new algorithm yields better execution-time upper bound compared to other optimization methods.     

Concept mapping your Web searches: a design rationale and Web-enabled application

Although it has become very common to use World Wide Web‐based information in many educational settings, there has been little research on how to better search and organize Web‐based information. This paper discusses the shortcomings of Web search engines and Web browsers as learning environments and describes an alternative Web search environment that combines a concept mapping and a data mining technique to address their drawbacks.     

Image database design based on 9D-SPA representation for spatial relations

Spatial relationships between objects are important features for designing a content-based image retrieval system. We propose a new scheme, called 9D-SPA representation, for encoding the spatial relations in an image. With this representation, important functions of intelligent image database systems such as visualization, browsing, spatial reasoning, iconic indexing, and similarity retrieval can be easily achieved. The capability of discriminating images based on 9D-SPA representation is much more powerful than any spatial representation method based on minimum bounding rectangles or centroids of objects. The similarity measures using 9D-SPA representation provide a wide range of fuzzy matching capability in similarity retrieval to meet different user's requirements. Experimental results showed that our system is very effective in terms of recall and precision. In addition, the 9D-SPA representation can be incorporated into a two-level index structure to help reduce the search space of each query processing. The experimental results also demonstrated that, on average, only 0.1254 percent /spl sim/ 1.6829 percent of symbolic pictures (depending on various degrees of similarity) were accessed per query in an image database containing 50,000 symbolic pictures.     

Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems

The CDMA/TDD system is a highly attractive solution to support the next generation cellular mobile systems which provide unbalanced multimedia services between downlink and uplink. In this paper, we analyze the interference for downlink and uplink timeslots in a multicell CDMA/TDD system. We also mathematically formulate an optimal timeslot and channel allocation problem considering capacity fairness among cells, which is to maximize the system capacity under the given traffic unbalance, and propose an efficient algorithm based on the simulated annealing technique. Extensive experimental results show that the proposed scheme yields a good performance, and fairness among cells improves with a decrease in the system capacity.     

Electrostatic actuation of three-dimensional MEMS mirrors using sidewall electrodes

We propose and demonstrate electrostatic sidewall-electrodes actuation of three-dimensional (3-D) microelectromechanical systems (MEMS) gimbal mirrors. The linearity of the mirror angle dependence on actuation voltage is improved with the sidewall-electrodes actuation. In addition, the undesired spring-softening effect commonly found in electrostatic actuation, where the mirror resonance frequency decreases with increased tilt angle, is significantly reduced. Sidewall actuation enables superior performance of 3-D MEMS mirrors including large pull-in angles, reduced actuation voltages, improved device reliability, and fast switching times.     

Optimal common-mode voltage reduction PWM technique for inverter control with consideration of the dead-time effects-part II: applications to IM drives with diode front end

The main theme of this paper is to demonstrate the applications of the newly developed common-mode voltage reduction pulsewidth-modulation (PWM) technique, which restricts the common-mode voltage to one-third of DC-link voltage, to vector-controlled induction motor drives. As compared to previous common-mode voltage reduction techniques, the presented technique can be applied to the inverter with diode front end and has no adverse effect on the linear modulation range. Therefore, vector-controlled drives using the developed technique for inverter control have a wide speed range. Moreover, the effects of the common-mode voltage reduction PWM technique on speed response for vector-controlled induction motor drives will be fully investigated in this paper. It will be demonstrated by intensive experimental results that speed performance does not deteriorate significantly within the rated speed range.