A geometric characterization of the upper bound for the span of the jones polynomial

Let D be a link diagram with n crossings, sA and sB be its extreme states and |sAD| (respectively, |sBD|) be the number of simple closed curves that appear when smoothing D according to sA (respectively, sB). We give a general formula for the sum |sAD| + |sBD| for a k-almost alternating diagram D, for any k, characterizing this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, yielding |sAD| + |sBD| = n + 2 - 2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu [On Kauffman brackets, J. Knot Theory Ramifications6(1) (1997) 125–148.]. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al. [Almost alternating links, Topology Appl.46(2) (1992) 151–165.], is obtained as a corollary. As a new application, we prove that the Turaev genus is equal to the number k of dealternator crossings for any dealternator connected diagram

Lower bound cost estimation for logic programs

It is generally recognized that information about the runtime cost of computations can be useful for a variety of applications, including program transformation, granularity control during parallel execution, and query optimization in deductive databases. Most of the work to date on compile-time cost estimation of logic programs has focused on the estimation of upper bounds on costs. However, in many applications, such as parallel implementations on distributed-memory machines, one would prefer to work with lower bounds instead. The problem with estimating lower bounds is that in general, it is necessary to account for the possibility of failure of head unification, leading to a trivial lower bound of 0. In this paper, we show how, given type and mode information about procedures in a logic program, it is possible to (semi-automatically) derive nontrivial lower bounds on their computational costs. We also discuss the cost analysis for the special and frequent case of divide-and-conquer programs and show how —as a pragmatic short-term solution —it may be possible to obtain useful results simply by identifying and treating divide-and-conquer programs specially.

B-LOG: A branch and bound methodology for the parallel execution of logic programs

We propose a computational methodology -"B-LOG"-, which offers the potential for an effective implementation of Logic Programming in a parallel computer. We also propose a weighting scheme to guide the search process through the graph and we apply the concepts of parallel "branch and bound" algorithms in order to perform a "best-first" search using an information theoretic bound. The concept of "session" is used to speed up the search process in a succession of similar queries. Within a session, we strongly modify the bounds in a local database, while bounds kept in a global database are weakly modified to provide a better initial condition for other sessions. We also propose an implementation scheme based on a database machine using "semantic paging", and the "B-LOG processor" based on a scoreboard driven controller.

Virtual-bound, filamentary and layered states in a box-shaped quantum dot of square potential form the exact numerical solution of the effective mass Schrodinger equation

The effective mass Schrodinger equation of a QD of parallelepipedic shape with a square potential well is solved by diagonalizing the exact Hamiltonian matrix developed in a basis of separation-of-variables wavefunctions. The expected below bandgap bound states are found not to differ very much from the former approximate calculations. In addition, the presence of bound states within the conduction band is confirmed. Furthermore, filamentary states bounded in two dimensions and extended in one dimension and layered states with only one dimension bounded, all within the conduction band which are similar to those originated in quantum wires and quantum wells coexist with the ordinary continuum spectrum of plane waves. All these subtleties are absent in spherically shaped quantum dots, often used for modeling.

The major allergens of birch pollen and cow milk, Bet v 1 and Bos d 5, are structurally related to human licocalin 2, enabling them to manipulate T-helper cells depending on their load with siderophore-bound iron

We conclude that Bet v 1 and Bos d 5 not only structurally mimic human LCN2, but also functionally by their ability to bind iron via siderophores. The apo-forms promote Th2 cells, whereas the holo-forms appear to be immunosuppressive. These results provide for the first time a functional understanding on the principle of allergenicity of major allergens from entirely independent sources, like birch and milk.

Light-activated rhodopsin induces structural binding motif in G protein α subunit

A large superfamily of transmembrane receptors control cellular responses to diverse extracellular signals by catalyzing activation of specific types of heterotrimeric GTP-binding proteins. How these receptors recognize and promote nucleotide exchange on G protein α subunits to initiate signal amplification is unknown. The three-dimensional structure of the transducin (Gt) α subunit C-terminal undecapeptide Gtα(340–350) IKENLKDCGLF was determined by transferred nuclear Overhauser effect spectroscopy while it was bound to photoexcited rhodopsin. Light activation of rhodopsin causes a dramatic shift from a disordered conformation of Gtα(340–350) to a binding motif with a helical turn followed by an open reverse turn centered at Gly-348, a helix-terminating C capping motif of an αL type. Docking of the NMR structure to the GDP-bound x-ray structure of Gt reveals that photoexcited rhodopsin promotes the formation of a continuous helix over residues 325–346 terminated by the C-terminal helical cap with a unique cluster of crucial hydrophobic side chains. A molecular mechanism by which activated receptors can control G proteins through reversible conformational changes at the receptor–G protein interface is demonstrated.

Membrane-bound state of the colicin E1 channel domain as an extended two-dimensional helical array

Atomic level structures have been determined for the soluble forms of several colicins and toxins, but the structural changes that occur after membrane binding have not been well characterized. Changes occurring in the transition from the soluble to membrane-bound state of the C-terminal 190-residue channel polypeptide of colicin E1 (P190) bound to anionic membranes are described. In the membrane-bound state, the α-helical content increases from 60–64% to 80–90%, with a concomitant increase in the average length of the helical segments from 12 to 16 or 17 residues, close to the length required to span the membrane bilayer in the open channel state. The average distance between helical segments is increased and interhelix interactions are weakened, as shown by a major loss of tertiary structure interactions, decreased efficiency of fluorescence resonance energy transfer from an energy donor on helix V of P190 to an acceptor on helix IX, and decreased resonance energy transfer at higher temperatures, not observed in soluble P190, implying freedom of motion of helical segments. Weaker interactions are also shown by a calorimetric thermal transition of low cooperativity, and the extended nature of the helical array is shown by a 3- to 4-fold increase in the average area subtended per molecule to 4,200 Å2 on the membrane surface. The latter, with analysis of the heat capacity changes, implies the absence of a developed hydrophobic core in the membrane-bound P190. The membrane interfacial layer thus serves to promote formation of a highly helical extended two-dimensional flexible net. The properties of the membrane-bound state of the colicin channel domain (i.e., hydrophobic anchor, lengthened and loosely coupled α-helices, and close association with the membrane interfacial layer) are plausible structural features for the state that is a prerequisite for voltage gating, formation of transmembrane helices, and channel opening.