Deformation dynamics of SS-316 Between 1023-K TO 1223-K In The Framework of Cottrell-Stokes Law

Kocks' formalism for analysing steady state deformation data for the case where Cottrell-Stokes law is valid is extended to incorporate possible back stresses from solution and/or precipitation hardening, and dependence of pre-exponential factor on the applied stress. A simple graphical procedure for exploiting these equations is demonstrated by analyzing tensile steady state data for a type 316 austentic stainless steel for the temperature range 1023 to 1223 K. In this instance, the computed back stress values turned out to be negative, a physically meaningless result. This shows that for SS 316, deformation in this temperature regime can not be interpreted in terms of a mechanism that obeys Cottrell-Stokes law.

An automatic parallelization framework for multicomputers

Several researchers have looked into various issues related to automatic parallelization of sequential programs for multicomputers. But there is a need for a coherent framework which encompasses all these issues. In this paper we present a such a framework which takes best advantage of the multicomputer architecture. We resort to tiling transformation for iteration space partitioning and propose a scheme of automatic data partitioning and dynamic data distribution. We have tried a simple implementation of our scheme on a transputer based multicomputer [1] and the results are encouraging.

Combining Bayes Classification and Point Group Symmetry under Boolean Framework for Enhanced Protein Quaternary Structure Inference

Our ability to infer the protein quaternary structure automatically from atom and lattice information is inadequate, especially for weak complexes, and heteromeric quaternary structures. Several approaches exist, but they have limited performance. Here, we present a new scheme to infer protein quaternary structure from lattice and protein information, with all-around coverage for strong, weak and very weak affinity homomeric and heteromeric complexes. The scheme combines naive Bayes classifier and point group symmetry under Boolean framework to detect quaternary structures in crystal lattice. It consistently produces >= 90% coverage across diverse benchmarking data sets, including a notably superior 95% coverage for recognition heteromeric complexes, compared with 53% on the same data set by current state-of-the-art method. The detailed study of a limited number of prediction-failed cases offers interesting insights into the intriguing nature of protein contacts in lattice. The findings have implications for accurate inference of quaternary states of proteins, especially weak affinity complexes.

New open-framework phosphate and phosphite compounds of gallium

Five new open-framework compounds of gallium have been synthesized by hydrothermal methods and their structures determined by single crystal X-ray diffraction studies. The compounds, C8N4H26]Ga6F4(PO4)(6)], I, C5N3H11]Ga3F2(PO4)(3)]center dot H2O, II, C6N3H19]Ga-4(C2O4)(PO4)(4)(H2PO4)]center dot 2H(2)O, III, Ga2F3(HPO4)(PO4)]center dot 2H(3)O, IV, and C3N2H5](2)Ga-4(H2O)(3)(HPO3)(7)], V, possess three-dimensional structures. All the compounds are formed by the connectivity between the Ga polyhedra and phosphite/phosphate units. The observation of SBU-6 (I and II) and spiro-5 (IV) secondary building units (SBUs) are noteworthy. The flexibility of the formation of gallium phosphate frameworks has been established by the isolation of two related structures (I and II) from the same SBU units but different organic amines. Some of the present structures have close resemblance to the gallium phosphate phases known earlier. The compounds have been characterized by CHN analysis, powder XRD, IR, and TGA. (C) 2011 Elsevier B. V. All rights reserved.

Synthetic studies directed towards the potent cytotoxic natural product ottelione A: stereoselective construction of the complete framework

A stereoselective strategy for the rapid acquisition of the complete framework (dideoxyottelione A) of the promising cytotoxic agent ottelione A, with four contiguous stereogenic centres on a hydrindane skeleton and a sensitive 4-methylenecyclohex-2-enone functionality, from the readily available Diels-Alder adduct of 1,2,3,4-tetrachloro-5,5-dimethoxycyclopentadiene and norbornadiene, is delineated.

An open-framework zincoborate formed by Zn6B12O24 clusters

A novel zincoborate, Zn(H2O)B2O4.xH(2)O (xapproximate to0.12), I, with open architecture has been synthesized hydrothermally. The 3-dimensional structure is built up of Zn6B12O24 clusters formed by the capping of the polycyclic borate anion, B12O2412-, by Zn3O3 clusters. The open-framework structure of I has one-dimensional 8-membered channels wherein the water molecules reside. Formation of trimeric Zn3O3 clusters as well as the presence of boron in dual coordination, both triangular and tetrahedral, are important structural features of this new zincoborate.

An open-framework cobalt oxalato-squarate containing a ligated amine

A cobalt oxalato-squarate of the formula [Co-2(C4O4)(C2O4)(C3N2H4)(2)], containing a ligated amine has been synthesized hydrothermally and its structure determined by single crystal X-ray diffraction. The compound crystallizes in the orthorhombic space group P2(1)2(1)2 with a = 18.3845(8) Angstrom, b = 5.7884(3) Angstrom, c = 7.2598(4) Angstrom, V = 772.56(7)Angstrom(3) and Z = 4. It has a layered structure where two-dimensional sheets are formed by the connectivity of the squarate and the oxalate units with the cobalt centres, with the ligating amine molecules protruding out from the layers. (C) 2003 Editions scientifiques et medicales Elsevier SAS. All rights reserved.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Understanding the building-up process of three dimensional open-framework metal phosphates: Acid degradation of the 3D structures to lower dimensional structures

Acid degradation of 3D zinc phosphates primarily yields a one-dimensional ladder compound, an observation that is significant considering that the latter forms 3D structures on heating in water.

A System-C based Micro architectural Exploration Framework for Latency, Power and Performance Trade-offs of On-Chip Interconnection

We describe a System-C based framework we are developing, to explore the impact of various architectural and microarchitectural level parameters of the on-chip interconnection network elements on its power and performance. The framework enables one to choose from a variety of architectural options like topology, routing policy, etc., as well as allows experimentation with various microarchitectural options for the individual links like length, wire width, pitch, pipelining, supply voltage and frequency. The framework also supports a flexible traffic generation and communication model. We provide preliminary results of using this framework to study the power, latency and throughput of a 4x4 multi-core processing array using mesh, torus and folded torus, for two different communication patterns of dense and sparse linear algebra. The traffic consists of both Request-Response messages (mimicing cache accesses)and One-Way messages. We find that the average latency can be reduced by increasing the pipeline depth, as it enables higher link frequencies. We also find that there exists an optimum degree of pipelining which minimizes energy-delay product.

A Coalitional Game Framework for Cooperative Secondary Spectrum Access

We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.