A feasibility study of a post-buckled beam for actuating helicopter trailing edge flap

Active trailing edge flaps (TEFs) are one of the most promising devices for helicopter vibration reduction. Smart actuators such as the piezoelectric stack actuators (PEAs) are used for TEF actuation. PEAs possess high energy density and have large force in dynamic condition but are limited to small displacements. In this investigation, we study a linear to rotary motion amplification mechanism (AM-2) based on a pinned-pinned post-buckled beam to actuate trailing edge flaps. A linear motion amplification mechanism is developed and coupled with AM-2 to amplify angular flap deflections. Experiments are conducted on bench top-test setup, and maximum flap angle deflections of the order of 12A degrees are achieved in the static case. An aeroelastic analysis is performed and 91 % reduction in helicopter vibration is obtained with multiharmonic control inputs.

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Local disorder investigation in NiS2-xSex using Raman and Ni K-edge x-ray absorption spectroscopies

We report on Raman and Ni K-edge x-ray absorption investigations of a NiS2-xSex (with x = 0.00, 0.50/0.55, 0.60, and 1.20) pyrite family. The Ni K-edge absorption edge shows a systematic shift going from an insulating phase (x = 0.00 and 0.50) to a metallic phase (x = 0.60 and 1.20). The near-edge absorption features show a clear evolution with Se doping. The extended x-ray absorption fine structure data reveal the evolution of the local structure with Se doping which mainly governs the local disorder. We also describe the decomposition of the NiS2-xSex Raman spectra and investigate the weights of various phonon modes using Gaussian and Lorentzian profiles. The effectiveness of the fitting models in describing the data is evaluated by means of Bayes factor estimation. The Raman analysis clearly demonstrates the disorder effects due to Se alloying in describing the phonon spectra of NiS2-xSex pyrites.

Effect of functional groups on separating carbon dioxide from CO2/N-2 gas mixtures using edge functionalized graphene nanoribbons

Development of microporous adsorbents for separation and sequestration of carbon dioxide from flue gas streams is an area of active research. In this study, we assess the influence of specific functional groups on the adsorption selectivity of CO2/N-2 mixtures through Grand Canonical Monte Carlo (GCMC) simulations. Our model system consists of a bilayer graphene nanoribbon that has been edge functionalized with OH, NH2, NO2, CH3 and COOH. Ab initio Moller-Plesset (MP2) calculations with functionalized benzenes are used to obtain binding energies and optimized geometries for CO2 and N-2. This information is used to validate the choice classical forcefields in GCMC simulations. In addition to simulations of adsorption from binary mixtures of CO2 and N-2, the ideal adsorbed solution theory (IAST) is used to predict mixture isotherms. Our study reveals that functionalization always leads to an increase in the adsorption of both CO2 and N-2 with the highest for COOH. However, significant enhancement in the selectivity for CO2 is only seen with COOH functionalized nanoribbons. The COOH functionalization gives a 28% increase in selectivity compared to H terminated nanoribbons, whereas the improvement in the selectivity for other functional groups are much Enure modest. Our study suggests that specific functionalization with COOH groups can provide a material's design strategy to improve CO2 selectivity in microporous adsorbents. Synthesis of graphene nanoplatelets with edge functionalized COOH, which has the potential for large scale production, has recently been reported (Jeon el, al., 2012). (C) 2014 Elsevier Ltd. All rights reserved,

Rainbow matchings in strongly edge-colored graphs

A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G). Wang (2011) asked whether there exists a function f such that a properly edge-colored graph G with at least f (delta(G)) vertices is guaranteed to contain a rainbow matching of size delta(G). This was answered in the affirmative later: the best currently known function Lo and Tan (2014) is f(k) = 4k - 4, for k >= 4 and f (k) = 4k - 3, for k <= 3. Afterwards, the research was focused on finding lower bounds for the size of maximum rainbow matchings in properly edge-colored graphs with fewer than 4 delta(G) - 4 vertices. Strong edge-coloring of a graph G is a restriction of proper edge-coloring where every color class is required to be an induced matching, instead of just being a matching. In this paper, we give lower bounds for the size of a maximum rainbow matching in a strongly edge-colored graph Gin terms of delta(G). We show that for a strongly edge-colored graph G, if |V(G)| >= 2 |3 delta(G)/4|, then G has a rainbow matching of size |3 delta(G)/4|, and if |V(G)| < 2 |3 delta(G)/4|, then G has a rainbow matching of size |V(G)|/2] In addition, we prove that if G is a strongly edge-colored graph that is triangle-free, then it contains a rainbow matching of size at least delta(G). (C) 2015 Elsevier B.V. All rights reserved.

Mixed Mode Analysis of Obliquely Oriented Edge Cracked Semicircular Disk Under Compression

