Reelin is a key mediator of ordered neuronal alignment in the brain. Here, we demonstrate that Reelin molecules assemble with each other to form a huge protein complex both in vitro and in vivo. The Reelin-Reelin interaction clearly is inhibited by the function-blocking anti-Reelin antibody, CR-50, at a concentration known to inhibit Reelin function. This assembly is mediated by electrostatic i...

Contact resonance atomic force microscopy (CR-AFM) methods currently utilize the eigenvalues, or resonant frequencies, of an AFM cantilever in contact with a surface to quantify local mechanical properties. However, the cantilever eigenmodes, or vibrational shapes, also depend strongly on tip-sample contact stiffness. In this paper, we evaluate the potential of eigenmode measurements for improv...

The low-density-lipoprotein-receptor (LDLR)-related protein (LRP) is composed of several classes of domains, including complement-type repeats (CR), which occur in clusters that contain binding sites for a multitude of different ligands. Each approximately 40-residue CR domain contains three conserved disulphide linkages and an octahedral Ca(2+) cage. LRP is a scavenging receptor for ligands fr...

A series of ten ferrocenyl, furyl, and thienyl mono- and biscarbene chromium(0) complexes were synthesized and characterized spectroscopically and electrochemically. The single crystal structure of the biscarbene complex [(CO)5Cr═C(OEt)-Fu'-(OEt)C═Cr(CO)5] (4a) was determined: C20H12Cr2O13; triclinic; P1; a = 6.2838(5), b = 12.6526(9), c = 29.1888(19) Å, α = 89.575(2), β = 88.030(2), γ = 87.423...

This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum...

We present CR-Prolog , an extension of CR-Prolog with an improved semantics, and allowing ordered disjunction in the head of both regular rules and consistency-restoring rules. The new semantics yields intuitive conclusions in cases when CR-Prolog would give unintuitive results. The use of ordered disjunction often allows for a more concise, easier to read, representation of knowledge. We also ...

We begin with the following question: given a closed disc D ⋐ C and a complex-valued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? When F ∈ C 1 (D), this question is complicated by the presence of points in the surface S := graph D (F) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of co...

We begin with the following question: given a closed disc D ⋐ C and a complex-valued function F ∈ C(D), is the uniform algebra on D generated by z and F equal to C(D) ? This question is complicated by the presence of points in the surface S := graph D (F) that have complex tangents. Such points are called CR singularities. Let p ∈ S be a CR singularity at which the order of contact of the tange...