Microscopic Mechanisms of Strain Hardening in Glassy Polymers

The mechanisms underlying the increase in stress for large mechanical strains of a polymer glass, quantified by the strain-hardening modulus, are still poorly understood. In the present paper we aim to elucidate this matter and present new mechanisms. Molecular-dynamics simulations of two polymers with very different strain-hardening moduli (polycarbonate and polystyrene) have been carried out. Nonaffine displacements occur because of steric hindrances and connectivity constraints. We argue that it is not necessary to introduce the concept of entanglements to understand strain hardening, but that hardening is rather coupled with the increase in the rate of nonaffine particle displacements. This rate increases faster for polycarbonate, which has the higher strain-hardening modulus. Also more nonaffine chain stretching is present for polycarbonate. It is shown that the inner distances of such a nonaffinely deformed chain can be well described by the inner distances of the worm-like chain, but with an effective stiffness length (equal to the Kuhn length for an infinite worm-like chain) that increases during deformation. It originates from the finite extensibility of the chain. In this way the increase in nonaffine particle displacement can be understood as resulting from an increase in the effective stiffness length of the perturbed chain during deformation, so that at larger strains a higher rate of plastic events in terms of nonaffine displacement is necessary, causing in turn the observed strain hardening in polymer glasses.

Periodic Reordering

For many networks in nature, science and technology, it is possible to order the nodes so that most links are short-range, connecting near-neighbours, and relatively few long-range links, or shortcuts, are present. Given a network as a set of observed links (interactions), the task of finding an ordering of the nodes that reveals such a range-dependent structure is closely related to some sparse matrix reordering problems arising in scientific computation. The spectral, or Fiedler vector, approach for sparse matrix reordering has successfully been applied to biological data sets, revealing useful structures and subpatterns. In this work we argue that a periodic analogue of the standard reordering task is also highly relevant. Here, rather than encouraging nonzeros only to lie close to the diagonal of a suitably ordered adjacency matrix, we also allow them to inhabit the off-diagonal corners. Indeed, for the classic small-world model of Watts & Strogatz (1998, Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442) this type of periodic structure is inherent. We therefore devise and test a new spectral algorithm for periodic reordering. By generalizing the range-dependent random graph class of Grindrod (2002, Range-dependent random graphs and their application to modeling large small-world proteome datasets. Phys. Rev. E, 66, 066702-1–066702-7) to the periodic case, we can also construct a computable likelihood ratio that suggests whether a given network is inherently linear or periodic. Tests on synthetic data show that the new algorithm can detect periodic structure, even in the presence of noise. Further experiments on real biological data sets then show that some networks are better regarded as periodic than linear. Hence, we find both qualitative (reordered networks plots) and quantitative (likelihood ratios) evidence of periodicity in biological networks.

Conical sedimentary structures, trace fossils or not? Observations, experiments, and review

Conical sedimentary structures are widespread in the geological column. Those that are mediated by organisms (or organic matter) can be attributed to seven principal processes, which are investigated by experiment and/or field observations: (1) sand collapse into a cavity (decomposed body, open shaft, or gallery), (2) upward (escape) or downward locomotion by an organism through the sediment, (3) upward adjustment (equilibration), (4) casting of coelenterates' excavations, (5) organism-mediated soft-sediment deformation in heterolithic sediment, (6) biodeformational small and large excavations by organisms, and (7) fluid (gas or liquid) escape structures. Footprint loading may also be included. Criteria are given to distinguish between these processes. Dewatering pipes are best recognized by a zone of deformed and fluidized sediment at the base, and association with non-life (lethal) facies. Care must be used in assigning specimens to ichnotaxa, and it is generally necessary to slab, and also to carry out stratinomic investigation in the field.

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

A kinematically distorted flux rope model for magnetic clouds

Constant-α force-free magnetic flux rope models have proven to be a valuable first step toward understanding the global context of in situ observations of magnetic clouds. However, cylindrical symmetry is necessarily assumed when using such models, and it is apparent from both observations and modeling that magnetic clouds have highly noncircular cross sections. A number of approaches have been adopted to relax the circular cross section approximation: frequently, the cross-sectional shape is allowed to take an arbitrarily chosen shape (usually elliptical), increasing the number of free parameters that are fit between data and model. While a better “fit” may be achieved in terms of reducing the mean square error between the model and observed magnetic field time series, it is not always clear that this translates to a more accurate reconstruction of the global structure of the magnetic cloud. We develop a new, noncircular cross section flux rope model that is constrained by observations of CMEs/ICMEs and knowledge of the physical processes acting on the magnetic cloud: The magnetic cloud is assumed to initially take the form of a force-free flux rope in the low corona but to be subsequently deformed by a combination of axis-centered self-expansion and heliocentric radial expansion. The resulting analytical solution is validated by fitting to artificial time series produced by numerical MHD simulations of magnetic clouds and shown to accurately reproduce the global structure.

On the evolution of the solar wind between 1 and 5 AU at the time of the Cassini Jupiter flyby: Multispacecraft observations of interplanetary coronal mass ejections including the formation of a merged interaction region

