Portraits of Max Pallenberg, No 9.

Pallenberg is represented in No 9 representing himself

Enhancement of (BH)(max) in a hard-soft-ferrite nanocomposite using exchange spring mechanism

We have observed the exchange spring behavior in the soft (Fe3O4)-hard (BaCa2Fe16O27)-ferrite composite by tailoring the particle size of the individual phases and by suitable thermal treatment of the composite. The magnetization curve for the nanocomposite heated at 800 degrees C shows a single loop hysteresis showing the existence of the exchange spring phenomena in the composite and an enhancement of 13% in (BH)(max) compared to the parent hard ferrite (BaCa2Fe16O27). The Henkel plot provides the proof of the presence of the exchange interaction between the soft and hard grains as well as its dominance over the dipolar interaction in the nanocomposite.

Preparation of reticulated MAX-phase support with morphology-controllable nanostructured ceria coating for gas exhaust catalyst devices

Reticulated porous Ti3AlC2 ceramic, a member of the MAX-phase family (Mn+1AXn phases, where M is an early transition metal, A is an A-group element, and X is carbon and/or nitrogen), was prepared from the highly dispersed aqueous suspension by a replica template method. Through a cathodic electrogeneration method, nanocrystalline catalytic CeO2 coatings were deposited on the conductive porous Ti 3AlC2 supports. By adjusting the pH value and cathodic deposition current, coatings exhibiting nanocellar, nanosheets-like, or bubble-free morphologies can be obtained. This work expects to introduce a novel practically feasible material system and a catalytic coating preparation technique for gas exhaust catalyst devices.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip

Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences these parameters. Hence the embedded system designer performs a complete memory architecture exploration. This problem is a multi-objective optimization problem and can be tackled as a two-level optimization problem. The outer level explores various memory architecture while the inner level explores placement of data sections (data layout problem) to minimize memory stalls. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of Multi-objective Genetic Algorithm (Memory Architecture exploration) and an efficient heuristic data placement algorithm. At the outer level the memory architecture exploration is done by picking memory modules directly from a ASIC memory Library. This helps in performing the memory architecture exploration in a integrated framework, where the memory allocation, memory exploration and data layout works in a tightly coupled way to yield optimal design points with respect to area, power and performance. We experimented our approach for 3 embedded applications and our approach explores several thousand memory architecture for each application, yielding a few hundred optimal design points in a few hours of computation time on a standard desktop.

Estimation of design basis earthquake using region-specific M-max, for the NPP site at Kalpakkam, Tamil Nadu, India

