An Effective Path Protection Method to Attain the Route Stability in MANET

With the increasing popularity of wireless network and its application, mobile ad-hoc networks (MANETS) emerged recently. MANET topology is highly dynamic in nature and nodes are highly mobile so that the rate of link failure is more in MANET. There is no central control over the nodes and the control is distributed among nodes and they can act as either router or source. MANTEs have been considered as isolated stand-alone network. Node can add or remove at any time and it is not infrastructure dependent. So at any time at any where the network can setup and a trouble free communication is possible. Due to more chances of link failures, collisions and transmission errors in MANET, the maintenance of network became costly. As per the study more frequent link failures became an important aspect of diminishing the performance of the network and also it is not predictable. The main objective of this paper is to study the route instability in AODV protocol and suggest a solution for improvement. This paper proposes a new approach to reduce the route failure by storing the alternate route in the intermediate nodes. In this algorithm intermediate nodes are also involved in the route discovery process. This reduces the route establishment overhead as well as the time to find the reroute when a link failure occurs.

A Compiler Integrated Assistance for Optimum Data Allocation in Banked Memory Embedded Processors

Bank switching in embedded processors having partitioned memory architecture results in code size as well as run time overhead. An algorithm and its application to assist the compiler in eliminating the redundant bank switching codes introduced and deciding the optimum data allocation to banked memory is presented in this work. A relation matrix formed for the memory bank state transition corresponding to each bank selection instruction is used for the detection of redundant codes. Data allocation to memory is done by considering all possible permutation of memory banks and combination of data. The compiler output corresponding to each data mapping scheme is subjected to a static machine code analysis which identifies the one with minimum number of bank switching codes. Even though the method is compiler independent, the algorithm utilizes certain architectural features of the target processor. A prototype based on PIC 16F87X microcontrollers is described. This method scales well into larger number of memory blocks and other architectures so that high performance compilers can integrate this technique for efficient code generation. The technique is illustrated with an example

Multi-Robot Task Allocation for Inspection Problems with Cooperative Tasks Using Hybrid Genetic Algorithms

