Intention Reconsideration like uncertain dichotomous choice model

A key issue in the design of Belief-Desires-Intentions (BDI) agents is that of fnding an appropriate strategy for Intention Reconsider- ation (IR). Traditional approaches to IR defi nes the policy in the agent's design stage, which makes impossible to modify it in execution time. This is clearly not a practical solution for agents operating in dynamic and changing environments. Besides, IR typically involves considering multi- ple criteria. That is why, in this work, we propose a novel approach to IR based on a dichotomous choice model. This approach allows changing commitments to intentions depending on how the environment evolves and involves multi-criteria aggregation for IR.Eje: XV Workshop de Agentes y Sistemas InteligentesRed de Universidades con Carreras de Informática (RedUNCI

Intention Reconsideration like uncertain dichotomous choice model

A key issue in the design of Belief-Desires-Intentions (BDI) agents is that of fnding an appropriate strategy for Intention Reconsider- ation (IR). Traditional approaches to IR defi nes the policy in the agent's design stage, which makes impossible to modify it in execution time. This is clearly not a practical solution for agents operating in dynamic and changing environments. Besides, IR typically involves considering multi- ple criteria. That is why, in this work, we propose a novel approach to IR based on a dichotomous choice model. This approach allows changing commitments to intentions depending on how the environment evolves and involves multi-criteria aggregation for IR.Eje: XV Workshop de Agentes y Sistemas InteligentesRed de Universidades con Carreras de Informática (RedUNCI

Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems

Parallel machine scheduling, involves the allocation of jobs to the system resources (a bank of machines in parallel). A basic model consisting of m machines and n jobs is the foundation of more complex models. Here, jobs are allocated according to resource availability following some allocation rule. In the specialised literature, minimisation of the makespan has been extensively approached and benchmarks can be easily found. This is not the case for other important objectives such as the maximum tardiness and the number of tardy jobs. These problems are NP-hard for 2 ≤ m ≤ n, and conventional heuristics and evolutionary algorithms (EAs) have been developed to provide acceptable schedules as solutions. To solve the unrestricted identical parallel machine scheduling problems, this paper proposes MCMP-SRI and MCMP-SRSI, which are two multirecombination schemes that combine studs, random and seed immigrants. Evidence of the improved behaviour of the EAs when inserting problem-specific knowledge is provided. Experiments and results are discussed.Eje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI

Centrosomal AKAP350 modulates the G1/S transition

AKAP350 (AKAP450/AKAP9/CG-NAP) is an A-kinase anchoring protein, which recruits multiple signaling proteins to the Golgi apparatus and the centrosomes. Several proteins recruited to the centrosomes by this scaffold participate in the regulation of the cell cycle. Previous studies indicated that AKAP350 participates in centrosome duplication. In the present study we specifically assessed the role of AKAP350 in the progression of the cell cycle. Our results showed that interference with AKAP350 expression inhibits G1/S transition, decreasing the initiation of both DNA synthesis and centrosome duplication. We identified an AKAP350 carboxyl-terminal domain (AKAP350CTD), which contained the centrosomal targeting domain of AKAP350 and induced the initiation of DNA synthesis. Nevertheless, AKAP350CTD expression did not induce centrosomal duplication. AKAP350CTD partially delocalized endogenous AKAP350 from the centrosomes, but increased the centrosomal levels of the cyclin-dependent kinase 2 (Cdk2). Accordingly, the expression of this AKAP350 domain increased the endogenous phosphorylation of nucleophosmin by Cdk2, which occurs at the G1/S transition and is a marker of the centrosomal activity of the cyclin E-Cdk2 complex. Cdk2 recruitment to the centrosomes is a necessary event for the development of the G1/S transition. Altogether, our results indicate that AKAP350 facilitates the initiation of DNA synthesis by scaffolding Cdk2 to the centrosomes, and enabling its specific activity at this organelle. Although this mechanism could also be involved in AKAP350-dependent modulation of centrosomal duplication, it is not sufficient to account for this process.Fil: Mattaloni, Stella Maris. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Instituto de Fisiología Experimental. Universidad Nacional de Rosario. Facultad de Ciencias Bioquímicas y Farmacéuticas. Instituto de Fisiología Experimental; ArgentinaFil: Ferretti, Anabela. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Instituto de Fisiología Experimental. Universidad Nacional de Rosario. Facultad de Ciencias Bioquímicas y Farmacéuticas. Instituto de Fisiología Experimental; ArgentinaFil: Tonucci, Facundo Mauro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Instituto de Fisiología Experimental. Universidad Nacional de Rosario. Facultad de Ciencias Bioquímicas y Farmacéuticas. Instituto de Fisiología Experimental; ArgentinaFil: Favre, Cristian. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Instituto de Fisiología Experimental. Universidad Nacional de Rosario. Facultad de Ciencias Bioquímicas y Farmacéuticas. Instituto de Fisiología Experimental; ArgentinaFil: Goldenring, James R.. Vanderbilt University; Estados UnidosFil: Larocca, Maria Cecilia. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Instituto de Fisiología Experimental. Universidad Nacional de Rosario. Facultad de Ciencias Bioquímicas y Farmacéuticas. Instituto de Fisiología Experimental; Argentin

