Heavy metal and microbial loads in sewage irrigated vegetables of Kabul, Afghanistan

Little is known about the heavy metal and microbial contamination of vegetables produced in Central Asian cities. We therefore measured the concentration of cadmium (Cd), copper (Cu), lead (Pb), and zinc (Zn) and of faecal pathogens (Coliform bacteria, Salmonella sp., Shigella sp., Ascaris lubricoides, Entamoeba sp. and pinworms [Oxyuris vermicularis syn. Enterobius vermicularis]) in soil, irrigation water, and marketed vegetables of Kabul City, Afghanistan. Leaf Pb and Zn concentrations of leafy vegetables were with 1–5 and 33–160 mg kg^{-1} dry weight (DW) several-fold above respective international thresholds of 0.3 mg Pb kg^{-1} and 50 mg Zn kg^{-1}. The tissue concentration of Cu was below threshold limits in all samples except for spinach in one farm. Above-threshold loads of microbes and parasites on vegetables were found in five out of six gardens with coliforms ranging from 0.5–2 × 10^7 cells 100g^{-1} fresh weight (FW), but no Salmonella and Shigella were found. Contamination with 0.2 × 10^7 eggs 100g^{-1} FW of Ascaris was detected on produce of three farms and critical concentrations of Entamoeba in a single case, while Oxyuris vermicularis, and Enterobius vermicularis were found on produce of three and four farms, respectively. Irrigation water had Ascaris, Coliforms, Salmonella, Shigella, Entamoeba, and Oxyuris vermicularis syn. Enterobius vermicularis ranging from 0.35 × 10^7 to 2 × 10^7 cells l^{-1}. The heavy metal and microbial loads on fresh UPA vegetables are likely the result of contamination from rising traffic, residues of the past decades of war and lacking treatment of sewage which needs urgent attention.

CD-Systems of Restarting Automata

Die vorliegende Arbeit behandelt Restartautomaten und Erweiterungen von Restartautomaten. Restartautomaten sind ein Werkzeug zum Erkennen formaler Sprachen. Sie sind motiviert durch die linguistische Methode der Analyse durch Reduktion und wurden 1995 von Jancar, Mráz, Plátek und Vogel eingeführt. Restartautomaten bestehen aus einer endlichen Kontrolle, einem Lese/Schreibfenster fester Größe und einem flexiblen Band. Anfänglich enthält dieses sowohl die Eingabe als auch Bandbegrenzungssymbole. Die Berechnung eines Restartautomaten läuft in so genannten Zyklen ab. Diese beginnen am linken Rand im Startzustand, in ihnen wird eine lokale Ersetzung auf dem Band durchgeführt und sie enden mit einem Neustart, bei dem das Lese/Schreibfenster wieder an den linken Rand bewegt wird und der Startzustand wieder eingenommen wird. Die vorliegende Arbeit beschäftigt sich hauptsächlich mit zwei Erweiterungen der Restartautomaten: CD-Systeme von Restartautomaten und nichtvergessende Restartautomaten. Nichtvergessende Restartautomaten können einen Zyklus in einem beliebigen Zustand beenden und CD-Systeme von Restartautomaten bestehen aus einer Menge von Restartautomaten, die zusammen die Eingabe verarbeiten. Dabei wird ihre Zusammenarbeit durch einen Operationsmodus, ähnlich wie bei CD-Grammatik Systemen, geregelt. Für beide Erweiterungen zeigt sich, dass die deterministischen Modelle mächtiger sind als deterministische Standardrestartautomaten. Es wird gezeigt, dass CD-Systeme von Restartautomaten in vielen Fällen durch nichtvergessende Restartautomaten simuliert werden können und andererseits lassen sich auch nichtvergessende Restartautomaten durch CD-Systeme von Restartautomaten simulieren. Des Weiteren werden Restartautomaten und nichtvergessende Restartautomaten untersucht, die nichtdeterministisch sind, aber keine Fehler machen. Es zeigt sich, dass diese Automaten durch deterministische (nichtvergessende) Restartautomaten simuliert werden können, wenn sie direkt nach der Ersetzung einen neuen Zyklus beginnen, oder ihr Fenster nach links und rechts bewegen können. Außerdem gilt, dass alle (nichtvergessenden) Restartautomaten, die zwar Fehler machen dürfen, diese aber nach endlich vielen Zyklen erkennen, durch (nichtvergessende) Restartautomaten simuliert werden können, die keine Fehler machen. Ein weiteres wichtiges Resultat besagt, dass die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt den Zyklus beenden, genau die deterministischen kontextfreien Sprachen erkennen, wohingegen die deterministischen monotonen nichtvergessenden Restartautomaten mit Hilfssymbolen ohne diese Einschränkung echt mehr, nämlich die links-rechts regulären Sprachen, erkennen. Damit werden zum ersten Mal Restartautomaten mit Hilfssymbolen, die direkt nach dem Ersetzungsschritt ihren Zyklus beenden, von Restartautomaten desselben Typs ohne diese Einschränkung getrennt. Besonders erwähnenswert ist hierbei, dass beide Automatentypen wohlbekannte Sprachklassen beschreiben.

