Plastic response of orthotropic spherical shells under blast loading

The plastic response of a segment of a simply supported orthotropic spherical shell under a uniform blast loading applied on the convex surface of the shell is presented. The blast is assumed to impart a uniform velocity to the shell surface initially. The material of the shell is orthotropic obeying a modified Tresca yield hypersurface conditions and the associated flow rules. The deformation of the shell is determined during all phases of its motion by considering the motion of plastic hinges in different regimes of flow. Numerical results presented include the permanent deformed configuration of the shell and the total time of shell response for different degrees of orthotropy. Conclusions regarding the plastic behaviour of spherical shells with circumferential and meridional stiffening under uniform blast load are presented.

Understanding Customer Loyalty and Disloyalty The Effect of Loyalty-Supporting and -Repressing Factors (first edition sold out, 'print on demand' 60 €)

Customer loyalty has been a central topic of both marketing theory and practice for several decades. Customer disloyalty, or relationship ending, has received much less attention. Despite the close relation between customer loyalty and disloyalty, they have rarely been addressed in the same study. The thesis bridges this gap by focusing on both loyal and disloyal customers and the factors characterising them. Based on a qualitative study of loyal and disloyal bank customers in the Finnish retail banking market, both factors that are common to the groups and factors that differentiate between them are identified. A conceptual framework of factors that affect customer loyalty or disloyalty is developed and used to analyse the empirical data. According to the framework, customers’ loyalty status (behavioural and attitudinal loyalty) is influenced by positive, loyalty-supporting, and negative, loyalty-repressing factors. Loyalty-supporting factors either promote customer dedication, making the customer want to remain loyal, or act as constraints, hindering the customer from switching. Among the loyalty-repressing factors it is especially important to identify those that act as triggers of disloyal behaviour, making customers switch service providers. The framework further suggests that by identifying the sources of loyalty-supporting and -repressing factors (the environment, the provider, the customer, the provider-customer interaction, or the core service) one can determine which factors are within the control of the service provider. Attitudinal loyalty is approached through a customer’s “feeling of loyalty”, as described by customers both orally and graphically. By combining the graphs with behavioural loyalty, seven customer groups are identified: Stable Loyals, Rescued Loyals, Loyals at Risk, Positive Disloyals, Healing Disloyals, Fading Disloyals, and Abrupt Disloyals. The framework and models of the thesis can be used to analyse factors that affect customer loyalty and disloyalty in different service contexts. Since the empirical study was carried out in a retail bank setting, the thesis has managerial relevance especially for banks. Christina Nordman is associated with CERS, Center for Relationship Marketing and Service Management at the Swedish School of Economics and Business Administration. The doctoral thesis is part of the Göran Collert Research Project in Customer Relationships and Retail Banking and has been funded by The Göran Collert Foundation.

Protein sequence design on the basis of topology optimization techniques -Using continuous modeling of discrete amino acid types

The notion of optimization is inherent in protein design. A long linear chain of twenty types of amino acid residues are known to fold to a 3-D conformation that minimizes the combined inter-residue energy interactions. There are two distinct protein design problems, viz. predicting the folded structure from a given sequence of amino acid monomers (folding problem) and determining a sequence for a given folded structure (inverse folding problem). These two problems have much similarity to engineering structural analysis and structural optimization problems respectively. In the folding problem, a protein chain with a given sequence folds to a conformation, called a native state, which has a unique global minimum energy value when compared to all other unfolded conformations. This involves a search in the conformation space. This is somewhat akin to the principle of minimum potential energy that determines the deformed static equilibrium configuration of an elastic structure of given topology, shape, and size that is subjected to certain boundary conditions. In the inverse-folding problem, one has to design a sequence with some objectives (having a specific feature of the folded structure, docking with another protein, etc.) and constraints (sequence being fixed in some portion, a particular composition of amino acid types, etc.) while obtaining a sequence that would fold to the desired conformation satisfying the criteria of folding. This requires a search in the sequence space. This is similar to structural optimization in the design-variable space wherein a certain feature of structural response is optimized subject to some constraints while satisfying the governing static or dynamic equilibrium equations. Based on this similarity, in this work we apply the topology optimization methods to protein design, discuss modeling issues and present some initial results.

New computational approaches for wrinkled and slack membranes

