Sandf la t s i n t h e pro tec ted Bodega Harbor a r e inhab i t ed by a d i v e r s e i n f a u n a l assemblage (over s p e c i e s ) c o n s i s t i n g predominantly of molluscs , chae tes and o t h e r worm-like animals , and crus taceans . Sediment g e n e r a l l y is w e l l s o r t e d , f i n e t o medium grained sand wi th smal l amounts of s i l t and c lay . Although r i p p l e s ...

Kv4 channels represent the main class of brain A-type K 1 channels that operate in the subthreshold range of membrane potentials (Serodio, P., E. Vega-Saenz de Miera, and B. Rudy. 1996. J. Neurophysiol. 75:2174– 2179), and their function depends critically on inactivation gating. A previous study suggested that the cytoplasmic NH 2 and COOH-terminal domains of Kv4.1 channels act in concert to d...

The exact Cagniard-de Hoop solut ions for a point dislocation in half-space are used to construct models of the strong ground motion observed during the February 9, 1971 San Fernando earthquake (PC, = 6.4). By summing point dislocations distr ibuted over the fault plane, three-dimensional models of a f inite fault located in a half-space are constructed to study the ground motions observed at J...

We present a software prototype for the communication between a mobile phone and a web-based process management system (WPMS). The communication between both is based on web services. The business process (in our example a booking process in the tourism domain) is controlled by the WPMS. The WPMS calls web services to achieve certain functionalities. The prototype allows starting a process by a...

Long-chain alkanethiols, HS(CH2)nX, adsorb from solut ion onto gold and form oriented. ordered monolayers. Monolayers exposing more than one functional group at the surface can be generated by coadsorption of t* 'o or more thiols from solut ion. In general, the rat io of the concentrat ion of the t\r 'o components in a mixed monolayer is not the same as in solut ion but ref lects the relat ive ...

A d d i t i v e AND/OR graphs are de f ined as AND/ /ORgraphs w i t hou t c i r c u i t s , which can be cons idered as fo lded AND/OR t r e e s ; i . e . the cost of a common subproblem is added to the cost as many t imes as the subproblem occurs , but i t is computed on ly once. A d d i t i v e AND/OR graphs are n a t u r a l l y obta ined by r e i n t e r p r e t i n g the dy namic programmi...