Stress and strain-driven algorithmic formulations for finite strain viscoplasticity for hybrid and standard finite elements

This work deals with the formulation and implementation of finite deformation viscoplasticity within the framework of stress-based hybrid finite element methods. Hybrid elements, which are based on a two-field variational formulation, are much less susceptible to locking than conventional displacement-based elements. The conventional return-mapping scheme cannot be used in the context of hybrid stress methods since the stress is known, and the strain and the internal plastic variables have to be recovered using this known stress field.We discuss the formulation and implementation of the consistent tangent tensor, and the return-mapping algorithm within the context of the hybrid method. We demonstrate the efficacy of the algorithm on a wide range of problems.

ALWIN-Algorithmic Wiswesser Notation System for Organic Compounds

ALWIN, a new chemical notation system for organic compounds, based on the Wiswesser Line Notation, is described. Procedures and rules are given for constructing ALWIN for acyclic structures and cyclic structures, vi.?., benzene and Its derivatives, monocyclic, bicyclic, polycyclic, perifused, splro, bridged ring, and ring of rlngs systems. A new method called "tessellation" is introduced for the topological descrlptlon of fused and spiro ring systems. Also new concepts are introduced for describing bridged ring and ring of rlngs systems.

Synthesis based on cyclohexadienes .24. A new total synthesis of pupukean-2-one and a facile entry to copa and ylanga type sesquiterpene skeletons

A novel tandem 5-exo-trig allyl and 3-exo-trig radical cyclisation and rearrangement to copa and ylanga type sesquiterpene skeletons from easily prepared cyclohexadienes is reported, A new total synthesis of pupukean-2-one 8, which belongs to a novel class of sesquiterpenes, involving a 5-exo-trig allyl radical cyclisation as the key step is also reported.

Formulas for algorithmic computation of impedance matrix using general circuit constants

A set of formulas is derived from general circuit constants which facilitates formation of the impedance matrix of a power system by the bus-impedance method. The errors associated with the lumpedparameter representation of a transmission line are thereby eliminated. The formulas are valid for short lines also, if the relevant general circuit constants are employed. The mutual impedance between the added line and the existing system is not considered, but the approach suggested can well be extended to it.

Algorithmic approach to simulate Hamiltonian dynamics and an NMR simulation of quantum state transfer

We propose an iterative algorithm to simulate the dynamics generated by any n-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator U (unitary) into a product of different time-step unitaries. The algorithm product-decomposes U in a chosen operator basis by identifying a certain symmetry of U that is intimately related to the number of gates in the decomposition. We illustrate the algorithm by first obtaining a polynomial decomposition in the Pauli basis of the n-qubit quantum state transfer unitary by Di Franco et al. [Phys. Rev. Lett. 101, 230502 (2008)] that transports quantum information from one end of a spin chain to the other, and then implement it in nuclear magnetic resonance to demonstrate that the decomposition is experimentally viable. We further experimentally test the resilience of the state transfer to static errors in the coupling parameters of the simulated Hamiltonian. This is done by decomposing and simulating the corresponding imperfect unitaries.

Algorithmic aspects of k-tuple total domination in graphs

For a fixed positive integer k, a k-tuple total dominating set of a graph G = (V. E) is a subset T D-k of V such that every vertex in V is adjacent to at least k vertices of T Dk. In minimum k-tuple total dominating set problem (MIN k-TUPLE TOTAL DOM SET), it is required to find a k-tuple total dominating set of minimum cardinality and DECIDE MIN k-TUPLE TOTAL DOM SET is the decision version of MIN k-TUPLE TOTAL DOM SET problem. In this paper, we show that DECIDE MIN k-TUPLE TOTAL DOM SET is NP-complete for split graphs, doubly chordal graphs and bipartite graphs. For chordal bipartite graphs, we show that MIN k-TUPLE TOTAL DOM SET can be solved in polynomial time. We also propose some hardness results and approximation algorithms for MIN k-TUPLE TOTAL DOM SET problem. (c) 2012 Elsevier B.V. All rights reserved.

An Algorithmic Characterization of Polynomial Functions over Z(pn)