The static response of thin, wrinkled membranes is studied using both a tension field approximation based on plane stress conditions and a 3D nonlinear elasticityformulation, discretized through 8-noded Cosserat point elements. While the tension field approach only obtains the wrinkled/slack regions and at best a measure of the extent of wrinkliness, the 3D elasticity solution provides, in principle, the deformed shape of a wrinkled/slack membrane. However, since membranes barely resist compression, the discretized and linearized system equations via both the approaches are ill-conditioned and solutions could thus be sensitive to discretizations errors as well as other sources of noises/imperfections. We propose a regularized, pseudo-dynamical recursion scheme that provides a sequence of updates, which are almost insensitive to theregularizing term as well as the time step size used for integrating the pseudo-dynamical form. This is borne out through several numerical examples wherein the relative performance of the proposed recursion scheme vis-a-vis a regularized Newton strategy is compared. The pseudo-time marching strategy, when implemented using 3D Cosserat point elements, also provides a computationally cheaper, numerically accurate and simpler alternative to that using geometrically exact shell theories for computing large deformations of membranes in the presence of wrinkles. (C) 2010 Elsevier Ltd. All rights reserved.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Experimental and Computational Characterization of Alloy--Spinel--Corundum Equilibrium in the System Fe--Co--Al--O at 1873K

The three-phase equilibrium between alloy, spinel solid solution and alpha -Al sub 2 O sub 3 in the Fe--Co--Al--O system at 1873k was fully characterized as a function of alloy composition using both experimental and computational methods. The equilibrium oxygen content of the liquid alloy was measured by suction sampling and inert gas fusion analysis. The O potential corresponding to the three-phase equilibrium was determined by emf measurements on a solid state galvanic cell incorporating (Y sub 2 O sub 3 )ThO sub 2 as the solid electrolyte and Cr + Cr sub 2 O sub 3 as the reference electrode. The equilibrium composition of the spinel phase formed at the interface between the alloy and alumina crucible was measured by electron probe microanalysis (EPMA). The experimental results were compared with the values computed using a thermodynamic model. The model used values for standard Gibbs energies of formation of pure end-member spinels and Gibbs energies of solution of gaseous O in liquid Fe and cobalt available in the literature. The activity--composition relationship in the spinel solid solution was computed using a cation distribution model. The variation of the activity coefficient of O with alloy composition in the Fe--Co--O system was estimated using both the quasichemical model of Jacob and Alcock and Wagner's model along with the correlations of Chiang and Chang and Kuo and Chang. The computed results of spinel composition and O potential are in excellent agreement with the experimental data. Graphs. 29 ref.--AA

Finite element analysis of shear critical prestressed SFRC beams

This study reports the details of the finite element analysis of eleven shear critical partially prestressed concrete T-beams having steel fibers over partial or full depth. Prestressed concrete T-beams having a shear span to depth ratio of 2.65 and 1.59 and failing in the shear have been analyzed Using 'ANSYS'. The 'ANSYS' model accounts for the nonlinear phenomenon, such as, bond-slip of longitudinal reinforcements, post-cracking tensile stiffness of the concrete, stress transfer across the cracked blocks of the concrete and load sustenance through the bridging of steel fibers at crack interlace. The concrete is modeled using 'SOLID65'-eight-node brick element, which is capable Of simulating the cracking and crushing behavior of brittle materials. The reinforcements such as deformed bars, prestressing wires and steel fibers have been modeled discretely Using 'LINK8' - 3D spar element. The slip between the reinforcement (rebar, fibers) and the concrete has been modeled using a 'COMBIN39'-non-linear spring element connecting the nodes of the 'LINK8' element representing the reinforcement and nodes of the 'SOLID65' elements representing the concrete. The 'ANSYS' model correctly predicted the diagonal tension failure and shear compression failure of prestressed concrete beams observed in the experiment. I-lie capability of the model to capture the critical crack regions, loads and deflections for various types Of shear failures ill prestressed concrete beam has been illustrated.

High temperature deformation processing maps for boron modified Ti-6Al-4V alloys

