Effective chemical potential in spontaneous baryogenesis

Models of spontaneous baryogenesis have an interaction term $\partial_\mu\theta j^\mu_B$ in the Lagrangian, where $j^\mu_B$ is the baryonic current and $\theta$ can be a pseudo-Nambu-Goldstone boson. Since the time component of this term, $\dot{\theta} j^0_B$, equals $\dot{\theta} n_B$ for a spatially homogeneous current, it is usually argued that this term implies a splitting in the energy of baryons and antibaryons thereby providing an effective chemical potential for baryon number. In thermal equilibrium, one {then obtains} $n_B \sim \dot{\theta} T^2$. We however argue that a term of this form in the Lagrangian does not contribute to the single particle energies of baryons and antibaryons. We show this for both fermionic and scalar baryons. But, similar to some recent work, we find that despite the above result the baryon number density obtained from a Boltzmann equation analysis can be proportional to $\dot{\theta} T^2$. Our arguments are very different from that in the standard literature on spontaneous baryogenesis.Comment: 16 pages, matches with the published versio

Threat Analysis, Countermeaures and Design Strategies for Secure Computation in Nanometer CMOS Regime

Advancements in CMOS technologies have led to an era of Internet Of Things (IOT), where the devices have the ability to communicate with each other apart from their computational power. As more and more sensitive data is processed by embedded devices, the trend towards lightweight and efficient cryptographic primitives has gained significant momentum. Achieving a perfect security in silicon is extremely difficult, as the traditional cryptographic implementations are vulnerable to various active and passive attacks. There is also a threat in the form of hardware Trojans inserted into the supply chain by the untrusted third-party manufacturers for economic incentives. Apart from the threats in various forms, some of the embedded security applications such as random number generators (RNGs) suffer from the impacts of process variations and noise in nanometer CMOS. Despite their disadvantages, the random and unique nature of process variations can be exploited for generating unique identifiers and can be of tremendous use in embedded security. In this dissertation, we explore techniques for precise fault-injection in cryptographic hardware based on voltage/temperature manipulation and hardware Trojan insertion. We demonstrate the effectiveness of these techniques by mounting fault attacks on state-of-the-art ciphers. Physically Unclonable Functions (PUFs) are novel cryptographic primitives for extracting secret keys from complex manufacturing variations in integrated circuits (ICs). We explore the vulnerabilities of some of the popular strong PUF architectures to modeling attacks using Machine Learning (ML) algorithms. The attacks use silicon data from a test chip manufactured in IBM 32nm silicon-on-insulator (SOI) technology. Attack results demonstrate that the majority of strong PUF architectures can be predicted to very high accuracies using limited training data. We also explore the techniques to exploit unreliable data from strong PUF architectures and effectively use them to improve the prediction accuracies of modeling attacks. Motivated by the vulnerabilities of existing PUF architectures, we present a novel modeling attack resistant PUF architecture based on non-linear computing elements. Post-silicon validation results are used to demonstrate the effectiveness of the non-linear PUF architecture against modeling and fault-injection attacks. Apart from the techniques to improve the security of PUF circuits, we also present novel solutions to improve the performance of PUF circuits from the perspectives of IC fabrication and system/protocol design. Finally, we present a statistical benchmark suite to evaluate PUFs in conceptualization phase and also to enable fine-grained security assessments for varying PUF parameters. Data compressibility analyses for validating the statistical benchmark suite are also presented

Bandwidth Enhancement of Substrate Integrated Waveguide Cavity-backed Bow-tie-complementary-ring-slot Antenna using a Shorted-via

In this study, a planar cavity-backed bow-tie-complementary-ring-slot antenna is proposed, and a new approach for bandwidth enhancement using a shorted-via is introduced. A shorted-via concept overcomes the narrow impedance bandwidth of a conventional substrate integrated waveguide cavity-backed antenna. By adjusting the location of the shorted-via (placed just above the centroid of the radiating slot), the individual bandwidth of the lower and higher order resonances has been tuned below -10 dB criterion, which results in the broadening of the bandwidth. Finally, the antenna is proficient to operate for an impedance bandwidth of 15.71 per cent, ranging from 12.02~14.07 GHz. The proposed antenna shows a gain of better than 4 dBi within the operating band with less than 0.5 dBi variation. Moreover, the antenna preserves good radiation characteristics, which is similar to that of the conventional metallic counterpart. To validate the simulated results, an antenna is fabricated and tested. The simulated results in terms of the reflection coefficient, gain, and radiation patterns are in good agreement with the measured results

A Review: Substrate Integrated Waveguide Antennas and Arrays

This study aims to provide an overview and deployment of Substrate-Integrated Waveguide (SIW) based antenna and arrays, with different configurations, feeding mechanisms, and performances. Their performance improvement methods, including bandwidth enhancement, size reduction, and gain improvement are also discussed based on available literature. SIW technology, which acts as a bridge between planar and non-planar technology, is a very favorable candidate for the development of components operating at microwave and millimeter wave band. Due to this, SIW antennas and array take the advantages of both classical metallic waveguide, which includes high gain, high power capacity, low cross polarization, and high selectivity, and that of planar antennas which comprises low profile, light weight, low fabrication cost, conformability to planar or bent surfaces, and easy integration with planar circuits

Receptor Identification: Advances in Ligands and Transmitters Discovery

Receptor identification is an integral part of drug discovery and development. By the beginning of the next millennium, the search for the natural ligands of the orphan G-protein-coupled receptors will lead to the discovery of so many new peptides that it may well double their present number. It has recently become evident that all types of chemical messengers, hormones and transmitters act through membrane receptors which constitute our largest superfamily of proteins, i.e. the G protein-coupled receptors. The development of targeted therapies has revolutionized the treatment of various chronic diseases. Receptors have well-conserved regions that are recognized and activated by hormones and neurotransmitters. These ligands are peptides, lipids or biogenic amines, and act as transmitter molecules. Identification of orphan receptors include screening, binding and reverse engineering that help to find out cysteinyl leukotriene CysLT1 and Cys T2, hepatointestinal leukotriene B4, motilin, Ghrelin, Growth hormone-releasing peptide and growth hormone secretagogue receptor and many more. Techniques involved in screening of receptors include low stringency hybridization followed by PCR-derived approaches helps to discover various orphan g protein couple recptors (oGPCR). The discovery of the oGPCR represents a hallmark in neuroscience research, and the exploitation of its numerous physiological and pathophysiological functions is a promising avenue for therapeutic applications

Betweenness centrality in convex amalgamation of graphs

Betweenness centrality measures the potential or power of a node to control the communication over the network under the assumption that information flows primarily over the shortest paths between pair of nodes. The removal of a node with highest betweenness from the network will most disrupt communications between other nodes because it lies on the largest number of paths. A large network can be thought of as inter-connection between smaller networks by means of different graph operations. Thus the structure of a composite graph can be studied by analysing its component graphs. In this paper we present the betweenness centrality of some classes of composite graphs constructed by the graph operation called amalgamation or merging