Fast Inner Product Computation on Short Buses

We propose a VLSI inner product processor architecture involving broadcasting only over short buses (containing less than 64 switches). The architecture leads to an efficient algorithm for the inner product computation. Specifically, it takes 13 broadcasts, each over less than 64 switches, plus 2 carry-save additions (tcsa) and 2 carry-lookahead additions (tcla) to compute the inner product of two arrays of N = 29 elements, each consisting of m = 64 bits. Using the same order of VLSI area, our algorithm runs faster than the best known fast inner product algorithm of Smith and Torng [ Design of a fast inner product processor, Proceedings of IEEE 7th Symposium on Computer Arithmetic (1985)], which takes about 28 tcsa + tcla for the computation

Reconfigurable Shift Switching Parallel Comparators

We present novel asynchronous VLSI comparator schemes which are based on recently proposed reconfigurable shift switch logic and the traditional (precharged) CMOS domino logic. The schemes always produce a semaphore as a by-product of the process to indicate the end of domino process, which requires no additional delay and a minimal number of additional devices. For a large percentage of inputs the computations are much faster than traditional synchronous comparators due to the full utilization of the inherent speed of the circuits. Also the schemes are simple, area compact and stable

An Optimal Path Cover Algorithm for Cographs

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well

Emission of gamma rays shifted from resonant absorption by electron-nuclear double transitions in ^{151}Eu^{2+}:CaF_2

We show that the emission of a gamma-ray photon by a nucleus can be influenced by a microwave magnetic field acting on the atomic electrons. We study theoretically these electron-nuclear double transitions (ENDTs) for ^{151}Eu nuclei in a CaF_2 lattice at low temperature, in the presence of a static magnetic field and of a microwave magnetic field. The ENDTs acquire a significant intensity for certain resonance frequencies. The ENDTs are of interest for the identification of the position of the lines in complex M\"{o}ssbauer spectra.Comment: 8 pages; 3 Postscript figures: Fig. 1, Fig. 2(a), Fig. 2(b

An optimal path cover algorithm for cographs

AbstractThe class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well

Unmasking Deception in VANETs: A Decentralized Approach to Verifying Truth in Motion

VANET, which stands for Vehicular Ad Hoc Network, is a wireless network that allows vehicles to communicate with each other and with infrastructure, such as Roadside Units (RSUs), with the aim of enhancing road safety and improving the overall driving experience through real-time exchange of information and data. VANET has various applications, including traffic management, road safety alerts, and navigation. However, the security of VANET can be compromised if a malicious user alters the content of messages transmitted, which can harm both individual vehicles and the overall trust in VANET technology. Ensuring the correctness of messages is crucial for the success of VANET, as fake messages pose a threat to traffic safety, human lives, and the credibility of VANET. This poster presents a novel framework for efficiently identifying vehicles that spread fake messages in VANET. The framework divides messages into two categories, urgent and non-urgent, and handles them using a decentralized priority queue consisting of trusted RSUs. The RSUs register dynamic security keys of the vehicles and broadcast the valid ones in their range for quick message exchange. The simulation results show that the framework is scalable and can efficiently identify vehicles that spread fake messages while providing secure communication and guaranteeing the QoS requirements of safety-related VANET applications.https://digitalcommons.odu.edu/gradposters2023_sciences/1009/thumbnail.jp

Aharonov-Bohm interference in the presence of metallic mesoscopic cylinders

This work studies the interference of electrons in the presence of a line of magnetic flux surrounded by a normal-conducting mesoscopic cylinder at low temperature. It is found that, while there is a supplementary phase contribution from each electron of the mesoscopic cylinder, the sum of these individual supplementary phases is equal to zero, so that the presence of a normal-conducting mesoscopic ring at low temperature does not change the Aharonov-Bohm interference pattern of the incident electron. It is shown that it is not possible to ascertain by experimental observation that the shielding electrons have responded to the field of an incident electron, and at the same time to preserve the interference pattern of the incident electron. It is also shown that the measuring of the transient magnetic field in the region between the two paths of an electron interference experiment with an accuracy at least equal to the magnetic field of the incident electron generates a phase uncertainty which destroys the interference pattern.Comment: 15 pages, 5 Postscript figure