The alloy, Ti-6Al-4V is an alpha + beta Ti alloy that has large prior beta grain size (similar to 2 mm) in the as cast state. Minor addition of B (about 0.1 wt.%) to it refines the grain size significantly as well as produces in-situ TiB needles. The role played by these microstructural modifications on high temperature deformation processing maps of B-modified Ti64 alloys is examined in this paper.Power dissipation efficiency and instability maps have been generated within the temperature range of 750-1000 degrees C and strain rate range of 10(-3)-10(+1) s(-1). Various deformation mechanisms, which operate in different temperature-strain rate regimes, were identified with the aid of the maps and complementary microstructural analysis of the deformed specimens. Results indicate four distinct deformation domains within the range of experimental conditions examined, with the combination of 900-1000 degrees C and 10(-3)-10(-2) s(-1) being the optimum for hot working. In that zone, dynamic globularization of alpha laths is the principle deformation mechanism. The marked reduction in the prior beta grain size, achieved with the addition of B, does not appear to alter this domain markedly. The other domains, with negative values of instability parameter, show undesirable microstructural features such as extensive kinking/bending of alpha laths and breaking of beta laths for Ti64-0.0B as well as generation of voids and cracks in the matrix and TiB needles in the B-modified alloys. (C) 2010 Elsevier B.V. All rights reserved.

Outward spherical solidification of a superheated melt with time dependent boundary flux

Short-time analytical solutions of solid and liquid temperatures and freezing front have been obtained for the outward radially symmetric spherical solidification of a superheated melt. Although results are presented here only for time dependent boundary flux, the method of solution can be used for other kinds of boundary conditions also. Later, the analytical solution has been compared with the numerical solution obtained with the help of a finite difference numerical scheme in which the grid points change with the freezing front position. An efficient method of execution of the numerical scheme has been discussed in details. Graphs have been drawn for the total solidification times and temperature distributions in the solid.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Thermodynamic Stability of Potassium-beta-Alumina

The activity of K sub 2 O in a mixture of alpha -alumina and potassium beta -alumina has been determined using a solid state galvanic cell in the temperature range 600-1000K. The cell is written such that the right hand electrode is positive. The solid electrolyte consisted of a dispersion of alpha -alumina ( approx 15 vol.%) in a matrix of K beta -alumina. The emf of the cell was found to be reversible and to vary linearly with temperature. From the emf and auxiliary data on In sub 2 O sub 3 and K sub 2 O from the literature, the activity of K sub 2 O in the two-phase mixture is obtained. The standard free energy of formation of K beta -alumina from component oxides is given. Graphs.

Magnetic fabrics indicating Late Quaternary seismicity in the Himalayan foothills

The anisotropy of magnetic susceptibility (AMS) study was performed on soft sediment samples from a trenched fault zone across the Himalayan frontal thrust (HFT), western Himalaya. AMS orientation of K-min axes in the trench sediments is consistent with lateral shortening revealed by geometry of deformed regional structures and recent earthquakes. Well-defined vertical magnetic foliation parallel to the flexure cleavage in which a vertical magnetic lineation is developed, high anisotropy, and triaxial ellipsoids suggest large overprinting of earth-quake- related fabrics. The AMS data suggest a gradual variation from layer parallel shortening (LPS) at a distance from the fault trace to a simple shear fabric close to the fault trace. An abrupt change in the shortening direction (K-min) from NE-SW to E-W suggests a juxtaposition of pre-existing layer parallel shortening fabric, and bending-related flexure associated with an earthquake. Hence the orientation pattern of magnetic susceptibility axes helps in identifying co-seismic structures in Late Holocene surface sediments.

Nanomechanical properties of silicon surfaces nanostructured by excimer laser

Excimer laser irradiation at ambient temperature has been employed to produce nanostructured silicon surfaces. Nanoindentation was used to investigate the nanomechanical properties of the deformed surfaces as a function of laser parameters, such as the angle of incidence and number of laser pulses at a fixed laser fluence of 5 J cm(-2). A single-crystal silicon 311] surface was severely damaged by laser irradiation and became nanocrystalline with an enhanced porosity. The resulting laser-treated surface consisted of nanometer-sized particles. The pore size was controlled by adjusting the angle of incidence and the number of laser pulses, and varied from nanometers to microns. The extent of nanocrystallinity was large for the surfaces irradiated at a small angle of incidence and by a high number of pulses, as confirmed by x-ray diffraction and Raman spectroscopy. The angle of incidence had a stronger effect on the structure and nanomechanical properties than the number of laser pulses.

Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.