Radiative decays,photoproduction and total cross section of theψ particles

It is pointed out that the coupling characterizing theψ-γ vertex must change substantially between the limits,ψ on mass-shell which occurs inψ→e ⁺ e ⁻ and photon on mass-shell which is relevant in radiative decays likeψ→ππγ, ψ→ηγ and photoproduction ofψ. This has the consequence that the value ofψN total cross section must be larger than what is inferred from the use of naive vector dominance in photoproduction.     

Extended connectivity in chemical graphs

The true nature of the extended connectivity, used in Morgan algorithm for the canonical numerotation of points in chemical graphs, is discussed. An alternative method for its calculation based on the number of walks is described and shown to yield results identical to Morgan's method.     

Investigation of scattering of elastic waves by cylinders in 1-3 piezocomposites

The scattering behavior of P-waves in piezoelectric composites with 1–3 connectivity is studied. The method of wave function expansion is adopted for the theoretical derivations. Analytical expressions are obtained for the distributions of mechanical displacement in z-direction along the circumferences of piezoelectric cylinders. These solutions are used to study the influence of each element of the stiffness matrix and the piezoelectric matrix on the various resonant modes of vibration. Numerical results obtained indicate that perturbations of the elements c₄₄ and e₁₅ significantly affect resonant frequencies and amplitudes, perturbations of c₁₁ and c₁₂ have pronounced effects on resonant modes of high frequencies also. However, the resonant modes are not so sensitive to the perturbations of c₁₃, e₃₁ and e₃₃. The dynamic characteristics of 1–3 connectivity piezoelectric composites exposed here are meaningful for the design and manufacture of sensor/actuator elements by this kind of composites as well as the on-line health monitoring of the mechanical properties variations of the composites itself.     

Finding 2-edge connected spanning subgraphs

This paper studies the NP-hard problem of finding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G=(V,E) finds a 2-ECSS of size at most |V|+(|E|−|V|)/(r−1). For r-regular, r-edge connected input graphs for r=3, 4, 5 and 6, this gives approximation guarantees of and , respectively.     

Investigating directed cortical interactions in time-resolved fMRI data using vector autoregressive modeling and Granger causality mapping

We present a framework aimed to reveal directed interactions of activated brain areas using time-resolved fMRI and vector autoregressive (VAR) modeling in the context of Granger causality. After describing the underlying mathematical concepts, we present simulations helping to characterize the conditions under which VAR modeling and Granger causality can reveal directed interactions from fluctuations in BOLD-like signal time courses. We apply the proposed approach to a dynamic sensorimotor mapping paradigm. In an event-related fMRI experiment, subjects performed a visuomotor mapping task for which the mapping of two stimuli (“faces” vs “houses”) to two responses (“left” or “right”) alternated periodically between the two possible mappings. Besides expected activity in sensory and motor areas, a fronto-parietal network was found to be active during presentation of a cue indicating a change in the stimulus-response (S-R) mapping. The observed network includes the superior parietal lobule and premotor areas. These areas might be involved in setting up and maintaining stimulus-response associations. The Granger causality analysis revealed a directed influence exerted by the left lateral prefrontal cortex and premotor areas on the left posterior parietal cortex.     

Bound on <Emphasis Type="Italic">m</Emphasis>-restricted Edge Connectivity

An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restrict edge connectivity λm is the cardinality of a minimum m-restricted edge cut. Let G be a connected k-regular graph of order at least 2m that contains m-restricted edge cuts and X be a subgraph of G. Let θ(X) denote the number of edges with one end in X and the other not in X and ξm=min{θ(X) ;X is a connected vertex-induced subgraph of order m}.It is proved in this paper that if G has girth at least m/2 2,then λm≤ξm.The upper bound of λm is sharp.     

An Adaptive Algorithm for Vector Partitioning

The vector partition problem concerns the partitioning of a set A of n vectors in d-space into p parts so as to maximize an objective function c which is convex on the sum of vectors in each part. Here all parameters d, p, n are considered variables. In this paper, we study the adjacency of vertices in the associated partition polytopes. Using our adjacency characterization for these polytopes, we are able to develop an adaptive algorithm for the vector partition problem that runs in time O(q(L)v) and in space O(L), where q is a polynomial function, L is the input size and v is the number of vertices of the associated partition polytope. It is based on an output-sensitive algorithm for enumerating all vertices of the partition polytope. Our adjacency characterization also implies a polynomial upper bound on the combinatorial diameter of partition polytopes. We also establish a partition polytope analogue of the lower bound theorem, indicating that the output-sensitive enumeration algorithm can be far superior to previously known algorithms that run in time polynomial in the size of the worst-case output.     

Disjoint Paths in Graphs III,Characterization

Let G be a graph, $ \{a, b, c\}\subseteq V(G) $, and $ \{a', b', c'\}\subseteq V(G) $ such that $ \{a, b, c\}\neq \{a', b', c'\} $. We say that $ (G, \{a, c\}, \{a', c'\}, (b, b')) $ is an obstruction if, for any three vertex disjoint paths from {a, b, c} to {a', b', c'} in G, one path is from b to b'. In this paper we characterize obstructions. As a consequence, we show that no obstruction can be 8-connected, unless b = b' or {a, c} = {a', c'}.AMS Subject Classification: 05C38.     

Maximal Classes of Topological Spaces and Domains Determined by Function Spaces

In this paper the question of what classes A of T ₀-spaces should be paired with classes of domains in order that all function spaces [AB] for AA and B are -compact domains is considered. It is shown that core compact spaces are paired with bounded complete domains and a class of topological spaces called RW-spaces (with finitely many components) is paired with the class of -compact pointed L-domains (L-domains).     

Hazard Evaluation of Ten Organophosphorus Insecticides Against the Midge,Chironomus riparius via QSAR

Abstract

Toxicities of ten organophosphorus (OP) insecticides were measured against midge larvae (Chironomus riparius) under varying temperature (11, 18, and 25°C) and pH (6, 7, and 8) conditions and with and without sediment. Toxicity usually increased with increasing temperature and was greater in the absence of sediment. No trend was found with varying pH. A series of unidimensional parameters and multidimensional models were used to describe the changes in toxicity. Log K _ow was able to explain about 40–60% of the variability in response data for aqueous exposures while molecular volume and aqueous solubility were less predictive. Likewise, the linear solvation energy relationship (LSER) model only explained 40–70% of the response variability, suggesting that factors other than solubility were most important for producing the observed response. Molecular connectivity was the most useful for describing the variability in the response. In the absence of sediment, ¹χ ^v and ³κ were best able to describe the variation in response among all compounds at each pH (70–90%). In the presence of sediment, even molecular connectivity could not describe the variability until the partitioning potential to sediment was accounted for by assuming equilibrium partitioning. After correcting for partitioning, the same molecular connectivity terms as in the aqueous exposures described most of the variability, 61–87%, except for the 11°C data where correlations were not significant. Molecular connectivity was a better tool than LSER or the unidimensional variables to explain the steric fitness of OP insecticides which was crucial to the toxicity.