Using mesh-geometry relationships to transfer analysis models between CAE tools

Integrating analysis and design models is a complex task due to differences between the models and the architectures of the toolsets used to create them. This complexity is increased with the use of many different tools for specific tasks using an analysis process. In this work various design and analysis models are linked throughout the design lifecycle, allowing them to be moved between packages in a way not currently available. Three technologies named Cellular Modeling, Virtual Topology and Equivalencing are combined to demonstrate how different finite element meshes generated on abstract analysis geometries can be linked to their original geometry. Cellular models allow interfaces between adjacent cells to be extracted and exploited to transfer analysis attributes such as mesh associativity or boundary conditions between equivalent model representations. Virtual Topology descriptions used for geometry clean-up operations are explicitly stored so they can be reused by downstream applications. Establishing the equivalence relationships between models enables analysts to utilize multiple packages for specialist tasks without worrying about compatibility issues or substantial rework.

Defining Simulation Intent

Defining Simulation Intent involves capturing high level modelling and idealisation decisions in order to create an efficient and fit-for-purpose analysis. These decisions are recorded as attributes of the decomposed design space.

An approach to defining Simulation Intent is described utilising three known technologies: Cellular Modelling, the subdivision of space into volumes of simulation significance (structures, gas paths, internal and external airflows etc.); Equivalencing, maintaining a consistent and coherent description
of the equivalent representations of the spatial cells in different analysis models; and Virtual Topology, which offers tools for partitioning and de-partitioning the model without disturbing the manufacturing oriented design geometry. The end result is a convenient framework to which high level analysis attributes can be applied, and from which detailed analysis models can be generated
with a high degree of controllability, repeatability and automation. There are multiple novel aspects to the approach, including its reusability, robustness to changes in model topology and the inherent links created between analysis models at different levels of fidelity and physics.

By utilising Simulation Intent, CAD modelling for simulation can be fully exploited and simulation work-flows can be more readily automated, reducing many repetitive manual tasks (e.g. the definition of appropriate coupling between elements of different types and the application of boundary conditions). The approach has been implemented and tested with practical examples, and
significant benefits are demonstrated.

Rational equivariant rigidity

We prove that if G is S1 or a profinite group, then all of the homotopical information of the category of rational G-spectra is captured by the triangulated structure of the rational G-equivariant stable homotopy category.

That is, for G profinite or S1, the rational G-equivariant stable homotopy category is rigid. For the case of profinite groups this rigidity comes from an intrinsic formality statement, so we carefully relate the notion of intrinsic formality of a differential graded algebra to rigidity.

Idealized Operation of Third-Harmonic-Peaking Class-Ef Power Amplifier with Extended Maximum Operating Frequency

A new variant of Class-EF power amplifier (PA), the so-called third-harmonic-peaking Class-EF, is presented. It inherits a soft-switching operation from the Class-E PA and a low peak switch voltage from the Class-F PA. More importantly, the new topology allows operations at higher frequencies and permits deployment of large transistors which is normally prohibited since they are always accompanied with high output capacitances. Using a simple transmission-line load network, the PA is synthesized to satisfy Class-EF impedances at fundamental frequency, third harmonic, and all even harmonics as well as to simultaneously provide an impedance matching to 50-Ω load.

Three-port DC-DC Converter for Stand-Alone Photovoltaic Systems

System efficiency and cost effectiveness are of critical importance for photovoltaic (PV) systems. This paper addresses the two issues by developing a novel three-port DC-DC converter for stand-alone PV systems, based on an improved Flyback-Forward topology. It provides a compact single-unit solution with a combined feature of optimized maximum power point tracking (MPPT), high step-up ratio, galvanic isolation and multiple operating modes for domestic and aerospace applications. A theoretical analysis is conducted to analyze the operating modes followed by simulation and experimental work. The paper is focused on a comprehensive modulation strategy utilizing both PWM and phase-shifted control that satisfies the requirement of PV power systems to achieve MPPT and output voltage regulation. A 250 W converter was designed and prototyped to provide experimental verification in term of system integration and high conversion efficiency.

DEX: Self-Healing Expanders

We present a fully-distributed self-healing algorithm DEX, that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders - whose expansion properties hold deterministically - that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion which rapidly degrade in a dynamic setting, in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(log n) rounds and O(log n) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table (DHT) on top of DEX, with only a constant additional overhead. Our results are a step towards implementing efficient self-healing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.

Formation stability analysis of unmanned multi-vehicles under interconnection topologies

