Dynamic adaptive autonomy in multi-agent systems

Multi-agent systems require adaptability to perform effectively in complex and dynamic environments. This article shows that agents should be able to benefit from dynamically adapting their decision-making frameworks. A decision-making framework describes the set of multi-agent decision-making interactions exercised by members of an agent group in the course of pursuing a goal or set of goals. The decision-making interaction style an agent adopts with respect to other agents influences that agent's degree of autonomy. The article introduces the capability of Dynamic Adaptive Autonomy (DAA), which allows an agent to dynamically modify its autonomy along a defined spectrum (from command-driven to consensus to locally autonomous/master) for each goal it pursues. This article presents one motivation for DAA through experiments showing that the ‘best’ decision-making framework for a group of agents depends not only on the problem domain and pre-defined characteristics of the system, but also on run-time factors that can change during system operation. This result holds regardless of which performance metric is used to define ‘best’. Thus, it is possible for agents to benefit by dynamically adapting their decision-making frameworks to their situation during system operation.     

Feature selection for medical diagnosis : Evaluation for cardiovascular diseases

Machine learning has emerged as an effective medical diagnostic support system. In a medical diagnosis problem, a set of features that are representative of all the variations of the disease are necessary. The objective of our work is to predict more accurately the presence of cardiovascular disease with reduced number of attributes. We investigate intelligent system to generate feature subset with improvement in diagnostic performance. Features ranked with distance measure are searched through forward inclusion, forward selection and backward elimination search techniques to find subset that gives improved classification result. We propose hybrid forward selection technique for cardiovascular disease diagnosis. Our experiment demonstrates that this approach finds smaller subsets and increases the accuracy of diagnosis compared to forward inclusion and back-elimination techniques.     

Glycated proteome: From reaction to intervention

Glycation, a nonenzymatic reaction between reducing sugars and proteins, is a proteome wide phenomenon, predominantly observed in diabetes due to hyperglycemia. Glycated proteome of plasma, kidney, lens, and brain are implicated in the pathogenesis of various diseases, including diabetic complications, neurodegenerative diseases, cancer, and aging. This review discusses the strategies to characterize protein glycation, its functional implications in different diseases, and intervention strategies to protect the deleterious effects of protein glycation.     

Regional Climate Simulations on EU-INDIA Grid Infrastructures: Methodologies and Performance

In this paper, we present a possible approach to use different Grid infrastructures across Europe and India for regional climate simulations and discuss in details the advantages and limitations in using them. The application taken into consideration is the Regional Climate Model RegCM4, which has been recently re-written for making it more efficient and easier to be fully exploited on any kind of computational infrastructure. We describe here the methods applied to port this package on the Grid infrastructures made available by the EU-IndiaGrid project. We also discuss different approaches, the way to run the model on both European and Indian infrastructures and our promising approach to deal with data management issues. Use of RegCM on Grid infrastructure has further been compared with that on HPC resources. The domain worked upon for these tests is the South-Asia CORDEX domain, which is of great importance for the Indian Summer Monsoon. Our final conclusion is that, for certain class of experiments, RegCM4 model can be efficiently and easily integrated on Grid infrastructures, by means of the procedures described in this paper.     

The confounding effect of class size on the validity ofobject-oriented metrics

Much effort has been devoted to the development and empirical validation of object-oriented metrics. The empirical validations performed thus far would suggest that a core set of validated metrics is close to being identified. However, none of these studies allow for the potentially confounding effect of class size. We demonstrate a strong size confounding effect and question the results of previous object-oriented metrics validation studies. We first investigated whether there is a confounding effect of class size in validation studies of object-oriented metrics and show that, based on previous work, there is reason to believe that such an effect exists. We then describe a detailed empirical methodology for identifying those effects. Finally, we perform a study on a large C++ telecommunications framework to examine if size is really a confounder. This study considered the Chidamber and Kemerer metrics and a subset of the Lorenz and Kidd metrics. The dependent variable was the incidence of a fault attributable to a field failure (fault-proneness of a class). Our findings indicate that, before controlling for size, the results are very similar to previous studies. The metrics that are expected to be validated are indeed associated with fault-proneness     

A decomposition approach to non-preemptive real-time scheduling

Consider the problem of scheduling a set ofn tasks on a uniprocessor such that a feasible schedule that satisfies each task's time constraints is generated. Traditionally, researchers have looked at all the tasks as a group and applied heuristic or enumeration search to it. We propose a new approach called thedecomposition scheduling where tasks are decomposed into a sequence of subsets. The subsets are scheduled independently, in the order of the sequence. It is proved that a feasible schedule can be generated as long as one exists for the tasks. In addition, the overall scheduling cost is reduced to the sum of the scheduling costs of the tasks in each subset.Simulation experiments were conducted to analyze the performance of decomposition scheduling approach. The results show that in many cases decomposition scheduling performs better than the traditional branch-and-bound algorithms in terms of scheduling cost, and heuristic algorithms in terms of percentage of finding feasible schedules over randomly-generated task sets.     