Can exotic tree plantations preserve the bird community of an endangered native forest in the Argentine pampas?

Worldwide, the areas covered by native forests are declining while those of tree plantations are increasing. This has raised the question of whether tree plantations are able to preserve native forest species. In Argentina, the main native forests of the Pampas region, called talares, are endangered and their disappearance is imminent. Although exotic tree plantations are increasing in this region, their role in maintaining native bird diversity has not been studied in Argentine Pampas. We compared the bird community attributes and vegetation structure of talares native forests with those of tree plantations. Compared with talares native forests, plantations exhibited markedly lower bird richness (up to 80% lower), and all forest-dependent bird species were absent in plantations. Talares and plantations differed also in some aspects of vegetation structure, which usually are key determinants of bird abundance. Given the extreme importance of talares for forest birds, this bird community will be deeply affected if talares native forests continue to decline, as nearby plantations do not offer suitable habitat. To maintain the bird diversity of talares, and probably the diversity of other unstudied taxa related to them, we recommend management actions that should be applied urgently in these endangered forests of the Argentine Pampas.Fil: Lacoretz, Mariela Verónica. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Ecología, Genética y Evolución; ArgentinaFil: Depalma, Daniela María. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Ecología, Genética y Evolución de Buenos Aires. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Ecología, Genética y Evolución de Buenos Aires; ArgentinaFil: Torrella, Sebastián Andrés. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Ecología, Genética y Evolución; ArgentinaFil: Zilli, Cecilia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Ecología, Genética y Evolución; ArgentinaFil: Ferretti, Valentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Ecología, Genética y Evolución de Buenos Aires. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Ecología, Genética y Evolución de Buenos Aires; ArgentinaFil: Fernandez, Gustavo Javier. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Centro Cientifico Tecnologico Conicet - Patagonia Norte. Instituto de Investigaciones En Biodiversidad y Medioambiente. Subsede San Martín de Los Andes-inibioma | Universidad Nacional del Comahue. Centro Regional Universitario Bariloche. Instituto de Investigaciones En Biodiversidad y Medioambiente. Subsede San Martín de Los Andes-inibioma.; Argentin

A framework for multi-criteria argumentation-based decision making within a BDI agent

The BDI model, as a practical reasoning architecture aims at making decisions about what to do based on cognitives notions as beliefs, desires and intentions. However, during the decision making process, BDI agents also have to make background decisions like choosing what intention to achieve next from a set of possibly conflicting desires; which plan to execute from among the plans that satisfy a given intention; and whether is necessary or not to reconsider current intentions. With this aim, in this work, we present an abstract framework which integrates a Possibilistic Defeasible Logic Programming approach to decision making in the inner decision processes within BDI agents.Facultad de Informátic

Intention Reconsideration like uncertain dichotomous choice model

