Quicker Q-Learning in Multi-Agent Systems

NASA Technical Reports Server (NTRS)

Agogino, Adrian K.; Tumer, Kagan

2005-01-01

Multi-agent learning in Markov Decisions Problems is challenging because of the presence ot two credit assignment problems: 1) How to credit an action taken at time step t for rewards received at t' greater than t; and 2) How to credit an action taken by agent i considering the system reward is a function of the actions of all the agents. The first credit assignment problem is typically addressed with temporal difference methods such as Q-learning OK TD(lambda) The second credit assi,onment problem is typically addressed either by hand-crafting reward functions that assign proper credit to an agent, or by making certain independence assumptions about an agent's state-space and reward function. To address both credit assignment problems simultaneously, we propose the Q Updates with Immediate Counterfactual Rewards-learning (QUICR-learning) designed to improve both the convergence properties and performance of Q-learning in large multi-agent problems. Instead of assuming that an agent s value function can be made independent of other agents, this method suppresses the impact of other agents using counterfactual rewards. Results on multi-agent grid-world problems over multiple topologies show that QUICR-learning can achieve up to thirty fold improvements in performance over both conventional and local Q-learning in the largest tested systems.

Insight and analysis problem solving in microbes to machines.

PubMed

Clark, Kevin B

2015-11-01

A key feature for obtaining solutions to difficult problems, insight is oftentimes vaguely regarded as a special discontinuous intellectual process and/or a cognitive restructuring of problem representation or goal approach. However, this nearly century-old state of art devised by the Gestalt tradition to explain the non-analytical or non-trial-and-error, goal-seeking aptitude of primate mentality tends to neglect problem-solving capabilities of lower animal phyla, Kingdoms other than Animalia, and advancing smart computational technologies built from biological, artificial, and composite media. Attempting to provide an inclusive, precise definition of insight, two major criteria of insight, discontinuous processing and problem restructuring, are here reframed using terminology and statistical mechanical properties of computational complexity classes. Discontinuous processing becomes abrupt state transitions in algorithmic/heuristic outcomes or in types of algorithms/heuristics executed by agents using classical and/or quantum computational models. And problem restructuring becomes combinatorial reorganization of resources, problem-type substitution, and/or exchange of computational models. With insight bounded by computational complexity, humans, ciliated protozoa, and complex technological networks, for example, show insight when restructuring time requirements, combinatorial complexity, and problem type to solve polynomial and nondeterministic polynomial decision problems. Similar effects are expected from other problem types, supporting the idea that insight might be an epiphenomenon of analytical problem solving and consequently a larger information processing framework. Thus, this computational complexity definition of insight improves the power, external and internal validity, and reliability of operational parameters with which to classify, investigate, and produce the phenomenon for computational agents ranging from microbes to man-made devices. Copyright © 2015 Elsevier Ltd. All rights reserved.

Asessing for Structural Understanding in Childrens' Combinatorial Problem Solving.

ERIC Educational Resources Information Center

English, Lyn

1999-01-01

Assesses children's structural understanding of combinatorial problems when presented in a variety of task situations. Provides an explanatory model of students' combinatorial understandings that informs teaching and assessment. Addresses several components of children's structural understanding of elementary combinatorial problems. (Contains 50…

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

DOEpatents

Van Benthem, Mark H.; Keenan, Michael R.

2008-11-11

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Pattern recognition with composite correlation filters designed with multi-object combinatorial optimization

DOE PAGES

Awwal, Abdul; Diaz-Ramirez, Victor H.; Cuevas, Andres; ...

2014-10-23

Composite correlation filters are used for solving a wide variety of pattern recognition problems. These filters are given by a combination of several training templates chosen by a designer in an ad hoc manner. In this work, we present a new approach for the design of composite filters based on multi-objective combinatorial optimization. Given a vast search space of training templates, an iterative algorithm is used to synthesize a filter with an optimized performance in terms of several competing criteria. Furthermore, by employing a suggested binary-search procedure a filter bank with a minimum number of filters can be constructed, formore » a prespecified trade-off of performance metrics. Computer simulation results obtained with the proposed method in recognizing geometrically distorted versions of a target in cluttered and noisy scenes are discussed and compared in terms of recognition performance and complexity with existing state-of-the-art filters.« less

Pattern recognition with composite correlation filters designed with multi-object combinatorial optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Awwal, Abdul; Diaz-Ramirez, Victor H.; Cuevas, Andres

Composite correlation filters are used for solving a wide variety of pattern recognition problems. These filters are given by a combination of several training templates chosen by a designer in an ad hoc manner. In this work, we present a new approach for the design of composite filters based on multi-objective combinatorial optimization. Given a vast search space of training templates, an iterative algorithm is used to synthesize a filter with an optimized performance in terms of several competing criteria. Furthermore, by employing a suggested binary-search procedure a filter bank with a minimum number of filters can be constructed, formore » a prespecified trade-off of performance metrics. Computer simulation results obtained with the proposed method in recognizing geometrically distorted versions of a target in cluttered and noisy scenes are discussed and compared in terms of recognition performance and complexity with existing state-of-the-art filters.« less

Multi-Agent Patrolling under Uncertainty and Threats.

PubMed

Chen, Shaofei; Wu, Feng; Shen, Lincheng; Chen, Jing; Ramchurn, Sarvapali D

2015-01-01

We investigate a multi-agent patrolling problem where information is distributed alongside threats in environments with uncertainties. Specifically, the information and threat at each location are independently modelled as multi-state Markov chains, whose states are not observed until the location is visited by an agent. While agents will obtain information at a location, they may also suffer damage from the threat at that location. Therefore, the goal of the agents is to gather as much information as possible while mitigating the damage incurred. To address this challenge, we formulate the single-agent patrolling problem as a Partially Observable Markov Decision Process (POMDP) and propose a computationally efficient algorithm to solve this model. Building upon this, to compute patrols for multiple agents, the single-agent algorithm is extended for each agent with the aim of maximising its marginal contribution to the team. We empirically evaluate our algorithm on problems of multi-agent patrolling and show that it outperforms a baseline algorithm up to 44% for 10 agents and by 21% for 15 agents in large domains.

Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boman, Erik G.; Catalyurek, Umit V.; Chevalier, Cedric

2015-01-16

This final progress report summarizes the work accomplished at the Combinatorial Scientific Computing and Petascale Simulations Institute. We developed Zoltan, a parallel mesh partitioning library that made use of accurate hypergraph models to provide load balancing in mesh-based computations. We developed several graph coloring algorithms for computing Jacobian and Hessian matrices and organized them into a software package called ColPack. We developed parallel algorithms for graph coloring and graph matching problems, and also designed multi-scale graph algorithms. Three PhD students graduated, six more are continuing their PhD studies, and four postdoctoral scholars were advised. Six of these students and Fellowsmore » have joined DOE Labs (Sandia, Berkeley), as staff scientists or as postdoctoral scientists. We also organized the SIAM Workshop on Combinatorial Scientific Computing (CSC) in 2007, 2009, and 2011 to continue to foster the CSC community.« less

Optimal Price Decision Problem for Simultaneous Multi-article Auction and Its Optimal Price Searching Method by Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Masuda, Kazuaki; Aiyoshi, Eitaro

We propose a method for solving optimal price decision problems for simultaneous multi-article auctions. An auction problem, originally formulated as a combinatorial problem, determines both every seller's whether or not to sell his/her article and every buyer's which article(s) to buy, so that the total utility of buyers and sellers will be maximized. Due to the duality theory, we transform it equivalently into a dual problem in which Lagrange multipliers are interpreted as articles' transaction price. As the dual problem is a continuous optimization problem with respect to the multipliers (i.e., the transaction prices), we propose a numerical method to solve it by applying heuristic global search methods. In this paper, Particle Swarm Optimization (PSO) is used to solve the dual problem, and experimental results are presented to show the validity of the proposed method.

Parallelization of combinatorial search when solving knapsack optimization problem on computing systems based on multicore processors

NASA Astrophysics Data System (ADS)

Rahman, P. A.

2018-05-01

This scientific paper deals with the model of the knapsack optimization problem and method of its solving based on directed combinatorial search in the boolean space. The offered by the author specialized mathematical model of decomposition of the search-zone to the separate search-spheres and the algorithm of distribution of the search-spheres to the different cores of the multi-core processor are also discussed. The paper also provides an example of decomposition of the search-zone to the several search-spheres and distribution of the search-spheres to the different cores of the quad-core processor. Finally, an offered by the author formula for estimation of the theoretical maximum of the computational acceleration, which can be achieved due to the parallelization of the search-zone to the search-spheres on the unlimited number of the processor cores, is also given.

Distributed Market-Based Algorithms for Multi-Agent Planning with Shared Resources

DTIC Science & Technology

2013-02-01

1 Introduction 1 2 Distributed Market-Based Multi-Agent Planning 5 2.1 Problem Formulation...over the deterministic planner, on the “test set” of scenarios with changing economies. . . 50 xi xii Chapter 1 Introduction Multi-agent planning is...representation of the objective (4.2.1). For example, for the supply chain mangement problem, we assumed a sequence of Bernoulli coin flips, which seems

Neural Meta-Memes Framework for Combinatorial Optimization

NASA Astrophysics Data System (ADS)

Song, Li Qin; Lim, Meng Hiot; Ong, Yew Soon

In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).

Verifying Multi-Agent Systems via Unbounded Model Checking

NASA Technical Reports Server (NTRS)

Kacprzak, M.; Lomuscio, A.; Lasica, T.; Penczek, W.; Szreter, M.

2004-01-01

We present an approach to the problem of verification of epistemic properties in multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature. We give details of the technique and show how it can be applied to the well known train, gate and controller problem. Keywords: model checking, unbounded model checking, multi-agent systems

Extended precedence preservative crossover for job shop scheduling problems

NASA Astrophysics Data System (ADS)

Ong, Chung Sin; Moin, Noor Hasnah; Omar, Mohd

2013-04-01

Job shop scheduling problems (JSSP) is one of difficult combinatorial scheduling problems. A wide range of genetic algorithms based on the two parents crossover have been applied to solve the problem but multi parents (more than two parents) crossover in solving the JSSP is still lacking. This paper proposes the extended precedence preservative crossover (EPPX) which uses multi parents for recombination in the genetic algorithms. EPPX is a variation of the precedence preservative crossover (PPX) which is one of the crossovers that perform well to find the solutions for the JSSP. EPPX is based on a vector to determine the gene selected in recombination for the next generation. Legalization of children (offspring) can be eliminated due to the JSSP representation encoded by using permutation with repetition that guarantees the feasibility of chromosomes. The simulations are performed on a set of benchmarks from the literatures and the results are compared to ensure the sustainability of multi parents recombination in solving the JSSP.

A Scalable and Robust Multi-Agent Approach to Distributed Optimization

NASA Technical Reports Server (NTRS)

Tumer, Kagan

2005-01-01

Modularizing a large optimization problem so that the solutions to the subproblems provide a good overall solution is a challenging problem. In this paper we present a multi-agent approach to this problem based on aligning the agent objectives with the system objectives, obviating the need to impose external mechanisms to achieve collaboration among the agents. This approach naturally addresses scaling and robustness issues by ensuring that the agents do not rely on the reliable operation of other agents We test this approach in the difficult distributed optimization problem of imperfect device subset selection [Challet and Johnson, 2002]. In this problem, there are n devices, each of which has a "distortion", and the task is to find the subset of those n devices that minimizes the average distortion. Our results show that in large systems (1000 agents) the proposed approach provides improvements of over an order of magnitude over both traditional optimization methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents fail midway through the simulation) the system remains coordinated and still outperforms a failure-free and centralized optimization algorithm.

Research and Implementation of Key Technologies in Multi-Agent System to Support Distributed Workflow

NASA Astrophysics Data System (ADS)

Pan, Tianheng

2018-01-01

In recent years, the combination of workflow management system and Multi-agent technology is a hot research field. The problem of lack of flexibility in workflow management system can be improved by introducing multi-agent collaborative management. The workflow management system adopts distributed structure. It solves the problem that the traditional centralized workflow structure is fragile. In this paper, the agent of Distributed workflow management system is divided according to its function. The execution process of each type of agent is analyzed. The key technologies such as process execution and resource management are analyzed.

Distributed Optimization of Multi-Agent Systems: Framework, Local Optimizer, and Applications

NASA Astrophysics Data System (ADS)

Zu, Yue

Convex optimization problem can be solved in a centralized or distributed manner. Compared with centralized methods based on single-agent system, distributed algorithms rely on multi-agent systems with information exchanging among connected neighbors, which leads to great improvement on the system fault tolerance. Thus, a task within multi-agent system can be completed with presence of partial agent failures. By problem decomposition, a large-scale problem can be divided into a set of small-scale sub-problems that can be solved in sequence/parallel. Hence, the computational complexity is greatly reduced by distributed algorithm in multi-agent system. Moreover, distributed algorithm allows data collected and stored in a distributed fashion, which successfully overcomes the drawbacks of using multicast due to the bandwidth limitation. Distributed algorithm has been applied in solving a variety of real-world problems. Our research focuses on the framework and local optimizer design in practical engineering applications. In the first one, we propose a multi-sensor and multi-agent scheme for spatial motion estimation of a rigid body. Estimation performance is improved in terms of accuracy and convergence speed. Second, we develop a cyber-physical system and implement distributed computation devices to optimize the in-building evacuation path when hazard occurs. The proposed Bellman-Ford Dual-Subgradient path planning method relieves the congestion in corridor and the exit areas. At last, highway traffic flow is managed by adjusting speed limits to minimize the fuel consumption and travel time in the third project. Optimal control strategy is designed through both centralized and distributed algorithm based on convex problem formulation. Moreover, a hybrid control scheme is presented for highway network travel time minimization. Compared with no controlled case or conventional highway traffic control strategy, the proposed hybrid control strategy greatly reduces total travel time on test highway network.

On-bead combinatorial synthesis and imaging of chemical exchange saturation transfer magnetic resonance imaging agents to identify factors that influence water exchange.

PubMed

Napolitano, Roberta; Soesbe, Todd C; De León-Rodríguez, Luis M; Sherry, A Dean; Udugamasooriya, D Gomika

2011-08-24

The sensitivity of magnetic resonance imaging (MRI) contrast agents is highly dependent on the rate of water exchange between the inner sphere of a paramagnetic ion and bulk water. Normally, identifying a paramagnetic complex that has optimal water exchange kinetics is done by synthesizing and testing one compound at a time. We report here a rapid, economical on-bead combinatorial synthesis of a library of imaging agents. Eighty different 1,4,7,10-tetraazacyclododecan-1,4,7,10-tetraacetic acid (DOTA)-tetraamide peptoid derivatives were prepared on beads using a variety of charged, uncharged but polar, hydrophobic, and variably sized primary amines. A single chemical exchange saturation transfer image of the on-bead library easily distinguished those compounds having the most favorable water exchange kinetics. This combinatorial approach will allow rapid screening of libraries of imaging agents to identify the chemical characteristics of a ligand that yield the most sensitive imaging agents. This technique could be automated and readily adapted to other types of MRI or magnetic resonance/positron emission tomography agents as well.

Combinatorial Methods for Exploring Complex Materials

NASA Astrophysics Data System (ADS)

Amis, Eric J.

2004-03-01

Combinatorial and high-throughput methods have changed the paradigm of pharmaceutical synthesis and have begun to have a similar impact on materials science research. Already there are examples of combinatorial methods used for inorganic materials, catalysts, and polymer synthesis. For many investigations the primary goal has been discovery of new material compositions that optimize properties such as phosphorescence or catalytic activity. In the midst of the excitement generated to "make things", another opportunity arises for materials science to "understand things" by using the efficiency of combinatorial methods. We have shown that combinatorial methods hold potential for rapid and systematic generation of experimental data over the multi-parameter space typical of investigations in polymer physics. We have applied the combinatorial approach to studies of polymer thin films, biomaterials, polymer blends, filled polymers, and semicrystalline polymers. By combining library fabrication, high-throughput measurements, informatics, and modeling we can demonstrate validation of the methodology, new observations, and developments toward predictive models. This talk will present some of our latest work with applications to coating stability, multi-component formulations, and nanostructure assembly.

Effect of the Implicit Combinatorial Model on Combinatorial Reasoning in Secondary School Pupils.

ERIC Educational Resources Information Center

Batanero, Carmen; And Others

1997-01-01

Elementary combinatorial problems may be classified into three different combinatorial models: (1) selection; (2) partition; and (3) distribution. The main goal of this research was to determine the effect of the implicit combinatorial model on pupils' combinatorial reasoning before and after instruction. Gives an analysis of variance of the…

Research on Production Scheduling System with Bottleneck Based on Multi-agent

NASA Astrophysics Data System (ADS)

Zhenqiang, Bao; Weiye, Wang; Peng, Wang; Pan, Quanke

Aimed at the imbalance problem of resource capacity in Production Scheduling System, this paper uses Production Scheduling System based on multi-agent which has been constructed, and combines the dynamic and autonomous of Agent; the bottleneck problem in the scheduling is solved dynamically. Firstly, this paper uses Bottleneck Resource Agent to find out the bottleneck resource in the production line, analyses the inherent mechanism of bottleneck, and describes the production scheduling process based on bottleneck resource. Bottleneck Decomposition Agent harmonizes the relationship of job's arrival time and transfer time in Bottleneck Resource Agent and Non-Bottleneck Resource Agents, therefore, the dynamic scheduling problem is simplified as the single machine scheduling of each resource which takes part in the scheduling. Finally, the dynamic real-time scheduling problem is effectively solved in Production Scheduling System.

Solving Assembly Sequence Planning using Angle Modulated Simulated Kalman Filter

NASA Astrophysics Data System (ADS)

Mustapa, Ainizar; Yusof, Zulkifli Md.; Adam, Asrul; Muhammad, Badaruddin; Ibrahim, Zuwairie

2018-03-01

This paper presents an implementation of Simulated Kalman Filter (SKF) algorithm for optimizing an Assembly Sequence Planning (ASP) problem. The SKF search strategy contains three simple steps; predict-measure-estimate. The main objective of the ASP is to determine the sequence of component installation to shorten assembly time or save assembly costs. Initially, permutation sequence is generated to represent each agent. Each agent is then subjected to a precedence matrix constraint to produce feasible assembly sequence. Next, the Angle Modulated SKF (AMSKF) is proposed for solving ASP problem. The main idea of the angle modulated approach in solving combinatorial optimization problem is to use a function, g(x), to create a continuous signal. The performance of the proposed AMSKF is compared against previous works in solving ASP by applying BGSA, BPSO, and MSPSO. Using a case study of ASP, the results show that AMSKF outperformed all the algorithms in obtaining the best solution.

Combinatorial Optimization of Heterogeneous Catalysts Used in the Growth of Carbon Nanotubes

NASA Technical Reports Server (NTRS)

Cassell, Alan M.; Verma, Sunita; Delzeit, Lance; Meyyappan, M.; Han, Jie

2000-01-01

Libraries of liquid-phase catalyst precursor solutions were printed onto iridium-coated silicon substrates and evaluated for their effectiveness in catalyzing the growth of multi-walled carbon nanotubes (MWNTs) by chemical vapor deposition (CVD). The catalyst precursor solutions were composed of inorganic salts and a removable tri-block copolymer (EO)20(PO)70(EO)20 (EO = ethylene oxide, PO = propylene oxide) structure-directing agent (SDA), dissolved in ethanol/methanol mixtures. Sample libraries were quickly assayed using scanning electron microscopy after CVD growth to identify active catalysts and CVD conditions. Composition libraries and focus libraries were then constructed around the active spots identified in the discovery libraries to understand how catalyst precursor composition affects the yield, density, and quality of the nanotubes. Successful implementation of combinatorial optimization methods in the development of highly active, carbon nanotube catalysts is demonstrated, as well as the identification of catalyst formulations that lead to varying densities and shapes of aligned nanotube towers.

Multi Agent Reward Analysis for Learning in Noisy Domains

NASA Technical Reports Server (NTRS)

Tumer, Kagan; Agogino, Adrian K.

2005-01-01

In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronounced in continuous, noisy domains ill-suited to simple table backup schemes commonly used in TD(lambda)/Q-learning. In this paper, we present a new reward evaluation method that allows the tradeoff between coordination among the agents and the difficulty of the learning problem each agent faces to be visualized. This method is independent of the learning algorithm and is only a function of the problem domain and the agents reward structure. We then use this reward efficiency visualization method to determine an effective reward without performing extensive simulations. We test this method in both a static and a dynamic multi-rover learning domain where the agents have continuous state spaces and where their actions are noisy (e.g., the agents movement decisions are not always carried out properly). Our results show that in the more difficult dynamic domain, the reward efficiency visualization method provides a two order of magnitude speedup in selecting a good reward. Most importantly it allows one to quickly create and verify rewards tailored to the observational limitations of the domain.

Additivity vs Synergism: Investigation of the Additive Interaction of Cinnamon Bark Oil and Meropenem in Combinatory Therapy.

PubMed

Yang, Shun-Kai; Yusoff, Khatijah; Mai, Chun-Wai; Lim, Wei-Meng; Yap, Wai-Sum; Lim, Swee-Hua Erin; Lai, Kok-Song

2017-11-04

Combinatory therapies have been commonly applied in the clinical setting to tackle multi-drug resistant bacterial infections and these have frequently proven to be effective. Specifically, combinatory therapies resulting in synergistic interactions between antibiotics and adjuvant have been the main focus due to their effectiveness, sidelining the effects of additivity, which also lowers the minimal effective dosage of either antimicrobial agent. Thus, this study was undertaken to look at the effects of additivity between essential oils and antibiotic, via the use of cinnamon bark essential oil (CBO) and meropenem as a model for additivity. Comparisons between synergistic and additive interaction of CBO were performed in terms of the ability of CBO to disrupt bacterial membrane, via zeta potential measurement, outer membrane permeability assay and scanning electron microscopy. It has been found that the additivity interaction between CBO and meropenem showed similar membrane disruption ability when compared to those synergistic combinations which was previously reported. Hence, results based on our studies strongly suggest that additive interaction acts on a par with synergistic interaction. Therefore, further investigation in additive interaction between antibiotics and adjuvant should be performed for a more in depth understanding of the mechanism and the impacts of such interaction.

An Investigation into Post-Secondary Students' Understanding of Combinatorial Questions

ERIC Educational Resources Information Center

Bulone, Vincent William

2017-01-01

The purpose of this dissertation was to study aspects of how post-secondary students understand combinatorial problems. Within this dissertation, I considered understanding through two different lenses: i) student connections to previous problems; and ii) common combinatorial distinctions such as ordered versus unordered and repetitive versus…

Robust Multi-unit Auction Protocol against False-name Bids

NASA Astrophysics Data System (ADS)

Yokoo, Makoto; Sakurai, Yuko; Matsubara, Shigeo

This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce and a promising field for applying agent and Artificial Intelligence technologies. Although the Internet provides an excellent infrastructure for executing auctions, the possibility of a new type of cheating called false-name bids has been pointed out. A false-name bid is a bid submitted under a fictitious name. A protocol called LDS has been developed for combinatorial auctions of multiple different items and has proven to be robust against false-name bids. Although we can modify the LDS protocol to handle multi-unit auctions, in which multiple units of an identical item are auctioned, the protocol is complicated and requires the auctioneer to carefully pre-determine the combination of bundles to obtain a high social surplus or revenue. For the auctioneer, our newly developed IR protocol is easier to use than the LDS, since the combination of bundles is automatically determined in a flexible manner according to the declared evaluation values of agents. The evaluation results show that the IR protocol can obtain a better social surplus than that obtained by the LDS protocol.

An evaluation of methods for estimating the number of local optima in combinatorial optimization problems.

PubMed

Hernando, Leticia; Mendiburu, Alexander; Lozano, Jose A

2013-01-01

The solution of many combinatorial optimization problems is carried out by metaheuristics, which generally make use of local search algorithms. These algorithms use some kind of neighborhood structure over the search space. The performance of the algorithms strongly depends on the properties that the neighborhood imposes on the search space. One of these properties is the number of local optima. Given an instance of a combinatorial optimization problem and a neighborhood, the estimation of the number of local optima can help not only to measure the complexity of the instance, but also to choose the most convenient neighborhood to solve it. In this paper we review and evaluate several methods to estimate the number of local optima in combinatorial optimization problems. The methods reviewed not only come from the combinatorial optimization literature, but also from the statistical literature. A thorough evaluation in synthetic as well as real problems is given. We conclude by providing recommendations of methods for several scenarios.

Training and Transfer in Combinatorial Problem Solving: The Development of Formal Reasoning During Early Adolescence

ERIC Educational Resources Information Center

Barratt, Barnaby B.

1975-01-01

This study investigated the emergence of combinatorial competence in early adolescence and the effectiveness of a programmed discovery training procedure. Significant increases in combinatorial skill with age were shown; it was found that the expression of this skill was significantly facilitated if problems involved concrete material of low…

Towards a conceptual multi-agent-based framework to simulate the spatial group decision-making process

NASA Astrophysics Data System (ADS)

Ghavami, Seyed Morsal; Taleai, Mohammad

2017-04-01

Most spatial problems are multi-actor, multi-issue and multi-phase in nature. In addition to their intrinsic complexity, spatial problems usually involve groups of actors from different organizational and cognitive backgrounds, all of whom participate in a social structure to resolve or reduce the complexity of a given problem. Hence, it is important to study and evaluate what different aspects influence the spatial problem resolution process. Recently, multi-agent systems consisting of groups of separate agent entities all interacting with each other have been put forward as appropriate tools to use to study and resolve such problems. In this study, then in order to generate a better level of understanding regarding the spatial problem group decision-making process, a conceptual multi-agent-based framework is used that represents and specifies all the necessary concepts and entities needed to aid group decision making, based on a simulation of the group decision-making process as well as the relationships that exist among the different concepts involved. The study uses five main influencing entities as concepts in the simulation process: spatial influence, individual-level influence, group-level influence, negotiation influence and group performance measures. Further, it explains the relationship among different concepts in a descriptive rather than explanatory manner. To illustrate the proposed framework, the approval process for an urban land use master plan in Zanjan—a provincial capital in Iran—is simulated using MAS, the results highlighting the effectiveness of applying an MAS-based framework when wishing to study the group decision-making process used to resolve spatial problems.

Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs

NASA Astrophysics Data System (ADS)

Fu, Junjie; Wang, Jin-zhi

2017-09-01

In this paper, we study the finite-time consensus problems with globally bounded convergence time also known as fixed-time consensus problems for multi-agent systems subject to directed communication graphs. Two new distributed control strategies are proposed such that leaderless and leader-follower consensus are achieved with convergence time independent on the initial conditions of the agents. Fixed-time formation generation and formation tracking problems are also solved as the generalizations. Simulation examples are provided to demonstrate the performance of the new controllers.

Distributed robust finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2016-04-01

This paper investigates the robust finite-time consensus problem of multi-agent systems in networks with undirected topology. Global nonlinear consensus protocols augmented with a variable structure are constructed with the aid of Lyapunov functions for each single-integrator agent dynamics in the presence of external disturbances. In particular, it is shown that the finite settling time of the proposed general framework for robust consensus design is upper bounded for any initial condition. This makes it possible for network consensus problems to design and estimate the convergence time offline for a multi-agent team with a given undirected information flow. Finally, simulation results are presented to demonstrate the performance and effectiveness of our finite-time protocols.

Agents Control in Intelligent Learning Systems: The Case of Reactive Characteristics

ERIC Educational Resources Information Center

Laureano-Cruces, Ana Lilia; Ramirez-Rodriguez, Javier; de Arriaga, Fernando; Escarela-Perez, Rafael

2006-01-01

Intelligent learning systems (ILSs) have evolved in the last few years basically because of influences received from multi-agent architectures (MAs). Conflict resolution among agents has been a very important problem for multi-agent systems, with specific features in the case of ILSs. The literature shows that ILSs with cognitive or pedagogical…

Coordination of heterogeneous nonlinear multi-agent systems with prescribed behaviours

NASA Astrophysics Data System (ADS)

Tang, Yutao

2017-10-01

In this paper, we consider a coordination problem for a class of heterogeneous nonlinear multi-agent systems with a prescribed input-output behaviour which was represented by another input-driven system. In contrast to most existing multi-agent coordination results with an autonomous (virtual) leader, this formulation takes possible control inputs of the leader into consideration. First, the coordination was achieved by utilising a group of distributed observers based on conventional assumptions of model matching problem. Then, a fully distributed adaptive extension was proposed without using the input of this input-output behaviour. An example was given to verify their effectiveness.

QUICR-learning for Multi-Agent Coordination

NASA Technical Reports Server (NTRS)

Agogino, Adrian K.; Tumer, Kagan

2006-01-01

Coordinating multiple agents that need to perform a sequence of actions to maximize a system level reward requires solving two distinct credit assignment problems. First, credit must be assigned for an action taken at time step t that results in a reward at time step t > t. Second, credit must be assigned for the contribution of agent i to the overall system performance. The first credit assignment problem is typically addressed with temporal difference methods such as Q-learning. The second credit assignment problem is typically addressed by creating custom reward functions. To address both credit assignment problems simultaneously, we propose the "Q Updates with Immediate Counterfactual Rewards-learning" (QUICR-learning) designed to improve both the convergence properties and performance of Q-learning in large multi-agent problems. QUICR-learning is based on previous work on single-time-step counterfactual rewards described by the collectives framework. Results on a traffic congestion problem shows that QUICR-learning is significantly better than a Q-learner using collectives-based (single-time-step counterfactual) rewards. In addition QUICR-learning provides significant gains over conventional and local Q-learning. Additional results on a multi-agent grid-world problem show that the improvements due to QUICR-learning are not domain specific and can provide up to a ten fold increase in performance over existing methods.

Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication

ERIC Educational Resources Information Center

Wolf, Michael Maclean

2009-01-01

Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific…

A methodology to find the elementary landscape decomposition of combinatorial optimization problems.

PubMed

Chicano, Francisco; Whitley, L Darrell; Alba, Enrique

2011-01-01

A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of multiple elementary landscapes if the underlying neighborhood used is symmetric. This paper presents theoretical results that provide the foundation for algebraic methods that can be used to decompose the objective function of an arbitrary combinatorial optimization problem into a sum of subfunctions, where each subfunction is an elementary landscape. Many steps of this process can be automated, and indeed a software tool could be developed that assists the researcher in finding a landscape decomposition. This methodology is then used to show that the subset sum problem is a superposition of two elementary landscapes, and to show that the quadratic assignment problem is a superposition of three elementary landscapes.

Agent Reward Shaping for Alleviating Traffic Congestion

NASA Technical Reports Server (NTRS)

Tumer, Kagan; Agogino, Adrian

2006-01-01

Traffic congestion problems provide a unique environment to study how multi-agent systems promote desired system level behavior. What is particularly interesting in this class of problems is that no individual action is intrinsically "bad" for the system but that combinations of actions among agents lead to undesirable outcomes, As a consequence, agents need to learn how to coordinate their actions with those of other agents, rather than learn a particular set of "good" actions. This problem is ubiquitous in various traffic problems, including selecting departure times for commuters, routes for airlines, and paths for data routers. In this paper we present a multi-agent approach to two traffic problems, where far each driver, an agent selects the most suitable action using reinforcement learning. The agent rewards are based on concepts from collectives and aim to provide the agents with rewards that are both easy to learn and that if learned, lead to good system level behavior. In the first problem, we study how agents learn the best departure times of drivers in a daily commuting environment and how following those departure times alleviates congestion. In the second problem, we study how agents learn to select desirable routes to improve traffic flow and minimize delays for. all drivers.. In both sets of experiments,. agents using collective-based rewards produced near optimal performance (93-96% of optimal) whereas agents using system rewards (63-68%) barely outperformed random action selection (62-64%) and agents using local rewards (48-72%) performed worse than random in some instances.

Automation of multi-agent control for complex dynamic systems in heterogeneous computational network

NASA Astrophysics Data System (ADS)

Oparin, Gennady; Feoktistov, Alexander; Bogdanova, Vera; Sidorov, Ivan

2017-01-01

The rapid progress of high-performance computing entails new challenges related to solving large scientific problems for various subject domains in a heterogeneous distributed computing environment (e.g., a network, Grid system, or Cloud infrastructure). The specialists in the field of parallel and distributed computing give the special attention to a scalability of applications for problem solving. An effective management of the scalable application in the heterogeneous distributed computing environment is still a non-trivial issue. Control systems that operate in networks, especially relate to this issue. We propose a new approach to the multi-agent management for the scalable applications in the heterogeneous computational network. The fundamentals of our approach are the integrated use of conceptual programming, simulation modeling, network monitoring, multi-agent management, and service-oriented programming. We developed a special framework for an automation of the problem solving. Advantages of the proposed approach are demonstrated on the parametric synthesis example of the static linear regulator for complex dynamic systems. Benefits of the scalable application for solving this problem include automation of the multi-agent control for the systems in a parallel mode with various degrees of its detailed elaboration.

Multi-agent cooperation rescue algorithm based on influence degree and state prediction

NASA Astrophysics Data System (ADS)

Zheng, Yanbin; Ma, Guangfu; Wang, Linlin; Xi, Pengxue

2018-04-01

Aiming at the multi-agent cooperative rescue in disaster, a multi-agent cooperative rescue algorithm based on impact degree and state prediction is proposed. Firstly, based on the influence of the information in the scene on the collaborative task, the influence degree function is used to filter the information. Secondly, using the selected information to predict the state of the system and Agent behavior. Finally, according to the result of the forecast, the cooperative behavior of Agent is guided and improved the efficiency of individual collaboration. The simulation results show that this algorithm can effectively solve the cooperative rescue problem of multi-agent and ensure the efficient completion of the task.

A new multi-objective optimization model for preventive maintenance and replacement scheduling of multi-component systems

NASA Astrophysics Data System (ADS)

Moghaddam, Kamran S.; Usher, John S.

2011-07-01

In this article, a new multi-objective optimization model is developed to determine the optimal preventive maintenance and replacement schedules in a repairable and maintainable multi-component system. In this model, the planning horizon is divided into discrete and equally-sized periods in which three possible actions must be planned for each component, namely maintenance, replacement, or do nothing. The objective is to determine a plan of actions for each component in the system while minimizing the total cost and maximizing overall system reliability simultaneously over the planning horizon. Because of the complexity, combinatorial and highly nonlinear structure of the mathematical model, two metaheuristic solution methods, generational genetic algorithm, and a simulated annealing are applied to tackle the problem. The Pareto optimal solutions that provide good tradeoffs between the total cost and the overall reliability of the system can be obtained by the solution approach. Such a modeling approach should be useful for maintenance planners and engineers tasked with the problem of developing recommended maintenance plans for complex systems of components.

Children's Strategies for Solving Two- and Three-Dimensional Combinatorial Problems.

ERIC Educational Resources Information Center

English, Lyn D.

1993-01-01

Investigated strategies that 7- to 12-year-old children (n=96) spontaneously applied in solving novel combinatorial problems. With experience in solving two-dimensional problems, children were able to refine their strategies and adapt them to three dimensions. Results on some problems indicated significant effects of age. (Contains 32 references.)…

Human Performance on the Traveling Salesman and Related Problems: A Review

ERIC Educational Resources Information Center

MacGregor, James N.; Chu, Yun

2011-01-01

The article provides a review of recent research on human performance on the traveling salesman problem (TSP) and related combinatorial optimization problems. We discuss what combinatorial optimization problems are, why they are important, and why they may be of interest to cognitive scientists. We next describe the main characteristics of human…

Distributed Evaluation Functions for Fault Tolerant Multi-Rover Systems

NASA Technical Reports Server (NTRS)

Agogino, Adrian; Turner, Kagan

2005-01-01

The ability to evolve fault tolerant control strategies for large collections of agents is critical to the successful application of evolutionary strategies to domains where failures are common. Furthermore, while evolutionary algorithms have been highly successful in discovering single-agent control strategies, extending such algorithms to multiagent domains has proven to be difficult. In this paper we present a method for shaping evaluation functions for agents that provide control strategies that both are tolerant to different types of failures and lead to coordinated behavior in a multi-agent setting. This method neither relies of a centralized strategy (susceptible to single point of failures) nor a distributed strategy where each agent uses a system wide evaluation function (severe credit assignment problem). In a multi-rover problem, we show that agents using our agent-specific evaluation perform up to 500% better than agents using the system evaluation. In addition we show that agents are still able to maintain a high level of performance when up to 60% of the agents fail due to actuator, communication or controller faults.

Lexicographic goal programming and assessment tools for a combinatorial production problem.

DOT National Transportation Integrated Search

2008-01-01

NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques including : heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate : comparison of these solution technique...

An evolutionary strategy based on partial imitation for solving optimization problems

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2016-12-01

In this work we introduce an evolutionary strategy to solve combinatorial optimization tasks, i.e. problems characterized by a discrete search space. In particular, we focus on the Traveling Salesman Problem (TSP), i.e. a famous problem whose search space grows exponentially, increasing the number of cities, up to becoming NP-hard. The solutions of the TSP can be codified by arrays of cities, and can be evaluated by fitness, computed according to a cost function (e.g. the length of a path). Our method is based on the evolution of an agent population by means of an imitative mechanism, we define 'partial imitation'. In particular, agents receive a random solution and then, interacting among themselves, may imitate the solutions of agents with a higher fitness. Since the imitation mechanism is only partial, agents copy only one entry (randomly chosen) of another array (i.e. solution). In doing so, the population converges towards a shared solution, behaving like a spin system undergoing a cooling process, i.e. driven towards an ordered phase. We highlight that the adopted 'partial imitation' mechanism allows the population to generate solutions over time, before reaching the final equilibrium. Results of numerical simulations show that our method is able to find, in a finite time, both optimal and suboptimal solutions, depending on the size of the considered search space.

Steam explosion and its combinatorial pretreatment refining technology of plant biomass to bio-based products.

PubMed

Chen, Hong-Zhang; Liu, Zhi-Hua

2015-06-01

Pretreatment is a key unit operation affecting the refinery efficiency of plant biomass. However, the poor efficiency of pretreatment and the lack of basic theory are the main challenges to the industrial implementation of the plant biomass refinery. The purpose of this work is to review steam explosion and its combinatorial pretreatment as a means of overcoming the intrinsic characteristics of plant biomass, including recalcitrance, heterogeneity, multi-composition, and diversity. The main advantages of the selective use of steam explosion and other combinatorial pretreatments across the diversity of raw materials are introduced. Combinatorial pretreatment integrated with other unit operations is proposed as a means to exploit the high-efficiency production of bio-based products from plant biomass. Finally, several pilot- and demonstration-scale operations of the plant biomass refinery are described. Based on the principle of selective function and structure fractionation, and multi-level and directional composition conversion, an integrated process with the combinatorial pretreatments of steam explosion and other pretreatments as the core should be feasible and conform to the plant biomass refinery concept. Combinatorial pretreatments of steam explosion and other pretreatments should be further exploited based on the type and intrinsic characteristics of the plant biomass used, the bio-based products to be made, and the complementarity of the processes. Copyright © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Students' Verification Strategies for Combinatorial Problems

ERIC Educational Resources Information Center

Mashiach Eizenberg, Michal; Zaslavsky, Orit

2004-01-01

We focus on a major difficulty in solving combinatorial problems, namely, on the verification of a solution. Our study aimed at identifying undergraduate students' tendencies to verify their solutions, and the verification strategies that they employ when solving these problems. In addition, an attempt was made to evaluate the level of efficiency…

Multi-agent cooperation pursuit based on an extension of AALAADIN organisational model

NASA Astrophysics Data System (ADS)

Souidi, Mohammed El Habib; Songhao, Piao; Guo, Li; Lin, Chang

2016-11-01

An approach of cooperative pursuit for multiple mobile targets based on multi-agents system is discussed. In this kind of problem the pursuit process is divided into two kinds of tasks. The first one (coalition problem) is designed to solve the problem of the pursuit team formation. To achieve this mission, we used an innovative method based on a dynamic organisation and reorganisation of the pursuers' groups. We introduce our coalition strategy extended from the organisational agent, group, role model by assigning an access mechanism to the groups inspired by fuzzy logic principles. The second task (motion problem) is the treatment of the pursuers' motion strategy. To manage this problem we applied the principles of the Markov decision process. Simulation results show the feasibility and validity of the given proposal.

Perspective: Stochastic magnetic devices for cognitive computing

NASA Astrophysics Data System (ADS)

Roy, Kaushik; Sengupta, Abhronil; Shim, Yong

2018-06-01

Stochastic switching of nanomagnets can potentially enable probabilistic cognitive hardware consisting of noisy neural and synaptic components. Furthermore, computational paradigms inspired from the Ising computing model require stochasticity for achieving near-optimality in solutions to various types of combinatorial optimization problems such as the Graph Coloring Problem or the Travelling Salesman Problem. Achieving optimal solutions in such problems are computationally exhaustive and requires natural annealing to arrive at the near-optimal solutions. Stochastic switching of devices also finds use in applications involving Deep Belief Networks and Bayesian Inference. In this article, we provide a multi-disciplinary perspective across the stack of devices, circuits, and algorithms to illustrate how the stochastic switching dynamics of spintronic devices in the presence of thermal noise can provide a direct mapping to the computational units of such probabilistic intelligent systems.

Counting Pizza Pieces and Other Combinatorial Problems.

ERIC Educational Resources Information Center

Maier, Eugene

1988-01-01

The general combinatorial problem of counting the number of regions into which the interior of a circle is divided by a family of lines is considered. A general formula is developed and its use is illustrated in two situations. (PK)

Combinatorially-generated library of 6-fluoroquinolone analogs as potential novel antitubercular agents: a chemometric and molecular modeling assessment.

PubMed

Minovski, Nikola; Perdih, Andrej; Solmajer, Tom

2012-05-01

The virtual combinatorial chemistry approach as a methodology for generating chemical libraries of structurally-similar analogs in a virtual environment was employed for building a general mixed virtual combinatorial library with a total of 53.871 6-FQ structural analogs, introducing the real synthetic pathways of three well known 6-FQ inhibitors. The druggability properties of the generated combinatorial 6-FQs were assessed using an in-house developed drug-likeness filter integrating the Lipinski/Veber rule-sets. The compounds recognized as drug-like were used as an external set for prediction of the biological activity values using a neural-networks (NN) model based on an experimentally-determined set of active 6-FQs. Furthermore, a subset of compounds was extracted from the pool of drug-like 6-FQs, with predicted biological activity, and subsequently used in virtual screening (VS) campaign combining pharmacophore modeling and molecular docking studies. This complex scheme, a powerful combination of chemometric and molecular modeling approaches provided novel QSAR guidelines that could aid in the further lead development of 6-FQs agents.

Overtaking method based on sand-sifter mechanism: Why do optimistic value functions find optimal solutions in multi-armed bandit problems?

PubMed

Ochi, Kento; Kamiura, Moto

2015-09-01

A multi-armed bandit problem is a search problem on which a learning agent must select the optimal arm among multiple slot machines generating random rewards. UCB algorithm is one of the most popular methods to solve multi-armed bandit problems. It achieves logarithmic regret performance by coordinating balance between exploration and exploitation. Since UCB algorithms, researchers have empirically known that optimistic value functions exhibit good performance in multi-armed bandit problems. The terms optimistic or optimism might suggest that the value function is sufficiently larger than the sample mean of rewards. The first definition of UCB algorithm is focused on the optimization of regret, and it is not directly based on the optimism of a value function. We need to think the reason why the optimism derives good performance in multi-armed bandit problems. In the present article, we propose a new method, which is called Overtaking method, to solve multi-armed bandit problems. The value function of the proposed method is defined as an upper bound of a confidence interval with respect to an estimator of expected value of reward: the value function asymptotically approaches to the expected value of reward from the upper bound. If the value function is larger than the expected value under the asymptote, then the learning agent is almost sure to be able to obtain the optimal arm. This structure is called sand-sifter mechanism, which has no regrowth of value function of suboptimal arms. It means that the learning agent can play only the current best arm in each time step. Consequently the proposed method achieves high accuracy rate and low regret and some value functions of it can outperform UCB algorithms. This study suggests the advantage of optimism of agents in uncertain environment by one of the simplest frameworks. Copyright © 2015 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.

On the suitability of different representations of solid catalysts for combinatorial library design by genetic algorithms.

PubMed

Gobin, Oliver C; Schüth, Ferdi

2008-01-01

Genetic algorithms are widely used to solve and optimize combinatorial problems and are more often applied for library design in combinatorial chemistry. Because of their flexibility, however, their implementation can be challenging. In this study, the influence of the representation of solid catalysts on the performance of genetic algorithms was systematically investigated on the basis of a new, constrained, multiobjective, combinatorial test problem with properties common to problems in combinatorial materials science. Constraints were satisfied by penalty functions, repair algorithms, or special representations. The tests were performed using three state-of-the-art evolutionary multiobjective algorithms by performing 100 optimization runs for each algorithm and test case. Experimental data obtained during the optimization of a noble metal-free solid catalyst system active in the selective catalytic reduction of nitric oxide with propene was used to build up a predictive model to validate the results of the theoretical test problem. A significant influence of the representation on the optimization performance was observed. Binary encodings were found to be the preferred encoding in most of the cases, and depending on the experimental test unit, repair algorithms or penalty functions performed best.

Tumor-targeting peptides from combinatorial libraries*

PubMed Central

Liu, Ruiwu; Li, Xiaocen; Xiao, Wenwu; Lam, Kit S.

2018-01-01

Cancer is one of the major and leading causes of death worldwide. Two of the greatest challenges infighting cancer are early detection and effective treatments with no or minimum side effects. Widespread use of targeted therapies and molecular imaging in clinics requires high affinity, tumor-specific agents as effective targeting vehicles to deliver therapeutics and imaging probes to the primary or metastatic tumor sites. Combinatorial libraries such as phage-display and one-bead one-compound (OBOC) peptide libraries are powerful approaches in discovering tumor-targeting peptides. This review gives an overview of different combinatorial library technologies that have been used for the discovery of tumor-targeting peptides. Examples of tumor-targeting peptides identified from each combinatorial library method will be discussed. Published tumor-targeting peptide ligands and their applications will also be summarized by the combinatorial library methods and their corresponding binding receptors. PMID:27210583

Quantum Resonance Approach to Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Zak, Michail

1997-01-01

It is shown that quantum resonance can be used for combinatorial optimization. The advantage of the approach is in independence of the computing time upon the dimensionality of the problem. As an example, the solution to a constraint satisfaction problem of exponential complexity is demonstrated.

Towards Cooperative Predictive Data Mining in Competitive Environments

NASA Astrophysics Data System (ADS)

Lisý, Viliam; Jakob, Michal; Benda, Petr; Urban, Štěpán; Pěchouček, Michal

We study the problem of predictive data mining in a competitive multi-agent setting, in which each agent is assumed to have some partial knowledge required for correctly classifying a set of unlabelled examples. The agents are self-interested and therefore need to reason about the trade-offs between increasing their classification accuracy by collaborating with other agents and disclosing their private classification knowledge to other agents through such collaboration. We analyze the problem and propose a set of components which can enable cooperation in this otherwise competitive task. These components include measures for quantifying private knowledge disclosure, data-mining models suitable for multi-agent predictive data mining, and a set of strategies by which agents can improve their classification accuracy through collaboration. The overall framework and its individual components are validated on a synthetic experimental domain.

Social interaction as a heuristic for combinatorial optimization problems

NASA Astrophysics Data System (ADS)

Fontanari, José F.

2010-11-01

We investigate the performance of a variant of Axelrod’s model for dissemination of culture—the Adaptive Culture Heuristic (ACH)—on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents’ strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N1/4 so that the number of agents must increase with the fourth power of the problem size, N∝F4 , to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F6 which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

TARCMO: Theory and Algorithms for Robust, Combinatorial, Multicriteria Optimization

DTIC Science & Technology

2016-11-28

objective 9 4.6 On The Recoverable Robust Traveling Salesman Problem . . . . . 11 4.7 A Bicriteria Approach to Robust Optimization...be found. 4.6 On The Recoverable Robust Traveling Salesman Problem The traveling salesman problem (TSP) is a well-known combinatorial optimiza- tion...procedure for the robust traveling salesman problem . While this iterative algorithms results in an optimal solution to the robust TSP, computation

Consensus pursuit of heterogeneous multi-agent systems under a directed acyclic graph

NASA Astrophysics Data System (ADS)

Yan, Jing; Guan, Xin-Ping; Luo, Xiao-Yuan

2011-04-01

This paper is concerned with the cooperative target pursuit problem by multiple agents based on directed acyclic graph. The target appears at a random location and moves only when sensed by the agents, and agents will pursue the target once they detect its existence. Since the ability of each agent may be different, we consider the heterogeneous multi-agent systems. According to the topology of the multi-agent systems, a novel consensus-based control law is proposed, where the target and agents are modeled as a leader and followers, respectively. Based on Mason's rule and signal flow graph analysis, the convergence conditions are provided to show that the agents can catch the target in a finite time. Finally, simulation studies are provided to verify the effectiveness of the proposed approach.

The construction of combinatorial manifolds with prescribed sets of links of vertices

NASA Astrophysics Data System (ADS)

Gaifullin, A. A.

2008-10-01

To every oriented closed combinatorial manifold we assign the set (with repetitions) of isomorphism classes of links of its vertices. The resulting transformation \\mathcal{L} is the main object of study in this paper. We pose an inversion problem for \\mathcal{L} and show that this problem is closely related to Steenrod's problem on the realization of cycles and to the Rokhlin-Schwartz-Thom construction of combinatorial Pontryagin classes. We obtain a necessary condition for a set of isomorphism classes of combinatorial spheres to belong to the image of \\mathcal{L}. (Sets satisfying this condition are said to be balanced.) We give an explicit construction showing that every balanced set of isomorphism classes of combinatorial spheres falls into the image of \\mathcal{L} after passing to a multiple set and adding several pairs of the form (Z,-Z), where -Z is the sphere Z with the orientation reversed. Given any singular simplicial cycle \\xi of a space X, this construction enables us to find explicitly a combinatorial manifold M and a map \\varphi\\colon M\\to X such that \\varphi_* \\lbrack M \\rbrack =r[\\xi] for some positive integer r. The construction is based on resolving singularities of \\xi. We give applications of the main construction to cobordisms of manifolds with singularities and cobordisms of simple cells. In particular, we prove that every rational additive invariant of cobordisms of manifolds with singularities admits a local formula. Another application is the construction of explicit (though inefficient) local combinatorial formulae for polynomials in the rational Pontryagin classes of combinatorial manifolds.

Modeling of a production system using the multi-agent approach

NASA Astrophysics Data System (ADS)

Gwiazda, A.; Sękala, A.; Banaś, W.

2017-08-01

The method that allows for the analysis of complex systems is a multi-agent simulation. The multi-agent simulation (Agent-based modeling and simulation - ABMS) is modeling of complex systems consisting of independent agents. In the case of the model of the production system agents may be manufactured pieces set apart from other types of agents like machine tools, conveyors or replacements stands. Agents are magazines and buffers. More generally speaking, the agents in the model can be single individuals, but you can also be defined as agents of collective entities. They are allowed hierarchical structures. It means that a single agent could belong to a certain class. Depending on the needs of the agent may also be a natural or physical resource. From a technical point of view, the agent is a bundle of data and rules describing its behavior in different situations. Agents can be autonomous or non-autonomous in making the decision about the types of classes of agents, class sizes and types of connections between elements of the system. Multi-agent modeling is a very flexible technique for modeling and model creating in the convention that could be adapted to any research problem analyzed from different points of views. One of the major problems associated with the organization of production is the spatial organization of the production process. Secondly, it is important to include the optimal scheduling. For this purpose use can approach multi-purposeful. In this regard, the model of the production process will refer to the design and scheduling of production space for four different elements. The program system was developed in the environment NetLogo. It was also used elements of artificial intelligence. The main agent represents the manufactured pieces that, according to previously assumed rules, generate the technological route and allow preprint the schedule of that line. Machine lines, reorientation stands, conveyors and transport devices also represent the other type of agent that are utilized in the described simulation. The article presents the idea of an integrated program approach and shows the resulting production layout as a virtual model. This model was developed in the NetLogo multi-agent program environment.

Spatial Rule-Based Modeling: A Method and Its Application to the Human Mitotic Kinetochore

PubMed Central

Ibrahim, Bashar; Henze, Richard; Gruenert, Gerd; Egbert, Matthew; Huwald, Jan; Dittrich, Peter

2013-01-01

A common problem in the analysis of biological systems is the combinatorial explosion that emerges from the complexity of multi-protein assemblies. Conventional formalisms, like differential equations, Boolean networks and Bayesian networks, are unsuitable for dealing with the combinatorial explosion, because they are designed for a restricted state space with fixed dimensionality. To overcome this problem, the rule-based modeling language, BioNetGen, and the spatial extension, SRSim, have been developed. Here, we describe how to apply rule-based modeling to integrate experimental data from different sources into a single spatial simulation model and how to analyze the output of that model. The starting point for this approach can be a combination of molecular interaction data, reaction network data, proximities, binding and diffusion kinetics and molecular geometries at different levels of detail. We describe the technique and then use it to construct a model of the human mitotic inner and outer kinetochore, including the spindle assembly checkpoint signaling pathway. This allows us to demonstrate the utility of the procedure, show how a novel perspective for understanding such complex systems becomes accessible and elaborate on challenges that arise in the formulation, simulation and analysis of spatial rule-based models. PMID:24709796

A new class of finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2014-02-01

This paper is devoted to investigating the finite-time consensus problem for a multi-agent system in networks with undirected topology. A new class of global continuous time-invariant consensus protocols is constructed for each single-integrator agent dynamics with the aid of Lyapunov functions. In particular, it is shown that the settling time of the proposed new class of finite-time consensus protocols is upper bounded for arbitrary initial conditions. This makes it possible for network consensus problems that the convergence time is designed and estimated offline for a given undirected information flow and a group volume of agents. Finally, a numerical simulation example is presented as a proof of concept.

Minimal Representation and Decision Making for Networked Autonomous Agents

DTIC Science & Technology

2015-08-27

to a multi-vehicle version of the Travelling Salesman Problem (TSP). We further provided a direct formula for computing the number of robots...the sensor. As a first stab at this, the two-agent rendezvous problem is considered where one agent (the target) is equipped with no sensors and is...by the total distance traveled by all agents. For agents with limited sensing and communication capabilities, we give a formula that computes the

IFSM fractal image compression with entropy and sparsity constraints: A sequential quadratic programming approach

NASA Astrophysics Data System (ADS)

Kunze, Herb; La Torre, Davide; Lin, Jianyi

2017-01-01

We consider the inverse problem associated with IFSM: Given a target function f , find an IFSM, such that its fixed point f ¯ is sufficiently close to f in the Lp distance. Forte and Vrscay [1] showed how to reduce this problem to a quadratic optimization model. In this paper, we extend the collage-based method developed by Kunze, La Torre and Vrscay ([2][3][4]), by proposing the minimization of the 1-norm instead of the 0-norm. In fact, optimization problems involving the 0-norm are combinatorial in nature, and hence in general NP-hard. To overcome these difficulties, we introduce the 1-norm and propose a Sequential Quadratic Programming algorithm to solve the corresponding inverse problem. As in Kunze, La Torre and Vrscay [3] in our formulation, the minimization of collage error is treated as a multi-criteria problem that includes three different and conflicting criteria i.e., collage error, entropy and sparsity. This multi-criteria program is solved by means of a scalarization technique which reduces the model to a single-criterion program by combining all objective functions with different trade-off weights. The results of some numerical computations are presented.

Tumor-targeting peptides from combinatorial libraries.

PubMed

Liu, Ruiwu; Li, Xiaocen; Xiao, Wenwu; Lam, Kit S

2017-02-01

Cancer is one of the major and leading causes of death worldwide. Two of the greatest challenges in fighting cancer are early detection and effective treatments with no or minimum side effects. Widespread use of targeted therapies and molecular imaging in clinics requires high affinity, tumor-specific agents as effective targeting vehicles to deliver therapeutics and imaging probes to the primary or metastatic tumor sites. Combinatorial libraries such as phage-display and one-bead one-compound (OBOC) peptide libraries are powerful approaches in discovering tumor-targeting peptides. This review gives an overview of different combinatorial library technologies that have been used for the discovery of tumor-targeting peptides. Examples of tumor-targeting peptides identified from each combinatorial library method will be discussed. Published tumor-targeting peptide ligands and their applications will also be summarized by the combinatorial library methods and their corresponding binding receptors. Copyright © 2017. Published by Elsevier B.V.

Designing Agent Utilities for Coordinated, Scalable and Robust Multi-Agent Systems

NASA Technical Reports Server (NTRS)

Tumer, Kagan

2005-01-01

Coordinating the behavior of a large number of agents to achieve a system level goal poses unique design challenges. In particular, problems of scaling (number of agents in the thousands to tens of thousands), observability (agents have limited sensing capabilities), and robustness (the agents are unreliable) make it impossible to simply apply methods developed for small multi-agent systems composed of reliable agents. To address these problems, we present an approach based on deriving agent goals that are aligned with the overall system goal, and can be computed using information readily available to the agents. Then, each agent uses a simple reinforcement learning algorithm to pursue its own goals. Because of the way in which those goals are derived, there is no need to use difficult to scale external mechanisms to force collaboration or coordination among the agents, or to ensure that agents actively attempt to appropriate the tasks of agents that suffered failures. To present these results in a concrete setting, we focus on the problem of finding the sub-set of a set of imperfect devices that results in the best aggregate device. This is a large distributed agent coordination problem where each agent (e.g., device) needs to determine whether to be part of the aggregate device. Our results show that the approach proposed in this work provides improvements of over an order of magnitude over both traditional search methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents failed midway through the simulation) the system's performance degrades gracefully and still outperforms a failure-free and centralized search algorithm. The results also show that the gains increase as the size of the system (e.g., number of agents) increases. This latter result is particularly encouraging and suggests that this method is ideally suited for domains where the number of agents is currently in the thousands and will reach tens or hundreds of thousands in the near future.

A problem of optimal control and observation for distributed homogeneous multi-agent system

NASA Astrophysics Data System (ADS)

Kruglikov, Sergey V.

2017-12-01

The paper considers the implementation of a algorithm for controlling a distributed complex of several mobile multi-robots. The concept of a unified information space of the controlling system is applied. The presented information and mathematical models of participants and obstacles, as real agents, and goals and scenarios, as virtual agents, create the base forming the algorithmic and software background for computer decision support system. The controlling scheme assumes the indirect management of the robotic team on the basis of optimal control and observation problem predicting intellectual behavior in a dynamic, hostile environment. A basic content problem is a compound cargo transportation by a group of participants in the case of a distributed control scheme in the terrain with multiple obstacles.

A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing.

PubMed

Wang, Lipo; Li, Sa; Tian, Fuyu; Fu, Xiuju

2004-10-01

Recently Chen and Aihara have demonstrated both experimentally and mathematically that their chaotic simulated annealing (CSA) has better search ability for solving combinatorial optimization problems compared to both the Hopfield-Tank approach and stochastic simulated annealing (SSA). However, CSA may not find a globally optimal solution no matter how slowly annealing is carried out, because the chaotic dynamics are completely deterministic. In contrast, SSA tends to settle down to a global optimum if the temperature is reduced sufficiently slowly. Here we combine the best features of both SSA and CSA, thereby proposing a new approach for solving optimization problems, i.e., stochastic chaotic simulated annealing, by using a noisy chaotic neural network. We show the effectiveness of this new approach with two difficult combinatorial optimization problems, i.e., a traveling salesman problem and a channel assignment problem for cellular mobile communications.

Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

DTIC Science & Technology

2015-06-24

WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Arizona State University School of Mathematical & Statistical Sciences 901 S...SUPPLEMENTARY NOTES 14. ABSTRACT The major goals of this project were completed: the exact solution of previously unsolved challenging combinatorial optimization... combinatorial optimization problem, the Directional Sensor Problem, was solved in two ways. First, heuristically in an engineering fashion and second, exactly

Application of Multi-Hypothesis Sequential Monte Carlo for Breakup Analysis

NASA Astrophysics Data System (ADS)

Faber, W. R.; Zaidi, W.; Hussein, I. I.; Roscoe, C. W. T.; Wilkins, M. P.; Schumacher, P. W., Jr.

As more objects are launched into space, the potential for breakup events and space object collisions is ever increasing. These events create large clouds of debris that are extremely hazardous to space operations. Providing timely, accurate, and statistically meaningful Space Situational Awareness (SSA) data is crucial in order to protect assets and operations in space. The space object tracking problem, in general, is nonlinear in both state dynamics and observations, making it ill-suited to linear filtering techniques such as the Kalman filter. Additionally, given the multi-object, multi-scenario nature of the problem, space situational awareness requires multi-hypothesis tracking and management that is combinatorially challenging in nature. In practice, it is often seen that assumptions of underlying linearity and/or Gaussianity are used to provide tractable solutions to the multiple space object tracking problem. However, these assumptions are, at times, detrimental to tracking data and provide statistically inconsistent solutions. This paper details a tractable solution to the multiple space object tracking problem applicable to space object breakup events. Within this solution, simplifying assumptions of the underlying probability density function are relaxed and heuristic methods for hypothesis management are avoided. This is done by implementing Sequential Monte Carlo (SMC) methods for both nonlinear filtering as well as hypothesis management. This goal of this paper is to detail the solution and use it as a platform to discuss computational limitations that hinder proper analysis of large breakup events.

Flocking with connectivity preservation for disturbed nonlinear multi-agent systems by output feedback

NASA Astrophysics Data System (ADS)

Li, Ping; Zhang, Baoyong; Ma, Qian; Xu, Shengyuan; Chen, Weimin; Zhang, Zhengqiang

2018-05-01

This paper considers the problem of flocking with connectivity preservation for a class of disturbed nonlinear multi-agent systems. In order to deal with the nonlinearities in the dynamic of all agents, some auxiliary variables are introduced into the state observer for stability analysis. By proposing a bounded potential function and using adaptive theory, a novel output feedback consensus algorithm is developed to guarantee that the states of all agents achieve flocking with connectivity preservation.

Output Consensus of Heterogeneous Linear Multi-Agent Systems by Distributed Event-Triggered/Self-Triggered Strategy.

PubMed

Hu, Wenfeng; Liu, Lu; Feng, Gang

2016-09-02

This paper addresses the output consensus problem of heterogeneous linear multi-agent systems. We first propose a novel distributed event-triggered control scheme. It is shown that, with the proposed control scheme, the output consensus problem can be solved if two matrix equations are satisfied. Then, we further propose a novel self-triggered control scheme, with which continuous monitoring is avoided. By introducing a fixed timer into both event- and self-triggered control schemes, Zeno behavior can be ruled out for each agent. The effectiveness of the event- and self-triggered control schemes is illustrated by an example.

Multi-agent system as a new approach to effective chronic heart failure management: key considerations.

PubMed

Mohammadzadeh, Niloofar; Safdari, Reza; Rahimi, Azin

2013-09-01

Given the importance of the follow-up of chronic heart failure (CHF) patients to reduce common causes of re-admission and deterioration of their status that lead to imposing spiritual and physical costs on patients and society, modern technology tools should be used to the best advantage. The aim of this article is to explain key points which should be considered in designing an appropriate multi-agent system to improve CHF management. In this literature review articles were searched with keywords like multi-agent system, heart failure, chronic disease management in Science Direct, Google Scholar and PubMed databases without regard to the year of publications. Agents are an innovation in the field of artificial intelligence. Because agents are capable of solving complex and dynamic health problems, to take full advantage of e-Health, the healthcare system must take steps to make use of this technology. Key factors in CHF management through a multi-agent system approach must be considered such as organization, confidentiality in general aspects and design and architecture points in specific aspects. Note that use of agent systems only with a technical view is associated with many problems. Hence, in delivering healthcare to CHF patients, considering social and human aspects is essential. It is obvious that identifying and resolving technical and non-technical challenges is vital in the successful implementation of this technology.

Multi-Agent System as a New Approach to Effective Chronic Heart Failure Management: Key Considerations

PubMed Central

Mohammadzadeh, Niloofar; Rahimi, Azin

2013-01-01

Objectives Given the importance of the follow-up of chronic heart failure (CHF) patients to reduce common causes of re-admission and deterioration of their status that lead to imposing spiritual and physical costs on patients and society, modern technology tools should be used to the best advantage. The aim of this article is to explain key points which should be considered in designing an appropriate multi-agent system to improve CHF management. Methods In this literature review articles were searched with keywords like multi-agent system, heart failure, chronic disease management in Science Direct, Google Scholar and PubMed databases without regard to the year of publications. Results Agents are an innovation in the field of artificial intelligence. Because agents are capable of solving complex and dynamic health problems, to take full advantage of e-Health, the healthcare system must take steps to make use of this technology. Key factors in CHF management through a multi-agent system approach must be considered such as organization, confidentiality in general aspects and design and architecture points in specific aspects. Conclusions Note that use of agent systems only with a technical view is associated with many problems. Hence, in delivering healthcare to CHF patients, considering social and human aspects is essential. It is obvious that identifying and resolving technical and non-technical challenges is vital in the successful implementation of this technology. PMID:24195010

Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

ERIC Educational Resources Information Center

Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie

2008-01-01

Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…

Crossover versus mutation: a comparative analysis of the evolutionary strategy of genetic algorithms applied to combinatorial optimization problems.

PubMed

Osaba, E; Carballedo, R; Diaz, F; Onieva, E; de la Iglesia, I; Perallos, A

2014-01-01

Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test.

Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

PubMed Central

Osaba, E.; Carballedo, R.; Diaz, F.; Onieva, E.; de la Iglesia, I.; Perallos, A.

2014-01-01

Since their first formulation, genetic algorithms (GAs) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GAs is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test. PMID:25165731

A practical approach for active camera coordination based on a fusion-driven multi-agent system

NASA Astrophysics Data System (ADS)

Bustamante, Alvaro Luis; Molina, José M.; Patricio, Miguel A.

2014-04-01

In this paper, we propose a multi-agent system architecture to manage spatially distributed active (or pan-tilt-zoom) cameras. Traditional video surveillance algorithms are of no use for active cameras, and we have to look at different approaches. Such multi-sensor surveillance systems have to be designed to solve two related problems: data fusion and coordinated sensor-task management. Generally, architectures proposed for the coordinated operation of multiple cameras are based on the centralisation of management decisions at the fusion centre. However, the existence of intelligent sensors capable of decision making brings with it the possibility of conceiving alternative decentralised architectures. This problem is approached by means of a MAS, integrating data fusion as an integral part of the architecture for distributed coordination purposes. This paper presents the MAS architecture and system agents.

Characterizing muscular activities using non-negative matrix factorization from EMG channels for driver swings in golf.

PubMed

Ozaki, Yasunori; Aoki, Ryosuke; Kimura, Toshitaka; Takashima, Youichi; Yamada, Tomohiro

2016-08-01

The goal of this study is to propose a data driven approach method to characterize muscular activities of complex actions in sports such as golf from a lot of EMG channels. Two problems occur in a many channel measurement. The first problem is that it takes a lot of time to check the many channel data because of combinatorial explosion. The second problem is that it is difficult to understand muscle activities related with complex actions. To solve these problems, we propose an analysis method of multi EMG channels using Non-negative Matrix Factorization and adopt the method to driver swings in golf. We measured 26 EMG channels about 4 professional coaches of golf. The results show that the proposed method detected 9 muscle synergies and the activation of each synergy were mostly fitted by sigmoid curve (R2=0.85).

Exploiting Quantum Resonance to Solve Combinatorial Problems

NASA Technical Reports Server (NTRS)

Zak, Michail; Fijany, Amir

2006-01-01

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

The Classicist and the Frequentist Approach to Probability within a "TinkerPlots2" Combinatorial Problem

ERIC Educational Resources Information Center

Prodromou, Theodosia

2012-01-01

This article seeks to address a pedagogical theory of introducing the classicist and the frequentist approach to probability, by investigating important elements in 9th grade students' learning process while working with a "TinkerPlots2" combinatorial problem. Results from this research study indicate that, after the students had seen…

An Onto-Semiotic Analysis of Combinatorial Problems and the Solving Processes by University Students

ERIC Educational Resources Information Center

Godino, Juan D.; Batanero, Carmen; Roa, Rafael

2005-01-01

In this paper we describe an ontological and semiotic model for mathematical knowledge, using elementary combinatorics as an example. We then apply this model to analyze the solving process of some combinatorial problems by students with high mathematical training, and show its utility in providing a semiotic explanation for the difficulty of…

Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics

NASA Astrophysics Data System (ADS)

Hartmann, Alexander K.; Weigt, Martin

2005-10-01

A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.

Distributed Drug Discovery, Part 2: Global Rehearsal of Alkylating Agents for the Synthesis of Resin-Bound Unnatural Amino Acids and Virtual D3 Catalog Construction

PubMed Central

2008-01-01

Distributed Drug Discovery (D3) proposes solving large drug discovery problems by breaking them into smaller units for processing at multiple sites. A key component of the synthetic and computational stages of D3 is the global rehearsal of prospective reagents and their subsequent use in the creation of virtual catalogs of molecules accessible by simple, inexpensive combinatorial chemistry. The first section of this article documents the feasibility of the synthetic component of Distributed Drug Discovery. Twenty-four alkylating agents were rehearsed in the United States, Poland, Russia, and Spain, for their utility in the synthesis of resin-bound unnatural amino acids 1, key intermediates in many combinatorial chemistry procedures. This global reagent rehearsal, coupled to virtual library generation, increases the likelihood that any member of that virtual library can be made. It facilitates the realistic integration of worldwide virtual D3 catalog computational analysis with synthesis. The second part of this article describes the creation of the first virtual D3 catalog. It reports the enumeration of 24 416 acylated unnatural amino acids 5, assembled from lists of either rehearsed or well-precedented alkylating and acylating reagents, and describes how the resulting catalog can be freely accessed, searched, and downloaded by the scientific community. PMID:19105725

Inhibition of Hepatitis C Virus Replication by Intracellular Delivery of Multiple siRNAs by Nanosomes

PubMed Central

Chandra, Partha K; Kundu, Anup K; Hazari, Sidhartha; Chandra, Sruti; Bao, Lili; Ooms, Tara; Morris, Gilbert F; Wu, Tong; Mandal, Tarun K; Dash, Srikanta

2012-01-01

Sustained antiviral responses of chronic hepatitis C virus (HCV) infection have improved recently by the use of direct-acting antiviral agents along with interferon (IFN)-α and ribavirin. However, the emergence of drug-resistant variants is expected to be a major problem. We describe here a novel combinatorial small interfering RNA (siRNA) nanosome-based antiviral approach to clear HCV infection. Multiple siRNAs targeted to the highly conserved 5′-untranslated region (UTR) of the HCV genome were synthesized and encapsulated into lipid nanoparticles called nanosomes. We show that siRNA can be repeatedly delivered to 100% of cells in culture using nanosomes without toxicity. Six siRNAs dramatically reduced HCV replication in both the replicon and infectious cell culture model. Repeated treatments with two siRNAs were better than a single siRNA treatment in minimizing the development of an escape mutant, resulting in rapid inhibition of viral replication. Systemic administration of combinatorial siRNA-nanosomes is well tolerated in BALB/c mice without liver injury or histological toxicity. As a proof-of-principle, we showed that systemic injections of siRNA nanosomes significantly reduced HCV replication in a liver tumor-xenotransplant mouse model of HCV. Our results indicate that systemic delivery of combinatorial siRNA nanosomes can be used to minimize the development of escape mutants and inhibition of HCV infection. PMID:22617108

Toward a characterization of landscapes of combinatorial optimization problems, with special attention to the phylogeny problem.

PubMed

Charleston, M A

1995-01-01

This article introduces a coherent language base for describing and working with characteristics of combinatorial optimization problems, which is at once general enough to be used in all such problems and precise enough to allow subtle concepts in this field to be discussed unambiguously. An example is provided of how this nomenclature is applied to an instance of the phylogeny problem. Also noted is the beneficial effect, on the landscape of the solution space, of transforming the observed data to account for multiple changes of character state.

Fuzzy adaptive iterative learning coordination control of second-order multi-agent systems with imprecise communication topology structure

NASA Astrophysics Data System (ADS)

Chen, Jiaxi; Li, Junmin

2018-02-01

In this paper, we investigate the perfect consensus problem for second-order linearly parameterised multi-agent systems (MAS) with imprecise communication topology structure. Takagi-Sugeno (T-S) fuzzy models are presented to describe the imprecise communication topology structure of leader-following MAS, and a distributed adaptive iterative learning control protocol is proposed with the dynamic of leader unknown to any of the agent. The proposed protocol guarantees that the follower agents can track the leader perfectly on [0,T] for the consensus problem. Under alignment condition, a sufficient condition of the consensus for closed-loop MAS is given based on Lyapunov stability theory. Finally, a numerical example and a multiple pendulum system are given to illustrate the effectiveness of the proposed algorithm.

Systematic Identification of Combinatorial Drivers and Targets in Cancer Cell Lines

PubMed Central

Tabchy, Adel; Eltonsy, Nevine; Housman, David E.; Mills, Gordon B.

2013-01-01

There is an urgent need to elicit and validate highly efficacious targets for combinatorial intervention from large scale ongoing molecular characterization efforts of tumors. We established an in silico bioinformatic platform in concert with a high throughput screening platform evaluating 37 novel targeted agents in 669 extensively characterized cancer cell lines reflecting the genomic and tissue-type diversity of human cancers, to systematically identify combinatorial biomarkers of response and co-actionable targets in cancer. Genomic biomarkers discovered in a 141 cell line training set were validated in an independent 359 cell line test set. We identified co-occurring and mutually exclusive genomic events that represent potential drivers and combinatorial targets in cancer. We demonstrate multiple cooperating genomic events that predict sensitivity to drug intervention independent of tumor lineage. The coupling of scalable in silico and biologic high throughput cancer cell line platforms for the identification of co-events in cancer delivers rational combinatorial targets for synthetic lethal approaches with a high potential to pre-empt the emergence of resistance. PMID:23577104

Systematic identification of combinatorial drivers and targets in cancer cell lines.

PubMed

Tabchy, Adel; Eltonsy, Nevine; Housman, David E; Mills, Gordon B

2013-01-01

There is an urgent need to elicit and validate highly efficacious targets for combinatorial intervention from large scale ongoing molecular characterization efforts of tumors. We established an in silico bioinformatic platform in concert with a high throughput screening platform evaluating 37 novel targeted agents in 669 extensively characterized cancer cell lines reflecting the genomic and tissue-type diversity of human cancers, to systematically identify combinatorial biomarkers of response and co-actionable targets in cancer. Genomic biomarkers discovered in a 141 cell line training set were validated in an independent 359 cell line test set. We identified co-occurring and mutually exclusive genomic events that represent potential drivers and combinatorial targets in cancer. We demonstrate multiple cooperating genomic events that predict sensitivity to drug intervention independent of tumor lineage. The coupling of scalable in silico and biologic high throughput cancer cell line platforms for the identification of co-events in cancer delivers rational combinatorial targets for synthetic lethal approaches with a high potential to pre-empt the emergence of resistance.

Seeking better topical delivery technologies of moisturizing agents for enhanced skin moisturization.

PubMed

Kim, Hyeongmin; Kim, Jeong Tae; Barua, Sonia; Yoo, Seung-Yup; Hong, Seong-Chul; Lee, Kyung Bin; Lee, Jaehwi

2018-01-01

An adequate hydration level is essential to maintain epidermal barrier functions and normal physiological activities of skin tissues. Diverse moisturizing agents and pharmaceutical formulations for dermal deliveries have thus extensively been investigated. This review comprehensively discusses scientific outcomes of moisturizing agents and pharmaceutical vehicles for skin moisturization, thereby providing insight into designing innovative pharmaceutical formulations for effective skin moisturization. Areas covered: We discussed the functions of various moisturizing agents ranging from conventional creams to novel moisturizers which has recently been explored. In addition, novel pharmaceutical formulations for efficient dermal delivery of the moisturizers, in particular, nanocarriers, were discussed along with their uses in commercial products. Expert opinion: Although various moisturizing agents have demonstrated their promising effects, exploitation of pharmaceutical formulations for their dermal delivery have been limited to few commonly used moisturizing agents. Thus, combinatorial investigation of novel moisturizers and pharmaceutical vehicles should be further conducted. As a new concept for improving skin moisturization, skin regeneration technologies using therapeutic cells have recently shown great promise for skin moisturization, but major challenges remain, such as efficient delivery and prolonged survival of such cells. Thus, novel approaches for improving skin moisturization require continuous efforts of pharmaceutical scientists to address the remaining problems.

Combinatorial Multiobjective Optimization Using Genetic Algorithms

NASA Technical Reports Server (NTRS)

Crossley, William A.; Martin. Eric T.

2002-01-01

The research proposed in this document investigated multiobjective optimization approaches based upon the Genetic Algorithm (GA). Several versions of the GA have been adopted for multiobjective design, but, prior to this research, there had not been significant comparisons of the most popular strategies. The research effort first generalized the two-branch tournament genetic algorithm in to an N-branch genetic algorithm, then the N-branch GA was compared with a version of the popular Multi-Objective Genetic Algorithm (MOGA). Because the genetic algorithm is well suited to combinatorial (mixed discrete / continuous) optimization problems, the GA can be used in the conceptual phase of design to combine selection (discrete variable) and sizing (continuous variable) tasks. Using a multiobjective formulation for the design of a 50-passenger aircraft to meet the competing objectives of minimizing takeoff gross weight and minimizing trip time, the GA generated a range of tradeoff designs that illustrate which aircraft features change from a low-weight, slow trip-time aircraft design to a heavy-weight, short trip-time aircraft design. Given the objective formulation and analysis methods used, the results of this study identify where turboprop-powered aircraft and turbofan-powered aircraft become more desirable for the 50 seat passenger application. This aircraft design application also begins to suggest how a combinatorial multiobjective optimization technique could be used to assist in the design of morphing aircraft.

Emerging medical informatics with case-based reasoning for aiding clinical decision in multi-agent system.

PubMed

Shen, Ying; Colloc, Joël; Jacquet-Andrieu, Armelle; Lei, Kai

2015-08-01

This research aims to depict the methodological steps and tools about the combined operation of case-based reasoning (CBR) and multi-agent system (MAS) to expose the ontological application in the field of clinical decision support. The multi-agent architecture works for the consideration of the whole cycle of clinical decision-making adaptable to many medical aspects such as the diagnosis, prognosis, treatment, therapeutic monitoring of gastric cancer. In the multi-agent architecture, the ontological agent type employs the domain knowledge to ease the extraction of similar clinical cases and provide treatment suggestions to patients and physicians. Ontological agent is used for the extension of domain hierarchy and the interpretation of input requests. Case-based reasoning memorizes and restores experience data for solving similar problems, with the help of matching approach and defined interfaces of ontologies. A typical case is developed to illustrate the implementation of the knowledge acquisition and restitution of medical experts. Copyright © 2015 Elsevier Inc. All rights reserved.

Adaptive tracking control of leader-following linear multi-agent systems with external disturbances

NASA Astrophysics Data System (ADS)

Lin, Hanquan; Wei, Qinglai; Liu, Derong; Ma, Hongwen

2016-10-01

In this paper, the consensus problem for leader-following linear multi-agent systems with external disturbances is investigated. Brownian motions are used to describe exogenous disturbances. A distributed tracking controller based on Riccati inequalities with an adaptive law for adjusting coupling weights between neighbouring agents is designed for leader-following multi-agent systems under fixed and switching topologies. In traditional distributed static controllers, the coupling weights depend on the communication graph. However, coupling weights associated with the feedback gain matrix in our method are updated by state errors between neighbouring agents. We further present the stability analysis of leader-following multi-agent systems with stochastic disturbances under switching topology. Most traditional literature requires the graph to be connected all the time, while the communication graph is only assumed to be jointly connected in this paper. The design technique is based on Riccati inequalities and algebraic graph theory. Finally, simulations are given to show the validity of our method.

Switched Systems and Motion Coordination: Combinatorial Challenges

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.

2016-01-01

Problems of routing commercial air traffic in a terminal airspace encounter different constraints: separation assurance, aircraft performance limitations, regulations. The general setting of these problems is that of a switched control system. Such a system combines the differentiable motion of the aircraft with the combinatorial choices of choosing precedence when traffic routes merge and choosing branches when the routes diverge. This presentation gives an overview of the problem, the ATM context, related literature, and directions for future research.

Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.

PubMed

Coelho, V N; Coelho, I M; Souza, M J F; Oliveira, T A; Cota, L P; Haddad, M N; Mladenovic, N; Silva, R C P; Guimarães, F G

2016-01-01

This article presents an Evolution Strategy (ES)--based algorithm, designed to self-adapt its mutation operators, guiding the search into the solution space using a Self-Adaptive Reduced Variable Neighborhood Search procedure. In view of the specific local search operators for each individual, the proposed population-based approach also fits into the context of the Memetic Algorithms. The proposed variant uses the Greedy Randomized Adaptive Search Procedure with different greedy parameters for generating its initial population, providing an interesting exploration-exploitation balance. To validate the proposal, this framework is applied to solve three different [Formula: see text]-Hard combinatorial optimization problems: an Open-Pit-Mining Operational Planning Problem with dynamic allocation of trucks, an Unrelated Parallel Machine Scheduling Problem with Setup Times, and the calibration of a hybrid fuzzy model for Short-Term Load Forecasting. Computational results point out the convergence of the proposed model and highlight its ability in combining the application of move operations from distinct neighborhood structures along the optimization. The results gathered and reported in this article represent a collective evidence of the performance of the method in challenging combinatorial optimization problems from different application domains. The proposed evolution strategy demonstrates an ability of adapting the strength of the mutation disturbance during the generations of its evolution process. The effectiveness of the proposal motivates the application of this novel evolutionary framework for solving other combinatorial optimization problems.

XML Encoding of Features Describing Rule-Based Modeling of Reaction Networks with Multi-Component Molecular Complexes

PubMed Central

Blinov, Michael L.; Moraru, Ion I.

2011-01-01

Multi-state molecules and multi-component complexes are commonly involved in cellular signaling. Accounting for molecules that have multiple potential states, such as a protein that may be phosphorylated on multiple residues, and molecules that combine to form heterogeneous complexes located among multiple compartments, generates an effect of combinatorial complexity. Models involving relatively few signaling molecules can include thousands of distinct chemical species. Several software tools (StochSim, BioNetGen) are already available to deal with combinatorial complexity. Such tools need information standards if models are to be shared, jointly evaluated and developed. Here we discuss XML conventions that can be adopted for modeling biochemical reaction networks described by user-specified reaction rules. These could form a basis for possible future extensions of the Systems Biology Markup Language (SBML). PMID:21464833

Multi-agent grid system Agent-GRID with dynamic load balancing of cluster nodes

NASA Astrophysics Data System (ADS)

Satymbekov, M. N.; Pak, I. T.; Naizabayeva, L.; Nurzhanov, Ch. A.

2017-12-01

In this study the work presents the system designed for automated load balancing of the contributor by analysing the load of compute nodes and the subsequent migration of virtual machines from loaded nodes to less loaded ones. This system increases the performance of cluster nodes and helps in the timely processing of data. A grid system balances the work of cluster nodes the relevance of the system is the award of multi-agent balancing for the solution of such problems.

A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm

NASA Astrophysics Data System (ADS)

Zheng, Genrang; Lin, ZhengChun

The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. A Hybrid Artificial Fish Swarm Algorithm(HAFSA), which is combined with First Suite Heuristic Algorithm (FSHA) and Artificial Fish Swarm Algorithm (AFSA), is proposed to solve the problem after probing it base on the theories of AFSA. Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. Compared with Ant colony Optimization Algorithm, it has a good performance with broad and prosperous application.

Antibacterial and synergy of berberines with antibacterial agents against clinical multi-drug resistant isolates of methicillin-resistant Staphylococcus aureus (MRSA).

PubMed

Zuo, Guo-Ying; Li, Yang; Han, Jun; Wang, Gen-Chun; Zhang, Yun-Ling; Bian, Zhong-Qi

2012-08-29

Antibacterial activity of berberine (Ber) and 8-acetonyl-dihydroberberine (A-Ber) alone and combined uses with antibacterial agents ampicillin (AMP), azithromycin (AZM), cefazolin (CFZ) and levofloxacin (LEV) was studied on 10 clinical isolates of SCCmec III type methicillin-resistant Staphylococcus aureus (MRSA). Susceptibility to each agent alone was tested using a broth microdilution method and the chequerboard and time-kill tests for the combined evaluations, respectively. The alone MICs/MBCs (μg/mL) ranges were 32-128/64-256 (Ber) and 32-128/128-512 (A-Ber). Significant synergies were observed for the Ber (A-Ber)/AZM and Ber (A-Ber)/LEV combinations against 90% of the tested MRSA strains, with fractional inhibitory concentration indices (FICIs) values ranged from 0.188 to 0.500. An additivity result was also observed for the Ber/AZM combination by time-kill curves. These results demonstrated for the first time that Ber and A-Ber enhanced the in vitro inhibitory efficacy of AZM and LEV to a same extent, which had potential for further investigation in combinatory therapeutic applications of patients infected with MRSA.

Research on monitoring system of water resources in Shiyang River Basin based on Multi-agent

NASA Astrophysics Data System (ADS)

Zhao, T. H.; Yin, Z.; Song, Y. Z.

2012-11-01

The Shiyang River Basin is the most populous, economy relatively develop, the highest degree of development and utilization of water resources, water conflicts the most prominent, ecological environment problems of the worst hit areas in Hexi inland river basin in Gansu province. the contradiction between people and water is aggravated constantly in the basin. This text combines multi-Agent technology with monitoring system of water resource, the establishment of a management center, telemetry Agent Federation, as well as the communication network between the composition of the Shiyang River Basin water resources monitoring system. By taking advantage of multi-agent system intelligence and communications coordination to improve the timeliness of the basin water resources monitoring.

Tug-Of-War Model for Two-Bandit Problem

NASA Astrophysics Data System (ADS)

Kim, Song-Ju; Aono, Masashi; Hara, Masahiko

The amoeba of the true slime mold Physarum polycephalum shows high computational capabilities. In the so-called amoeba-based computing, some computing tasks including combinatorial optimization are performed by the amoeba instead of a digital computer. We expect that there must be problems living organisms are good at solving. The “multi-armed bandit problem” would be the one of such problems. Consider a number of slot machines. Each of the machines has an arm which gives a player a reward with a certain probability when pulled. The problem is to determine the optimal strategy for maximizing the total reward sum after a certain number of trials. To maximize the total reward sum, it is necessary to judge correctly and quickly which machine has the highest reward probability. Therefore, the player should explore many machines to gather much knowledge on which machine is the best, but should not fail to exploit the reward from the known best machine. We consider that living organisms follow some efficient method to solve the problem.

Distributed event-triggered consensus tracking of second-order multi-agent systems with a virtual leader

NASA Astrophysics Data System (ADS)

Jie, Cao; Zhi-Hai, Wu; Li, Peng

2016-05-01

This paper investigates the consensus tracking problems of second-order multi-agent systems with a virtual leader via event-triggered control. A novel distributed event-triggered transmission scheme is proposed, which is intermittently examined at constant sampling instants. Only partial neighbor information and local measurements are required for event detection. Then the corresponding event-triggered consensus tracking protocol is presented to guarantee second-order multi-agent systems to achieve consensus tracking. Numerical simulations are given to illustrate the effectiveness of the proposed strategy. Project supported by the National Natural Science Foundation of China (Grant Nos. 61203147, 61374047, and 61403168).

Human-Robot Teaming in a Multi-Agent Space Assembly Task

NASA Technical Reports Server (NTRS)

Rehnmark, Fredrik; Currie, Nancy; Ambrose, Robert O.; Culbert, Christopher

2004-01-01

NASA's Human Space Flight program depends heavily on spacewalks performed by pairs of suited human astronauts. These Extra-Vehicular Activities (EVAs) are severely restricted in both duration and scope by consumables and available manpower. An expanded multi-agent EVA team combining the information-gathering and problem-solving skills of humans with the survivability and physical capabilities of robots is proposed and illustrated by example. Such teams are useful for large-scale, complex missions requiring dispersed manipulation, locomotion and sensing capabilities. To study collaboration modalities within a multi-agent EVA team, a 1-g test is conducted with humans and robots working together in various supporting roles.

Distributed-observer-based cooperative control for synchronization of linear discrete-time multi-agent systems.

PubMed

Liang, Hongjing; Zhang, Huaguang; Wang, Zhanshan

2015-11-01

This paper considers output synchronization of discrete-time multi-agent systems with directed communication topologies. The directed communication graph contains a spanning tree and the exosystem as its root. Distributed observer-based consensus protocols are proposed, based on the relative outputs of neighboring agents. A multi-step algorithm is presented to construct the observer-based protocols. In light of the discrete-time algebraic Riccati equation and internal model principle, synchronization problem is completed. At last, numerical simulation is provided to verify the effectiveness of the theoretical results. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Focusing on the golden ball metaheuristic: an extended study on a wider set of problems.

PubMed

Osaba, E; Diaz, F; Carballedo, R; Onieva, E; Perallos, A

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results.

Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

PubMed Central

Osaba, E.; Diaz, F.; Carballedo, R.; Onieva, E.; Perallos, A.

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results. PMID:25165742

The sampled-data consensus of multi-agent systems with probabilistic time-varying delays and packet losses

NASA Astrophysics Data System (ADS)

Sui, Xin; Yang, Yongqing; Xu, Xianyun; Zhang, Shuai; Zhang, Lingzhong

2018-02-01

This paper investigates the consensus of multi-agent systems with probabilistic time-varying delays and packet losses via sampled-data control. On the one hand, a Bernoulli-distributed white sequence is employed to model random packet losses among agents. On the other hand, a switched system is used to describe packet dropouts in a deterministic way. Based on the special property of the Laplacian matrix, the consensus problem can be converted into a stabilization problem of a switched system with lower dimensions. Some mean square consensus criteria are derived in terms of constructing an appropriate Lyapunov function and using linear matrix inequalities (LMIs). Finally, two numerical examples are given to show the effectiveness of the proposed method.

Aerospace applications of integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in solving combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on a large space structure and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

One step DNA assembly for combinatorial metabolic engineering.

PubMed

Coussement, Pieter; Maertens, Jo; Beauprez, Joeri; Van Bellegem, Wouter; De Mey, Marjan

2014-05-01

The rapid and efficient assembly of multi-step metabolic pathways for generating microbial strains with desirable phenotypes is a critical procedure for metabolic engineering, and remains a significant challenge in synthetic biology. Although several DNA assembly methods have been developed and applied for metabolic pathway engineering, many of them are limited by their suitability for combinatorial pathway assembly. The introduction of transcriptional (promoters), translational (ribosome binding site (RBS)) and enzyme (mutant genes) variability to modulate pathway expression levels is essential for generating balanced metabolic pathways and maximizing the productivity of a strain. We report a novel, highly reliable and rapid single strand assembly (SSA) method for pathway engineering. The method was successfully optimized and applied to create constructs containing promoter, RBS and/or mutant enzyme libraries. To demonstrate its efficiency and reliability, the method was applied to fine-tune multi-gene pathways. Two promoter libraries were simultaneously introduced in front of two target genes, enabling orthogonal expression as demonstrated by principal component analysis. This shows that SSA will increase our ability to tune multi-gene pathways at all control levels for the biotechnological production of complex metabolites, achievable through the combinatorial modulation of transcription, translation and enzyme activity. Copyright © 2014 International Metabolic Engineering Society. Published by Elsevier Inc. All rights reserved.

A hybrid, auto-adaptive and rule-based multi-agent approach using evolutionary algorithms for improved searching

NASA Astrophysics Data System (ADS)

Izquierdo, Joaquín; Montalvo, Idel; Campbell, Enrique; Pérez-García, Rafael

2016-08-01

Selecting the most appropriate heuristic for solving a specific problem is not easy, for many reasons. This article focuses on one of these reasons: traditionally, the solution search process has operated in a given manner regardless of the specific problem being solved, and the process has been the same regardless of the size, complexity and domain of the problem. To cope with this situation, search processes should mould the search into areas of the search space that are meaningful for the problem. This article builds on previous work in the development of a multi-agent paradigm using techniques derived from knowledge discovery (data-mining techniques) on databases of so-far visited solutions. The aim is to improve the search mechanisms, increase computational efficiency and use rules to enrich the formulation of optimization problems, while reducing the search space and catering to realistic problems.

Consensus for linear multi-agent system with intermittent information transmissions using the time-scale theory

NASA Astrophysics Data System (ADS)

Taousser, Fatima; Defoort, Michael; Djemai, Mohamed

2016-01-01

This paper investigates the consensus problem for linear multi-agent system with fixed communication topology in the presence of intermittent communication using the time-scale theory. Since each agent can only obtain relative local information intermittently, the proposed consensus algorithm is based on a discontinuous local interaction rule. The interaction among agents happens at a disjoint set of continuous-time intervals. The closed-loop multi-agent system can be represented using mixed linear continuous-time and linear discrete-time models due to intermittent information transmissions. The time-scale theory provides a powerful tool to combine continuous-time and discrete-time cases and study the consensus protocol under a unified framework. Using this theory, some conditions are derived to achieve exponential consensus under intermittent information transmissions. Simulations are performed to validate the theoretical results.

Adapting an Ant Colony Metaphor for Multi-Robot Chemical Plume Tracing

PubMed Central

Meng, Qing-Hao; Yang, Wei-Xing; Wang, Yang; Li, Fei; Zeng, Ming

2012-01-01

We consider chemical plume tracing (CPT) in time-varying airflow environments using multiple mobile robots. The purpose of CPT is to approach a gas source with a previously unknown location in a given area. Therefore, the CPT could be considered as a dynamic optimization problem in continuous domains. The traditional ant colony optimization (ACO) algorithm has been successfully used for combinatorial optimization problems in discrete domains. To adapt the ant colony metaphor to the multi-robot CPT problem, the two-dimension continuous search area is discretized into grids and the virtual pheromone is updated according to both the gas concentration and wind information. To prevent the adapted ACO algorithm from being prematurely trapped in a local optimum, the upwind surge behavior is adopted by the robots with relatively higher gas concentration in order to explore more areas. The spiral surge (SS) algorithm is also examined for comparison. Experimental results using multiple real robots in two indoor natural ventilated airflow environments show that the proposed CPT method performs better than the SS algorithm. The simulation results for large-scale advection-diffusion plume environments show that the proposed method could also work in outdoor meandering plume environments. PMID:22666056

Adapting an ant colony metaphor for multi-robot chemical plume tracing.

PubMed

Meng, Qing-Hao; Yang, Wei-Xing; Wang, Yang; Li, Fei; Zeng, Ming

2012-01-01

We consider chemical plume tracing (CPT) in time-varying airflow environments using multiple mobile robots. The purpose of CPT is to approach a gas source with a previously unknown location in a given area. Therefore, the CPT could be considered as a dynamic optimization problem in continuous domains. The traditional ant colony optimization (ACO) algorithm has been successfully used for combinatorial optimization problems in discrete domains. To adapt the ant colony metaphor to the multi-robot CPT problem, the two-dimension continuous search area is discretized into grids and the virtual pheromone is updated according to both the gas concentration and wind information. To prevent the adapted ACO algorithm from being prematurely trapped in a local optimum, the upwind surge behavior is adopted by the robots with relatively higher gas concentration in order to explore more areas. The spiral surge (SS) algorithm is also examined for comparison. Experimental results using multiple real robots in two indoor natural ventilated airflow environments show that the proposed CPT method performs better than the SS algorithm. The simulation results for large-scale advection-diffusion plume environments show that the proposed method could also work in outdoor meandering plume environments.

On the existence of binary simplex codes. [using combinatorial construction

NASA Technical Reports Server (NTRS)

Taylor, H.

1977-01-01

Using a simple combinatorial construction, the existence of a binary simplex code with m codewords for all m is greater than or equal to 1 is proved. The problem of the shortest possible length is left open.

Construction of multi-agent mobile robots control system in the problem of persecution with using a modified reinforcement learning method based on neural networks

NASA Astrophysics Data System (ADS)

Patkin, M. L.; Rogachev, G. N.

2018-02-01

A method for constructing a multi-agent control system for mobile robots based on training with reinforcement using deep neural networks is considered. Synthesis of the management system is proposed to be carried out with reinforcement training and the modified Actor-Critic method, in which the Actor module is divided into Action Actor and Communication Actor in order to simultaneously manage mobile robots and communicate with partners. Communication is carried out by sending partners at each step a vector of real numbers that are added to the observation vector and affect the behaviour. Functions of Actors and Critic are approximated by deep neural networks. The Critics value function is trained by using the TD-error method and the Actor’s function by using DDPG. The Communication Actor’s neural network is trained through gradients received from partner agents. An environment in which a cooperative multi-agent interaction is present was developed, computer simulation of the application of this method in the control problem of two robots pursuing two goals was carried out.

Balancing focused combinatorial libraries based on multiple GPCR ligands

NASA Astrophysics Data System (ADS)

Soltanshahi, Farhad; Mansley, Tamsin E.; Choi, Sun; Clark, Robert D.

2006-08-01

G-Protein coupled receptors (GPCRs) are important targets for drug discovery, and combinatorial chemistry is an important tool for pharmaceutical development. The absence of detailed structural information, however, limits the kinds of combinatorial design techniques that can be applied to GPCR targets. This is particularly problematic given the current emphasis on focused combinatorial libraries. By linking an incremental construction method (OptDesign) to the very fast shape-matching capability of ChemSpace, we have created an efficient method for designing targeted sublibraries that are topomerically similar to known actives. Multi-objective scoring allows consideration of multiple queries (actives) simultaneously. This can lead to a distribution of products skewed towards one particular query structure, however, particularly when the ligands of interest are quite dissimilar to one another. A novel pivoting technique is described which makes it possible to generate promising designs even under those circumstances. The approach is illustrated by application to some serotonergic agonists and chemokine antagonists.

Single agent and synergistic combinatorial efficacy of first-in-class small molecule imipridone ONC201 in hematological malignancies.

PubMed

Prabhu, Varun V; Talekar, Mala K; Lulla, Amriti R; Kline, C Leah B; Zhou, Lanlan; Hall, Junior; Van den Heuvel, A Pieter J; Dicker, David T; Babar, Jawad; Grupp, Stephan A; Garnett, Mathew J; McDermott, Ultan; Benes, Cyril H; Pu, Jeffrey J; Claxton, David F; Khan, Nadia; Oster, Wolfgang; Allen, Joshua E; El-Deiry, Wafik S

2018-01-01

ONC201, founding member of the imipridone class of small molecules, is currently being evaluated in advancer cancer clinical trials. We explored single agent and combinatorial efficacy of ONC201 in preclinical models of hematological malignancies. ONC201 demonstrated (GI50 1-8 µM) dose- and time-dependent efficacy in acute myeloid leukemia (AML), acute lymphoblastic leukemia (ALL), chronic myelogenous leukemia (CML), chronic lymphocytic leukemia (CLL), diffuse large B-cell lymphoma (DLBCL), mantle cell lymphoma (MCL), Burkitt's lymphoma, anaplastic large cell lymphoma (ALCL), cutaneous T-cell lymphoma (CTCL), Hodgkin's lymphoma (nodular sclerosis) and multiple myeloma (MM) cell lines including cells resistant to standard of care (dexamethasone in MM) and primary samples. ONC201 induced caspase-dependent apoptosis that involved activation of the integrated stress response (ATF4/CHOP) pathway, inhibition of Akt phosphorylation, Foxo3a activation, downregulation of cyclin D1, IAP and Bcl-2 family members. ONC201 synergistically reduced cell viability in combination with cytarabine and 5-azacytidine in AML cells. ONC201 combined with cytarabine in a Burkitt's lymphoma xenograft model induced tumor growth inhibition that was superior to either agent alone. ONC201 synergistically combined with bortezomib in MM, MCL and ALCL cells and with ixazomib or dexamethasone in MM cells. ONC201 combined with bortezomib in a Burkitt's lymphoma xenograft model reduced tumor cell density and improved CHOP induction compared to either agent alone. These results serve as a rationale for ONC201 single-agent trials in relapsed/refractory acute leukemia, non-Hodgkin's lymphoma, MM and combination trial with dexamethasone in MM, provide pharmacodynamic biomarkers and identify further synergistic combinatorial regimens that can be explored in the clinic.

Efficient Evaluation Functions for Multi-Rover Systems

NASA Technical Reports Server (NTRS)

Agogino, Adrian; Tumer, Kagan

2004-01-01

Evolutionary computation can be a powerful tool in cresting a control policy for a single agent receiving local continuous input. This paper extends single-agent evolutionary computation to multi-agent systems, where a collection of agents strives to maximize a global fitness evaluation function that rates the performance of the entire system. This problem is solved in a distributed manner, where each agent evolves its own population of neural networks that are used as the control policies for the agent. Each agent evolves its population using its own agent-specific fitness evaluation function. We propose to create these agent-specific evaluation functions using the theory of collectives to avoid the coordination problem where each agent evolves a population that maximizes its own fitness function, yet the system has a whole achieves low values of the global fitness function. Instead we will ensure that each fitness evaluation function is both "aligned" with the global evaluation function and is "learnable," i.e., the agents can readily see how their behavior affects their evaluation function. We then show how these agent-specific evaluation functions outperform global evaluation methods by up to 600% in a domain where a set of rovers attempt to maximize the amount of information observed while navigating through a simulated environment.

Statistical mechanics of competitive resource allocation using agent-based models

NASA Astrophysics Data System (ADS)

Chakraborti, Anirban; Challet, Damien; Chatterjee, Arnab; Marsili, Matteo; Zhang, Yi-Cheng; Chakrabarti, Bikas K.

2015-01-01

Demand outstrips available resources in most situations, which gives rise to competition, interaction and learning. In this article, we review a broad spectrum of multi-agent models of competition (El Farol Bar problem, Minority Game, Kolkata Paise Restaurant problem, Stable marriage problem, Parking space problem and others) and the methods used to understand them analytically. We emphasize the power of concepts and tools from statistical mechanics to understand and explain fully collective phenomena such as phase transitions and long memory, and the mapping between agent heterogeneity and physical disorder. As these methods can be applied to any large-scale model of competitive resource allocation made up of heterogeneous adaptive agent with non-linear interaction, they provide a prospective unifying paradigm for many scientific disciplines.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.

PubMed

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods.

Multi-objective optimization of radiotherapy: distributed Q-learning and agent-based simulation

NASA Astrophysics Data System (ADS)

Jalalimanesh, Ammar; Haghighi, Hamidreza Shahabi; Ahmadi, Abbas; Hejazian, Hossein; Soltani, Madjid

2017-09-01

Radiotherapy (RT) is among the regular techniques for the treatment of cancerous tumours. Many of cancer patients are treated by this manner. Treatment planning is the most important phase in RT and it plays a key role in therapy quality achievement. As the goal of RT is to irradiate the tumour with adequately high levels of radiation while sparing neighbouring healthy tissues as much as possible, it is a multi-objective problem naturally. In this study, we propose an agent-based model of vascular tumour growth and also effects of RT. Next, we use multi-objective distributed Q-learning algorithm to find Pareto-optimal solutions for calculating RT dynamic dose. We consider multiple objectives and each group of optimizer agents attempt to optimise one of them, iteratively. At the end of each iteration, agents compromise the solutions to shape the Pareto-front of multi-objective problem. We propose a new approach by defining three schemes of treatment planning created based on different combinations of our objectives namely invasive, conservative and moderate. In invasive scheme, we enforce killing cancer cells and pay less attention about irradiation effects on normal cells. In conservative scheme, we take more care of normal cells and try to destroy cancer cells in a less stressed manner. The moderate scheme stands in between. For implementation, each of these schemes is handled by one agent in MDQ-learning algorithm and the Pareto optimal solutions are discovered by the collaboration of agents. By applying this methodology, we could reach Pareto treatment plans through building different scenarios of tumour growth and RT. The proposed multi-objective optimisation algorithm generates robust solutions and finds the best treatment plan for different conditions.

Distributed Cooperation Solution Method of Complex System Based on MAS

NASA Astrophysics Data System (ADS)

Weijin, Jiang; Yuhui, Xu

To adapt the model in reconfiguring fault diagnosing to dynamic environment and the needs of solving the tasks of complex system fully, the paper introduced multi-Agent and related technology to the complicated fault diagnosis, an integrated intelligent control system is studied in this paper. Based on the thought of the structure of diagnostic decision and hierarchy in modeling, based on multi-layer decomposition strategy of diagnosis task, a multi-agent synchronous diagnosis federation integrated different knowledge expression modes and inference mechanisms are presented, the functions of management agent, diagnosis agent and decision agent are analyzed, the organization and evolution of agents in the system are proposed, and the corresponding conflict resolution algorithm in given, Layered structure of abstract agent with public attributes is build. System architecture is realized based on MAS distributed layered blackboard. The real world application shows that the proposed control structure successfully solves the fault diagnose problem of the complex plant, and the special advantage in the distributed domain.

Ultra-fast consensus of discrete-time multi-agent systems with multi-step predictive output feedback

NASA Astrophysics Data System (ADS)

Zhang, Wenle; Liu, Jianchang

2016-04-01

This article addresses the ultra-fast consensus problem of high-order discrete-time multi-agent systems based on a unified consensus framework. A novel multi-step predictive output mechanism is proposed under a directed communication topology containing a spanning tree. By predicting the outputs of a network several steps ahead and adding this information into the consensus protocol, it is shown that the asymptotic convergence factor is improved by a power of q + 1 compared to the routine consensus. The difficult problem of selecting the optimal control gain is solved well by introducing a variable called convergence step. In addition, the ultra-fast formation achievement is studied on the basis of this new consensus protocol. Finally, the ultra-fast consensus with respect to a reference model and robust consensus is discussed. Some simulations are performed to illustrate the effectiveness of the theoretical results.

Efficient 3D multi-region prostate MRI segmentation using dual optimization.

PubMed

Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron

2013-01-01

Efficient and accurate extraction of the prostate, in particular its clinically meaningful sub-regions from 3D MR images, is of great interest in image-guided prostate interventions and diagnosis of prostate cancer. In this work, we propose a novel multi-region segmentation approach to simultaneously locating the boundaries of the prostate and its two major sub-regions: the central gland and the peripheral zone. The proposed method utilizes the prior knowledge of the spatial region consistency and employs a customized prostate appearance model to simultaneously segment multiple clinically meaningful regions. We solve the resulted challenging combinatorial optimization problem by means of convex relaxation, for which we introduce a novel spatially continuous flow-maximization model and demonstrate its duality to the investigated convex relaxed optimization problem with the region consistency constraint. Moreover, the proposed continuous max-flow model naturally leads to a new and efficient continuous max-flow based algorithm, which enjoys great advantages in numerics and can be readily implemented on GPUs. Experiments using 15 T2-weighted 3D prostate MR images, by inter- and intra-operator variability, demonstrate the promising performance of the proposed approach.

Observer-based distributed adaptive iterative learning control for linear multi-agent systems

NASA Astrophysics Data System (ADS)

Li, Jinsha; Liu, Sanyang; Li, Junmin

2017-10-01

This paper investigates the consensus problem for linear multi-agent systems from the viewpoint of two-dimensional systems when the state information of each agent is not available. Observer-based fully distributed adaptive iterative learning protocol is designed in this paper. A local observer is designed for each agent and it is shown that without using any global information about the communication graph, all agents achieve consensus perfectly for all undirected connected communication graph when the number of iterations tends to infinity. The Lyapunov-like energy function is employed to facilitate the learning protocol design and property analysis. Finally, simulation example is given to illustrate the theoretical analysis.

Overcoming resistance to single-agent therapy for oncogenic BRAF gene fusions via combinatorial targeting of MAPK and PI3K/mTOR signaling pathways

PubMed Central

Jain, Payal; Silva, Amanda; Han, Harry J.; Lang, Shih-Shan; Zhu, Yuankun; Boucher, Katie; Smith, Tiffany E.; Vakil, Aesha; Diviney, Patrick; Choudhari, Namrata; Raman, Pichai; Busch, Christine M.; Delaney, Tim; Yang, Xiaodong; Olow, Aleksandra K.; Mueller, Sabine; Haas-Kogan, Daphne; Fox, Elizabeth; Storm, Phillip B.; Resnick, Adam C.; Waanders, Angela J.

2017-01-01

Pediatric low-grade gliomas (PLGGs) are frequently associated with activating BRAF gene fusions, such as KIAA1549-BRAF, that aberrantly drive the mitogen activated protein kinase (MAPK) pathway. Although RAF inhibitors (RAFi) have been proven effective in BRAF-V600E mutant tumors, we have previously shown how the KIAA1549-BRAF fusion can be paradoxically activated by RAFi. While newer classes of RAFi, such as PLX8394, have now been shown to inhibit MAPK activation by KIAA1549-BRAF, we sought to identify alternative MAPK pathway targeting strategies using clinically relevant MEK inhibitors (MEKi), along with potential escape mechanisms of acquired resistance to single-agent MAPK pathway therapies. We demonstrate effectiveness of multiple MEKi against diverse BRAF-fusions with novel N-terminal partners, with trametinib being the most potent. However, resistance to MEKi or PLX8394 develops via increased RTK expression causing activation of PI3K/mTOR pathway in BRAF-fusion expressing resistant clones. To circumvent acquired resistance, we show potency of combinatorial targeting with trametinib and everolimus, an mTOR inhibitor (mTORi) against multiple BRAF-fusions. While single-agent mTORi and MEKi PLGG clinical trials are underway, our study provides preclinical rationales for using MEKi and mTORi combinatorial therapy to stave off or prevent emergent drug-resistance in BRAF-fusion driven PLGGs. PMID:29156677

Multi Sensor Fusion Using Fitness Adaptive Differential Evolution

NASA Astrophysics Data System (ADS)

Giri, Ritwik; Ghosh, Arnob; Chowdhury, Aritra; Das, Swagatam

The rising popularity of multi-source, multi-sensor networks supports real-life applications calls for an efficient and intelligent approach to information fusion. Traditional optimization techniques often fail to meet the demands. The evolutionary approach provides a valuable alternative due to its inherent parallel nature and its ability to deal with difficult problems. We present a new evolutionary approach based on a modified version of Differential Evolution (DE), called Fitness Adaptive Differential Evolution (FiADE). FiADE treats sensors in the network as distributed intelligent agents with various degrees of autonomy. Existing approaches based on intelligent agents cannot completely answer the question of how their agents could coordinate their decisions in a complex environment. The proposed approach is formulated to produce good result for the problems that are high-dimensional, highly nonlinear, and random. The proposed approach gives better result in case of optimal allocation of sensors. The performance of the proposed approach is compared with an evolutionary algorithm coordination generalized particle model (C-GPM).

Running Clubs--A Combinatorial Investigation.

ERIC Educational Resources Information Center

Nissen, Phillip; Taylor, John

1991-01-01

Presented is a combinatorial problem based on the Hash House Harriers rule which states that the route of the run should not have previously been traversed by the club. Discovered is how many weeks the club can meet before the rule has to be broken. (KR)

Extremal problems for topological indices in combinatorial chemistry.

PubMed

Tichy, Robert F; Wagner, Stephan

2005-09-01

Topological indices of molecular graphs are related to several physicochemical characteristics; recently, the inverse problem for some of these indices has been studied, and it has some applications in the design of combinatorial libraries for drug discovery. It is thus very natural to study also extremal problems for these indices, i.e., finding graphs having minimal or maximal index. In this paper, these questions will be discussed for three different indices, namely the sigma-index, the c-index and the Z-index, with emphasis on the sigma-index.

Aerospace Applications of Integer and Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Aerospace applications on integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem. for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Robust adaptive fault-tolerant control for leader-follower flocking of uncertain multi-agent systems with actuator failure.

PubMed

Yazdani, Sahar; Haeri, Mohammad

2017-11-01

In this work, we study the flocking problem of multi-agent systems with uncertain dynamics subject to actuator failure and external disturbances. By considering some standard assumptions, we propose a robust adaptive fault tolerant protocol for compensating of the actuator bias fault, the partial loss of actuator effectiveness fault, the model uncertainties, and external disturbances. Under the designed protocol, velocity convergence of agents to that of virtual leader is guaranteed while the connectivity preservation of network and collision avoidance among agents are ensured as well. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

A combinatorial approach to the design of vaccines.

PubMed

Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

2015-05-01

We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

A Model of Students' Combinatorial Thinking

ERIC Educational Resources Information Center

Lockwood, Elise

2013-01-01

Combinatorial topics have become increasingly prevalent in K-12 and undergraduate curricula, yet research on combinatorics education indicates that students face difficulties when solving counting problems. The research community has not yet addressed students' ways of thinking at a level that facilitates deeper understanding of how students…

A hybrid genetic algorithm for solving bi-objective traveling salesman problems

NASA Astrophysics Data System (ADS)

Ma, Mei; Li, Hecheng

2017-08-01

The traveling salesman problem (TSP) is a typical combinatorial optimization problem, in a traditional TSP only tour distance is taken as a unique objective to be minimized. When more than one optimization objective arises, the problem is known as a multi-objective TSP. In the present paper, a bi-objective traveling salesman problem (BOTSP) is taken into account, where both the distance and the cost are taken as optimization objectives. In order to efficiently solve the problem, a hybrid genetic algorithm is proposed. Firstly, two satisfaction degree indices are provided for each edge by considering the influences of the distance and the cost weight. The first satisfaction degree is used to select edges in a “rough” way, while the second satisfaction degree is executed for a more “refined” choice. Secondly, two satisfaction degrees are also applied to generate new individuals in the iteration process. Finally, based on genetic algorithm framework as well as 2-opt selection strategy, a hybrid genetic algorithm is proposed. The simulation illustrates the efficiency of the proposed algorithm.

MASM: a market architecture for sensor management in distributed sensor networks

NASA Astrophysics Data System (ADS)

Viswanath, Avasarala; Mullen, Tracy; Hall, David; Garga, Amulya

2005-03-01

Rapid developments in sensor technology and its applications have energized research efforts towards devising a firm theoretical foundation for sensor management. Ubiquitous sensing, wide bandwidth communications and distributed processing provide both opportunities and challenges for sensor and process control and optimization. Traditional optimization techniques do not have the ability to simultaneously consider the wildly non-commensurate measures involved in sensor management in a single optimization routine. Market-oriented programming provides a valuable and principled paradigm to designing systems to solve this dynamic and distributed resource allocation problem. We have modeled the sensor management scenario as a competitive market, wherein the sensor manager holds a combinatorial auction to sell the various items produced by the sensors and the communication channels. However, standard auction mechanisms have been found not to be directly applicable to the sensor management domain. For this purpose, we have developed a specialized market architecture MASM (Market architecture for Sensor Management). In MASM, the mission manager is responsible for deciding task allocations to the consumers and their corresponding budgets and the sensor manager is responsible for resource allocation to the various consumers. In addition to having a modified combinatorial winner determination algorithm, MASM has specialized sensor network modules that address commensurability issues between consumers and producers in the sensor network domain. A preliminary multi-sensor, multi-target simulation environment has been implemented to test the performance of the proposed system. MASM outperformed the information theoretic sensor manager in meeting the mission objectives in the simulation experiments.

Application of computer assisted combinatorial chemistry in antivirial, antimalarial and anticancer agents design

NASA Astrophysics Data System (ADS)

Burello, E.; Bologa, C.; Frecer, V.; Miertus, S.

Combinatorial chemistry and technologies have been developed to a stage where synthetic schemes are available for generation of a large variety of organic molecules. The innovative concept of combinatorial design assumes that screening of a large and diverse library of compounds will increase the probability of finding an active analogue among the compounds tested. Since the rate at which libraries are screened for activity currently constitutes a limitation to the use of combinatorial technologies, it is important to be selective about the number of compounds to be synthesized. Early experience with combinatorial chemistry indicated that chemical diversity alone did not result in a significant increase in the number of generated lead compounds. Emphasis has therefore been increasingly put on the use of computer assisted combinatorial chemical techniques. Computational methods are valuable in the design of virtual libraries of molecular models. Selection strategies based on computed physicochemical properties of the models or of a target compound are introduced to reduce the time and costs of library synthesis and screening. In addition, computational structure-based library focusing methods can be used to perform in silico screening of the activity of compounds against a target receptor by docking the ligands into the receptor model. Three case studies are discussed dealing with the design of targeted combinatorial libraries of inhibitors of HIV-1 protease, P. falciparum plasmepsin and human urokinase as potential antivirial, antimalarial and anticancer drugs. These illustrate library focusing strategies.

Organization of the secure distributed computing based on multi-agent system

NASA Astrophysics Data System (ADS)

Khovanskov, Sergey; Rumyantsev, Konstantin; Khovanskova, Vera

2018-04-01

Nowadays developing methods for distributed computing is received much attention. One of the methods of distributed computing is using of multi-agent systems. The organization of distributed computing based on the conventional network computers can experience security threats performed by computational processes. Authors have developed the unified agent algorithm of control system of computing network nodes operation. Network PCs is used as computing nodes. The proposed multi-agent control system for the implementation of distributed computing allows in a short time to organize using of the processing power of computers any existing network to solve large-task by creating a distributed computing. Agents based on a computer network can: configure a distributed computing system; to distribute the computational load among computers operated agents; perform optimization distributed computing system according to the computing power of computers on the network. The number of computers connected to the network can be increased by connecting computers to the new computer system, which leads to an increase in overall processing power. Adding multi-agent system in the central agent increases the security of distributed computing. This organization of the distributed computing system reduces the problem solving time and increase fault tolerance (vitality) of computing processes in a changing computing environment (dynamic change of the number of computers on the network). Developed a multi-agent system detects cases of falsification of the results of a distributed system, which may lead to wrong decisions. In addition, the system checks and corrects wrong results.

Relay tracking control for second-order multi-agent systems with damaged agents.

PubMed

Dong, Lijing; Li, Jing; Liu, Qin

2017-11-01

This paper investigates a situation where smart agents capable of sensory and mobility are deployed to monitor a designated area. A preset number of agents start tracking when a target intrudes this area. Some of the tracking agents are possible to be out of order over the tracking course. Thus, we propose a cooperative relay tracking strategy to ensure the successful tracking with existence of damaged agents. Relay means that, when a tracking agent quits tracking due to malfunction, one of the near deployed agents replaces it to continue the tracking task. This results in jump of tracking errors and dynamic switching of topology of the multi-agent system. Switched system technique is employed to solve this specific problem. Finally, the effectiveness of proposed tracking strategy and validity of the theoretical results are verified by conducting a numerical simulation. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses.

PubMed

Zhang, Wenbing; Tang, Yang; Huang, Tingwen; Kurths, Jurgen

In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.

Acting to gain information

NASA Technical Reports Server (NTRS)

Rosenchein, Stanley J.; Burns, J. Brian; Chapman, David; Kaelbling, Leslie P.; Kahn, Philip; Nishihara, H. Keith; Turk, Matthew

1993-01-01

This report is concerned with agents that act to gain information. In previous work, we developed agent models combining qualitative modeling with real-time control. That work, however, focused primarily on actions that affect physical states of the environment. The current study extends that work by explicitly considering problems of active information-gathering and by exploring specialized aspects of information-gathering in computational perception, learning, and language. In our theoretical investigations, we analyzed agents into their perceptual and action components and identified these with elements of a state-machine model of control. The mathematical properties of each was developed in isolation and interactions were then studied. We considered the complexity dimension and the uncertainty dimension and related these to intelligent-agent design issues. We also explored active information gathering in visual processing. Working within the active vision paradigm, we developed a concept of 'minimal meaningful measurements' suitable for demand-driven vision. We then developed and tested an architecture for ongoing recognition and interpretation of visual information. In the area of information gathering through learning, we explored techniques for coping with combinatorial complexity. We also explored information gathering through explicit linguistic action by considering the nature of conversational rules, coordination, and situated communication behavior.

Adaptive behaviors in multi-agent source localization using passive sensing.

PubMed

Shaukat, Mansoor; Chitre, Mandar

2016-12-01

In this paper, the role of adaptive group cohesion in a cooperative multi-agent source localization problem is investigated. A distributed source localization algorithm is presented for a homogeneous team of simple agents. An agent uses a single sensor to sense the gradient and two sensors to sense its neighbors. The algorithm is a set of individualistic and social behaviors where the individualistic behavior is as simple as an agent keeping its previous heading and is not self-sufficient in localizing the source. Source localization is achieved as an emergent property through agent's adaptive interactions with the neighbors and the environment. Given a single agent is incapable of localizing the source, maintaining team connectivity at all times is crucial. Two simple temporal sampling behaviors, intensity-based-adaptation and connectivity-based-adaptation, ensure an efficient localization strategy with minimal agent breakaways. The agent behaviors are simultaneously optimized using a two phase evolutionary optimization process. The optimized behaviors are estimated with analytical models and the resulting collective behavior is validated against the agent's sensor and actuator noise, strong multi-path interference due to environment variability, initialization distance sensitivity and loss of source signal.

Can Moral Hazard Be Resolved by Common-Knowledge in S4n-Knowledge?

NASA Astrophysics Data System (ADS)

Matsuhisa, Takashi

This article investigates the relationship between common-knowledge and agreement in multi-agent system, and to apply the agreement result by common-knowledge to the principal-agent model under non-partition information. We treat the two problems: (1) how we capture the fact that the agents agree on an event or they get consensus on it from epistemic point of view, and (2) how the agreement theorem will be able to make progress to settle a moral hazard problem in the principal-agents model under non-partition information. We shall propose a solution program for the moral hazard in the principal-agents model under non-partition information by common-knowledge. Let us start that the agents have the knowledge structure induced from a reflexive and transitive relation associated with the multi-modal logic S4n. Each agent obtains the membership value of an event under his/her private information, so he/she considers the event as fuzzy set. Specifically consider the situation that the agents commonly know all membership values of the other agents. In this circumstance we shall show the agreement theorem that consensus on the membership values among all agents can still be guaranteed. Furthermore, under certain assumptions we shall show that the moral hazard can be resolved in the principal-agent model when all the expected marginal costs are common-knowledge among the principal and agents.

LAS0811: from combinatorial chemistry to activation of antioxidant response element.

PubMed

Zhu, Ming; Baek, Hyounggee; Liu, Ruiwu; Song, Aimin; Lam, Kit; Lau, Derick

2009-01-01

The antioxidant response element (ARE) and its transcription factor, nuclear factor-erythroid 2 p45-related factor 2 (Nrf2), are potential targets for cancer chemoprevention. We sought to screen small molecules synthesized with combinatorial chemistry for activation of ARE. By high-throughput screening of 9400 small molecules from 10 combinatorial chemical libraries using HepG2 cells with an ARE-driven reporter, we have identified a novel small molecule, 1,2-dimethoxy-4,5-dinitrobenzene (LAS0811), as an activator of the ARE. LAS0811 upregulated the activity of NAD(P)H:quinone oxidoreductase 1 (NQO1), a representative antioxidative enzyme regulated by ARE. It enhanced production of an endogenous reducing agent, glutathione (GSH). In addition, LAS0811 induced expression of heme oxygenase 1 (HO1), which is an ARE-regulated enzyme with anti-inflammatory activity. Furthermore, LAS0811 reduced cell death due to the cytotoxic stress of a strong oxidant, t-butyl hydroperoxide (t-BOOH). Mechanistically, LAS0811 upregulated the expression of Nrf2 and promoted its translocation into the nuclei leading to subsequent ARE activation. Taken together, LAS0811 is a novel activator of the ARE and its associated detoxifying genes and, thus, a potential agent for cancer chemoprevention.

LAS0811: From Combinatorial Chemistry to Activation of Antioxidant Response Element

PubMed Central

Zhu, Ming; Baek, Hyounggee; Liu, Ruiwu; Song, Aimin; Lam, Kit; Lau, Derick

2009-01-01

The antioxidant response element (ARE) and its transcription factor, nuclear factor-erythroid 2 p45-related factor 2 (Nrf2), are potential targets for cancer chemoprevention. We sought to screen small molecules synthesized with combinatorial chemistry for activation of ARE. By high-throughput screening of 9400 small molecules from 10 combinatorial chemical libraries using HepG2 cells with an ARE-driven reporter, we have identified a novel small molecule, 1,2-dimethoxy-4,5-dinitrobenzene (LAS0811), as an activator of the ARE. LAS0811 upregulated the activity of NAD(P)H:quinone oxidoreductase 1 (NQO1), a representative antioxidative enzyme regulated by ARE. It enhanced production of an endogenous reducing agent, glutathione (GSH). In addition, LAS0811 induced expression of heme oxygenase 1 (HO1), which is an ARE-regulated enzyme with anti-inflammatory activity. Furthermore, LAS0811 reduced cell death due to the cytotoxic stress of a strong oxidant, t-butyl hydroperoxide (t-BOOH). Mechanistically, LAS0811 upregulated the expression of Nrf2 and promoted its translocation into the nuclei leading to subsequent ARE activation. Taken together, LAS0811 is a novel activator of the ARE and its associated detoxifying genes and, thus, a potential agent for cancer chemoprevention. PMID:19794825

Prescribed performance distributed consensus control for nonlinear multi-agent systems with unknown dead-zone input

NASA Astrophysics Data System (ADS)

Cui, Guozeng; Xu, Shengyuan; Ma, Qian; Li, Yongmin; Zhang, Zhengqiang

2018-05-01

In this paper, the problem of prescribed performance distributed output consensus for higher-order non-affine nonlinear multi-agent systems with unknown dead-zone input is investigated. Fuzzy logical systems are utilised to identify the unknown nonlinearities. By introducing prescribed performance, the transient and steady performance of synchronisation errors are guaranteed. Based on Lyapunov stability theory and the dynamic surface control technique, a new distributed consensus algorithm for non-affine nonlinear multi-agent systems is proposed, which ensures cooperatively uniformly ultimately boundedness of all signals in the closed-loop systems and enables the output of each follower to synchronise with the leader within predefined bounded error. Finally, simulation examples are provided to demonstrate the effectiveness of the proposed control scheme.

Combinatorial alloying improves bismuth vanadate photoanodes via reduced monoclinic distortion

DOE PAGES

Newhouse, P. F.; Guevarra, D.; Umehara, M.; ...

2018-01-01

Energy technologies are enabled by materials innovations, requiring efficient methods to search high dimensional parameter spaces, such as multi-element alloying for enhancing solar fuels photoanodes.

Natural products and combinatorial chemistry: back to the future.

PubMed

Ortholand, Jean-Yves; Ganesan, A

2004-06-01

The introduction of high-throughput synthesis and combinatorial chemistry has precipitated a global decline in the screening of natural products by the pharmaceutical industry. Some companies terminated their natural products program, despite the unproven success of the new technologies. This was a premature decision, as natural products have a long history of providing important medicinal agents. Furthermore, they occupy a complementary region of chemical space compared with the typical synthetic compound library. For these reasons, the interest in natural products has been rekindled. Various approaches have evolved that combine the power of natural products and organic chemistry, ranging from the combinatorial total synthesis of analogues to the exploration of natural product scaffolds and the design of completely unnatural molecules that resemble natural products in their molecular characteristics.

Efficient Credit Assignment through Evaluation Function Decomposition

NASA Technical Reports Server (NTRS)

Agogino, Adrian; Turner, Kagan; Mikkulainen, Risto

2005-01-01

Evolutionary methods are powerful tools in discovering solutions for difficult continuous tasks. When such a solution is encoded over multiple genes, a genetic algorithm faces the difficult credit assignment problem of evaluating how a single gene in a chromosome contributes to the full solution. Typically a single evaluation function is used for the entire chromosome, implicitly giving each gene in the chromosome the same evaluation. This method is inefficient because a gene will get credit for the contribution of all the other genes as well. Accurately measuring the fitness of individual genes in such a large search space requires many trials. This paper instead proposes turning this single complex search problem into a multi-agent search problem, where each agent has the simpler task of discovering a suitable gene. Gene-specific evaluation functions can then be created that have better theoretical properties than a single evaluation function over all genes. This method is tested in the difficult double-pole balancing problem, showing that agents using gene-specific evaluation functions can create a successful control policy in 20 percent fewer trials than the best existing genetic algorithms. The method is extended to more distributed problems, achieving 95 percent performance gains over tradition methods in the multi-rover domain.

Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems

ERIC Educational Resources Information Center

Hubert, Lawrence J.; Baker, Frank B.

1978-01-01

The "Traveling Salesman" and similar combinatorial programming tasks encountered in operations research are discussed as possible data analysis models in psychology, for example, in developmental scaling, Guttman scaling, profile smoothing, and data array clustering. A short overview of various computational approaches from this area of…

Cooperative global optimal preview tracking control of linear multi-agent systems: an internal model approach

NASA Astrophysics Data System (ADS)

Lu, Yanrong; Liao, Fucheng; Deng, Jiamei; Liu, Huiyang

2017-09-01

This paper investigates the cooperative global optimal preview tracking problem of linear multi-agent systems under the assumption that the output of a leader is a previewable periodic signal and the topology graph contains a directed spanning tree. First, a type of distributed internal model is introduced, and the cooperative preview tracking problem is converted to a global optimal regulation problem of an augmented system. Second, an optimal controller, which can guarantee the asymptotic stability of the augmented system, is obtained by means of the standard linear quadratic optimal preview control theory. Third, on the basis of proving the existence conditions of the controller, sufficient conditions are given for the original problem to be solvable, meanwhile a cooperative global optimal controller with error integral and preview compensation is derived. Finally, the validity of theoretical results is demonstrated by a numerical simulation.

Near-infrared fluorescent probes in cancer imaging and therapy: an emerging field

PubMed Central

Yi, Xiaomin; Wang, Fuli; Qin, Weijun; Yang, Xiaojian; Yuan, Jianlin

2014-01-01

Near-infrared fluorescence (NIRF) imaging is an attractive modality for early cancer detection with high sensitivity and multi-detection capability. Due to convenient modification by conjugating with moieties of interests, NIRF probes are ideal candidates for cancer targeted imaging. Additionally, the combinatory application of NIRF imaging and other imaging modalities that can delineate anatomical structures extends fluorometric determination of biomedical information. Moreover, nanoparticles loaded with NIRF dyes and anticancer agents contribute to the synergistic management of cancer, which integrates the advantage of imaging and therapeutic functions to achieve the ultimate goal of simultaneous diagnosis and treatment. Appropriate probe design with targeting moieties can retain the original properties of NIRF and pharmacokinetics. In recent years, great efforts have been made to develop new NIRF probes with better photostability and strong fluorescence emission, leading to the discovery of numerous novel NIRF probes with fine photophysical properties. Some of these probes exhibit tumoricidal activities upon light radiation, which holds great promise in photothermal therapy, photodynamic therapy, and photoimmunotherapy. This review aims to provide a timely and concise update on emerging NIRF dyes and multifunctional agents. Their potential uses as agents for cancer specific imaging, lymph node mapping, and therapeutics are included. Recent advances of NIRF dyes in clinical use are also summarized. PMID:24648733

Near-infrared fluorescent probes in cancer imaging and therapy: an emerging field.

PubMed

Yi, Xiaomin; Wang, Fuli; Qin, Weijun; Yang, Xiaojian; Yuan, Jianlin

2014-01-01

Near-infrared fluorescence (NIRF) imaging is an attractive modality for early cancer detection with high sensitivity and multi-detection capability. Due to convenient modification by conjugating with moieties of interests, NIRF probes are ideal candidates for cancer targeted imaging. Additionally, the combinatory application of NIRF imaging and other imaging modalities that can delineate anatomical structures extends fluorometric determination of biomedical information. Moreover, nanoparticles loaded with NIRF dyes and anticancer agents contribute to the synergistic management of cancer, which integrates the advantage of imaging and therapeutic functions to achieve the ultimate goal of simultaneous diagnosis and treatment. Appropriate probe design with targeting moieties can retain the original properties of NIRF and pharmacokinetics. In recent years, great efforts have been made to develop new NIRF probes with better photostability and strong fluorescence emission, leading to the discovery of numerous novel NIRF probes with fine photophysical properties. Some of these probes exhibit tumoricidal activities upon light radiation, which holds great promise in photothermal therapy, photodynamic therapy, and photoimmunotherapy. This review aims to provide a timely and concise update on emerging NIRF dyes and multifunctional agents. Their potential uses as agents for cancer specific imaging, lymph node mapping, and therapeutics are included. Recent advances of NIRF dyes in clinical use are also summarized.

Genetic algorithms for the vehicle routing problem

NASA Astrophysics Data System (ADS)

Volna, Eva

2016-06-01

The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

Combinatorial chemistry on solid support in the search for central nervous system agents.

PubMed

Zajdel, Paweł; Pawłowski, Maciej; Martinez, Jean; Subra, Gilles

2009-08-01

The advent of combinatorial chemistry was one of the most important developments, that has significantly contributed to the drug discovery process. Within just a few years, its initial concept aimed at production of libraries containing huge number of compounds (thousands to millions), so called screening libraries, has shifted towards preparation of small and medium-sized rationally designed libraries. When applicable, the use of solid supports for the generation of libraries has been a real breakthrough in enhancing productivity. With a limited amount of resin and simple manual workups, the split/mix procedure may generate thousands of bead-tethered compounds. Beads can be chemically or physically encoded to facilitate the identification of a hit after the biological assay. Compartmentalization of solid supports using small reactors like teabags, kans or pellicular discrete supports like Lanterns resulted in powerful sort and combine technologies, relying on codes 'written' on the reactor, and thus reducing the need for automation and improving the number of compounds synthesized. These methods of solid-phase combinatorial chemistry have been recently supported by introduction of solid-supported reagents and scavenger resins. The first part of this review discusses the general premises of combinatorial chemistry and some methods used in the design of primary and focused combinatorial libraries. The aim of the second part is to present combinatorial chemistry methodologies aimed at discovering bioactive compounds acting on diverse GPCR involved in central nervous system disorders.

Rule-based modeling and simulations of the inner kinetochore structure.

PubMed

Tschernyschkow, Sergej; Herda, Sabine; Gruenert, Gerd; Döring, Volker; Görlich, Dennis; Hofmeister, Antje; Hoischen, Christian; Dittrich, Peter; Diekmann, Stephan; Ibrahim, Bashar

2013-09-01

Combinatorial complexity is a central problem when modeling biochemical reaction networks, since the association of a few components can give rise to a large variation of protein complexes. Available classical modeling approaches are often insufficient for the analysis of very large and complex networks in detail. Recently, we developed a new rule-based modeling approach that facilitates the analysis of spatial and combinatorially complex problems. Here, we explore for the first time how this approach can be applied to a specific biological system, the human kinetochore, which is a multi-protein complex involving over 100 proteins. Applying our freely available SRSim software to a large data set on kinetochore proteins in human cells, we construct a spatial rule-based simulation model of the human inner kinetochore. The model generates an estimation of the probability distribution of the inner kinetochore 3D architecture and we show how to analyze this distribution using information theory. In our model, the formation of a bridge between CenpA and an H3 containing nucleosome only occurs efficiently for higher protein concentration realized during S-phase but may be not in G1. Above a certain nucleosome distance the protein bridge barely formed pointing towards the importance of chromatin structure for kinetochore complex formation. We define a metric for the distance between structures that allow us to identify structural clusters. Using this modeling technique, we explore different hypothetical chromatin layouts. Applying a rule-based network analysis to the spatial kinetochore complex geometry allowed us to integrate experimental data on kinetochore proteins, suggesting a 3D model of the human inner kinetochore architecture that is governed by a combinatorial algebraic reaction network. This reaction network can serve as bridge between multiple scales of modeling. Our approach can be applied to other systems beyond kinetochores. Copyright © 2013 Elsevier Ltd. All rights reserved.

Multi-Agent Cooperative Target Search

PubMed Central

Hu, Jinwen; Xie, Lihua; Xu, Jun; Xu, Zhao

2014-01-01

This paper addresses a vision-based cooperative search for multiple mobile ground targets by a group of unmanned aerial vehicles (UAVs) with limited sensing and communication capabilities. The airborne camera on each UAV has a limited field of view and its target discriminability varies as a function of altitude. First, by dividing the whole surveillance region into cells, a probability map can be formed for each UAV indicating the probability of target existence within each cell. Then, we propose a distributed probability map updating model which includes the fusion of measurement information, information sharing among neighboring agents, information decay and transmission due to environmental changes such as the target movement. Furthermore, we formulate the target search problem as a multi-agent cooperative coverage control problem by optimizing the collective coverage area and the detection performance. The proposed map updating model and the cooperative control scheme are distributed, i.e., assuming that each agent only communicates with its neighbors within its communication range. Finally, the effectiveness of the proposed algorithms is illustrated by simulation. PMID:24865884

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

A novel Multi-Agent Ada-Boost algorithm for predicting protein structural class with the information of protein secondary structure.

PubMed

Fan, Ming; Zheng, Bin; Li, Lihua

2015-10-01

Knowledge of the structural class of a given protein is important for understanding its folding patterns. Although a lot of efforts have been made, it still remains a challenging problem for prediction of protein structural class solely from protein sequences. The feature extraction and classification of proteins are the main problems in prediction. In this research, we extended our earlier work regarding these two aspects. In protein feature extraction, we proposed a scheme by calculating the word frequency and word position from sequences of amino acid, reduced amino acid, and secondary structure. For an accurate classification of the structural class of protein, we developed a novel Multi-Agent Ada-Boost (MA-Ada) method by integrating the features of Multi-Agent system into Ada-Boost algorithm. Extensive experiments were taken to test and compare the proposed method using four benchmark datasets in low homology. The results showed classification accuracies of 88.5%, 96.0%, 88.4%, and 85.5%, respectively, which are much better compared with the existing methods. The source code and dataset are available on request.

Design and Control of Large Collections of Learning Agents

NASA Technical Reports Server (NTRS)

Agogino, Adrian

2001-01-01

The intelligent control of multiple autonomous agents is an important yet difficult task. Previous methods used to address this problem have proved to be either too brittle, too hard to use, or not scalable to large systems. The 'Collective Intelligence' project at NASA/Ames provides an elegant, machine-learning approach to address these problems. This approach mathematically defines some essential properties that a reward system should have to promote coordinated behavior among reinforcement learners. This work has focused on creating additional key properties and algorithms within the mathematics of the Collective Intelligence framework. One of the additions will allow agents to learn more quickly, in a more coordinated manner. The other will let agents learn with less knowledge of their environment. These additions will allow the framework to be applied more easily, to a much larger domain of multi-agent problems.

Combining a Multi-Agent System and Communication Middleware for Smart Home Control: A Universal Control Platform Architecture

PubMed Central

Zheng, Song; Zhang, Qi; Zheng, Rong; Huang, Bi-Qin; Song, Yi-Lin; Chen, Xin-Chu

2017-01-01

In recent years, the smart home field has gained wide attention for its broad application prospects. However, families using smart home systems must usually adopt various heterogeneous smart devices, including sensors and devices, which makes it more difficult to manage and control their home system. How to design a unified control platform to deal with the collaborative control problem of heterogeneous smart devices is one of the greatest challenges in the current smart home field. The main contribution of this paper is to propose a universal smart home control platform architecture (IAPhome) based on a multi-agent system and communication middleware, which shows significant adaptability and advantages in many aspects, including heterogeneous devices connectivity, collaborative control, human-computer interaction and user self-management. The communication middleware is an important foundation to design and implement this architecture which makes it possible to integrate heterogeneous smart devices in a flexible way. A concrete method of applying the multi-agent software technique to solve the integrated control problem of the smart home system is also presented. The proposed platform architecture has been tested in a real smart home environment, and the results indicate that the effectiveness of our approach for solving the collaborative control problem of different smart devices. PMID:28926957

Combining a Multi-Agent System and Communication Middleware for Smart Home Control: A Universal Control Platform Architecture.

PubMed

Zheng, Song; Zhang, Qi; Zheng, Rong; Huang, Bi-Qin; Song, Yi-Lin; Chen, Xin-Chu

2017-09-16

In recent years, the smart home field has gained wide attention for its broad application prospects. However, families using smart home systems must usually adopt various heterogeneous smart devices, including sensors and devices, which makes it more difficult to manage and control their home system. How to design a unified control platform to deal with the collaborative control problem of heterogeneous smart devices is one of the greatest challenges in the current smart home field. The main contribution of this paper is to propose a universal smart home control platform architecture (IAPhome) based on a multi-agent system and communication middleware, which shows significant adaptability and advantages in many aspects, including heterogeneous devices connectivity, collaborative control, human-computer interaction and user self-management. The communication middleware is an important foundation to design and implement this architecture which makes it possible to integrate heterogeneous smart devices in a flexible way. A concrete method of applying the multi-agent software technique to solve the integrated control problem of the smart home system is also presented. The proposed platform architecture has been tested in a real smart home environment, and the results indicate that the effectiveness of our approach for solving the collaborative control problem of different smart devices.

Stationary average consensus protocol for a class of heterogeneous high-order multi-agent systems with application for aircraft

NASA Astrophysics Data System (ADS)

Rezaei, Mohammad Hadi; Menhaj, Mohammad Bagher

2018-01-01

This paper investigates the stationary average consensus problem for a class of heterogeneous-order multi-agent systems. The goal is to bring the positions of agents to the average of their initial positions while letting the other states converge to zero. To this end, three different consensus protocols are proposed. First, based on the auxiliary variables information among the agents under switching directed networks and state-feedback control, a protocol is proposed whereby all the agents achieve stationary average consensus. In the second and third protocols, by resorting to only measurements of relative positions of neighbouring agents under fixed balanced directed networks, two control frameworks are presented with two strategies based on state-feedback and output-feedback control. Finally, simulation results are given to illustrate the effectiveness of the proposed protocols.

Agents Technology Research

DTIC Science & Technology

2010-02-01

multi-agent reputation management. State abstraction is a technique used to allow machine learning technologies to cope with problems that have large...state abstrac- tion process to enable reinforcement learning in domains with large state spaces. State abstraction is vital to machine learning ...across a collective of independent platforms. These individual elements, often referred to as agents in the machine learning community, should exhibit both

Optimal Wonderful Life Utility Functions in Multi-Agent Systems

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Tumer, Kagan; Swanson, Keith (Technical Monitor)

2000-01-01

The mathematics of Collective Intelligence (COINs) is concerned with the design of multi-agent systems so as to optimize an overall global utility function when those systems lack centralized communication and control. Typically in COINs each agent runs a distinct Reinforcement Learning (RL) algorithm, so that much of the design problem reduces to how best to initialize/update each agent's private utility function, as far as the ensuing value of the global utility is concerned. Traditional team game solutions to this problem assign to each agent the global utility as its private utility function. In previous work we used the COIN framework to derive the alternative Wonderful Life Utility (WLU), and experimentally established that having the agents use it induces global utility performance up to orders of magnitude superior to that induced by use of the team game utility. The WLU has a free parameter (the clamping parameter) which we simply set to zero in that previous work. Here we derive the optimal value of the clamping parameter, and demonstrate experimentally that using that optimal value can result in significantly improved performance over that of clamping to zero, over and above the improvement beyond traditional approaches.

Identities for Generalized Fibonacci Numbers: A Combinatorial Approach

ERIC Educational Resources Information Center

Plaza, A.; Falcon, S.

2008-01-01

This note shows a combinatorial approach to some identities for generalized Fibonacci numbers. While it is a straightforward task to prove these identities with induction, and also by arithmetical manipulations such as rearrangements, the approach used here is quite simple to follow and eventually reduces the proof to a counting problem. (Contains…

Bipartite flocking for multi-agent systems

NASA Astrophysics Data System (ADS)

Fan, Ming-Can; Zhang, Hai-Tao; Wang, Miaomiao

2014-09-01

This paper addresses the bipartite flock control problem where a multi-agent system splits into two clusters upon internal or external excitations. Using structurally balanced signed graph theory, LaSalle's invariance principle and Barbalat's Lemma, we prove that the proposed algorithm guarantees a bipartite flocking behavior. In each of the two disjoint clusters, all individuals move with the same direction. Meanwhile, every pair of agents in different clusters moves with opposite directions. Moreover, all agents in the two separated clusters approach a common velocity magnitude, and collision avoidance among all agents is ensured as well. Finally, the proposed bipartite flock control method is examined by numerical simulations. The bipartite flocking motion addressed by this paper has its references in both natural collective motions and human group behaviors such as predator-prey and panic escaping scenarios.

Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem

PubMed Central

Chen, Xiaopan; Kong, Yunfeng; Dang, Lanxue; Hou, Yane; Ye, Xinyue

2015-01-01

As a class of hard combinatorial optimization problems, the school bus routing problem has received considerable attention in the last decades. For a multi-school system, given the bus trips for each school, the school bus scheduling problem aims at optimizing bus schedules to serve all the trips within the school time windows. In this paper, we propose two approaches for solving the bi-objective school bus scheduling problem: an exact method of mixed integer programming (MIP) and a metaheuristic method which combines simulated annealing with local search. We develop MIP formulations for homogenous and heterogeneous fleet problems respectively and solve the models by MIP solver CPLEX. The bus type-based formulation for heterogeneous fleet problem reduces the model complexity in terms of the number of decision variables and constraints. The metaheuristic method is a two-stage framework for minimizing the number of buses to be used as well as the total travel distance of buses. We evaluate the proposed MIP and the metaheuristic method on two benchmark datasets, showing that on both instances, our metaheuristic method significantly outperforms the respective state-of-the-art methods. PMID:26176764

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem

PubMed Central

Akutsah, Francis; Olusanya, Micheal O.; Adewumi, Aderemi O.

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems. PMID:29554662

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.

PubMed

Ezugwu, Absalom E; Akutsah, Francis; Olusanya, Micheal O; Adewumi, Aderemi O

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems.

Evaluating the antimicrobial activity of Nisin, Lysozyme and Ethylenediaminetetraacetate incorporated in starch based active food packaging film.

PubMed

Bhatia, Sugandha; Bharti, Anoop

2015-06-01

The pleothera of micro organisms obtained from contaminated food cultured in a starch broth was effectively tested against antibacterial agents, i.e. nisin, lysozyme and chelating agent EDTA. A variety of combination treatments of these antimicrobial agents and their incorporation in Starch based active packaging film according to their permissibility standards was done. 4 variables of Nisin concentration (ranging from 0 to 750 IU/ml), 3 variables of lysozyme concentration (ranging from 0 to 500 IU/ml) and 3 variables of EDTA concentration from (0 to 20 μM) were chosen. Bacterial inhibition by combination of different levels of different factors without antimicrobial films was evaluated using a liquid incubation method. The samples were assayed for turbidity at interval of 2, 4 and 24 h to check effectiveness of combined effects of antimicrobial agents which proved a transitory bactericidal effect for short incubation times. Zone of Inhibition was observed in the antimicrobial films prepared by agar diffusion method. Statistical analysis of experimental data for their antimicrobial spectrum was carried out by multi regression analysis and ANOVA using Design-Expert software to plot the final equation in terms of coded factors as antimicrobial agents. The experimental data indicated that the model was highly significant. Results were also evaluated graphically using response surface showing interactions between two factors, keeping other factor fixed at values at the center of domain. Synergy was also determined among antibacterial agents using the fractional inhibitory concentration (FIC) index which was observed to be 0.56 supporting the hypothesis that nisin and EDTA function as partial synergistically. The presented work aimed to screen in quick fashion the combinatorial effect of three antimicrobial agents and evaluating their efficacy in anti microbial film development.

Problem Solving with Combinations.

ERIC Educational Resources Information Center

English, Lyn

1992-01-01

Highlights combinatorial problems appropriate for students aged 4 to 12 years that utilize manipulatives in a hands-on approach. Examines and identifies students' strategies and self-monitoring techniques that produce effective problem solving. (MDH)

Analysis of random point images with the use of symbolic computation codes and generalized Catalan numbers

NASA Astrophysics Data System (ADS)

Reznik, A. L.; Tuzikov, A. V.; Solov'ev, A. A.; Torgov, A. V.

2016-11-01

Original codes and combinatorial-geometrical computational schemes are presented, which are developed and applied for finding exact analytical formulas that describe the probability of errorless readout of random point images recorded by a scanning aperture with a limited number of threshold levels. Combinatorial problems encountered in the course of the study and associated with the new generalization of Catalan numbers are formulated and solved. An attempt is made to find the explicit analytical form of these numbers, which is, on the one hand, a necessary stage of solving the basic research problem and, on the other hand, an independent self-consistent problem.

Adaptive consensus of scale-free multi-agent system by randomly selecting links

NASA Astrophysics Data System (ADS)

Mou, Jinping; Ge, Huafeng

2016-06-01

This paper investigates an adaptive consensus problem for distributed scale-free multi-agent systems (SFMASs) by randomly selecting links, where the degree of each node follows a power-law distribution. The randomly selecting links are based on the assumption that every agent decides to select links among its neighbours according to the received data with a certain probability. Accordingly, a novel consensus protocol with the range of the received data is developed, and each node updates its state according to the protocol. By the iterative method and Cauchy inequality, the theoretical analysis shows that all errors among agents converge to zero, and in the meanwhile, several criteria of consensus are obtained. One numerical example shows the reliability of the proposed methods.

Distributed Optimization

NASA Technical Reports Server (NTRS)

Macready, William; Wolpert, David

2005-01-01

We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.

Distributed cooperative H∞ optimal tracking control of MIMO nonlinear multi-agent systems in strict-feedback form via adaptive dynamic programming

NASA Astrophysics Data System (ADS)

Luy, N. T.

2018-04-01

The design of distributed cooperative H∞ optimal controllers for multi-agent systems is a major challenge when the agents' models are uncertain multi-input and multi-output nonlinear systems in strict-feedback form in the presence of external disturbances. In this paper, first, the distributed cooperative H∞ optimal tracking problem is transformed into controlling the cooperative tracking error dynamics in affine form. Second, control schemes and online algorithms are proposed via adaptive dynamic programming (ADP) and the theory of zero-sum differential graphical games. The schemes use only one neural network (NN) for each agent instead of three from ADP to reduce computational complexity as well as avoid choosing initial NN weights for stabilising controllers. It is shown that despite not using knowledge of cooperative internal dynamics, the proposed algorithms not only approximate values to Nash equilibrium but also guarantee all signals, such as the NN weight approximation errors and the cooperative tracking errors in the closed-loop system, to be uniformly ultimately bounded. Finally, the effectiveness of the proposed method is shown by simulation results of an application to wheeled mobile multi-robot systems.

Coevolutionary Free Lunches

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Macready, William G.

2005-01-01

Recent work on the foundations of optimization has begun to uncover its underlying rich structure. In particular, the "No Free Lunch" (NFL) theorems [WM97] state that any two algorithms are equivalent when their performance is averaged across all possible problems. This highlights the need for exploiting problem-specific knowledge to achieve better than random performance. In this paper we present a general framework covering most search scenarios. In addition to the optimization scenarios addressed in the NFL results, this framework covers multi-armed bandit problems and evolution of multiple co-evolving agents. As a particular instance of the latter, it covers "self-play" problems. In these problems the agents work together to produce a champion, who then engages one or more antagonists in a subsequent multi-player game In contrast to the traditional optimization case where the NFL results hold, we show that in self-play there are free lunches: in coevolution some algorithms have better performance than other algorithms, averaged across all possible problems. However in the typical coevolutionary scenarios encountered in biology, where there is no champion, NFL still holds.

It looks easy! Heuristics for combinatorial optimization problems.

PubMed

Chronicle, Edward P; MacGregor, James N; Ormerod, Thomas C; Burr, Alistair

2006-04-01

Human performance on instances of computationally intractable optimization problems, such as the travelling salesperson problem (TSP), can be excellent. We have proposed a boundary-following heuristic to account for this finding. We report three experiments with TSPs where the capacity to employ this heuristic was varied. In Experiment 1, participants free to use the heuristic produced solutions significantly closer to optimal than did those prevented from doing so. Experiments 2 and 3 together replicated this finding in larger problems and demonstrated that a potential confound had no effect. In all three experiments, performance was closely matched by a boundary-following model. The results implicate global rather than purely local processes. Humans may have access to simple, perceptually based, heuristics that are suited to some combinatorial optimization tasks.

Model-free learning on robot kinematic chains using a nested multi-agent topology

NASA Astrophysics Data System (ADS)

Karigiannis, John N.; Tzafestas, Costas S.

2016-11-01

This paper proposes a model-free learning scheme for the developmental acquisition of robot kinematic control and dexterous manipulation skills. The approach is based on a nested-hierarchical multi-agent architecture that intuitively encapsulates the topology of robot kinematic chains, where the activity of each independent degree-of-freedom (DOF) is finally mapped onto a distinct agent. Each one of those agents progressively evolves a local kinematic control strategy in a game-theoretic sense, that is, based on a partial (local) view of the whole system topology, which is incrementally updated through a recursive communication process according to the nested-hierarchical topology. Learning is thus approached not through demonstration and training but through an autonomous self-exploration process. A fuzzy reinforcement learning scheme is employed within each agent to enable efficient exploration in a continuous state-action domain. This paper constitutes in fact a proof of concept, demonstrating that global dexterous manipulation skills can indeed evolve through such a distributed iterative learning of local agent sensorimotor mappings. The main motivation behind the development of such an incremental multi-agent topology is to enhance system modularity, to facilitate extensibility to more complex problem domains and to improve robustness with respect to structural variations including unpredictable internal failures. These attributes of the proposed system are assessed in this paper through numerical experiments in different robot manipulation task scenarios, involving both single and multi-robot kinematic chains. The generalisation capacity of the learning scheme is experimentally assessed and robustness properties of the multi-agent system are also evaluated with respect to unpredictable variations in the kinematic topology. Furthermore, these numerical experiments demonstrate the scalability properties of the proposed nested-hierarchical architecture, where new agents can be recursively added in the hierarchy to encapsulate individual active DOFs. The results presented in this paper demonstrate the feasibility of such a distributed multi-agent control framework, showing that the solutions which emerge are plausible and near-optimal. Numerical efficiency and computational cost issues are also discussed.

Distributed event-triggered consensus strategy for multi-agent systems under limited resources

NASA Astrophysics Data System (ADS)

Noorbakhsh, S. Mohammad; Ghaisari, Jafar

2016-01-01

The paper proposes a distributed structure to address an event-triggered consensus problem for multi-agent systems which aims at concurrent reduction in inter-agent communication, control input actuation and energy consumption. Following the proposed approach, asymptotic convergence of all agents to consensus requires that each agent broadcasts its sampled-state to the neighbours and updates its control input only at its own triggering instants, unlike the existing related works. Obviously, it decreases the network bandwidth usage, sensor energy consumption, computation resources usage and actuator wears. As a result, it facilitates the implementation of the proposed consensus protocol in the real-world applications with limited resources. The stability of the closed-loop system under an event-based protocol is proved analytically. Some numerical results are presented which confirm the analytical discussion on the effectiveness of the proposed design.

A combinatorial filtering method for magnetotelluric time-series based on Hilbert-Huang transform

NASA Astrophysics Data System (ADS)

Cai, Jianhua

2014-11-01

Magnetotelluric (MT) time-series are often contaminated with noise from natural or man-made processes. A substantial improvement is possible when the time-series are presented as clean as possible for further processing. A combinatorial method is described for filtering of MT time-series based on the Hilbert-Huang transform that requires a minimum of human intervention and leaves good data sections unchanged. Good data sections are preserved because after empirical mode decomposition the data are analysed through hierarchies, morphological filtering, adaptive threshold and multi-point smoothing, allowing separation of noise from signals. The combinatorial method can be carried out without any assumption about the data distribution. Simulated data and the real measured MT time-series from three different regions, with noise caused by baseline drift, high frequency noise and power-line contribution, are processed to demonstrate the application of the proposed method. Results highlight the ability of the combinatorial method to pick out useful signals, and the noise is suppressed greatly so that their deleterious influence is eliminated for the MT transfer function estimation.

Adaptive, Distributed Control of Constrained Multi-Agent Systems

NASA Technical Reports Server (NTRS)

Bieniawski, Stefan; Wolpert, David H.

2004-01-01

Product Distribution (PO) theory was recently developed as a broad framework for analyzing and optimizing distributed systems. Here we demonstrate its use for adaptive distributed control of Multi-Agent Systems (MASS), i.e., for distributed stochastic optimization using MAS s. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (Probability dist&&on on the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. One common way to find that equilibrium is to have each agent run a Reinforcement Learning (E) algorithm. PD theory reveals this to be a particular type of search algorithm for minimizing the Lagrangian. Typically that algorithm i s quite inefficient. A more principled alternative is to use a variant of Newton's method to minimize the Lagrangian. Here we compare this alternative to RL-based search in three sets of computer experiments. These are the N Queen s problem and bin-packing problem from the optimization literature, and the Bar problem from the distributed RL literature. Our results confirm that the PD-theory-based approach outperforms the RL-based scheme in all three domains.

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.

Combining engineered cell-sensors with multi-agent systems to realize smart environment

NASA Astrophysics Data System (ADS)

Chen, Mei

2013-03-01

The connection of everything in a sensory and an intelligent way is a pursuit in smart environment. This paper introduces the engineered cell-sensors into the multi-agent systems to realize the smart environment. The seamless interface with the natural environment and strong information-processing ability of cell with the achievements of synthetic biology make the construction of engineered cell-sensors possible. However, the engineered cell-sensors are only simple-functional and unreliable computational entities. Therefore how to combine engineered cell-sensors with digital device is a key problem in order to realize the smart environment. We give the abstract structure and interaction modes of the engineered cell-sensors in order to introduce engineered cell-sensors into multi-agent systems. We believe that the introduction of engineered cell-sensors will push forward the development of the smart environment.

Adaptive Multi-Agent Systems for Constrained Optimization

NASA Technical Reports Server (NTRS)

Macready, William; Bieniawski, Stefan; Wolpert, David H.

2004-01-01

Product Distribution (PD) theory is a new framework for analyzing and controlling distributed systems. Here we demonstrate its use for distributed stochastic optimization. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. The updating of the Lagrange parameters in the Lagrangian can be viewed as a form of automated annealing, that focuses the MAS more and more on the optimal pure strategy. This provides a simple way to map the solution of any constrained optimization problem onto the equilibrium of a Multi-Agent System (MAS). We present computer experiments involving both the Queen s problem and K-SAT validating the predictions of PD theory and its use for off-the-shelf distributed adaptive optimization.

The multi-criteria optimization for the formation of the multiple-valued logic model of a robotic agent

NASA Astrophysics Data System (ADS)

Bykovsky, A. Yu; Sherbakov, A. A.

2016-08-01

The C-valued Allen-Givone algebra is the attractive tool for modeling of a robotic agent, but it requires the consensus method of minimization for the simplification of logic expressions. This procedure substitutes some undefined states of the function for the maximal truth value, thus extending the initially given truth table. This further creates the problem of different formal representations for the same initially given function. The multi-criteria optimization is proposed for the deliberate choice of undefined states and model formation.

Group consensus control for networked multi-agent systems with communication delays.

PubMed

An, Bao-Ran; Liu, Guo-Ping; Tan, Chong

2018-05-01

This paper investigates group consensus problems in networked multi-agent systems (NMAS) with communication delays. Based on the sed state prediction scheme, the group consensus control protocol is designed to compensate the communication delay actively. In light of algebraic graph theories and matrix theories, necessary and(or) sufficient conditions of group consensus with respect to a given admissible control set are obtained for the NMAS with communication delays under mild assumptions. Finally, simulations are performed to demonstrate the effectiveness of the theoretical results. Copyright © 2018 ISA. All rights reserved.

Modelling and multi-parametric control for delivery of anaesthetic agents.

PubMed

Dua, Pinky; Dua, Vivek; Pistikopoulos, Efstratios N

2010-06-01

This article presents model predictive controllers (MPCs) and multi-parametric model-based controllers for delivery of anaesthetic agents. The MPC can take into account constraints on drug delivery rates and state of the patient but requires solving an optimization problem at regular time intervals. The multi-parametric controller has all the advantages of the MPC and does not require repetitive solution of optimization problem for its implementation. This is achieved by obtaining the optimal drug delivery rates as a set of explicit functions of the state of the patient. The derivation of the controllers relies on using detailed models of the system. A compartmental model for the delivery of three drugs for anaesthesia is developed. The key feature of this model is that mean arterial pressure, cardiac output and unconsciousness of the patient can be simultaneously regulated. This is achieved by using three drugs: dopamine (DP), sodium nitroprusside (SNP) and isoflurane. A number of dynamic simulation experiments are carried out for the validation of the model. The model is then used for the design of model predictive and multi-parametric controllers, and the performance of the controllers is analyzed.

A pilot study of JI-101, an inhibitor of VEGFR-2, PDGFR-β, and EphB4 receptors, in combination with everolimus and as a single agent in an ovarian cancer expansion cohort.

PubMed

Werner, Theresa L; Wade, Mark L; Agarwal, Neeraj; Boucher, Kenneth; Patel, Jesal; Luebke, Aaron; Sharma, Sunil

2015-12-01

JI-101 is an oral multi-kinase inhibitor that targets vascular endothelial growth factor receptor type 2 (VEGFR-2), platelet derived growth factor receptor β (PDGFR-β), and ephrin type-B receptor 4 (EphB4). None of the currently approved angiogenesis inhibitors have been reported to inhibit EphB4, and therefore, JI-101 has a novel mechanism of action. We conducted a pilot trial to assess the pharmacokinetics (PK), tolerability, and efficacy of JI-101 in combination with everolimus in advanced cancers, and pharmacodynamics (PD), tolerability, and efficacy of JI-101 in ovarian cancer. This was the first clinical study assessing anti-tumor activity of JI-101 in a combinatorial regimen. In the PK cohort, four patients received single agent 10 mg everolimus on day 1, 10 mg everolimus and 200 mg JI-101 combination on day 8, and single agent 200 mg JI-101 on day 15. In the PD cohort, eleven patients received single agent JI-101 at 200 mg twice daily for 28 day treatment cycles. JI-101 was well tolerated as a single agent and in combination with everolimus. No serious adverse events were observed. Common adverse events were hypertension, nausea, and abdominal pain. JI-101 increased exposure of everolimus by approximately 22%, suggestive of drug-drug interaction. The majority of patients had stable disease at their first set of restaging scans (two months), although no patients demonstrated a response to the drug per RECIST criteria. The novel mechanism of action of JI-101 is promising in ovarian cancer treatment and further prospective studies of this agent may be pursued in a less refractory patient population or in combination with cytotoxic chemotherapy.

FOREWORD: Focus on Combinatorial Materials Science Focus on Combinatorial Materials Science

NASA Astrophysics Data System (ADS)

Chikyo, Toyohiro

2011-10-01

About 15 years have passed since the introduction of modern combinatorial synthesis and high-throughput techniques for the development of novel inorganic materials; however, similar methods existed before. The most famous was reported in 1970 by Hanak who prepared composition-spread films of metal alloys by sputtering mixed-material targets. Although this method was innovative, it was rarely used because of the large amount of data to be processed. This problem is solved in the modern combinatorial material research, which is strongly related to computer data analysis and robotics. This field is still at the developing stage and may be enriched by new methods. Nevertheless, given the progress in measurement equipment and procedures, we believe the combinatorial approach will become a major and standard tool of materials screening and development. The first article of this journal, published in 2000, was titled 'Combinatorial solid state materials science and technology', and this focus issue aims to reintroduce this topic to the Science and Technology of Advanced Materials audience. It covers recent progress in combinatorial materials research describing new results in catalysis, phosphors, polymers and metal alloys for shape memory materials. Sophisticated high-throughput characterization schemes and innovative synthesis tools are also presented, such as spray deposition using nanoparticles or ion plating. On a technical note, data handling systems are introduced to familiarize researchers with the combinatorial methodology. We hope that through this focus issue a wide audience of materials scientists can learn about recent and future trends in combinatorial materials science and high-throughput experimentation.

Combinatorial optimization problem solution based on improved genetic algorithm

NASA Astrophysics Data System (ADS)

Zhang, Peng

2017-08-01

Traveling salesman problem (TSP) is a classic combinatorial optimization problem. It is a simplified form of many complex problems. In the process of study and research, it is understood that the parameters that affect the performance of genetic algorithm mainly include the quality of initial population, the population size, and crossover probability and mutation probability values. As a result, an improved genetic algorithm for solving TSP problems is put forward. The population is graded according to individual similarity, and different operations are performed to different levels of individuals. In addition, elitist retention strategy is adopted at each level, and the crossover operator and mutation operator are improved. Several experiments are designed to verify the feasibility of the algorithm. Through the experimental results analysis, it is proved that the improved algorithm can improve the accuracy and efficiency of the solution.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hunt, H.B. III; Rosenkrantz, D.J.; Stearns, R.E.

We study both the complexity and approximability of various graph and combinatorial problems specified using two dimensional narrow periodic specifications (see [CM93, HW92, KMW67, KO91, Or84b, Wa93]). The following two general kinds of results are presented. (1) We prove that a number of natural graph and combinatorial problems are NEXPTIME- or EXPSPACE-complete when instances are so specified; (2) In contrast, we prove that the optimization versions of several of these NEXPTIME-, EXPSPACE-complete problems have polynomial time approximation algorithms with constant performance guarantees. Moreover, some of these problems even have polynomial time approximation schemes. We also sketch how our NEXPTIME-hardness resultsmore » can be used to prove analogous NEXPTIME-hardness results for problems specified using other kinds of succinct specification languages. Our results provide the first natural problems for which there is a proven exponential (and possibly doubly exponential) gap between the complexities of finding exact and approximate solutions.« less

Study on the E-commerce platform based on the agent

NASA Astrophysics Data System (ADS)

Fu, Ruixue; Qin, Lishuan; Gao, Yinmin

2011-10-01

To solve problem of dynamic integration in e-commerce, the Multi-Agent architecture of electronic commerce platform system based on Agent and Ontology has been introduced, which includes three major types of agent, Ontology and rule collection. In this architecture, service agent and rule are used to realize the business process reengineering, the reuse of software component, and agility of the electronic commerce platform. To illustrate the architecture, a simulation work has been done and the results imply that the architecture provides a very efficient method to design and implement the flexible, distributed, open and intelligent electronic commerce platform system to solve problem of dynamic integration in ecommerce. The objective of this paper is to illustrate the architecture of electronic commerce platform system, and the approach how Agent and Ontology support the electronic commerce platform system.

Memoryless cooperative graph search based on the simulated annealing algorithm

NASA Astrophysics Data System (ADS)

Hou, Jian; Yan, Gang-Feng; Fan, Zhen

2011-04-01

We have studied the problem of reaching a globally optimal segment for a graph-like environment with a single or a group of autonomous mobile agents. Firstly, two efficient simulated-annealing-like algorithms are given for a single agent to solve the problem in a partially known environment and an unknown environment, respectively. It shows that under both proposed control strategies, the agent will eventually converge to a globally optimal segment with probability 1. Secondly, we use multi-agent searching to simultaneously reduce the computation complexity and accelerate convergence based on the algorithms we have given for a single agent. By exploiting graph partition, a gossip-consensus method based scheme is presented to update the key parameter—radius of the graph, ensuring that the agents spend much less time finding a globally optimal segment.

Reducing Interaction Costs for Self-interested Agents

NASA Astrophysics Data System (ADS)

Zhang, Yunqi; Larson, Kate

In many multiagent systems, agents are not able to freely interact with each other or with a centralized mechanism. They may be limited in their interactions by cost or by the inherent structure of the system. Using a combinatorial auction application as motivation, we study the impact of interaction costs and structure on the strategic behaviour of self-interested agents. We present a particular model of costly agent-interaction, and argue that self-interested agents may wish to coordinate their actions with their neighbours so as to reduce their individual costs. We highlight the issues that arise in such a setting, propose a cost-sharing mechanism that agents can use, and discuss group coordination procedures. Experimental work validates our model.

A multi-agent intelligent environment for medical knowledge.

PubMed

Vicari, Rosa M; Flores, Cecilia D; Silvestre, André M; Seixas, Louise J; Ladeira, Marcelo; Coelho, Helder

2003-03-01

AMPLIA is a multi-agent intelligent learning environment designed to support training of diagnostic reasoning and modelling of domains with complex and uncertain knowledge. AMPLIA focuses on the medical area. It is a system that deals with uncertainty under the Bayesian network approach, where learner-modelling tasks will consist of creating a Bayesian network for a problem the system will present. The construction of a network involves qualitative and quantitative aspects. The qualitative part concerns the network topology, that is, causal relations among the domain variables. After it is ready, the quantitative part is specified. It is composed of the distribution of conditional probability of the variables represented. A negotiation process (managed by an intelligent MediatorAgent) will treat the differences of topology and probability distribution between the model the learner built and the one built-in in the system. That negotiation process occurs between the agents that represent the expert knowledge domain (DomainAgent) and the agent that represents the learner knowledge (LearnerAgent).

Multi-agent robotic systems and applications for satellite missions

NASA Astrophysics Data System (ADS)

Nunes, Miguel A.

A revolution in the space sector is happening. It is expected that in the next decade there will be more satellites launched than in the previous sixty years of space exploration. Major challenges are associated with this growth of space assets such as the autonomy and management of large groups of satellites, in particular with small satellites. There are two main objectives for this work. First, a flexible and distributed software architecture is presented to expand the possibilities of spacecraft autonomy and in particular autonomous motion in attitude and position. The approach taken is based on the concept of distributed software agents, also referred to as multi-agent robotic system. Agents are defined as software programs that are social, reactive and proactive to autonomously maximize the chances of achieving the set goals. Part of the work is to demonstrate that a multi-agent robotic system is a feasible approach for different problems of autonomy such as satellite attitude determination and control and autonomous rendezvous and docking. The second main objective is to develop a method to optimize multi-satellite configurations in space, also known as satellite constellations. This automated method generates new optimal mega-constellations designs for Earth observations and fast revisit times on large ground areas. The optimal satellite constellation can be used by researchers as the baseline for new missions. The first contribution of this work is the development of a new multi-agent robotic system for distributing the attitude determination and control subsystem for HiakaSat. The multi-agent robotic system is implemented and tested on the satellite hardware-in-the-loop testbed that simulates a representative space environment. The results show that the newly proposed system for this particular case achieves an equivalent control performance when compared to the monolithic implementation. In terms on computational efficiency it is found that the multi-agent robotic system has a consistent lower CPU load of 0.29 +/- 0.03 compared to 0.35 +/- 0.04 for the monolithic implementation, a 17.1 % reduction. The second contribution of this work is the development of a multi-agent robotic system for the autonomous rendezvous and docking of multiple spacecraft. To compute the maneuvers guidance, navigation and control algorithms are implemented as part of the multi-agent robotic system. The navigation and control functions are implemented using existing algorithms, but one important contribution of this section is the introduction of a new six degrees of freedom guidance method which is part of the guidance, navigation and control architecture. This new method is an explicit solution to the guidance problem, and is particularly useful for real time guidance for attitude and position, as opposed to typical guidance methods which are based on numerical solutions, and therefore are computationally intensive. A simulation scenario is run for docking four CubeSats deployed radially from a launch vehicle. Considering fully actuated CubeSats, the simulations show docking maneuvers that are successfully completed within 25 minutes which is approximately 30% of a full orbital period in low earth orbit. The final section investigates the problem of optimization of satellite constellations for fast revisit time, and introduces a new method to generate different constellation configurations that are evaluated with a genetic algorithm. Two case studies are presented. The first is the optimization of a constellation for rapid coverage of the oceans of the globe in 24 hours or less. Results show that for an 80 km sensor swath width 50 satellites are required to cover the oceans with a 24 hour revisit time. The second constellation configuration study focuses on the optimization for the rapid coverage of the North Atlantic Tracks for air traffic monitoring in 3 hours or less. The results show that for a fixed swath width of 160 km and for a 3 hour revisit time 52 satellites are required.

A gradient system solution to Potts mean field equations and its electronic implementation.

PubMed

Urahama, K; Ueno, S

1993-03-01

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.

Statistical physics of hard combinatorial optimization: Vertex cover problem

NASA Astrophysics Data System (ADS)

Zhao, Jin-Hua; Zhou, Hai-Jun

2014-07-01

Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management.

PubMed

Cruz-Piris, Luis; Rivera, Diego; Fernandez, Susel; Marsa-Maestre, Ivan

2018-02-02

One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network.

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management

PubMed Central

2018-01-01

One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network. PMID:29393884

Multi-agent Negotiation Mechanisms for Statistical Target Classification in Wireless Multimedia Sensor Networks

PubMed Central

Wang, Xue; Bi, Dao-wei; Ding, Liang; Wang, Sheng

2007-01-01

The recent availability of low cost and miniaturized hardware has allowed wireless sensor networks (WSNs) to retrieve audio and video data in real world applications, which has fostered the development of wireless multimedia sensor networks (WMSNs). Resource constraints and challenging multimedia data volume make development of efficient algorithms to perform in-network processing of multimedia contents imperative. This paper proposes solving problems in the domain of WMSNs from the perspective of multi-agent systems. The multi-agent framework enables flexible network configuration and efficient collaborative in-network processing. The focus is placed on target classification in WMSNs where audio information is retrieved by microphones. To deal with the uncertainties related to audio information retrieval, the statistical approaches of power spectral density estimates, principal component analysis and Gaussian process classification are employed. A multi-agent negotiation mechanism is specially developed to efficiently utilize limited resources and simultaneously enhance classification accuracy and reliability. The negotiation is composed of two phases, where an auction based approach is first exploited to allocate the classification task among the agents and then individual agent decisions are combined by the committee decision mechanism. Simulation experiments with real world data are conducted and the results show that the proposed statistical approaches and negotiation mechanism not only reduce memory and computation requirements in WMSNs but also significantly enhance classification accuracy and reliability. PMID:28903223

Enhanced risk management by an emerging multi-agent architecture

NASA Astrophysics Data System (ADS)

Lin, Sin-Jin; Hsu, Ming-Fu

2014-07-01

Classification in imbalanced datasets has attracted much attention from researchers in the field of machine learning. Most existing techniques tend not to perform well on minority class instances when the dataset is highly skewed because they focus on minimising the forecasting error without considering the relative distribution of each class. This investigation proposes an emerging multi-agent architecture, grounded on cooperative learning, to solve the class-imbalanced classification problem. Additionally, this study deals further with the obscure nature of the multi-agent architecture and expresses comprehensive rules for auditors. The results from this study indicate that the presented model performs satisfactorily in risk management and is able to tackle a highly class-imbalanced dataset comparatively well. Furthermore, the knowledge visualised process, supported by real examples, can assist both internal and external auditors who must allocate limited detecting resources; they can take the rules as roadmaps to modify the auditing programme.

Recent Advances in the Discovery and Development of Marine Microbial Natural Products

PubMed Central

Xiong, Zhi-Qiang; Wang, Jian-Feng; Hao, Yu-You; Wang, Yong

2013-01-01

Marine microbial natural products (MMNPs) have attracted increasing attention from microbiologists, taxonomists, ecologists, agronomists, chemists and evolutionary biologists during the last few decades. Numerous studies have indicated that diverse marine microbes appear to have the capacity to produce an impressive array of MMNPs exhibiting a wide variety of biological activities such as antimicrobial, anti-tumor, anti-inflammatory and anti-cardiovascular agents. Marine microorganisms represent an underexplored reservoir for the discovery of MMNPs with unique scaffolds and for exploitation in the pharmaceutical and agricultural industries. This review focuses on MMNPs discovery and development over the past decades, including innovative isolation and culture methods, strategies for discovering novel MMNPs via routine screenings, metagenomics, genomics, combinatorial biosynthesis, and synthetic biology. The potential problems and future directions for exploring MMNPs are also discussed. PMID:23528949

Recent advances in the discovery and development of marine microbial natural products.

PubMed

Xiong, Zhi-Qiang; Wang, Jian-Feng; Hao, Yu-You; Wang, Yong

2013-03-08

Marine microbial natural products (MMNPs) have attracted increasing attention from microbiologists, taxonomists, ecologists, agronomists, chemists and evolutionary biologists during the last few decades. Numerous studies have indicated that diverse marine microbes appear to have the capacity to produce an impressive array of MMNPs exhibiting a wide variety of biological activities such as antimicrobial, anti-tumor, anti-inflammatory and anti-cardiovascular agents. Marine microorganisms represent an underexplored reservoir for the discovery of MMNPs with unique scaffolds and for exploitation in the pharmaceutical and agricultural industries. This review focuses on MMNPs discovery and development over the past decades, including innovative isolation and culture methods, strategies for discovering novel MMNPs via routine screenings, metagenomics, genomics, combinatorial biosynthesis, and synthetic biology. The potential problems and future directions for exploring MMNPs are also discussed.

Virtual screening of selective multitarget kinase inhibitors by combinatorial support vector machines.

PubMed

Ma, X H; Wang, R; Tan, C Y; Jiang, Y Y; Lu, T; Rao, H B; Li, X Y; Go, M L; Low, B C; Chen, Y Z

2010-10-04

Multitarget agents have been increasingly explored for enhancing efficacy and reducing countertarget activities and toxicities. Efficient virtual screening (VS) tools for searching selective multitarget agents are desired. Combinatorial support vector machines (C-SVM) were tested as VS tools for searching dual-inhibitors of 11 combinations of 9 anticancer kinase targets (EGFR, VEGFR, PDGFR, Src, FGFR, Lck, CDK1, CDK2, GSK3). C-SVM trained on 233-1,316 non-dual-inhibitors correctly identified 26.8%-57.3% (majority >36%) of the 56-230 intra-kinase-group dual-inhibitors (equivalent to the 50-70% yields of two independent individual target VS tools), and 12.2% of the 41 inter-kinase-group dual-inhibitors. C-SVM were fairly selective in misidentifying as dual-inhibitors 3.7%-48.1% (majority <20%) of the 233-1,316 non-dual-inhibitors of the same kinase pairs and 0.98%-4.77% of the 3,971-5,180 inhibitors of other kinases. C-SVM produced low false-hit rates in misidentifying as dual-inhibitors 1,746-4,817 (0.013%-0.036%) of the 13.56 M PubChem compounds, 12-175 (0.007%-0.104%) of the 168 K MDDR compounds, and 0-84 (0.0%-2.9%) of the 19,495-38,483 MDDR compounds similar to the known dual-inhibitors. C-SVM was compared to other VS methods Surflex-Dock, DOCK Blaster, kNN and PNN against the same sets of kinase inhibitors and the full set or subset of the 1.02 M Zinc clean-leads data set. C-SVM produced comparable dual-inhibitor yields, slightly better false-hit rates for kinase inhibitors, and significantly lower false-hit rates for the Zinc clean-leads data set. Combinatorial SVM showed promising potential for searching selective multitarget agents against intra-kinase-group kinases without explicit knowledge of multitarget agents.

Learning in engineered multi-agent systems

NASA Astrophysics Data System (ADS)

Menon, Anup

Consider the problem of maximizing the total power produced by a wind farm. Due to aerodynamic interactions between wind turbines, each turbine maximizing its individual power---as is the case in present-day wind farms---does not lead to optimal farm-level power capture. Further, there are no good models to capture the said aerodynamic interactions, rendering model based optimization techniques ineffective. Thus, model-free distributed algorithms are needed that help turbines adapt their power production on-line so as to maximize farm-level power capture. Motivated by such problems, the main focus of this dissertation is a distributed model-free optimization problem in the context of multi-agent systems. The set-up comprises of a fixed number of agents, each of which can pick an action and observe the value of its individual utility function. An individual's utility function may depend on the collective action taken by all agents. The exact functional form (or model) of the agent utility functions, however, are unknown; an agent can only measure the numeric value of its utility. The objective of the multi-agent system is to optimize the welfare function (i.e. sum of the individual utility functions). Such a collaborative task requires communications between agents and we allow for the possibility of such inter-agent communications. We also pay attention to the role played by the pattern of such information exchange on certain aspects of performance. We develop two algorithms to solve this problem. The first one, engineered Interactive Trial and Error Learning (eITEL) algorithm, is based on a line of work in the Learning in Games literature and applies when agent actions are drawn from finite sets. While in a model-free setting, we introduce a novel qualitative graph-theoretic framework to encode known directed interactions of the form "which agents' action affect which others' payoff" (interaction graph). We encode explicit inter-agent communications in a directed graph (communication graph) and, under certain conditions, prove convergence of agent joint action (under eITEL) to the welfare optimizing set. The main condition requires that the union of interaction and communication graphs be strongly connected; thus the algorithm combines an implicit form of communication (via interactions through utility functions) with explicit inter-agent communications to achieve the given collaborative goal. This work has kinship with certain evolutionary computation techniques such as Simulated Annealing; the algorithm steps are carefully designed such that it describes an ergodic Markov chain with a stationary distribution that has support over states where agent joint actions optimize the welfare function. The main analysis tool is perturbed Markov chains and results of broader interest regarding these are derived as well. The other algorithm, Collaborative Extremum Seeking (CES), uses techniques from extremum seeking control to solve the problem when agent actions are drawn from the set of real numbers. In this case, under the assumption of existence of a local minimizer for the welfare function and a connected undirected communication graph between agents, a result regarding convergence of joint action to a small neighborhood of a local optimizer of the welfare function is proved. Since extremum seeking control uses a simultaneous gradient estimation-descent scheme, gradient information available in the continuous action space formulation is exploited by the CES algorithm to yield improved convergence speeds. The effectiveness of this algorithm for the wind farm power maximization problem is evaluated via simulations. Lastly, we turn to a different question regarding role of the information exchange pattern on performance of distributed control systems by means of a case study for the vehicle platooning problem. In the vehicle platoon control problem, the objective is to design distributed control laws for individual vehicles in a platoon (or a road-train) that regulate inter-vehicle distances at a specified safe value while the entire platoon follows a leader-vehicle. While most of the literature on the problem deals with some inadequacy in control performance when the information exchange is of the nearest neighbor-type, we consider an arbitrary graph serving as information exchange pattern and derive a relationship between how a certain indicator of control performance is related to the information pattern. Such analysis helps in understanding qualitative features of the `right' information pattern for this problem.

Modeling, Simulation, and Characterization of Distributed Multi-Agent Systems

DTIC Science & Technology

2012-01-01

capabilities (vision, LIDAR , differential global positioning, ultrasonic proximity sensing, etc.), the agents comprising a MAS tend to have somewhat lesser...on the simultaneous localization and mapping ( SLAM ) problem [19]. SLAM acknowledges that externally-provided localization information is not...continually-updated mapping databases, generates a comprehensive representation of the spatial and spectral environment. Many times though, inherent SLAM

Learning Sequences of Actions in Collectives of Autonomous Agents

NASA Technical Reports Server (NTRS)

Turner, Kagan; Agogino, Adrian K.; Wolpert, David H.; Clancy, Daniel (Technical Monitor)

2001-01-01

In this paper we focus on the problem of designing a collective of autonomous agents that individually learn sequences of actions such that the resultant sequence of joint actions achieves a predetermined global objective. We are particularly interested in instances of this problem where centralized control is either impossible or impractical. For single agent systems in similar domains, machine learning methods (e.g., reinforcement learners) have been successfully used. However, applying such solutions directly to multi-agent systems often proves problematic, as agents may work at cross-purposes, or have difficulty in evaluating their contribution to achievement of the global objective, or both. Accordingly, the crucial design step in multiagent systems centers on determining the private objectives of each agent so that as the agents strive for those objectives, the system reaches a good global solution. In this work we consider a version of this problem involving multiple autonomous agents in a grid world. We use concepts from collective intelligence to design goals for the agents that are 'aligned' with the global goal, and are 'learnable' in that agents can readily see how their behavior affects their utility. We show that reinforcement learning agents using those goals outperform both 'natural' extensions of single agent algorithms and global reinforcement, learning solutions based on 'team games'.

Signal dimensionality and the emergence of combinatorial structure.

PubMed

Little, Hannah; Eryılmaz, Kerem; de Boer, Bart

2017-11-01

In language, a small number of meaningless building blocks can be combined into an unlimited set of meaningful utterances. This is known as combinatorial structure. One hypothesis for the initial emergence of combinatorial structure in language is that recombining elements of signals solves the problem of overcrowding in a signal space. Another hypothesis is that iconicity may impede the emergence of combinatorial structure. However, how these two hypotheses relate to each other is not often discussed. In this paper, we explore how signal space dimensionality relates to both overcrowding in the signal space and iconicity. We use an artificial signalling experiment to test whether a signal space and a meaning space having similar topologies will generate an iconic system and whether, when the topologies differ, the emergence of combinatorially structured signals is facilitated. In our experiments, signals are created from participants' hand movements, which are measured using an infrared sensor. We found that participants take advantage of iconic signal-meaning mappings where possible. Further, we use trajectory predictability, measures of variance, and Hidden Markov Models to measure the use of structure within the signals produced and found that when topologies do not match, then there is more evidence of combinatorial structure. The results from these experiments are interpreted in the context of the differences between the emergence of combinatorial structure in different linguistic modalities (speech and sign). Copyright © 2017 Elsevier B.V. All rights reserved.

Multi-agent coordination algorithms for control of distributed energy resources in smart grids

NASA Astrophysics Data System (ADS)

Cortes, Andres

Sustainable energy is a top-priority for researchers these days, since electricity and transportation are pillars of modern society. Integration of clean energy technologies such as wind, solar, and plug-in electric vehicles (PEVs), is a major engineering challenge in operation and management of power systems. This is due to the uncertain nature of renewable energy technologies and the large amount of extra load that PEVs would add to the power grid. Given the networked structure of a power system, multi-agent control and optimization strategies are natural approaches to address the various problems of interest for the safe and reliable operation of the power grid. The distributed computation in multi-agent algorithms addresses three problems at the same time: i) it allows for the handling of problems with millions of variables that a single processor cannot compute, ii) it allows certain independence and privacy to electricity customers by not requiring any usage information, and iii) it is robust to localized failures in the communication network, being able to solve problems by simply neglecting the failing section of the system. We propose various algorithms to coordinate storage, generation, and demand resources in a power grid using multi-agent computation and decentralized decision making. First, we introduce a hierarchical vehicle-one-grid (V1G) algorithm for coordination of PEVs under usage constraints, where energy only flows from the grid in to the batteries of PEVs. We then present a hierarchical vehicle-to-grid (V2G) algorithm for PEV coordination that takes into consideration line capacity constraints in the distribution grid, and where energy flows both ways, from the grid in to the batteries, and from the batteries to the grid. Next, we develop a greedy-like hierarchical algorithm for management of demand response events with on/off loads. Finally, we introduce distributed algorithms for the optimal control of distributed energy resources, i.e., generation and storage in a microgrid. The algorithms we present are provably correct and tested in simulation. Each algorithm is assumed to work on a particular network topology, and simulation studies are carried out in order to demonstrate their convergence properties to a desired solution.

The Subset Sum game.

PubMed

Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; Schauer, Joachim

2014-03-16

In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one of its items (not previously selected) and includes it in the knapsack if there is enough capacity. The process ends when the remaining capacity is too small for including any item left. We look at the problem from a single agent point of view and show that finding an optimal sequence of items to select is an [Formula: see text]-hard problem. Therefore we propose two natural heuristic strategies and analyze their worst-case performance when (1) the opponent is able to play optimally and (2) the opponent adopts a greedy strategy. From a centralized perspective we observe that some known results on the approximation of the classical Subset Sum can be effectively adapted to the multi-agent version of the problem.

The Subset Sum game☆

PubMed Central

Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; Schauer, Joachim

2014-01-01

In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one of its items (not previously selected) and includes it in the knapsack if there is enough capacity. The process ends when the remaining capacity is too small for including any item left. We look at the problem from a single agent point of view and show that finding an optimal sequence of items to select is an NP-hard problem. Therefore we propose two natural heuristic strategies and analyze their worst-case performance when (1) the opponent is able to play optimally and (2) the opponent adopts a greedy strategy. From a centralized perspective we observe that some known results on the approximation of the classical Subset Sum can be effectively adapted to the multi-agent version of the problem. PMID:25844012

Parallel tempering for the traveling salesman problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Percus, Allon; Wang, Richard; Hyman, Jeffrey

We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a straightforward implementation of parallel tempering can outperform simulated annealing in several crucial respects. When parameters are chosen appropriately, both methods yield close approximation to the actual minimum distance for an instance with 200 nodes. However, parallel tempering yields more consistently accurate results when a series of independent simulationsmore » are performed. Our results suggest that parallel tempering might offer a simple but powerful alternative to simulated annealing for combinatorial optimization problems.« less

Consensus for multi-agent systems with time-varying input delays

NASA Astrophysics Data System (ADS)

Yuan, Chengzhi; Wu, Fen

2017-10-01

This paper addresses the consensus control problem for linear multi-agent systems subject to uniform time-varying input delays and external disturbance. A novel state-feedback consensus protocol is proposed under the integral quadratic constraint (IQC) framework, which utilises not only the relative state information from neighbouring agents but also the real-time information of delays by means of the dynamic IQC system states for feedback control. Based on this new consensus protocol, the associated IQC-based control synthesis conditions are established and fully characterised as linear matrix inequalities (LMIs), such that the consensus control solution with optimal ? disturbance attenuation performance can be synthesised efficiently via convex optimisation. A numerical example is used to demonstrate the proposed approach.

A trust-based sensor allocation algorithm in cooperative space search problems

NASA Astrophysics Data System (ADS)

Shen, Dan; Chen, Genshe; Pham, Khanh; Blasch, Erik

2011-06-01

Sensor allocation is an important and challenging problem within the field of multi-agent systems. The sensor allocation problem involves deciding how to assign a number of targets or cells to a set of agents according to some allocation protocol. Generally, in order to make efficient allocations, we need to design mechanisms that consider both the task performers' costs for the service and the associated probability of success (POS). In our problem, the costs are the used sensor resource, and the POS is the target tracking performance. Usually, POS may be perceived differently by different agents because they typically have different standards or means of evaluating the performance of their counterparts (other sensors in the search and tracking problem). Given this, we turn to the notion of trust to capture such subjective perceptions. In our approach, we develop a trust model to construct a novel mechanism that motivates sensor agents to limit their greediness or selfishness. Then we model the sensor allocation optimization problem with trust-in-loop negotiation game and solve it using a sub-game perfect equilibrium. Numerical simulations are performed to demonstrate the trust-based sensor allocation algorithm in cooperative space situation awareness (SSA) search problems.

Mixture-based combinatorial libraries from small individual peptide libraries: a case study on α1-antitrypsin deficiency.

PubMed

Chang, Yi-Pin; Chu, Yen-Ho

2014-05-16

The design, synthesis and screening of diversity-oriented peptide libraries using a "libraries from libraries" strategy for the development of inhibitors of α1-antitrypsin deficiency are described. The major buttress of the biochemical approach presented here is the use of well-established solid-phase split-and-mix method for the generation of mixture-based libraries. The combinatorial technique iterative deconvolution was employed for library screening. While molecular diversity is the general consideration of combinatorial libraries, exquisite design through systematic screening of small individual libraries is a prerequisite for effective library screening and can avoid potential problems in some cases. This review will also illustrate how large peptide libraries were designed, as well as how a conformation-sensitive assay was developed based on the mechanism of the conformational disease. Finally, the combinatorially selected peptide inhibitor capable of blocking abnormal protein aggregation will be characterized by biophysical, cellular and computational methods.

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.

PubMed

Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk

2017-01-01

Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.

Free-Riding and Free-Labor in Combinatorial Agency

NASA Astrophysics Data System (ADS)

Babaioff, Moshe; Feldman, Michal; Nisan, Noam

This paper studies a setting where a principal needs to motivate teams of agents whose efforts lead to an outcome that stochastically depends on the combination of agents’ actions, which are not directly observable by the principal. In [1] we suggest and study a basic “combinatorial agency” model for this setting. In this paper we expose a somewhat surprising phenomenon found in this setting: cases where the principal can gain by asking agents to reduce their effort level, even when this increased effort comes for free. This phenomenon cannot occur in a setting where the principal can observe the agents’ actions, but we show that it can occur in the hidden-actions setting. We prove that for the family of technologies that exhibit “increasing returns to scale” this phenomenon cannot happen, and that in some sense this is a maximal family of technologies for which the phenomenon cannot occur. Finally, we relate our results to a basic question in production design in firms.

Antenna Allocation in MIMO Radar with Widely Separated Antennas for Multi-Target Detection

PubMed Central

Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

2014-01-01

In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes. PMID:25350505

Antenna allocation in MIMO radar with widely separated antennas for multi-target detection.

PubMed

Gao, Hao; Wang, Jian; Jiang, Chunxiao; Zhang, Xudong

2014-10-27

In this paper, we explore a new resource called multi-target diversity to optimize the performance of multiple input multiple output (MIMO) radar with widely separated antennas for detecting multiple targets. In particular, we allocate antennas of the MIMO radar to probe different targets simultaneously in a flexible manner based on the performance metric of relative entropy. Two antenna allocation schemes are proposed. In the first scheme, each antenna is allocated to illuminate a proper target over the entire illumination time, so that the detection performance of each target is guaranteed. The problem is formulated as a minimum makespan scheduling problem in the combinatorial optimization framework. Antenna allocation is implemented through a branch-and-bound algorithm and an enhanced factor 2 algorithm. In the second scheme, called antenna-time allocation, each antenna is allocated to illuminate different targets with different illumination time. Both antenna allocation and time allocation are optimized based on illumination probabilities. Over a large range of transmitted power, target fluctuations and target numbers, both of the proposed antenna allocation schemes outperform the scheme without antenna allocation. Moreover, the antenna-time allocation scheme achieves a more robust detection performance than branch-and-bound algorithm and the enhanced factor 2 algorithm when the target number changes.

Defining Clonal Color in Fluorescent Multi-Clonal Tracking

PubMed Central

Wu, Juwell W.; Turcotte, Raphaël; Alt, Clemens; Runnels, Judith M.; Tsao, Hensin; Lin, Charles P.

2016-01-01

Clonal heterogeneity and selection underpin many biological processes including development and tumor progression. Combinatorial fluorescent protein expression in germline cells has proven its utility for tracking the formation and regeneration of different organ systems. Such cell populations encoded by combinatorial fluorescent proteins are also attractive tools for understanding clonal expansion and clonal competition in cancer. However, the assignment of clonal identity requires an analytical framework in which clonal markings can be parameterized and validated. Here we present a systematic and quantitative method for RGB analysis of fluorescent melanoma cancer clones. We then demonstrate refined clonal trackability of melanoma cells using this scheme. PMID:27073117

A combinatorial perspective of the protein inference problem.

PubMed

Yang, Chao; He, Zengyou; Yu, Weichuan

2013-01-01

In a shotgun proteomics experiment, proteins are the most biologically meaningful output. The success of proteomics studies depends on the ability to accurately and efficiently identify proteins. Many methods have been proposed to facilitate the identification of proteins from peptide identification results. However, the relationship between protein identification and peptide identification has not been thoroughly explained before. In this paper, we devote ourselves to a combinatorial perspective of the protein inference problem. We employ combinatorial mathematics to calculate the conditional protein probabilities (protein probability means the probability that a protein is correctly identified) under three assumptions, which lead to a lower bound, an upper bound, and an empirical estimation of protein probabilities, respectively. The combinatorial perspective enables us to obtain an analytical expression for protein inference. Our method achieves comparable results with ProteinProphet in a more efficient manner in experiments on two data sets of standard protein mixtures and two data sets of real samples. Based on our model, we study the impact of unique peptides and degenerate peptides (degenerate peptides are peptides shared by at least two proteins) on protein probabilities. Meanwhile, we also study the relationship between our model and ProteinProphet. We name our program ProteinInfer. Its Java source code, our supplementary document and experimental results are available at: >http://bioinformatics.ust.hk/proteininfer.

Cross-Identification of Astronomical Catalogs on Multiple GPUs

NASA Astrophysics Data System (ADS)

Lee, M. A.; Budavári, T.

2013-10-01

One of the most fundamental problems in observational astronomy is the cross-identification of sources. Observations are made in different wavelengths, at different times, and from different locations and instruments, resulting in a large set of independent observations. The scientific outcome is often limited by our ability to quickly perform meaningful associations between detections. The matching, however, is difficult scientifically, statistically, as well as computationally. The former two require detailed physical modeling and advanced probabilistic concepts; the latter is due to the large volumes of data and the problem's combinatorial nature. In order to tackle the computational challenge and to prepare for future surveys, whose measurements will be exponentially increasing in size past the scale of feasible CPU-based solutions, we developed a new implementation which addresses the issue by performing the associations on multiple Graphics Processing Units (GPUs). Our implementation utilizes up to 6 GPUs in combination with the Thrust library to achieve an over 40x speed up verses the previous best implementation running on a multi-CPU SQL Server.

A path-oriented knowledge representation system: Defusing the combinatorial system

NASA Technical Reports Server (NTRS)

Karamouzis, Stamos T.; Barry, John S.; Smith, Steven L.; Feyock, Stefan

1995-01-01

LIMAP is a programming system oriented toward efficient information manipulation over fixed finite domains, and quantification over paths and predicates. A generalization of Warshall's Algorithm to precompute paths in a sparse matrix representation of semantic nets is employed to allow questions involving paths between components to be posed and answered easily. LIMAP's ability to cache all paths between two components in a matrix cell proved to be a computational obstacle, however, when the semantic net grew to realistic size. The present paper describes a means of mitigating this combinatorial explosion to an extent that makes the use of the LIMAP representation feasible for problems of significant size. The technique we describe radically reduces the size of the search space in which LIMAP must operate; semantic nets of more than 500 nodes have been attacked successfully. Furthermore, it appears that the procedure described is applicable not only to LIMAP, but to a number of other combinatorially explosive search space problems found in AI as well.

Must "Hard Problems" Be Hard?

ERIC Educational Resources Information Center

Kolata, Gina

1985-01-01

To determine how hard it is for computers to solve problems, researchers have classified groups of problems (polynomial hierarchy) according to how much time they seem to require for their solutions. A difficult and complex proof is offered which shows that a combinatorial approach (using Boolean circuits) may resolve the problem. (JN)

Development of the PEBLebl Traveling Salesman Problem Computerized Testbed

ERIC Educational Resources Information Center

Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew

2015-01-01

The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…

DeviceEditor visual biological CAD canvas

PubMed Central

2012-01-01

Background Biological Computer Aided Design (bioCAD) assists the de novo design and selection of existing genetic components to achieve a desired biological activity, as part of an integrated design-build-test cycle. To meet the emerging needs of Synthetic Biology, bioCAD tools must address the increasing prevalence of combinatorial library design, design rule specification, and scar-less multi-part DNA assembly. Results We report the development and deployment of web-based bioCAD software, DeviceEditor, which provides a graphical design environment that mimics the intuitive visual whiteboard design process practiced in biological laboratories. The key innovations of DeviceEditor include visual combinatorial library design, direct integration with scar-less multi-part DNA assembly design automation, and a graphical user interface for the creation and modification of design specification rules. We demonstrate how biological designs are rendered on the DeviceEditor canvas, and we present effective visualizations of genetic component ordering and combinatorial variations within complex designs. Conclusions DeviceEditor liberates researchers from DNA base-pair manipulation, and enables users to create successful prototypes using standardized, functional, and visual abstractions. Open and documented software interfaces support further integration of DeviceEditor with other bioCAD tools and software platforms. DeviceEditor saves researcher time and institutional resources through correct-by-construction design, the automation of tedious tasks, design reuse, and the minimization of DNA assembly costs. PMID:22373390

Modeling and simulation of dynamic ant colony's labor division for task allocation of UAV swarm

NASA Astrophysics Data System (ADS)

Wu, Husheng; Li, Hao; Xiao, Renbin; Liu, Jie

2018-02-01

The problem of unmanned aerial vehicle (UAV) task allocation not only has the intrinsic attribute of complexity, such as highly nonlinear, dynamic, highly adversarial and multi-modal, but also has a better practicability in various multi-agent systems, which makes it more and more attractive recently. In this paper, based on the classic fixed response threshold model (FRTM), under the idea of "problem centered + evolutionary solution" and by a bottom-up way, the new dynamic environmental stimulus, response threshold and transition probability are designed, and a dynamic ant colony's labor division (DACLD) model is proposed. DACLD allows a swarm of agents with a relatively low-level of intelligence to perform complex tasks, and has the characteristic of distributed framework, multi-tasks with execution order, multi-state, adaptive response threshold and multi-individual response. With the proposed model, numerical simulations are performed to illustrate the effectiveness of the distributed task allocation scheme in two situations of UAV swarm combat (dynamic task allocation with a certain number of enemy targets and task re-allocation due to unexpected threats). Results show that our model can get both the heterogeneous UAVs' real-time positions and states at the same time, and has high degree of self-organization, flexibility and real-time response to dynamic environments.

Anatomy of the Attraction Basins: Breaking with the Intuition.

PubMed

Hernando, Leticia; Mendiburu, Alexander; Lozano, Jose A

2018-05-22

Solving combinatorial optimization problems efficiently requires the development of algorithms that consider the specific properties of the problems. In this sense, local search algorithms are designed over a neighborhood structure that partially accounts for these properties. Considering a neighborhood, the space is usually interpreted as a natural landscape, with valleys and mountains. Under this perception, it is commonly believed that, if maximizing, the solutions located in the slopes of the same mountain belong to the same attraction basin, with the peaks of the mountains being the local optima. Unfortunately, this is a widespread erroneous visualization of a combinatorial landscape. Thus, our aim is to clarify this aspect, providing a detailed analysis of, first, the existence of plateaus where the local optima are involved, and second, the properties that define the topology of the attraction basins, picturing a reliable visualization of the landscapes. Some of the features explored in this paper have never been examined before. Hence, new findings about the structure of the attraction basins are shown. The study is focused on instances of permutation-based combinatorial optimization problems considering the 2-exchange and the insert neighborhoods. As a consequence of this work, we break away from the extended belief about the anatomy of attraction basins.

Addressing Production System Failures Using Multi-agent Control

NASA Astrophysics Data System (ADS)

Gautam, Rajesh; Miyashita, Kazuo

Output in high-volume production facilities is limited by bottleneck machines. We propose a control mechanism by modeling workstations as agents that pull jobs from other agents based on their current WIP level and requirements. During failures, when flows of some jobs are disrupted, the agents pull alternative jobs to maintain utilization of their capacity at a high level. In this paper, we empirically demonstrate that the proposed mechanism can react to failures more appropriately than other control mechanisms using a benchmark problem of a semiconductor manufacturing process.

Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.

PubMed

Smith, J E

2012-01-01

Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes outperform global reward schemes in combinatorial spaces, unlike in continuous spaces. An analysis of evolving meme behaviour is used to explain these findings.

GRADIENT: Graph Analytic Approach for Discovering Irregular Events, Nascent and Temporal

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hogan, Emilie

2015-03-31

Finding a time-ordered signature within large graphs is a computationally complex problem due to the combinatorial explosion of potential patterns. GRADIENT is designed to search and understand that problem space.

GRADIENT: Graph Analytic Approach for Discovering Irregular Events, Nascent and Temporal

ScienceCinema

Hogan, Emilie

2018-01-16

Finding a time-ordered signature within large graphs is a computationally complex problem due to the combinatorial explosion of potential patterns. GRADIENT is designed to search and understand that problem space.

Consensus for second-order multi-agent systems with position sampled data

NASA Astrophysics Data System (ADS)

Wang, Rusheng; Gao, Lixin; Chen, Wenhai; Dai, Dameng

2016-10-01

In this paper, the consensus problem with position sampled data for second-order multi-agent systems is investigated. The interaction topology among the agents is depicted by a directed graph. The full-order and reduced-order observers with position sampled data are proposed, by which two kinds of sampled data-based consensus protocols are constructed. With the provided sampled protocols, the consensus convergence analysis of a continuous-time multi-agent system is equivalently transformed into that of a discrete-time system. Then, by using matrix theory and a sampled control analysis method, some sufficient and necessary consensus conditions based on the coupling parameters, spectrum of the Laplacian matrix and sampling period are obtained. While the sampling period tends to zero, our established necessary and sufficient conditions are degenerated to the continuous-time protocol case, which are consistent with the existing result for the continuous-time case. Finally, the effectiveness of our established results is illustrated by a simple simulation example. Project supported by the Natural Science Foundation of Zhejiang Province, China (Grant No. LY13F030005) and the National Natural Science Foundation of China (Grant No. 61501331).

Nanoscale structure-activity relationships, mode of action, and biocompatibility of gold nanoparticle antibiotics.

PubMed

Bresee, Jamee; Bond, Constance M; Worthington, Roberta J; Smith, Candice A; Gifford, Jennifer C; Simpson, Carrie A; Carter, Carly J; Wang, Guankui; Hartman, Jesse; Osbaugh, Niki A; Shoemaker, Richard K; Melander, Christian; Feldheim, Daniel L

2014-04-09

The emergence of resistance to multiple antimicrobial agents by pathogenic bacteria has become a significant global public health threat. Multi-drug-resistant (MDR) Gram-negative bacteria have become particularly problematic, as no new classes of small-molecule antibiotics for Gram-negative bacteria have emerged in over two decades. We have developed a combinatorial screening process for identifying mixed ligand monolayer/gold nanoparticle conjugates (2.4 nm diameter) with antibiotic activity. The method previously led to the discovery of several conjugates with potent activity against the Gram-negative bacterium Escherichia coli. Here we show that these conjugates are also active against MDR E. coli and MDR Klebsiella pneumoniae. Moreover, we have shown that resistance to these nanoparticles develops significantly more slowly than to a commercial small-molecule drug. These results, combined with their relatively low toxicity to mammalian cells and biocompatibility in vivo, suggest that gold nanoparticles may be viable new candidates for the treatment of MDR Gram-negative bacterial infections.

Nucleophilic catalysis of acylhydrazone equilibration for protein-directed dynamic covalent chemistry

PubMed Central

Bhat, Venugopal T.; Caniard, Anne M.; Luksch, Torsten; Brenk, Ruth; Campopiano, Dominic J.; Greaney, Michael F.

2010-01-01

Dynamic covalent chemistry uses reversible chemical reactions to set up an equilibrating network of molecules at thermodynamic equilibrium, which can adjust its composition in response to any agent capable of altering the free energy of the system. When the target is a biological macromolecule, such as a protein, the process corresponds to the protein directing the synthesis of its own best ligand. Here, we demonstrate that reversible acylhydrazone formation is an effective chemistry for biological dynamic combinatorial library formation. In the presence of aniline as a nucleophilic catalyst, dynamic combinatorial libraries equilibrate rapidly at pH 6.2, are fully reversible, and may be switched on or off by means of a change in pH. We have interfaced these hydrazone dynamic combinatorial libraries with two isozymes from the glutathione S-transferase class of enzyme, and observed divergent amplification effects, where each protein selects the best-fitting hydrazone for the hydrophobic region of its active site. PMID:20489719

Polymeric nanofiber coating with tunable combinatorial antibiotic delivery prevents biofilm-associated infection in vivo

PubMed Central

Ashbaugh, Alyssa G.; Jiang, Xuesong; Zheng, Jesse; Tsai, Andrew S.; Kim, Woo-Shin; Thompson, John M.; Miller, Robert J.; Shahbazian, Jonathan H.; Wang, Yu; Dillen, Carly A.; Ordonez, Alvaro A.; Chang, Yong S.; Jain, Sanjay K.; Jones, Lynne C.; Sterling, Robert S.; Mao, Hai-Quan; Miller, Lloyd S.

2016-01-01

Bacterial biofilm formation is a major complication of implantable medical devices that results in therapeutically challenging chronic infections, especially in cases involving antibiotic-resistant bacteria. As an approach to prevent these infections, an electrospun composite coating comprised of poly(lactic-coglycolic acid) (PLGA) nanofibers embedded in a poly(ε-caprolactone) (PCL) film was developed to locally codeliver combinatorial antibiotics from the implant surface. The release of each antibiotic could be adjusted by loading each drug into the different polymers or by varying PLGA:PCL polymer ratios. In a mouse model of biofilm-associated orthopedic-implant infection, three different combinations of antibiotic-loaded coatings were highly effective in preventing infection of the bone/joint tissue and implant biofilm formation and were biocompatible with enhanced osseointegration. This nanofiber composite-coating technology could be used to tailor the delivery of combinatorial antimicrobial agents from various metallic implantable devices or prostheses to effectively decrease biofilm-associated infections in patients. PMID:27791154

Efficient search, mapping, and optimization of multi-protein genetic systems in diverse bacteria

PubMed Central

Farasat, Iman; Kushwaha, Manish; Collens, Jason; Easterbrook, Michael; Guido, Matthew; Salis, Howard M

2014-01-01

Developing predictive models of multi-protein genetic systems to understand and optimize their behavior remains a combinatorial challenge, particularly when measurement throughput is limited. We developed a computational approach to build predictive models and identify optimal sequences and expression levels, while circumventing combinatorial explosion. Maximally informative genetic system variants were first designed by the RBS Library Calculator, an algorithm to design sequences for efficiently searching a multi-protein expression space across a > 10,000-fold range with tailored search parameters and well-predicted translation rates. We validated the algorithm's predictions by characterizing 646 genetic system variants, encoded in plasmids and genomes, expressed in six gram-positive and gram-negative bacterial hosts. We then combined the search algorithm with system-level kinetic modeling, requiring the construction and characterization of 73 variants to build a sequence-expression-activity map (SEAMAP) for a biosynthesis pathway. Using model predictions, we designed and characterized 47 additional pathway variants to navigate its activity space, find optimal expression regions with desired activity response curves, and relieve rate-limiting steps in metabolism. Creating sequence-expression-activity maps accelerates the optimization of many protein systems and allows previous measurements to quantitatively inform future designs. PMID:24952589

The application of statistical mechanics on the study of glassy behaviors in transportation networks and dynamics in models of financial markets

NASA Astrophysics Data System (ADS)

Yeung, Chi Ho

In this thesis, we study two interdisciplinary problems in the framework of statistical physics, which show the broad applicability of physics on problems with various origins. The first problem corresponds to an optimization problem in allocating resources on random regular networks. Frustrations arise from competition for resources. When the initial resources are uniform, different regimes with discrete fractions of satisfied nodes are observed, resembling the Devil's staircase. We apply the spin glass theory in analyses and demonstrate how functional recursions are converted to simple recursions of probabilities. Equilibrium properties such as the average energy and the fraction of free nodes are derived. When the initial resources are bimodally distributed, increases in the fraction of rich nodes induce a glassy transition, entering a glassy phase described by the existence of multiple metastable states, in which we employ the replica symmetry breaking ansatz for analysis. The second problem corresponds to the study of multi-agent systems modeling financial markets. Agents in the system trade among themselves, and self-organize to produce macroscopic trading behaviors resembling the real financial markets. These behaviors include the arbitraging activities, the setting up and the following of price trends. A phase diagram of these behaviors is obtained, as a function of the sensitivity of price and the market impact factor. We finally test the applicability of the models with real financial data including the Hang Seng Index, the Nasdaq Composite and the Dow Jones Industrial Average. A substantial fraction of agents gains faster than the inflation rate of the indices, suggesting the possibility of using multi-agent systems as a tool for real trading.

Optimization of Highway Work Zone Decisions Considering Short-Term and Long-Term Impacts

DTIC Science & Technology

2010-01-01

strategies which can minimize the one-time work zone cost. Considering the complex and combinatorial nature of this optimization problem, a heuristic...combination of lane closure and traffic control strategies which can minimize the one-time work zone cost. Considering the complex and combinatorial nature ...zone) NV # the number of vehicle classes NPV $ Net Present Value p’(t) % Adjusted traffic diversion rate at time t p(t) % Natural diversion rate

Combinatorial effect of substratum properties on mesenchymal stem cell sheet engineering and subsequent multi-lineage differentiation.

PubMed

Chuah, Yon Jin; Zhang, Ying; Wu, Yingnan; Menon, Nishanth V; Goh, Ghim Hian; Lee, Ann Charlene; Chan, Vincent; Zhang, Yilei; Kang, Yuejun

2015-09-01

Cell sheet engineering has been exploited as an alternative approach in tissue regeneration and the use of stem cells to generate cell sheets has further showed its potential in stem cell-mediated tissue regeneration. There exist vast interests in developing strategies to enhance the formation of stem cell sheets for downstream applications. It has been proved that stem cells are sensitive to the biophysical cues of the microenvironment. Therefore we hypothesized that the combinatorial substratum properties could be tailored to modulate the development of cell sheet formation and further influence its multipotency. For validation, polydimethylsiloxane (PDMS) of different combinatorial substratum properties (including stiffness, roughness and wettability) were created, on which the human bone marrow derived mesenchymal stem cells (BMSCs) were cultured to form cell sheets with their multipotency evaluated after induced differentiation. The results showed that different combinatorial effects of these substratum properties were able to influence BMSC behavior such as adhesion, spreading and proliferation during cell sheet development. Collagen formation within the cell sheet was enhanced on substrates with lower stiffness, higher hydrophobicity and roughness, which further assisted the induced chondrogenesis and osteogenesis, respectively. These findings suggested that combinatorial substratum properties had profound effects on BMSC cell sheet integrity and multipotency, which had significant implications for future biomaterials and scaffold designs in the field of BMSC-mediated tissue regeneration. Copyright © 2015 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Optimal harvesting for a predator-prey agent-based model using difference equations.

PubMed

Oremland, Matthew; Laubenbacher, Reinhard

2015-03-01

In this paper, a method known as Pareto optimization is applied in the solution of a multi-objective optimization problem. The system in question is an agent-based model (ABM) wherein global dynamics emerge from local interactions. A system of discrete mathematical equations is formulated in order to capture the dynamics of the ABM; while the original model is built up analytically from the rules of the model, the paper shows how minor changes to the ABM rule set can have a substantial effect on model dynamics. To address this issue, we introduce parameters into the equation model that track such changes. The equation model is amenable to mathematical theory—we show how stability analysis can be performed and validated using ABM data. We then reduce the equation model to a simpler version and implement changes to allow controls from the ABM to be tested using the equations. Cohen's weighted κ is proposed as a measure of similarity between the equation model and the ABM, particularly with respect to the optimization problem. The reduced equation model is used to solve a multi-objective optimization problem via a technique known as Pareto optimization, a heuristic evolutionary algorithm. Results show that the equation model is a good fit for ABM data; Pareto optimization provides a suite of solutions to the multi-objective optimization problem that can be implemented directly in the ABM.

Combinatorial Tasks and Outcome Listing: Examining Productive Listing among Undergraduate Students

ERIC Educational Resources Information Center

Lockwood, Elise; Gibson, Bryan R.

2016-01-01

Although counting problems are easy to state and provide rich, accessible problem-solving situations, there is much evidence that students struggle with solving counting problems correctly. With combinatorics (and the study of counting problems) becoming increasingly prevalent in K-12 and undergraduate curricula, there is a need for researchers to…

Combinatorial Strategies for the Development of Bulk Metallic Glasses

NASA Astrophysics Data System (ADS)

Ding, Shiyan

The systematic identification of multi-component alloys out of the vast composition space is still a daunting task, especially in the development of bulk metallic glasses that are typically based on three or more elements. In order to address this challenge, combinatorial approaches have been proposed. However, previous attempts have not successfully coupled the synthesis of combinatorial libraries with high-throughput characterization methods. The goal of my dissertation is to develop efficient high-throughput characterization methods, optimized to identify glass formers systematically. Here, two innovative approaches have been invented. One is to measure the nucleation temperature in parallel for up-to 800 compositions. The composition with the lowest nucleation temperature has a reasonable agreement with the best-known glass forming composition. In addition, the thermoplastic formability of a metallic glass forming system is determined through blow molding a compositional library. Our results reveal that the composition with the largest thermoplastic deformation correlates well with the best-known formability composition. I have demonstrated both methods as powerful tools to develop new bulk metallic glasses.

Combat Resource Allocation Planning in Naval Engagements

DTIC Science & Technology

2007-08-01

presented and discussed in this report. The coordination problems are discussed in the companion report [2]. The developed Agent and Multi-agent-based...Technology Chef de file au Canada en matière de science et de technologie pour la défense et la sécurité nationale WWW.drdc-rddc.gc.ca Defence R&D Canada R & D pour la défense Canada

Multi-object tracking of human spermatozoa

NASA Astrophysics Data System (ADS)

Sørensen, Lauge; Østergaard, Jakob; Johansen, Peter; de Bruijne, Marleen

2008-03-01

We propose a system for tracking of human spermatozoa in phase-contrast microscopy image sequences. One of the main aims of a computer-aided sperm analysis (CASA) system is to automatically assess sperm quality based on spermatozoa motility variables. In our case, the problem of assessing sperm quality is cast as a multi-object tracking problem, where the objects being tracked are the spermatozoa. The system combines a particle filter and Kalman filters for robust motion estimation of the spermatozoa tracks. Further, the combinatorial aspect of assigning observations to labels in the particle filter is formulated as a linear assignment problem solved using the Hungarian algorithm on a rectangular cost matrix, making the algorithm capable of handling missing or spurious observations. The costs are calculated using hidden Markov models that express the plausibility of an observation being the next position in the track history of the particle labels. Observations are extracted using a scale-space blob detector utilizing the fact that the spermatozoa appear as bright blobs in a phase-contrast microscope. The output of the system is the complete motion track of each of the spermatozoa. Based on these tracks, different CASA motility variables can be computed, for example curvilinear velocity or straight-line velocity. The performance of the system is tested on three different phase-contrast image sequences of varying complexity, both by visual inspection of the estimated spermatozoa tracks and by measuring the mean squared error (MSE) between the estimated spermatozoa tracks and manually annotated tracks, showing good agreement.

Computer-Based Assessment of Collaborative Problem Solving: Exploring the Feasibility of Human-to-Agent Approach

ERIC Educational Resources Information Center

Rosen, Yigal

2015-01-01

How can activities in which collaborative skills of an individual are measured be standardized? In order to understand how students perform on collaborative problem solving (CPS) computer-based assessment, it is necessary to examine empirically the multi-faceted performance that may be distributed across collaboration methods. The aim of this…

A platform for rapid prototyping of synthetic gene networks in mammalian cells

PubMed Central

Duportet, Xavier; Wroblewska, Liliana; Guye, Patrick; Li, Yinqing; Eyquem, Justin; Rieders, Julianne; Rimchala, Tharathorn; Batt, Gregory; Weiss, Ron

2014-01-01

Mammalian synthetic biology may provide novel therapeutic strategies, help decipher new paths for drug discovery and facilitate synthesis of valuable molecules. Yet, our capacity to genetically program cells is currently hampered by the lack of efficient approaches to streamline the design, construction and screening of synthetic gene networks. To address this problem, here we present a framework for modular and combinatorial assembly of functional (multi)gene expression vectors and their efficient and specific targeted integration into a well-defined chromosomal context in mammalian cells. We demonstrate the potential of this framework by assembling and integrating different functional mammalian regulatory networks including the largest gene circuit built and chromosomally integrated to date (6 transcription units, 27kb) encoding an inducible memory device. Using a library of 18 different circuits as a proof of concept, we also demonstrate that our method enables one-pot/single-flask chromosomal integration and screening of circuit libraries. This rapid and powerful prototyping platform is well suited for comparative studies of genetic regulatory elements, genes and multi-gene circuits as well as facile development of libraries of isogenic engineered cell lines. PMID:25378321

Mean square consensus of leader-following multi-agent systems with measurement noises and time delays.

PubMed

Ren, Hongwei; Deng, Feiqi

2017-11-01

This paper investigates the mean square consensus problem of dynamical networks of leader-following multi-agent systems with measurement noises and time-varying delays. We consider that the fixed undirected communication topologies are connected. A neighbor-based tracking algorithm together with distributed estimators are presented. Using tools of algebraic graph theory and the Gronwall-Bellman-Halanay type inequality, we establish sufficient conditions to reach consensus in mean square sense via the proposed consensus protocols. Finally, a numerical simulation is provided to demonstrate the effectiveness of the obtained theoretical result. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Human-Centric Teaming in a Multi-Agent EVA Assembly Task

NASA Technical Reports Server (NTRS)

Rehnmark, Fredrik; Currie, Nancy; Ambrose, Robert O.; Culbert, Christopher

2004-01-01

NASA's Human Space Flight program depends heavily on spacewalks performed by pairs of suited human astronauts. These Extra-Vehicular Activities (EVAs) are severely restricted in both duration and scope by consumables and available manpower.An expanded multi-agent EVA team combining the information-gathering and problem-solving skills of human astronauts with the survivability and physical capabilities of highly dexterous space robots is proposed. A 1-g test featuring two NASA/DARPA Robonaut systems working side-by-side with a suited human subject is conducted to evaluate human-robot teaming strategies in the context of a simulated EVA assembly task based on the STS-61B ACCESS flight experiment.

Multi-Agent Inference in Social Networks: A Finite Population Learning Approach.

PubMed

Fan, Jianqing; Tong, Xin; Zeng, Yao

When people in a society want to make inference about some parameter, each person may want to use data collected by other people. Information (data) exchange in social networks is usually costly, so to make reliable statistical decisions, people need to trade off the benefits and costs of information acquisition. Conflicts of interests and coordination problems will arise in the process. Classical statistics does not consider people's incentives and interactions in the data collection process. To address this imperfection, this work explores multi-agent Bayesian inference problems with a game theoretic social network model. Motivated by our interest in aggregate inference at the societal level, we propose a new concept, finite population learning , to address whether with high probability, a large fraction of people in a given finite population network can make "good" inference. Serving as a foundation, this concept enables us to study the long run trend of aggregate inference quality as population grows.

Synergism of coumarins from the Chinese drug Zanthoxylum nitidum with antibacterial agents against methicillin-resistant Staphylococcus aureus (MRSA).

PubMed

Zuo, Guo-Ying; Wang, Chun-Juan; Han, Jun; Li, Yu-Qing; Wang, Gen-Chun

2016-12-15

Methicillin-resistant Staphylococcus aureus (MRSA) poses a serious therapeutic challenge in current clinic and new drug development. Natural coumarins have diverse bioactivities and the potential of resistance modifying effects. This study is to present in-depth evaluations of in vitro antimicrobial activities of four natural coumarins 5-geranyloxy-7-methoxycoumarin (Gm, 1), (5,7-dimethoxy-8-prenyloxycoumarin (artanin, Ar, 2)), isopimpinellin (Is, 3) and phellopterin (Ph, 4) from Zanthoxylum nitidum (Roxb.) DC. (Rutaceae) extracts, focusing on their potential restoration the activity of conventional antibacterial agents against clinical MRSA strains. Bioactivity-guided fractionation and spectral analyses were used to isolate the coumarins and identify the structures, respectively. The double broth microdilution method was used to assay the coumarins' alone activity. The classic checkerboard microdilution and dynamic time-killing methods were used to evaluate combinatory effects. The four plant coumarins Gm (1), Ar (2), Is (3) and Ph (4) were isolated and identified from Z. nitidum extracts. Coumarins 1-4 displayed promising inhibition against both MSSA and MRSA with minimal inhibitory concentrations (MICs) of 8-64µg/ml, but very weak against Gram-negative pathogen and yeast with MICs of 256 to ≥1024µg/ml. The geranyloxy and prenyloxy substitutions showed to be more active than the methoxy substitution on the coumarin skeletons. 1-4 also showing different extent of synergism with a total of eight conventional antibacterial agents, i.e. chloramphenicol (CL), gentamicin (CN), fosfomycin (FF), levofloxacin (LE), minocycline (MI), piperacillin/tazobactam (P/T), teicoplanin (TE) and vancomycin (VA) against ten clinical MRSA strains. Four to ten of the tested MRSA strains showed bacteriostatic synergy in the eleven combinations. The anti-MRSA modifying effects were related to different arrangement in the combinations with fractional inhibitory concentration indices (FICIs) from 0.187 to 1.125 and the three combinations CN (Is), CL (Ph) and MI (Gm) were the best ones. The enhancement of activity was also shown by 2-64 of dose reduction indices (DRIs) of the combined MICs, with VA (Ph) combination resulted the biggest DRI. The resistance of MRSA to antibacterial agents could be reversed in the combinations of CL (Gm or Ph), LE (Ph) and MI (Is) following the Clinical and Laboratory Standards Institute (CLSI) criteria. Six combinations P/T (Gm), TE (Ar), CN (Is), VA (Ph) and CL (Gm or Ph) also showed bactericidal synergy with Δlog 10 CFU/ml >2 at 24h incubation. The coumarins showed high potentiating effects of the antibacterial agents against multi-drug resistant SA. The resistance reversal effect of CL, LE and MI warrants further pharmacological investigation on combinatory therapy for the sake of fighting against MRSA infections. Copyright © 2016 Elsevier GmbH. All rights reserved.

Multi-Agent Coordination Techniques for Naval Tactical Combat Resources Management

DTIC Science & Technology

2008-07-01

resource coordination and cooperation problems. The combat resource allocation planning problem is treated in the companion report [2]. 2.3 Resource...report focuses on the resource coordination problem, while allocation algorithms are discussed in the companion report [2]. First, coordination in...classification of each should be indicated as with the title.) Canada’s Leader in Defence and National Security Science and Technology Chef de file au Canada en

Modeling the Internet of Things, Self-Organizing and Other Complex Adaptive Communication Networks: A Cognitive Agent-Based Computing Approach.

PubMed

Laghari, Samreen; Niazi, Muaz A

2016-01-01

Computer Networks have a tendency to grow at an unprecedented scale. Modern networks involve not only computers but also a wide variety of other interconnected devices ranging from mobile phones to other household items fitted with sensors. This vision of the "Internet of Things" (IoT) implies an inherent difficulty in modeling problems. It is practically impossible to implement and test all scenarios for large-scale and complex adaptive communication networks as part of Complex Adaptive Communication Networks and Environments (CACOONS). The goal of this study is to explore the use of Agent-based Modeling as part of the Cognitive Agent-based Computing (CABC) framework to model a Complex communication network problem. We use Exploratory Agent-based Modeling (EABM), as part of the CABC framework, to develop an autonomous multi-agent architecture for managing carbon footprint in a corporate network. To evaluate the application of complexity in practical scenarios, we have also introduced a company-defined computer usage policy. The conducted experiments demonstrated two important results: Primarily CABC-based modeling approach such as using Agent-based Modeling can be an effective approach to modeling complex problems in the domain of IoT. Secondly, the specific problem of managing the Carbon footprint can be solved using a multiagent system approach.

A Multi Agent Based Approach for Prehospital Emergency Management.

PubMed

Safdari, Reza; Shoshtarian Malak, Jaleh; Mohammadzadeh, Niloofar; Danesh Shahraki, Azimeh

2017-07-01

To demonstrate an architecture to automate the prehospital emergency process to categorize the specialized care according to the situation at the right time for reducing the patient mortality and morbidity. Prehospital emergency process were analyzed using existing prehospital management systems, frameworks and the extracted process were modeled using sequence diagram in Rational Rose software. System main agents were identified and modeled via component diagram, considering the main system actors and by logically dividing business functionalities, finally the conceptual architecture for prehospital emergency management was proposed. The proposed architecture was simulated using Anylogic simulation software. Anylogic Agent Model, State Chart and Process Model were used to model the system. Multi agent systems (MAS) had a great success in distributed, complex and dynamic problem solving environments, and utilizing autonomous agents provides intelligent decision making capabilities.  The proposed architecture presents prehospital management operations. The main identified agents are: EMS Center, Ambulance, Traffic Station, Healthcare Provider, Patient, Consultation Center, National Medical Record System and quality of service monitoring agent. In a critical condition like prehospital emergency we are coping with sophisticated processes like ambulance navigation health care provider and service assignment, consultation, recalling patients past medical history through a centralized EHR system and monitoring healthcare quality in a real-time manner. The main advantage of our work has been the multi agent system utilization. Our Future work will include proposed architecture implementation and evaluation of its impact on patient quality care improvement.

A Multi Agent Based Approach for Prehospital Emergency Management

PubMed Central

Safdari, Reza; Shoshtarian Malak, Jaleh; Mohammadzadeh, Niloofar; Danesh Shahraki, Azimeh

2017-01-01

Objective: To demonstrate an architecture to automate the prehospital emergency process to categorize the specialized care according to the situation at the right time for reducing the patient mortality and morbidity. Methods: Prehospital emergency process were analyzed using existing prehospital management systems, frameworks and the extracted process were modeled using sequence diagram in Rational Rose software. System main agents were identified and modeled via component diagram, considering the main system actors and by logically dividing business functionalities, finally the conceptual architecture for prehospital emergency management was proposed. The proposed architecture was simulated using Anylogic simulation software. Anylogic Agent Model, State Chart and Process Model were used to model the system. Results: Multi agent systems (MAS) had a great success in distributed, complex and dynamic problem solving environments, and utilizing autonomous agents provides intelligent decision making capabilities.  The proposed architecture presents prehospital management operations. The main identified agents are: EMS Center, Ambulance, Traffic Station, Healthcare Provider, Patient, Consultation Center, National Medical Record System and quality of service monitoring agent. Conclusion: In a critical condition like prehospital emergency we are coping with sophisticated processes like ambulance navigation health care provider and service assignment, consultation, recalling patients past medical history through a centralized EHR system and monitoring healthcare quality in a real-time manner. The main advantage of our work has been the multi agent system utilization. Our Future work will include proposed architecture implementation and evaluation of its impact on patient quality care improvement. PMID:28795061

On the Beauty of Mathematics as Exemplified by a Problem in Combinatorics.

ERIC Educational Resources Information Center

Dence, Thomas P.

1982-01-01

The beauty of discovering some simple yet elegant proof either to something new or to an already established fact is discussed. A combinatorial problem that deals with covering a checkerboard with dominoes is presented as a starting point for individual investigation of similar problems. (MP)

An Interactive Multiobjective Programming Approach to Combinatorial Data Analysis.

ERIC Educational Resources Information Center

Brusco, Michael J.; Stahl, Stephanie

2001-01-01

Describes an interactive procedure for multiobjective asymmetric unidimensional seriation problems that uses a dynamic-programming algorithm to generate partially the efficient set of sequences for small to medium-sized problems and a multioperational heuristic to estimate the efficient set for larger problems. Applies the procedure to an…

Gossip-based solutions for discrete rendezvous in populations of communicating agents.

PubMed

Hollander, Christopher D; Wu, Annie S

2014-01-01

The objective of the rendezvous problem is to construct a method that enables a population of agents to agree on a spatial (and possibly temporal) meeting location. We introduce the buffered gossip algorithm as a general solution to the rendezvous problem in a discrete domain with direct communication between decentralized agents. We compare the performance of the buffered gossip algorithm against the well known uniform gossip algorithm. We believe that a buffered solution is preferable to an unbuffered solution, such as the uniform gossip algorithm, because the use of a buffer allows an agent to use multiple information sources when determining its desired rendezvous point, and that access to multiple information sources may improve agent decision making by reinforcing or contradicting an initial choice. To show that the buffered gossip algorithm is an actual solution for the rendezvous problem, we construct a theoretical proof of convergence and derive the conditions under which the buffered gossip algorithm is guaranteed to produce a consensus on rendezvous location. We use these results to verify that the uniform gossip algorithm also solves the rendezvous problem. We then use a multi-agent simulation to conduct a series of simulation experiments to compare the performance between the buffered and uniform gossip algorithms. Our results suggest that the buffered gossip algorithm can solve the rendezvous problem faster than the uniform gossip algorithm; however, the relative performance between these two solutions depends on the specific constraints of the problem and the parameters of the buffered gossip algorithm.

Gossip-Based Solutions for Discrete Rendezvous in Populations of Communicating Agents

PubMed Central

Hollander, Christopher D.; Wu, Annie S.

2014-01-01

The objective of the rendezvous problem is to construct a method that enables a population of agents to agree on a spatial (and possibly temporal) meeting location. We introduce the buffered gossip algorithm as a general solution to the rendezvous problem in a discrete domain with direct communication between decentralized agents. We compare the performance of the buffered gossip algorithm against the well known uniform gossip algorithm. We believe that a buffered solution is preferable to an unbuffered solution, such as the uniform gossip algorithm, because the use of a buffer allows an agent to use multiple information sources when determining its desired rendezvous point, and that access to multiple information sources may improve agent decision making by reinforcing or contradicting an initial choice. To show that the buffered gossip algorithm is an actual solution for the rendezvous problem, we construct a theoretical proof of convergence and derive the conditions under which the buffered gossip algorithm is guaranteed to produce a consensus on rendezvous location. We use these results to verify that the uniform gossip algorithm also solves the rendezvous problem. We then use a multi-agent simulation to conduct a series of simulation experiments to compare the performance between the buffered and uniform gossip algorithms. Our results suggest that the buffered gossip algorithm can solve the rendezvous problem faster than the uniform gossip algorithm; however, the relative performance between these two solutions depends on the specific constraints of the problem and the parameters of the buffered gossip algorithm. PMID:25397882

Hybrid Microgrid Configuration Optimization with Evolutionary Algorithms

NASA Astrophysics Data System (ADS)

Lopez, Nicolas

This dissertation explores the Renewable Energy Integration Problem, and proposes a Genetic Algorithm embedded with a Monte Carlo simulation to solve large instances of the problem that are impractical to solve via full enumeration. The Renewable Energy Integration Problem is defined as finding the optimum set of components to supply the electric demand to a hybrid microgrid. The components considered are solar panels, wind turbines, diesel generators, electric batteries, connections to the power grid and converters, which can be inverters and/or rectifiers. The methodology developed is explained as well as the combinatorial formulation. In addition, 2 case studies of a single objective optimization version of the problem are presented, in order to minimize cost and to minimize global warming potential (GWP) followed by a multi-objective implementation of the offered methodology, by utilizing a non-sorting Genetic Algorithm embedded with a monte Carlo Simulation. The method is validated by solving a small instance of the problem with known solution via a full enumeration algorithm developed by NREL in their software HOMER. The dissertation concludes that the evolutionary algorithms embedded with Monte Carlo simulation namely modified Genetic Algorithms are an efficient form of solving the problem, by finding approximate solutions in the case of single objective optimization, and by approximating the true Pareto front in the case of multiple objective optimization of the Renewable Energy Integration Problem.

Stochastic Local Search for Core Membership Checking in Hedonic Games

NASA Astrophysics Data System (ADS)

Keinänen, Helena

Hedonic games have emerged as an important tool in economics and show promise as a useful formalism to model multi-agent coalition formation in AI as well as group formation in social networks. We consider a coNP-complete problem of core membership checking in hedonic coalition formation games. No previous algorithms to tackle the problem have been presented. In this work, we overcome this by developing two stochastic local search algorithms for core membership checking in hedonic games. We demonstrate the usefulness of the algorithms by showing experimentally that they find solutions efficiently, particularly for large agent societies.

Agent-Based Crowd Simulation Considering Emotion Contagion for Emergency Evacuation Problem

NASA Astrophysics Data System (ADS)

Faroqi, H.; Mesgari, M.-S.

2015-12-01

During emergencies, emotions greatly affect human behaviour. For more realistic multi-agent systems in simulations of emergency evacuations, it is important to incorporate emotions and their effects on the agents. In few words, emotional contagion is a process in which a person or group influences the emotions or behavior of another person or group through the conscious or unconscious induction of emotion states and behavioral attitudes. In this study, we simulate an emergency situation in an open square area with three exits considering Adults and Children agents with different behavior. Also, Security agents are considered in order to guide Adults and Children for finding the exits and be calm. Six levels of emotion levels are considered for each agent in different scenarios and situations. The agent-based simulated model initialize with the random scattering of agent populations and then when an alarm occurs, each agent react to the situation based on its and neighbors current circumstances. The main goal of each agent is firstly to find the exit, and then help other agents to find their ways. Numbers of exited agents along with their emotion levels and damaged agents are compared in different scenarios with different initialization in order to evaluate the achieved results of the simulated model. NetLogo 5.2 is used as the multi-agent simulation framework with R language as the developing language.

The Next Generation of Interoperability Agents in Healthcare

PubMed Central

Cardoso, Luciana; Marins, Fernando; Portela, Filipe; Santos, Manuel ; Abelha, António; Machado, José

2014-01-01

Interoperability in health information systems is increasingly a requirement rather than an option. Standards and technologies, such as multi-agent systems, have proven to be powerful tools in interoperability issues. In the last few years, the authors have worked on developing the Agency for Integration, Diffusion and Archive of Medical Information (AIDA), which is an intelligent, agent-based platform to ensure interoperability in healthcare units. It is increasingly important to ensure the high availability and reliability of systems. The functions provided by the systems that treat interoperability cannot fail. This paper shows the importance of monitoring and controlling intelligent agents as a tool to anticipate problems in health information systems. The interaction between humans and agents through an interface that allows the user to create new agents easily and to monitor their activities in real time is also an important feature, as health systems evolve by adopting more features and solving new problems. A module was installed in Centro Hospitalar do Porto, increasing the functionality and the overall usability of AIDA. PMID:24840351

The problem with multiple robots

NASA Technical Reports Server (NTRS)

Huber, Marcus J.; Kenny, Patrick G.

1994-01-01

The issues that can arise in research associated with multiple, robotic agents are discussed. Two particular multi-robot projects are presented as examples. This paper was written in the hope that it might ease the transition from single to multiple robot research.

Mathematical Giftedness, Problem Solving, and the Ability To Formulate Generalizations: The Problem-Solving Experiences of Four Gifted Students.

ERIC Educational Resources Information Center

Sriraman, Bharath

2003-01-01

Nine freshmen in a ninth-grade accelerated algebra class were asked to solve five nonroutine combinatorial problems. The four mathematically gifted students were successful in discovering and verbalizing the generality that characterized the solutions to the five problems, whereas the five nongifted students were unable to discover the hidden…

Data-Driven Online and Real-Time Combinatorial Optimization

DTIC Science & Technology

2013-10-30

Problem , the online Traveling Salesman Problem , and variations of the online Quota Hamil- tonian Path Problem and the online Traveling ...has the lowest competitive ratio among all algorithms of this kind. Second, we consider the Online Traveling Salesman Problem , and consider randomized...matroid secretary problem on a partition matroid. 6. Jaillet, P. and X. Lu. “Online Traveling Salesman Problems with Rejection Options”, submitted

Combinatorial Libraries As a Tool for the Discovery of Novel, Broad-Spectrum Antibacterial Agents Targeting the ESKAPE Pathogens.

PubMed

Fleeman, Renee; LaVoi, Travis M; Santos, Radleigh G; Morales, Angela; Nefzi, Adel; Welmaker, Gregory S; Medina-Franco, José L; Giulianotti, Marc A; Houghten, Richard A; Shaw, Lindsey N

2015-04-23

Mixture based synthetic combinatorial libraries offer a tremendous enhancement for the rate of drug discovery, allowing the activity of millions of compounds to be assessed through the testing of exponentially fewer samples. In this study, we used a scaffold-ranking library to screen 37 different libraries for antibacterial activity against the ESKAPE pathogens. Each library contained between 10000 and 750000 structural analogues for a total of >6 million compounds. From this, we identified a bis-cyclic guanidine library that displayed strong antibacterial activity. A positional scanning library for these compounds was developed and used to identify the most effective functional groups at each variant position. Individual compounds were synthesized that were broadly active against all ESKAPE organisms at concentrations <2 μM. In addition, these compounds were bactericidal, had antibiofilm effects, showed limited potential for the development of resistance, and displayed almost no toxicity when tested against human lung cells and erythrocytes. Using a murine model of peritonitis, we also demonstrate that these agents are highly efficacious in vivo.

Research on parallel combinatory spread spectrum communication system with double information matching

NASA Astrophysics Data System (ADS)

Xue, Wei; Wang, Qi; Wang, Tianyu

2018-04-01

This paper presents an improved parallel combinatory spread spectrum (PC/SS) communication system with the method of double information matching (DIM). Compared with conventional PC/SS system, the new model inherits the advantage of high transmission speed, large information capacity and high security. Besides, the problem traditional system will face is the high bit error rate (BER) and since its data-sequence mapping algorithm. Hence the new model presented shows lower BER and higher efficiency by its optimization of mapping algorithm.

Distributed Combinatorial Optimization Using Privacy on Mobile Phones

NASA Astrophysics Data System (ADS)

Ono, Satoshi; Katayama, Kimihiro; Nakayama, Shigeru

This paper proposes a method for distributed combinatorial optimization which uses mobile phones as computers. In the proposed method, an ordinary computer generates solution candidates and mobile phones evaluates them by referring privacy — private information and preferences. Users therefore does not have to send their privacy to any other computers and does not have to refrain from inputting their preferences. They therefore can obtain satisfactory solution. Experimental results have showed the proposed method solved room assignment problems without sending users' privacy to a server.

The multi-queue model applied to random access protocol

NASA Astrophysics Data System (ADS)

Fan, Xinlong

2013-03-01

The connection of everything in a sensory and an intelligent way is a pursuit in smart environment. This paper introduces the engineered cell-sensors into the multi-agent systems to realize the smart environment. The seamless interface with the natural environment and strong information-processing ability of cell with the achievements of synthetic biology make the construction of engineered cell-sensors possible. However, the engineered cell-sensors are only simple-functional and unreliable computational entities. Therefore how to combine engineered cell-sensors with digital device is a key problem in order to realize the smart environment. We give the abstract structure and interaction modes of the engineered cell-sensors in order to introduce engineered cell-sensors into multi-agent systems. We believe that the introduction of engineered cell-sensors will push forward the development of the smart environment.

Fast and Efficient Discrimination of Traveling Salesperson Problem Stimulus Difficulty

ERIC Educational Resources Information Center

Dry, Matthew J.; Fontaine, Elizabeth L.

2014-01-01

The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…

Material Mediation: Tools and Representations Supporting Collaborative Problem-Solving Discourse

ERIC Educational Resources Information Center

Katic, Elvira K.; Hmelo-Silver, Cindy E.; Weber, Keith H.

2009-01-01

This study investigates how a variety of resources mediated collaborative problem solving for a group of preservice teachers. The participants in this study completed mathematical, combinatorial tasks and then watched a video of a sixth grader as he exhibited sophisticated reasoning to recognize the isomorphic structure of these problems. The…

Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

NASA Astrophysics Data System (ADS)

Vatutin, Eduard

2017-12-01

The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

A quantum annealing approach for fault detection and diagnosis of graph-based systems

NASA Astrophysics Data System (ADS)

Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.

2015-02-01

Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.

Developmental Biology and Regenerative Medicine: Addressing the Vexing Problem of Persistent Muscle Atrophy in the Chronically Torn Human Rotator Cuff.

PubMed

Meyer, Gretchen A; Ward, Samuel R

2016-05-01

Persistent muscle atrophy in the chronically torn rotator cuff is a significant obstacle for treatment and recovery. Large atrophic changes are predictive of poor surgical and nonsurgical outcomes and frequently fail to resolve even following functional restoration of loading and rehabilitation. New insights into the processes of muscle atrophy and recovery gained through studies in developmental biology combined with the novel tools and strategies emerging in regenerative medicine provide new avenues to combat the vexing problem of muscle atrophy in the rotator cuff. Moving these treatment strategies forward likely will involve the combination of surgery, biologic/cellular agents, and physical interventions, as increasing experimental evidence points to the beneficial interaction between biologic therapies and physiologic stresses. Thus, the physical therapy profession is poised to play a significant role in defining the success of these combinatorial therapies. This perspective article will provide an overview of the developmental biology and regenerative medicine strategies currently under investigation to combat muscle atrophy and how they may integrate into the current and future practice of physical therapy. © 2016 American Physical Therapy Association.

Ant system: optimization by a colony of cooperating agents.

PubMed

Dorigo, M; Maniezzo, V; Colorni, A

1996-01-01

An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical traveling salesman problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling. Finally we discuss the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.

Density Control of Multi-Agent Systems with Safety Constraints: A Markov Chain Approach

NASA Astrophysics Data System (ADS)

Demirer, Nazli

The control of systems with autonomous mobile agents has been a point of interest recently, with many applications like surveillance, coverage, searching over an area with probabilistic target locations or exploring an area. In all of these applications, the main goal of the swarm is to distribute itself over an operational space to achieve mission objectives specified by the density of swarm. This research focuses on the problem of controlling the distribution of multi-agent systems considering a hierarchical control structure where the whole swarm coordination is achieved at the high-level and individual vehicle/agent control is managed at the low-level. High-level coordination algorithms uses macroscopic models that describes the collective behavior of the whole swarm and specify the agent motion commands, whose execution will lead to the desired swarm behavior. The low-level control laws execute the motion to follow these commands at the agent level. The main objective of this research is to develop high-level decision control policies and algorithms to achieve physically realizable commanding of the agents by imposing mission constraints on the distribution. We also make some connections with decentralized low-level motion control. This dissertation proposes a Markov chain based method to control the density distribution of the whole system where the implementation can be achieved in a decentralized manner with no communication between agents since establishing communication with large number of agents is highly challenging. The ultimate goal is to guide the overall density distribution of the system to a prescribed steady-state desired distribution while satisfying desired transition and safety constraints. Here, the desired distribution is determined based on the mission requirements, for example in the application of area search, the desired distribution should match closely with the probabilistic target locations. The proposed method is applicable for both systems with a single agent and systems with large number of agents due to the probabilistic nature, where the probability distribution of each agent's state evolves according to a finite-state and discrete-time Markov chain (MC). Hence, designing proper decision control policies requires numerically tractable solution methods for the synthesis of Markov chains. The synthesis problem has the form of a Linear Matrix Inequality Problem (LMI), with LMI formulation of the constraints. To this end, we propose convex necessary and sufficient conditions for safety constraints in Markov chains, which is a novel result in the Markov chain literature. In addition to LMI-based, offline, Markov matrix synthesis method, we also propose a QP-based, online, method to compute a time-varying Markov matrix based on the real-time density feedback. Both problems are convex optimization problems that can be solved in a reliable and tractable way, utilizing existing tools in the literature. A Low Earth Orbit (LEO) swarm simulations are presented to validate the effectiveness of the proposed algorithms. Another problem tackled as a part of this research is the generalization of the density control problem to autonomous mobile agents with two control modes: ON and OFF. Here, each mode consists of a (possibly overlapping) finite set of actions, that is, there exist a set of actions for the ON mode and another set for the OFF mode. We give formulation for a new Markov chain synthesis problem, with additional measurements for the state transitions, where a policy is designed to ensure desired safety and convergence properties for the underlying Markov chain.

A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems.

PubMed

Horio, Yoshihiko; Ikeguchi, Tohru; Aihara, Kazuyuki

2005-01-01

We construct a mixed analog/digital chaotic neuro-computer prototype system for quadratic assignment problems (QAPs). The QAP is one of the difficult NP-hard problems, and includes several real-world applications. Chaotic neural networks have been used to solve combinatorial optimization problems through chaotic search dynamics, which efficiently searches optimal or near optimal solutions. However, preliminary experiments have shown that, although it obtained good feasible solutions, the Hopfield-type chaotic neuro-computer hardware system could not obtain the optimal solution of the QAP. Therefore, in the present study, we improve the system performance by adopting a solution construction method, which constructs a feasible solution using the analog internal state values of the chaotic neurons at each iteration. In order to include the construction method into our hardware, we install a multi-channel analog-to-digital conversion system to observe the internal states of the chaotic neurons. We show experimentally that a great improvement in the system performance over the original Hopfield-type chaotic neuro-computer is obtained. That is, we obtain the optimal solution for the size-10 QAP in less than 1000 iterations. In addition, we propose a guideline for parameter tuning of the chaotic neuro-computer system according to the observation of the internal states of several chaotic neurons in the network.

Evaluate the use of tanning agent in leather industry using material flow analysis, life cycle assessment and fuzzy multi-attribute decision making (FMADM)

NASA Astrophysics Data System (ADS)

Alfarisi, Salman; Sutono, Sugoro Bhakti; Sutopo, Wahyudi

2017-11-01

Tanning industry is one of the companies that produce many pollutants and cause the negative impact on the environment. In the production process of tanning leather, the use of input material need to be evaluated. The problem of waste, not only have a negative impact on the environment, but also human health. In this study, the impact of mimosa as vegetable tanning agent evaluated. This study will provide alternative solutions for improvements to the use of vegetable tanning agent. The alternative solution is change mimosa with indusol, gambier, and dulcotan. This study evaluate the vegetable tanning of some aspects using material flow analysis and life cycle assessment approach. Life cycle assessment (LCA) is used to evaluate the environmental impact of vegetable tanning agent. Alternative solution selection using fuzzy multi-attribute decision making (FMADM) approach. Results obtained by considering the environment, human toxicity, climate change, and marine aquatic ecotoxicity, is to use dulcotan.

Combination of Multi-Agent Systems and Wireless Sensor Networks for the Monitoring of Cattle

PubMed Central

Barriuso, Alberto L.; De Paz, Juan F.; Lozano, Álvaro

2018-01-01

Precision breeding techniques have been widely used to optimize expenses and increase livestock yields. Notwithstanding, the joint use of heterogeneous sensors and artificial intelligence techniques for the simultaneous analysis or detection of different problems that cattle may present has not been addressed. This study arises from the necessity to obtain a technological tool that faces this state of the art limitation. As novelty, this work presents a multi-agent architecture based on virtual organizations which allows to deploy a new embedded agent model in computationally limited autonomous sensors, making use of the Platform for Automatic coNstruction of orGanizations of intElligent Agents (PANGEA). To validate the proposed platform, different studies have been performed, where parameters specific to each animal are studied, such as physical activity, temperature, estrus cycle state and the moment in which the animal goes into labor. In addition, a set of applications that allow farmers to remotely monitor the livestock have been developed. PMID:29301310

Combination of Multi-Agent Systems and Wireless Sensor Networks for the Monitoring of Cattle.

PubMed

Barriuso, Alberto L; Villarrubia González, Gabriel; De Paz, Juan F; Lozano, Álvaro; Bajo, Javier

2018-01-02

Precision breeding techniques have been widely used to optimize expenses and increase livestock yields. Notwithstanding, the joint use of heterogeneous sensors and artificial intelligence techniques for the simultaneous analysis or detection of different problems that cattle may present has not been addressed. This study arises from the necessity to obtain a technological tool that faces this state of the art limitation. As novelty, this work presents a multi-agent architecture based on virtual organizations which allows to deploy a new embedded agent model in computationally limited autonomous sensors, making use of the Platform for Automatic coNstruction of orGanizations of intElligent Agents (PANGEA). To validate the proposed platform, different studies have been performed, where parameters specific to each animal are studied, such as physical activity, temperature, estrus cycle state and the moment in which the animal goes into labor. In addition, a set of applications that allow farmers to remotely monitor the livestock have been developed.

Fuel management optimization using genetic algorithms and code independence

DOE Office of Scientific and Technical Information (OSTI.GOV)

DeChaine, M.D.; Feltus, M.A.

1994-12-31

Fuel management optimization is a hard problem for traditional optimization techniques. Loading pattern optimization is a large combinatorial problem without analytical derivative information. Therefore, methods designed for continuous functions, such as linear programming, do not always work well. Genetic algorithms (GAs) address these problems and, therefore, appear ideal for fuel management optimization. They do not require derivative information and work well with combinatorial. functions. The GAs are a stochastic method based on concepts from biological genetics. They take a group of candidate solutions, called the population, and use selection, crossover, and mutation operators to create the next generation of bettermore » solutions. The selection operator is a {open_quotes}survival-of-the-fittest{close_quotes} operation and chooses the solutions for the next generation. The crossover operator is analogous to biological mating, where children inherit a mixture of traits from their parents, and the mutation operator makes small random changes to the solutions.« less

Modeling the Internet of Things, Self-Organizing and Other Complex Adaptive Communication Networks: A Cognitive Agent-Based Computing Approach

PubMed Central

2016-01-01

Background Computer Networks have a tendency to grow at an unprecedented scale. Modern networks involve not only computers but also a wide variety of other interconnected devices ranging from mobile phones to other household items fitted with sensors. This vision of the "Internet of Things" (IoT) implies an inherent difficulty in modeling problems. Purpose It is practically impossible to implement and test all scenarios for large-scale and complex adaptive communication networks as part of Complex Adaptive Communication Networks and Environments (CACOONS). The goal of this study is to explore the use of Agent-based Modeling as part of the Cognitive Agent-based Computing (CABC) framework to model a Complex communication network problem. Method We use Exploratory Agent-based Modeling (EABM), as part of the CABC framework, to develop an autonomous multi-agent architecture for managing carbon footprint in a corporate network. To evaluate the application of complexity in practical scenarios, we have also introduced a company-defined computer usage policy. Results The conducted experiments demonstrated two important results: Primarily CABC-based modeling approach such as using Agent-based Modeling can be an effective approach to modeling complex problems in the domain of IoT. Secondly, the specific problem of managing the Carbon footprint can be solved using a multiagent system approach. PMID:26812235

Sidestepping the Combinatorial Explosion: An Explanation of "n"-gram Frequency Effects Based on Naive Discriminative Learning

ERIC Educational Resources Information Center

Baayen, R. Harald; Hendrix, Peter; Ramscar, Michael

2013-01-01

Arnon and Snider ((2010). More than words: Frequency effects for multi-word phrases. "Journal of Memory and Language," 62, 67-82) documented frequency effects for compositional four-grams independently of the frequencies of lower-order "n"-grams. They argue that comprehenders apparently store frequency information about…

Reliable Radiation Hybrid Maps: An Efficient Scalable Clustering-based Approach

USDA-ARS?s Scientific Manuscript database

The process of mapping markers from radiation hybrid mapping (RHM) experiments is equivalent to the traveling salesman problem and, thereby, has combinatorial complexity. As an additional problem, experiments typically result in some unreliable markers that reduce the overall quality of the map. We ...

BDNF gene delivery within and beyond templated agarose multi-channel guidance scaffolds enhances peripheral nerve regeneration

NASA Astrophysics Data System (ADS)

Gao, Mingyong; Lu, Paul; Lynam, Dan; Bednark, Bridget; Campana, W. Marie; Sakamoto, Jeff; Tuszynski, Mark

2016-12-01

Objective. We combined implantation of multi-channel templated agarose scaffolds with growth factor gene delivery to examine whether this combinatorial treatment can enhance peripheral axonal regeneration through long sciatic nerve gaps. Approach. 15 mm long scaffolds were templated into highly organized, strictly linear channels, mimicking the linear organization of natural nerves into fascicles of related function. Scaffolds were filled with syngeneic bone marrow stromal cells (MSCs) secreting the growth factor brain derived neurotrophic factor (BDNF), and lentiviral vectors expressing BDNF were injected into the sciatic nerve segment distal to the scaffold implantation site. Main results. Twelve weeks after injury, scaffolds supported highly linear regeneration of host axons across the 15 mm lesion gap. The incorporation of BDNF-secreting cells into scaffolds significantly increased axonal regeneration, and additional injection of viral vectors expressing BDNF into the distal segment of the transected nerve significantly enhanced axonal regeneration beyond the lesion. Significance. Combinatorial treatment with multichannel bioengineered scaffolds and distal growth factor delivery significantly improves peripheral nerve repair, rivaling the gold standard of autografts.

Applications of Evolutionary Technology to Manufacturing and Logistics Systems : State-of-the Art Survey

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin

Many combinatorial optimization problems from industrial engineering and operations research in real-world are very complex in nature and quite hard to solve them by conventional techniques. Since the 1960s, there has been an increasing interest in imitating living beings to solve such kinds of hard combinatorial optimization problems. Simulating the natural evolutionary process of human beings results in stochastic optimization techniques called evolutionary algorithms (EAs), which can often outperform conventional optimization methods when applied to difficult real-world problems. In this survey paper, we provide a comprehensive survey of the current state-of-the-art in the use of EA in manufacturing and logistics systems. In order to demonstrate the EAs which are powerful and broadly applicable stochastic search and optimization techniques, we deal with the following engineering design problems: transportation planning models, layout design models and two-stage logistics models in logistics systems; job-shop scheduling, resource constrained project scheduling in manufacturing system.

Manipulating Tabu List to Handle Machine Breakdowns in Job Shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Nababan, Erna Budhiarti; SalimSitompul, Opim

2011-06-01

Machine breakdowns in a production schedule may occur on a random basis that make the well-known hard combinatorial problem of Job Shop Scheduling Problems (JSSP) becomes more complex. One of popular techniques used to solve the combinatorial problems is Tabu Search. In this technique, moves that will be not allowed to be revisited are retained in a tabu list in order to avoid in gaining solutions that have been obtained previously. In this paper, we propose an algorithm to employ a second tabu list to keep broken machines, in addition to the tabu list that keeps the moves. The period of how long the broken machines will be kept on the list is categorized using fuzzy membership function. Our technique are tested to the benchmark data of JSSP available on the OR library. From the experiment, we found that our algorithm is promising to help a decision maker to face the event of machine breakdowns.

Multi-Objective Constraint Satisfaction for Mobile Robot Area Defense

DTIC Science & Technology

2010-03-01

17 NSGA-II non-dominated sorting genetic algorithm II . . . . . . . . . . . . . . . . . . . 17 jMetal Metaheuristic Algorithms in...to alert the other agents and ensure trust in the system. This research presents an algorithm that tasks robots to meet the two specific goals of...problem is defined as a constraint satisfaction problem solved using the Non-dominated Sorting Genetic Algorithm II (NSGA-II). Both goals of

Collectives for Multiple Resource Job Scheduling Across Heterogeneous Servers

NASA Technical Reports Server (NTRS)

Tumer, K.; Lawson, J.

2003-01-01

Efficient management of large-scale, distributed data storage and processing systems is a major challenge for many computational applications. Many of these systems are characterized by multi-resource tasks processed across a heterogeneous network. Conventional approaches, such as load balancing, work well for centralized, single resource problems, but breakdown in the more general case. In addition, most approaches are often based on heuristics which do not directly attempt to optimize the world utility. In this paper, we propose an agent based control system using the theory of collectives. We configure the servers of our network with agents who make local job scheduling decisions. These decisions are based on local goals which are constructed to be aligned with the objective of optimizing the overall efficiency of the system. We demonstrate that multi-agent systems in which all the agents attempt to optimize the same global utility function (team game) only marginally outperform conventional load balancing. On the other hand, agents configured using collectives outperform both team games and load balancing (by up to four times for the latter), despite their distributed nature and their limited access to information.

Fuzzy-based decision strategy in real-time strategic games

NASA Astrophysics Data System (ADS)

Volna, Eva

2017-11-01

The aim of this article is to describe our own gaming artificial intelligence for OpenTTD, which is a real-time building strategy game. A multi-agent system with fuzzy decision-making was used for the proposal itself. The multiagent system was chosen because real-time strategy games achieve great complexity and require decomposition of the problem into individual problems, which are then solved by individual cooperating agents. The system becomes then more stable and easily expandable. The fuzzy approach makes the decision-making process of strategies easier thanks to the use of uncertainty. In the conclusion, own experimental results were compared with other approaches.

On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

DOE Office of Scientific and Technical Information (OSTI.GOV)

Langguth, Johannes; Azad, Md Ariful; Halappanavar, Mahantesh

2014-07-01

We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for themore » parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.« less

Dynamic pathway modeling of signal transduction networks: a domain-oriented approach.

PubMed

Conzelmann, Holger; Gilles, Ernst-Dieter

2008-01-01

Mathematical models of biological processes become more and more important in biology. The aim is a holistic understanding of how processes such as cellular communication, cell division, regulation, homeostasis, or adaptation work, how they are regulated, and how they react to perturbations. The great complexity of most of these processes necessitates the generation of mathematical models in order to address these questions. In this chapter we provide an introduction to basic principles of dynamic modeling and highlight both problems and chances of dynamic modeling in biology. The main focus will be on modeling of s transduction pathways, which requires the application of a special modeling approach. A common pattern, especially in eukaryotic signaling systems, is the formation of multi protein signaling complexes. Even for a small number of interacting proteins the number of distinguishable molecular species can be extremely high. This combinatorial complexity is due to the great number of distinct binding domains of many receptors and scaffold proteins involved in signal transduction. However, these problems can be overcome using a new domain-oriented modeling approach, which makes it possible to handle complex and branched signaling pathways.

Exact model reduction of combinatorial reaction networks

PubMed Central

Conzelmann, Holger; Fey, Dirk; Gilles, Ernst D

2008-01-01

Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs) to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks. PMID:18755034

Time-Extended Policies in Mult-Agent Reinforcement Learning

NASA Technical Reports Server (NTRS)

Tumer, Kagan; Agogino, Adrian K.

2004-01-01

Reinforcement learning methods perform well in many domains where a single agent needs to take a sequence of actions to perform a task. These methods use sequences of single-time-step rewards to create a policy that tries to maximize a time-extended utility, which is a (possibly discounted) sum of these rewards. In this paper we build on our previous work showing how these methods can be extended to a multi-agent environment where each agent creates its own policy that works towards maximizing a time-extended global utility over all agents actions. We show improved methods for creating time-extended utilities for the agents that are both "aligned" with the global utility and "learnable." We then show how to crate single-time-step rewards while avoiding the pi fall of having rewards aligned with the global reward leading to utilities not aligned with the global utility. Finally, we apply these reward functions to the multi-agent Gridworld problem. We explicitly quantify a utility's learnability and alignment, and show that reinforcement learning agents using the prescribed reward functions successfully tradeoff learnability and alignment. As a result they outperform both global (e.g., team games ) and local (e.g., "perfectly learnable" ) reinforcement learning solutions by as much as an order of magnitude.

Distributed optimisation problem with communication delay and external disturbance

NASA Astrophysics Data System (ADS)

Tran, Ngoc-Tu; Xiao, Jiang-Wen; Wang, Yan-Wu; Yang, Wu

2017-12-01

This paper investigates the distributed optimisation problem for the multi-agent systems (MASs) with the simultaneous presence of external disturbance and the communication delay. To solve this problem, a two-step design scheme is introduced. In the first step, based on the internal model principle, the internal model term is constructed to compensate the disturbance asymptotically. In the second step, a distributed optimisation algorithm is designed to solve the distributed optimisation problem based on the MASs with the simultaneous presence of disturbance and communication delay. Moreover, in the proposed algorithm, each agent interacts with its neighbours through the connected topology and the delay occurs during the information exchange. By utilising Lyapunov-Krasovskii functional, the delay-dependent conditions are derived for both slowly and fast time-varying delay, respectively, to ensure the convergence of the algorithm to the optimal solution of the optimisation problem. Several numerical simulation examples are provided to illustrate the effectiveness of the theoretical results.

Children's Construction of Mathematical Knowledge in Solving Novel Isomorphic Problems in Concrete and Written Form.

ERIC Educational Resources Information Center

English, Lyn D.

1996-01-01

Presents case study data of low- and high-achieving nine-year olds focusing on construction and analogical transfer of mathematical knowledge during novel problem solving, as reflected in strategies for dealing with isomorphic combinatorial problems presented in hands-on and written form. Results showed that achievement level does not predict…

Optimizing the Disposition and Retrograde of United States Air Force Class VII Equipment from Afghanistan

DTIC Science & Technology

2014-03-27

1959). On a linear-programming, combinatorial approach to the traveling - salesman problem . Operations Research, 58-66. Daugherty, P. J., Myers, M. B...1 Problem Statement... Problem Statement As of 01 September 2013, the USAF is tracking 12,571 individual Class VII assets valued at $213.5 million for final disposition

Exploring complex dynamics in multi agent-based intelligent systems: Theoretical and experimental approaches using the Multi Agent-based Behavioral Economic Landscape (MABEL) model

NASA Astrophysics Data System (ADS)

Alexandridis, Konstantinos T.

This dissertation adopts a holistic and detailed approach to modeling spatially explicit agent-based artificial intelligent systems, using the Multi Agent-based Behavioral Economic Landscape (MABEL) model. The research questions that addresses stem from the need to understand and analyze the real-world patterns and dynamics of land use change from a coupled human-environmental systems perspective. Describes the systemic, mathematical, statistical, socio-economic and spatial dynamics of the MABEL modeling framework, and provides a wide array of cross-disciplinary modeling applications within the research, decision-making and policy domains. Establishes the symbolic properties of the MABEL model as a Markov decision process, analyzes the decision-theoretic utility and optimization attributes of agents towards comprising statistically and spatially optimal policies and actions, and explores the probabilogic character of the agents' decision-making and inference mechanisms via the use of Bayesian belief and decision networks. Develops and describes a Monte Carlo methodology for experimental replications of agent's decisions regarding complex spatial parcel acquisition and learning. Recognizes the gap on spatially-explicit accuracy assessment techniques for complex spatial models, and proposes an ensemble of statistical tools designed to address this problem. Advanced information assessment techniques such as the Receiver-Operator Characteristic curve, the impurity entropy and Gini functions, and the Bayesian classification functions are proposed. The theoretical foundation for modular Bayesian inference in spatially-explicit multi-agent artificial intelligent systems, and the ensembles of cognitive and scenario assessment modular tools build for the MABEL model are provided. Emphasizes the modularity and robustness as valuable qualitative modeling attributes, and examines the role of robust intelligent modeling as a tool for improving policy-decisions related to land use change. Finally, the major contributions to the science are presented along with valuable directions for future research.

Modelling of Robotized Manufacturing Systems Using MultiAgent Formalism

NASA Astrophysics Data System (ADS)

Foit, K.; Gwiazda, A.; Banaś, W.

2016-08-01

The evolution of manufacturing systems has greatly accelerated due to development of sophisticated control systems. On top of determined, one way production flow the need of decision making has arisen as a result of growing product range that are manufactured simultaneously, using the same resources. On the other hand, the intelligent flow control could address the “bottleneck” problem caused by the machine failure. This sort of manufacturing systems uses advanced control algorithms that are introduced by the use of logic controllers. The complex algorithms used in the control systems requires to employ appropriate methods during the modelling process, like the agent-based one, which is the subject of this paper. The concept of an agent is derived from the object-based methodology of modelling, so it meets the requirements of representing the physical properties of the machines as well as the logical form of control systems. Each agent has a high level of autonomy and could be considered separately. The multi-agent system consists of minimum two agents that can interact and modify the environment, where they act. This may lead to the creation of self-organizing structure, what could be interesting feature during design and test of manufacturing system.

Remote Data Retrieval for Bioinformatics Applications: An Agent Migration Approach

PubMed Central

Gao, Lei; Dai, Hua; Zhang, Tong-Liang; Chou, Kuo-Chen

2011-01-01

Some of the approaches have been developed to retrieve data automatically from one or multiple remote biological data sources. However, most of them require researchers to remain online and wait for returned results. The latter not only requires highly available network connection, but also may cause the network overload. Moreover, so far none of the existing approaches has been designed to address the following problems when retrieving the remote data in a mobile network environment: (1) the resources of mobile devices are limited; (2) network connection is relatively of low quality; and (3) mobile users are not always online. To address the aforementioned problems, we integrate an agent migration approach with a multi-agent system to overcome the high latency or limited bandwidth problem by moving their computations to the required resources or services. More importantly, the approach is fit for the mobile computing environments. Presented in this paper are also the system architecture, the migration strategy, as well as the security authentication of agent migration. As a demonstration, the remote data retrieval from GenBank was used to illustrate the feasibility of the proposed approach. PMID:21701677

Multi-Agent Inference in Social Networks: A Finite Population Learning Approach

PubMed Central

Tong, Xin; Zeng, Yao

2016-01-01

When people in a society want to make inference about some parameter, each person may want to use data collected by other people. Information (data) exchange in social networks is usually costly, so to make reliable statistical decisions, people need to trade off the benefits and costs of information acquisition. Conflicts of interests and coordination problems will arise in the process. Classical statistics does not consider people’s incentives and interactions in the data collection process. To address this imperfection, this work explores multi-agent Bayesian inference problems with a game theoretic social network model. Motivated by our interest in aggregate inference at the societal level, we propose a new concept, finite population learning, to address whether with high probability, a large fraction of people in a given finite population network can make “good” inference. Serving as a foundation, this concept enables us to study the long run trend of aggregate inference quality as population grows. PMID:27076691

Combinatorial Drug Screening Identifies Ewing Sarcoma-specific Sensitivities.

PubMed

Radic-Sarikas, Branka; Tsafou, Kalliopi P; Emdal, Kristina B; Papamarkou, Theodore; Huber, Kilian V M; Mutz, Cornelia; Toretsky, Jeffrey A; Bennett, Keiryn L; Olsen, Jesper V; Brunak, Søren; Kovar, Heinrich; Superti-Furga, Giulio

2017-01-01

Improvements in survival for Ewing sarcoma pediatric and adolescent patients have been modest over the past 20 years. Combinations of anticancer agents endure as an option to overcome resistance to single treatments caused by compensatory pathways. Moreover, combinations are thought to lessen any associated adverse side effects through reduced dosing, which is particularly important in childhood tumors. Using a parallel phenotypic combinatorial screening approach of cells derived from three pediatric tumor types, we identified Ewing sarcoma-specific interactions of a diverse set of targeted agents including approved drugs. We were able to retrieve highly synergistic drug combinations specific for Ewing sarcoma and identified signaling processes important for Ewing sarcoma cell proliferation determined by EWS-FLI1 We generated a molecular target profile of PKC412, a multikinase inhibitor with strong synergistic propensity in Ewing sarcoma, revealing its targets in critical Ewing sarcoma signaling routes. Using a multilevel experimental approach including quantitative phosphoproteomics, we analyzed the molecular rationale behind the disease-specific synergistic effect of simultaneous application of PKC412 and IGF1R inhibitors. The mechanism of the drug synergy between these inhibitors is different from the sum of the mechanisms of the single agents. The combination effectively inhibited pathway crosstalk and averted feedback loop repression, in EWS-FLI1-dependent manner. Mol Cancer Ther; 16(1); 88-101. ©2016 AACR. ©2016 American Association for Cancer Research.

Learning Multirobot Hose Transportation and Deployment by Distributed Round-Robin Q-Learning.

PubMed

Fernandez-Gauna, Borja; Etxeberria-Agiriano, Ismael; Graña, Manuel

2015-01-01

Multi-Agent Reinforcement Learning (MARL) algorithms face two main difficulties: the curse of dimensionality, and environment non-stationarity due to the independent learning processes carried out by the agents concurrently. In this paper we formalize and prove the convergence of a Distributed Round Robin Q-learning (D-RR-QL) algorithm for cooperative systems. The computational complexity of this algorithm increases linearly with the number of agents. Moreover, it eliminates environment non sta tionarity by carrying a round-robin scheduling of the action selection and execution. That this learning scheme allows the implementation of Modular State-Action Vetoes (MSAV) in cooperative multi-agent systems, which speeds up learning convergence in over-constrained systems by vetoing state-action pairs which lead to undesired termination states (UTS) in the relevant state-action subspace. Each agent's local state-action value function learning is an independent process, including the MSAV policies. Coordination of locally optimal policies to obtain the global optimal joint policy is achieved by a greedy selection procedure using message passing. We show that D-RR-QL improves over state-of-the-art approaches, such as Distributed Q-Learning, Team Q-Learning and Coordinated Reinforcement Learning in a paradigmatic Linked Multi-Component Robotic System (L-MCRS) control problem: the hose transportation task. L-MCRS are over-constrained systems with many UTS induced by the interaction of the passive linking element and the active mobile robots.

Gene-network inference by message passing

NASA Astrophysics Data System (ADS)

Braunstein, A.; Pagnani, A.; Weigt, M.; Zecchina, R.

2008-01-01

The inference of gene-regulatory processes from gene-expression data belongs to the major challenges of computational systems biology. Here we address the problem from a statistical-physics perspective and develop a message-passing algorithm which is able to infer sparse, directed and combinatorial regulatory mechanisms. Using the replica technique, the algorithmic performance can be characterized analytically for artificially generated data. The algorithm is applied to genome-wide expression data of baker's yeast under various environmental conditions. We find clear cases of combinatorial control, and enrichment in common functional annotations of regulated genes and their regulators.

Combinatorial structure of genome rearrangements scenarios.

PubMed

Ouangraoua, Aïda; Bergeron, Anne

2010-09-01

In genome rearrangement theory, one of the elusive questions raised in recent years is the enumeration of rearrangement scenarios between two genomes. This problem is related to the uniform generation of rearrangement scenarios and the derivation of tests of statistical significance of the properties of these scenarios. Here we give an exact formula for the number of double-cut-and-join (DCJ) rearrangement scenarios between two genomes. We also construct effective bijections between the set of scenarios that sort a component as well studied combinatorial objects such as parking functions, labeled trees, and prüfer codes.

Polyomino Problems to Confuse Computers

ERIC Educational Resources Information Center

Coffin, Stewart

2009-01-01

Computers are very good at solving certain types combinatorial problems, such as fitting sets of polyomino pieces into square or rectangular trays of a given size. However, most puzzle-solving programs now in use assume orthogonal arrangements. When one departs from the usual square grid layout, complications arise. The author--using a computer,…

Semantic Structures of One-Step Word Problems Involving Multiplication or Division.

ERIC Educational Resources Information Center

Schmidt, Siegbert; Weiser, Werner

1995-01-01

Proposes a four-category classification of semantic structures of one-step word problems involving multiplication and division: forming the n-th multiple of measures, combinatorial multiplication, composition of operators, and multiplication by formula. This classification is compatible with semantic structures of addition and subtraction word…

An Innovative Multi-Agent Search-and-Rescue Path Planning Approach

DTIC Science & Technology

2015-03-09

search problems from search theory and artificial intelligence /distributed robotic control, and pursuit-evasion problem perspectives may be found in...Dissanayake, “Probabilistic search for a moving target in an indoor environment”, In Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, 2006, pp...3393-3398. [7] H. Lau, and G. Dissanayake, “Optimal search for multiple targets in a built environment”, In Proc. IEEE/RSJ Int. Conf. Intelligent

Distributed Learning, Extremum Seeking, and Model-Free Optimization for the Resilient Coordination of Multi-Agent Adversarial Groups

DTIC Science & Technology

2016-09-07

been demonstrated on maximum power point tracking for photovoltaic arrays and for wind turbines . 3. ES has recently been implemented on the Mars...high-dimensional optimization problems . Extensions and applications of these techniques were developed during the realization of the project. 15...studied problems of dynamic average consensus and a class of unconstrained continuous-time optimization algorithms for the coordination of multiple

Adaptive fuzzy wavelet network control of second order multi-agent systems with unknown nonlinear dynamics.

PubMed

Taheri, Mehdi; Sheikholeslam, Farid; Najafi, Majddedin; Zekri, Maryam

2017-07-01

In this paper, consensus problem is considered for second order multi-agent systems with unknown nonlinear dynamics under undirected graphs. A novel distributed control strategy is suggested for leaderless systems based on adaptive fuzzy wavelet networks. Adaptive fuzzy wavelet networks are employed to compensate for the effect of unknown nonlinear dynamics. Moreover, the proposed method is developed for leader following systems and leader following systems with state time delays. Lyapunov functions are applied to prove uniformly ultimately bounded stability of closed loop systems and to obtain adaptive laws. Three simulation examples are presented to illustrate the effectiveness of the proposed control algorithms. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Integrated analysis of RNA-binding protein complexes using in vitro selection and high-throughput sequencing and sequence specificity landscapes (SEQRS).

PubMed

Lou, Tzu-Fang; Weidmann, Chase A; Killingsworth, Jordan; Tanaka Hall, Traci M; Goldstrohm, Aaron C; Campbell, Zachary T

2017-04-15

RNA-binding proteins (RBPs) collaborate to control virtually every aspect of RNA function. Tremendous progress has been made in the area of global assessment of RBP specificity using next-generation sequencing approaches both in vivo and in vitro. Understanding how protein-protein interactions enable precise combinatorial regulation of RNA remains a significant problem. Addressing this challenge requires tools that can quantitatively determine the specificities of both individual proteins and multimeric complexes in an unbiased and comprehensive way. One approach utilizes in vitro selection, high-throughput sequencing, and sequence-specificity landscapes (SEQRS). We outline a SEQRS experiment focused on obtaining the specificity of a multi-protein complex between Drosophila RBPs Pumilio (Pum) and Nanos (Nos). We discuss the necessary controls in this type of experiment and examine how the resulting data can be complemented with structural and cell-based reporter assays. Additionally, SEQRS data can be integrated with functional genomics data to uncover biological function. Finally, we propose extensions of the technique that will enhance our understanding of multi-protein regulatory complexes assembled onto RNA. Copyright © 2016 Elsevier Inc. All rights reserved.

ALADDIN: Research into Multi-Agent Solutions for Decentralised Information Systems

DTIC Science & Technology

2009-10-01

estimate of trustworthiness. Of course, such an approach can lead to the problem of data incest in which because the provenance of each individual...which avoids data incest issues. These algorithms and others developed with Aladdin have subsequently been applied to the areas of: Sensor

Applications of Multi-Agent Technology to Power Systems

NASA Astrophysics Data System (ADS)

Nagata, Takeshi

Currently, agents are focus of intense on many sub-fields of computer science and artificial intelligence. Agents are being used in an increasingly wide variety of applications. Many important computing applications such as planning, process control, communication networks and concurrent systems will benefit from using multi-agent system approach. A multi-agent system is a structure given by an environment together with a set of artificial agents capable to act on this environment. Multi-agent models are oriented towards interactions, collaborative phenomena, and autonomy. This article presents the applications of multi-agent technology to the power systems.

Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem.

PubMed

Fort, J C

1988-01-01

We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is illustrated with various numerical examples.

A ripple-spreading genetic algorithm for the aircraft sequencing problem.

PubMed

Hu, Xiao-Bing; Di Paolo, Ezequiel A

2011-01-01

When genetic algorithms (GAs) are applied to combinatorial problems, permutation representations are usually adopted. As a result, such GAs are often confronted with feasibility and memory-efficiency problems. With the aircraft sequencing problem (ASP) as a study case, this paper reports on a novel binary-representation-based GA scheme for combinatorial problems. Unlike existing GAs for the ASP, which typically use permutation representations based on aircraft landing order, the new GA introduces a novel ripple-spreading model which transforms the original landing-order-based ASP solutions into value-based ones. In the new scheme, arriving aircraft are projected as points into an artificial space. A deterministic method inspired by the natural phenomenon of ripple-spreading on liquid surfaces is developed, which uses a few parameters as input to connect points on this space to form a landing sequence. A traditional GA, free of feasibility and memory-efficiency problems, can then be used to evolve the ripple-spreading related parameters in order to find an optimal sequence. Since the ripple-spreading model is the centerpiece of the new algorithm, it is called the ripple-spreading GA (RSGA). The advantages of the proposed RSGA are illustrated by extensive comparative studies for the case of the ASP.

Quantum Barro-Gordon game in monetary economics

NASA Astrophysics Data System (ADS)

Samadi, Ali Hussein; Montakhab, Afshin; Marzban, Hussein; Owjimehr, Sakine

2018-01-01

Classical game theory addresses decision problems in multi-agent environment where one rational agent's decision affects other agents' payoffs. Game theory has widespread application in economic, social and biological sciences. In recent years quantum versions of classical games have been proposed and studied. In this paper, we consider a quantum version of the classical Barro-Gordon game which captures the problem of time inconsistency in monetary economics. Such time inconsistency refers to the temptation of weak policy maker to implement high inflation when the public expects low inflation. The inconsistency arises when the public punishes the weak policy maker in the next cycle. We first present a quantum version of the Barro-Gordon game. Next, we show that in a particular case of the quantum game, time-consistent Nash equilibrium could be achieved when public expects low inflation, thus resolving the game.

Exploring Heuristics for the Vehicle Routing Problem with Split Deliveries and Time Windows

DTIC Science & Technology

2014-09-18

a traveling 2 salesman problem (TSP). Therefore in the remainder of this document, the VRP refers to a capacitated VRP. 1.3 Military...specifically investigated the SDVRPTW. Stutzle [63] investigates the effects of several LS operators on the traveling salesman problem , the quadratic...34 Traveling salesman -type combinatorial problems and their relation to the logistics of regional blood banking," Northwestern University, Evanston, IL

Control Coordination of Multiple Agents Through Decision Theoretic and Economic Methods

DTIC Science & Technology

2003-02-01

instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information...investigated the design of test data for benchmarking such optimization algorithms. Our other research on combinatorial auctions included I...average combination rule. We exemplified these theoretical results with experiments on stock market data , demonstrating how ensembles of classifiers can

Experimental Design for Combinatorial and High Throughput Materials Development

NASA Astrophysics Data System (ADS)

Cawse, James N.

2002-12-01

In the past decade, combinatorial and high throughput experimental methods have revolutionized the pharmaceutical industry, allowing researchers to conduct more experiments in a week than was previously possible in a year. Now high throughput experimentation is rapidly spreading from its origins in the pharmaceutical world to larger industrial research establishments such as GE and DuPont, and even to smaller companies and universities. Consequently, researchers need to know the kinds of problems, desired outcomes, and appropriate patterns for these new strategies. Editor James Cawse's far-reaching study identifies and applies, with specific examples, these important new principles and techniques. Experimental Design for Combinatorial and High Throughput Materials Development progresses from methods that are now standard, such as gradient arrays, to mathematical developments that are breaking new ground. The former will be particularly useful to researchers entering the field, while the latter should inspire and challenge advanced practitioners. The book's contents are contributed by leading researchers in their respective fields. Chapters include: -High Throughput Synthetic Approaches for the Investigation of Inorganic Phase Space -Combinatorial Mapping of Polymer Blends Phase Behavior -Split-Plot Designs -Artificial Neural Networks in Catalyst Development -The Monte Carlo Approach to Library Design and Redesign This book also contains over 200 useful charts and drawings. Industrial chemists, chemical engineers, materials scientists, and physicists working in combinatorial and high throughput chemistry will find James Cawse's study to be an invaluable resource.

On Reverse Stackelberg Game and Optimal Mean Field Control for a Large Population of Thermostatically Controlled Loads

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Sen; Zhang, Wei; Lian, Jianming

This paper studies a multi-stage pricing problem for a large population of thermostatically controlled loads. The problem is formulated as a reverse Stackelberg game that involves a mean field game in the hierarchy of decision making. In particular, in the higher level, a coordinator needs to design a pricing function to motivate individual agents to maximize the social welfare. In the lower level, the individual utility maximization problem of each agent forms a mean field game coupled through the pricing function that depends on the average of the population control/state. We derive the solution to the reverse Stackelberg game bymore » connecting it to a team problem and the competitive equilibrium, and we show that this solution corresponds to the optimal mean field control that maximizes the social welfare. Realistic simulations are presented to validate the proposed methods.« less

Investigation of Simulated Trading — A multi agent based trading system for optimization purposes

NASA Astrophysics Data System (ADS)

Schneider, Johannes J.

2010-07-01

Some years ago, Bachem, Hochstättler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed rule set, the financial market creates a buy-and-sell graph for the various orders in the order book, intending to optimize the overall system. Here I present a thorough investigation for the application of this algorithm to the traveling salesman problem.

Demeter, persephone, and the search for emergence in agent-based models.

DOE Office of Scientific and Technical Information (OSTI.GOV)

North, M. J.; Howe, T. R.; Collier, N. T.

2006-01-01

In Greek mythology, the earth goddess Demeter was unable to find her daughter Persephone after Persephone was abducted by Hades, the god of the underworld. Demeter is said to have embarked on a long and frustrating, but ultimately successful, search to find her daughter. Unfortunately, long and frustrating searches are not confined to Greek mythology. In modern times, agent-based modelers often face similar troubles when searching for agents that are to be to be connected to one another and when seeking appropriate target agents while defining agent behaviors. The result is a 'search for emergence' in that many emergent ormore » potentially emergent behaviors in agent-based models of complex adaptive systems either implicitly or explicitly require search functions. This paper considers a new nested querying approach to simplifying such agent-based modeling and multi-agent simulation search problems.« less

A Computational Model and Multi-Agent Simulation for Information Assurance

DTIC Science & Technology

2002-06-01

Podell , Information Security: an Integrated Collection of Essays, IEEE Computer Society Press, Los Alamitos, CA, 1994. Brinkley, D. L. and Schell, R...R., “What is There to Worry About? An Introduction to the Computer Security Problem,” ed. Abrams and Jajodia and Podell , Information Security: an

A New Combinatorial Optimization Approach for Integrated Feature Selection Using Different Datasets: A Prostate Cancer Transcriptomic Study

PubMed Central

Puthiyedth, Nisha; Riveros, Carlos; Berretta, Regina; Moscato, Pablo

2015-01-01

Background The joint study of multiple datasets has become a common technique for increasing statistical power in detecting biomarkers obtained from smaller studies. The approach generally followed is based on the fact that as the total number of samples increases, we expect to have greater power to detect associations of interest. This methodology has been applied to genome-wide association and transcriptomic studies due to the availability of datasets in the public domain. While this approach is well established in biostatistics, the introduction of new combinatorial optimization models to address this issue has not been explored in depth. In this study, we introduce a new model for the integration of multiple datasets and we show its application in transcriptomics. Methods We propose a new combinatorial optimization problem that addresses the core issue of biomarker detection in integrated datasets. Optimal solutions for this model deliver a feature selection from a panel of prospective biomarkers. The model we propose is a generalised version of the (α,β)-k-Feature Set problem. We illustrate the performance of this new methodology via a challenging meta-analysis task involving six prostate cancer microarray datasets. The results are then compared to the popular RankProd meta-analysis tool and to what can be obtained by analysing the individual datasets by statistical and combinatorial methods alone. Results Application of the integrated method resulted in a more informative signature than the rank-based meta-analysis or individual dataset results, and overcomes problems arising from real world datasets. The set of genes identified is highly significant in the context of prostate cancer. The method used does not rely on homogenisation or transformation of values to a common scale, and at the same time is able to capture markers associated with subgroups of the disease. PMID:26106884

A solid-phase combinatorial approach for indoloquinolizidine-peptides with high affinity at D(1) and D(2) dopamine receptors.

PubMed

Molero, Anabel; Vendrell, Marc; Bonaventura, Jordi; Zachmann, Julian; López, Laura; Pardo, Leonardo; Lluis, Carme; Cortés, Antoni; Albericio, Fernando; Casadó, Vicent; Royo, Miriam

2015-06-05

Ligands acting at multiple dopamine receptors hold potential as therapeutic agents for a number of neurodegenerative disorders. Specifically, compounds able to bind at D1R and D2R with high affinity could restore the effects of dopamine depletion and enhance motor activation on degenerated nigrostriatal dopaminergic systems. We have directed our research towards the synthesis and characterisation of heterocycle-peptide hybrids based on the indolo[2,3-a]quinolizidine core. This privileged structure is a water-soluble and synthetically accessible scaffold with affinity for diverse GPCRs. Herein we have prepared a solid-phase combinatorial library of 80 indoloquinolizidine-peptides to identify compounds with enhanced binding affinity at D2R, a receptor that is crucial to re-establish activity on dopamine-depleted degenerated GABAergic neurons. We applied computational tools and high-throughput screening assays to identify 9a{1,3,3} as a ligand for dopamine receptors with nanomolar affinity and agonist activity at D2R. Our results validate the application of indoloquinolizidine-peptide combinatorial libraries to fine-tune the pharmacological profiles of multiple ligands at D1 and D2 dopamine receptors. Copyright © 2015 Elsevier Masson SAS. All rights reserved.

Multi-agent systems: effective approach for cancer care information management.

PubMed

Mohammadzadeh, Niloofar; Safdari, Reza; Rahimi, Azin

2013-01-01

Physicians, in order to study the causes of cancer, detect cancer earlier, prevent or determine the effectiveness of treatment, and specify the reasons for the treatment ineffectiveness, need to access accurate, comprehensive, and timely cancer data. The cancer care environment has become more complex because of the need for coordination and communication among health care professionals with different skills in a variety of roles and the existence of large amounts of data with various formats. The goals of health care systems in such a complex environment are correct health data management, providing appropriate information needs of users to enhance the integrity and quality of health care, timely access to accurate information and reducing medical errors. These roles in new systems with use of agents efficiently perform well. Because of the potential capability of agent systems to solve complex and dynamic health problems, health care system, in order to gain full advantage of E- health, steps must be taken to make use of this technology. Multi-agent systems have effective roles in health service quality improvement especially in telemedicine, emergency situations and management of chronic diseases such as cancer. In the design and implementation of agent based systems, planning items such as information confidentiality and privacy, architecture, communication standards, ethical and legal aspects, identification opportunities and barriers should be considered. It should be noted that usage of agent systems only with a technical view is associated with many problems such as lack of user acceptance. The aim of this commentary is to survey applications, opportunities and barriers of this new artificial intelligence tool for cancer care information as an approach to improve cancer care management.

Water-soluble polymer–drug conjugates for combination chemotherapy against visceral leishmaniasis

PubMed Central

Nicoletti, Salvatore; Seifert, Karin; Gilbert, Ian H.

2010-01-01

There is a need for new safe, effective and short-course treatments for leishmaniasis; one strategy is to use combination chemotherapy. Polymer–drug conjugates have shown promise for the delivery of anti-leishmanial agents such as amphotericin B. In this paper, we report on the preparation and biological evaluation of polymer–drug conjugates of N-(2-hydroxypropyl)methacrylamide (HPMA), amphotericin B and alendronic acid. The combinatorial polymer–drug conjugates were effective anti-leishmanial agents in vitro and in vivo, but offered no advantage over the single poly(HPMA)–amphotericin B conjugates. PMID:20338769

Plant-Derived Agents for Counteracting Cisplatin-Induced Nephrotoxicity.

PubMed

Ojha, Shreesh; Venkataraman, Balaji; Kurdi, Amani; Mahgoub, Eglal; Sadek, Bassem; Rajesh, Mohanraj

2016-01-01

Cisplatin (CSP) is a chemotherapeutic agent commonly used to treat a variety of malignancies. The major setback with CSP treatment is that its clinical efficacy is compromised by its induction of organ toxicity, particular to the kidneys and ears. Despite the significant strides that have been made in understanding the mechanisms underlying CSP-induced renal toxicity, advances in developing renoprotective strategies are still lacking. In addition, the renoprotective approaches described in the literature reveal partial amelioration of CSP-induced renal toxicity, stressing the need to develop potent combinatorial/synergistic agents for the mitigation of renal toxicity. However, the ideal renoprotective adjuvant should not interfere with the anticancer efficacy of CSP. In this review, we have discussed the progress made in utilizing plant-derived agents (phytochemicals) to combat CSP-induced nephrotoxicity in preclinical studies. Furthermore, we have also presented strategies to utilize phytochemicals as prototypes for the development of novel renoprotective agents for counteracting chemotherapy-induced renal damage.

Plant-Derived Agents for Counteracting Cisplatin-Induced Nephrotoxicity

PubMed Central

Venkataraman, Balaji; Kurdi, Amani; Mahgoub, Eglal; Sadek, Bassem

2016-01-01

Cisplatin (CSP) is a chemotherapeutic agent commonly used to treat a variety of malignancies. The major setback with CSP treatment is that its clinical efficacy is compromised by its induction of organ toxicity, particular to the kidneys and ears. Despite the significant strides that have been made in understanding the mechanisms underlying CSP-induced renal toxicity, advances in developing renoprotective strategies are still lacking. In addition, the renoprotective approaches described in the literature reveal partial amelioration of CSP-induced renal toxicity, stressing the need to develop potent combinatorial/synergistic agents for the mitigation of renal toxicity. However, the ideal renoprotective adjuvant should not interfere with the anticancer efficacy of CSP. In this review, we have discussed the progress made in utilizing plant-derived agents (phytochemicals) to combat CSP-induced nephrotoxicity in preclinical studies. Furthermore, we have also presented strategies to utilize phytochemicals as prototypes for the development of novel renoprotective agents for counteracting chemotherapy-induced renal damage. PMID:27774117

The Wisdom of the Crowd in Combinatorial Problems

ERIC Educational Resources Information Center

Yi, Sheng Kung Michael; Steyvers, Mark; Lee, Michael D.; Dry, Matthew J.

2012-01-01

The "wisdom of the crowd" phenomenon refers to the finding that the aggregate of a set of proposed solutions from a group of individuals performs better than the majority of individual solutions. Most often, wisdom of the crowd effects have been investigated for problems that require single numerical estimates. We investigate whether the effect…

Application of ant colony optimization to optimal foragaing theory: comparison of simulation and field results

USDA-ARS?s Scientific Manuscript database

Ant Colony Optimization (ACO) refers to the family of algorithms inspired by the behavior of real ants and used to solve combinatorial problems such as the Traveling Salesman Problem (TSP).Optimal Foraging Theory (OFT) is an evolutionary principle wherein foraging organisms or insect parasites seek ...

MARS, a multi-agent system for assessing rowers' coordination via motion-based stigmergy.

PubMed

Avvenuti, Marco; Cesarini, Daniel; Cimino, Mario G C A

2013-09-12

A crucial aspect in rowing is having a synchronized, highly-efficient stroke. This is very difficult to obtain, due to the many interacting factors that each rower of the crew must perceive. Having a system that monitors and represents the crew coordination would be of great help to the coach during training sessions. In the literature, some methods already employ wireless sensors for capturing motion patterns that affect rowing performance. A challenging problem is to support the coach's decisions at his same level of knowledge, using a limited number of sensors and avoiding the complexity of the biomechanical analysis of human movements. In this paper, we present a multi-agent information-processing system for on-water measuring of both the overall crew asynchrony and the individual rower asynchrony towards the crew. More specifically, in the system, the first level of processing is managed by marking agents, which release marks in a sensing space, according to the rowers' motion. The accumulation of marks enables a stigmergic cooperation mechanism, generating collective marks, i.e., short-term memory structures in the sensing space. At the second level of processing, information provided by marks is observed by similarity agents, which associate a similarity degree with respect to optimal marks. Finally, the third level is managed by granulation agents, which extract asynchrony indicators for different purposes. The effectiveness of the system has been experimented on real-world scenarios. The study includes the problem statement and its characterization in the literature, as well as the proposed solving approach and initial experimental setting.

MARS, a Multi-Agent System for Assessing Rowers' Coordination via Motion-Based Stigmergy

PubMed Central

Avvenuti, Marco; Cesarini, Daniel; Cimino, Mario G. C. A.

2013-01-01

A crucial aspect in rowing is having a synchronized, highly-efficient stroke. This is very difficult to obtain, due to the many interacting factors that each rower of the crew must perceive. Having a system that monitors and represents the crew coordination would be of great help to the coach during training sessions. In the literature, some methods already employ wireless sensors for capturing motion patterns that affect rowing performance. A challenging problem is to support the coach's decisions at his same level of knowledge, using a limited number of sensors and avoiding the complexity of the biomechanical analysis of human movements. In this paper, we present a multi-agent information-processing system for on-water measuring of both the overall crew asynchrony and the individual rower asynchrony towards the crew. More specifically, in the system, the first level of processing is managed by marking agents, which release marks in a sensing space, according to the rowers' motion. The accumulation of marks enables a stigmergic cooperation mechanism, generating collective marks, i.e., short-term memory structures in the sensing space. At the second level of processing, information provided by marks is observed by similarity agents, which associate a similarity degree with respect to optimal marks. Finally, the third level is managed by granulation agents, which extract asynchrony indicators for different purposes. The effectiveness of the system has been experimented on real-world scenarios. The study includes the problem statement and its characterization in the literature, as well as the proposed solving approach and initial experimental setting. PMID:24036582

Research on mixed network architecture collaborative application model

NASA Astrophysics Data System (ADS)

Jing, Changfeng; Zhao, Xi'an; Liang, Song

2009-10-01

When facing complex requirements of city development, ever-growing spatial data, rapid development of geographical business and increasing business complexity, collaboration between multiple users and departments is needed urgently, however conventional GIS software (such as Client/Server model or Browser/Server model) are not support this well. Collaborative application is one of the good resolutions. Collaborative application has four main problems to resolve: consistency and co-edit conflict, real-time responsiveness, unconstrained operation, spatial data recoverability. In paper, application model called AMCM is put forward based on agent and multi-level cache. AMCM can be used in mixed network structure and supports distributed collaborative. Agent is an autonomous, interactive, initiative and reactive computing entity in a distributed environment. Agent has been used in many fields such as compute science and automation. Agent brings new methods for cooperation and the access for spatial data. Multi-level cache is a part of full data. It reduces the network load and improves the access and handle of spatial data, especially, in editing the spatial data. With agent technology, we make full use of its characteristics of intelligent for managing the cache and cooperative editing that brings a new method for distributed cooperation and improves the efficiency.

Optimal control in microgrid using multi-agent reinforcement learning.

PubMed

Li, Fu-Dong; Wu, Min; He, Yong; Chen, Xin

2012-11-01

This paper presents an improved reinforcement learning method to minimize electricity costs on the premise of satisfying the power balance and generation limit of units in a microgrid with grid-connected mode. Firstly, the microgrid control requirements are analyzed and the objective function of optimal control for microgrid is proposed. Then, a state variable "Average Electricity Price Trend" which is used to express the most possible transitions of the system is developed so as to reduce the complexity and randomicity of the microgrid, and a multi-agent architecture including agents, state variables, action variables and reward function is formulated. Furthermore, dynamic hierarchical reinforcement learning, based on change rate of key state variable, is established to carry out optimal policy exploration. The analysis shows that the proposed method is beneficial to handle the problem of "curse of dimensionality" and speed up learning in the unknown large-scale world. Finally, the simulation results under JADE (Java Agent Development Framework) demonstrate the validity of the presented method in optimal control for a microgrid with grid-connected mode. Copyright © 2012 ISA. Published by Elsevier Ltd. All rights reserved.

IR780 based nanomaterials for cancer imaging and photothermal, photodynamic and combinatorial therapies.

PubMed

Alves, Cátia G; Lima-Sousa, Rita; de Melo-Diogo, Duarte; Louro, Ricardo O; Correia, Ilídio J

2018-05-05

IR780, a molecule with a strong optical absorption and emission in the near infrared (NIR) region, is receiving an increasing attention from researchers working in the area of cancer treatment and imaging. Upon irradiation with NIR light, IR780 can produce reactive oxygen species as well as increase the body temperature, thus being a promising agent for application in cancer photodynamic and photothermal therapy. However, IR780's poor water solubility, fast clearance, acute toxicity and low tumor uptake may limit its use. To overcome such issues, several types of nanomaterials have been used to encapsulate and deliver IR780 to tumor cells. This mini-review is focused on the application of IR780 based nanostructures for cancer imaging, and photothermal, photodynamic and combinatorial therapies. Copyright © 2018 Elsevier B.V. All rights reserved.

Multitriangulations, pseudotriangulations and some problems of realization of polytopes

NASA Astrophysics Data System (ADS)

Pilaud, Vincent

2010-09-01

This thesis explores two specific topics of discrete geometry, the multitriangulations and the polytopal realizations of products, whose connection is the problem of finding polytopal realizations of a given combinatorial structure. A k-triangulation is a maximal set of chords of the convex n-gon such that no k+1 of them mutually cross. We propose a combinatorial and geometric study of multitriangulations based on their stars, which play the same role as triangles of triangulations. This study leads to interpret multitriangulations by duality as pseudoline arrangements with contact points covering a given support. We exploit finally these results to discuss some open problems on multitriangulations, in particular the question of the polytopal realization of their flip graphs. We study secondly the polytopality of Cartesian products. We investigate the existence of polytopal realizations of cartesian products of graphs, and we study the minimal dimension that can have a polytope whose k-skeleton is that of a product of simplices.

Exploiting Lipid Permutation Symmetry to Compute Membrane Remodeling Free Energies.

PubMed

Bubnis, Greg; Risselada, Herre Jelger; Grubmüller, Helmut

2016-10-28

A complete physical description of membrane remodeling processes, such as fusion or fission, requires knowledge of the underlying free energy landscapes, particularly in barrier regions involving collective shape changes, topological transitions, and high curvature, where Canham-Helfrich (CH) continuum descriptions may fail. To calculate these free energies using atomistic simulations, one must address not only the sampling problem due to high free energy barriers, but also an orthogonal sampling problem of combinatorial complexity stemming from the permutation symmetry of identical lipids. Here, we solve the combinatorial problem with a permutation reduction scheme to map a structural ensemble into a compact, nondegenerate subregion of configuration space, thereby permitting straightforward free energy calculations via umbrella sampling. We applied this approach, using a coarse-grained lipid model, to test the CH description of bending and found sharp increases in the bending modulus for curvature radii below 10 nm. These deviations suggest that an anharmonic bending term may be required for CH models to give quantitative energetics of highly curved states.

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

NASA Technical Reports Server (NTRS)

Huang, Chien-Feng; Wolpert, David H.; Bieniawski, Stefan; Strauss, Charles E. M.

2005-01-01

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Solving "Smart City" Transport Problems by Designing Carpooling Gamification Schemes with Multi-Agent Systems: The Case of the So-Called "Mordor of Warsaw".

PubMed

Olszewski, Robert; Pałka, Piotr; Turek, Agnieszka

2018-01-06

To reduce energy consumption and improve residents' quality of life, "smart cities" should use not only modern technologies, but also the social innovations of the "Internet of Things" (IoT) era. This article attempts to solve transport problems in a smart city's office district by utilizing gamification that incentivizes the carpooling system. The goal of the devised system is to significantly reduce the number of cars, and, consequently, to alleviate traffic jams, as well as to curb pollution and energy consumption. A representative sample of the statistical population of people working in one of the biggest office hubs in Poland (the so-called "Mordor of Warsaw") was surveyed. The collected data were processed using spatial data mining methods, and the results were a set of parameters for the multi-agent system. This approach made it possible to run a series of simulations on a set of 100,000 agents and to select an effective gamification methodology that supports the carpooling process. The implementation of the proposed solutions (a "serious game" variation of urban games) would help to reduce the number of cars by several dozen percent, significantly reduce energy consumption, eliminate traffic jams, and increase the activity of the smart city residents.

Combinatorial optimization in foundry practice

NASA Astrophysics Data System (ADS)

Antamoshkin, A. N.; Masich, I. S.

2016-04-01

The multicriteria mathematical model of foundry production capacity planning is suggested in the paper. The model is produced in terms of pseudo-Boolean optimization theory. Different search optimization methods were used to solve the obtained problem.

The Construction of Venn Diagrams.

ERIC Educational Resources Information Center

Grunbaum, Branko

1984-01-01

The study and use of "Venn diagrams" can lead to many interesting problems of a geometric, topological, or combinatorial character. The general nature of these diagrams is discussed and two new results are formulated. (JN)

A market-based optimization approach to sensor and resource management

NASA Astrophysics Data System (ADS)

Schrage, Dan; Farnham, Christopher; Gonsalves, Paul G.

2006-05-01

Dynamic resource allocation for sensor management is a problem that demands solutions beyond traditional approaches to optimization. Market-based optimization applies solutions from economic theory, particularly game theory, to the resource allocation problem by creating an artificial market for sensor information and computational resources. Intelligent agents are the buyers and sellers in this market, and they represent all the elements of the sensor network, from sensors to sensor platforms to computational resources. These agents interact based on a negotiation mechanism that determines their bidding strategies. This negotiation mechanism and the agents' bidding strategies are based on game theory, and they are designed so that the aggregate result of the multi-agent negotiation process is a market in competitive equilibrium, which guarantees an optimal allocation of resources throughout the sensor network. This paper makes two contributions to the field of market-based optimization: First, we develop a market protocol to handle heterogeneous goods in a dynamic setting. Second, we develop arbitrage agents to improve the efficiency in the market in light of its dynamic nature.

Designing a multiroute synthesis scheme in combinatorial chemistry.

PubMed

Akavia, Adi; Senderowitz, Hanoch; Lerner, Alon; Shamir, Ron

2004-01-01

Solid-phase mix-and-split combinatorial synthesis is often used to produce large arrays of compounds to be tested during the various stages of the drug development process. This method can be represented by a synthesis graph in which nodes correspond to grow operations and arcs to beads transferred among the different reaction vessels. In this work, we address the problem of designing such a graph which maximizes the number of produced target compounds (namely, compounds out of an input library of desired molecules), given constraints on the number of beads used for library synthesis and on the number of reaction vessels available for concurrent grow steps. We present a heuristic based on a discrete search for solving this problem, test our solution on several data sets, explore its behavior, and show that it achieves good performance.

Haplotyping for disease association: a combinatorial approach.

PubMed

Lancia, Giuseppe; Ravi, R; Rizzi, Romeo

2008-01-01

We consider a combinatorial problem derived from haplotyping a population with respect to a genetic disease, either recessive or dominant. Given a set of individuals, partitioned into healthy and diseased, and the corresponding sets of genotypes, we want to infer "bad'' and "good'' haplotypes to account for these genotypes and for the disease. Assume e.g. the disease is recessive. Then, the resolving haplotypes must consist of bad and good haplotypes, so that (i) each genotype belonging to a diseased individual is explained by a pair of bad haplotypes and (ii) each genotype belonging to a healthy individual is explained by a pair of haplotypes of which at least one is good. We prove that the associated decision problem is NP-complete. However, we also prove that there is a simple solution, provided the data satisfy a very weak requirement.

A Discriminative Sentence Compression Method as Combinatorial Optimization Problem

NASA Astrophysics Data System (ADS)

Hirao, Tsutomu; Suzuki, Jun; Isozaki, Hideki

In the study of automatic summarization, the main research topic was `important sentence extraction' but nowadays `sentence compression' is a hot research topic. Conventional sentence compression methods usually transform a given sentence into a parse tree or a dependency tree, and modify them to get a shorter sentence. However, this method is sometimes too rigid. In this paper, we regard sentence compression as an combinatorial optimization problem that extracts an optimal subsequence of words. Hori et al. also proposed a similar method, but they used only a small number of features and their weights were tuned by hand. We introduce a large number of features such as part-of-speech bigrams and word position in the sentence. Furthermore, we train the system by discriminative learning. According to our experiments, our method obtained better score than other methods with statistical significance.

Multi-Protein Dynamic Combinatorial Chemistry: A Novel Strategy that Leads to Simultaneous Discovery of Subfamily-Selective Inhibitors for Nucleic Acid Demethylases FTO and ALKBH3.

PubMed

Das, Mohua; Tianming, Yang; Jinghua, Dong; Prasetya, Fransisca; Yiming, Xie; Wong, Kendra; Cheong, Adeline; Woon, Esther C Y

2018-06-19

Dynamic combinatorial chemistry (DCC) is a powerful supramolecular approach for discovering ligands for biomolecules. To date, most, if not all, biologically-templated DCC employ only a single biomolecule in directing the self-assembly process. To expand the scope and potential of DCC, herein, we developed a novel multi-protein DCC strategy which combines the discriminatory power of zwitterionic 'thermal-tag' with the sensitivity of differential scanning fluorimetry. This strategy enables the discovery of ligands against several proteins of interest concurrently. It is remarkably sensitive and could differentiate the binding of ligands to structurally-similar subfamily members, which is extremely challenging to achieve. Through this approach, we were able to simultaneously identify subfamily-selective probes against two clinically important epigenetic enzymes, FTO (7; IC₅₀ = 2.6 µM) and ALKBH3 (8; IC₅₀ = 3.7 µM). To our knowledge, this is the first report of a subfamily-selective ALKBH3 inhibitor. The developed strategy could, in principle, be adapted to a broad range of proteins, thus it shall be of widespread scientific interest. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A theoretical introduction to "combinatory SYBRGreen qPCR screening", a matrix-based approach for the detection of materials derived from genetically modified plants.

PubMed

Van den Bulcke, Marc; Lievens, Antoon; Barbau-Piednoir, Elodie; MbongoloMbella, Guillaume; Roosens, Nancy; Sneyers, Myriam; Casi, Amaya Leunda

2010-03-01

The detection of genetically modified (GM) materials in food and feed products is a complex multi-step analytical process invoking screening, identification, and often quantification of the genetically modified organisms (GMO) present in a sample. "Combinatory qPCR SYBRGreen screening" (CoSYPS) is a matrix-based approach for determining the presence of GM plant materials in products. The CoSYPS decision-support system (DSS) interprets the analytical results of SYBRGREEN qPCR analysis based on four values: the C(t)- and T(m) values and the LOD and LOQ for each method. A theoretical explanation of the different concepts applied in CoSYPS analysis is given (GMO Universe, "Prime number tracing", matrix/combinatory approach) and documented using the RoundUp Ready soy GTS40-3-2 as an example. By applying a limited set of SYBRGREEN qPCR methods and through application of a newly developed "prime number"-based algorithm, the nature of subsets of corresponding GMO in a sample can be determined. Together, these analyses provide guidance for semi-quantitative estimation of GMO presence in a food and feed product.

Robust consensus algorithm for multi-agent systems with exogenous disturbances under convergence conditions

NASA Astrophysics Data System (ADS)

Jiang, Yulian; Liu, Jianchang; Tan, Shubin; Ming, Pingsong

2014-09-01

In this paper, a robust consensus algorithm is developed and sufficient conditions for convergence to consensus are proposed for a multi-agent system (MAS) with exogenous disturbances subject to partial information. By utilizing H∞ robust control, differential game theory and a design-based approach, the consensus problem of the MAS with exogenous bounded interference is resolved and the disturbances are restrained, simultaneously. Attention is focused on designing an H∞ robust controller (the robust consensus algorithm) based on minimisation of our proposed rational and individual cost functions according to goals of the MAS. Furthermore, sufficient conditions for convergence of the robust consensus algorithm are given. An example is employed to demonstrate that our results are effective and more capable to restrain exogenous disturbances than the existing literature.

Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.

PubMed

Chen, Xin; Wu, Qiong; Sun, Ruimin; Zhang, Louxin

2012-01-01

The discovery of single-nucleotide polymorphisms (SNPs) has important implications in a variety of genetic studies on human diseases and biological functions. One valuable approach proposed for SNP discovery is based on base-specific cleavage and mass spectrometry. However, it is still very challenging to achieve the full potential of this SNP discovery approach. In this study, we formulate two new combinatorial optimization problems. While both problems are aimed at reconstructing the sample sequence that would attain the minimum number of SNPs, they search over different candidate sequence spaces. The first problem, denoted as SNP - MSP, limits its search to sequences whose in silico predicted mass spectra have all their signals contained in the measured mass spectra. In contrast, the second problem, denoted as SNP - MSQ, limits its search to sequences whose in silico predicted mass spectra instead contain all the signals of the measured mass spectra. We present an exact dynamic programming algorithm for solving the SNP - MSP problem and also show that the SNP - MSQ problem is NP-hard by a reduction from a restricted variation of the 3-partition problem. We believe that an efficient solution to either problem above could offer a seamless integration of information in four complementary base-specific cleavage reactions, thereby improving the capability of the underlying biotechnology for sensitive and accurate SNP discovery.

DNA as Sensors and Imaging Agents for Metal Ions

PubMed Central

Xiang, Yu

2014-01-01

Increasing interests in detecting metal ions in many chemical and biomedical fields have created demands for developing sensors and imaging agents for metal ions with high sensitivity and selectivity. This review covers recent progress in DNA-based sensors and imaging agents for metal ions. Through both combinatorial selection and rational design, a number of metal ion-dependent DNAzymes and metal ion-binding DNA structures that can selectively recognize specific metal ions have been obtained. By attaching these DNA molecules with signal reporters such as fluorophores, chromophores, electrochemical tags, and Raman tags, a number of DNA-based sensors for both diamagnetic and paramagnetic metal ions have been developed for fluorescent, colorimetric, electrochemical, and surface Raman detections. These sensors are highly sensitive (with detection limit down to 11 ppt) and selective (with selectivity up to millions-fold) toward specific metal ions. In addition, through further development to simplify the operation, such as the use of “dipstick tests”, portable fluorometers, computer-readable discs, and widely available glucose meters, these sensors have been applied for on-site and real-time environmental monitoring and point-of-care medical diagnostics. The use of these sensors for in situ cellular imaging has also been reported. The generality of the combinatorial selection to obtain DNAzymes for almost any metal ion in any oxidation state, and the ease of modification of the DNA with different signal reporters make DNA an emerging and promising class of molecules for metal ion sensing and imaging in many fields of applications. PMID:24359450

Prussian blue/serum albumin/indocyanine green as a multifunctional nanotheranostic agent for bimodal imaging guided laser mediated combinatorial phototherapy.

PubMed

Sahu, Abhishek; Lee, Jong Hyun; Lee, Hye Gyeong; Jeong, Yong Yeon; Tae, Giyoong

2016-08-28

Developing novel nanotheranostic agent using only clinically approved materials is highly desirable and challenging. In this study, we combined three clinically approved materials, Prussian blue (PB), serum albumin (BSA), and indocyanine green (ICG), by a simple and biocompatible method to prepare a multifunctional theranostic PB-BSA-ICG nanoparticle. The multifunctional nanoparticle system could provide dual mode magnetic resonance (MR) and near infrared (NIR) fluorescence imaging as well as combined photothermal and photodynamic (PTT-PDT) therapy in response to a single NIR laser. This nanoparticle showed an excellent stability in physiological solutions and could suppress the photo-instability of ICG. In the absence of light, the nanoparticles showed no cytotoxicity, but significant cell death was induced through combined PTT-PDT effect after irradiation with NIR laser light. A high tumor accumulation and minimal nonspecific uptake by other major organs of PB-BSA-ICG nanoparticle were observed in vivo, analyzed by T1-weighted MR and NIR fluorescence bimodal imaging in tumor xenograft mice after intravenous injection. The nanoparticles efficiently suppressed the tumor growth through combinatorial phototherapy with no tumor recurrence upon a single NIR laser irradiation. These results demonstrated that PB-BSA-ICG is potentially an interesting nanotheranostic agent for imaging guided cancer therapy by overcoming the limitations of each technology and enhancing the therapeutic efficiency as well as reducing side effects. Copyright © 2016 Elsevier B.V. All rights reserved.

Patient Stratification with a Novel Molecular Imaging Agent

DTIC Science & Technology

2014-12-01

policy or decision unless so designated by other documentation. REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public reporting...ester of biotin and removed unreacted biotin with a desalting column. 0.7 biotins per protein were achieved as measured by matrix-assisted laser...translation to flow cytometry assays has been inconsistent. In addition to the next two advances (cellular panning and improved combinatorial library design

Exploration of Force Transition in Stability Operations Using Multi-Agent Simulation

DTIC Science & Technology

2006-09-01

risk, mission failure risk, and time in the context of the operational threat environment. The Pythagoras Multi-Agent Simulation and Data Farming...NUMBER OF PAGES 173 14. SUBJECT TERMS Stability Operations, Peace Operations, Data Farming, Pythagoras , Agent- Based Model, Multi-Agent Simulation...the operational threat environment. The Pythagoras Multi-Agent Simulation and Data Farming techniques are used to investigate force-level

A self-taught artificial agent for multi-physics computational model personalization.

PubMed

Neumann, Dominik; Mansi, Tommaso; Itu, Lucian; Georgescu, Bogdan; Kayvanpour, Elham; Sedaghat-Hamedani, Farbod; Amr, Ali; Haas, Jan; Katus, Hugo; Meder, Benjamin; Steidl, Stefan; Hornegger, Joachim; Comaniciu, Dorin

2016-12-01

Personalization is the process of fitting a model to patient data, a critical step towards application of multi-physics computational models in clinical practice. Designing robust personalization algorithms is often a tedious, time-consuming, model- and data-specific process. We propose to use artificial intelligence concepts to learn this task, inspired by how human experts manually perform it. The problem is reformulated in terms of reinforcement learning. In an off-line phase, Vito, our self-taught artificial agent, learns a representative decision process model through exploration of the computational model: it learns how the model behaves under change of parameters. The agent then automatically learns an optimal strategy for on-line personalization. The algorithm is model-independent; applying it to a new model requires only adjusting few hyper-parameters of the agent and defining the observations to match. The full knowledge of the model itself is not required. Vito was tested in a synthetic scenario, showing that it could learn how to optimize cost functions generically. Then Vito was applied to the inverse problem of cardiac electrophysiology and the personalization of a whole-body circulation model. The obtained results suggested that Vito could achieve equivalent, if not better goodness of fit than standard methods, while being more robust (up to 11% higher success rates) and with faster (up to seven times) convergence rate. Our artificial intelligence approach could thus make personalization algorithms generalizable and self-adaptable to any patient and any model. Copyright © 2016. Published by Elsevier B.V.

Application of evolutionary computation in ECAD problems

NASA Astrophysics Data System (ADS)

Lee, Dae-Hyun; Hwang, Seung H.

1998-10-01

Design of modern electronic system is a complicated task which demands the use of computer- aided design (CAD) tools. Since a lot of problems in ECAD are combinatorial optimization problems, evolutionary computations such as genetic algorithms and evolutionary programming have been widely employed to solve those problems. We have applied evolutionary computation techniques to solve ECAD problems such as technology mapping, microcode-bit optimization, data path ordering and peak power estimation, where their benefits are well observed. This paper presents experiences and discusses issues in those applications.

One-Dimensional Czedli-Type Islands

ERIC Educational Resources Information Center

Horvath, Eszter K.; Mader, Attila; Tepavcevic, Andreja

2011-01-01

The notion of an island has surfaced in recent algebra and coding theory research. Discrete versions provide interesting combinatorial problems. This paper presents the one-dimensional case with finitely many heights, a topic convenient for student research.

Distributed adaptive neural network control for a class of heterogeneous nonlinear multi-agent systems subject to actuation failures

NASA Astrophysics Data System (ADS)

Cui, Bing; Zhao, Chunhui; Ma, Tiedong; Feng, Chi

2017-02-01

In this paper, the cooperative adaptive consensus tracking problem for heterogeneous nonlinear multi-agent systems on directed graph is addressed. Each follower is modelled as a general nonlinear system with the unknown and nonidentical nonlinear dynamics, disturbances and actuator failures. Cooperative fault tolerant neural network tracking controllers with online adaptive learning features are proposed to guarantee that all agents synchronise to the trajectory of one leader with bounded adjustable synchronisation errors. With the help of linear quadratic regulator-based optimal design, a graph-dependent Lyapunov proof provides error bounds that depend on the graph topology, one virtual matrix and some design parameters. Of particular interest is that if the control gain is selected appropriately, the proposed control scheme can be implemented in a unified framework no matter whether there are faults or not. Furthermore, the fault detection and isolation are not needed to implement. Finally, a simulation is given to verify the effectiveness of the proposed method.

Synergistic antimicrobial profiling of violacein with commercial antibiotics against pathogenic micro-organisms.

PubMed

Subramaniam, Shankar; Ravi, Venkatraman; Sivasubramanian, Aravind

2014-01-01

Chromobacterium violaceum Bergonzini (Neisseriaceae), a Gram-negative bacterium, secretes a spectacular pigment called violacein. Violacein is a quorum-sensing metabolite and is also an active antimicrobial, anticancer agent. However, its efficiency as a potential drug, alone or in synergy with other active principles, has not being completely exploited. With the advent of different multi-drug resistant strains, it becomes essential to find a new natural product(s) that could be effectively used as a therapeutic agent. This work focused on the extraction of violacein from an isolated strain of C. violaceum and determined the combinatory effect of violacein with commercial antibiotics against various pathogens. Violacein production was optimized and was later extracted using ethanol and characterized by liquid chromatography-mass spectrometry and infrared spectroscopy. Then, individual minimum inhibitory concentration (MIC) values for each of the antibiotics were determined followed by violacein-commercial antibiotics (1:1) combinations, tested at different concentrations starting from 500 to 1 µg/ml against major pathogens. The individual MIC data for violacein was found to be 5.7 µg/ml (Staphylococcus aureus), 15.6 µg/ml (Klebsiella pneumoniae), 18.5 µg/ml (Pseudomonas aeruginosa), 20.0 µg/ml (Vibrio cholerae) and 5.7 µg/ml (Salmonella typhi). Violacein-gentamicin and violacein-cefadroxil combinations had MIC of 1.0 µg/ml against S. aureus. Most violacein-macrolide and violacein--aminoglycoside class combinations revealed fractional inhibitory concentration indices (FICI) of <0.5, thus exhibiting synergism. Furthermore, violacein-azithromycin and violacein-kanamycin combination, exhibited significant synergy (FICI-0.3) against S. typhi. Violacein works synergistically with most commercial antibiotics and could be used as drug in combination with other antimicrobial agents.

Multi-agent Reinforcement Learning Model for Effective Action Selection

NASA Astrophysics Data System (ADS)

Youk, Sang Jo; Lee, Bong Keun

Reinforcement learning is a sub area of machine learning concerned with how an agent ought to take actions in an environment so as to maximize some notion of long-term reward. In the case of multi-agent, especially, which state space and action space gets very enormous in compared to single agent, so it needs to take most effective measure available select the action strategy for effective reinforcement learning. This paper proposes a multi-agent reinforcement learning model based on fuzzy inference system in order to improve learning collect speed and select an effective action in multi-agent. This paper verifies an effective action select strategy through evaluation tests based on Robocop Keep away which is one of useful test-beds for multi-agent. Our proposed model can apply to evaluate efficiency of the various intelligent multi-agents and also can apply to strategy and tactics of robot soccer system.

On the Computational Complexity of Stochastic Scheduling Problems,

DTIC Science & Technology

1981-09-01

Survey": 1979, Ann. Discrete Math . 5, pp. 287-326. i I (.4) Karp, R.M., "Reducibility Among Combinatorial Problems": 1972, R.E. Miller and J.W...Weighted Completion Time Subject to Precedence Constraints": 1978, Ann. Discrete Math . 2, pp. 75-90. (8) Lawler, E.L. and J.W. Moore, "A Functional

Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

One-dimensional Euclidean matching problem: exact solutions, correlation functions, and universality.

PubMed

Caracciolo, Sergio; Sicuro, Gabriele

2014-10-01

We discuss the equivalence relation between the Euclidean bipartite matching problem on the line and on the circumference and the Brownian bridge process on the same domains. The equivalence allows us to compute the correlation function and the optimal cost of the original combinatorial problem in the thermodynamic limit; moreover, we solve also the minimax problem on the line and on the circumference. The properties of the average cost and correlation functions are discussed.

Non-fragile consensus algorithms for a network of diffusion PDEs with boundary local interaction

NASA Astrophysics Data System (ADS)

Xiong, Jun; Li, Junmin

2017-07-01

In this study, non-fragile consensus algorithm is proposed to solve the average consensus problem of a network of diffusion PDEs, modelled by boundary controlled heat equations. The problem deals with the case where the Neumann-type boundary controllers are corrupted by additive persistent disturbances. To achieve consensus between agents, a linear local interaction rule addressing this requirement is given. The proposed local interaction rules are analysed by applying a Lyapunov-based approach. The multiplicative and additive non-fragile feedback control algorithms are designed and sufficient conditions for the consensus of the multi-agent systems are presented in terms of linear matrix inequalities, respectively. Simulation results are presented to support the effectiveness of the proposed algorithms.

A Distributed Ambient Intelligence Based Multi-Agent System for Alzheimer Health Care

NASA Astrophysics Data System (ADS)

Tapia, Dante I.; RodríGuez, Sara; Corchado, Juan M.

This chapter presents ALZ-MAS (Alzheimer multi-agent system), an ambient intelligence (AmI)-based multi-agent system aimed at enhancing the assistance and health care for Alzheimer patients. The system makes use of several context-aware technologies that allow it to automatically obtain information from users and the environment in an evenly distributed way, focusing on the characteristics of ubiquity, awareness, intelligence, mobility, etc., all of which are concepts defined by AmI. ALZ-MAS makes use of a services oriented multi-agent architecture, called flexible user and services oriented multi-agent architecture, to distribute resources and enhance its performance. It is demonstrated that a SOA approach is adequate to build distributed and highly dynamic AmI-based multi-agent systems.

Automated monitoring of medical protocols: a secure and distributed architecture.

PubMed

Alsinet, T; Ansótegui, C; Béjar, R; Fernández, C; Manyà, F

2003-03-01

The control of the right application of medical protocols is a key issue in hospital environments. For the automated monitoring of medical protocols, we need a domain-independent language for their representation and a fully, or semi, autonomous system that understands the protocols and supervises their application. In this paper we describe a specification language and a multi-agent system architecture for monitoring medical protocols. We model medical services in hospital environments as specialized domain agents and interpret a medical protocol as a negotiation process between agents. A medical service can be involved in multiple medical protocols, and so specialized domain agents are independent of negotiation processes and autonomous system agents perform monitoring tasks. We present the detailed architecture of the system agents and of an important domain agent, the database broker agent, that is responsible of obtaining relevant information about the clinical history of patients. We also describe how we tackle the problems of privacy, integrity and authentication during the process of exchanging information between agents.

Combinatorial Effects of Arginine and Fluoride on Oral Bacteria

PubMed Central

Zheng, X.; Cheng, X.; Wang, L.; Qiu, W.; Wang, S.; Zhou, Y.; Li, M.; Li, Y.; Cheng, L.; Li, J.; Zhou, X.

2015-01-01

Dental caries is closely associated with the microbial disequilibrium between acidogenic/aciduric pathogens and alkali-generating commensal residents within the dental plaque. Fluoride is a widely used anticaries agent, which promotes tooth hard-tissue remineralization and suppresses bacterial activities. Recent clinical trials have shown that oral hygiene products containing both fluoride and arginine possess a greater anticaries effect compared with those containing fluoride alone, indicating synergy between fluoride and arginine in caries management. Here, we hypothesize that arginine may augment the ecological benefit of fluoride by enriching alkali-generating bacteria in the plaque biofilm and thus synergizes with fluoride in controlling dental caries. Specifically, we assessed the combinatory effects of NaF/arginine on planktonic and biofilm cultures of Streptococcus mutans, Streptococcus sanguinis, and Porphyromonas gingivalis with checkerboard microdilution assays. The optimal NaF/arginine combinations were selected, and their combinatory effects on microbial composition were further examined in single-, dual-, and 3-species biofilm using bacterial species–specific fluorescence in situ hybridization and quantitative polymerase chain reaction. We found that arginine synergized with fluoride in suppressing acidogenic S. mutans in both planktonic and biofilm cultures. In addition, the NaF/arginine combination synergistically reduced S. mutans but enriched S. sanguinis within the multispecies biofilms. More importantly, the optimal combination of NaF/arginine maintained a “streptococcal pressure” against the potential growth of oral anaerobe P. gingivalis within the alkalized biofilm. Taken together, we conclude that the combinatory application of fluoride and arginine has a potential synergistic effect in maintaining a healthy oral microbial equilibrium and thus represents a promising ecological approach to caries management. PMID:25477312

Self-organized adaptation of a simple neural circuit enables complex robot behaviour

NASA Astrophysics Data System (ADS)

Steingrube, Silke; Timme, Marc; Wörgötter, Florentin; Manoonpong, Poramate

2010-03-01

Controlling sensori-motor systems in higher animals or complex robots is a challenging combinatorial problem, because many sensory signals need to be simultaneously coordinated into a broad behavioural spectrum. To rapidly interact with the environment, this control needs to be fast and adaptive. Present robotic solutions operate with limited autonomy and are mostly restricted to few behavioural patterns. Here we introduce chaos control as a new strategy to generate complex behaviour of an autonomous robot. In the presented system, 18 sensors drive 18 motors by means of a simple neural control circuit, thereby generating 11 basic behavioural patterns (for example, orienting, taxis, self-protection and various gaits) and their combinations. The control signal quickly and reversibly adapts to new situations and also enables learning and synaptic long-term storage of behaviourally useful motor responses. Thus, such neural control provides a powerful yet simple way to self-organize versatile behaviours in autonomous agents with many degrees of freedom.

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bernal, Andrés; Patiny, Luc; Castillo, Andrés M.

2015-02-21

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound method are presented: 1. reduction of the size of the solution space by resort to a condensed structure formula, wherein symmetric nuclei are grouped together; 2. partitioning of the solution space based on symmetry, that becomes the basis for an efficient branching procedure; and 3. a criterion of selection of input restrictions that leads to increased gaps between branches and thus faster pruningmore » of non-viable solutions. Although the examples chosen to illustrate this work focus on small-molecule NMR assignment, the results are generic and might help solving other combinatorial optimization problems.« less

Pancreatic cancer combination therapy using a BH3 mimetic and a synthetic tetracycline

PubMed Central

Quinn, Bridget A.; Dash, Rupesh; Sarkar, Siddik; Azab, Belal; Bhoopathi, Praveen; Das, Swadesh K.; Emdad, Luni; Wei, Jun; Pellecchia, Maurizio; Sarkar, Devanand; Fisher, Paul B.

2015-01-01

Improved treatments for pancreatic cancer remain a clinical imperative. Sabutoclax, a small molecule BH3 mimetic, inhibits the function of anti-apoptotic Bcl-2 proteins. Minocycline, a synthetic tetracycline, displays antitumor activity. Here we offer evidence of the combinatorial antitumor potency of these agents in several preclinical models of pancreatic cancer. Sabutoclax induced growth arrest and apoptosis in pancreatic cancer cells and synergized with Minocycline to yield a robust mitochondria-mediated caspase-dependent cytotoxicity. This combinatorial property relied upon loss of phosphorylated Stat3 insofar as reintroduction of activated Stat3 rescued cells from toxicity. Tumor growth was inhibited potently in both immune-deficient and immune-competent models with evidence of extended survival. Overall, our results showed that that the combination of Sabutoclax and Minocycline was highly cytotoxic to pancreatic cancer cells and safely efficacious in vivo. PMID:26032425

Human Monoclonal Antibodies Against a Plethora of Viral Pathogens From Single Combinatorial Libraries

NASA Astrophysics Data System (ADS)

Williamson, R. Anthony; Burioni, Roberto; Sanna, Pietro P.; Partridge, Lynda J.; Barbas, Carlos F., III; Burton, Dennis R.

1993-05-01

Conventional antibody generation usually requires active immunization with antigen immediately prior to the preparation procedure. Combinatorial antibody library technology offers the possibility of cloning a range of antibody specificities at a single point in time and then accessing these specificities at will. Here we show that human monoclonal antibody Fab fragments against a plethora of infectious agents can be readily derived from a single library. Further examination of a number of libraries shows that whenever antibody against a pathogen can be detected in the serum of the donor, then specific antibodies can be derived from the corresponding library. We describe the generation of human Fab fragments against herpes simplex virus types 1 and 2, human cytomegalovirus, varicella zoster virus, rubella, human immunodeficiency virus type 1, and respiratory syncytial virus. The antibodies are shown to be highly specific and a number are effective in neutralizing virus in vitro.

Discovery of potent inhibitors of soluble epoxide hydrolase by combinatorial library design and structure-based virtual screening.

PubMed

Xing, Li; McDonald, Joseph J; Kolodziej, Steve A; Kurumbail, Ravi G; Williams, Jennifer M; Warren, Chad J; O'Neal, Janet M; Skepner, Jill E; Roberds, Steven L

2011-03-10

Structure-based virtual screening was applied to design combinatorial libraries to discover novel and potent soluble epoxide hydrolase (sEH) inhibitors. X-ray crystal structures revealed unique interactions for a benzoxazole template in addition to the conserved hydrogen bonds with the catalytic machinery of sEH. By exploitation of the favorable binding elements, two iterations of library design based on amide coupling were employed, guided principally by the docking results of the enumerated virtual products. Biological screening of the libraries demonstrated as high as 90% hit rate, of which over two dozen compounds were single digit nanomolar sEH inhibitors by IC(50) determination. In total the library design and synthesis produced more than 300 submicromolar sEH inhibitors. In cellular systems consistent activities were demonstrated with biochemical measurements. The SAR understanding of the benzoxazole template provides valuable insights into discovery of novel sEH inhibitors as therapeutic agents.

Elements of decisional dynamics: An agent-based approach applied to artificial financial market

NASA Astrophysics Data System (ADS)

Lucas, Iris; Cotsaftis, Michel; Bertelle, Cyrille

2018-02-01

This paper introduces an original mathematical description for describing agents' decision-making process in the case of problems affected by both individual and collective behaviors in systems characterized by nonlinear, path dependent, and self-organizing interactions. An application to artificial financial markets is proposed by designing a multi-agent system based on the proposed formalization. In this application, agents' decision-making process is based on fuzzy logic rules and the price dynamics is purely deterministic according to the basic matching rules of a central order book. Finally, while putting most parameters under evolutionary control, the computational agent-based system is able to replicate several stylized facts of financial time series (distributions of stock returns showing a heavy tail with positive excess kurtosis, absence of autocorrelations in stock returns, and volatility clustering phenomenon).

Elements of decisional dynamics: An agent-based approach applied to artificial financial market.

PubMed

Lucas, Iris; Cotsaftis, Michel; Bertelle, Cyrille

2018-02-01

This paper introduces an original mathematical description for describing agents' decision-making process in the case of problems affected by both individual and collective behaviors in systems characterized by nonlinear, path dependent, and self-organizing interactions. An application to artificial financial markets is proposed by designing a multi-agent system based on the proposed formalization. In this application, agents' decision-making process is based on fuzzy logic rules and the price dynamics is purely deterministic according to the basic matching rules of a central order book. Finally, while putting most parameters under evolutionary control, the computational agent-based system is able to replicate several stylized facts of financial time series (distributions of stock returns showing a heavy tail with positive excess kurtosis, absence of autocorrelations in stock returns, and volatility clustering phenomenon).

A Mechanism to Avoid Collusion Attacks Based on Code Passing in Mobile Agent Systems

NASA Astrophysics Data System (ADS)

Jaimez, Marc; Esparza, Oscar; Muñoz, Jose L.; Alins-Delgado, Juan J.; Mata-Díaz, Jorge

Mobile agents are software entities consisting of code, data, state and itinerary that can migrate autonomously from host to host executing their code. Despite its benefits, security issues strongly restrict the use of code mobility. The protection of mobile agents against the attacks of malicious hosts is considered the most difficult security problem to solve in mobile agent systems. In particular, collusion attacks have been barely studied in the literature. This paper presents a mechanism that avoids collusion attacks based on code passing. Our proposal is based on a Multi-Code agent, which contains a different variant of the code for each host. A Trusted Third Party is responsible for providing the information to extract its own variant to the hosts, and for taking trusted timestamps that will be used to verify time coherence.

Molecular Pathogenesis of Rickettsioses and Development of Novel Anti-Rickettsial Treatment by Combinatorial Peptide-Based Libraries

DTIC Science & Technology

2007-02-01

Rickettsiae are susceptible to few antibiotics including the tetracyclines and chloramphenicol and are highly resistant to beta - lactams and...agents available for rickettsiae and Orientia, emergence of chloramphenicol- and tetracycline -resistant strains of Orientia, and the possibility of...precipitation (RNAqueous-4 PCR, Ambion). RNA quality was verified by UV spectrophotometry and ribosomal RNA band integrity. The TrueLabeling-AMP™ 2.0 kit

On-bead combinatorial synthesis and imaging of europium(III)-based paraCEST agents aids in identification of chemical features that enhance CEST sensitivity.

PubMed

Singh, Jaspal; Rustagi, Vineeta; Zhang, Shanrong; Sherry, A Dean; Udugamasooriya, D Gomika

2017-08-01

The rate of water exchange between the inner sphere of a paramagnetic ion and bulk water is an important parameter in determining the magnitude of the chemical exchange saturation transfer signal from paramagnetic CEST agents (paraCEST). This is governed by various geometric, steric and ligand field factors created by macrocyclic ligands surrounding the paramagnetic metal ion. Our previous on-bead combinatorial studies of di-peptoid-europium(III)-1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetic acid (DOTA)-tetraamide complexes revealed that negatively charged groups in the immediate vicinity of the metal center strongly enhances the CEST signal. Here, we report a solid phase synthesis and on-bead imaging of 76 new DOTA derivatives that are developed by coupling with a single residue onto each of the three arms of a DOTA-tetraamide scaffold attached to resin beads. This single residue predominantly carries negatively charged groups blended with various physico-chemical characteristics. We found that non-bulky negatively charged groups are best suited at the immediate vicinity of the metal ion, while positive, bulky and halogen containing moieties suppress the CEST signal. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

"Notice of Violation of IEEE Publication Principles" Multiobjective Reinforcement Learning: A Comprehensive Overview.

PubMed

Liu, Chunming; Xu, Xin; Hu, Dewen

2013-04-29

Reinforcement learning is a powerful mechanism for enabling agents to learn in an unknown environment, and most reinforcement learning algorithms aim to maximize some numerical value, which represents only one long-term objective. However, multiple long-term objectives are exhibited in many real-world decision and control problems; therefore, recently, there has been growing interest in solving multiobjective reinforcement learning (MORL) problems with multiple conflicting objectives. The aim of this paper is to present a comprehensive overview of MORL. In this paper, the basic architecture, research topics, and naive solutions of MORL are introduced at first. Then, several representative MORL approaches and some important directions of recent research are reviewed. The relationships between MORL and other related research are also discussed, which include multiobjective optimization, hierarchical reinforcement learning, and multi-agent reinforcement learning. Finally, research challenges and open problems of MORL techniques are highlighted.

Finite-time and fixed-time leader-following consensus for multi-agent systems with discontinuous inherent dynamics

NASA Astrophysics Data System (ADS)

Ning, Boda; Jin, Jiong; Zheng, Jinchuan; Man, Zhihong

2018-06-01

This paper is concerned with finite-time and fixed-time consensus of multi-agent systems in a leader-following framework. Different from conventional leader-following tracking approaches where inherent dynamics satisfying the Lipschitz continuous condition is required, a more generalised case is investigated: discontinuous inherent dynamics. By nonsmooth techniques, a nonlinear protocol is first proposed to achieve the finite-time leader-following consensus. Then, based on fixed-time stability strategies, the fixed-time leader-following consensus problem is solved. An upper bound of settling time is obtained by using a new protocol, and such a bound is independent of initial states, thereby providing additional options for designers in practical scenarios where initial conditions are unavailable. Finally, numerical simulations are provided to demonstrate the effectiveness of the theoretical results.

An alternative approach for neural network evolution with a genetic algorithm: crossover by combinatorial optimization.

PubMed

García-Pedrajas, Nicolás; Ortiz-Boyer, Domingo; Hervás-Martínez, César

2006-05-01

In this work we present a new approach to crossover operator in the genetic evolution of neural networks. The most widely used evolutionary computation paradigm for neural network evolution is evolutionary programming. This paradigm is usually preferred due to the problems caused by the application of crossover to neural network evolution. However, crossover is the most innovative operator within the field of evolutionary computation. One of the most notorious problems with the application of crossover to neural networks is known as the permutation problem. This problem occurs due to the fact that the same network can be represented in a genetic coding by many different codifications. Our approach modifies the standard crossover operator taking into account the special features of the individuals to be mated. We present a new model for mating individuals that considers the structure of the hidden layer and redefines the crossover operator. As each hidden node represents a non-linear projection of the input variables, we approach the crossover as a problem on combinatorial optimization. We can formulate the problem as the extraction of a subset of near-optimal projections to create the hidden layer of the new network. This new approach is compared to a classical crossover in 25 real-world problems with an excellent performance. Moreover, the networks obtained are much smaller than those obtained with classical crossover operator.

A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

NASA Astrophysics Data System (ADS)

Umam, M. I. H.; Santosa, B.

2018-04-01

Combinatorial optimization has been frequently used to solve both problems in science, engineering, and commercial applications. One combinatorial problems in the field of transportation is to find a shortest travel route that can be taken from the initial point of departure to point of destination, as well as minimizing travel costs and travel time. When the distance from one (initial) node to another (destination) node is the same with the distance to travel back from destination to initial, this problems known to the Traveling Salesman Problem (TSP), otherwise it call as an Asymmetric Traveling Salesman Problem (ATSP). The most recent optimization techniques is Symbiotic Organisms Search (SOS). This paper discuss how to hybrid the SOS algorithm with variable neighborhoods search (SOS-VNS) that can be applied to solve the ATSP problem. The proposed mechanism to add the variable neighborhoods search as a local search is to generate the better initial solution and then we modify the phase of parasites with adapting mechanism of mutation. After modification, the performance of the algorithm SOS-VNS is evaluated with several data sets and then the results is compared with the best known solution and some algorithm such PSO algorithm and SOS original algorithm. The SOS-VNS algorithm shows better results based on convergence, divergence and computing time.

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems.

PubMed

Yu, Xue; Chen, Wei-Neng; Gu, Tianlong; Zhang, Huaxiang; Yuan, Huaqiang; Kwong, Sam; Zhang, Jun

2018-07-01

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.

Phthalocyanine-loaded graphene nanoplatform for imaging-guided combinatorial phototherapy

PubMed Central

Taratula, Olena; Patel, Mehulkumar; Schumann, Canan; Naleway, Michael A; Pang, Addison J; He, Huixin; Taratula, Oleh

2015-01-01

We report a novel cancer-targeted nanomedicine platform for imaging and prospect for future treatment of unresected ovarian cancer tumors by intraoperative multimodal phototherapy. To develop the required theranostic system, novel low-oxygen graphene nanosheets were chemically modified with polypropylenimine dendrimers loaded with phthalocyanine (Pc) as a photosensitizer. Such a molecular design prevents fluorescence quenching of the Pc by graphene nanosheets, providing the possibility of fluorescence imaging. Furthermore, the developed nanoplatform was conjugated with poly(ethylene glycol), to improve biocompatibility, and with luteinizing hormone-releasing hormone (LHRH) peptide, for tumor-targeted delivery. Notably, a low-power near-infrared (NIR) irradiation of single wavelength was used for both heat generation by the graphene nanosheets (photothermal therapy [PTT]) and for reactive oxygen species (ROS)-production by Pc (photodynamic therapy [PDT]). The combinatorial phototherapy resulted in an enhanced destruction of ovarian cancer cells, with a killing efficacy of 90%–95% at low Pc and low-oxygen graphene dosages, presumably conferring cytotoxicity to the synergistic effects of generated ROS and mild hyperthermia. An animal study confirmed that Pc loaded into the nanoplatform can be employed as a NIR fluorescence agent for imaging-guided drug delivery. Hence, the newly developed Pc-graphene nanoplatform has the significant potential as an effective NIR theranostic probe for imaging and combinatorial phototherapy. PMID:25848255

A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling.

PubMed

Hajri, S; Liouane, N; Hammadi, S; Borne, P

2000-01-01

Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.

Combinatorial solutions to integrable hierarchies

NASA Astrophysics Data System (ADS)

Kazarian, M. E.; Lando, S. K.

2015-06-01

This paper reviews modern approaches to the construction of formal solutions to integrable hierarchies of mathematical physics whose coefficients are answers to various enumerative problems. The relationship between these approaches and the combinatorics of symmetric groups and their representations is explained. Applications of the results to the construction of efficient computations in problems related to models of quantum field theories are described. Bibliography: 34 titles.

A Comparison of Heuristic and Human Performance on Open Versions of the Traveling Salesperson Problem

ERIC Educational Resources Information Center

MacGregor, James N.; Chronicle, Edward P.; Ormerod, Thomas C.

2006-01-01

We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points from one side of the array to the other. Like the standard TSP, the task is computationally…

A Quantitative and Combinatorial Approach to Non-Linear Meanings of Multiplication

ERIC Educational Resources Information Center

Tillema, Erik; Gatza, Andrew

2016-01-01

We provide a conceptual analysis of how combinatorics problems have the potential to support students to establish non-linear meanings of multiplication (NLMM). The problems we analyze we have used in a series of studies with 6th, 8th, and 10th grade students. We situate the analysis in prior work on students' quantitative and multiplicative…

Navigation Solution for a Multiple Satellite and Multiple Ground Architecture

DTIC Science & Technology

2014-09-14

Primer Vector Theory . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.2.6 The Traveling Salesman Problem . . . . . . . . . . . . . . . . . . 12...the Traveling Salesman problem [42]. It is framed as a nonlinear programming, complete combinatorial optimization where the orbital debris pieces relate...impulsive maneuvers and applies his findings to a Hohmann transfer with the addition of mid-course burns and wait times. 2.2.6 The Traveling Salesman

OPTIMIZING THROUGH CO-EVOLUTIONARY AVALANCHES

DOE Office of Scientific and Technical Information (OSTI.GOV)

S. BOETTCHER; A. PERCUS

2000-08-01

We explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problems. The method, called extremal optimization, is inspired by ''self-organized critically,'' a concept introduced to describe emergent complexity in many physical systems. In contrast to Genetic Algorithms which operate on an entire ''gene-pool'' of possible solutions, extremal optimization successively replaces extremely undesirable elements of a sub-optimal solution with new, random ones. Large fluctuations, called ''avalanches,'' ensue that efficiently explore many local optima. Drawing upon models used to simulate far-from-equilibrium dynamics, extremal optimization complements approximation methods inspired by equilibrium statistical physics, such as simulated annealing. With only onemore » adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions. Those phase transitions are found in the parameter space of most optimization problems, and have recently been conjectured to be the origin of some of the hardest instances in computational complexity. We will demonstrate how extremal optimization can be implemented for a variety of combinatorial optimization problems. We believe that extremal optimization will be a useful tool in the investigation of phase transitions in combinatorial optimization problems, hence valuable in elucidating the origin of computational complexity.« less

Combinatorial Algorithms for Portfolio Optimization Problems - Case of Risk Moderate Investor

NASA Astrophysics Data System (ADS)

Juarna, A.

2017-03-01

Portfolio optimization problem is a problem of finding optimal combination of n stocks from N ≥ n available stocks that gives maximal aggregate return and minimal aggregate risk. In this paper given N = 43 from the IDX (Indonesia Stock Exchange) group of the 45 most-traded stocks, known as the LQ45, with p = 24 data of monthly returns for each stock, spanned over interval 2013-2014. This problem actually is a combinatorial one where its algorithm is constructed based on two considerations: risk moderate type of investor and maximum allowed correlation coefficient between every two eligible stocks. The main outputs resulted from implementation of the algorithms is a multiple curve of three portfolio’s attributes, e.g. the size, the ratio of return to risk, and the percentage of negative correlation coefficient for every two chosen stocks, as function of maximum allowed correlation coefficient between each two stocks. The output curve shows that the portfolio contains three stocks with ratio of return to risk at 14.57 if the maximum allowed correlation coefficient between every two eligible stocks is negative and contains 19 stocks with maximum allowed correlation coefficient 0.17 to get maximum ratio of return to risk at 25.48.

Synthesizing optimal waste blends

DOE Office of Scientific and Technical Information (OSTI.GOV)

Narayan, V.; Diwekar, W.M.; Hoza, M.

Vitrification of tank wastes to form glass is a technique that will be used for the disposal of high-level waste at Hanford. Process and storage economics show that minimizing the total number of glass logs produced is the key to keeping cost as low as possible. The amount of glass produced can be reduced by blending of the wastes. The optimal way to combine the tanks to minimize the vole of glass can be determined from a discrete blend calculation. However, this problem results in a combinatorial explosion as the number of tanks increases. Moreover, the property constraints make thismore » problem highly nonconvex where many algorithms get trapped in local minima. In this paper the authors examine the use of different combinatorial optimization approaches to solve this problem. A two-stage approach using a combination of simulated annealing and nonlinear programming (NLP) is developed. The results of different methods such as the heuristics approach based on human knowledge and judgment, the mixed integer nonlinear programming (MINLP) approach with GAMS, and branch and bound with lower bound derived from the structure of the given blending problem are compared with this coupled simulated annealing and NLP approach.« less

Solving “Smart City” Transport Problems by Designing Carpooling Gamification Schemes with Multi-Agent Systems: The Case of the So-Called “Mordor of Warsaw”

PubMed Central

Turek, Agnieszka

2018-01-01

To reduce energy consumption and improve residents’ quality of life, “smart cities” should use not only modern technologies, but also the social innovations of the “Internet of Things” (IoT) era. This article attempts to solve transport problems in a smart city’s office district by utilizing gamification that incentivizes the carpooling system. The goal of the devised system is to significantly reduce the number of cars, and, consequently, to alleviate traffic jams, as well as to curb pollution and energy consumption. A representative sample of the statistical population of people working in one of the biggest office hubs in Poland (the so-called “Mordor of Warsaw”) was surveyed. The collected data were processed using spatial data mining methods, and the results were a set of parameters for the multi-agent system. This approach made it possible to run a series of simulations on a set of 100,000 agents and to select an effective gamification methodology that supports the carpooling process. The implementation of the proposed solutions (a “serious game” variation of urban games) would help to reduce the number of cars by several dozen percent, significantly reduce energy consumption, eliminate traffic jams, and increase the activity of the smart city residents. PMID:29316643

Combinatorial evaluation of in vivo distribution of polyanhydride particle-based platforms for vaccine delivery

PubMed Central

Petersen, Latrisha K; Huntimer, Lucas; Walz, Katharine; Ramer-Tait, Amanda; Wannemuehler, Michael J; Narasimhan, Balaji

2013-01-01

Several challenges are associated with current vaccine strategies, including repeated immunizations, poor patient compliance, and limited approved routes for delivery, which may hinder induction of protective immunity. Thus, there is a need for new vaccine adjuvants capable of multi-route administration and prolonged antigen release at the site of administration by providing a depot within tissue. In this work, we designed a combinatorial platform to investigate the in vivo distribution, depot effect, and localized persistence of polyanhydride nanoparticles as a function of nanoparticle chemistry and administration route. Our observations indicated that the route of administration differentially affected tissue residence times. All nanoparticles rapidly dispersed when delivered intranasally but provided a depot when administered parenterally. When amphiphilic and hydrophobic nanoparticles were administered intranasally, they persisted within lung tissue. These results provide insights into the chemistry- and route-dependent distribution and tissue-specific association of polyanhydride nanoparticle-based vaccine adjuvants. PMID:23818778

Combinatorial evaluation of in vivo distribution of polyanhydride particle-based platforms for vaccine delivery.

PubMed

Petersen, Latrisha K; Huntimer, Lucas; Walz, Katharine; Ramer-Tait, Amanda; Wannemuehler, Michael J; Narasimhan, Balaji

2013-01-01

Several challenges are associated with current vaccine strategies, including repeated immunizations, poor patient compliance, and limited approved routes for delivery, which may hinder induction of protective immunity. Thus, there is a need for new vaccine adjuvants capable of multi-route administration and prolonged antigen release at the site of administration by providing a depot within tissue. In this work, we designed a combinatorial platform to investigate the in vivo distribution, depot effect, and localized persistence of polyanhydride nanoparticles as a function of nanoparticle chemistry and administration route. Our observations indicated that the route of administration differentially affected tissue residence times. All nanoparticles rapidly dispersed when delivered intranasally but provided a depot when administered parenterally. When amphiphilic and hydrophobic nanoparticles were administered intranasally, they persisted within lung tissue. These results provide insights into the chemistry- and route-dependent distribution and tissue-specific association of polyanhydride nanoparticle-based vaccine adjuvants.

Fate of sessile droplet chemical agents in environmental substrates in the presence of physiochemical processes

NASA Astrophysics Data System (ADS)

Navaz, H. K.; Dang, A. L.; Atkinson, T.; Zand, A.; Nowakowski, A.; Kamensky, K.

2014-05-01

A general-purpose multi-phase and multi-component computer model capable of solving the complex problems encountered in the agent substrate interaction is developed. The model solves the transient and time-accurate mass and momentum governing equations in a three dimensional space. The provisions for considering all the inter-phase activities (solidification, evaporation, condensation, etc.) are included in the model. The chemical reactions among all phases are allowed and the products of the existing chemical reactions in all three phases are possible. The impact of chemical reaction products on the transport properties in porous media such as porosity, capillary pressure, and permeability is considered. Numerous validations for simulants, agents, and pesticides with laboratory and open air data are presented. Results for chemical reactions in the presence of pre-existing water in porous materials such as moisture, or separated agent and water droplets on porous substrates are presented. The model will greatly enhance the capabilities in predicting the level of threat after any chemical such as Toxic Industrial Chemicals (TICs) and Toxic Industrial Materials (TIMs) release on environmental substrates. The model's generality makes it suitable for both defense and pharmaceutical applications.

Optimal Reward Functions in Distributed Reinforcement Learning

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Tumer, Kagan

2000-01-01

We consider the design of multi-agent systems so as to optimize an overall world utility function when (1) those systems lack centralized communication and control, and (2) each agents runs a distinct Reinforcement Learning (RL) algorithm. A crucial issue in such design problems is to initialize/update each agent's private utility function, so as to induce best possible world utility. Traditional 'team game' solutions to this problem sidestep this issue and simply assign to each agent the world utility as its private utility function. In previous work we used the 'Collective Intelligence' framework to derive a better choice of private utility functions, one that results in world utility performance up to orders of magnitude superior to that ensuing from use of the team game utility. In this paper we extend these results. We derive the general class of private utility functions that both are easy for the individual agents to learn and that, if learned well, result in high world utility. We demonstrate experimentally that using these new utility functions can result in significantly improved performance over that of our previously proposed utility, over and above that previous utility's superiority to the conventional team game utility.

Solving Connected Subgraph Problems in Wildlife Conservation

NASA Astrophysics Data System (ADS)

Dilkina, Bistra; Gomes, Carla P.

We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associated with the nodes, the goal is to find a connected subgraph that contains a subset of distinguished vertices. In this work we focus on the budget-constrained version, where we maximize the total profit of the nodes in the subgraph subject to a budget constraint on the total cost. We propose several mixed-integer formulations for enforcing the subgraph connectivity requirement, which plays a key role in the combinatorial structure of the problem. We show that a new formulation based on subtour elimination constraints is more effective at capturing the combinatorial structure of the problem, providing significant advantages over the previously considered encoding which was based on a single commodity flow. We test our formulations on synthetic instances as well as on real-world instances of an important problem in environmental conservation concerning the design of wildlife corridors. Our encoding results in a much tighter LP relaxation, and more importantly, it results in finding better integer feasible solutions as well as much better upper bounds on the objective (often proving optimality or within less than 1% of optimality), both when considering the synthetic instances as well as the real-world wildlife corridor instances.

Scientific discovery as a combinatorial optimisation problem: How best to navigate the landscape of possible experiments?

PubMed Central

Kell, Douglas B

2012-01-01

A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a ‘landscape’ representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems ‘hard’, but as such these are to be seen as combinatorial optimisation problems that are best attacked by heuristic methods known from that field. Such landscapes, which may also represent or include multiple objectives, are effectively modelled in silico, with modern active learning algorithms such as those based on Darwinian evolution providing guidance, using existing knowledge, as to what is the ‘best’ experiment to do next. An awareness, and the application, of these methods can thereby enhance the scientific discovery process considerably. This analysis fits comfortably with an emerging epistemology that sees scientific reasoning, the search for solutions, and scientific discovery as Bayesian processes. PMID:22252984

Scientific discovery as a combinatorial optimisation problem: how best to navigate the landscape of possible experiments?

PubMed

Kell, Douglas B

2012-03-01

A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a 'landscape' representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems 'hard', but as such these are to be seen as combinatorial optimisation problems that are best attacked by heuristic methods known from that field. Such landscapes, which may also represent or include multiple objectives, are effectively modelled in silico, with modern active learning algorithms such as those based on Darwinian evolution providing guidance, using existing knowledge, as to what is the 'best' experiment to do next. An awareness, and the application, of these methods can thereby enhance the scientific discovery process considerably. This analysis fits comfortably with an emerging epistemology that sees scientific reasoning, the search for solutions, and scientific discovery as Bayesian processes. Copyright © 2012 WILEY Periodicals, Inc.

A Mission Planning Approach for Precision Farming Systems Based on Multi-Objective Optimization.

PubMed

Zhai, Zhaoyu; Martínez Ortega, José-Fernán; Lucas Martínez, Néstor; Rodríguez-Molina, Jesús

2018-06-02

As the demand for food grows continuously, intelligent agriculture has drawn much attention due to its capability of producing great quantities of food efficiently. The main purpose of intelligent agriculture is to plan agricultural missions properly and use limited resources reasonably with minor human intervention. This paper proposes a Precision Farming System (PFS) as a Multi-Agent System (MAS). Components of PFS are treated as agents with different functionalities. These agents could form several coalitions to complete the complex agricultural missions cooperatively. In PFS, mission planning should consider several criteria, like expected benefit, energy consumption or equipment loss. Hence, mission planning could be treated as a Multi-objective Optimization Problem (MOP). In order to solve MOP, an improved algorithm, MP-PSOGA, is proposed, taking advantages of the Genetic Algorithms and Particle Swarm Optimization. A simulation, called precise pesticide spraying mission, is performed to verify the feasibility of the proposed approach. Simulation results illustrate that the proposed approach works properly. This approach enables the PFS to plan missions and allocate scarce resources efficiently. The theoretical analysis and simulation is a good foundation for the future study. Once the proposed approach is applied to a real scenario, it is expected to bring significant economic improvement.

MiYA, an efficient machine-learning workflow in conjunction with the YeastFab assembly strategy for combinatorial optimization of heterologous metabolic pathways in Saccharomyces cerevisiae.

PubMed

Zhou, Yikang; Li, Gang; Dong, Junkai; Xing, Xin-Hui; Dai, Junbiao; Zhang, Chong

2018-05-01

Facing boosting ability to construct combinatorial metabolic pathways, how to search the metabolic sweet spot has become the rate-limiting step. We here reported an efficient Machine-learning workflow in conjunction with YeastFab Assembly strategy (MiYA) for combinatorial optimizing the large biosynthetic genotypic space of heterologous metabolic pathways in Saccharomyces cerevisiae. Using β-carotene biosynthetic pathway as example, we first demonstrated that MiYA has the power to search only a small fraction (2-5%) of combinatorial space to precisely tune the expression level of each gene with a machine-learning algorithm of an artificial neural network (ANN) ensemble to avoid over-fitting problem when dealing with a small number of training samples. We then applied MiYA to improve the biosynthesis of violacein. Feed with initial data from a colorimetric plate-based, pre-screened pool of 24 strains producing violacein, MiYA successfully predicted, and verified experimentally, the existence of a strain that showed a 2.42-fold titer improvement in violacein production among 3125 possible designs. Furthermore, MiYA was able to largely avoid the branch pathway of violacein biosynthesis that makes deoxyviolacein, and produces very pure violacein. Together, MiYA combines the advantages of standardized building blocks and machine learning to accelerate the Design-Build-Test-Learn (DBTL) cycle for combinatorial optimization of metabolic pathways, which could significantly accelerate the development of microbial cell factories. Copyright © 2018 International Metabolic Engineering Society. Published by Elsevier Inc. All rights reserved.

Exact solution of large asymmetric traveling salesman problems.

PubMed

Miller, D L; Pekny, J F

1991-02-15

The traveling salesman problem is one of a class of difficult problems in combinatorial optimization that is representative of a large number of important scientific and engineering problems. A survey is given of recent applications and methods for solving large problems. In addition, an algorithm for the exact solution of the asymmetric traveling salesman problem is presented along with computational results for several classes of problems. The results show that the algorithm performs remarkably well for some classes of problems, determining an optimal solution even for problems with large numbers of cities, yet for other classes, even small problems thwart determination of a provably optimal solution.

Evaluation of a combinatorial approach to prion inactivation using an oxidizing agent, SDS, and proteinase K.

PubMed

Smith, Jodi D; Nicholson, Eric M; Greenlee, Justin J

2013-07-25

Prions demonstrate an unusual resistance to methods effective at inactivating conventional microorganisms. This has resulted in a very tangible and difficult infection control challenge to the medical and veterinary communities, as well as animal agriculture and related industries. Currently accepted practices of harsh chemical treatments such as prolonged exposure to sodium hydroxide or sodium hypochlorite, or autoclaving are not suitable in many situations. Less caustic and more readily applicable treatments to contaminated environments are therefore desirable. We recently demonstrated that exposure of the RML scrapie agent to a commercial product containing sodium percarbonate (SPC-P) with or without sodium dodecyl sulfate (SDS) rendered PrP(Sc) sensitive to proteinase K (PK), but did not eliminate infectivity. The current study was designed to evaluate the efficacy of a combinatorial approach to inactivating prions by exposing RML-positive brain homogenate to SPC-P and SDS followed by PK. Treated samples were evaluated for PrP(Sc)-immunoreactivity by western blot, and residual infectivity by mouse bioassay. Treatment of infected brain homogenate with SPC-P and SDS followed by PK exposure resulted in a 4-5 log10 reduction in infectivity when bioassayed in tga20 mice. This study demonstrates that exposure of the RML scrapie agent to SPC-P and SDS followed by PK markedly reduces, but does not eliminate infectivity. The results of this study encourage further investigation into whether consecutive or concomitant exposure to sodium percarbonate, SDS, and a protease may serve as a viable and non-caustic option for prion inactivation.

Carbon Nanotubes by CVD and Applications

NASA Technical Reports Server (NTRS)

Cassell, Alan; Delzeit, Lance; Nguyen, Cattien; Stevens, Ramsey; Han, Jie; Meyyappan, M.; Arnold, James O. (Technical Monitor)

2001-01-01

Carbon nanotube (CNT) exhibits extraordinary mechanical and unique electronic properties and offers significant potential for structural, sensor, and nanoelectronics applications. An overview of CNT, growth methods, properties and applications is provided. Single-wall, and multi-wall CNTs have been grown by chemical vapor deposition. Catalyst development and optimization has been accomplished using combinatorial optimization methods. CNT has also been grown from the tips of silicon cantilevers for use in atomic force microscopy.

The Multi-Orientable Random Tensor Model, a Review

NASA Astrophysics Data System (ADS)

Tanasa, Adrian

2016-06-01

After its introduction (initially within a group field theory framework) in [Tanasa A., J. Phys. A: Math. Theor. 45 (2012), 165401, 19 pages, arXiv:1109.0694], the multi-orientable (MO) tensor model grew over the last years into a solid alternative of the celebrated colored (and colored-like) random tensor model. In this paper we review the most important results of the study of this MO model: the implementation of the 1/N expansion and of the large N limit (N being the size of the tensor), the combinatorial analysis of the various terms of this expansion and finally, the recent implementation of a double scaling limit.

A Survey of Collective Intelligence

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Tumer, Kagan

1999-01-01

This chapter presents the science of "COllective INtelligence" (COIN). A COIN is a large multi-agent systems where: i) the agents each run reinforcement learning (RL) algorithms; ii) there is little to no centralized communication or control; iii) there is a provided world utility function that, rates the possible histories of tile full system. Tile conventional approach to designing large distributed systems to optimize a world utility does not use agents running RL algorithms. Rather that approach begins with explicit modeling of the overall system's dynamics, followed by detailed hand-tuning of the interactions between the components to ensure that they "cooperate" as far as the world utility is concerned. This approach is labor-intensive, often results in highly non-robust systems, and usually results in design techniques that, have limited applicability. In contrast, with COINs we wish to solve the system design problems implicitly, via the 'adaptive' character of the RL algorithms of each of the agents. This COIN approach introduces an entirely new, profound design problem: Assuming the RL algorithms are able to achieve high rewards, what reward functions for the individual agents will, when pursued by those agents, result in high world utility? In other words, what reward functions will best ensure that we do not have phenomena like the tragedy of the commons, or Braess's paradox? Although still very young, the science of COINs has already resulted in successes in artificial domains, in particular in packet-routing, the leader-follower problem, and in variants of Arthur's "El Farol bar problem". It is expected that as it matures not only will COIN science expand greatly the range of tasks addressable by human engineers, but it will also provide much insight into already established scientific fields, such as economics, game theory, or population biology.

Learning consensus in adversarial environments

NASA Astrophysics Data System (ADS)

Vamvoudakis, Kyriakos G.; García Carrillo, Luis R.; Hespanha, João. P.

2013-05-01

This work presents a game theory-based consensus problem for leaderless multi-agent systems in the presence of adversarial inputs that are introducing disturbance to the dynamics. Given the presence of enemy components and the possibility of malicious cyber attacks compromising the security of networked teams, a position agreement must be reached by the networked mobile team based on environmental changes. The problem is addressed under a distributed decision making framework that is robust to possible cyber attacks, which has an advantage over centralized decision making in the sense that a decision maker is not required to access information from all the other decision makers. The proposed framework derives three tuning laws for every agent; one associated with the cost, one associated with the controller, and one with the adversarial input.

An Introduction to Simulated Annealing

ERIC Educational Resources Information Center

Albright, Brian

2007-01-01

An attempt to model the physical process of annealing lead to the development of a type of combinatorial optimization algorithm that takes on the problem of getting trapped in a local minimum. The author presents a Microsoft Excel spreadsheet that illustrates how this works.

Chemical Compound Design Using Nuclear Charge Distributions

DTIC Science & Technology

2012-03-01

Finding optimal solutions to design problems in chemistry is hampered by the combinatorially large search space. We develop a general theoretical ... framework for finding chemical compounds with prescribed properties using nuclear charge distributions. The key is the reformulation of the design

Model of interaction in Smart Grid on the basis of multi-agent system

NASA Astrophysics Data System (ADS)

Engel, E. A.; Kovalev, I. V.; Engel, N. E.

2016-11-01

This paper presents model of interaction in Smart Grid on the basis of multi-agent system. The use of travelling waves in the multi-agent system describes the behavior of the Smart Grid from the local point, which is being the complement of the conventional approach. The simulation results show that the absorption of the wave in the distributed multi-agent systems is effectively simulated the interaction in Smart Grid.

Exploiting Multisite Gateway and pENFRUIT plasmid collection for fruit genetic engineering.

PubMed

Estornell, Leandro H; Granell, Antonio; Orzaez, Diego

2012-01-01

MultiSite Gateway cloning techniques based on homologous recombination facilitate the combinatorial assembly of basic genetic pieces (i.e., promoters, CDS, and terminators) into gene expression or gene silencing cassettes. pENFRUIT is a collection of MultiSite Triple Gateway Entry vectors dedicated to genetic engineering in fruits. It comprises a number of fruit-operating promoters as well as C-terminal tags adapted to the Gateway standard. In this way, flanking regulatory/labeling sequences can be easily Gateway-assembled with a given gene of interest for its ectopic expression or silencing in fruits. The resulting gene constructs can be analyzed in stable transgenic plants or in transient expression assays, the latter allowing fast testing of the increasing number of combinations arising from MultiSite methodology. A detailed description of the use of MultiSite cloning methodology for the assembly of pENFRUIT elements is presented.

Design of a Two-level Adaptive Multi-Agent System for Malaria Vectors driven by an ontology

PubMed Central

Koum, Guillaume; Yekel, Augustin; Ndifon, Bengyella; Etang, Josiane; Simard, Frédéric

2007-01-01

Background The understanding of heterogeneities in disease transmission dynamics as far as malaria vectors are concerned is a big challenge. Many studies while tackling this problem don't find exact models to explain the malaria vectors propagation. Methods To solve the problem we define an Adaptive Multi-Agent System (AMAS) which has the property to be elastic and is a two-level system as well. This AMAS is a dynamic system where the two levels are linked by an Ontology which allows it to function as a reduced system and as an extended system. In a primary level, the AMAS comprises organization agents and in a secondary level, it is constituted of analysis agents. Its entry point, a User Interface Agent, can reproduce itself because it is given a minimum of background knowledge and it learns appropriate "behavior" from the user in the presence of ambiguous queries and from other agents of the AMAS in other situations. Results Some of the outputs of our system present a series of tables, diagrams showing some factors like Entomological parameters of malaria transmission, Percentages of malaria transmission per malaria vectors, Entomological inoculation rate. Many others parameters can be produced by the system depending on the inputted data. Conclusion Our approach is an intelligent one which differs from statistical approaches that are sometimes used in the field. This intelligent approach aligns itself with the distributed artificial intelligence. In terms of fight against malaria disease our system offers opportunities of reducing efforts of human resources who are not obliged to cover the entire territory while conducting surveys. Secondly the AMAS can determine the presence or the absence of malaria vectors even when specific data have not been collected in the geographical area. In the difference of a statistical technique, in our case the projection of the results in the field can sometimes appeared to be more general. PMID:17605778

Combinatorial effects of arginine and fluoride on oral bacteria.

PubMed

Zheng, X; Cheng, X; Wang, L; Qiu, W; Wang, S; Zhou, Y; Li, M; Li, Y; Cheng, L; Li, J; Zhou, X; Xu, X

2015-02-01

Dental caries is closely associated with the microbial disequilibrium between acidogenic/aciduric pathogens and alkali-generating commensal residents within the dental plaque. Fluoride is a widely used anticaries agent, which promotes tooth hard-tissue remineralization and suppresses bacterial activities. Recent clinical trials have shown that oral hygiene products containing both fluoride and arginine possess a greater anticaries effect compared with those containing fluoride alone, indicating synergy between fluoride and arginine in caries management. Here, we hypothesize that arginine may augment the ecological benefit of fluoride by enriching alkali-generating bacteria in the plaque biofilm and thus synergizes with fluoride in controlling dental caries. Specifically, we assessed the combinatory effects of NaF/arginine on planktonic and biofilm cultures of Streptococcus mutans, Streptococcus sanguinis, and Porphyromonas gingivalis with checkerboard microdilution assays. The optimal NaF/arginine combinations were selected, and their combinatory effects on microbial composition were further examined in single-, dual-, and 3-species biofilm using bacterial species-specific fluorescence in situ hybridization and quantitative polymerase chain reaction. We found that arginine synergized with fluoride in suppressing acidogenic S. mutans in both planktonic and biofilm cultures. In addition, the NaF/arginine combination synergistically reduced S. mutans but enriched S. sanguinis within the multispecies biofilms. More importantly, the optimal combination of NaF/arginine maintained a "streptococcal pressure" against the potential growth of oral anaerobe P. gingivalis within the alkalized biofilm. Taken together, we conclude that the combinatory application of fluoride and arginine has a potential synergistic effect in maintaining a healthy oral microbial equilibrium and thus represents a promising ecological approach to caries management. © International & American Associations for Dental Research 2014.

Combinatorial therapy of exercise-preconditioning and nanocurcumin formulation supplementation improves cardiac adaptation under hypobaric hypoxia.

PubMed

Nehra, Sarita; Bhardwaj, Varun; Bansal, Anju; Saraswat, Deepika

2017-09-26

Chronic hypobaric hypoxia (cHH) mediated cardiac insufficiencies are associated with pathological damage. Sustained redox stress and work load are major causative agents of cardiac insufficiencies under cHH. Despite the advancements made in pharmacological (anti-oxidants, vasodilators) and non-pharmacological therapeutics (acclimatization strategies and schedules), only partial success has been achieved in improving cardiac acclimatization to cHH. This necessitates the need for potent combinatorial therapies to improve cardiac acclimatization at high altitudes. We hypothesize that a combinatorial therapy comprising preconditioning to mild aerobic treadmill exercise and supplementation with nanocurcumin formulation (NCF) consisting of nanocurcumin (NC) and pyrroloquinoline quinone (PQQ) might improve cardiac adaptation at high altitudes. Adult Sprague-Dawley rats pre-conditioned to treadmill exercise and supplemented with NCF were exposed to cHH (7620 m altitude corresponding to pO2~8% at 28±2°C, relative humidity 55%±1%) for 3 weeks. The rat hearts were analyzed for changes in markers of oxidative stress (free radical leakage, lipid peroxidation, manganese-superoxide dismutase [MnSOD] activity), cardiac injury (circulating cardiac troponin I [TnI] and T [cTnT], myocardial creatine kinase [CK-MB]), metabolic damage (lactate dehydrogenase [LDH] and acetyl-coenzyme A levels, lactate and pyruvate levels) and bio-energetic insufficiency (ATP, p-AMPKα). Significant modulations (p≤0.05) in cardiac redox status, metabolic damage, cardiac injury and bio-energetics were observed in rats receiving both NCF supplementation and treadmill exercise-preconditioning compared with rats receiving only one of the treatments. The combinatorial therapeutic strategy showed a tremendous improvement in cardiac acclimatization to cHH compared to either exercise-preconditioning or NCF supplementation alone which was evident from the effective modulation in redox, metabolic, contractile and bio-energetic homeostasis.

Towards a theory of automated elliptic mesh generation

NASA Technical Reports Server (NTRS)

Cordova, J. Q.

1992-01-01

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

Distributed fault-tolerant time-varying formation control for high-order linear multi-agent systems with actuator failures.

PubMed

Hua, Yongzhao; Dong, Xiwang; Li, Qingdong; Ren, Zhang

2017-11-01

This paper investigates the fault-tolerant time-varying formation control problems for high-order linear multi-agent systems in the presence of actuator failures. Firstly, a fully distributed formation control protocol is presented to compensate for the influences of both bias fault and loss of effectiveness fault. Using the adaptive online updating strategies, no global knowledge about the communication topology is required and the bounds of actuator failures can be unknown. Then an algorithm is proposed to determine the control parameters of the fault-tolerant formation protocol, where the time-varying formation feasible conditions and an approach to expand the feasible formation set are given. Furthermore, the stability of the proposed algorithm is proven based on the Lyapunov-like theory. Finally, two simulation examples are given to demonstrate the effectiveness of the theoretical results. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Learning dominance relations in combinatorial search problems

NASA Technical Reports Server (NTRS)

Yu, Chee-Fen; Wah, Benjamin W.

1988-01-01

Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.

Dynamic Educational e-Content Selection Using Multiple Criteria in Web-Based Personalized Learning Environments.

ERIC Educational Resources Information Center

Manouselis, Nikos; Sampson, Demetrios

This paper focuses on the way a multi-criteria decision making methodology is applied in the case of agent-based selection of offered learning objects. The problem of selection is modeled as a decision making one, with the decision variables being the learner model and the learning objects' educational description. In this way, selection of…

The Effectiveness of Parent-Child Interaction Therapy with Depressive Mothers: The Changing Relationship as the Agent of Individual Change

ERIC Educational Resources Information Center

Timmer, Susan G.; Ho, Lareina K. L.; Urquiza, Anthony J.; Zebell, Nancy M.; Fernandez y Garcia, Erik; Boys, Deanna

2011-01-01

This study uses a multi-method approach to investigate the effectiveness of Parent-Child Interaction Therapy (PCIT) in reducing children's behavior problems when parents report clinical levels of depressive symptoms. Participants were 132 children, 2-7 years of age, and their biological mothers, who either reported low (N = 78) or clinical levels…

Tumor-targeted polymeric nanostructured lipid carriers with precise ratiometric control over dual-drug loading for combination therapy in non-small-cell lung cancer.

PubMed

Liang, Yan; Tian, Baocheng; Zhang, Jing; Li, Keke; Wang, Lele; Han, Jingtian; Wu, Zimei

2017-01-01

Gemcitabine (GEM) and paclitaxel (PTX) are effective combination anticancer agents against non-small-cell lung cancer (NSCLC). At the present time, a main challenge of combination treatment is the precision of control that will maximize the combined effects. Here, we report a novel method to load GEM (hydrophilic) and PTX (hydrophobic) into simplex tumor-targeted nanostructured lipid carriers (NLCs) for accurate control of the ratio of the two drugs. We covalently preconjugated the dual drugs through a hydrolyzable ester linker to form drug conjugates. N -acetyl-d-glucosamine (NAG) is a glucose receptor-targeting ligand. We added NAG to the formation of NAG-NLCs. In general, synthesis of poly(6- O -methacryloyl-d-galactopyranose)-GEM/PTX (PMAGP-GEM/PTX) conjugates was demonstrated, and NAG-NLCs were prepared using emulsification and solvent evaporation. NAG-NLCs displayed sphericity with an average diameter of 120.3±1.3 nm, a low polydispersity index of 0.233±0.04, and accurate ratiometric control over the two drugs. A cytotoxicity assay showed that the NAG-NLCs had better antitumor activity on NSCLC cells than normal cells. There was an optimal ratio of the two drugs, exhibiting the best cytotoxicity and combinatorial effects among all the formulations we tested. In comparison with both the free-drug combinations and separately nanopackaged drug conjugates, PMAGP-GEM/PTX NAG-NLCs (3:1) exhibited superior synergism. Flow cytometry and confocal laser scanning microscopy showed that NAG-NLCs exhibited higher uptake efficiency in A549 cells via glucose receptor-mediated endocytosis. This combinatorial delivery system settles problems with ratiometric coloading of hydrophilic and hydrophobic drugs for tumor-targeted combination therapy to achieve maximal anticancer efficacy in NSCLC.

Formal Reasoning and School Mathematics.

ERIC Educational Resources Information Center

Hendrickson, A. Dean

1986-01-01

Provides examples of if-then and combinatorial reasoning situations that have proved successful with college students and can be used with secondary school students. Proposes that practice with these problem solving processes can eliminate the need to memorize formulas that students may not understand. (ML)

Undergraduate students' initial conceptions of factorials

NASA Astrophysics Data System (ADS)

Lockwood, Elise; Erickson, Sarah

2017-05-01

Counting problems offer rich opportunities for students to engage in mathematical thinking, but they can be difficult for students to solve. In this paper, we present a study that examines student thinking about one concept within counting, factorials, which are a key aspect of many combinatorial ideas. In an effort to better understand students' conceptions of factorials, we conducted interviews with 20 undergraduate students. We present a key distinction between computational versus combinatorial conceptions, and we explore three aspects of data that shed light on students' conceptions (their initial characterizations, their definitions of 0!, and their responses to Likert-response questions). We present implications this may have for mathematics educators both within and separate from combinatorics.

Multi-Agent Information Classification Using Dynamic Acquaintance Lists.

ERIC Educational Resources Information Center

Mukhopadhyay, Snehasis; Peng, Shengquan; Raje, Rajeev; Palakal, Mathew; Mostafa, Javed

2003-01-01

Discussion of automated information services focuses on information classification and collaborative agents, i.e. intelligent computer programs. Highlights include multi-agent systems; distributed artificial intelligence; thesauri; document representation and classification; agent modeling; acquaintances, or remote agents discovered through…

Dendrimer-encapsulated naphthalocyanine as a single agent-based theranostic nanoplatform for near-infrared fluorescence imaging and combinatorial anticancer phototherapy

NASA Astrophysics Data System (ADS)

Taratula, Olena; Schumann, Canan; Duong, Tony; Taylor, Karmin L.; Taratula, Oleh

2015-02-01

Multifunctional theranostic platforms capable of concurrent near-infrared (NIR) fluorescence imaging and phototherapies are strongly desired for cancer diagnosis and treatment. However, the integration of separate imaging and therapeutic components into nanocarriers results in complex theranostic systems with limited translational potential. A single agent-based theranostic nanoplatform, therefore, was developed for concurrent NIR fluorescence imaging and combinatorial phototherapy with dual photodynamic (PDT) and photothermal (PTT) therapeutic mechanisms. The transformation of a substituted silicon naphthalocyanine (SiNc) into a biocompatible nanoplatform (SiNc-NP) was achieved by SiNc encapsulation into the hydrophobic interior of a generation 5 polypropylenimine dendrimer following surface modification with polyethylene glycol. Encapsulation provides aqueous solubility to SiNc and preserves its NIR fluorescence, PDT and PTT properties. Moreover, an impressive photostability in the dendrimer-encapsulated SiNc has been detected. Under NIR irradiation (785 nm, 1.3 W cm-2), SiNc-NP manifested robust heat generation capability (ΔT = 40 °C) and efficiently produced reactive oxygen species essential for PTT and PDT, respectively, without releasing SiNc from the nanopaltform. By varying the laser power density from 0.3 W cm-2 to 1.3 W cm-2 the therapeutic mechanism of SiNc-NP could be switched from PDT to combinatorial PDT-PTT treatment. In vitro and in vivo studies confirmed that phototherapy mediated by SiNc can efficiently destroy chemotherapy resistant ovarian cancer cells. Remarkably, solid tumors treated with a single dose of SiNc-NP combined with NIR irradiation were completely eradicated without cancer recurrence. Finally, the efficiency of SiNc-NP as an NIR imaging agent was confirmed by recording the strong fluorescence signal in the tumor, which was not photobleached during the phototherapeutic procedure.Multifunctional theranostic platforms capable of concurrent near-infrared (NIR) fluorescence imaging and phototherapies are strongly desired for cancer diagnosis and treatment. However, the integration of separate imaging and therapeutic components into nanocarriers results in complex theranostic systems with limited translational potential. A single agent-based theranostic nanoplatform, therefore, was developed for concurrent NIR fluorescence imaging and combinatorial phototherapy with dual photodynamic (PDT) and photothermal (PTT) therapeutic mechanisms. The transformation of a substituted silicon naphthalocyanine (SiNc) into a biocompatible nanoplatform (SiNc-NP) was achieved by SiNc encapsulation into the hydrophobic interior of a generation 5 polypropylenimine dendrimer following surface modification with polyethylene glycol. Encapsulation provides aqueous solubility to SiNc and preserves its NIR fluorescence, PDT and PTT properties. Moreover, an impressive photostability in the dendrimer-encapsulated SiNc has been detected. Under NIR irradiation (785 nm, 1.3 W cm-2), SiNc-NP manifested robust heat generation capability (ΔT = 40 °C) and efficiently produced reactive oxygen species essential for PTT and PDT, respectively, without releasing SiNc from the nanopaltform. By varying the laser power density from 0.3 W cm-2 to 1.3 W cm-2 the therapeutic mechanism of SiNc-NP could be switched from PDT to combinatorial PDT-PTT treatment. In vitro and in vivo studies confirmed that phototherapy mediated by SiNc can efficiently destroy chemotherapy resistant ovarian cancer cells. Remarkably, solid tumors treated with a single dose of SiNc-NP combined with NIR irradiation were completely eradicated without cancer recurrence. Finally, the efficiency of SiNc-NP as an NIR imaging agent was confirmed by recording the strong fluorescence signal in the tumor, which was not photobleached during the phototherapeutic procedure. Electronic supplementary information (ESI) available: Fig. S1-S5: Size distribution of SiNc-NP measured by dynamic light scattering (Fig. S1); absorption spectra of free SiNc 2 in THF before and after irradiation with the 785 nm laser diode for 30 min (Fig. S2); in vitro cytotoxicity of free DOX against A2780/AD human ovarian cancer cells (Fig. S3); the release profiles of SiNc from SiNc-NP under various conditions (Fig. S4); body weight curves of the mice with or without treatment (Fig. S5). See DOI: 10.1039/c4nr06050d

Immunological Effects of Conventional Chemotherapy and Targeted Anticancer Agents.

PubMed

Galluzzi, Lorenzo; Buqué, Aitziber; Kepp, Oliver; Zitvogel, Laurence; Kroemer, Guido

2015-12-14

The tremendous clinical success of checkpoint blockers illustrates the potential of reestablishing latent immunosurveillance for cancer therapy. Although largely neglected in the clinical practice, accumulating evidence indicates that the efficacy of conventional and targeted anticancer agents does not only involve direct cytostatic/cytotoxic effects, but also relies on the (re)activation of tumor-targeting immune responses. Chemotherapy can promote such responses by increasing the immunogenicity of malignant cells, or by inhibiting immunosuppressive circuitries that are established by developing neoplasms. These immunological "side" effects of chemotherapy are desirable, and their in-depth comprehension will facilitate the design of novel combinatorial regimens with improved clinical efficacy. Copyright © 2015 Elsevier Inc. All rights reserved.

Optimization of Land Use Suitability for Agriculture Using Integrated Geospatial Model and Genetic Algorithms

NASA Astrophysics Data System (ADS)

Mansor, S. B.; Pormanafi, S.; Mahmud, A. R. B.; Pirasteh, S.

2012-08-01

In this study, a geospatial model for land use allocation was developed from the view of simulating the biological autonomous adaptability to environment and the infrastructural preference. The model was developed based on multi-agent genetic algorithm. The model was customized to accommodate the constraint set for the study area, namely the resource saving and environmental-friendly. The model was then applied to solve the practical multi-objective spatial optimization allocation problems of land use in the core region of Menderjan Basin in Iran. The first task was to study the dominant crops and economic suitability evaluation of land. Second task was to determine the fitness function for the genetic algorithms. The third objective was to optimize the land use map using economical benefits. The results has indicated that the proposed model has much better performance for solving complex multi-objective spatial optimization allocation problems and it is a promising method for generating land use alternatives for further consideration in spatial decision-making.

Combinatorial Markov Random Fields and Their Applications to Information Organization

DTIC Science & Technology

2008-02-01

titles, part-of- speech tags; • Image processing: images, colors, texture, blobs, interest points, caption words; • Video processing: video signal, audio...McGurk and MacDonald published their pioneering work [80] that revealed the multi-modal nature of speech perception: sound and moving lips compose one... Speech (POS) n-grams (that correspond to the syntactic structure of text). POS n-grams are extracted from sentences in an incremental manner: the first n

On the Integration of Logic Programming and Functional Programming.

DTIC Science & Technology

1985-06-01

be performed with simple handtools and devices. However, if the problem is more complex, say involving the cylinders, camshaft , or drive train, then...f(x,x) with f(y, g(y)), and would bind x to g(x) (Ref. 7]. The problem, of course, is that the attempt to prune the search tree allows circularity...combinatorial-explosion, since the search trees generated can grow very unpredictably (Re£. 19: p. 2293. Somewhat akin to the halting problem, it means that a

Chess games: a model for RNA based computation.

PubMed

Cukras, A R; Faulhammer, D; Lipton, R J; Landweber, L F

1999-10-01

Here we develop the theory of RNA computing and a method for solving the 'knight problem' as an instance of a satisfiability (SAT) problem. Using only biological molecules and enzymes as tools, we developed an algorithm for solving the knight problem (3 x 3 chess board) using a 10-bit combinatorial pool and sequential RNase H digestions. The results of preliminary experiments presented here reveal that the protocol recovers far more correct solutions than expected at random, but the persistence of errors still presents the greatest challenge.

Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation

PubMed Central

Wen, Tingxi; Zhang, Zhongnan; Wong, Kelvin K. L.

2016-01-01

Unmanned aerial vehicle (UAV) has been widely used in many industries. In the medical environment, especially in some emergency situations, UAVs play an important role such as the supply of medicines and blood with speed and efficiency. In this paper, we study the problem of multi-objective blood supply by UAVs in such emergency situations. This is a complex problem that includes maintenance of the supply blood’s temperature model during transportation, the UAVs’ scheduling and routes’ planning in case of multiple sites requesting blood, and limited carrying capacity. Most importantly, we need to study the blood’s temperature change due to the external environment, the heating agent (or refrigerant) and time factor during transportation, and propose an optimal method for calculating the mixing proportion of blood and appendage in different circumstances and delivery conditions. Then, by introducing the idea of transportation appendage into the traditional Capacitated Vehicle Routing Problem (CVRP), this new problem is proposed according to the factors of distance and weight. Algorithmically, we use the combination of decomposition-based multi-objective evolutionary algorithm and local search method to perform a series of experiments on the CVRP public dataset. By comparing our technique with the traditional ones, our algorithm can obtain better optimization results and time performance. PMID:27163361

Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation.

PubMed

Wen, Tingxi; Zhang, Zhongnan; Wong, Kelvin K L

2016-01-01

Unmanned aerial vehicle (UAV) has been widely used in many industries. In the medical environment, especially in some emergency situations, UAVs play an important role such as the supply of medicines and blood with speed and efficiency. In this paper, we study the problem of multi-objective blood supply by UAVs in such emergency situations. This is a complex problem that includes maintenance of the supply blood's temperature model during transportation, the UAVs' scheduling and routes' planning in case of multiple sites requesting blood, and limited carrying capacity. Most importantly, we need to study the blood's temperature change due to the external environment, the heating agent (or refrigerant) and time factor during transportation, and propose an optimal method for calculating the mixing proportion of blood and appendage in different circumstances and delivery conditions. Then, by introducing the idea of transportation appendage into the traditional Capacitated Vehicle Routing Problem (CVRP), this new problem is proposed according to the factors of distance and weight. Algorithmically, we use the combination of decomposition-based multi-objective evolutionary algorithm and local search method to perform a series of experiments on the CVRP public dataset. By comparing our technique with the traditional ones, our algorithm can obtain better optimization results and time performance.

Multi-period equilibrium/near-equilibrium in electricity markets based on locational marginal prices

NASA Astrophysics Data System (ADS)

Garcia Bertrand, Raquel

In this dissertation we propose an equilibrium procedure that coordinates the point of view of every market agent resulting in an equilibrium that simultaneously maximizes the independent objective of every market agent and satisfies network constraints. Therefore, the activities of the generating companies, consumers and an independent system operator are modeled: (1) The generating companies seek to maximize profits by specifying hourly step functions of productions and minimum selling prices, and bounds on productions. (2) The goals of the consumers are to maximize their economic utilities by specifying hourly step functions of demands and maximum buying prices, and bounds on demands. (3) The independent system operator then clears the market taking into account consistency conditions as well as capacity and line losses so as to achieve maximum social welfare. Then, we approach this equilibrium problem using complementarity theory in order to have the capability of imposing constraints on dual variables, i.e., on prices, such as minimum profit conditions for the generating units or maximum cost conditions for the consumers. In this way, given the form of the individual optimization problems, the Karush-Kuhn-Tucker conditions for the generating companies, the consumers and the independent system operator are both necessary and sufficient. The simultaneous solution to all these conditions constitutes a mixed linear complementarity problem. We include minimum profit constraints imposed by the units in the market equilibrium model. These constraints are added as additional constraints to the equivalent quadratic programming problem of the mixed linear complementarity problem previously described. For the sake of clarity, the proposed equilibrium or near-equilibrium is first developed for the particular case considering only one time period. Afterwards, we consider an equilibrium or near-equilibrium applied to a multi-period framework. This model embodies binary decisions, i.e., on/off status for the units, and therefore optimality conditions cannot be directly applied. To avoid limitations provoked by binary variables, while retaining the advantages of using optimality conditions, we define the multi-period market equilibrium using Benders decomposition, which allows computing binary variables through the master problem and continuous variables through the subproblem. Finally, we illustrate these market equilibrium concepts through several case studies.

Scare Tactics: Evaluating Problem Decompositions Using Failure Scenarios

NASA Technical Reports Server (NTRS)

Helm, B. Robert; Fickas, Stephen

1992-01-01

Our interest is in the design of multi-agent problem-solving systems, which we refer to as composite systems. We have proposed an approach to composite system design by decomposition of problem statements. An automated assistant called Critter provides a library of reusable design transformations which allow a human analyst to search the space of decompositions for a problem. In this paper we describe a method for evaluating and critiquing problem decompositions generated by this search process. The method uses knowledge stored in the form of failure decompositions attached to design transformations. We suggest the benefits of our critiquing method by showing how it could re-derive steps of a published development example. We then identify several open issues for the method.

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

PubMed

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

Homeostatic Agent for General Environment

NASA Astrophysics Data System (ADS)

Yoshida, Naoto

2018-03-01

One of the essential aspect in biological agents is dynamic stability. This aspect, called homeostasis, is widely discussed in ethology, neuroscience and during the early stages of artificial intelligence. Ashby's homeostats are general-purpose learning machines for stabilizing essential variables of the agent in the face of general environments. However, despite their generality, the original homeostats couldn't be scaled because they searched their parameters randomly. In this paper, first we re-define the objective of homeostats as the maximization of a multi-step survival probability from the view point of sequential decision theory and probabilistic theory. Then we show that this optimization problem can be treated by using reinforcement learning algorithms with special agent architectures and theoretically-derived intrinsic reward functions. Finally we empirically demonstrate that agents with our architecture automatically learn to survive in a given environment, including environments with visual stimuli. Our survival agents can learn to eat food, avoid poison and stabilize essential variables through theoretically-derived single intrinsic reward formulations.

Experimental analysis of chaotic neural network models for combinatorial optimization under a unifying framework.

PubMed

Kwok, T; Smith, K A

2000-09-01

The aim of this paper is to study both the theoretical and experimental properties of chaotic neural network (CNN) models for solving combinatorial optimization problems. Previously we have proposed a unifying framework which encompasses the three main model types, namely, Chen and Aihara's chaotic simulated annealing (CSA) with decaying self-coupling, Wang and Smith's CSA with decaying timestep, and the Hopfield network with chaotic noise. Each of these models can be represented as a special case under the framework for certain conditions. This paper combines the framework with experimental results to provide new insights into the effect of the chaotic neurodynamics of each model. By solving the N-queen problem of various sizes with computer simulations, the CNN models are compared in different parameter spaces, with optimization performance measured in terms of feasibility, efficiency, robustness and scalability. Furthermore, characteristic chaotic neurodynamics crucial to effective optimization are identified, together with a guide to choosing the corresponding model parameters.

Global gene expression analysis by combinatorial optimization.

PubMed

Ameur, Adam; Aurell, Erik; Carlsson, Mats; Westholm, Jakub Orzechowski

2004-01-01

Generally, there is a trade-off between methods of gene expression analysis that are precise but labor-intensive, e.g. RT-PCR, and methods that scale up to global coverage but are not quite as quantitative, e.g. microarrays. In the present paper, we show how how a known method of gene expression profiling (K. Kato, Nucleic Acids Res. 23, 3685-3690 (1995)), which relies on a fairly small number of steps, can be turned into a global gene expression measurement by advanced data post-processing, with potentially little loss of accuracy. Post-processing here entails solving an ancillary combinatorial optimization problem. Validation is performed on in silico experiments generated from the FANTOM data base of full-length mouse cDNA. We present two variants of the method. One uses state-of-the-art commercial software for solving problems of this kind, the other a code developed by us specifically for this purpose, released in the public domain under GPL license.

Multimode resource-constrained multiple project scheduling problem under fuzzy random environment and its application to a large scale hydropower construction project.

PubMed

Xu, Jiuping; Feng, Cuiying

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method.

Multimode Resource-Constrained Multiple Project Scheduling Problem under Fuzzy Random Environment and Its Application to a Large Scale Hydropower Construction Project

PubMed Central

Xu, Jiuping

2014-01-01

This paper presents an extension of the multimode resource-constrained project scheduling problem for a large scale construction project where multiple parallel projects and a fuzzy random environment are considered. By taking into account the most typical goals in project management, a cost/weighted makespan/quality trade-off optimization model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform the fuzzy random parameters into fuzzy variables that are subsequently defuzzified using an expected value operator with an optimistic-pessimistic index. Then a combinatorial-priority-based hybrid particle swarm optimization algorithm is developed to solve the proposed model, where the combinatorial particle swarm optimization and priority-based particle swarm optimization are designed to assign modes to activities and to schedule activities, respectively. Finally, the results and analysis of a practical example at a large scale hydropower construction project are presented to demonstrate the practicality and efficiency of the proposed model and optimization method. PMID:24550708

Modifying mesoporous silica nanoparticles to avoid the metabolic deactivation of 6-mercaptopurine and methotrexate in combinatorial chemotherapy.

PubMed

Wang, Wenjing; Fang, Chenjie; Wang, Xiaozhu; Chen, Yuxi; Wang, Yaonan; Feng, Wei; Yan, Chunhua; Zhao, Ming; Peng, Shiqi

2013-07-21

Mesoporous silica nanoparticles with amino and thiol groups (MSNSN) were prepared and covalently modified with methotrexate and 6-mercaptopurine to form 6-MP-MSNSN-MTX. In the presence of DTT, 6-MP-MSNSN-MTX gradually releases 6-MP. In rat plasma, 6-MP-MSNSN-MTX effectively inhibits the metabolic deactivation of 6-MP and MTX. 6-MP-MSNSN-MTX could be an agent for long-acting chemotherapy.

Olefin Metathesis in Peptidomimetics, Dynamic Combinatorial Chemistry, and Molecular Imprinting

DTIC Science & Technology

2006-08-01

aryl iodide to the Grignard reagent . Treatment of the magnesium compound with allyl bromide and CuCN·2LiCl afforded benzoate 4-11, which was then...cyclization of a linear peptide by conventional coupling agents to form a new amide bond (Scheme 1-12)36,44 Some common reagents are...dicyclohexylcarbodiimide (DCC), diisopropylcarbodiimide (DIC), and expensive reagents such as HATU or PyBroP, which are more efficient.44 Racemization of the chiral

Aspects of job scheduling

NASA Technical Reports Server (NTRS)

Phillips, K.

1976-01-01

A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Communications Complex, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germane to scheduling are presented.

An adaptive critic-based scheme for consensus control of nonlinear multi-agent systems

NASA Astrophysics Data System (ADS)

Heydari, Ali; Balakrishnan, S. N.

2014-12-01

The problem of decentralised consensus control of a network of heterogeneous nonlinear systems is formulated as an optimal tracking problem and a solution is proposed using an approximate dynamic programming based neurocontroller. The neurocontroller training comprises an initial offline training phase and an online re-optimisation phase to account for the fact that the reference signal subject to tracking is not fully known and available ahead of time, i.e., during the offline training phase. As long as the dynamics of the agents are controllable, and the communication graph has a directed spanning tree, this scheme guarantees the synchronisation/consensus even under switching communication topology and directed communication graph. Finally, an aerospace application is selected for the evaluation of the performance of the method. Simulation results demonstrate the potential of the scheme.

Infectious causes of reproductive disorders in cattle.

PubMed

Yoo, Han Sang

2010-01-01

The incidences of reproductive disorders in bovine are increasing over years. This scenario is further aggravating due to more emphasis on selection and rearing of animal for specific commercial purposes which compromises livestock reproduction. Reproductive disorders like infertility and abortions in cattle are major problems in the bovine industry. The reproductive disorders might be caused by several different agents such as physical agents, chemical agents, biological agents, etc. Also, the causative agent and pathogenesis of reproductive disorders are influenced by various factors including environmental factor. The exact causes may not be evident and are often complicated with multiple causative agents. Thus, there is a need for multi-faceted approach to understand correlation of various factors with reproductive performance. Of the agents, infectious biological agents are significant cause of reproductive disorder and are of high priority in the bovine industry. These factors are not only related to the prosperity of bovine industry but are also important from public health point of view because of their zoonotic potentials. Several infectious agents like bacterial, viral, protozoon, chlamydial and fungal agents are known to have direct impact on reproductive health of cattle. These diseases can be arranged and discussed in different groups based on the causative agents.

Concurrent Learning of Control in Multi agent Sequential Decision Tasks

DTIC Science & Technology

2018-04-17

Concurrent Learning of Control in Multi-agent Sequential Decision Tasks The overall objective of this project was to develop multi-agent reinforcement...learning (MARL) approaches for intelligent agents to autonomously learn distributed control policies in decentral- ized partially observable...shall be subject to any oenalty for failing to comply with a collection of information if it does not display a currently valid OMB control number

Resolving combinatorial ambiguities in dilepton t t¯ event topologies with constrained M2 variables

NASA Astrophysics Data System (ADS)

Debnath, Dipsikha; Kim, Doojin; Kim, Jeong Han; Kong, Kyoungchul; Matchev, Konstantin T.

2017-10-01

We advocate the use of on-shell constrained M2 variables in order to mitigate the combinatorial problem in supersymmetry-like events with two invisible particles at the LHC. We show that in comparison to other approaches in the literature, the constrained M2 variables provide superior ansätze for the unmeasured invisible momenta and therefore can be usefully applied to discriminate combinatorial ambiguities. We illustrate our procedure with the example of dilepton t t ¯ events. We critically review the existing methods based on the Cambridge MT 2 variable and MAOS reconstruction of invisible momenta, and show that their algorithm can be simplified without loss of sensitivity, due to a perfect correlation between events with complex solutions for the invisible momenta and events exhibiting a kinematic endpoint violation. Then we demonstrate that the efficiency for selecting the correct partition is further improved by utilizing the M2 variables instead. Finally, we also consider the general case when the underlying mass spectrum is unknown, and no kinematic endpoint information is available.

Guidance and Navigation Software Architecture Design for the Autonomous Multi-Agent Physically Interacting Spacecraft (AMPHIS) Test Bed

DTIC Science & Technology

2006-12-01

NAVIGATION SOFTWARE ARCHITECTURE DESIGN FOR THE AUTONOMOUS MULTI-AGENT PHYSICALLY INTERACTING SPACECRAFT (AMPHIS) TEST BED by Blake D. Eikenberry...Engineer Degree 4. TITLE AND SUBTITLE Guidance and Navigation Software Architecture Design for the Autonomous Multi- Agent Physically Interacting...iii Approved for public release; distribution is unlimited GUIDANCE AND NAVIGATION SOFTWARE ARCHITECTURE DESIGN FOR THE AUTONOMOUS MULTI

A distributed multichannel demand-adaptive P2P VoD system with optimized caching and neighbor-selection

NASA Astrophysics Data System (ADS)

Zhang, Hao; Chen, Minghua; Parekh, Abhay; Ramchandran, Kannan

2011-09-01

We design a distributed multi-channel P2P Video-on-Demand (VoD) system using "plug-and-play" helpers. Helpers are heterogenous "micro-servers" with limited storage, bandwidth and number of users they can serve simultaneously. Our proposed system has the following salient features: (1) it jointly optimizes over helper-user connection topology, video storage distribution and transmission bandwidth allocation; (2) it minimizes server load, and is adaptable to varying supply and demand patterns across multiple video channels irrespective of video popularity; and (3) it is fully distributed and requires little or no maintenance overhead. The combinatorial nature of the problem and the system demand for distributed algorithms makes the problem uniquely challenging. By utilizing Lagrangian decomposition and Markov chain approximation based arguments, we address this challenge by designing two distributed algorithms running in tandem: a primal-dual storage and bandwidth allocation algorithm and a "soft-worst-neighbor-choking" topology-building algorithm. Our scheme provably converges to a near-optimal solution, and is easy to implement in practice. Packet-level simulation results show that the proposed scheme achieves minimum sever load under highly heterogeneous combinations of supply and demand patterns, and is robust to system dynamics of user/helper churn, user/helper asynchrony, and random delays in the network.

Targeting microbial biofilms: current and prospective therapeutic strategies

PubMed Central

Koo, Hyun; Allan, Raymond N; Howlin, Robert P; Hall-Stoodley, Luanne; Stoodley, Paul

2017-01-01

Biofilm formation is a key virulence factor for a wide range of microorganisms that cause chronic infections. The multifactorial nature of biofilm development and drug tolerance imposes great challenges for the use of conventional antimicrobials, and indicates the need for multi-targeted or combinatorial therapies. In this review, we focus on current therapeutic strategies and those that are under development that target vital structural and functional traits of microbial biofilms and drug tolerance mechanisms, including the extracellular matrix and dormant cells. We emphasize strategies that are supported by in vivo or ex vivo studies, highlight emerging biofilm-targeting technologies, and provide a rationale for multi-targeted therapies that are aimed at disrupting the complex biofilm microenvironment. PMID:28944770

A Multi-Agent System Architecture for Sensor Networks

PubMed Central

Fuentes-Fernández, Rubén; Guijarro, María; Pajares, Gonzalo

2009-01-01

The design of the control systems for sensor networks presents important challenges. Besides the traditional problems about how to process the sensor data to obtain the target information, engineers need to consider additional aspects such as the heterogeneity and high number of sensors, and the flexibility of these networks regarding topologies and the sensors in them. Although there are partial approaches for resolving these issues, their integration relies on ad hoc solutions requiring important development efforts. In order to provide an effective approach for this integration, this paper proposes an architecture based on the multi-agent system paradigm with a clear separation of concerns. The architecture considers sensors as devices used by an upper layer of manager agents. These agents are able to communicate and negotiate services to achieve the required functionality. Activities are organized according to roles related with the different aspects to integrate, mainly sensor management, data processing, communication and adaptation to changes in the available devices and their capabilities. This organization largely isolates and decouples the data management from the changing network, while encouraging reuse of solutions. The use of the architecture is facilitated by a specific modelling language developed through metamodelling. A case study concerning a generic distributed system for fire fighting illustrates the approach and the comparison with related work. PMID:22303172

A multi-agent system architecture for sensor networks.

PubMed

Fuentes-Fernández, Rubén; Guijarro, María; Pajares, Gonzalo

2009-01-01

The design of the control systems for sensor networks presents important challenges. Besides the traditional problems about how to process the sensor data to obtain the target information, engineers need to consider additional aspects such as the heterogeneity and high number of sensors, and the flexibility of these networks regarding topologies and the sensors in them. Although there are partial approaches for resolving these issues, their integration relies on ad hoc solutions requiring important development efforts. In order to provide an effective approach for this integration, this paper proposes an architecture based on the multi-agent system paradigm with a clear separation of concerns. The architecture considers sensors as devices used by an upper layer of manager agents. These agents are able to communicate and negotiate services to achieve the required functionality. Activities are organized according to roles related with the different aspects to integrate, mainly sensor management, data processing, communication and adaptation to changes in the available devices and their capabilities. This organization largely isolates and decouples the data management from the changing network, while encouraging reuse of solutions. The use of the architecture is facilitated by a specific modelling language developed through metamodelling. A case study concerning a generic distributed system for fire fighting illustrates the approach and the comparison with related work.

Nature's combinatorial biosynthesis and recently engineered production of nucleoside antibiotics in Streptomyces.

PubMed

Chen, Shawn; Kinney, William A; Van Lanen, Steven

2017-04-01

Modified nucleosides produced by Streptomyces and related actinomycetes are widely used in agriculture and medicine as antibacterial, antifungal, anticancer and antiviral agents. These specialized small-molecule metabolites are biosynthesized by complex enzymatic machineries encoded within gene clusters in the genome. The past decade has witnessed a burst of reports defining the key metabolic processes involved in the biosynthesis of several distinct families of nucleoside antibiotics. Furthermore, genome sequencing of various Streptomyces species has dramatically increased over recent years. Potential biosynthetic gene clusters for novel nucleoside antibiotics are now apparent by analysis of these genomes. Here we revisit strategies for production improvement of nucleoside antibiotics that have defined mechanisms of action, and are in clinical or agricultural use. We summarize the progress for genetically manipulating biosynthetic pathways for structural diversification of nucleoside antibiotics. Microorganism-based biosynthetic examples are provided and organized under genetic principles and metabolic engineering guidelines. We show perspectives on the future of combinatorial biosynthesis, and present a working model for discovery of novel nucleoside natural products in Streptomyces.

Erythrocyte membrane-coated nanogel for combinatorial antivirulence and responsive antimicrobial delivery against Staphylococcus aureus infection.

PubMed

Zhang, Yue; Zhang, Jianhua; Chen, Wansong; Angsantikul, Pavimol; Spiekermann, Kevin A; Fang, Ronnie H; Gao, Weiwei; Zhang, Liangfang

2017-10-10

We reported an erythrocyte membrane-coated nanogel (RBC-nanogel) system with combinatorial antivirulence and responsive antibiotic delivery for the treatment of methicillin-resistant Staphylococcus aureus (MRSA) infection. RBC membrane was coated onto the nanogel via a membrane vesicle templated in situ gelation process, whereas the redox-responsiveness was achieved by using a disulfide bond-based crosslinker. We demonstrated that the RBC-nanogels effectively neutralized MRSA-associated toxins in extracellular environment and the toxin neutralization in turn promoted bacterial uptake by macrophages. In intracellular reducing environment, the RBC-nanogels showed an accelerated drug release profile, which resulted in more effective bacterial inhibition. When added to the macrophages infected with intracellular MRSA bacteria, the RBC-nanogels significantly inhibited bacterial growth compared to free antibiotics and non-responsive nanogel counterparts. These results indicate the great potential of the RBC-nanogel system as a new and effective antimicrobial agent against MRSA infection. Copyright © 2017 Elsevier B.V. All rights reserved.

Integration of language and sensor information

NASA Astrophysics Data System (ADS)

Perlovsky, Leonid I.; Weijers, Bertus

2003-04-01

The talk describes the development of basic technologies of intelligent systems fusing data from multiple domains and leading to automated computational techniques for understanding data contents. Understanding involves inferring appropriate decisions and recommending proper actions, which in turn requires fusion of data and knowledge about objects, situations, and actions. Data might include sensory data, verbal reports, intelligence intercepts, or public records, whereas knowledge ought to encompass the whole range of objects, situations, people and their behavior, and knowledge of languages. In the past, a fundamental difficulty in combining knowledge with data was the combinatorial complexity of computations, too many combinations of data and knowledge pieces had to be evaluated. Recent progress in understanding of natural intelligent systems, including the human mind, leads to the development of neurophysiologically motivated architectures for solving these challenging problems, in particular the role of emotional neural signals in overcoming combinatorial complexity of old logic-based approaches. Whereas past approaches based on logic tended to identify logic with language and thinking, recent studies in cognitive linguistics have led to appreciation of more complicated nature of linguistic models. Little is known about the details of the brain mechanisms integrating language and thinking. Understanding and fusion of linguistic information with sensory data represent a novel challenging aspect of the development of integrated fusion systems. The presentation will describe a non-combinatorial approach to this problem and outline techniques that can be used for fusing diverse and uncertain knowledge with sensory and linguistic data.

Progress and challenges in the development of physically-based numerical models for prediction of flow and contaminant dispersion in the urban environment

NASA Astrophysics Data System (ADS)

Lien, F. S.; Yee, E.; Ji, H.; Keats, A.; Hsieh, K. J.

2006-06-01

The release of chemical, biological, radiological, or nuclear (CBRN) agents by terrorists or rogue states in a North American city (densely populated urban centre) and the subsequent exposure, deposition and contamination are emerging threats in an uncertain world. The modeling of the transport, dispersion, deposition and fate of a CBRN agent released in an urban environment is an extremely complex problem that encompasses potentially multiple space and time scales. The availability of high-fidelity, time-dependent models for the prediction of a CBRN agent's movement and fate in a complex urban environment can provide the strongest technical and scientific foundation for support of Canada's more broadly based effort at advancing counter-terrorism planning and operational capabilities.The objective of this paper is to report the progress of developing and validating an integrated, state-of-the-art, high-fidelity multi-scale, multi-physics modeling system for the accurate and efficient prediction of urban flow and dispersion of CBRN (and other toxic) materials discharged into these flows. Development of this proposed multi-scale modeling system will provide the real-time modeling and simulation tool required to predict injuries, casualties and contamination and to make relevant decisions (based on the strongest technical and scientific foundations) in order to minimize the consequences of a CBRN incident in a populated centre.

Kinetic exchange models: From molecular physics to social science

NASA Astrophysics Data System (ADS)

Patriarca, Marco; Chakraborti, Anirban

2013-08-01

We discuss several multi-agent models that have their origin in the kinetic exchange theory of statistical mechanics and have been recently applied to a variety of problems in the social sciences. This class of models can be easily adapted for simulations in areas other than physics, such as the modeling of income and wealth distributions in economics and opinion dynamics in sociology.

Leaderless consensus for the fractional-order nonlinear multi-agent systems under directed interaction topology

NASA Astrophysics Data System (ADS)

Bai, Jing; Wen, Guoguang; Rahmani, Ahmed

2018-04-01

Leaderless consensus for the fractional-order nonlinear multi-agent systems is investigated in this paper. At the first part, a control protocol is proposed to achieve leaderless consensus for the nonlinear single-integrator multi-agent systems. At the second part, based on sliding mode estimator, a control protocol is given to solve leaderless consensus for the the nonlinear single-integrator multi-agent systems. It shows that the control protocol can improve the systems' convergence speed. At the third part, a control protocol is designed to accomplish leaderless consensus for the nonlinear double-integrator multi-agent systems. To judge the systems' stability in this paper, two classic continuous Lyapunov candidate functions are chosen. Finally, several worked out examples under directed interaction topology are given to prove above results.

Can Computers be Social?

NASA Astrophysics Data System (ADS)

Ekdahl, Bertil

2002-09-01

Of main concern in agent based computing is the conception that software agents can attain socially responsible behavior. This idea has its origin in the need for agents to interact with one another in a cooperating manner. Such interplay between several agents can be seen as a combinatorial play where the rules are fixed and the actors are supposed to closely analyze the play in order to behave rational. This kind of rationality has successfully being mathematically described. When the social behavior is extended beyond rational behavior, mere mathematical analysis falls short. For such behavior language is decisive for transferring concepts and language is a holistic entity that cannot be analyzed and defined mathematically. Accordingly, computers cannot be furnished with a language in the sense that meaning can be conveyed and consequently they lack all the necessary properties to be made social. The attempts to postulate mental properties to computer programs are a misconception that is blamed the lack of true understanding of language and especially the relation between formal system and its semantics.

Teaching Probability in Intermediate Grades

ERIC Educational Resources Information Center

Engel, Arthur

1971-01-01

A discussion of the importance and procedures for including probability in the elementary through secondary mathematics curriculum is presented. Many examples and problems are presented which the author feels students can understand and will be motivated to do. Random digits, Monte Carlo methods, combinatorial theory, and Markov chains are…

Combining local search with co-evolution in a remarkably simple way

DOE Office of Scientific and Technical Information (OSTI.GOV)

Boettcher, S.; Percus, A.

2000-05-01

The authors explore a new general-purpose heuristic for finding high-quality solutions to hard optimization problem. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. In contrast to genetic algorithms, which operate on an entire gene-pool of possible solutions, extremal optimization successively replaces extremely undesirable elements of a single sub-optimal solution with new, random ones. Large fluctuations, or avalanches, ensue that efficiently explore many local optima. Drawing upon models used to simulate far-from-equilibrium dynamics, extremal optimization complements heuristics inspired by equilibrium statistical physics, such as simulated annealing. With only onemore » adjustable parameter, its performance has proved competitive with more elaborate methods, especially near phase transitions. Phase transitions are found in many combinatorial optimization problems, and have been conjectured to occur in the region of parameter space containing the hardest instances. We demonstrate how extremal optimization can be implemented for a variety of hard optimization problems. We believe that this will be a useful tool in the investigation of phase transitions in combinatorial optimization, thereby helping to elucidate the origin of computational complexity.« less

Synthesis and characterization of catalysts and electrocatalysts using combinatorial methods

NASA Astrophysics Data System (ADS)

Ramanathan, Ramnarayanan

This thesis documents attempts at solving three problems. Bead-based parallel synthetic and screening methods based on matrix algorithms were developed. The method was applied to search for new heterogeneous catalysts for dehydrogenation of methylcyclohexane. The most powerful use of the method to date was to optimize metal adsorption and evaluate catalysts as a function of incident energy, likely to be important in the future, should availability of energy be an optimization parameter. This work also highlighted the importance of order of addition of metal salts on catalytic activity and a portion of this work resulted in a patent with UOP LLC, Desplaines, Illinois. Combinatorial methods were also investigated as a tool to search for carbon-monoxide tolerant anode electrocatalysts and methanol tolerant cathode electrocatalysts, resulting in discovery of no new electrocatalysts. A physically intuitive scaling criterion was developed to analyze all experiments on electrocatalysts, providing insight for future experiments. We attempted to solve the CO poisoning problem in polymer electrolyte fuel cells using carbon molecular sieves as a separator. This approach was unsuccessful in solving the CO poisoning problem, possibly due to the tendency of the carbon molecular sieves to concentrate CO and CO 2 in pore walls.

Multiagent pursuit-evasion games: Algorithms and experiments

NASA Astrophysics Data System (ADS)

Kim, Hyounjin

Deployment of intelligent agents has been made possible through advances in control software, microprocessors, sensor/actuator technology, communication technology, and artificial intelligence. Intelligent agents now play important roles in many applications where human operation is too dangerous or inefficient. There is little doubt that the world of the future will be filled with intelligent robotic agents employed to autonomously perform tasks, or embedded in systems all around us, extending our capabilities to perceive, reason and act, and replacing human efforts. There are numerous real-world applications in which a single autonomous agent is not suitable and multiple agents are required. However, after years of active research in multi-agent systems, current technology is still far from achieving many of these real-world applications. Here, we consider the problem of deploying a team of unmanned ground vehicles (UGV) and unmanned aerial vehicles (UAV) to pursue a second team of UGV evaders while concurrently building a map in an unknown environment. This pursuit-evasion game encompasses many of the challenging issues that arise in operations using intelligent multi-agent systems. We cast the problem in a probabilistic game theoretic framework and consider two computationally feasible pursuit policies: greedy and global-max. We also formulate this probabilistic pursuit-evasion game as a partially observable Markov decision process and employ a policy search algorithm to obtain a good pursuit policy from a restricted class of policies. The estimated value of this policy is guaranteed to be uniformly close to the optimal value in the given policy class under mild conditions. To implement this scenario on real UAVs and UGVs, we propose a distributed hierarchical hybrid system architecture which emphasizes the autonomy of each agent yet allows for coordinated team efforts. We then describe our implementation on a fleet of UGVs and UAVs, detailing components such as high level pursuit policy computation, inter-agent communication, navigation, sensing, and regulation. We present both simulation and experimental results on real pursuit-evasion games between our fleet of UAVs and UGVs and evaluate the pursuit policies, relating expected capture times to the speed and intelligence of the evaders and the sensing capabilities of the pursuers. The architecture and algorithmsis described in this dissertation are general enough to be applied to many real-world applications.

Identification of cancer specific ligands from one-bead one compound combinatorial libraries to develop theranostics agents against oral squamous cell carcinoma

NASA Astrophysics Data System (ADS)

Yang, Frances Fan

Background: Oral squamous cell carcinoma (OSCC) is one of the most prevalent disease worldwide. One-bead one-compound (OBOC) combinatorial technology is a powerful method to identify peptidomimetic ligands against a variety of receptors on cell surfaces. We therefore hypothesized that cancer specific ligands against OSCC might be identified and can be conjugated to optical dyes or nanocarriers to develop theranostic agents against OSCC. Material and methods: Different OSCC cell lines were incubated with OBOC libraries and beads with cell binding were sorted and then screened with normal human cells to identify peptide-beads binding to different OSCC cell lines but not binding to normal human cells. The molecular probes of OSCC were developed by biotinylating the carboxyl end of the ligands. OSCC theranostic agents were developed by decorating LLY13 with NPs and evaluated by using orthotopic bioluminescent oral cancer model. Results: Six OSCC specific ligands were discovered. Initial peptide-histochemistry study indicated that LLY12 and LLY13 were able to specifically detect OSCC cells grown on chamber slides at the concentration of 1 muM. In addition, LLY13 was found to penetrate into the OSCC cells and accumulate in the cytoplasm, and nucleus. After screened with a panel of integrin antibodies, only anti-alpha3 antibody was able to block most of OSCC cells binding to the LLY13 beads. OSCC theranostic agents developed using targeting LLY13 micelles (25+/- 4nm in diameter) were more efficient in binding to HSC-3 cancer cells compared to non-targeting micelles. Ex vivo images demonstrated that xenografts from the mice with targeting micelles appeared to have higher signals than the non-targeting groups. Conclusion: LLY13 has promising in vitro and in vivo targeting activity against OSCC. In addition, LLY13 is also able to penetrate into cancer cells via endocytosis. Initial study indicated that alpha3 integrin might partially be the corresponding receptor involved for LLY13's binding to oral cancer cells. OSCC ligands developed from this study may become potential candidates for the development of OSCC targeted theranostic agents.

A Cognitive Game Theoretic Analysis of Conflict Alerts in Air Traffic Control

NASA Technical Reports Server (NTRS)

Erev, Ido; Gopher, Daniel; Remington, Roger

1999-01-01

The current research was motivated by the recommendation made by a joint Government/Industry committee to introduce a new traffic control system, referred to as the Free Flight. This system is designed to use recent new technology to facilitate efficient and safe air transportation. We addressed one of the major difficulties that arise in the design of this and similar multi-agent systems: the adaptive (and slippery) nature of human agents. To facilitate a safe and efficient design of this multi-agent system, designers have to rely on assessments of the expected behavior of the different agents under various scenarios. Whereas the behavior of the computerized agents is predictable, the behavior of the human agents (including air traffic controllers and pilots) is not. Experimental and empirical observations suggest that human agents are likely to adjust their behavior to the design of the system. To see the difficulty that the adaptive nature of human agents creates assume that a good approximation of the way operators currently behave is available. Given this information an optimal design can be performed. The problem arises as the human operator will learn to adjust their behavior to the new system. Following this adjustment process the assumptions made by the designer concerning the operators behavior will no longer be accurate and the system might reach a suboptimal state. In extreme situations these potential suboptimal states might involve unnecessary risk. That is, the fact that operators learn in an adaptive fashion does not imply that the system will become safer as they gain experience. At least in the context of Safety dilemmas, experience can lead to a pareto deficient risk taking behavior.

Development of Novel Combinatorial Treatment to Prevent Chemotherapeutic Resistance and Enhance Efficacy of Riluzole in a Rodent Model of SCI

DTIC Science & Technology

2016-10-01

site as well as in the cervical and lumbar cords out to at least 10 months post-injury. While our rodent study was ongoing, a multi-center clinical...lead to a preservation of motor function and an attenuation in long-term pathologies like neuropathic pain in rats following an acute therapeutic...chemotherapeutic resistance, mass spectrometry, riluzole, licofelone, neuropathic pain , locomotor, bioavailability 11 University of Mississippi

Combinatorial clustering and Its Application to 3D Polygonal Traffic Sign Reconstruction From Multiple Images

NASA Astrophysics Data System (ADS)

Vallet, B.; Soheilian, B.; Brédif, M.

2014-08-01

The 3D reconstruction of similar 3D objects detected in 2D faces a major issue when it comes to grouping the 2D detections into clusters to be used to reconstruct the individual 3D objects. Simple clustering heuristics fail as soon as similar objects are close. This paper formulates a framework to use the geometric quality of the reconstruction as a hint to do a proper clustering. We present a methodology to solve the resulting combinatorial optimization problem with some simplifications and approximations in order to make it tractable. The proposed method is applied to the reconstruction of 3D traffic signs from their 2D detections to demonstrate its capacity to solve ambiguities.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kornreich, Drew E; Vaidya, Rajendra U; Ammerman, Curtt N

Integrated Computational Materials Engineering (ICME) is a novel overarching approach to bridge length and time scales in computational materials science and engineering. This approach integrates all elements of multi-scale modeling (including various empirical and science-based models) with materials informatics to provide users the opportunity to tailor material selections based on stringent application needs. Typically, materials engineering has focused on structural requirements (stress, strain, modulus, fracture toughness etc.) while multi-scale modeling has been science focused (mechanical threshold strength model, grain-size models, solid-solution strengthening models etc.). Materials informatics (mechanical property inventories) on the other hand, is extensively data focused. All of thesemore » elements are combined within the framework of ICME to create architecture for the development, selection and design new composite materials for challenging environments. We propose development of the foundations for applying ICME to composite materials development for nuclear and high-radiation environments (including nuclear-fusion energy reactors, nuclear-fission reactors, and accelerators). We expect to combine all elements of current material models (including thermo-mechanical and finite-element models) into the ICME framework. This will be accomplished through the use of a various mathematical modeling constructs. These constructs will allow the integration of constituent models, which in tum would allow us to use the adaptive strengths of using a combinatorial scheme (fabrication and computational) for creating new composite materials. A sample problem where these concepts are used is provided in this summary.« less

Learning Natural Selection in 4th Grade with Multi-Agent-Based Computational Models

ERIC Educational Resources Information Center

Dickes, Amanda Catherine; Sengupta, Pratim

2013-01-01

In this paper, we investigate how elementary school students develop multi-level explanations of population dynamics in a simple predator-prey ecosystem, through scaffolded interactions with a multi-agent-based computational model (MABM). The term "agent" in an MABM indicates individual computational objects or actors (e.g., cars), and these…

Collective Machine Learning: Team Learning and Classification in Multi-Agent Systems

ERIC Educational Resources Information Center

Gifford, Christopher M.

2009-01-01

This dissertation focuses on the collaboration of multiple heterogeneous, intelligent agents (hardware or software) which collaborate to learn a task and are capable of sharing knowledge. The concept of collaborative learning in multi-agent and multi-robot systems is largely under studied, and represents an area where further research is needed to…

Multi-agent systems design for aerospace applications

NASA Astrophysics Data System (ADS)

Waslander, Steven L.

2007-12-01

Engineering systems with independent decision makers are becoming increasingly prevalent and present many challenges in coordinating actions to achieve systems goals. In particular, this work investigates the applications of air traffic flow control and autonomous vehicles as motivation to define algorithms that allow agents to agree to safe, efficient and equitable solutions in a distributed manner. To ensure system requirements will be satisfied in practice, each method is evaluated for a specific model of agent behavior, be it cooperative or non-cooperative. The air traffic flow control problem is investigated from the point of view of the airlines, whose costs are directly affected by resource allocation decisions made by the Federal Aviation Administration in order to mitigate traffic disruptions caused by weather. Airlines are first modeled as cooperative, and a distributed algorithm is presented with various global cost metrics which balance efficient and equitable use of resources differently. Next, a competitive airline model is assumed and two market mechanisms are developed for allocating contested airspace resources. The resource market mechanism provides a solution for which convergence to an efficient solution can be guaranteed, and each airline will improve on the solution that would occur without its inclusion in the decision process. A lump-sum market is then introduced as an alternative mechanism, for which efficiency loss bounds exist if airlines attempt to manipulate prices. Initial convergence results for lump-sum markets are presented for simplified problems with a single resource. To validate these algorithms, two air traffic flow models are developed which extend previous techniques, the first a convenient convex model made possible by assuming constant velocity flow, and the second a more complex flow model with full inflow, velocity and rerouting control. Autonomous vehicle teams are envisaged for many applications including mobile sensing and search and rescue. To enable these high-level applications, multi-vehicle collision avoidance is solved using a cooperative, decentralized algorithm. For the development of coordination algorithms for autonomous vehicles, the Stanford Testbed of Autonomous Rotorcraft for Multi-Agent Control (STARMAC) is presented. This testbed provides significant advantages over other aerial testbeds due to its small size and low maintenance requirements.

Investigation and Implementation of Matrix Permanent Algorithms for Identity Resolution

DTIC Science & Technology

2014-12-01

calculation of the permanent of a matrix whose dimension is a function of target count [21]. However, the optimal approach for computing the permanent is...presently unclear. The primary objective of this project was to determine the optimal computing strategy(-ies) for the matrix permanent in tactical and...solving various combinatorial problems (see [16] for details and appli- cations to a wide variety of problems) and thus can be applied to compute a

Faithful teleportation of multi-particle states involving multi spatially remote agents via probabilistic channels

NASA Astrophysics Data System (ADS)

Jiang, Min; Li, Hui; Zhang, Zeng-ke; Zeng, Jia

2011-02-01

We present an approach to faithfully teleport an unknown quantum state of entangled particles in a multi-particle system involving multi spatially remote agents via probabilistic channels. In our scheme, the integrity of an entangled multi-particle state can be maintained even when the construction of a faithful channel fails. Furthermore, in a quantum teleportation network, there are generally multi spatially remote agents which play the role of relay nodes between a sender and a distant receiver. Hence, we propose two schemes for directly and indirectly constructing a faithful channel between the sender and the distant receiver with the assistance of relay agents, respectively. Our results show that the required auxiliary particle resources, local operations and classical communications are considerably reduced for the present purpose.

Creating IRT-Based Parallel Test Forms Using the Genetic Algorithm Method

ERIC Educational Resources Information Center

Sun, Koun-Tem; Chen, Yu-Jen; Tsai, Shu-Yen; Cheng, Chien-Fen

2008-01-01

In educational measurement, the construction of parallel test forms is often a combinatorial optimization problem that involves the time-consuming selection of items to construct tests having approximately the same test information functions (TIFs) and constraints. This article proposes a novel method, genetic algorithm (GA), to construct parallel…

A Multi-Agent System for Intelligent Online Education.

ERIC Educational Resources Information Center

O'Riordan, Colm; Griffith, Josephine

1999-01-01

Describes the system architecture of an intelligent Web-based education system that includes user modeling agents, information filtering agents for automatic information gathering, and the multi-agent interaction. Discusses information management; user interaction; support for collaborative peer-peer learning; implementation; testing; and future…

Transition-Independent Decentralized Markov Decision Processes

NASA Technical Reports Server (NTRS)

Becker, Raphen; Silberstein, Shlomo; Lesser, Victor; Goldman, Claudia V.; Morris, Robert (Technical Monitor)

2003-01-01

There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of multi-agent systems is lacking. A recent complexity result, showing that solving decentralized MDPs is NEXP-hard, provides a partial explanation. To overcome this complexity barrier, we identify a general class of transition-independent decentralized MDPs that is widely applicable. The class consists of independent collaborating agents that are tied up by a global reward function that depends on both of their histories. We present a novel algorithm for solving this class of problems and examine its properties. The result is the first effective technique to solve optimally a class of decentralized MDPs. This lays the foundation for further work in this area on both exact and approximate solutions.