In dieser Dissertation werden Methoden zur optimalen Aufgabenverteilung in Multirobotersystemen (engl. Multi-Robot Task Allocation – MRTA) zur Inspektion von Industrieanlagen untersucht. MRTA umfasst die Verteilung und Ablaufplanung von Aufgaben für eine Gruppe von Robotern unter Berücksichtigung von operativen Randbedingungen mit dem Ziel, die Gesamteinsatzkosten zu minimieren. Dank zunehmendem technischen Fortschritt und sinkenden Technologiekosten ist das Interesse an mobilen Robotern für den Industrieeinsatz in den letzten Jahren stark gestiegen. Viele Arbeiten konzentrieren sich auf Probleme der Mobilität wie Selbstlokalisierung und Kartierung, aber nur wenige Arbeiten untersuchen die optimale Aufgabenverteilung. Da sich mit einer guten Aufgabenverteilung eine effizientere Planung erreichen lässt (z. B. niedrigere Kosten, kürzere Ausführungszeit), ist das Ziel dieser Arbeit die Entwicklung von Lösungsmethoden für das aus Inspektionsaufgaben mit Einzel- und Zweiroboteraufgaben folgende Such-/Optimierungsproblem. Ein neuartiger hybrider Genetischer Algorithmus wird vorgestellt, der einen teilbevölkerungbasierten Genetischen Algorithmus zur globalen Optimierung mit lokalen Suchheuristiken kombiniert. Zur Beschleunigung dieses Algorithmus werden auf die fittesten Individuen einer Generation lokale Suchoperatoren angewendet. Der vorgestellte Algorithmus verteilt die Aufgaben nicht nur einfach und legt den Ablauf fest, sondern er bildet auch temporäre Roboterverbünde für Zweiroboteraufgaben, wodurch räumliche und zeitliche Randbedingungen entstehen. Vier alternative Kodierungsstrategien werden für den vorgestellten Algorithmus entworfen: Teilaufgabenbasierte Kodierung: Hierdurch werden alle möglichen Lösungen abgedeckt, allerdings ist der Suchraum sehr groß. Aufgabenbasierte Kodierung: Zwei Möglichkeiten zur Zuweisung von Zweiroboteraufgaben wurden implementiert, um die Effizienz des Algorithmus zu steigern. Gruppierungsbasierte Kodierung: Zeitliche Randbedingungen zur Gruppierung von Aufgaben werden vorgestellt, um gute Lösungen innerhalb einer kleinen Anzahl von Generationen zu erhalten. Zwei Umsetzungsvarianten werden vorgestellt. Dekompositionsbasierte Kodierung: Drei geometrische Zerlegungen wurden entworfen, die Informationen über die räumliche Anordnung ausnutzen, um Probleme zu lösen, die Inspektionsgebiete mit rechteckigen Geometrien aufweisen. In Simulationsstudien wird die Leistungsfähigkeit der verschiedenen hybriden Genetischen Algorithmen untersucht. Dazu wurde die Inspektion von Tanklagern einer Erdölraffinerie mit einer Gruppe homogener Inspektionsroboter als Anwendungsfall gewählt. Die Simulationen zeigen, dass Kodierungsstrategien, die auf der geometrischen Zerlegung basieren, bei einer kleinen Anzahl an Generationen eine bessere Lösung finden können als die anderen untersuchten Strategien. Diese Arbeit beschäftigt sich mit Einzel- und Zweiroboteraufgaben, die entweder von einem einzelnen mobilen Roboter erledigt werden können oder die Zusammenarbeit von zwei Robotern erfordern. Eine Erweiterung des entwickelten Algorithmus zur Behandlung von Aufgaben, die mehr als zwei Roboter erfordern, ist möglich, würde aber die Komplexität der Optimierungsaufgabe deutlich vergrößern.

Effect of environmental conditions on the N uptake route of soil microorganisms and adaption of a method to determine amino acid oxidase in soil

Soil microorganisms have evolved two possible mechanisms for their uptake of organic N: the direct route and the mobilization-immobilization-turnover (MIT) route. In the direct route, simple organic molecules are taken up via various mechanisms directly into the cell. In the MIT route, the deamination occurs outside the cell and all N is mineralized to NH4+ before assimilation. A better understanding of the mechanisms controlling the different uptake routes of soil microorganisms under different environmental conditions is crucial for understanding mineralization processes of organic material in soil. For the first experiment we incubated soil samples from the long term trial in Bad Lauchstädt with corn residues with different C to N ratios and inorganic N for 21 days at 20 °C. Under the assumption that all added amino acids were taken up or mineralized, the direct uptake route was more important in soil amended with corn residues with a wide C to N ratio. After 21 days of incubation the direct uptake of added amino acids increased in the order addition of corn residue with a: “C to N ratio of 40 & (NH4)2SO4 and no addition (control)” (69% and 68%, respectively) < “C to N ratio of 20” (73%) < “C to N ratio of 40” (95%). In all treatments the proportion of the added amino acids that were mineralized increased with time, indicating that the MIT route became more important over time. To investigate the effects of soil depth on the N uptake route of soil microorganisms (experiment II), soil samples in two soil depths (0-5 cm; 30-40 cm) were incubated with corn residues with different C to N ratios and inorganic N for 21 days at 20 °C and 60% (WHC). The addition of corn residue resulted in a marked increase of protease activity in both depths due to the induction from the added substrate. Addition of corn residue with a wide C to N ratio resulted in a significantly greater part of the direct uptake (97% and 94%) than without the addition of residues (85% and 80%) or addition of residue with a small C to N ratio (90% and 84%) or inorganic N (91% and 79% in the surface soil and subsoil, respectively), suggesting that under conditions of sufficient mineralizable N (C to N ratio of 20) or increased concentrations of NH4+, the enzyme system involved in the direct uptake is slightly repressed. Substrate additions resulted in an initially significantly higher increase of the direct uptake in the surface soil than in the subsoil. As a large proportion of the organic N input into soil is in form of proteinaceous material, the deamination of amino acids is a key reaction of the MIT route. Therefore the enzyme amino acid oxidase contribute to the extracellular N mineralization in soil. The objective of experiment III was to adapt a method to determine amino acid oxidase in soil. The detection via synthetic fluorescent Lucifer Yellow derivatives of the amino acid lysine is possible in soil. However, it was not possible to find the substrate concentration at which the reaction rate is independent of substrate concentration and therefore we were not able to develop a valid soil enzyme assay.

