45286677
AIMS: An Adaptive Interactive Modeling System for Supporting Engineering Decision Making
Engineering decision making is a two-phase process involving model formation and model utilization. Simulation models have been useful for decision support but, can be too slow for interactive applications. An integrated methodology is presented for inducing faster simulation models and using these models to support interactive design. In AIMS, both model formation and model utilization are controlled by a multiple objective optimizer, ISO. This knowledge processing framework is applied to combustion engine design.
12858200
Building Robust Learning Systems by Combining Induction and Optimization
Each concept description language and search strategy has an inherent inductive bias, a preference for some hypotheses over others. No single inductive bias performs optimally on all problems. This paper describes a system that couples induction with optimization to carry out an efficient search of large regions of inductive bias space. Experimental results are reported demonstrating the system's capacity to choose optimal biases even for complex and noisy problems.
35812356
A Study of How Domain Knowledge Improves Knowledge-Based Learning Systems
Abstract A knowledge-based learning system is developed to demonstrate that intelligently selecting a subset of examples based on domain knowledge for rule induction can be more productive than using all provided examples. Knowledge-based learning uses an incomplete domain theory and examples to induce knowledge missing in the theory. Knowledge-based learning systems determine where knowledge is missing in a domain theory, select a relevant subset of examples to use in induction, and induce new rules or modify existing rules.
37627056
SWIFT: system workbench for integrating and facilitating teams
There have been many R&D efforts in recent years to develop computer environments that directly enhance group problem-solving productivity. An example of such efforts is the computer-based virtual teaming technology (VTT) developed at the knowledge-based Engineering Sytems Research Laboratory (KESRL). The core software environment for KESRL's VTT is called SWIFT and is based on the knowledge processing technology (KPT) previously developed at KESRL to support various engineering design tasks. SWIFT is a flexible environment which enables the rapid development of collaborative applications, linking workers in distributed environments, of many domains. The paper presents the overall system architecture of SWIFT, and introduces the current and future R&D efforts at KESRL in realizing SWIFT for significant industrial applications.<<ETX>>
6309018
Knowledge-based learning integrating acquisition and learning
Empirical learning algorithms are hampered by their inability to use domain knowledge to guide the induction of new rules. This paper describes knowledge-based learning, an approach to learning that selects the examples and relevant attributes for an empirical algorithm. Knowledge-based learning can be used for developing rules for engineering expert systems. Engineers often have some rules for problem solving, but also many experiences (examples) that facilitate solving problems. Knowledge-based learning systems are able to use both forms of knowledge.
5343942
Knowledge-Based Equation Discovery in Engineering Domains
Machine learning techniques that can compress datasets into relationships that underlie the data have great utility for engineers. Most model discovery systems are not well suited to discovering comprehensible models in engineering domains. In this paper we present KEDS, a Knowledge-based Equation Discovery System, which uses a model-driven approach to discover equations and thereby build models from engineering data.
6607709
Itinerary-Based Access Control for Mobile Tasks in Scientific Workflows
Current scientific workflow models require datasets to be transferred from their source to the hosts where they can be processed. This seriously impedes data-intensive applications. In order to address this limitation, we propose a notion of mobile tasks that can move from their home hosts towards datasets and perform computation on the dataset side. Since a mobile task might migrate across various administrative domains and get executed at multiple hosts, it is critically important to ensure the security of a mobile- task-based workflow system. In this paper, we propose an itinerary-based access control model to ensure the secure migration of mobile tasks.
6254225
Adaptive Quality of Service Support for Packet-Switched Wireless Cellular Networks
In this paper, we propose an adaptive quality of service (QoS) design approach via resource reservation and rate adaptation to support multimedia over wireless cellular networks. Three contributions of this work are: (a) an adaptive QoS model that seeks to provide QoS assurances within bounds for each packet flow and to make advance resource reservation in order to support seamless mobility, (b) a revenue-based resource adaptation design that seeks to maximize network revenue while satisfying the QoS requirements, and (c) a resource reservation protocol that supports both application-initiated resource reservation and network-initiated resource adaptation. Our initial implementation and measurements confirm the effectiveness of the proposed design.
15500177
A unified architecture for the design and evaluation of wireless fair queueing algorithms
Fair queueing in the wireless domain poses significant challenges due to unique issues in the wireless channel such as location-dependent and bursty channel errors. In this paper, we present a wireless fair service model that captures the scheduling requirements of wireless scheduling algorithms, and present a unified wireless fair queueing architecture in which scheduling algorithms can be designed to achieve wireless fair service. We map seven recently proposed wireless fair scheduling algorithms to the unified architecture, and compare their properties through simulation and analysis. We conclude that some of these algorithms achieve the properties of wireless fair service including short-term and long-term fairness, short-term and long-term throughput bounds, and tight delay bounds for channel access.
1137858
Runtime Security Verification for Itinerary-Driven Mobile Agents
We present a new approach to ensure the secure execution of itinerary-driven mobile agents, in which the specification of the navigational behavior of an agent is separated from the specification of its computational behavior. We empower each host with an access control policy so that the host will deny the access from an agent whose itinerary does not conform to the host's access control policy. A host uses model checking algorithms to check if the itinerary of the agent conforms to its access control policy written in mu-calculus, and if so, grant access permission. In order to address the state explosion problem for model checking itineraries, we propose an approach called model generation code. In this approach, instead of verifying the itinerary itself, a host actually checks the conservative models of a mobile agent. If a conservative model does not satisfy the host's access control policy, the mobile agent will provide refined models for further verification. Our preliminary results show that this is a practical and promising approach to ensure the secure execution of mobile agents
46357033
A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms
Fair queueing in the wireless domain poses significant challenges due to unique issues in the wireless channel such as location-dependent and bursty channel errors. In this paper, we present a wireless fair service model that captures the scheduling requirements of wireless scheduling algorithms, and present a unified wireless fair queueing architecture in which scheduling algorithms can be designed to achieve wireless fair service. We map seven recently proposed wireless fair scheduling algorithms to the unified architecture, and compare their properties through simulation and analysis. We conclude that some of these algorithms achieve the properties of wireless fair service including short-term and long-term fairness, short-term and long-term throughput bounds, and tight delay bounds for channel access.