A helical peptide containing a majority of valyl residues. The crystal structure of t-butyloxy- carbonyl-(L-valyl-_-aminoisobutyryl)3-L-valyl methyl ester onohydrate

The monohydrate of the heptapeptide t-butyloxycarbonyl-(L-valyl-α-aminoiso-butyryl)3-L-valyl methyl ester crystallizes in the orthorhombic space group P212121 with four molecules in a unit cell with the dimensions α= 9.375, b = 19.413 and c = 25.878 ÅA. The structure has been solved by direct methods and refined to an R value of 0.059 for 3633 observed reflections. The molecule in the structure exists as a slightly distorted 310-helix stabilized by five 4 -> 1 intramolecular hydrogen bonds, indicating the overwhelming influence of α-aminoisobutyryl (Aib) residues in dictating helical fold even when a majority of residues in the peptide have a low intrinsic propensity to be in helices. Contrary to what is expected in helical structures, the valyl side chains, two of which are disordered, exhibit all three possible conformations. The molecules arrange themselves in a head-to-tail fashion along the c-axis. The columns thus generated pack nearly hexagonally in the crystal.

Structural synthesis by transformation of binary chains Strukturelle synthese durch umwandlung binaerer ketten

The paper presents a general method of structural synthesis which can be used to derive all possible simple- and multiple-jointed chains of positive, zero or negative degree-of-freedom. In this method all possible chains with N links and F degrees-of-freedom are derived by the transformation of the corresponding “binary chains” with N binary links and F degrees-of-freedom. The method is illustrated by applying to the case of chains with degrees-of-freedom 1,2,0 and −1.

Solution of a Boundary-Value Problem associated with Diffraction of Water Waves by a Nearly Vertical Barrier

An exact solution is derived for a boundary-value problem for Laplace's equation which is a generalization of the one occurring in the course of solution of the problem of diffraction of surface water waves by a nearly vertical submerged barrier. The method of solution involves the use of complex function theory, the Schwarz reflection principle, and reduction to a system of two uncoupled Riemann-Hilbert problems. Known results, representing the reflection and transmission coefficients of the water wave problem involving a nearly vertical barrier, are derived in terms of the shape function.

Structure of bovine prothrombin fragment 1 refined at 2.25 Å resolution

The structure of bovine prothrombin fragment 1 has been refined at 2.25 Å resolution using high resolution measurements made with the synchrotron beam at CHESS. The synchrotron data were collected photographically by oscillation methods (R-merge = 0.08). These were combined with lower order diffractometer data for refinement purposes. The structure was refined using restrained least-squares methods with the program PROLSQ to a crystallographic R-value of 0.175. The structure includes 105 water molecules with occupancies of >0·6. The first 35 residues (Ala1-Leu35) of the N-terminal ?-carboxy glutamic acid-domain (Ala1-Cys48) of fragment 1 are disordered as are two carbohydrate chains of Mr ? 5000; the latter two combine to render 40% of the structure disordered. The folding of the kringle of fragment 1 is related to the close intramolecular contact between the inner loop disulfide groups. Half of the conserved sequence of the kringle forms an inner core surrounding these disulfide groups. The remainder of the sequence conservation is associated with the many turns of the main chain. The Pro95 residue of the kringle has a cis conformation and Tyr74 is ordered in fragment 1, although nuclear magnetic resonance studies indicate that the comparable residue of plasminogen kringle 4 has two positions. Surface accessibility calculations indicate that none of the disulfide groups of fragment 1 is accessible to solvent.

Protein Hydration and Water Structure: X-ray Analysis of a Closely Packed Protein Crystal with Very Low Solvent Content

Low-humidity monoclinic lysozyme, resulting from a water-mediated transformation, has one of the lowest solvent contents (22% by volume) observed in a protein crystal. Its structure has been solved by the molecular replacement method and refined to an R value of 0.175 for 7684 observed reflections in the 10–1.75 Å resolution shell. 90% of the solvent in the well ordered crystals could be located. Favourable sites of hydration on the protein surface include side chains with multiple hydrogen-bonding centres, and regions between short hydrophilic side chains and the main-chain CO or NH groups of the same or nearby residues. Major secondary structural features are not disrupted by hydration. However, the free CO groups at the C terminii and, to a lesser extent, the NH groups at the N terminii of helices provide favourable sites for water interactions, as do reverse turns and regions which connect β-structure and helices. The hydration shell consists of discontinuous networks of water molecules, the maximum number of molecules in a network being ten. The substrate-binding cleft is heavily hydrated, as is the main loop region which is stabilized by water interactions. The protein molecules are close packed in the crystals with a molecular coordination number of 14. Arginyl residues are extensively involved in intermolecular hydrogen bonds and water bridges. The water molecules in the crystal are organized into discrete clusters. A distinctive feature of the clusters is the frequent occurrence of three-membered rings. The protein molecules undergo substantial rearrangement during the transformation from the native to the low-humidity form. The main-chain conformations in the two forms are nearly the same, but differences exist in the side-chain conformation. The differences are particularly pronounced in relation to Trp 62 and Trp 63. The shift in Trp 62 is especially interesting as it is also known to move during inhibitor binding.

A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

The K-means algorithm for clustering is very much dependent on the initial seed values. We use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting proper initial seed values in the K-means algorithm. Results obtained are very encouraging and in most of the cases, on data sets having well separated clusters, the proposed scheme reached a global minimum.

