Wave-based vibration control of large cable net structures

Large cable net structures have been widely applied in aerospace engineering due to the feature of light-weight, high packaging efficiency, and high thermal stability. Structural vibrations induced by a variety of disturbances are inevitable in the space environment, resulting in the requirement of effective vibration control strategies for large cable net structures. Since the large cable net structures have many closely spaced vibrational modes in the range of low frequencies, traditional modal based control may cause modal truncation and spillover problems. In this paper, a wave-based boundary control strategy is adopted and its effectiveness to control the vibration of cable net structures is investigated, by transfer function analysis and numerical methods. It is found that the structural vibration can be absolutely resisted by applying the wave-based boundary controllers onto all the exterior nodes, when disturbances come from the external boundaries of the cable net. Our results in this paper can provide a theoretical basis for the vibration control of large cable net structures.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Analytic hierarchy process for multi-sensor data fusion based on belief function theory

Multi-sensor data fusion is an evolving technology whereby data from multiple sensor inputs are processed and combined. The data derived from multiple sensors can, however, be uncertain, imperfect, and conflicting. The present study is undertaken to help contribute to the continuous search for viable approaches to overcome the problems associated with data conflict and imperfection. Sensor readings, represented by belief functions, have to be fused according to their corresponding weights. Previous studies have often estimated the weights of sensor readings based on a single criterion. Mono-criteria approaches for the assessment of sensor reading weights are, however, often unreliable and inadequate for the reflection of reality. Accordingly, this work opts for the use of a multi-criteria decision aid. A modified Analytical Hierarchy Process (AHP) that incorporates several criteria is proposed to determine the weights of a sensor reading set. The approach relies on the automation of pairwise comparisons to eliminate subjectivity and reduce inconsistency. It assesses the weight of each sensor reading, and fuses the weighed readings obtained using a modified average combination rule. The efficiency of this approach is evaluated in a target recognition context. Several tests, sensitivity analysis, and comparisons with other approaches available in the literature are described.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Lithium Insertion Mechanism in Iron-Based Oxyfluorides with Anionic Vacancies Probed by PDF Analysis

The mechanism of lithium insertion that occurs in an iron oxyfluoride sample with a hexagonal–tungsten–bronze (HTB)-type structure was investigated by the pair distribution function. This study reveals that upon lithiation, the HTB framework collapses to yield disordered rutile and rock salt phases followed by a conversion reaction of the fluoride phase toward lithium fluoride and nanometer-sized metallic iron. The occurrence of anionic vacancies in the pristine framework was shown to strongly impact the electrochemical activity, that is, the reversible capacity scales with the content of anionic vacancies. Similar to FeOF-type electrodes, upon de-lithiation, a disordered rutile phase forms, showing that the anionic chemistry dictates the atomic arrangement of the re-oxidized phase. Finally, it was shown that the nanoscaling and structural rearrangement induced by the conversion reaction allow the in situ formation of new electrode materials with enhanced electrochemical properties.