A graph-based approach for rule integrity and maintainability in expert system maintenance

Just as conventional software systems have maintenance costs far exceeding development costs, so too do rule-based expert systems. They are frequently developed by an incremental and iterative method, where knowledge and decision rules are extracted and added to the system in a piecemeal manner throughout system evolution. Thus, ensuring the correctness and consistency of the rule base (RB) becomes an important, though challenging task. However, most research work in expert systems has focused on building and validating rule bases, leaving the maintenance issue unexplored. We propose a graph-based approach, called the object classification model (OCM), as a methodology for RB maintenance. An experiment was conducted to compare the OCM with traditional RB maintenance methods. The results show that the OCM helps knowledge engineers retain rule-base integrity and, thus, increase rule-base maintainability.     

Composition pattern oriented tag extraction from short documents using a structural learning method

With the rapid growth of web, automatic tagging that detects informative terms from a document becomes an important problem for information aggregation and sharing services. In particular, automatic tagging for short documents becomes more interesting as many users are increasingly publishing information through social media services which encourage users to create the documents of short length. In this paper, we propose a novel automatic tagging model for short text documents from social media services, following the framework of supervised learning. We redefine traditional frequency-based term features so that they can address the properties of the documents created under length limitation and consider sequential dependencies between successive terms in a document based on a structural support vector machine. In addition, our proposed approach incorporates composition patterns by which users put informative terms into their documents. Extensive experiments have been conducted to validate the presented approach, and it was found that the proposed term features were effective for extracting tags, and the tag extractor trained by considering the sequential dependencies and composition patterns achieved superior performance results over the existing alternative methods.     

Assessment of the MODIS LAI product for Australian ecosystems

The leaf area index (LAI) product from the Moderate Resolution Imaging Spectroradiometer (MODIS) is important for monitoring and modelling global change and terrestrial dynamics at many scales. The algorithm relies on spectral reflectances and a six biome land cover classification. Evaluation of the specific behaviour and performance of the product for regions of the globe such as Australia are needed to assist with product refinement and validation. We made an assessment of Collection 4 of the MODIS LAI product using four approaches: (a) assessment against a continental scale Structural Classification of Australian Vegetation (SCAV); (b) assessment against a continental scale land use classification (LUC); (c) assessment against historical field-based measurement of LAI collected prior to the Terra Mission; and (d) direct comparison of MODIS LAI with coincident field measurements of LAI, mostly from hemispherical photography. The MODIS LAI product produced a wide variety of geographically and structurally specific temporal response profiles between different classes and even for sub-groups within classes of the SCAV. Historical and concurrent field measurements indicated that MODIS LAI was giving reasonable estimates for LAI for most cover types and land use types, but that major overestimation of LAI occurs in some eastern Australian open forests and woodlands. The six biome structural land cover classification showed some significant deviations in class allocation compared to the SCAV particularly where grasslands are allocated to shrubland, savanna woodlands are allocated to shrubland, savanna and broadleaf forest, and open forests are allocated to savanna and broadleaf forest. The land cover and LAI products could benefit from some additional examination of Australian data addressing the structural representation of Eucalypt canopies in the “space of canopy realisation” for savanna and broadleaf forest classes.     

An agent architecture for strategy-centric adaptive QoS control in flexible videoconference system

In this paper, we propose an agent architecture to improve flexibility of a videoconference system with strategy-centric adaptive QoS (Quality of Service) control mechanism. The proposed architecture realizes more flexibility by changing their QoS control strategies dynamically. To switch the strategies, system considers the properties of problems occurred on QoS and status of problem solving process. This architecture is introduced as a part of knowledge base of agent that deals with cooperation between software module of videoconference systems. We have implemented the mechanism, and our prototype system shows its capability of flexible problem solving against the QoS degradation, along with other possible problems within the given time limitation. Thus we confirmed that the proposed architecture can improve its flexibility of a videoconference system compared to traditional systems. Takuo Suganuma, Dr.Eng.: He is a research associate of Research Institute of Electrical Communication of Tohoku University. He received a Dr.Eng. degree from Chiba Institute of Technology in 1997. His research interests include agent-based computing and design methodology for distributed systems. He is a member of IPSJ, IEICE and IEEE. SungDoke Lee: He is a Ph.D. Student in the Graduate School of Information Sciences in Tohoku University. He received his MEng degree at Chonbuk National University, Korea in 1991. His research interests include Flexible Network and Knowledge of Agent. Tetsuo Kinoshita, Dr.Eng.: He is an associate professor of Research Institute of Electrical Communication of Tohoku University. He received a Dr.Eng. degree in information engineering from Tohoku University, Japan. His research interests include knowledge engineering, cooperative distributed processing and agent-based computing. He received the the IPSJ Best Paper Award in 1997, etc. He is a member of IPSJ, IEICE, JSAI, AAAI, ACM and IEEE. Norio Shiratori, Dr.Eng.: After receiving his Dr.Eng degree at Tohoku University, he joined the Research Institute of Electrical Communication of Tohoku University in 1977, and is now a professor at the same University. He has been engaged in research on distributed processing system, and flexible intelligent network. He received the 25th Anniversary of IPSJ Memorial Prize-Winning Paper Award in 1985, the 6th Telecommunications Advancement Foundation Incorporation Award in 1991, the Best Paper Award of ICOIN-9 in 1994, the IPSJ Best Paper Award in 1997, etc. He has been named a Fellow of the IEEE for his contributions to the field of computer communication networks.     

