印度东海岸Coringa红树林生态系统退化研究

沿海地带的红树林对生态和环境具有极其重要的价值，但为了发展经济，人们正无意识地破坏着红树林资源，淡水资源的过度抽取以及渔业、水产业和工业的盲目开发，人类居住区的扩张及废物排放等造成红树林资源的大面积剧减，因此，当前对红树林作用的科学认识是保护热带红树林生态系统的关键，为了确定Coringa红树林生态系统退化的原因，笔记通过在研究区野外调查和与当前居民交流获得不同土地利用类型，农作物种植成分，社区基本需求及其它可获得性的资料，分析了影响Coringa红树林生态系统的几个因素如土地利用类型，农作物种植成分及其导致的生态平衡破坏，最后提出了一些解决生态经济和可持续利用红树林资源的方法。     

Similarity in karyotypes ofRattus rattus with 38 chromosomes from India and other parts of the world

Zusammenfassung Chromosomen von 12 Männchen und 12 Weibchen vonRattus rattus wroughtoni sowie 2 Weibchen vonRattus rattus wurden untersucht und es wurden überall 38 Chromosomen gefunden, verursacht durch Robertsonische Verbindung von 4 akrozentischen Paaren vonRattus rattus mit 42 Chromosomen.

---

---

Authors respectfully thank their teacher Prof.S. P. Ray-Chaudhuri for constant encouragement. The financial assistance provided by University Grants Commission, India, is also gratefully acknowledged.     

Improving End User Behaviour in Password Utilization: An Action Research Initiative

This paper is about the design and implementation of techniques and strategies to improve end user behavior in the utilization of passwords within a formal setting. The researchers were requested to investigate the issues inherent in the password management and utilization procedure within the client organization and thereby improve end user behavior in utilization of passwords within the organization. The researchers completed an action research study and successfully implemented a training program to improve system users’ behavior related to passwords. They used a unique approach by designing training for creating passwords to fit with theories pertaining to human memory. In addition, the researchers also created and delivered security awareness training. The end users of the target information systems reported that after training they were able to use strong passwords (A strong password in our organization is one that has 15 characters with at least two numbers and one symbol) without writing them down. Requests to the help desk for password resets decreased. Users also reported that they are much more aware of security threats.

The Membrane Protein Data Bank

The Membrane Protein Data Bank (MPDB) is an online, searchable, relational database of structural and functional information on integral, anchored and peripheral membrane proteins and peptides. Data originates from the Protein Data Bank and other databases, and from the literature. Structures are based on X-ray and electron diffraction, nuclear magnetic resonance and cryoelectron microscopy. The MPDB is searchable online by protein characteristic, structure determination method, crystallization technique, detergent, temperature, pH, author, etc. Record entries are hyperlinked to the PDB and Pfam for viewing sequence, three-dimensional structure and domain architecture, and for downloading coordinates. Links to PubMed are also provided. The MPDB is updated weekly in parallel with the Protein Data Bank. Statistical analysis of MPDB records can be performed and viewed online. A summary of the statistics as applied to entries in the MPDB is presented. The data suggest conditions appropriate for crystallization trials with novel membrane proteins. Received 3 August 2005; received after revision 18 September 2005; accepted 26 September 2005 This paper and the Membrane Protein Data Bank celebrate the 20^th anniversary of the landmark paper in Nature (1985, 318: 618–624) describing the first ‘high-resolution’ three-dimensional structure of a membrane protein, the photosynthetic reaction center from Rhodopseudomonas (Blastochloris) viridis.     

Purkinje neuron synchrony elicits time-locked spiking in the cerebellar nuclei

An unusual feature of the cerebellar cortex is that its output neurons, Purkinje cells, release GABA (γ-aminobutyric acid). Their high intrinsic firing rates (50?Hz) and extensive convergence predict that their target neurons in the cerebellar nuclei would be largely inhibited unless Purkinje cells pause their spiking, yet Purkinje and nuclear neuron firing rates do not always vary inversely. One indication of how these synapses transmit information is that populations of Purkinje neurons synchronize their spikes during cerebellar behaviours. If nuclear neurons respond to Purkinje synchrony, they may encode signals from subsets of inhibitory inputs. Here we show in weanling and adult mice that nuclear neurons transmit the timing of synchronous Purkinje afferent spikes, owing to modest Purkinje-to-nuclear convergence ratios (～40:1), fast inhibitory postsynaptic current kinetics (τ(decay) = 2.5?ms) and high intrinsic firing rates (～90?Hz). In vitro, dynamically clamped asynchronous inhibitory postsynaptic potentials mimicking Purkinje afferents suppress nuclear cell spiking, whereas synchronous inhibitory postsynaptic potentials entrain nuclear cell spiking. With partial synchrony, nuclear neurons time-lock their spikes to the synchronous subpopulation of inputs, even when only 2 out of 40 afferents synchronize. In vivo, nuclear neurons reliably phase-lock to regular trains of molecular layer stimulation. Thus, cerebellar nuclear neurons can preferentially relay the spike timing of synchronized Purkinje cells to downstream premotor areas.     

Ergosterol synthesis in yeast under the action of nystatin

Zusammenfassung Nystatin erhöht den Ergosterolgehalt inSaccharomyces cerevisiae auch bei einer Konzentration, die nur 10 prozentige Wachstumshemmung bewirkt.     

Parameter Ecology for Feedback Vertex Set

This paper deals with the FEEDBACK VERTEX SET problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance,the problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of FEEDBACK VERTEX SET for a wide range of parameters.We survey known results and present several new complexity classifications. For example, we prove that FEEDBACK VERTEX SET is fixed-parameter tractable parameterized by the vertex-deletion distance to a chordal graph. We also prove that the problem admits a polynomial kernel when parameterized by the vertex-deletion distance to a pseudo forest, a graph in which every connected component has at most one cycle. In contrast, we prove that a slightly smaller parameterization does not allow for a polynomial kernel unless NP coNP=poly and the polynomial-time hierarchy collapses.