Stable Marriage with Multi-Modal Preferences

We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one "evaluation mode" (e.g., more than one criterion); thus, each agent is equipped with multiple preference lists, each ranking the counterparts in a possibly different way. We introduce and study three natural concepts of stability, investigate their mutual relations and focus on computational complexity aspects with respect to computing stable matchings in these new scenarios. Mostly encountering computational hardness (NP-hardness), we can also spot few islands of tractability and make a surprising connection to the \textsc{Graph Isomorphism} problem

Empirical forecasting practices of a British university

This article is based on a single case study aimed at examining behavioral issues of forecasting, in particular the role and practice of forecasting in a British university settings. Key variables were identified in establishing associations between the variables that provide suitable criteria for the purpose of this study. Data collection was based on questionnaires distributed to people involved and interviews which were held with prominent staff of the University. Fisher-exact tests were performed to identify significant associations between variables. Results indicated the various levels of perceptions and practices of forecasting produced by the people involved at the University. The study implies that useful insights can be gathered through forecasting from a different perspective of the non-profit making service industry

Electrically monitoring DNA repair by photolyase

Cyclobutane pyrimidine dimers are the major DNA photoproducts produced upon exposure to UV radiation. If left unrepaired, these lesions can lead to replication errors, mutation, and cell death. Photolyase is a light-activated flavoenzyme that binds to pyrimidine dimers in DNA and repairs them in a reaction triggered by electron transfer from the photoexcited flavin cofactor to the dimer. Using gold electrodes modified with DNA duplexes containing a cyclobutane thymine dimer (T T), here we probe the electrochemistry of the flavin cofactor in Escherichia coli photolyase. Cyclic and square-wave voltammograms of photolyase deposited on these electrodes show a redox signal at 40 mV versus normal hydrogen electrode, consistent with electron transfer to and from the flavin in the DNA-bound protein. This signal is dramatically attenuated on surfaces where the pi-stacking of the DNA bases is perturbed by the presence of an abasic site below the T T, an indication that the redox pathway is DNA-mediated. DNA repair can, moreover, be monitored electrically. Exposure of photolyase on T T-damaged DNA films to near-UV/blue light leads to changes in the flavin signal consistent with repair, as confirmed by parallel HPLC experiments. These results demonstrate the exquisite sensitivity of DNA electrochemistry to perturbations in base pair stacking and the applicability of this chemistry to probe reactions of proteins with DNA

Efficient unified Montgomery inversion with multibit shifting

Computation of multiplicative inverses in finite fields GF(p) and GF(2/sup n/) is the most time-consuming operation in elliptic curve cryptography, especially when affine co-ordinates are used. Since the existing algorithms based on the extended Euclidean algorithm do not permit a fast software implementation, projective co-ordinates, which eliminate almost all of the inversion operations from the curve arithmetic, are preferred. In the paper, the authors demonstrate that affine co-ordinate implementation provides a comparable speed to that of projective co-ordinates with careful hardware realisation of existing algorithms for calculating inverses in both fields without utilising special moduli or irreducible polynomials. They present two inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inversion algorithm. The similarity of the two algorithms allows the design of a single unified hardware architecture that performs the computation of inversion in both fields. They also propose a hardware structure where the field elements are represented using a multi-word format. This feature allows a scalable architecture able to operate in a broad range of precision, which has certain advantages in cryptographic applications. In addition, they include statistical comparison of four inversion algorithms in order to help choose the best one amongst them for implementation onto hardware

Structural response of SSME turbine blade airfoils

Reusable space propulsion hot gas-path components are required to operate under severe thermal and mechanical loading conditions. These operating conditions produce elevated temperature and thermal transients which results in significant thermally induced inelastic strains, particularly, in the turbopump turbine blades. An inelastic analysis for this component may therefore be necessary. Anisotropic alloys such as MAR M-247 or PWA-1480 are being considered to meet the safety and durability requirements of this component. An anisotropic inelastic structural analysis for an SSME fuel turbopump turbine blade was performed. The thermal loads used resulted from a transient heat transfer analysis of a turbine blade. A comparison of preliminary results from the elastic and inelastic analyses is presented

Bow-Tie Microstrip Antenna Design

In this paper, the bow-tie microstrip antennas have been designed with two different angles of 40° and 80°. An investigaton on the effect of the angle to the return loss and radiation patterns had been carried out. The impedance matching network with the niicrostrip transmission line feeding was used in this study. Simulation and measurement results for the return loss and radiation patterns were presented

Ultra-Reliable Low-Latency Vehicular Networks: Taming the Age of Information Tail

While the notion of age of information (AoI) has recently emerged as an important concept for analyzing ultra-reliable low-latency communications (URLLC), the majority of the existing works have focused on the average AoI measure. However, an average AoI based design falls short in properly characterizing the performance of URLLC systems as it cannot account for extreme events that occur with very low probabilities. In contrast, in this paper, the main objective is to go beyond the traditional notion of average AoI by characterizing and optimizing a URLLC system while capturing the AoI tail distribution. In particular, the problem of vehicles' power minimization while ensuring stringent latency and reliability constraints in terms of probabilistic AoI is studied. To this end, a novel and efficient mapping between both AoI and queue length distributions is proposed. Subsequently, extreme value theory (EVT) and Lyapunov optimization techniques are adopted to formulate and solve the problem. Simulation results shows a nearly two-fold improvement in terms of shortening the tail of the AoI distribution compared to a baseline whose design is based on the maximum queue length among vehicles, when the number of vehicular user equipment (VUE) pairs is 80. The results also show that this performance gain increases significantly as the number of VUE pairs increases.Comment: Accepted in IEEE GLOBECOM 2018 with 7 pages, 6 figure

A Gapless, Unambiguous Genome Sequence of the Enterohemorrhagic Escherichia coli O157:H7 Strain EDL933.

Escherichia coli EDL933 is the prototypic strain for enterohemorrhagic E. coli serotype O157:H7, associated with deadly food-borne outbreaks. Because the publicly available sequence of the EDL933 genome has gaps and >6,000 ambiguous base calls, we here present an updated high-quality, unambiguous genome sequence with no assembly gaps