In this paper we consider polynomial representability of functions defined over , where p is a prime and n is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to determine whether a given function over is polynomially representable or not, and (ii) finds the polynomial if it is polynomially representable. The previous characterizations given by Kempner (Trans. Am. Math. Soc. 22(2):240-266, 1921) and Carlitz (Acta Arith. 9(1), 67-78, 1964) are existential in nature and only lead to an exhaustive search method, i.e. algorithm with complexity exponential in size of the input. Our characterization leads to an algorithm whose running time is linear in size of input. We also extend our result to the multivariate case.

Algorithmic challenges in green data centers

With data centers being the supporting infrastructure for a wide range of IT services, their efficiency has become a big concern to operators, as well as to society, for both economic and environmental reasons. The goal of this thesis is to design energy-efficient algorithms that reduce energy cost while minimizing compromise to service. We focus on the algorithmic challenges at different levels of energy optimization across the data center stack. The algorithmic challenge at the device level is to improve the energy efficiency of a single computational device via techniques such as job scheduling and speed scaling. We analyze the common speed scaling algorithms in both the worst-case model and stochastic model to answer some fundamental issues in the design of speed scaling algorithms. The algorithmic challenge at the local data center level is to dynamically allocate resources (e.g., servers) and to dispatch the workload in a data center. We develop an online algorithm to make a data center more power-proportional by dynamically adapting the number of active servers. The algorithmic challenge at the global data center level is to dispatch the workload across multiple data centers, considering the geographical diversity of electricity price, availability of renewable energy, and network propagation delay. We propose algorithms to jointly optimize routing and provisioning in an online manner. Motivated by the above online decision problems, we move on to study a general class of online problem named "smoothed online convex optimization", which seeks to minimize the sum of a sequence of convex functions when "smooth" solutions are preferred. This model allows us to bridge different research communities and help us get a more fundamental understanding of general online decision problems.

Riemannian geometry of Grassmann manifolds with a view on algorithmic computation

We give simple formulas for the canonical metric, gradient, Lie derivative, Riemannian connection, parallel translation, geodesics and distance on the Grassmann manifold of p-planes in ℝn. In these formulas, p-planes are represented as the column space of n × p matrices. The Newton method on abstract Riemannian manifolds proposed by Smith is made explicit on the Grassmann manifold. Two applications - computing an invariant subspace of a matrix and the mean of subspaces - are worked out.

Minor sesquiterpenes with new carbon skeletons from the brown alga Dictyopteris divaricata

Five minor sesquiterpenes (1-5) with two novel carbon skeletons, together with a minor new oplopane sesquiterpene ( 6), have been isolated from the brown alga Dictyopteris divaricata. By means of spectroscopic data including IR, HRMS, 1D and 2D NMR, and CD, their structures including absolute configurations were assigned as (+)-(1R, 5S, 6S, 9R)3- acetyl-1-hydroxy-6-isopropyl-9-methylbicyclo[4.3.0] non-3-ene ( 1), (+)-(1R, 3S, 4S, 5R, 6S, 9R)-3-acetyl-1,4-dihydroxy-6- isopropyl-9-methylbicyclo[4.3.0] nonane (2), (+)-(1R, 3R, 4R, 5R, 6S, 9R)-3-acetyl-1,4-dihydroxy-6-isopropyl-9-methylbicyclo[ ;4.3.0] nonane ( 3), (+)-(1S, 2R, 6S, 9R)-1-hydroxy-2-(1-hydroxyethyl)-6-isopropyl-9-methylbicyclo[4.3.0] non-4-en-3-one (4), (-)-( 5S, 6R, 9S)-2-acetyl-5-hydroxy-6-isopropyl-9-methylbicyclo[4.3.0] non-1-en-3-one ( 5), and (-)-( 1S, 6S, 9R)- 4-acetyl- 1-hydroxy-6-isopropyl-9-methylbicyclo[ 4.3.0] non-4-en-3-one ( 6). Biogenetically, the carbon skeletons of 1-6 may be derived from the co-occurring cadinane skeleton by different ring contraction rearrangements. Compounds 1-6 were inactive (IC50 > 10 mu g/mL) against several human cancer cell lines.

Revised Report on the Algorithmic Language Scheme

Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the Lambda Order they are all first-class. One thing to name them all, one things to define them, one thing to place them in environments and bind them, in the Lambda Order they are all first-class. Keywords: Scheme, Lisp, functional programming, computer languages.