A Theoretical and Experimental Study of Resonance in a High Performance Engine Intake System: Part 2

The unsteady gas dynamic phenomena in a racecar airbox have been examined, and resonant tuning effects have been considered. A coupled 1D/3D analysis, using the engine simulation package Virtual 4-Stroke and the CFD package FLUENT, was used to model the engine and airbox. The models were experimentally validated. An airbox was designed with a natural frequency in the region of 75 Hz. A coupled 1D/3D analysis of the airbox and a Yamaha R6 4 cylinder engine predicted resonance at the single-cylinder induction frequency; 75 Hz at an engine speed of 9000 rpm.

Nonclassicality Criteria from Phase-Space Representations and Information-Theoretical Constraints Are Maximally Inequivalent

We consider two celebrated criteria for defining the nonclassicality of bipartite bosonic quantum systems, the first stemming from information theoretic concepts and the second from physical constraints on the quantum phase space. Consequently, two sets of allegedly classical states are singled out: (i) the set C composed of the so-called classical-classical (CC) states—separable states that are locally distinguishable and do not possess quantum discord; (ii) the set P of states endowed with a positive P representation (P-classical states)—mixtures of Glauber coherent states that, e.g., fail to show negativity of their Wigner function. By showing that C and P are almost disjoint, we prove that the two defining criteria are maximally inequivalent. Thus, the notions of classicality that they put forward are radically different. In particular, generic CC states show quantumness in their P representation, and vice versa, almost all P-classical states have positive quantum discord and, hence, are not CC. This inequivalence is further elucidated considering different applications of P-classical and CC states. Our results suggest that there are other quantum correlations in nature than those revealed by entanglement and quantum discord.

Theoretical and FE analysis of ultrasonic welding of aluminum alloy 3003

Ultrasonic welding (consolidation) process is a rapid manufacturing process that is used to join thin layers of metal at low temperature and low energy consumption. Experimental results have shown that ultrasonic welding is a combination of both surface (friction) and volume (plasticity) softening effects. In the presented work, an attempt has been made to simulate the ultrasonic welding of metals by taking into account these effects (surface and volume). A phenomenological material model has been proposed, which incorporates these two effects (i.e., surface and volume). The thermal softening due to friction and ultrasonic (acoustic) softening has been included in the proposed material model. For surface effects, a friction law with variable coefficient of friction that is dependent on contact pressure, slip, temperature, and number of cycles has been derived from experimental friction tests. The results of the thermomechanical analyses of ultrasonic welding of aluminum alloy have been presented. The goal of this work is to study the effects of ultrasonic welding process parameters, such as applied load, amplitude of ultrasonic oscillation, and velocity of welding sonotrode on the friction work at the weld interface. The change in the friction work at the weld interface has been explained on the basis of softening (thermal and acoustic) of the specimen during the ultrasonic welding process. In the end, a comparison between experimental and simulated results has been presented, showing a good agreement. Copyright © 2009 by ASME.

Implications of Intercellular Signaling for Radiation Therapy: A Theoretical Dose-Planning Study

Purpose
Recent in vitro results have shown significant contributions to cell killing from signaling effects at doses that are typically used in radiation therapy. This study investigates whether these in vitro observations can be reconciled with in vivo knowledge and how signaling may have an impact on future developments in radiation therapy.
Methods and Materials
Prostate cancer treatment plans were generated for a series of 10 patients using 3-dimensional conformal therapy, intensity modulated radiation therapy (IMRT), and volumetric modulated arc therapy techniques. These plans were evaluated using mathematical models of survival following modulated radiation exposures that were developed from in vitro observations and incorporate the effects of intercellular signaling. The impact on dose-volume histograms and mean doses were evaluated by converting these survival levels into "signaling-adjusted doses" for comparison.
Results
Inclusion of intercellular communication leads to significant differences between the signalling-adjusted and physical doses across a large volume. Organs in low-dose regions near target volumes see the largest increases, with mean signaling-adjusted bladder doses increasing from 23 to 33 Gy in IMRT plans. By contrast, in high-dose regions, there is a small decrease in signaling-adjusted dose due to reduced contributions from neighboring cells, with planning target volume mean doses falling from 74 to 71 Gy in IMRT. Overall, however, the dose distributions remain broadly similar, and comparisons between the treatment modalities are largely unchanged whether physical or signaling-adjusted dose is compared. Conclusions Although incorporating cellular signaling significantly affects cell killing in low-dose regions and suggests a different interpretation for many phenomena, their effect in high-dose regions for typical planning techniques is comparatively small. This indicates that the significant signaling effects observed in vitro are not contradicted by comparison with clinical observations. Future investigations are needed to validate these effects in vivo and to quantify their ranges and potential impact on more advanced radiation therapy techniques.