A new mixed-mode compression fracture specimen, obliquely oriented edge cracked semicircular disk (OECSD) is analyzed by extending pure opening mode configuration of edge cracked semicircular disk (ECSD) under Hertzian compression. Photoelastic experiments are conducted on two different specimens of OECSD of same size and different crack lengths and inclinations. Finite element method (FEM) is used to solve a number of cases of the problem varying crack length and crack inclination. FE results show a good match with experiments. Inclination of edge crack in OECSD can be so made as to obtain any mode-mixity ratio between zero and one and beyond for any crack length. The new specimen can be used for fracture testing under compression more conveniently than the existing ones in several ways.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

Robust design of multiple trailing edge flaps for helicopter vibration reduction: A multi-objective bat algorithm approach

The objective of this study is to determine an optimal trailing edge flap configuration and flap location to achieve minimum hub vibration levels and flap actuation power simultaneously. An aeroelastic analysis of a soft in-plane four-bladed rotor is performed in conjunction with optimal control. A second-order polynomial response surface based on an orthogonal array (OA) with 3-level design describes both the objectives adequately. Two new orthogonal arrays called MGB2P-OA and MGB4P-OA are proposed to generate nonlinear response surfaces with all interaction terms for two and four parameters, respectively. A multi-objective bat algorithm (MOBA) approach is used to obtain the optimal design point for the mutually conflicting objectives. MOBA is a recently developed nature-inspired metaheuristic optimization algorithm that is based on the echolocation behaviour of bats. It is found that MOBA inspired Pareto optimal trailing edge flap design reduces vibration levels by 73% and flap actuation power by 27% in comparison with the baseline design.

Fermionic edge states and new physics

We investigate the properties of the Dirac operator on manifolds with boundaries in the presence of the Atiyah-Patodi-Singer boundary condition. An exact counting of the number of edge states for boundaries with isometry of a sphere is given. We show that the problem with the above boundary condition can be mapped to one where the manifold is extended beyond the boundary and the boundary condition is replaced by a delta function potential of suitable strength. We also briefly highlight how the problem of the self-adjointness of the operators in the presence of moving boundaries can be simplified by suitable transformations which render the boundary fixed and modify the Hamiltonian and the boundary condition to reflect the effect of moving boundary.

Anonymous Authentication with Shared Secrets

Anonymity and authenticity are both important yet often conflicting security goals in a wide range of applications. On the one hand for many applications (say for access control) it is crucial to be able to verify the identity of a given legitimate party (a.k.a. entity authentication). Alternatively an application might require that no one but a party can communicate on its behalf (a.k.a. message authentication). Yet, on the other hand privacy concerns also dictate that anonymity of a legitimate party should be preserved; that is no information concerning the identity of parties should be leaked to an outside entity eavesdropping on the communication. This conflict becomes even more acute when considering anonymity with respect to an active entity that may attempt to impersonate other parties in the system. In this work we resolve this conflict in two steps. First we formalize what it means for a system to provide both authenticity and anonymity even in the presence of an active man-in-the-middle adversary for various specific applications such as message and entity authentication using the constructive cryptography framework of Mau11, MR11]. Our approach inherits the composability statement of constructive cryptography and can therefore be directly used in any higher-level context. Next we demonstrate several simple protocols for realizing these systems, at times relying on a new type of (probabilistic) Message Authentication Code (MAC) called key indistinguishable (KI) MACs. Similar to the key hiding encryption schemes of BBDP01] they guarantee that tags leak no discernible information about the keys used to generate them.

Supersymmetry: Boundary conditions and edge states

When spatial boundaries are inserted, supersymmetry (SUSY) can be broken. We have shown that in an N = 2 supersymmetric theory, all local boundary conditions allowed by self-adjointness of the Hamiltonian break N = 2 SUSY, while only a few of these boundary conditions preserve N = 1 SUSY. We have also shown that for a subset of the boundary conditions compatible with N = 1 SUSY, there exist fermionic ground states which are localized near the boundary. We also show that only very few nonlocal boundary conditions like periodic boundary conditions preserve full N = 2 supersymmetry, but none of them exhibits edge states.

Many-Body Localization in the Presence of a Single-Particle Mobility Edge

In one dimension, noninteracting particles can undergo a localization-delocalization transition in a quasiperiodic potential. Recent studies have suggested that this transition transforms into a many-body localization (MBL) transition upon the introduction of interactions. It has also been shown that mobility edges can appear in the single particle spectrum for certain types of quasiperiodic potentials. Here, we investigate the effect of interactions in two models with such mobility edges. Employing the technique of exact diagonalization for finite-sized systems, we calculate the level spacing distribution, time evolution of entanglement entropy, optical conductivity, and return probability to detect MBL. We find that MBL does indeed occur in one of the two models we study, but the entanglement appears to grow faster than logarithmically with time unlike in other MBL systems.