Itai and Rodeh [IR] have proved thal for any 2-conncctcd graph G and any vertex S E G there are two spanning trees such that the paths from any othcr vcrtex to s on the trees are disjoint. In this p,aper the result is generalized to 3-connected graphs. T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 46 2 19 87 -1

A brief review of the theory contributions presented in the EC-18 Workshop is given. The covered spectrum of topics is quite broad including the electron cyclotron wave propagation physics as well the results of numerical modelling of transport and current drive.

I survey the parameter space of NAHE-based free fermionic heterotic string models. First, I discuss flat directions of the low energy effective field theories and show that D-flat directions need not be isomorphic to gauge invariant superpotential terms. Next, I review recent studies of three generation SU(3)C × SU(2)L × U(1)Y , SU(3)C ×SU(2)L ×SU(2)R ×U(1)B−L, SU(4)C × SU(2)L ×U(1)Y ′ , and fl...

The conductor of n positive integer numbers a l,a2, ... ,an' whose greatest coII1mon divisor is equal'to I, is'defmed as the th.e minimal K, such that for every m ~K , the equation a1x 1+a2X 2+ ... +an Xn=m, h!ls a solution over the nOI}negative integers. In this notewe give a polYIlomial aigorithm computing'a close bound ~ for the conductor K o( n given positive integers, when n is fixed. The ...

This paper presents experimental results of a coverage analysis in a WCDMA network using the 850 MHz band; an urban electromagnetic propagation environment is considered. Obtained coverage estimation maps are based on Krige statistical method of interpolation. Key performance parameters used in this work are the CPICH and Ec. The results could be used to identify problems and help to optimize c...