The Cassini flyby of Jupiter occurred at a time near solar maximum. Consequently, the pre-Jupiter data set reveals clear and numerous transient perturbations to the Parker Spiral solar wind structure. Limited plasma data are available at Cassini for this period due to pointing restrictions imposed on the instrument. This renders the identification of the nature of such structures ambiguous, as determinations based on the magnetic field data alone are unreliable. However, a fortuitous alignment of the planets during this encounter allowed us to trace these structures back to those observed previously by the Wind spacecraft near the Earth. Of the phenomena that we are satisfactorily able to trace back to their manifestation at 1 AU, two are identified as being due to interplanetary coronal mass ejections. One event at Cassini is shown to be a merged interaction region, which is formed from the compression of a magnetic cloud by two anomalously fast solar wind streams. The flux-rope structure associated with this magnetic cloud is not as apparent at Cassini and has most likely been compressed and deformed. Confirmation of the validity of the ballistic projections used here is provided by results obtained from a one-dimensional magnetohydrodynamic projection of solar wind parameters measured upstream near the Earth. It is found that when the Earth and Cassini are within a few tens of degrees in heliospheric longitude, the results of this one-dimensional model predict the actual conditions measured at 5 AU to an impressive degree. Finally, the validity of the use of such one-dimensional projections in obtaining quasi-solar wind parameters at the outer planets is discussed.

A pattern language for goals

Previous work has established the value of goal-oriented approaches to requirements engineering. Achieving clarity and agreement about stakeholders’ goals and assumptions is critical for building successful software systems and managing their subsequent evolution. In general, this decision-making process requires stakeholders to understand the implications of decisions outside the domains of their own expertise. Hence it is important to support goal negotiation and decision making with description languages that are both precise and expressive, yet easy to grasp. This paper presents work in progress to develop a pattern language for describing goal refinement graphs. The language has a simple graphical notation, which is supported by a prototype editor tool, and a symbolic notation based on modal logic.

High performance subgraph mining in molecular compounds

Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques particularly relevant. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiver-initiated, load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening dataset, where the approach attains close-to linear speedup in a network of workstations.

Slicing of soft, flexible solids with industrial applications

Thin slices of soft flexible solids have negligible bending resistance and hence store negligible elastic strain energy; furthermore such offcuts are rarely permanently deformed after slicing. Cutting forces thus depend only on work of separation (toughness work) and friction. These simplifying assumptions are not as restrictive as it might seem, and the mechanics are found to apply to a wide variety of foodstuffs and biological materials. The fracture toughness of such materials may be determined from cutting experiments: the use of scissors instrumented for load and displacement is a popular method where toughness is obtained from the work areas beneath load–displacement plots. Surprisingly, there is no analysis for the variation of forces with scissor blade opening and this paper provides the theory. Comparison is made with experimental results in cutting with scissors. The analysis is generalised to cutting with blades of variable curvature and applied to a commercial food cutting device having a rotating spiral plan form blade. The strong influence of the ‘slice/push ratio’ (blade tangential speed to blade edge normal speed) on the cutting forces is revealed. Small cutting forces are important in food cutting machinery as damage to slices is minimised. How high slice/push ratios may be achieved by choice of blade profile is discussed.

Extending the friction cone algorithm for arbitrary polygon based haptic objects

Most haptic environments are based on single point interactions whereas in practice, object manipulation requires multiple contact points between the object, fingers, thumb and palm. The Friction Cone Algorithm was developed specifically to work well in a multi-finger haptic environment where object manipulation would occur. However, the Friction Cone Algorithm has two shortcomings when applied to polygon meshes: there is no means of transitioning polygon boundaries or feeling non-convex edges. In order to overcome these deficiencies, Face Directed Connection Graphs have been developed as well as a robust method for applying friction to non-convex edges. Both these extensions are described herein, as well as the implementation issues associated with them.

How can a blind engineer access the curriculum?

The arrival of a student who is Blind in the School of Systems Engineering at the University of Reading has made it an interesting and challenging year for all. Visually impaired students have already graduated from other Schools of the University and the School of Systems Engineering has seen three students with visual impairment graduate recently with good degrees. These students could access materials - and do assessments - essentially by means of enlargement and judicious choice of options. The new student had previously been supported by a specialist college. She is a proficient typist and also a user of both Braille and JAWS screen reader, and she is doing a joint course in Cybernetics and Computer Science. The course requires mathematics which itself includes graphs, and also many diagrams including numerous circuit diagrams. The University bought proven equipment such as a scanner to process books into speech or Braille, and screen reading software as well as a specialist machine for producing tactile diagrams for educational use. Clearly it is also important that the student can access assessments and examinations and present answers for marking or feedback (by sighted staff). So the School also used innovative in-house tactile methods to represent diagrams. This paper discusses the success or otherwise of various modifications of course delivery and the way forward for the next three years.

Generalized matching networks and their properties

In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cubes and the star graphs. We prove that a GMN on a family of k-connected building graphs is -connected. We then prove that a GMN on a family of Hamiltonian-connected building graphs having at least three vertices each is Hamiltonian-connected. Our conclusions generalize some previously known results.

Minimum neighborhood in a generalized cube

Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.

Largest connected component of a star graph with faulty vertices

In order to make a full evaluation of an interconnection network, it is essential to estimate the minimum size of a largest connected component of this network provided the faulty vertices in the network may break its connectedness. Star graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We prove that, in an n-star graph (n >= 3) with up to 2n-4 faulty vertices, all fault-free vertices but at most two form a connected component. Moreover, all fault-free vertices but exactly two form a connected component if and only if the set of all faulty vertices is equal to the neighbourhood of a pair of fault-free adjacent vertices. These results show that star graphs exhibit excellent fault-tolerant abilities in the sense that there exists a large functional network in a faulty star graph.

Small-world effects in lattice stochastic diffusion search

Stochastic Diffusion Search is an efficient probabilistic bestfit search technique, capable of transformation invariant pattern matching. Although inherently parallel in operation it is difficult to implement efficiently in hardware as it requires full inter-agent connectivity. This paper describes a lattice implementation, which, while qualitatively retaining the properties of the original algorithm, restricts connectivity, enabling simpler implementation on parallel hardware. Diffusion times are examined for different network topologies, ranging from ordered lattices, over small-world networks to random graphs.