Bandwidth allocation based on real time calculations using the convolution approach

This paper focuses on one of the methods for bandwidth allocation in an ATM network: the convolution approach. The convolution approach permits an accurate study of the system load in statistical terms by accumulated calculations, since probabilistic results of the bandwidth allocation can be obtained. Nevertheless, the convolution approach has a high cost in terms of calculation and storage requirements. This aspect makes real-time calculations difficult, so many authors do not consider this approach. With the aim of reducing the cost we propose to use the multinomial distribution function: the enhanced convolution approach (ECA). This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements and makes a simple deconvolution process possible. The ECA is used in connection acceptance control, and some results are presented

Allocation rules on networks

When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice.

Gender differences in time allocation of poor children in Colombia

This paper studies the effect of credit constraints and constraints on transfers between parents and children, on differences in labor and schooling across children within the same household, with an application to gender. When families are unconstrained in these respects, differences in labor supply or education are driven by differences in wages or returns to education. If the family faces an imperfect capital market, the labor supply of each child is inefficient, but differences across children are still driven by comparative advantage. However, if interfamily transfers are constrained so that parents cannot offset inequality between their children, they will favor the human capital accumulation of the more disadvantaged child -generally the one who works more as a child. We use our theory to examine the gender gap in child labor. Using a sample of poor families in Colombia, we conform our predictions among rural households, although this is less clear for urban households. The gender gap is largely explained by the wage gap between girls and boys. Moreover, families with the potential to make capital transfers to adult children (e.g. those with large animals), can compensate adult sons for their greater child labor and reduced educational attainment. In such families, as predicted, the male/female labor gap is greater.

La Route des Flandres de Claude Simon.

Estudio sobre la obra de Claude Simon, titulada La Route des Flandres. Es una de las novelas más destacadas dentro de las que han sido calificadas como Nuoveau Roman. Su protagonista, Georges, narra su historia tal como ésta va surgiendo de su memoria, es decir, por retazas incompletos, llenos de vacíos. La obra es, pues, el reflejo de una memoria espontánea, no siempre fiel a la realidad. La dificultad de transcribir el carácter simultáneo de todos los elementos que componen una visión global de la memoria, la ha superado el autor mediante la dislocación total del relato. Se analiza en profundidad la historia, la estructura narrativa, el montaje y el discurso de la novela. Para concluir se hace referencia a su significado como obra literaria.

Applicability of dual-route reading models to Spanish

Resumen tomado de la publicaci??n

Dynamic task allocation and coordination in cooperative multi-agent environments