Lower Bounds for Nonforgetting Restarting Automata and CD-Systems of Restarting Automata

The nonforgetting restarting automaton is a generalization of the restarting automaton that, when executing a restart operation, changes its internal state based on the current state and the actual contents of its read/write window instead of resetting it to the initial state. Another generalization of the restarting automaton is the cooperating distributed system (CD-system) of restarting automata. Here a finite system of restarting automata works together in analyzing a given sentence, where they interact based on a given mode of operation. As it turned out, CD-systems of restarting automata of some type X working in mode =1 are just as expressive as nonforgetting restarting automata of the same type X. Further, various types of determinism have been introduced for CD-systems of restarting automata called strict determinism, global determinism, and local determinism, and it has been shown that globally deterministic CD-systems working in mode =1 correspond to deterministic nonforgetting restarting automata. Here we derive some lower bound results for some types of nonforgetting restarting automata and for some types of CD-systems of restarting automata. In this way we establish separations between the corresponding language classes, thus providing detailed technical proofs for some of the separation results announced in the literature.

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system M of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system M' of restarting automata of the same type as M that, working in the new mode ed, accepts the language that M accepts in mode m. Further, we prove that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W). This is the first time that a non-monotone type of R-automaton without auxiliary symbols is shown to be as expressive as the corresponding type of RR-automaton.

On CD-systems of stateless deterministic R-automata with window size one

We study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power of these systems by relating the class of languages that they accept by mode =1 computations to other well-studied language classes, showing in particular that this class only contains semi-linear languages, and that it includes all rational trace languages. In addition, we investigate the closure and non-closure properties of this class of languages and some of its algorithmic properties.

CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store

We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.

On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems, the strictly deterministic systems and the globally deterministic systems.

Urban and peri-urban agricultural production along railway tracks: a case study from the Mumbai Metropolitan Region

Urban and peri-urban agriculture (UPA) contributes to food security, serves as an opportunity for income generation, and provides recreational services to urban citizens. With a population of 21 Million people, of which 60 % live in slums, UPA activities can play a crucial role in supporting people’s livelihoods in Mumbai Metropolitan Region (MMR). This study was conducted to characterize the railway gardens, determine their role in UPA production, and assess potential risks. It comprises a baseline survey among 38 railway gardeners across MMR characterized by different demographic, socio-economic, migratory, and labour characteristics. Soil, irrigation water, and plant samples were analyzed for nutrients, heavy metals, and microbial load. All the railway gardeners practiced agriculture as a primary source of income and cultivated seasonal vegetables such as lady’s finger (Abelmoschus esculentus L. Moench), spinach (Spinacia oleracea L.), red amaranth (Amaranthus cruentus L.), and white radish (Raphanus sativus var. longipinnatus) which were irrigated with waste water. This irrigation water was loaded with 7–28 mg N l^(−1), 0.3–7 mg P l^(−1), and 8–32 mg K l^(−1), but also contained heavy metals such as lead (0.02–0.06 mg Pb l^(−1)), cadmium (0.03–0.17 mg Cd l^(−1)), mercury (0.001–0.005 mg Hg l^(−1)), and pathogens such as Escherichia coli (1,100 most probable number per 100 ml). Levels of heavy metals exceeded the critical thresholds in surface soils (Cr, Ni, and Sr) and produce (Pb, Cd, and Sr). The railway garden production systems can substantially foster employment and reduce economic deprivation of urban poor particularly slum dwellers and migrant people. However this production system may also cause possible health risks to producers and consumers.