Food web indicators under the Marine Strategy Framework Directive: From complexity to simplicity?

The Marine Strategy Framework Directive (MSFD) requires that European Union Member States achieve "Good Environmental Status" (GES) in respect of 11 Descriptors of the marine environment by 2020. Of those, Descriptor 4, which focuses on marine food webs, is perhaps the most challenging to implement since the identification of simple indicators able to assess the health of highly dynamic and complex interactions is difficult. Here, we present the proposed food web criteria/indicators and analyse their theoretical background and applicability in order to highlight both the current knowledge gaps and the difficulties associated with the assessment of GES. We conclude that the existing suite of indicators gives variable focus to the three important food web properties: structure, functioning and dynamics, and more emphasis should be given to the latter two and the general principles that relate these three properties. The development of food web indicators should be directed towards more integrative and process-based indicators with an emphasis on their responsiveness to multiple anthropogenic pressures. (C) 2013 Elsevier Ltd. All rights reserved.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Xheal: A localized self-healing algorithm using expanders

We consider the problem of self-healing in reconfigurable networks e.g., peer-to-peer and wireless mesh networks. For such networks under repeated attack by an omniscient adversary, we propose a fully distributed algorithm, Xheal, that maintains good expansion and spectral properties of the network, while keeping the network connected. Moreover, Xheal does this while allowing only low stretch and degree increase per node. The algorithm heals global properties like expansion and stretch while only doing local changes and using only local information. We also provide bounds on the second smallest eigenvalue of the Laplacian which captures key properties such as mixing time, conductance, congestion in routing etc. Xheal has low amortized latency and bandwidth requirements. Our work improves over the self-healing algorithms Forgiving tree [PODC 2008] andForgiving graph [PODC 2009] in that we are able to give guarantees on degree and stretch, while at the same time preserving the expansion and spectral properties of the network.

Meta-Theoretical Paradigms Underpinning Risk in Child Welfare: Towards a Position of Methodological Pragmatism

The aim of this paper is to explore the ‘natural attitude’ underpinning risk practices in child welfare. This refers to various taken-for-granted approaches to risk that social workers and other human service professionals draw upon in their everyday practice. The approach proceeds by identifying and critically examining three key, meta-theoretical paradigms on risk which typically shape the natural attitude. They are labelled ‘objectivist’, ‘subjectivist’ and ‘critical’. The ontological, epistemological, axiological and methodological premises supporting each paradigm, and how they shape risk practices, are then reviewed leading to a composite, meta-theoretical position on risk termed ‘methodological pragmatism’. This position draws on the strengths of each paradigm and is formulated into ten propositions which consider how risk should be approached in child welfare. Within this corpus of thought salient themes are endorsed such as the need for method triangulation, an examination of ‘deep causality’, and the promotion of emancipatory perspectives. By critically reflecting on meta-theory, the paper contributes to the development of substantive theories of risk assessment and management in child welfare.

A theoretical assessment of surface defect machining and hot machining of nanocrystalline silicon carbide

In this paper, a newly proposed machining method named “surface defect machining” (SDM) [Wear, 302, 2013 (1124-1135)] was explored for machining of nanocrystalline beta silicon carbide (3C-SiC) at 300K using MD simulation. The results were compared with isothermal high temperature machining at 1200K under the same machining parameters, emulating ductile mode micro laser assisted machining (µ-LAM) and with conventional cutting at 300 K. In the MD simulation, surface defects were generated on the top of the (010) surface of the 3C-SiC work piece prior to cutting, and the workpiece was then cut along the <100> direction using a single point diamond tool at a cutting speed of 10 m/sec. Cutting forces, sub-surface deformation layer depth, temperature in the shear zone, shear plane angle and friction coefficient were used to characterize the response of the workpiece. Simulation results showed that SDM provides a unique advantage of decreased shear plane angle which eases the shearing action. This in turn causes an increased value of average coefficient of friction in contrast to the isothermal cutting (carried at 1200 K) and normal cutting (carried at 300K). The increase of friction coefficient however was found to aid the cutting action of the tool due to an intermittent dropping in the cutting forces, lowering stresses on the cutting tool and reducing operational temperature. Analysis shows that the introduction of surface defects prior to conventional machining can be a viable choice for machining a wide range of ceramics, hard steels and composites compared to hot machining.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.