La coordinació i assignació de tasques en entorns distribuïts ha estat un punt important de la recerca en els últims anys i aquests temes són el cor dels sistemes multi-agent. Els agents en aquests sistemes necessiten cooperar i considerar els altres agents en les seves accions i decisions. A més a més, els agents han de coordinar-se ells mateixos per complir tasques complexes que necessiten més d'un agent per ser complerta. Aquestes tasques poden ser tan complexes que els agents poden no saber la ubicació de les tasques o el temps que resta abans de que les tasques quedin obsoletes. Els agents poden necessitar utilitzar la comunicació amb l'objectiu de conèixer la tasca en l'entorn, en cas contrari, poden perdre molt de temps per trobar la tasca dins de l'escenari. De forma similar, el procés de presa de decisions distribuït pot ser encara més complexa si l'entorn és dinàmic, amb incertesa i en temps real. En aquesta dissertació, considerem entorns amb sistemes multi-agent amb restriccions i cooperatius (dinàmics, amb incertesa i en temps real). En aquest sentit es proposen dues aproximacions que permeten la coordinació dels agents. La primera és un mecanisme semi-centralitzat basat en tècniques de subhastes combinatòries i la idea principal es minimitzar el cost de les tasques assignades des de l'agent central cap als equips d'agents. Aquest algoritme té en compte les preferències dels agents sobre les tasques. Aquestes preferències estan incloses en el bid enviat per l'agent. La segona és un aproximació d'scheduling totalment descentralitzat. Això permet als agents assignar les seves tasques tenint en compte les preferències temporals sobre les tasques dels agents. En aquest cas, el rendiment del sistema no només depèn de la maximització o del criteri d'optimització, sinó que també depèn de la capacitat dels agents per adaptar les seves assignacions eficientment. Addicionalment, en un entorn dinàmic, els errors d'execució poden succeir a qualsevol pla degut a la incertesa i error de accions individuals. A més, una part indispensable d'un sistema de planificació és la capacitat de re-planificar. Aquesta dissertació també proveeix una aproximació amb re-planificació amb l'objectiu de permetre als agent re-coordinar els seus plans quan els problemes en l'entorn no permeti la execució del pla. Totes aquestes aproximacions s'han portat a terme per permetre als agents assignar i coordinar de forma eficient totes les tasques complexes en un entorn multi-agent cooperatiu, dinàmic i amb incertesa. Totes aquestes aproximacions han demostrat la seva eficiència en experiments duts a terme en l'entorn de simulació RoboCup Rescue.

Robustness on resource allocation problems

En problemes d'assignació de recursos, normalment s'han de tenir en compte les incerteses que poden provocar canvis en les dades inicials. Aquests canvis dificulten l'aplicabilitat de les planificacions que s'hagin fet inicialment. Aquesta tesi se centra en l'elaboració de tècniques que consideren la incertesa alhora de cercar solucions robustes, és a dir solucions que puguin continuar essent vàlides encara que hi hagi canvis en l'entorn. Particularment, introduïm el concepte de robustesa basat en reparabilitat, on una solució robusta és una que pot ser reparada fàcilment en cas que hi hagi incidències. La nostra aproximació es basa en lògica proposicional, codificant el problema en una fórmula de satisfactibilitat Booleana, i aplicant tècniques de reformulació per a la generació de solucions robustes. També presentem un mecanisme per a incorporar flexibilitat a les solucions robustes, de manera que es pugui establir fàcilment el grau desitjat entre robustesa i optimalitat de les solucions.

Allocation of GHG emissions in a paper mill, an application tool to reduce emissions

El sector de pasta i paper és considerat un dels set sectors industrials més intensius en consum energètic. La producció i consum d'electricitat i de vapor esdevenen les fonts majoritàries d'emissions de gasos d'efecte hivernacle en aquest sector industrial. Les fàbriques papereres poden assolir objectius de reducció d'emissions mitjançant reducció en origen (substitució de combustibles, introducció d'energies renovables) o bé a partir de mesures d'eficiència energètica en el propi procés. En aquest context, s'ha desenvolupat un mètode de distribució d'emissions que permet assignar a cada unitat d'operació del procés paperer, el seu grau de responsabilitat en emissions. També s'han avaluat diferents mètodes de càlcul de factors d'emissió de vapor i electricitat, tant per plantes de cogeneració com per sistemes individuals. A partir d'aquesta avaluació s'han proposat nous mètodes alternatius als analitzats. Aquests mètodes i els factors d'emissions s'han aplicat a dues fàbriques papereres catalanes.