Petrography, Geochemistry and Diagenesis of Coral Deposits of Kavaratti and Minicoy Islands, Lakshadweep, India

In the present thesis the petrographic, geochemical and digenetic variability of the sediments in the islands of Kavaratti and Minicoy has been investigated .The beach profile studies show that in the Kavaratti lagoon beach, the slope is steeper in the southern and south central part than in the northern end’s marginal deposition is taking place in the northern end of the Kavaratti island, whereas a marginal erosion is observed at the southern end. In Minicoy the slope of the lagoon beach is gentle in the south and is slightly steeper at the northern part of the beach. The southern and northern beach sections show a marginal deposition. Based on the mineralogical and geochemical studies it is concluded that the main digenetic changes observed is the transformation of aragonite to LMC.The transformation takes place mainly in the vadose zone and is caused by the abundance of fresh water infiltration.

Comparative Studies on the Abundance of Zooplankton in the Surrounding Sea & Lagoons in the Lakshadweep

Composition and distribution of various groups and species of zooplankton at Kavaratti, Agatti and Suhelipar atolls of the Lakshadweep group of islands are reported . Higher biomass and diversity occur in the sea surrounding atolls compared to lagoons . Copepoda forms the dominant component of zooplankton . Zooplankton washed across the reef into the lagoon may be serving as food to the reef community . No fauna endemic to lagoons are encountered.

Complexity quantification of dense array EEG using sample entropy analysis

n this paper, a time series complexity analysis of dense array electroencephalogram signals is carried out using the recently introduced Sample Entropy (SampEn) measure. This statistic quantifies the regularity in signals recorded from systems that can vary from the purely deterministic to purely stochastic realm. The present analysis is conducted with an objective of gaining insight into complexity variations related to changing brain dynamics for EEG recorded from the three cases of passive, eyes closed condition, a mental arithmetic task and the same mental task carried out after a physical exertion task. It is observed that the statistic is a robust quantifier of complexity suited for short physiological signals such as the EEG and it points to the specific brain regions that exhibit lowered complexity during the mental task state as compared to a passive, relaxed state. In the case of mental tasks carried out before and after the performance of a physical exercise, the statistic can detect the variations brought in by the intermediate fatigue inducing exercise period. This enhances its utility in detecting subtle changes in the brain state that can find wider scope for applications in EEG based brain studies.

Molecular Characterisation and Phylogenetic Analysis of a Novel Isoform of Hepatic Antimicrobial Peptide, Hepcidin (Zc-hepc1), from the Coral Fish Moorish idol, Zanclus cornutus (Linnaeus,1758)

Hepcidin is a family of short cysteine-rich antimicrobial peptides (AMPs) participating in various physiological functions with inevitable role in host immune responses. Present study deals with identification and characterisation of a novel hepcidin isoform from coral fish Zanclus cornutus. The 81 amino acid (aa) preprohepcidin obtained from Z. cornutus consists of a hydrophobic aa rich 22 mer signal peptide, a highly variable proregion of 35 aa and a bioactive mature peptide with 8 conserved cysteine residues which contribute to the disulphide back bone. The mature hepcidin, Zc-hepc1 has a theoretical isoelectric point of 7.46, a predicted molecular weight of 2.43 kDa and a net positive charge of ?1. Phylogenetic analysis grouped Z. cornutus hepcidin with HAMP2 group hepcidins confirming the divergent evolution of hepcidin-like peptide in fishes. Zc-hepc1 can attain a b-hairpin-like structure with two antiparallel b-sheets. This is the first report of an AMP from the coral fish Z. cornutus.

On the Gap-Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. All types of restarting automata considered in the literature up to now accept at least the deterministic context-free languages. Here we introduce and study a new type of restarting automaton, the so-called t-RL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size one only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-RL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-RL-automata with an unbounded number of gaps accept NP-complete languages.

On the Descriptional Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. We focus on the descriptional complexity of these automata, establishing two complexity measures that are both based on the description of t-sRL-automata in terms of so-called meta-instructions. We present some hierarchy results as well as a non-recursive trade-off between deterministic 2-sRL-automata and finite-state acceptors.

Formación coral : guía didáctica.

Guía didáctica que pone a disposición de los alumnos de magisterio de la UMU el material básico para la asignatura de formación coral. Consta de dos partes: una teórica y otra de repertorio. La primera incluye seis temas sobre voz, canto en la escuela, formación de coros, dirección coral, armonía y contrapunto. En la segunda se incluye una selección de obras polifónicas.

The Informational Complexity of Learning from Examples

This thesis attempts to quantify the amount of information needed to learn certain tasks. The tasks chosen vary from learning functions in a Sobolev space using radial basis function networks to learning grammars in the principles and parameters framework of modern linguistic theory. These problems are analyzed from the perspective of computational learning theory and certain unifying perspectives emerge.

Complexity of Human Language Comprehension

The goal of this article is to reveal the computational structure of modern principle-and-parameter (Chomskian) linguistic theories: what computational problems do these informal theories pose, and what is the underlying structure of those computations? To do this, I analyze the computational complexity of human language comprehension: what linguistic representation is assigned to a given sound? This problem is factored into smaller, interrelated (but independently statable) problems. For example, in order to understand a given sound, the listener must assign a phonetic form to the sound; determine the morphemes that compose the words in the sound; and calculate the linguistic antecedent of every pronoun in the utterance. I prove that these and other subproblems are all NP-hard, and that language comprehension is itself PSPACE-hard.

The Complexity of Safety Stock Placement in General-Network Supply Chains

We consider the optimization problem of safety stock placement in a supply chain, as formulated in [1]. We prove that this problem is NP-Hard for supply chains modeled as general acyclic networks. Thus, we do not expect to find a polynomial-time algorithm for safety stock placement for a general-network supply chain.

W3233 -- Networks and Complexity in Social Systems (Collective Dynamics Group ISERP -- Columbia University) Course Syllabus

The Networks and Complexity in Social Systems course commences with an overview of the nascent field of complex networks, dividing it into three related but distinct strands: Statistical description of large scale networks, viewed as static objects; the dynamic evolution of networks, where now the structure of the network is understood in terms of a growth process; and dynamical processes that take place on fixed networks; that is, "networked dynamical systems". (A fourth area of potential research ties all the previous three strands together under the rubric of co-evolution of networks and dynamics, but very little research has been done in this vein and so it is omitted.) The remainder of the course treats each of the three strands in greater detail, introducing technical knowledge as required, summarizing the research papers that have introduced the principal ideas, and pointing out directions for future development. With regard to networked dynamical systems, the course treats in detail the more specific topic of information propagation in networks, in part because this topic is of great relevance to social science, and in part because it has received the most attention in the literature to date.

Algorithmic Complexity and Computability

High-level introduction for web science students, rather than for computer science students.

When management encounters complexity

.

Cant coral i educació vocal. 'Canto coral y educación vocal'.

Crédito para ESO del área de Música. Trata sobre el canto coral y la educación vocal (a capela). Desarrolla una unidad didáctica consistente en un repertorio de cantos cuyo objetivo consiste en el adiestramiento en diferentes técnicas vocales: respiración, fonación, colocación de vocales, posición de la articulación en el texto o proyección de la voz. El objetivo es valorar la voz como primera herramienta musical, leer correctamente un texto de música vocal y aplicar las técnicas adecuadas para ello.