In this paper, the overall formation stability of unmanned multi-vehicle is mathematically presented under interconnection topologies. A novel definition of formation error is first given and followed by the proposed formation stability hypothesis. Based on this hypothesis, a unique extension-decomposition-aggregation scheme is then employed to support the stability analysis for the overall multi-vehicle formation under a mesh topology. It is proved that the overall formation control system consisting of N number of nonlinear vehicles is not only asymptotically, but also exponentially stable in the sense of Lyapunov within a neighbourhood of the desired formation. This technique is shown to be applicable for a mesh topology but is equally applicable for other topologies. Simulation study of the formation manoeuvre of multiple Aerosonde UAVs, in 3D-space, is finally carried out verifying the achieved formation stability result.

ELM-induced transient tungsten melting in the JET divertor

The original goals of the JET ITER-like wall included the study of the impact of an all W divertor on plasma operation (Coenen et al 2013 Nucl. Fusion 53 073043) and fuel retention (Brezinsek et al 2013 Nucl. Fusion 53 083023). ITER has recently decided to install a full-tungsten (W) divertor from the start of operations. One of the key inputs required in support of this decision was the study of the possibility of W melting and melt splashing during transients. Damage of this type can lead to modifications of surface topology which could lead to higher disruption frequency or compromise subsequent plasma operation. Although every effort will be made to avoid leading edges, ITER plasma stored energies are sufficient that transients can drive shallow melting on the top surfaces of components. JET is able to produce ELMs large enough to allow access to transient melting in a regime of relevance to ITER.

Transient W melt experiments were performed in JET using a dedicated divertor module and a sequence of I-P = 3.0 MA/B-T = 2.9 T H-mode pulses with an input power of P-IN = 23 MW, a stored energy of similar to 6 MJ and regular type I ELMs at Delta W-ELM = 0.3 MJ and f(ELM) similar to 30 Hz. By moving the outer strike point onto a dedicated leading edge in the W divertor the base temperature was raised within similar to 1 s to a level allowing transient, ELM-driven melting during the subsequent 0.5 s. Such ELMs (delta W similar to 300 kJ per ELM) are comparable to mitigated ELMs expected in ITER (Pitts et al 2011 J. Nucl. Mater. 415 (Suppl.) S957-64).

Although significant material losses in terms of ejections into the plasma were not observed, there is indirect evidence that some small droplets (similar to 80 mu m) were released. Almost 1 mm (similar to 6 mm(3)) of W was moved by similar to 150 ELMs within 7 subsequent discharges. The impact on the main plasma parameters was minor and no disruptions occurred. The W-melt gradually moved along the leading edge towards the high-field side, driven by j x B forces. The evaporation rate determined from spectroscopy is 100 times less than expected from steady state melting and is thus consistent only with transient melting during the individual ELMs. Analysis of IR data and spectroscopy together with modelling using the MEMOS code Bazylev et al 2009 J. Nucl. Mater. 390-391 810-13 point to transient melting as the main process. 3D MEMOS simulations on the consequences of multiple ELMs on damage of tungsten castellated armour have been performed.

These experiments provide the first experimental evidence for the absence of significant melt splashing at transient events resembling mitigated ELMs on ITER and establish a key experimental benchmark for the MEMOS code.

Real-time temperature estimation for power MOSFETs considering thermal aging effects

This paper presents a novel real-time power-device temperature estimation method that monitors the power MOSFET's junction temperature shift arising from thermal aging effects and incorporates the updated electrothermal models of power modules into digital controllers. Currently, the real-time estimator is emerging as an important tool for active control of device junction temperature as well as online health monitoring for power electronic systems, but its thermal model fails to address the device's ongoing degradation. Because of a mismatch of coefficients of thermal expansion between layers of power devices, repetitive thermal cycling will cause cracks, voids, and even delamination within the device components, particularly in the solder and thermal grease layers. Consequently, the thermal resistance of power devices will increase, making it possible to use thermal resistance (and junction temperature) as key indicators for condition monitoring and control purposes. In this paper, the predicted device temperature via threshold voltage measurements is compared with the real-time estimated ones, and the difference is attributed to the aging of the device. The thermal models in digital controllers are frequently updated to correct the shift caused by thermal aging effects. Experimental results on three power MOSFETs confirm that the proposed methodologies are effective to incorporate the thermal aging effects in the power-device temperature estimator with good accuracy. The developed adaptive technologies can be applied to other power devices such as IGBTs and SiC MOSFETs, and have significant economic implications. 

Space-Constrained Massive MIMO: Hitting the Wall of Favorable Propagation

