On Reducing Dynamic Web Page Construction Times

Many web sites incorporate dynamic web pages to deliver customized contents to their users. However, dynamic pages result in increased user response times due to their construction overheads. In this paper, we consider mechanisms for reducing these overheads by utilizing the excess capacity with which web servers are typically provisioned. Specifically, we present a caching technique that integrates fragment caching with anticipatory page pre-generation in order to deliver dynamic pages faster during normal operating situations. A feedback mechanism is used to tune the page pre-generation process to match the current system load. The experimental results from a detailed simulation study of our technique indicate that, given a fixed cache budget, page construction speedups of more than fifty percent can be consistently achieved as compared to a pure fragment caching approach.

TSpred: a web server for the rational design of temperature-sensitive mutants

Temperature sensitive (Ts) mutants of proteins provide experimentalists with a powerful and reversible way of conditionally expressing genes. The technique has been widely used in determining the role of gene and gene products in several cellular processes. Traditionally, Ts mutants are generated by random mutagenesis and then selected though laborious large-scale screening. Our web server, TSpred (http://mspc.bii.a-star.edu.sg/TSpred/), now enables users to rationally design Ts mutants for their proteins of interest. TSpred uses hydrophobicity and hydrophobic moment, deduced from primary sequence and residue depth, inferred from 3D structures to predict/identify buried hydrophobic residues. Mutating these residues leads to the creation of Ts mutants. Our method has been experimentally validated in 36 positions in six different proteins. It is an attractive proposition for Ts mutant engineering as it proposes a small number of mutations and with high precision. The accompanying web server is simple and intuitive to use and can handle proteins and protein complexes of different sizes.

A hydro-wood net-energy approach to hydro project design

An integrated approach to energy planning, when applied to large hydroelectric projects, requires that the energy-opportunity cost of the land submerged under the reservoir be incorporated into the planning methodology. Biomass energy lost from the submerged land has to be compared to the electrical energy generated, for which we develop four alternative formulations of the net-energy function. The design problem is posed as an LP problem and is solved for two sites in India. Our results show that the proposed designs may not be viable in net-energy terms, whereas a marginal reduction in the generation capacity could lead to an optimal design that gives substantial savings in the submerged area. Allowing seasonal variations in the hydroelectric generation capacity also reduces the reservoir size. A mixed hydro-wood generation system is then examined and is found to be viable.

An Optimal Mechanism for Sponsored Search Auctions on the Web and Comparison With Other Mechanisms

In this paper, we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we describe two well-known mechanisms for sponsored search auction-Generalized Second Price (GSP) and Vickrey-Clarke-Groves (VCG). We then derive a new mechanism for sponsored search auction which we call optimal (OPT) mechanism. The OPT mechanism maximizes the search engine's expected revenue, while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We then undertake a detailed comparative study of the mechanisms GSP, VCG, and OPT. We compute and compare the expected revenue earned by the search engine under the three mechanisms when the advertisers are symmetric and some special conditions are satisfied. We also compare the three mechanisms in terms of incentive compatibility, individual rationality, and computational complexity. Note to Practitioners-The advertiser-supported web site is one of the successful business models in the emerging web landscape. When an Internet user enters a keyword (i.e., a search phrase) into a search engine, the user gets back a page with results, containing the links most relevant to the query and also sponsored links, (also called paid advertisement links). When a sponsored link is clicked, the user is directed to the corresponding advertiser's web page. The advertiser pays the search engine in some appropriate manner for sending the user to its web page. Against every search performed by any user on any keyword, the search engine faces the problem of matching a set of advertisers to the sponsored slots. In addition, the search engine also needs to decide on a price to be charged to each advertiser. Due to increasing demands for Internet advertising space, most search engines currently use auction mechanisms for this purpose. These are called sponsored search auctions. A significant percentage of the revenue of Internet giants such as Google, Yahoo!, MSN, etc., comes from sponsored search auctions. In this paper, we study two auction mechanisms, GSP and VCG, which are quite popular in the sponsored auction context, and pursue the objective of designing a mechanism that is superior to these two mechanisms. In particular, we propose a new mechanism which we call the OPT mechanism. This mechanism maximizes the search engine's expected revenue subject to achieving Bayesian incentive compatibility and individual rationality. Bayesian incentive compatibility guarantees that it is optimal for each advertiser to bid his/her true value provided that all other agents also bid their respective true values. Individual rationality ensures that the agents participate voluntarily in the auction since they are assured of gaining a non-negative payoff by doing so.

Design of an optimal auction for sponsored search auctions

In this paper we first describe a framework to model the sponsored search auction on the web as a mechanism design problem. Using this framework, we design a novel auction which we call the OPT (optimal) auction. The OPT mechanism maximizes the search engine's expected revenue while achieving Bayesian incentive compatibility and individual rationality of the advertisers. We show that the OPT mechanism is superior to two of the most commonly used mechanisms for sponsored search namely (1) GSP (Generalized Second Price) and (2) VCG (Vickrey-Clarke-Groves). We then show an important revenue equivalence result that the expected revenue earned by the search engine is the same for all the three mechanisms provided the advertisers are symmetric and the number of sponsored slots is strictly less than the number of advertisers.

Target reliability based design optimization of anchored cantilever sheet pile walls

In this study, the stability of anchored cantilever sheet pile wall in sandy soils is investigated using reliability analysis. Targeted stability is formulated as an optimization problem in the framework of an inverse first order reliability method. A sensitivity analysis is conducted to investigate the effect of parameters influencing the stability of sheet pile wall. Backfill soil properties, soil - steel pile interface friction angle, depth of the water table from the top of the sheet pile wall, total depth of embedment below the dredge line, yield strength of steel, section modulus of steel sheet pile, and anchor pull are all treated as random variables. The sheet pile wall system is modeled as a series of failure mode combination. Penetration depth, anchor pull, and section modulus are calculated for various target component and system reliability indices based on three limit states. These are: rotational failure about the position of the anchor rod, expressed in terms of moment ratio; sliding failure mode, expressed in terms of force ratio; and flexural failure of the steel sheet pile wall, expressed in terms of the section modulus ratio. An attempt is made to propose reliability based design charts considering the failure criteria as well as the variability in the parameters. The results of the study are compared with studies in the literature.

Disulfide conformation and design at helix N-termini

To understand structural and thermodynamic features of disulfides within an alpha-helix, a non-redundant dataset comprising of 5025 polypeptide chains containing 2311 disulfides was examined. Thirty-five examples were found of intrahelical disulfides involving a CXXC motif between the N-Cap and third helical positions. GLY and PRO were the most common amino acids at positions 1 and 2, respectively. The N-Cap residue for disulfide bonded CXXC motifs had average values of (-112 +/- 25.2 degrees, 106 +/- 25.4 degrees). To further explore conformational requirements for intrahelical disulfides, CYS pairs were introduced at positions N-Cap-3; 1,4; 7,10 in two helices of an Escherichia coli thioredoxin mutant lacking its active site disulfide (nSS Trx). In both helices, disulfides formed spontaneously during purification only at positions N-Cap-3. Mutant stabilities were characterized by chemical denaturation studies (in both oxidized and reduced states) and differential scanning calorimetry (oxidized state only). All oxidized as well as reduced mutants were destabilized relative to nSS Trx. All mutants were redox active, but showed decreased activity relative to wild-type thioredoxin. Such engineered disulfides can be used to probe helix start sites in proteins of unknown structure and to introduce redox activity into proteins. Conversely, a protein with CYS residues at positions N-Cap and 3 of an alpha-helix is likely to have redox activity.

Modular design of synthetic protein mimics. Crystal structures, assembly, and hydration of two 15- and 16-residue apolar, leucyl-rich helical peptides

Two IS- and 16-residue peptides containing a-aminoisobutyric acid (Aib) have been synthesized, as part of a strategy to construct stereochemically rigid peptide helices, in a modular approach to design of protein mimics. The peptides Boc-(Val-Ala-Leu-Aib),-OMe ( I ) and Boc-Val-Ala-Leu-Aib-Val-Ala-Leu-(Val-Ala-Leu-Aib()11z)- OhaMvee been crystallized.Both crystals are stable only in the presence of mother liquor or water. The crystal data are as follows. I: C78H140N16019~2H20,P2,, a = 16.391 (3) A, b = 16.860 (3) A, c = 18.428 (3) A, p = 103.02 (I)O, Z = 2, R = 9.6% for 3445 data with lFol >30(F), resolution 0.93 A. 11: C7,Hl,,N,S018.7.5H,0, C2221, a = 18.348 ( 5 ) A, b = 47.382 (1 1) A, c = 24.157 ( 5 ) A, Z =8, R = l0,6%, for 3147 data with lFol > 3a(F), resolution 1.00 A. The 15-residue peptide (11) is entirely a helical, while the 16-residue peptide ( I ) has a short segment of 310 helix at the N terminus. The packing of the helices in the crystals is rather incfficicnt with no particular attractions between Leu-Leu side chains, or any other pair. Both crystals have fairly large voids, which are filled with water molecules in a disordered fashion. Water molecule sites near the polar head-to-tail regions are well detcrmined, those closer to the hydrophobic side chains less so and a number of possible water sites in the remaining "empty" space are not determined. No interdigitation of Leu side chains is observed in the crystal as is hypothesized in the "leucine zipper" class of DNA binding proteins.

Hydropower Project Design Incorporating Submergence Costs

Submergence of land is a major impact of large hydropower projects. Such projects are often also dogged by siltation, delays in construction and heavy debt burdens-factors that are not considered in the project planning exercise. A simple constrained optimization model for the benefit~ost analysis of large hydropower projects that considers these features is proposed. The model is then applied to two sites in India. Using the potential productivity of an energy plantation on the submergible land is suggested as a reasonable approach to estimating the opportunity cost of submergence. Optimum project dimensions are calculated for various scenarios. Results indicate that the inclusion of submergence cost may lead to a substanual reduction in net present value and hence in project viability. Parameters such as project lifespan, con$truction time, discount rate and external debt burden are also of significance. The designs proposed by the planners are found to be uneconomic, whIle even the optimal design may not be viable for more typical scenarios. The concept of energy opportunity cost is useful for preliminary screening; some projects may require more detailed calculations. The optimization approach helps identify significant trade-offs between energy generation and land availability.

PeptideMine - A webserver for the design of peptides for protein-peptide binding studies derived from protein-protein interactomes

Background: Signal transduction events often involve transient, yet specific, interactions between structurally conserved protein domains and polypeptide sequences in target proteins. The identification and validation of these associating domains is crucial to understand signal transduction pathways that modulate different cellular or developmental processes. Bioinformatics strategies to extract and integrate information from diverse sources have been shown to facilitate the experimental design to understand complex biological events. These methods, primarily based on information from high-throughput experiments, have also led to the identification of new connections thus providing hypothetical models for cellular events. Such models, in turn, provide a framework for directing experimental efforts for validating the predicted molecular rationale for complex cellular processes. In this context, it is envisaged that the rational design of peptides for protein-peptide binding studies could substantially facilitate the experimental strategies to evaluate a predicted interaction. This rational design procedure involves the integration of protein-protein interaction data, gene ontology, physico-chemical calculations, domain-domain interaction data and information on functional sites or critical residues. Results: Here we describe an integrated approach called ``PeptideMine'' for the identification of peptides based on specific functional patterns present in the sequence of an interacting protein. This approach based on sequence searches in the interacting sequence space has been developed into a webserver, which can be used for the identification and analysis of peptides, peptide homologues or functional patterns from the interacting sequence space of a protein. To further facilitate experimental validation, the PeptideMine webserver also provides a list of physico-chemical parameters corresponding to the peptide to determine the feasibility of using the peptide for in vitro biochemical or biophysical studies. Conclusions: The strategy described here involves the integration of data and tools to identify potential interacting partners for a protein and design criteria for peptides based on desired biochemical properties. Alongside the search for interacting protein sequences using three different search programs, the server also provides the biochemical characteristics of candidate peptides to prune peptide sequences based on features that are most suited for a given experiment. The PeptideMine server is available at the URL: http://caps.ncbs.res.in/peptidemine

The Design and Construction of Synthetic Protein Mimics

A strategy for the modular construction of synthetic protein mimics based on the ability non-protein amino acids to act as stereochemical directors of polypeptide chain folding, is described. The use of alpha-aminoisobutyric acid (Aib) to construct stereochemically rigid helices has been exemplified by crystallographic and spectroscopic studies of several apolar peptides, ranging in length from seven to sixteen residues. The problem of linker design in elaborating alpha,alpha motifs has been considered. Analysis of protein crystal structure data provides a guide to choosing linking sequences. Attempts at constructing linked helical motifs using linking Gly-Pro segments have been described. The use of flexible linkers, like epsilon-aminocaproic acid has been examined and the crystallographic and solution state analysis of a linked helix motif has been presented. The use of bulky sidechain modifications on a helical scaffold, as a means of generating putative binding sites has been exemplified by a crystal structure of a peptide packed in a parallel zipper arrangement.

DEPTH: a web server to compute depth and predict small-molecule binding cavities in proteins

Depth measures the extent of atom/residue burial within a protein. It correlates with properties such as protein stability, hydrogen exchange rate, protein-protein interaction hot spots, post-translational modification sites and sequence variability. Our server, DEPTH, accurately computes depth and solvent-accessible surface area (SASA) values. We show that depth can be used to predict small molecule ligand binding cavities in proteins. Often, some of the residues lining a ligand binding cavity are both deep and solvent exposed. Using the depth-SASA pair values for a residue, its likelihood to form part of a small molecule binding cavity is estimated. The parameters of the method were calibrated over a training set of 900 high-resolution X-ray crystal structures of single-domain proteins bound to small molecules (molecular weight < 1.5 KDa). The prediction accuracy of DEPTH is comparable to that of other geometry-based prediction methods including LIGSITE, SURFNET and Pocket-Finder (all with Matthew's correlation coefficient of similar to 0.4) over a testing set of 225 single and multi-chain protein structures. Users have the option of tuning several parameters to detect cavities of different sizes, for example, geometrically flat binding sites. The input to the server is a protein 3D structure in PDB format. The users have the option of tuning the values of four parameters associated with the computation of residue depth and the prediction of binding cavities. The computed depths, SASA and binding cavity predictions are displayed in 2D plots and mapped onto 3D representations of the protein structure using Jmol. Links are provided to download the outputs. Our server is useful for all structural analysis based on residue depth and SASA, such as guiding site-directed mutagenesis experiments and small molecule docking exercises, in the context of protein functional annotation and drug discovery.

PocketAlign A Novel Algorithm for Aligning Binding Sites in Protein Structures

A fundamental task in bioinformatics involves a transfer of knowledge from one protein molecule onto another by way of recognizing similarities. Such similarities are obtained at different levels, that of sequence, whole fold, or important substructures. Comparison of binding sites is important to understand functional similarities among the proteins and also to understand drug cross-reactivities. Current methods in literature have their own merits and demerits, warranting exploration of newer concepts and algorithms, especially for large-scale comparisons and for obtaining accurate residue-wise mappings. Here, we report the development of a new algorithm, PocketAlign, for obtaining structural superpositions of binding sites. The software is available as a web-service at http://proline.physicslisc.emetin/pocketalign/. The algorithm encodes shape descriptors in the form of geometric perspectives, supplemented by chemical group classification. The shape descriptor considers several perspectives with each residue as the focus and captures relative distribution of residues around it in a given site. Residue-wise pairings are computed by comparing the set of perspectives of the first site with that of the second, followed by a greedy approach that incrementally combines residue pairings into a mapping. The mappings in different frames are then evaluated by different metrics encoding the extent of alignment of individual geometric perspectives. Different initial seed alignments are computed, each subsequently extended by detecting consequential atomic alignments in a three-dimensional grid, and the best 500 stored in a database. Alignments are then ranked, and the top scoring alignments reported, which are then streamed into Pymol for visualization and analyses. The method is validated for accuracy and sensitivity and benchmarked against existing methods. An advantage of PocketAlign, as compared to some of the existing tools available for binding site comparison in literature, is that it explores different schemes for identifying an alignment thus has a better potential to capture similarities in ligand recognition abilities. PocketAlign, by finding a detailed alignment of a pair of sites, provides insights as to why two sites are similar and which set of residues and atoms contribute to the similarity.

Homo- or Heterosynthon? A Crystallographic Study on a Series of New Cocrystals Derived from Pyrazinecarboxamide and Various Carboxylic Acids Equipped with Additional Hydrogen Bonding Sites

Four new cocrystals of a well studied active pharmaceutical ingredient (API), namely, pyrazinecarboxamide (PZA), with various monocarboxylic acids equipped with additional hydrogen bonding sites such as vanillic acid (VA), gallic acid (GA), 1-hydroxy-2-naphthoic acid (1HNA), and indole-2-carboxylic acid (I2CA) have been successfully prepared and characterized by FTIR, H-1 NMR, differential scanning calorimetry (DSC), and single crystal and powder X-ray diffraction (SXRD and PXRD, respectively) techniques. In the majority of the cases, preferential occurrence amide amide and acid acid homosynthons has been observed. Since the heterosynthon is energetically preferred to homosynthon, such unusual occurrence of homosynthon in these cocrystals is intriguing.