434 research outputs found
Knowledge-based information systems in practice
No full textThis book contains innovative research from leading researchers who presented their work at the 17th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2013, held in Kitakyusha, Japan, in September 2013. The conference provided a competitive field of 236 contributors, from which 38 authors expanded their contributions and only 21 published. A plethora of techniques and innovative applications are represented within this volume. The chapters are organized using four themes. These topics include: data mining, knowledge management, advanced information processes and system modelling applications. Each topic contains multiple contributions and many offer case studies or innovative examples. Anyone that wants to work with information repositories or process knowledge should consider reading one or more chapters focused on their technique of choice. They may also benefit from reading other chapters to assess if an alternative technique represents a more suitable approach. This book will benefit anyone already working with Knowledge-Based or Intelligent Information Systems, however is suitable for students and researchers seeking to learn more about modern Artificial Intelligence techniques
A decision table method for randomness measurement
No full textData quality has become a major concern for organisations. The rapid growth in the size and technology of a databases and data warehouses has brought significant advantages in accessing, storing, and retrieving information. At the same time, great challenges arise with rapid data throughput and heterogeneous accesses in terms of maintaining high data quality. Yet, despite the importance of data quality, literature has usually condensed data quality into detecting and correcting poor data such as outliers, incomplete or inaccurate values. As a result, organisations are unable to efficiently and effectively assess data quality. Having an accurate and proper data quality assessment method will enable users to benchmark their systems and monitor their improvement. This paper introduces a granules mining for measuring the random degree of error data which will enable decision makers to conduct accurate quality assessment and allocate the most severe data, thereby providing an accurate estimation of human and financial resources for conducting quality improvement tasks. \u
Temporal Perspective for the Software Testing Decision Support Framework
No full textThe development of the Decision Support Framework (DSF) for software testing provides a solid basis for assisting the software test manager in assessing the risk of achieving successful software testing. To further enhance the DSF, the DSF has been expanded beyond its static and dynamic analysis perspectives. It has been observed that any activity or process has some type of inherent temporal perspective. Thus the adding of a temporal perspective to the DSF static and dynamic analysis perspectives is a step forward. The temporal information is derived and integrated utilizing the test manager's experience and his/her software test plan. This provides an additional analysis on successful software testing and the consequences of influences that affect software testing. An explanation of why the framework needs a time perspective and other associated changes is provided. The details of the temporal perspective and the other relevant changes to the framework are described. The total decision support framework, with an integrated temporal perspective, is presented and discussed. © Springer-Verlag Berlin Heidelberg 2012
Computable analysis of linear rearrangement optimization
No full textOptimization problems over rearrangement classes arise in various areas such as mathematics, fluid mechanics, biology, and finance. When the generator of the rearrangement class is two-valued, they reduce to shape optimization and free boundary problems which can exhibit intriguing symmetry breaking phenomena. A robust framework is required for computable analysis of these problems. In this paper, as a first step towards such a robust framework, we provide oracle Turing machines that compute the distribution function, decreasing rearrangement, and linear rearrangement optimizers, with respect to functions that are continuous and have no significant flat zones. This assumption on the reference function is necessary, as otherwise, the aforementioned operations may not be computable. We prove that the results can be computed to within any degree of accuracy, conforming to the framework of Type-II Theory of Effectivity
Mass Transfer with Simultaneous Chemical Reaction in Drops for Liquid-Liquid Systems
No full textTitle: Mass Transfer with Simultaneous Chemical Reactions in Drops fir Liquid-Liquid Systems, Author: Hideki Watada, Location: ThodeThis dissertation is divided into three major self-contained
sections. The first one contains a review of previous work in the
field of mass transfer in drops for liquid-liquid systems. The second section outlines the numerical solutions of the
continuity equation for for forced convection with simultaneous chemical
reaction in the dispersed phase. The solutions are compared with those
predicted by existing theoretical models for mass transfer in the
dispersed phase. The third section describes the experimental equipment and
method of operation. Physical mass transfer in drops is studied
initially. This established a basis for evaluation the effect of
chemical reaction on the rate of mass transfer in a later study. The results from these experimental studies are used to test the ability
of existing models to predict mass transfer with simultaneous chemical
reaction in drops.ThesisDoctor of Philosophy (PhD
Convergence of meta-controlled Boltzmann machine and its application for bilevel programming problem
No full textInternational Conference on Man Machine Systems (ICoMMS 2012) organized by School of Mechatronic Engineering, co-organized by The Institute of Engineer, Malaysia (IEM) and Society of Engineering Education Malaysia, 27th - 28th February 2012 at Bayview Beach Resort, Penang, Malaysia.In this paper, meta controlled Boltzmann machine; the double-layered Boltzmann machine consisting of upper (Hopfield network) and lower (Boltzmann network) layers, is efficiently applied to solve mean-variance problem using mathematical programming with two objectives: the minimization of risk and the maximization of expected return. It is demonstrated that the proposed structural learning method has various advantages in a way such as an investment for a power system. As a result, it was shown that the structural learning can provide an alternative solution for decision makers to select the best solution from their respective point of view, as a numerical example shows. The simulation also showed that computational cost is significantly decreased compared with a conventional BM. The obtained results showed that the selection, investment expense rate to substations, and reduced computation time can be prolonged to increase cost savings
Taxonomic study of the Drosophila auraria species complex (Diptera: Drosophilidae) with description of a new species
No full textThe Drosophila auraria species complex, especially from the Ryukyu archipelago and Taiwan, was reviewed. A new species, D. neoasahinai Watada and Kondo, sp. nov., was described from Okinawa-jima and surrounding islands. Two synonymies were proposed on the basis of the present and previous morphological comparisons and cross experiments; D. yuwanensis Kim and Okada, 1988, as a junior synonym of D. asahinai Okada, 1964, and D. quadraria Bock and Wheeler, 1972, as a junior synonym of D. triauraria Bock and Wheeler, 1972. A laboratory stock (no. 14020-0011.01) maintained in the Drosophila Species Stock Center at the University of California, San Diego and so far designated as D. rufa Kikkawa and Peng, 1938, was identified as D. tani Cheng and Okada, 1985, based on morphology
Improving the efficiency of robot task planning by automatically integrating its planner and common-sense knowledge base
No full textThis chapter presents a newly developed approach for intelligently generating symbolic plans for mobile robots acting in domestic environments, such as offices and houses. The significance of this approach lies in its novel framework which consists of new modelling of high-level robot actions and their integration with common-sense knowledge in order to support robotic task planner. This framework will enable direct interactions between the task planner and the semantic knowledge base. By using common-sense domain knowledge, the task planner will take into consideration the properties and relations of objects and places in its environment, before creating semantically related actions that will represent a plan. A new module has been appended to the framework which is called Semantic Realization and Refreshment Module (SRRM). This module has the ability to discover and select entities in the robot’s world (entities related to robot plan) which are semantically equivalent or have a degree of similarity (where they don’t exceed a predefined threshold) by using techniques and standards (metrics) for similarities. SRRM supports robotic task planning to generate approximate plans to solve its tasks when there is no exact plan can be generated according to initial and goal state by extending initial state and action details with similar or equivalent objects. The extended framework enables direct interactions between task planner, Semantic Action Models (SAMs) and knowledge-base through creating planning domain (or extended planning domain) with predicates (or semantically equivalent or similar predicates) which specify domain features. The proposed framework and approach are tested on some scenarios that cover most aspects of robot planning system
Theory and Applications of Models of Computation
No full textWe study the Weihrauch degrees of closed choice for finite sets, closed choice for convex sets and sorting infinite sequences over finite alphabets. Our main result is that choice for finite sets of cardinality is reducible to choice for convex sets in dimension , which in turn is reducible to sorting infinite sequences over an alphabet of size , iff . Our proofs invoke Kleene's recursion theorem, and we describe in some detail how Kleene's recursion theorem gives rise to a technique for proving separations of Weihrauch degrees
- …