A key issue in the design of Belief-Desires-Intentions (BDI) agents is that of fnding an appropriate strategy for Intention Reconsider- ation (IR). Traditional approaches to IR defi nes the policy in the agent's design stage, which makes impossible to modify it in execution time. This is clearly not a practical solution for agents operating in dynamic and changing environments. Besides, IR typically involves considering multi- ple criteria. That is why, in this work, we propose a novel approach to IR based on a dichotomous choice model. This approach allows changing commitments to intentions depending on how the environment evolves and involves multi-criteria aggregation for IR.Eje: XV Workshop de Agentes y Sistemas InteligentesRed de Universidades con Carreras de Informática (RedUNCI

Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems

Parallel machine scheduling, involves the allocation of jobs to the system resources (a bank of machines in parallel). A basic model consisting of m machines and n jobs is the foundation of more complex models. Here, jobs are allocated according to resource availability following some allocation rule. In the specialised literature, minimisation of the makespan has been extensively approached and benchmarks can be easily found. This is not the case for other important objectives such as the maximum tardiness and the number of tardy jobs. These problems are NP-hard for 2 ≤ m ≤ n, and conventional heuristics and evolutionary algorithms (EAs) have been developed to provide acceptable schedules as solutions. To solve the unrestricted identical parallel machine scheduling problems, this paper proposes MCMP-SRI and MCMP-SRSI, which are two multirecombination schemes that combine studs, random and seed immigrants. Evidence of the improved behaviour of the EAs when inserting problem-specific knowledge is provided. Experiments and results are discussed.Eje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI

Resolución de problemas de planificación de tareas en ambientes de máquinas paralelas usando algoritmos evolutivos

La planificación en un ambiente de máquinas idénticas en paralelo (Pm) implica efectuar un cierto número de tareas (jobs) que utilizan varios recursos (un banco de máquinas en paralelo) por un cierto periodo de tiempo. Un modelo sencillo que consiste de m máquinas y n tareas independientes es la base de modelos más complejos. En este modelo, las tareas son asignadas de acuerdo con la disponibilidad de los recursos existentes siguiendo alguna regla de despacho determinada. El tiempo de finalización de la última tarea que abandona el sistema, conocido como makespan (Cmax), es uno de los objetivos más importantes a ser minimizado debido a que usualmente implica una alta utilización de los recursos; sin embargo, deben ser considerados otros objetivos tratados comúnmente en la literatura [9, 11], los cuales además de tener importancia teórica son de relevancia práctica. Muchos de estos problemas son NP-Hard para 2 ≤ m ≤ n y por ende, se han desarrollado heurísticas convencionales, Algoritmos Evolutivos (AEs) y otras heurísticas poblacionales para proveer planes o planificaciones aceptables como soluciones. Este trabajo, expone las conclusiones obtenidas en la resolución de problemas de planificación de tareas sin restricciones de precedencia, en ambientes de planificación de 2 y 5 máquinas idénticas en paralelo, mediante el uso de AEs que implementan distintas técnicas de recombinación y utilizan distintas representaciones indirectas de cromosoma. La performance lograda por los distintos AEs implementados, se compara con los resultados obtenidos por un conjunto de heurísticas convencionales que se aplican usualmente a diferentes problemas de planificación de máquinas idénticas en paralelo.Eje: Sistemas de información y MetaheurísticaRed de Universidades con Carreras en Informática (RedUNCI

Multi-criteria argumentation-based decision making within a BDI agent

The BDI model, as a practical reasoning architecture aims at making decisions about what to do based on cognitives notions as beliefs, desires and intentions. However, during the decision making process, BDI agents also have to make background decisions like choosing what intention to achieve next from a set of possibly con icting desires; which plan to execute from among the plans that satisfy a given intention; and whether is necessary or not to reconsider current intentions. With this aim, in this work, we present an abstract framework which integrates a Possibilistic Defeasible Logic Programming approach to decision making in the inner decision processes within BDI agents.XIV Workshop agentes y sistemas inteligentes.Red de Universidades con Carreras en Informática (RedUNCI