Band to correlated crossover in alternating Hubbard and Pariser-Parr-Pople chains: Nature of the lowest singlet excitation of conjugated polymers

The evolution with increasing Coulomb correlations of a semiconductor to a magnetic insulator is related to an excited-state crossover in pi-electron models for conjugated polymers. We associate strong fluorescence with a lowest singlet excitation S1 that is dipole allowed, on the band side, while S1 becomes two-photon allowed on the correlated side. S1/S2 crossovers in Hubbard, Pariser-Parr-Pople, or other chains with electron-hole symmetry and alternating transfer integral t(1 +/- delta) are based on exact results at delta=0 and 1, on molecular exciton theory at large delta, and on oligomer calculations up to twelve sites.

On the Milito-Cruz adaptive control scheme for Markov chains

Milito and Cruz have introduced a novel adaptive control scheme for finite Markov chains when a finite parametrized family of possible transition matrices is available. The scheme involves the minimization of a composite functional of the observed history of the process incorporating both control and estimation aspects. We prove the a.s. optimality of a similar scheme when the state space is countable and the parameter space a compact subset ofR.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Energy-Efficient Fault Tolerance in Chip Multiprocessors Using Critical Value Forwarding

Relentless CMOS scaling coupled with lower design tolerances is making ICs increasingly susceptible to wear-out related permanent faults and transient faults, necessitating on-chip fault tolerance in future chip microprocessors (CMPs). In this paper we introduce a new energy-efficient fault-tolerant CMP architecture known as Redundant Execution using Critical Value Forwarding (RECVF). RECVF is based on two observations: (i) forwarding critical instruction results from the leading to the trailing core enables the latter to execute faster, and (ii) this speedup can be exploited to reduce energy consumption by operating the trailing core at a lower voltage-frequency level. Our evaluation shows that RECVF consumes 37% less energy than conventional dual modular redundant (DMR) execution of a program. It consumes only 1.26 times the energy of a non-fault-tolerant baseline and has a performance overhead of just 1.2%.

Lattice embedding and equilibrium geometry of metal-halogen chains in the two-band extended Hubbard model

Two-band extended Hubbard model studies show that the shift in optical gap of the metal-halogen (MX) chain upon embedding in a crystalline environment depends upon alternation in the site-diagonal electron-lattice interaction parameter (epsilon(M)) and the strength of electron-electron interactions at the metal site (U(M)). The equilibrium geometry studies on isolated chains show that the MX chains tend to distort for alternating epsilon(M) and small U(M) values.

Quantum-confinement effects on the ordering of the lowest-lying excited states in conjugated chains

The symmetrized density-matrix renormalization-group approach is applied within the extended Hubbard-Peierls model (with parameters U/t, V/t, and bond alternation delta) to study the ordering of the lowest one-photon (1(1)B(u)(-)) and two-photon (2(1)A(g)(+)) states in one-dimensional conjugated systems with chain lengths N up to N = 80 sites. Three different types of crossovers are studied, as a function of U/t, delta, and N. The ''U crossover'' emphasizes the larger ionic character of the 2A(g) state compared to the lowest triplet excitation. The ''delta crossover'' shows strong dependence on both N and U/t. the ''N crossover'' illustrates the more localized nature of the 2A(g) excitation relative to the 1B(u) excitation at intermediate correlation strengths.

Regular versus alternating (FeS4)(n) chains: Magnetism in KFeS2 and CsFeS2

We report crystal magnetic susceptibility results of two S = 1/2 one-dimensional Heisenberg antiferromagnets, KFeS2 and CsFeS2. Both compounds consist of (FeS4)(n) chains with an average Fe-Fe distance of 2.7 Angstrom. In KFeS2, all intrachain Fe-Fe distances are identical. Its magnetic susceptibility is typical of a regular antiferromagnetic chain with spin-spin exchange parameter J = -440.7 K. In CsFeS2, however, the Fe-Fe distances alternate between 2.61 and 2.82 Angstrom. This is reflected in its magnetic susceptibility, which could be fitted with J = -640 K, and the degree of alternation, alpha = 0.3. These compounds form a unique pair, and allow for a convenient experimental comparison of the magnetic properties of regular versus alternating Heisenberg chains.

Anomalous Behavior of Linear Hydrocarbon Chains in Water-DMSO Binary Mixture at Low DMSO Concentration

We find that at a mole fraction 0.05 of DMSO (x(DMSO) = 0.05) in aqueous solution, a linear hydrocarbon chain of intermediate length (n = 30-40) adopts the most stable collapsed conformation. In pure water, the same chain exhibits an intermittent oscillation between the collapsed and the extended coiled conformations. Even when the mole fraction of DMSO in the bulk is 0.05, the concentration of the same in the first hydration layer around the hydrocarbon of chain length 30 (n = 30) is as large as 17%. Formation of such hydrophobic environment around the hydrocarbon chain may be viewed as the reason for the collapsed conformation gaining additional stability. We find a second anomalous behavior to emerge near x(DMSO) = 0.15, due to a chain-like aggregation of the methyl groups of DMSO in water that lowers the relative concentration of the DMSO molecules in the hydration layer. We further find that as the concentration of DMSO is gradually increased, it progressively attains the extended coiled structure as the stable conformation. Although Flory-Huggins theory (for binary mixture solvent) fails to predict the anomaly at x(DMSO) = 0.05, it seems to capture the essence of the anomaly at 0.15.