Temporal Changes in a Tropical Nekton Assemblage and Performance of a Prawn Selective Gear

The temporal variation of components of a moderately diverse (H=1.46) tropical estuarine fish assemblage (long. 146°30'E, lat. 8°45'S) was directed by salinities that had been determined by local oceanographic and probably topographic conditions. For this assemblage, two types of intrayear component profiles are predicted. Pooled data (1988-91) reveal a large component of regular/resident species (43%) in an assemblage which has been under a narrow temperature regime «5T). These results facilitate a discussion on the relevance and usefulness of three hypotheses often cited in studies concerning species diversity and component characteristics of the subtropical/tropical coastal nonreef fish assemblages. Manifestations of the assemblage are reflected in catch composition and weights of 39 trials conducted for a selective prawning gear whose performance in bycatch reduction, mainly for finfishes, is judged by an index, E, we have previously proposed. This gear is capable of harvesting the prawn while conserving the demersal fish. Behavioral responses to netting of the prawns and the finfishes, especially the nearshore surface schoolers such as leiognathids, are discussed from several points of view. An adaptation in terms of group selection for leiognathids of their locking mechanism of median fin spines has been interpreted. For the purpose of bycatch reduction or E enhancement, suggestions for improvements in net design and trawl configuration by considering the behavioral features of fish are made. Our original formula of E is modified for general use. Bycatch problems in the regional prawn fisheries and their possible impacts on fishery planning and development in Papua New Guinea as a developing country are discussed. The gear tested may offer enormous ecological and economic benefits. The gear is multipurpose, extremely simple, and can also be used as a biological sampler

Theory of spin Hall magnetoresistance

We present a theory of the spin Hall magnetoresistance (SMR) in multilayers made from an insulating ferromagnet F, such as yttrium iron garnet (YIG), and a normal metal N with spin-orbit interactions, such as platinum (Pt). The SMR is induced by the simultaneous action of spin Hall and inverse spin Hall effects and therefore a non-equilibrium proximity phenomenon. We compute the SMR in F$|$N and F$|$N$|$F layered systems, treating N by spin-diffusion theory with quantum mechanical boundary conditions at the interfaces in terms of the spin-mixing conductance. Our results explain the experimentally observed spin Hall magnetoresistance in N$|$F bilayers. For F$|$N$|$F spin valves we predict an enhanced SMR amplitude when magnetizations are collinear. The SMR and the spin-transfer torques in these trilayers can be controlled by the magnetic configuration

Time evolution in the Morse potential using supersymmetry: dissociation of the NO molecule

We present an algebraic method for treating molecular vibrations in the Morse potential perturbed by an external laser field. By the help of a complete and normalizable basis we transform the Schr\"{o}dinger equation into a system of coupled ordinary differential equations. We apply our method to calculate the dissociation probability of the NO molecule excited by chirped laser pulses. The dependence of the molecular dipole-moment on the interatomic separation is determined by a quantum-chemical method, and the corresponding transition dipole moments are given by approximate analytic expressions. These turn out to be very small between neighboring stationary states around the vibrational quantum number $m=42$, therefore we propose to use additional pulses in order to skip this trapping state, and to obtain a reasonable dissociation probability.Comment: 4 pages, 3 figure

B\"{a}cklund transformations for the constrained dispersionless hierarchies and dispersionless hierarchies with self-consistent sources

The B\"{a}cklund transformations between the constrained dispersionless KP hierarchy (cdKPH) and the constrained dispersionless mKP hieararchy (cdmKPH) and between the dispersionless KP hieararchy with self-consistent sources (dKPHSCS) and the dispersionless mKP hieararchy with self-consistent sources (dmKPHSCS) are constructed. The auto-B\"{a}cklund transformations for the cdmKPH and for the dmKPHSCS are also formulated.Comment: 11 page

Safe Open-Nested Transactions Through Ownership

Researchers in transactional memory (TM) have proposed open nesting asa methodology for increasing the concurrency of a program. The ideais to ignore certain "low-level" memory operations of anopen-nested transaction when detecting conflicts for its parenttransaction, and instead perform abstract concurrency control for the"high-level" operation that nested transaction represents. Tosupport this methodology, TM systems use an open-nested commitmechanism that commits all changes performed by an open-nestedtransaction directly to memory, thereby avoiding low-levelconflicts. Unfortunately, because the TM runtime is unaware of thedifferent levels of memory, an unconstrained use of open-nestedcommits can lead to anomalous program behavior.In this paper, we describe a framework of ownership-awaretransactional memory which incorporates the notion of modules into theTM system and requires that transactions and data be associated withspecific transactional modules or Xmodules. We propose a newownership-aware commit mechanism, a hybrid between anopen-nested and closed-nested commit which commits a piece of datadifferently depending on whether the current Xmodule owns the data ornot. Moreover, we give a set of precise constraints on interactionsand sharing of data among the Xmodules based on familiar notions ofabstraction. We prove that ownership-aware TM has has cleanmemory-level semantics and can guarantee serializability bymodules, which is an adaptation of multilevel serializability fromdatabases to TM. In addition, we describe how a programmer canspecify Xmodules and ownership in a Java-like language. Our typesystem can enforce most of the constraints required by ownership-awareTM statically, and can enforce the remaining constraints dynamically.Finally, we prove that if transactions in the process of aborting obeyrestrictions on their memory footprint, the OAT model is free fromsemantic deadlock

A survey of cost-sensitive decision tree induction algorithms

The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field

CSNL: A cost-sensitive non-linear decision tree algorithm

This article presents a new decision tree learning algorithm called CSNL that induces Cost-Sensitive Non-Linear decision trees. The algorithm is based on the hypothesis that nonlinear decision nodes provide a better basis than axis-parallel decision nodes and utilizes discriminant analysis to construct nonlinear decision trees that take account of costs of misclassification. The performance of the algorithm is evaluated by applying it to seventeen datasets and the results are compared with those obtained by two well known cost-sensitive algorithms, ICET and MetaCost, which generate multiple trees to obtain some of the best results to date. The results show that CSNL performs at least as well, if not better than these algorithms, in more than twelve of the datasets and is considerably faster. The use of bagging with CSNL further enhances its performance showing the significant benefits of using nonlinear decision nodes. The performance of the algorithm is evaluated by applying it to seventeen data sets and the results are compared with those obtained by two well known cost-sensitive algorithms, ICET and MetaCost, which generate multiple trees to obtain some of the best results to date. The results show that CSNL performs at least as well, if not better than these algorithms, in more than twelve of the data sets and is considerably faster. The use of bagging with CSNL further enhances its performance showing the significant benefits of using non-linear decision nodes

B\"{a}cklund transformations for the KP and mKP hierarchies with self-consistent sources

Using gauge transformations for the corresponding generating pseudo-differential operators $L^n$ in terms of eigenfunctions and adjoint eigenfunctions, we construct several types of auto-B\"{a}cklund transformations for the KP hierarchy with self-consistent sources (KPHSCS) and mKP hierarchy with self-consistent sources (mKPHSCS) respectively. The B\"{a}cklund transformations from the KPHSCS to mKPHSCS are also constructed in this way.Comment: 22 pages. to appear in J.Phys.