It has been conjectured that the vortex solution on a D-brane anti-D-brane system represents a D-brane of two lower dimension. We establish this result by first identifying a series of marginal deformations which create the vortex antivortex pair on the brane antibrane system, and then showing that under this series of marginal deformations the original D-brane anti-D-brane system becomes a D-b...

We investigate the pair-splitting number spair which is a variation of splitting number, pair-reaping number rpair which is a variation of reaping number and cardinal invariants of ideals on ω. We also study cardinal invariants of Fσ ideals and their upper bounds and lower bounds. As an application, we answer a question of S. Solecki by showing that the ideal of finitely chromatic graphs is not...

This paper is concerned with the best proximity pair problem in Hilbert spaces. Given two subsets $A$ and $B$ of a Hilbert space $H$ and the set-valued maps $F:A o 2^ B$ and $G:A_0 o 2^{A_0}$, where $A_0={xin A: |x-y|=d(A,B)~~~mbox{for some}~~~ yin B}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in A$ such that $$d(G(x_0),F(x_0))=d(A,B).$$

the solubility of kno3 in the mixed solvent (water 85%+methanol 15%) were determined by using solvent evaporating method at different temperatures (25, 30, 40, 50, 60 ;c). in addition the equilibrium constant of ion pair formation, kip, for k+no3 – ion-pair on the basis of fuoss contact ion pair model was calculated. upon choosing the extended debye-hückel model for estimating the mean activity...

RÉSUMÉ. Les systèmes pair-à-pair (P2P) se sont imposés ces dernières années comme la technologie majeure d’accès à différentes ressources sur Internet. De nombreuses recherche concernant la sélection des meilleurs pairs contenant les données appropriées à une requête,ont émergé et constituent un axe de recherche très actif. L’efficacité de la recherche dans ces systèmes, et surtout le cas non s...

c l a s s M C A b s t r a c t O b j e c t { p u b l i c : / / D o a l o c a l m o n t e c a r l o s t e p . / / R e t u r n t r u e i f t h e s t e p w a s a c c e p t e d , f a l s e o t h e r w i s e . v i r t u a l b o o l s t e p ( ) = 0 ; } ; / / A b s t r a c t b a s e c l a s s f o r M C r u n s . c l a s s M C A b s t r a c t R u n { t y p e d e f v e c t o r < M C A b s t r a c t O b j...

We present the Pair Attribute Learning (PAL) algorithm for the selection of relevant inputs and network topology. Correlations on training instance pairs are used to drive network construction of a single-hidden layer MLP. Results on nine learning problems demonstrate 70% less complexity, on average, without a significant loss of accuracy.

Multiple interrogatives like (1a) readily admit paired answers like (1b). That answers to (2a) and (3a) also pair values for two wh-expressions instead of one has therefore been taken as evidence that two whs have matrix scope. In the case of (2a) the wh-in-situ thought to have wide scope is inside a wh-complement; in the case of (3a) it is inside an adjunct. Wh-in-situ, it would appear, can ta...

In this paper‎, ‎we first present some properties of lower and upper central series of pair of groups‎. ‎Then the notion of $n$-isoclinism for the classification of pairs of groups is introduced‎, ‎and some of the structural properties of the created classes are proved‎. ‎Moreover some interesting theorems such as Baer Theorem‎, ‎Bioch Theorem‎, ‎Hirsh Theorem for pair of groups are generalized...