Situating natural language understanding within experience-based design

Building useful systems with an ability to understand "real" natural language input has long been an elusive goal for Artificial Intelligence. Well-known problems such as ambiguity, indirectness, and incompleteness of natural language inputs have thwarted efforts to build natural language interfaces to intelligent systems. In this article, we report on our work on a model of understanding natural language design specifications of physical devices such as simple electrical circuits. Our system, called KA, solves the classical problems of ambiguity, incompleteness and indirectness by exploiting the knowledge and problem-solving processes in the situation of designing simple physical devices. In addition, KA acquires its knowledge structures (apart from a basic ontology of devices) from the results of its problem-solving processes. Thus, KA can be bootstrapped to understand design specifications and user feedback about new devices using the knowledge structures it acquired from similar devices designed previously.In this paper, we report on three investigations in the KA project. Our first investigation demonstrates that KA can resolve ambiguities in design specifications as well as infer unarticulated requirements using the ontology, the knowledge structures, and the problem-solving processes provided by its design situation. The second investigation shows that KA's problem-solving capabilities help ascertain the relevance of indirect design specifications, and identify unspecified relations between detailed requirements. The third investigation demonstrates the extensibility of KA's theory of natural language understanding by showing that KA can interpret user feedback as well as design requirements. Our results demonstrate that situating language understanding in problem solving, such as device design in KA, provides effective solutions to unresolved problems in natural language processing.     

Multi-objective optimization in wire-electro-discharge machining of TiC reinforced composite through Neuro-Genetic technique

This paper proposed a Neuro-Genetic technique to optimize the multi-response of wire electro-discharge machining (WEDM) process. The technique was developed through hybridization of a radial basis function network (RBFN) and non-dominated sorting genetic algorithm (NSGA-II). The machining was done on 5 vol% titanium carbide (TiC) reinforced austenitic manganese steel metal matrix composite (MMC). The proposed Neuro-Genetic technique was found to be potential in finding several optimal input machining conditions which can satisfy wide requirements of a process engineer and help in efficient utilization of WEDM in industry.     

Reinterpretable Imager: Towards Variable Post‐Capture Space,Angle and Time Resolution in Photography

We describe a novel multiplexing approach to achieve tradeoffs in space, angle and time resolution in photography. We explore the problem of mapping useful subsets of time‐varying 4D lightfields in a single snapshot. Our design is based on using a dynamic mask in the aperture and a static mask close to the sensor. The key idea is to exploit scene‐specific redundancy along spatial, angular and temporal dimensions and to provide a programmable or variable resolution tradeoff among these dimensions. This allows a user to reinterpret the single captured photo as either a high spatial resolution image, a refocusable image stack or a video for different parts of the scene in post‐processing. A lightfield camera or a video camera forces a‐priori choice in space‐angle‐time resolution. We demonstrate a single prototype which provides flexible post‐capture abilities not possible using either a single‐shot lightfield camera or a multi‐frame video camera. We show several novel results including digital refocusing on objects moving in depth and capturing multiple facial expressions in a single photo.     

Spatio-temporal polygonal clustering with space and time as first-class citizens

Detecting spatio-temporal clusters, i.e. clusters of objects similar to each other occurring together across space and time, has important real-world applications such as climate change, drought analysis, detection of outbreak of epidemics (e.g. bird flu), bioterrorist attacks (e.g. anthrax release), and detection of increased military activity. Research in spatio-temporal clustering has focused on grouping individual objects with similar trajectories, detecting moving clusters, or discovering convoys of objects. However, most of these solutions are based on using a piece-meal approach where snapshot clusters are formed at each time stamp and then the series of snapshot clusters are analyzed to discover moving clusters. This approach has two fundamental limitations. First, it is point-based and is not readily applicable to polygonal datasets. Second, its static analysis approach at each time slice is susceptible to inaccurate tracking of dynamic cluster especially when clusters change over both time and space. In this paper we present a spatio-temporal polygonal clustering algorithm known as the Spatio-Temporal Polygonal Clustering (STPC) algorithm. STPC clusters spatial polygons taking into account their spatial and topological properties, treating time as a first-class citizen, and integrating density-based clustering with moving cluster analysis. Our experiments on the drought analysis application, flu spread analysis and crime cluster detection show the validity and robustness of our algorithm in an important geospatial application.