Negotiation schemes for multi-agent cooperative search

Because of limited sensor and communication ranges, designing efficient mechanisms for cooperative tasks is difficult. In this article, several negotiation schemes for multiple agents performing a cooperative task are presented. The negotiation schemes provide suboptimal solutions, but have attractive features of fast decision-making, and scalability to large number of agents without increasing the complexity of the algorithm. A software agent architecture of the decision-making process is also presented. The effect of the magnitude of information flow during the negotiation process is studied by using different models of the negotiation scheme. The performance of the various negotiation schemes, using different information structures, is studied based on the uncertainty reduction achieved for a specified number of search steps. The negotiation schemes perform comparable to that of optimal strategy in terms of uncertainty reduction and also require very low computational time, similar to 7 per cent to that of optimal strategy. Finally, analysis on computational and communication requirement for the negotiation schemes is carried out.

A robust initialization scheme for faster convergence of the dichotomous search algorithm for single frequency estimation

The estimation of the frequency of a sinusoidal signal is a well researched problem. In this work we propose an initialization scheme to the popular dichotomous search of the periodogram peak algorithm(DSPA) that is used to estimate the frequency of a sinusoid in white gaussian noise. Our initialization is computationally low cost and gives the same performance as the DSPA, while reducing the number of iterations needed for the fine search stage. We show that our algorithm remains stable as we reduce the number of iterations in the fine search stage. We also compare the performance of our modification to a previous modification of the DSPA and show that we enhance the performance of the algorithm with our initialization technique.

Negative sequence compensation within fundamental positive sequence reference frame for a stiff micro-grid generation in a wind power system using slip ring induction machine

An isolated wind power generation scheme using slip ring induction machine (SRIM) is proposed. The proposed scheme maintains constant load voltage and frequency irrespective of the wind speed or load variation. The power circuit consists of two back-to-back connected inverters with a common dc link, where one inverter is directly connected to the rotor side of SRIM and the other inverter is connected to the stator side of the SRIM through LC filter. Developing a negative sequence compensation method to ensure that, even under the presence of unbalanced load, the generator experiences almost balanced three-phase current and most of the unbalanced current is directed through the stator side converter is the focus here. The SRIM controller varies the speed of the generator with variation in the wind speed to extract maximum power. The difference of the generated power and the load power is either stored in or extracted from a battery bank, which is interfaced to the common dc link through a multiphase bidirectional fly-back dc-dc converter. The SRIM control scheme, maximum power point extraction algorithm and the fly-back converter topology are incorporated from available literature. The proposed scheme is both simulated and experimentally verified.

Search for chaos in neutron star systems: Is Cyg X-3 a black hole?

The accretion disk around a compact object is a nonlinear general relativistic system involving magnetohydrodynamics. Naturally, the question arises whether such a system is chaotic (deterministic) or stochastic (random) which might be related to the associated transport properties whose origin is still not confirmed. Earlier, the black hole system GRS 1915+105 was shown to be low-dimensional chaos in certain temporal classes. However, so far such nonlinear phenomena have not been studied fairly well for neutron stars which are unique for their magnetosphere and kHz quasi-periodic oscillation (QPO). On the other hand, it was argued that the QPO is a result of nonlinear magnetohydrodynamic effects in accretion disks. If a neutron star exhibits chaotic signature, then what is the chaotic/correlation dimension? We analyze RXTE/PCA data of neutron stars Sco X-1 and Cyg X-2, along with the black hole Cyg X-1 and the unknown source Cyg X-3, and show that while Sco X-1 and Cyg X-2 are low dimensional chaotic systems, Cyg X-1 and Cyg X-3 are stochastic sources. Based on our analysis, we argue that Cyg X-3 may be a black hole.

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.

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.

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.

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.

Discovering user preferences by using time entries in click-through data to improve search engine results

The search engine log files have been used to gather direct user feedback on the relevancy of the documents presented in the results page. Typically the relative position of the clicks gathered from the log files is used a proxy for the direct user feedback. In this paper we identify reasons for the incompleteness of the relative position of clicks for deciphering the user preferences. Hence, we propose the use of time spent by the user in reading through the document as indicative of user preference for a document with respect to a query. Also, we identify the issues involved in using the time measure and propose means to address them.