Observation of Peierls transition in nanowires (diameter similar to 130 nm) of the charge transfer molecule TTF-TCNQ synthesized by electric-field-directed growth

We report the growth of nanowires of the charge transfer complex tetrathiafulvalene-tetracyanoquinodimethane (TTF-TCNQ) with diameters as low as 130 nm and show that such nanowires can show Peierls transitions at low temperatures. The wires of sub-micron length were grown between two prefabricated electrodes (with sub-micron gap) by vapor phase growth from a single source by applying an electric field between the electrodes during the growth process. The nanowires so grown show a charge transfer ratio similar to 0.57, which is close to that seen in bulk crystals. Below the transition the transport is strongly nonlinear and can be interpreted as originating from de-pinning of CDW that forms at the Peierls transition.

A Search for Energy Minimized Sequences of Proteins

In this paper, we present numerical evidence that supports the notion of minimization in the sequence space of proteins for a target conformation. We use the conformations of the real proteins in the Protein Data Bank (PDB) and present computationally efficient methods to identify the sequences with minimum energy. We use edge-weighted connectivity graph for ranking the residue sites with reduced amino acid alphabet and then use continuous optimization to obtain the energy-minimizing sequences. Our methods enable the computation of a lower bound as well as a tight upper bound for the energy of a given conformation. We validate our results by using three different inter-residue energy matrices for five proteins from protein data bank (PDB), and by comparing our energy-minimizing sequences with 80 million diverse sequences that are generated based on different considerations in each case. When we submitted some of our chosen energy-minimizing sequences to Basic Local Alignment Search Tool (BLAST), we obtained some sequences from non-redundant protein sequence database that are similar to ours with an E-value of the order of 10(-7). In summary, we conclude that proteins show a trend towards minimizing energy in the sequence space but do not seem to adopt the global energy-minimizing sequence. The reason for this could be either that the existing energy matrices are not able to accurately represent the inter-residue interactions in the context of the protein environment or that Nature does not push the optimization in the sequence space, once it is able to perform the function.

Use of structure-directed DNA ligands to probe the binding of recA protein to narrow and wide grooves of DNA and on its ability to promote homologous pairing

We have used circular dichroism and structure-directed drugs to identify the role of structural features, wide and narrow grooves in particular, required for the cooperative polymerization, recognition of homologous sequences, and the formation of joint molecules promoted by recA protein. The path of cooperative polymerization of recA protein was deduced by its ability to cause quantitative displacement of distamycin from the narrow groove of duplex DNA. By contrast, methyl green bound to the wide groove was retained by the nucleoprotein filaments comprised of recA protein-DNA. Further, the mode of binding of these ligands and recA protein to DNA was confirmed by DNaseI digestion. More importantly, the formation of joint molecules was prevented by distamycin in the narrow groove while methyl green in the wide groove had no adverse effect. Intriguingly, distamycin interfered with the production of coaggregates between nucleoprotein filaments of recA protein-M13 ssDNA and naked linear M13 duplex DNA, but not with linear phi X174 duplex DNA. Thus, these data, in conjunction with molecular modeling, suggest that the narrow grooves of duplex DNA provide the fundamental framework required for the cooperative polymerization of recA protein and alignment of homologous sequences. These findings and their significance are discussed in relation to models of homologous pairing between two intertwined DNA molecules.

DMT of Multi-hop Cooperative Networks-Part II: Layered and Multi-Antenna Networks

We consider single-source, single-sink (ss-ss) multi-hop relay networks, with slow-fading Rayleigh links. This two part paper aims at giving explicit protocols and codes to achieve the optimal diversity-multiplexing tradeoff (DMT) of two classes of multi-hop networks: K-parallel-path (KPP) networks and Layered networks. While single-antenna KPP networks were the focus of the first part, we consider layered and multi-antenna networks in this second part. We prove that a linear DMT between the maximum diversity d(max). and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks under the half-duplex constraint. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4. For the multiple-antenna case, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks. Along the way, we compute the DMT of parallel MIMO channels in terms of the DMT of the component channel. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable using an amplify-and-forward (AF) protocol. Explicit short-block-length codes are provided for all the proposed protocols. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two as previously believed and that simple AN protocols are often sufficient to attain the best possible DMT.

Deploy and search strategy for multi-agent systems using Voronoi partitions

In this paper we analyze a deploy and search strategy for multi-agent systems. Mobile agents equipped with sensors carry out search operation in the search space. The lack of information about the search space is modeled as an uncertainty density distribution over the space, and is assumed to be known to the agents a priori. In each step, the agents deploy themselves in an optimal way so as to maximize per step reduction in the uncertainty density. We analyze the proposed strategy for convergence and spatial distributedness. The control law moving the agents has been analyzed for stability and convergence using LaSalle's invariance principle, and for spatial distributedness under a few realistic constraints on the control input such as constant speed, limit on maximum speed, and also sensor range limits. The simulation experiments show that the strategy successfully reduces the average uncertainty density below the required level.

Google, online search and consumer confusion in Australia

The legality of the operation of Google’s search engine, and its liability as an Internet intermediary, has been tested in various jurisdictions on various grounds. In Australia, there was an ultimately unsuccessful case against Google under the Australian Consumer Law relating to how it presents results from its search engine. Despite this failed claim, several complex issues were not adequately addressed in the case including whether Google sufficiently distinguishes between the different parts of its search results page, so as not to mislead or deceive consumers. This article seeks to address this question of consumer confusion by drawing on empirical survey evidence of Australian consumers’ understanding of Google’s search results layout. This evidence, the first of its kind in Australia, indicates some level of consumer confusion. The implications for future legal proceedings in against Google in Australia and in other jurisdictions are discussed.

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.

