Microstructure evolution and thermoelectric properties of Te-poor and Te-rich (Bi,Sb)<Subscript>2</Subscript>Te<Subscript>3</Subscript> prepared via solidification

This paper explores in detail, the microstructures and thermoelectric properties of Te-rich and Te-poor (Bi,Sb)₂Te₃ alloys. We show that tuning the composition of ternary Bi–Sb–Te type alloys allows us to synthesize a range of microstructures containing a primary solid solution of (Bi,Sb)₂Te₃ with varying amounts of Te solid solution or a (Bi,Sb)Te compound. Te exists as a constituent of the multilayer domain while (Bi,Sb)Te appears in the thin intercellular regions of the (Bi,Sb)₂Te₃ dendritic cells. The presence of Te imparts an n-type behavior to the composite while the (Bi,Sb)₂Te₃ with a small amount of (Bi,Sb)Te exhibits p-type properties. A maximum ZT value of ≈0.4 at 425 K was achieved, opening up the possibility of using these alloys for thermoelectric device applications.     

Antitumor, immunomodulatory and anti-HIV effect of mangiferin, a naturally occurring glucosylxanthone

We proposed previously a cyclic code made of 22 triplets, which we now call the AB code. It is made up of the following chain: AUGGUGCCAUUCAAGACUAUGA. The letters A, U, C, G represent the classical symbols of the (purine and pyrimidine) bases of the genetic code. This chain presents the following features: (1) when it is in cyclic form, it begins with the initiation codon AUG, ends with the termination codon UGA, and it can be read triplet after triplet by choosing 1 and only 1 representative of each synonymy class in the classical degenerate genetic code made of 64 triplets. The chain, therefore, possesses 1 and only 1 codon for each amino-acid; (2) except for the doublet CG, triplets of the chain begin with the 15 other possible doublets of bases (satisfying the "wobble" hypothesis presented by Crick); (3) it corresponds (except for 1 base) to the "loop" part of the CEnothera mitochondrial Gly-tRNA; (4) it can be modified, without loss of the properties (1) and (2), in such a way as to have 15 bases in common with the loop part of other mitochondrial tRNA's considered as primitive, like Ala-, Pro- and Arg-tRNA; (5) it contains the most frequent triplets, but not the most rare ones, appearing in the genome of numerous species; (6) it exhibits a coherent internal structure with respect to the molecular weight of its triplets. This structure, also found in the loop part of mitochondrial tRNA's, contains an excess of AU bases with respect to GC bases. This fact has no explanation in the classical probabilistic model of the tRNA's. Therefore, we propose the cyclic AB code as a primitive genetic structure with the essential coding properties of the present genetic code.     

Decision-theoretic planning with generalized first-order decision diagrams

Many tasks in AI require representation and manipulation of complex functions. First-Order Decision Diagrams (FODD) are a compact knowledge representation expressing functions over relational structures. They represent numerical functions that, when constrained to the Boolean range, use only existential quantification. Previous work has developed a set of operations for composition and for removing redundancies in FODDs, thus keeping them compact, and showed how to successfully employ FODDs for solving large-scale stochastic planning problems through the formalism of relational Markov decision processes (RMDP). In this paper, we introduce several new ideas enhancing the applicability of FODDs. More specifically, we first introduce Generalized FODDs (GFODD) and composition operations for them, generalizing FODDs to arbitrary quantification. Second, we develop a novel approach for reducing (G)FODDs using model checking. This yields – for the first time – a reduction that maximally reduces the diagram for the FODD case and provides a sound reduction procedure for GFODDs. Finally we show how GFODDs can be used in principle to solve RMDPs with arbitrary quantification, and develop a complete solution for the case where the reward function is specified using an arbitrary number of existential quantifiers followed by an arbitrary number of universal quantifiers.     

Implicit branching and parameterized partial cover problems

Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well-known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems has been intensively studied in planar graphs and in graphs excluding a fixed graph H as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems.     

ENVIRONMENTALLY CONSCIOUS MACHINING AND GRINDING WITH CRYOGENIC COOLING

High production machining and grinding is becoming essential to enhance productivity and profitability. But such machining technique inherently increases the machining and grinding zone temperature, which in turn enhances tool wear rate and impairs the product quality. Historically cutting compounds and grinding fluids are applied to control such high temperature. Not only are such cutting fluids not very effective, but most importantly they are being perceived as a major source of pollution from the machining and grinding industry. The drastic cooling action of liquid nitrogen jets does provide desirable temperature control along with other technological benefits. Several research groups and a few organisations in different parts of the world are investigating the effects of cryogenic cooling on the machinability and grindability of different work materials using different approaches.     

A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems

This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process).     

Renormalized measure of regular languages

This paper modifies the signed real measure of regular languages, which has been reported in recent literature for analysis and synthesis of discrete event supervisory control laws. A new concept of renormalized measure is introduced to eliminate a user-selectable parameter in the present version of the language measure. The concept of measure renormalization is illustrated by an example.