The recent development of the massive multiple-input multiple-output (MIMO) paradigm, has been extensively based on the pursuit of favorable propagation: in the asymptotic limit, the channel vectors become nearly orthogonal and interuser interference tends to zero [1]. In this context, previous studies
have considered fixed inter-antenna distance, which implies an increasing array aperture as the number of elements increases. Here, we focus on a practical, space-constrained topology, where an increase in the number of antenna elements in a fixed total space imposes an inversely proportional decrease in the inter-antenna distance. Our analysis shows that, contrary to existing studies, inter-user interference does not vanish in the massive MIMO regime, thereby creating a saturation effect on the achievable rate.

The anticipatory space of the bunker, modernity’s dark mirror

The buried and semi-buried bunker, bulwark since the early eighteenth century against increasingly sophisticated forms of ordnance, emerged in increasing number in Europe throughout the twentieth century across a series of scales from the household Anderson shelter to the vast infrastructural works of the Maginot and Siegfried lines, or the Atlantic Wall. Its latest proliferation took place during the Cold War. From these perspectives, it is as emblematic of modernity as the department store, the great exhibition, the skyscraper or the machine-inspired domestic space advocated by Le Corbusier. It also represents the obverse, or perhaps a parodic iteration, of the preoccupations of early architectural modernism: a vast underground international style, cast in millions of tons of thick, reinforced concrete retaining walls, whose spatial relationship to the landscape above was strictly mediated through the periscope, the loop-hole, the range finder and the strategic necessity to both resist and facilitate the technologies and scopic regimes of weaponry. Embarking from Bunker Archaeology, this paper critically uncoils Paul Virillo’s observation, that once physically eclipsed in its topographical and technical settings, the bunker’s efficacy would mutate to other domains, retaining and remaking its meaning in another topology during the Cold War. ‘The essence of the new fortress’ he writes ‘is elsewhere, underfoot, invisible from here on in’. Shaped by this impulse, this paper seeks to render visible the bunker’s significance in a wider milieu and, in doing so, excavate some of the relationships between the physical artefact, its implications and its enduring metaphorical and perceptual ghosts.

Topological analysis of the Escherichia coli WcaJ protein reveals a new conserved configuration for the polyisoprenyl-phosphate hexose-1-phosphate transferase family

WcaJ is an Escherichia coli membrane enzyme catalysing the biosynthesis of undecaprenyl-diphosphate-glucose, the first step in the assembly of colanic acid exopolysaccharide. WcaJ belongs to a large family of polyisoprenyl-phosphate hexose-1-phosphate transferases (PHPTs) sharing a similar predicted topology consisting of an N-terminal domain containing four transmembrane helices (TMHs), a large central periplasmic loop, and a C-terminal domain containing the fifth TMH (TMH-V) and a cytosolic tail. However, the topology of PHPTs has not been experimentally validated. Here, we investigated the topology of WcaJ using a combination of LacZ/PhoA reporter fusions and sulfhydryl
labelling by PEGylation of novel cysteine residues introduced into a cysteine-less WcaJ. The results showed that the large central loop and the C-terminal tail both reside in the cytoplasm and are separated by TMH-V, which does not fully span the membrane, likely forming a "hairpin" structure. Modelling of TMH-V revealed that a highly conserved proline might contribute to a helix-break-helix structure in all PHPT members. Bioinformatic analyses show that all of these features are conserved in PHPT homologues from
Gram-negative and Gram-positive bacteria. Our data demonstrate a novel topological configuration for PHPTs, which is proposed as a signature for all members of this enzyme family

New Complexity Results for MAP in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. It is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure), which extends previous complexity results. Furthermore, a Fully Polynomial Time Approximation Scheme for MAP in networks with bounded treewidth and bounded number of states per variable is developed. Approximation schemes were thought to be impossible, but here it is shown otherwise under the assumptions just mentioned, which are adopted in most applications.

New Results for the MAP Problem in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. First, it is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure). Such proofs extend previous complexity results for the problem. Inapproximability results are also derived in the case of trees if the number of states per variable is not bounded. Although the problem is shown to be hard and inapproximable even in very simple scenarios, a new exact algorithm is described that is empirically fast in networks of bounded treewidth and bounded number of states per variable. The same algorithm is used as basis of a Fully Polynomial Time Approximation Scheme for MAP under such assumptions. Approximation schemes were generally thought to be impossible for this problem, but we show otherwise for classes of networks that are important in practice. The algorithms are extensively tested using some well-known networks as well as random generated cases to show their effectiveness.

NP-hardness of MAP in Ternary Tree Bayesian Networks

This paper strengthens the NP-hardness result for the (partial) maximum a posteriori (MAP) problem in Bayesian networks with topology of trees (every variable has at most one parent) and variable cardinality at most three. MAP is the problem of querying the most probable state configuration of some (not necessarily all) of the network variables given evidence. It is demonstrated that the problem remains hard even in such simplistic networks.