The objective of the paper is to estimate Safe Shutdown Earthquake (SSE) and Operating/Design Basis Earthquake (OBE/DBE) for the Nuclear Power Plant (NPP) site located at Kalpakkam, Tamil Nadu, India. The NPP is located at 12.558 degrees N, 80.175 degrees E and a 500 km circular area around NPP site is considered as `seismic study area' based on past regional earthquake damage distribution. The geology, seismicity and seismotectonics of the study area are studied and the seismotectonic map is prepared showing the seismic sources and the past earthquakes. Earthquake data gathered from many literatures are homogenized and declustered to form a complete earthquake catalogue for the seismic study area. The conventional maximum magnitude of each source is estimated considering the maximum observed magnitude (M-max(obs)) and/or the addition of 0.3 to 0.5 to M-max(obs). In this study maximum earthquake magnitude has been estimated by establishing a region's rupture character based on source length and associated M-max(obs). A final source-specific M-max is selected from the three M-max values by following the logical criteria. To estimate hazard at the NPP site, ten Ground-Motion Prediction Equations (GMPEs) valid for the study area are considered. These GMPEs are ranked based on Log-Likelihood (LLH) values. Top five GMPEs are considered to estimate the peak ground acceleration (PGA) for the site. Maximum PGA is obtained from three faults and named as vulnerable sources to decide the magnitudes of OBE and SSE. The average and normalized site specific response spectrum is prepared considering three vulnerable sources and further used to establish site-specific design spectrum at NPP site.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Quick, Decentralized, Energy-Efficient One-Shot Max Function Computation Using Timer-Based Selection

In several wireless sensor networks, it is of interest to determine the maximum of the sensor readings and identify the sensor responsible for it. We propose a novel, decentralized, scalable, energy-efficient, timer-based, one-shot max function computation (TMC) algorithm. In it, the sensor nodes do not transmit their readings in a centrally pre-defined sequence. Instead, the nodes are grouped into clusters, and computation occurs over two contention stages. First, the nodes in each cluster contend with each other using the timer scheme to transmit their reading to their cluster-heads. Thereafter, the cluster-heads use the timer scheme to transmit the highest sensor reading in their cluster to the fusion node. One new challenge is that the use of the timer scheme leads to collisions, which can make the algorithm fail. We optimize the algorithm to minimize the average time required to determine the maximum subject to a constraint on the probability that it fails to find the maximum. TMC significantly lowers average function computation time, average number of transmissions, and average energy consumption compared to approaches proposed in the literature.

Efecto de labranza, distancia de siembra y control de malezas sobre la cenosis, crecimiento, desarrollo y rendimiento de la soya (Glycine max (L) Merr.)

Se realizó un estudio de labranzas, distancias de siembra y métodos de control de malezas en soya (Glycine (L) Merr.) de la variedad -"Tropical" en la hacienda Las Mercedes, Managua, Nicaragua. Con los objetivos de evaluar lo influencia de las labranzas, distancias de siembra y control de malezas sobre el comportamiento de la cenosis en el crecimiento, desarrollo y rendimiento del cultivo de le soya. La siembra se realizó el 25 de Agosto de 1989, utilizándose un arreglo trifactorial, siendo los factores en estudio A: Labranza convencional y mínima; 8. Distancia de siembra entre hileras de 40 y 60 cm y C. Métodos de control de malezas, metribuzin, fluazifop-butil y limpias periódicas. Los resultados fueron evaluados mediante el análisis de Varianza y prueba de Tukey al 5 por ciento. Los mejores rendimientos se obtuvieron con los tratamientos labranza convencional, distancia entre hileras de 60 cm. La más baja diversidad de malezas se presentó en labranza convencional y en el control con metribuzin. Le menor abundancia se presentó con limpias periódicas, labranza mínima y distancia entre hileras de 40 cm. La menor cobertura se demuestra en labranza mínima, distancia entre hileras de 60 cm y control con limpias periódicas.

Influencia de rotación de cultivos y control de malezas sobre la cenosis, el crecimiento, desarrollo y rendimiento del cultivo de sorgo (Sorghum bicolor (L) Moench) y del cultivo de soya (Glycine max (L) Merr) cv. cristalina

En el presente trabajo se trabajó la influencia de tres métodos de control de malezas en cinco rotaciones de cultivos sobre la dinámica de asociaciones de malezas y el crecimiento y desarrollo de los cultivos. El ensayo se inició en postrera en 1992 en la Cooperativa Rigoberto López Pérez, Managua, considerando en este trabajo los resultados de la siembra de primera de 1992, se evaluó las rotaciones Sorgo-Sorgo, Maíz-Sorgo, Maíz-Soya, Pepino-Saya y Pepino-Sorgo y los métodos de control químico, control período crítico y control limpia periódica. Los resultados demuestran que el control limpia periódica efectuó un control satisfactorio de las malezas, mientras que los controles químico y por período crítico fueron insuficientes, debido a que predominaban las especies de monocotiledóneas como: cenchrus spp y panicum hurtícaule de Competitividad alargada. Las rotaciones influyen sobre el nivel de enmalezamiento, siendo más bajo en las Rotaciones Pepino-Sorgo y en las Rotaciones Pepino-Saya que en las demás rotaciones. En cuanto al rendimiento los mejores resultados se obtuvieron en la Rotación Pepino-Sorgo con 3,560.33 kg/Ha, (tres mil quinientos sesenta punto treinta y tres kilogramos por hectárea) de Sorgo y Maíz-Soya con 1,484.9 kg/Ha, (un mil cuatrocientos ochenta y cuatro punto nueve kilogramos por hectárea) de Soya debido a que el cultivo ejerció un mayor control sobre las malezas.

Efectos de rotación de cultivos y control de malezas sobre la cenosis de malezas, crecimiento, desarrollo y rendimiento en soya (Glycine max (L) Merril) y ajonjolí (Sesamum indicum L)

El presente estudio se estableció en terrenos de la cooperativa "Rubén Duarte", en el ciclo de postrera del año 1991, del 30 de Agosto al 12 de Diciembre, con los siguientes objetivos: evaluar el efecto de la rotación de cultivos sobre la cenosis de malezas, crecimiento, desarrollo y rendimiento en los cultivos de soya (Glycine max (L.) Herr.) CV. "Cristalina" y ajonjolí (Sesamun indicum" L.) CV. "China roja"; así como determinar el mejor método de control de malezas y los cultivos más idóneos para realizar la rotación. Las rotaciones evaluadas fueron: maíz-ajonjolí, sorgo-ajonjolí, maíz-soya y sorgo-soya. Los métodos de control: químico (Fomesafén en soya y Fusilade en ajonjolí, dosis 1 1/ha post-emergente), control por período crítico (limpia con azadón en los estadios V3-V4 de soya y 6ta hoja en ajonjolí), control limpia periódica (limpia con azadón a los 21 y 31 DDS). El diseño utilizado fue parcelas divididas con arreglo en bloques completos al azar (BCA). En parcelas grandes se establecieron las rotaciones y en parcelas pequeñas los métodos de control. Las variables evaluadas fueron: abundancia, dominancia y diversidad en las malezas y en los cultivos: altura, número de hojas y/o ramas, caracteres morfológicos, rendimiento y sus componentes. En base a los análisis estadísticos y descriptivos realizados se concluyó en lo siguiente: existe disminución del crecimiento de malezas como consecuencia de la rotación de cultivos. El mejor método de control de malezas lo constituye limpia periódica y las rotaciones más indicadas son: maíz-soya y maíz-ajonjolí.

Efectos de rotación de cultivos y métodos de control de malezas sobre la cenosis de malezas y el crecimiento, desarrollo y rendimiento en los cultivos soya (Glycine max (L) Merril) y ajonjolí (Sesamum indicum L)

El ensayo de campo tiene como objetivo: determinar el efecto de rotación de cultivos y control de malezas sobre la cenosis de las malezas y sobre el crecimiento, desarrollo y rendimiento de los cultivos de soya y ajonjolí. Se realizó en el centro Experimental del Algodón (C.E.A.), Posoltega en primera de 1992. El diseño utilizado fue Parcelas Divididas en Bloques al Azar, utilizando la variedad Cristalina en soya y Turen en ajonjolí. La mayor abundancia inicial de las malezas entre las diferentes rotaciones se dio en la rotación algodón-soya inoculado, debido al predominio de malezas perennes y al crecimiento inicial lento de la soya inoculada. El control limpia periódica es el más eficiente, obteniéndose una menor abundancia final de malezas. Las malezas de mayor abundancia son las Monocotiledóneas, sobre todo las Poaceas, siendo notoria la baja presencia de Cyperus rotundus. La mayor biomasa se obtuvo en la rotación algodón-ajonjolí y en las rotaciones son soya sin inocular. La mayor diversidad de especies se obtuvo en la rotación algodón-ajonjolí (11 especies) y la rotación algodón-soya sin inocular obtuvo la menor diversidad (5 especies). El mejor rendimiento de soya se obtuvo en las rotaciones donde le antecedió algodón con rendimiento hasta de 1,611.7kg/ha sobre 814.9kg/ha que fue el rendimiento máximo de los monocultivos de soya.