Search for a Light Higgs Boson in Central Exclusive Diffraction: Method and Detectors

By detecting leading protons produced in the Central Exclusive Diffractive process, p+p → p+X+p, one can measure the missing mass, and scan for possible new particle states such as the Higgs boson. This process augments - in a model independent way - the standard methods for new particle searches at the Large Hadron Collider (LHC) and will allow detailed analyses of the produced central system, such as the spin-parity properties of the Higgs boson. The exclusive central diffractive process makes possible precision studies of gluons at the LHC and complements the physics scenarios foreseen at the next e+e− linear collider. This thesis first presents the conclusions of the first systematic analysis of the expected precision measurement of the leading proton momentum and the accuracy of the reconstructed missing mass. In this initial analysis, the scattered protons are tracked along the LHC beam line and the uncertainties expected in beam transport and detection of the scattered leading protons are accounted for. The main focus of the thesis is in developing the necessary radiation hard precision detector technology for coping with the extremely demanding experimental environment of the LHC. This will be achieved by using a 3D silicon detector design, which in addition to the radiation hardness of up to 5×10^15 neutrons/cm2, offers properties such as a high signal-to- noise ratio, fast signal response to radiation and sensitivity close to the very edge of the detector. This work reports on the development of a novel semi-3D detector design that simplifies the 3D fabrication process, but conserves the necessary properties of the 3D detector design required in the LHC and in other imaging applications.

Role of histidine residues in EcoP15I DNA methyltransferase activity as probed by chemical modification and site-directed mutagenesis

Towards understanding the catalytic mechanism of M.EcoP15I [EcoP15I MTase (DNA methyltransferase); an adenine methyltransferase], we investigated the role of histidine residues in catalysis. M.EcoP15I, when incubated with DEPC (diethyl pyrocarbonate), a histidine-specific reagent, shows a time- and concentration-dependent inactivation of methylation of DNA containing its recognition sequence of 5'-CAGCAG-3'. The loss of enzyme activity was accompanied by an increase in absorbance at 240 nm. A difference spectrum of modified versus native enzyme shows the formation of N-carbethoxyhistidine that is diminished by hydroxylamine. This, along with other experiments, strongly suggests that the inactivation of the enzyme by DEPC was specific for histidine residues. Substrate protection experiments show that pre-incubating the methylase with DNA was able to protect the enzyme from DEPC inactivation. Site-directed mutagenesis experiments in which the 15 histidine residues in the enzyme were replaced individually with alanine corroborated the chemical modification studies and established the importance of His-335 in the methylase activity. No gross structural differences were detected between the native and H335A mutant MTases, as evident from CD spectra, native PAGE pattern or on gel filtration chromatography. Replacement of histidine with alanine residue at position 335 results in a mutant enzyme that is catalytically inactive and binds to DNA more tightly than the wild-type enzyme. Thus we have shown in the present study, through a combination of chemical modification and site-directed mutagenesis experiments, that His-335 plays an essential role in DNA methylation catalysed by M.EcoP15I.

The process of technological innovations in small enterprises: the Indian way

This paper probes how two small foundries in Belgaum, Karnataka State, India, have achieved technological innovations successfully based on their technological capability and customer needs, enabling them to sail through the competitive environment. This study brought out that technically qualified entrepreneurs of both the foundries have carried out technological innovations, mainly due to their self-motivation and self-efforts. Changing product designs, as desired or directed by the customers, cost reduction, quality improvement and import substitution through reverse engineering are the characteristics of these technological innovations. These incremental innovations have enabled the entrepreneurs of the two foundries to enhance competitiveness, grow in the domestic market and penetrate the international market and grow in size over time.

The process of technological innovations in small enterprises: the Indian way

This paper probes how two small foundries in Belgaum, Karnataka State, India, have achieved technological innovations successfully based on their technological capability and customer needs, enabling them to sail through the competitive environment. This study brought out that technically qualified entrepreneurs of both the foundries have carried out technological innovations, mainly due to their self-motivation and self-efforts. Changing product designs, as desired or directed by the customers, cost reduction, quality improvement and import substitution through reverse engineering are the characteristics of these technological innovations. These incremental innovations have enabled the entrepreneurs of the two foundries to enhance competitiveness, grow in the domestic market and penetrate the international market and grow in size over time.

Non-resident workers: A comparison of family support services for resource, health, and defence communities

Non-resident workforces experience high labour turnover, which has an impact on organisational operations and affects worker satisfaction and, in turn, partners’ ability to cope with work-related absences. Research suggests that partner satisfaction may be increased by providing a range of support services, which include professional, practical, and social support. A search was conducted to identify support available for resources and health-industry non-resident workers. These were compared to the supports available to families of deployed defence personnel. They were used to compare and contrast the spread available for each industry. The resources industry primarily provided social support, and lacked an inclusion of professional and practical supports. Health-professional support services were largely directed towards extended locum support, rather than to Fly-In Fly-Out workers. Improving sources of support which parallel support provided to the Australian Defence Force is suggested as a way to increase partner satisfaction. The implications are to understand the level of uptake, perceived importance, and utilisation of such support services.

Intent Based Clustering of Search Engine Query Log

The keyword based search technique suffers from the problem of synonymic and polysemic queries. Current approaches address only theproblem of synonymic queries in which different queries might have the same information requirement. But the problem of polysemic queries,i.e., same query having different intentions, still remains unaddressed. In this paper, we propose the notion of intent clusters, the members of which will have the same intention. We develop a clustering algorithm that uses the user session information in query logs in addition to query URL entries to identify cluster of queries having the same intention. The proposed approach has been studied through case examples from the actual log data from AOL, and the clustering algorithm is shown to be successful in discerning the user intentions.