Long-term stealth navigation in a security zone where the movement of the invader is monitored

This paper deals with the security robot motion planning in order to stealthily approach the backside of the invader based on an active prediction planning execution (APPE) strategy. The stealth navigation is needed in the security system because the invader will try to run away from the robot when it detects the robot. We propose an algorithm for making the robot to approach the invader stealthily within a desired range. We predict the long-term motion of the invader and plan the security robot motion by using detection map. It represents the region that the robot can move stealthily on a certain path. The robot motion can be separately planned as a geometric path and a speed profile using detection map. The path is planned on the predetermined roadmap. The speed profile is planned so that the robot is not detected by the invader. The simulation results demonstrate that our algorithm is efficient for shortening the distance between the robot and the invader when the invader first detects the robot. Our algorithm is compared with the case that does not consider the stealth condition of the robot and the grid-based method.     

A lane-departure identification based on LBPE, Hough transform, and linear regression

This paper presents a lane-departure identification (LDI) system of a traveling vehicle on a structured road with lane marks. As is the case with modified version of the previous EDF-based LDI approach [J.W. Lee, A machine vision system for lane-departure detection, CVIU 86 (2002) 52–78], the new system increases the number of lane-related parameters and introduces departure ratios to determine the instant of lane departure and a linear regression (LR) to minimize wrong decisions due to noise effects. To enhance the robustness of LDI, we conceive of a lane boundary pixel extractor (LBPE) capable of extracting pixels expected to be on lane boundaries. Then, the Hough transform utilizes the pixels from the LBPE to provide the lane-related parameters such as an orientation and a location parameter. The fundamental idea of the proposed LDI is based on an observation that the ratios of orientations and location parameters of left- and right-lane boundaries are equal to one as far as the optical axis of a camera mounted on a vehicle is coincident with the center of lane. The ratios enable the lane-related parameters and the symmetrical property of both lane boundaries to be connected. In addition, the LR of the lane-related parameters of a series of successive images plays the role of determining the trend of a vehicle’s traveling direction and the error of the LR is used to avoid a wrong LDI. We show the efficiency of the proposed LDI system with some real images.     

A novel optimization-based bandwidth-aware minimum power multicast routing algorithm in green wireless networks

Multicast routing in wireless networks that possess the wireless multicast advantage could significantly reduce the power and energy consumption. However, this kind of multicast routing that only addresses the transmission radius coverage might not be able to meet the bandwidth requirement of the users. As a result, additional transmissions are required to incur more energy consumption and carbon dioxide emissions that make existing algorithms not applicable to bandwidth constrained applications. In this paper, for the first time, we address the bandwidth aware minimum power multicast routing problem in wireless networks where the objective function is to minimize the total power consumption subject to the users?? bandwidth requirements. This problem is a challenging cross-layer design problem that requires seamless and sophisticated integrated design in the network layer (multicast routing) and physical layer (bandwidth-aware wireless transmission and power control). We first formulate this problem as a mixed integer linear programming problem and then propose a Lagrangian relaxation based algorithm to solve this problem. Numerical results demonstrate that the proposed approach is a sound green networking algorithm that outperforms the existing power efficient multicast routing approaches under all tested cases, especially in large bandwidth request, fine radius granularity, large group size and sparse network.     

Static analysis of JavaScript libraries in a scalable and precise way using loop sensitivity

Statically analyzing JavaScript applications often requires an analysis of JavaScript libraries because many JavaScript applications use libraries. However, static analysis techniques for JavaScript are not yet ready for analyzing libraries in a scalable and precise manner. Simply loading JavaScript libraries uses various dynamic features of JavaScript, which cause static analyzers to suffer from mutually intermingled problems of scalability and imprecision. In this paper, we present a loop‐sensitive analysis (LSA) technique, which can improve the analysis scalability when analyzing JavaScript libraries by enhancing the analysis precision of loops. The LSA technique distinguishes loop iterations when loop conditions can be determined to be either true or false precisely. We formalize LSA in the abstract interpretation framework in the presence of tricky language features such as exceptions and prove its soundness and precision theorems using Coq. We evaluate our LSA implementation with the analysis results of programs that use 5 JavaScript libraries and show that LSA significantly improves the analysis scalability and precision of an existing JavaScript static analyzer when analyzing JavaScript libraries. In addition, using the configurability of LSA, we experimentally show the correlation between scalability and precision in the analysis of JavaScript libraries. We found that even the analysis of simple programs that just load jQuery, which is the most popular JavaScript library, in a scalable way requires distinguishing not only the last 4 functions being called but also 40 iterations in each loop with 2‐level nested loops at least. Both the mechanization and implementation of LSA are publicly available.     

Map segmentation for geospatial data mining through generalized higher-order Voronoi diagrams with sequential scan algorithms

Segmentation is one popular method for geospatial data mining. We propose efficient and effective sequential-scan algorithms for higher-order Voronoi diagram districting. We extend the distance transform algorithm to include complex primitives (point, line, and area), Minkowski metrics, different weights and obstacles for higher-order Voronoi diagrams. The algorithm implementation is explained along with efficiencies and error. Finally, a case study based on trade area modeling is described to demonstrate the advantages of our proposed algorithms.