Catalog footprint

What is connected

48works
32topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

48 published item(s)

preprint2026arXiv

Repurposing and Evaluating the (In)Feasibility of Dataset Poisoning enabled Watermarking for Contrastive Learning

Contrastive learning (CL) reduces annotation cost via auto-derived supervisory signals. Since large-scale in-house CL datasets are infeasible, reliance on third-party or internet data is common. Recent studies show CL models are vulnerable to data-poisoning backdoor attacks, but their generalization and robustness are underexplored. We systematically evaluate existing data-poisoning backdoor attacks on CL, revealing limitations: poor dataset adaptability, low success rates, limited portability, and restrictive assumptions (e.g., downstream task knowledge). Interestingly, trigger samples exhibit distinguishable statistical divergence from clean samples, which inspires repurposing it as a watermark for dataset IP protection. Direct repurposing is challenging due to low success rates; we overcome this by statistical verification using a unified density metric. We further propose a multi-level watermarking scheme adapting to feature-level, soft-label, or hard-label outputs in CL. Experiments show some backdoor attacks can be repurposed as effective watermarks with trade-offs among fidelity, verifiability, and robustness. This work demonstrates weak backdoor effects become reliable signals for dataset IP protection in challenging CL settings.

preprint2023arXiv

MLMSA: Multi-Label Multi-Side-Channel-Information enabled Deep Learning Attacks on APUF Variants

To improve the modeling resilience of silicon strong physical unclonable functions (PUFs), in particular, the APUFs, that yield a very large number of challenge response pairs (CRPs), a number of composited APUF variants such as XOR-APUF, interpose-PUF (iPUF), feed-forward APUF (FF-APUF),and OAX-APUF have been devised. When examining their security in terms of modeling resilience, utilizing multiple information sources such as power side channel information (SCI) or/and reliability SCI given a challenge is under-explored, which poses a challenge to their supposed modeling resilience in practice. Building upon multi-label/head deep learning model architecture,this work proposes Multi-Label Multi-Side-channel-information enabled deep learning Attacks (MLMSA) to thoroughly evaluate the modeling resilience of aforementioned APUF variants. Despite its simplicity, MLMSA can successfully break large-scaled APUF variants, which has not previously been achieved. More precisely, the MLMSA breaks 128-stage 30-XOR-APUF, (9, 9)- and (2, 18)-iPUFs, and (2, 2, 30)-OAX-APUF when CRPs, power SCI and reliability SCI are concurrently used. It breaks 128-stage 12-XOR-APUF and (2, 2, 9)-OAX-APUF even when only the easy-to-obtain reliability SCI and CRPs are exploited. The 128-stage six-loop FF-APUF and one-loop 20-XOR-FF-APUF can be broken by simultaneously using reliability SCI and CRPs. All these attacks are normally completed within an hour with a standard personalcomputer. Therefore, MLMSA is a useful technique for evaluating other existing or any emerging strong PUF designs.

preprint2022arXiv

Dangerous Cloaking: Natural Trigger based Backdoor Attacks on Object Detectors in the Physical World

Deep learning models have been shown to be vulnerable to recent backdoor attacks. A backdoored model behaves normally for inputs containing no attacker-secretly-chosen trigger and maliciously for inputs with the trigger. To date, backdoor attacks and countermeasures mainly focus on image classification tasks. And most of them are implemented in the digital world with digital triggers. Besides the classification tasks, object detection systems are also considered as one of the basic foundations of computer vision tasks. However, there is no investigation and understanding of the backdoor vulnerability of the object detector, even in the digital world with digital triggers. For the first time, this work demonstrates that existing object detectors are inherently susceptible to physical backdoor attacks. We use a natural T-shirt bought from a market as a trigger to enable the cloaking effect--the person bounding-box disappears in front of the object detector. We show that such a backdoor can be implanted from two exploitable attack scenarios into the object detector, which is outsourced or fine-tuned through a pretrained model. We have extensively evaluated three popular object detection algorithms: anchor-based Yolo-V3, Yolo-V4, and anchor-free CenterNet. Building upon 19 videos shot in real-world scenes, we confirm that the backdoor attack is robust against various factors: movement, distance, angle, non-rigid deformation, and lighting. Specifically, the attack success rate (ASR) in most videos is 100% or close to it, while the clean data accuracy of the backdoored model is the same as its clean counterpart. The latter implies that it is infeasible to detect the backdoor behavior merely through a validation set. The averaged ASR still remains sufficiently high to be 78% in the transfer learning attack scenarios evaluated on CenterNet. See the demo video on https://youtu.be/Q3HOF4OobbY.

preprint2022arXiv

Linear measurements from nonlinear sensors: identifying distortion with incidental noise

Nonlinearity in many systems is heavily dependent on component variation and environmental factors such as temperature. This is often overcome by keeping signals close enough to the device's operating point that it appears approximately linear. But as the signal being measured becomes larger, the deviation from linearity increases, and the device's nonlinearity specification will be exceeded. This limits the range over which the device will produce directly useful measurements, often to far less than the device's safe range of operation.

preprint2022arXiv

MUD-PQFed: Towards Malicious User Detection in Privacy-Preserving Quantized Federated Learning

Federated Learning (FL), a distributed machine learning paradigm, has been adapted to mitigate privacy concerns for customers. Despite their appeal, there are various inference attacks that can exploit shared-plaintext model updates to embed traces of customer private information, leading to serious privacy concerns. To alleviate this privacy issue, cryptographic techniques such as Secure Multi-Party Computation and Homomorphic Encryption have been used for privacy-preserving FL. However, such security issues in privacy-preserving FL are poorly elucidated and underexplored. This work is the first attempt to elucidate the triviality of performing model corruption attacks on privacy-preserving FL based on lightweight secret sharing. We consider scenarios in which model updates are quantized to reduce communication overhead in this case, where an adversary can simply provide local parameters outside the legal range to corrupt the model. We then propose the MUD-PQFed protocol, which can precisely detect malicious clients performing attacks and enforce fair penalties. By removing the contributions of detected malicious clients, the global model utility is preserved to be comparable to the baseline global model without the attack. Extensive experiments validate effectiveness in maintaining baseline accuracy and detecting malicious clients in a fine-grained manner

preprint2022arXiv

RBNN: Memory-Efficient Reconfigurable Deep Binary Neural Network with IP Protection for Internet of Things

Though deep neural network models exhibit outstanding performance for various applications, their large model size and extensive floating-point operations render deployment on mobile computing platforms a major challenge, and, in particular, on Internet of Things devices. One appealing solution is model quantization that reduces the model size and uses integer operations commonly supported by microcontrollers . To this end, a 1-bit quantized DNN model or deep binary neural network maximizes the memory efficiency, where each parameter in a BNN model has only 1-bit. In this paper, we propose a reconfigurable BNN (RBNN) to further amplify the memory efficiency for resource-constrained IoT devices. Generally, the RBNN can be reconfigured on demand to achieve any one of M (M>1) distinct tasks with the same parameter set, thus only a single task determines the memory requirements. In other words, the memory utilization is improved by times M. Our extensive experiments corroborate that up to seven commonly used tasks can co-exist (the value of M can be larger). These tasks with a varying number of classes have no or negligible accuracy drop-off on three binarized popular DNN architectures including VGG, ResNet, and ReActNet. The tasks span across different domains, e.g., computer vision and audio domains validated herein, with the prerequisite that the model architecture can serve those cross-domain tasks. To protect the intellectual property of an RBNN model, the reconfiguration can be controlled by both a user key and a device-unique root key generated by the intrinsic hardware fingerprint. By doing so, an RBNN model can only be used per paid user per authorized device, thus benefiting both the user and the model provider.

preprint2022arXiv

Two-player quantum games: When player strategies are via directional choices

We propose a scheme for a quantum game based on performing an EPR type experiment and in which each player's spatial directional choices are considered as their strategies. A classical mixed-strategy game is recovered by restricting the players' choices to specific spatial trajectories. We show that for players' directional choices for which the Bell-CHSH inequality is violated, the players' payoffs in the quantum game have no mapping within the classical mixed-strategy game. The scheme provides a more direct link between classical and quantum games.

preprint2016arXiv

Analysis of 3D-printed metal for rapid-prototyped reflective terahertz optics

We explore the potential of 3D metal printing to realize complex conductive terahertz devices. Factors impacting performance such as printing resolution, surface roughness, oxidation, and material loss are investigated via analytical, numerical, and experimental approaches. The high degree of control offered by a 3D-printed topology is exploited to realize a zone plate operating at 530 GHz. Reflection efficiency at this frequency is found to be over 90%. The high-performance of this preliminary device suggest that 3D metal printing can play a strong role in guided-wave and general beam control devices in the terahertz range.

preprint2016arXiv

Generalizing the Lorentz transformations

In this paper we develop a framework allowing a natural extension of the Lorentz transformations. To begin, we show that by expanding conventional four-dimensional spacetime to eight-dimensions that a natural generalization is indeed obtained. We then find with these generalized coordinate transformations acting on Maxwell's equations that the electromagnetic field transformations are nevertheless unchanged. We find further, that if we assume the absence of magnetic monopoles, in accordance with Maxwell's theory, our generalized transformations are then restricted to be the conventional ones. While the conventional Lorentz transformations are indeed recovered from our framework, we nevertheless provide a new perspective into why the Lorentz transformations are constrained to be the conventional ones. Also, this generalized framework may assist in explaining several unresolved questions in electromagnetism as well as to be able to describe quasi magnetic monopoles found in spin-ice systems.

preprint2016arXiv

Geometric Algebra: A natural representation of three-space

Historically, there have been many attempts to produce an appropriate mathematical formalism for modeling the nature of physical space, such as Euclid's geometry, Descartes' system of Cartesian coordinates, the Argand plane, Hamilton's quaternions and Gibbs' vector system using the dot and cross products. We illustrate however, that Clifford's geometric algebra (GA) provides the most elegant description of physical space. Supporting this conclusion, we firstly show how geometric algebra subsumes the key elements of the competing formalisms and secondly how it provides an intuitive representation of the basic concepts of points, lines, areas and volumes. We also provide two examples where GA has been found to provide an improved description of two key physical phenomena, electromagnetism and quantum theory, without using tensors or complex vector spaces. This paper also provides pedagogical tutorial-style coverage of the various basic applications of geometric algebra in physics.

preprint2016arXiv

The vector algebra war: a historical perspective

There are a wide variety of different vector formalisms currently utilized in engineering and physics. For example, Gibbs' three-vectors, Minkowski four-vectors, complex spinors in quantum mechanics, quaternions used to describe rigid body rotations and vectors defined in Clifford geometric algebra. With such a range of vector formalisms in use, it thus appears that there is as yet no general agreement on a vector formalism suitable for science as a whole. This is surprising, in that, one of the primary goals of nineteenth century science was to suitably describe vectors in three-dimensional space. This situation has also had the unfortunate consequence of fragmenting knowledge across many disciplines, and requiring a significant amount of time and effort in learning the various formalisms. We thus historically review the development of our various vector systems and conclude that Clifford's multivectors best fulfills the goal of describing vectorial quantities in three dimensions and providing a unified vector system for science.

preprint2016arXiv

Too good to be true: when overwhelming evidence fails to convince

Is it possible for a large sequence of measurements or observations, which support a hypothesis, to counterintuitively decrease our confidence? Can unanimous support be too good to be true? The assumption of independence is often made in good faith, however rarely is consideration given to whether a systemic failure has occurred. Taking this into account can cause certainty in a hypothesis to decrease as the evidence for it becomes apparently stronger. We perform a probabilistic Bayesian analysis of this effect with examples based on (i) archaeological evidence, (ii) weighing of legal evidence, and (iii) cryptographic primality testing. We find that even with surprisingly low systemic failure rates high confidence is very difficult to achieve and in particular we find that certain analyses of cryptographically-important numerical tests are highly optimistic, underestimating their false-negative rate by as much as a factor of $2^{80}$.

preprint2015arXiv

A brief study of time

Understanding the nature of time remains a key unsolved problem in science. Newton in the Principia asserted an absolute universal time that {\it `flows equably'}. Hamilton then proposed a mathematical unification of space and time within the framework of the quaternions that ultimately lead to the famous Minkowski formulation in 1908 using four-vectors. The Minkowski framework is found to provide a versatile formalism for describing the relationship between space and time in accordance with relativistic principles, but nevertheless fails to provide deeper insights into the physical origin of time and its properties. In this paper we begin with a recognition of the fundamental role played by three-dimensional space in physics that we model using the Clifford algebra multivector. From this geometrical foundation we are then able to identify a plausible origin for our concept of time. This geometrical perspective also allows us to make a key topological distinction between time and space, with time being a point-like quantity. The multivector then allows a generalized unification of time and space within a Minkowski-like description.

preprint2015arXiv

Future Large-Scale Memristive Device Crossbar Arrays: Limits Imposed by Sneak-Path Currents on Read Operations

Passive crossbar arrays based upon memristive devices, at crosspoints, hold great promise for the future high-density and non-volatile memories. The most significant challenge facing memristive device based crossbars today is the problem of sneak-path currents. In this paper, we investigate a memristive device with intrinsic rectification behavior to suppress the sneak-path currents in crossbar arrays. The device model is implemented in Verilog-A language and is simulated to match device characteristics readily available in the literature. Then, we systematically evaluate the read operation performance of large-scale crossbar arrays utilizing our proposed model in terms of read margin and power consumption while considering different crossbar sizes, interconnect resistance values, HRS/LRS (High Resistance State/Low Resistance State) values, rectification ratios and different read-schemes. The outcomes of this study are understanding the trade-offs among read margin, power consumption, read-schemes and most importantly providing a guideline for circuit designers to improve the performance of a memory based crossbar structure. In addition, read operation performance comparison of the intrinsic rectifying memristive device model with other memristive device models are studied.

preprint2015arXiv

Social optimality in quantum Bayesian games

A significant aspect of the study of quantum strategies is the exploration of the game-theoretic solution concept of the Nash equilibrium in relation to the quantization of a game. Pareto optimality is a refinement on the set of Nash equilibria. A refinement on the set of Pareto optimal outcomes is known as social optimality in which the sum of players' payoffs are maximized. This paper analyzes social optimality in a Bayesian game that uses the setting of generalized Einstein-Podolsky-Rosen experiments for its physical implementation. We show that for the quantum Bayesian game a direct connection appears between the violation of Bell's inequality and the social optimal outcome of the game and that it attains a superior socially optimal outcome.

preprint2014arXiv

A directional coupler attack against the Kish key distribution system

The Kish key distribution system has been proposed as a class ical alternative to quantum key distribution. The idealized Kish scheme elegantly promise s secure key distribution by exploiting thermal noise in a transmission line. However, we demonstrate that it is vulnerable to nonidealities in its components, such as the finite resistance of the transmission line connecting its endpoints. We introduce a novel attack against this nonideality using directional wave measurements, and experimentally demonstrate its efficacy. Our attack is based on causality: in a spatially distributed system, propagation is needed for thermodynamic equilibration, and that leaks information.

preprint2014arXiv

A probabilistic approach to quantum Bayesian games of incomplete information

A Bayesian game is a game of incomplete information in which the rules of the game are not fully known to all players. We consider the Bayesian game of Battle of Sexes that has several Bayesian Nash equilibria and investigate its outcome when the underlying probability set is obtained from generalized Einstein-Podolsky-Rosen experiments. We find that this probability set, which may become non-factorizable, results in a unique Bayesian Nash equilibrium of the game.

preprint2014arXiv

Facts, myths and fights about the KLJN classical physical key exchanger

This paper deals with the Kirchhoff-law-Johnson-noise (KLJN) classical statistical physical key exchange method and surveys criticism - often stemming from a lack of understanding of its underlying premises or from other errors - and our related responses against these, often unphysical, claims. Some of the attacks are valid, however, an extended KLJN system remains protected against all of them, implying that its unconditional security is not impacted.

preprint2014arXiv

Functions of multivector variables

As is well known, the common elementary functions defined over the real numbers can be generalized to act not only over the complex number field but also over the skew (non-commuting) field of the quaternions. In this paper, we detail a number of elementary functions extended to act over the skew field of Clifford multivectors, in both two and three dimensions. Complex numbers, quaternions and Cartesian vectors can be described by the various components within a Clifford multivector and from our results we are able to demonstrate new inter-relationships between these algebraic systems. One key relationship that we discover is that a complex number raised to a vector power produces a quaternion thus combining these systems within a single equation. We also find a single formula that produces the square root, amplitude and inverse of a multivector over one, two and three dimensions. Finally, comparing the functions over different dimension we observe that $ C\ell \left (\Re^3 \right) $ provides a particularly versatile algebraic framework.

preprint2013arXiv

A Neuromorphic VLSI Design for Spike Timing and Rate Based Synaptic Plasticity

Triplet-based Spike Timing Dependent Plasticity (TSTDP) is a powerful synaptic plasticity rule that acts beyond conventional pair-based STDP (PSTDP). Here, the TSTDP is capable of reproducing the outcomes from a variety of biological experiments, while the PSTDP rule fails to reproduce them. Additionally, it has been shown that the behaviour inherent to the spike rate-based Bienenstock-Cooper-Munro (BCM) synaptic plasticity rule can also emerge from the TSTDP rule. This paper proposes an analog implementation of the TSTDP rule. The proposed VLSI circuit has been designed using the AMS 0.35 um CMOS process and has been simulated using design kits for Synopsys and Cadence tools. Simulation results demonstrate how well the proposed circuit can alter synaptic weights according to the timing difference amongst a set of different patterns of spikes. Furthermore, the circuit is shown to give rise to a BCM-like learning rule, which is a rate-based rule. To mimic implementation environment, a 1000 run Monte Carlo (MC) analysis was conducted on the proposed circuit. The presented MC simulation analysis and the simulation result from fine-tuned circuits show that, it is possible to mitigate the effect of process variations in the proof of concept circuit, however, a practical variation aware design technique is required to promise a high circuit performance in a large scale neural network. We believe that the proposed design can play a significant role in future VLSI implementations of both spike timing and rate based neuromorphic learning systems.

preprint2013arXiv

Critical analysis of the Bennett-Riedel attack on secure cryptographic key distributions via the Kirchhoff-law-Johnson-noise scheme

Recently, Bennett and Riedel (BR) (http://arxiv.org/abs/1303.7435v1) argued that thermodynamics is not essential in the Kirchhoff-law-Johnson-noise (KLJN) classical physical cryptographic exchange method in an effort to disprove the security of the KLJN scheme. They attempted to demonstrate this by introducing a dissipation-free deterministic key exchange method with two batteries and two switches. In the present paper, we first show that BR's scheme is unphysical and that some elements of its assumptions violate basic protocols of secure communication. All our analyses are based on a technically-unlimited Eve with infinitely accurate and fast measurements limited only by the laws of physics and statistics. For non-ideal situations and at active (invasive) attacks, the uncertainly principle between measurement duration and statistical errors makes it impossible for Eve to extract the key regardless of the accuracy or speed of her measurements. To show that thermodynamics and noise are essential for the security, we crack the BR system with 100% success via passive attacks, in ten different ways, and demonstrate that the same cracking methods do not function for the KLJN scheme that employs Johnson noise to provide security underpinned by the Second Law of Thermodynamics. We also present a critical analysis of some other claims by BR; for example, we prove that their equations for describing zero security do not apply to the KLJN scheme. Finally we give mathematical security proofs for each BR-attack against the KLJN scheme and conclude that the information theoretic (unconditional) security of the KLJN method has not been successfully challenged.

preprint2013arXiv

Physical-layer encryption on the public internet: a stochastic approach to the Kish-Sethuraman cipher

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.

preprint2012arXiv

An explanation for galaxy rotation curves using a Clifford multivector spacetime framework

We explore the consequences of space and time described within the Clifford multivector of three dimensions $ Cl_{3,0}$, where space consists of three-vectors and time is described with the three bivectors of this space. When describing the curvature around massive bodies, we show that this model of spacetime when including the Hubble expansion naturally produces the correct galaxy rotation curves without the need for dark matter.

preprint2012arXiv

Design and Implementation of BCM Rule Based on Spike-Timing Dependent Plasticity

The Bienenstock-Cooper-Munro (BCM) and Spike Timing-Dependent Plasticity (STDP) rules are two experimentally verified form of synaptic plasticity where the alteration of synaptic weight depends upon the rate and the timing of pre- and post-synaptic firing of action potentials, respectively. Previous studies have reported that under specific conditions, i.e. when a random train of Poissonian distributed spikes are used as inputs, and weight changes occur according to STDP, it has been shown that the BCM rule is an emergent property. Here, the applied STDP rule can be either classical pair-based STDP rule, or the more powerful triplet-based STDP rule. In this paper, we demonstrate the use of two distinct VLSI circuit implementations of STDP to examine whether BCM learning is an emergent property of STDP. These circuits are stimulated with random Poissonian spike trains. The first circuit implements the classical pair-based STDP, while the second circuit realizes a previously described triplet-based STDP rule. These two circuits are simulated using 0.35 um CMOS standard model in HSpice simulator. Simulation results demonstrate that the proposed triplet-based STDP circuit significantly produces the threshold-based behaviour of the BCM. Also, the results testify to similar behaviour for the VLSI circuit for pair-based STDP in generating the BCM.

preprint2012arXiv

Efficient Design of Triplet Based Spike-Timing Dependent Plasticity

Spike-Timing Dependent Plasticity (STDP) is believed to play an important role in learning and the formation of computational function in the brain. The classical model of STDP which considers the timing between pairs of pre-synaptic and post-synaptic spikes (p-STDP) is incapable of reproducing synaptic weight changes similar to those seen in biological experiments which investigate the effect of either higher order spike trains (e.g. triplet and quadruplet of spikes), or, simultaneous effect of the rate and timing of spike pairs on synaptic plasticity. In this paper, we firstly investigate synaptic weight changes using a p-STDP circuit and show how it fails to reproduce the mentioned complex biological experiments. We then present a new STDP VLSI circuit which acts based on the timing among triplets of spikes (t-STDP) that is able to reproduce all the mentioned experimental results. We believe that our new STDP VLSI circuit improves upon previous circuits, whose learning capacity exceeds current designs due to its capability of mimicking the outcomes of biological experiments more closely; thus plays a significant role in future VLSI implementation of neuromorphic systems.

preprint2012arXiv

N-player quantum games in an EPR setting

The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players' strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for $N$-qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the mixed Nash equilibrium and the payoffs are determined. Players' payoffs are then defined with linear functions so that common two-player games can be easily extended to the $N$-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners' Dilemma game for general $ N \ge 2 $. We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs.

preprint2012arXiv

Revisiting special relativity: A natural algebraic alternative to Minkowski spacetime

Minkowski famously introduced the concept of a space-time continuum in 1908, merging the three dimensions of space with an imaginary time dimension $ i c t $, with the unit imaginary producing the correct spacetime distance $ x^2 - c^2 t^2 $, and the results of Einstein's then recently developed theory of special relativity, thus providing an explanation for Einstein's theory in terms of the structure of space and time. As an alternative to a planar Minkowski space-time of two space dimensions and one time dimension, we replace the unit imaginary $ i = \sqrt{-1} $, with the Clifford bivector $ ι= e_1 e_2 $ for the plane that also squares to minus one, but which can be included without the addition of an extra dimension, as it is an integral part of the real Cartesian plane with the orthonormal basis $ e_1 $ and $ e_2 $. We find that with this model of planar spacetime, using a two-dimensional Clifford multivector, the spacetime metric and the Lorentz transformations follow immediately as properties of the algebra. This also leads to momentum and energy being represented as components of a multivector and we give a new efficient derivation of Compton's scattering formula, and a simple formulation of Dirac's and Maxwell's equations. Based on the mathematical structure of the multivector, we produce a semi-classical model of massive particles, which can then be viewed as the origin of the Minkowski spacetime structure and thus a deeper explanation for relativistic effects. We also find a new perspective on the nature of time, which is now given a precise mathematical definition as the bivector of the plane.

preprint2012arXiv

The double-padlock problem: is secure classical information transmission possible without key exchange?

The idealized Kish-Sethuraman (KS) cipher is theoretically known to offer perfect security through a classical information channel. However, realization of the protocol is hitherto an open problem, as the required mathematical operators have not been identified in the previous literature. A mechanical analogy of this protocol can be seen as sending a message in a box using two padlocks; one locked by the Sender and the other locked by the Receiver, so that theoretically the message remains secure at all times. We seek a mathematical representation of this process, considering that it would be very unusual if there was a physical process with no mathematical description and indeed we find a solution within a four dimensional Clifford algebra. The significance of finding a mathematical description that describes the protocol, is that it is a possible step toward a physical realization having benefits in increased security with reduced complexity.

preprint2012arXiv

The gravitational field of a cube

Large astronomical objects such as stars or planets, produce approximately spherical shapes due to the large gravitational forces, and if the object is rotating rapidly, it becomes an oblate spheroid. In juxtaposition to this, we conduct a thought experiment regarding the properties of a planet being in the form of a perfect cube. We firstly calculate the gravitational potential and from the equipotentials, we deduce the shape of the lakes that would form on the surface of such an object. We then consider the formation of orbits around such objects both with a static and a rotating cube. A possible practical application of these results is that, because cuboid objects can be easily stacked together, we can calculate the field of more complicated shapes, using the principle of superposition, by simply adding the field from a set of component shapes.

preprint2011arXiv

A Precise Error Bound for Quantum Phase Estimation

Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring symmetry in the error definitions, an exact formula can be found. This new approach may also have value in solving other related problems in quantum computing, where an expected error is calculated. Expressions for two special cases of the formula are also developed, in the limit as the number of qubits in the quantum computer approaches infinity and in the limit as the extra added qubits to improve reliability goes to infinity. It is found that this formula is useful in validating computer simulations of the phase estimation procedure and in avoiding the overestimation of the number of qubits required in order to achieve a given reliability. This formula thus brings improved precision in the design of quantum computers.

preprint2011arXiv

An Analytical Approach for Memristive Nanoarchitectures

As conventional memory technologies are challenged by their technological physical limits, emerging technologies driven by novel materials are becoming an attractive option for future memory architectures. Among these technologies, Resistive Memories (ReRAM) created new possibilities because of their nano-features and unique $I$-$V$ characteristics. One particular problem that limits the maximum array size is interference from neighboring cells due to sneak-path currents. A possible device level solution to address this issue is to implement a memory array using complementary resistive switches (CRS). Although the storage mechanism for a CRS is fundamentally different from what has been reported for memristors (low and high resistances), a CRS is simply formed by two series bipolar memristors with opposing polarities. In this paper our intention is to introduce modeling principles that have been previously verified through measurements and extend the simulation principles based on memristors to CRS devices and hence provide an analytical approach to the design of a CRS array. The presented approach creates the necessary design methodology platform that will assist designers in implementation of CRS devices in future systems.

preprint2011arXiv

Analysis of two-player quantum games in an EPR setting using geometric algebra

The framework for playing quantum games in an Einstein-Podolsky-Rosen (EPR) type setting is investigated using the mathematical formalism of Clifford geometric algebra (GA). In this setting, the players' strategy sets remain identical to the ones in the classical mixed-strategy version of the game, which is then obtained as proper subset of the corresponding quantum game. As examples, using GA we analyze the games of Prisoners' Dilemma and Stag Hunt when played in the EPR type setting.

preprint2011arXiv

Analyzing three-player quantum games in an EPR type setup

We use the formalism of Clifford Geometric Algebra (GA) to develop an analysis of quantum versions of three-player non-cooperative games. The quantum games we explore are played in an Einstein-Podolsky-Rosen (EPR) type setting. In this setting, the players' strategy sets remain identical to the ones in the mixed-strategy version of the classical game that is obtained as a proper subset of the corresponding quantum game. Using GA we investigate the outcome of a realization of the game by players sharing GHZ state, W state, and a mixture of GHZ and W states. As a specific example, we study the game of three-player Prisoners' Dilemma.

preprint2011arXiv

Effects of mutual coupling in dual-resonance metamaterials

This Letter presents an investigation on the effects of mutual coupling in a metamaterial comprising two sets of electric-LC (ELC) resonators with different resonance frequencies. Through simulation and experiment, it is found that the two resonances experience significant shifting and weakening as they become spectrally close. An equivalent circuit model suggests that inductive coupling among the two resonator sets is a primary cause of the change in the resonance properties. This study is fundamental to designing metamaterials with an extended bandwidth or spatially variable response.

preprint2011arXiv

Fisher information as a performance metric for locally optimum processing

For a known weak signal in additive white noise, the asymptotic performance of a locally optimum processor (LOP) is shown to be given by the Fisher information (FI) of a standardized even probability density function (PDF) of noise in three cases: (i) the maximum signal-to-noise ratio (SNR) gain for a periodic signal; (ii) the optimal asymptotic relative efficiency (ARE) for signal detection; (iii) the best cross-correlation gain (CG) for signal transmission. The minimal FI is unity, corresponding to a Gaussian PDF, whereas the FI is certainly larger than unity for any non-Gaussian PDFs. In the sense of a realizable LOP, it is found that the dichotomous noise PDF possesses an infinite FI for known weak signals perfectly processed by the corresponding LOP. The significance of FI lies in that it provides a upper bound for the performance of locally optimum processing.

preprint2011arXiv

Memristor-based Synaptic Networks and Logical Operations Using In-Situ Computing

We present new computational building blocks based on memristive devices. These blocks, can be used to implement either supervised or unsupervised learning modules. This is achieved using a crosspoint architecture which is an efficient array implementation for nanoscale two-terminal memristive devices. Based on these blocks and an experimentally verified SPICE macromodel for the memristor, we demonstrate that firstly, the Spike-Timing-Dependent Plasticity (STDP) can be implemented by a single memristor device and secondly, a memristor-based competitive Hebbian learning through STDP using a $1\times 1000$ synaptic network. This is achieved by adjusting the memristor's conductance values (weights) as a function of the timing difference between presynaptic and postsynaptic spikes. These implementations have a number of shortcomings due to the memristor's characteristics such as memory decay, highly nonlinear switching behaviour as a function of applied voltage/current, and functional uniformity. These shortcomings can be addressed by utilising a mixed gates that can be used in conjunction with the analogue behaviour for biomimetic computation. The digital implementations in this paper use in-situ computational capability of the memristor.

preprint2011arXiv

Metamaterial-inspired multichannel thin-film sensor

A multichannel thin-film sensor is implemented from a set of microstrip-coupled split-ring resonators (SRR's) with different dimensions. Each SRR exhibits a unique high-Q resonance that is sensitive to the presence of a sample in a particular area. Hence, this SRR-based sensor can function (i) to detect different samples simultaneously to increase the throughput or (ii) to characterise nominally identical samples at multiple frequencies to increase the sensor selectivity. The design principle is validated with simulation and measurement. Owing to the optimized design, sensing a low-permittivity film with a thickness as small as one thousandth of the operating wavelength is achievable.

preprint2011arXiv

Quantum Strategies Win in a Defector-Dominated Population

Quantum strategies are introduced into evolutionary games. The agents using quantum strategies are regarded as invaders whose fraction generally is 1% of a population in contrast to the 50% defectors. In this paper, the evolution of strategies on networks is investigated in a defector-dominated population, when three networks (Regular Lattice, Newman-Watts small world network, scale-free network) are constructed and three games (Prisoners' Dilemma, Snowdrift, Stag-Hunt) are employed. As far as these three games are concerned, the results show that quantum strategies can always invade the population successfully. Comparing the three networks, we find that the regular lattice is most easily invaded by agents that adopt quantum strategies. However, for a scale-free network it can be invaded by agents adopting quantum strategies only if a hub is occupied by an agent with a quantum strategy or if the fraction of agents with quantum strategies in the population is significant.

preprint2011arXiv

Sub-diffraction thin-film sensing with planar terahertz metamaterials

Planar metamaterials have been recently proposed for thin dielectric film sensing in the terahertz frequency range. Although the thickness of the dielectric film can be very small compared with the wavelength, the required area of sensed material is still determined by the diffraction-limited spot size of the terahertz beam excitation. In this article, terahertz near-field sensing is utilized to reduce the spot size. By positioning the metamaterial sensing platform close to the sub-diffraction terahertz source, the number of excited resonators, and hence minimal film area, are significantly reduced. As an additional advantage, a reduction in the number of excited resonators decreases the inter-cell coupling strength, and consequently the resonance Q factor is remarkably increased. The experimental results show that the resonance Q factor is improved by 113%. Moreover, for a film with a thickness of λ/375 the minimal area can be as small as 0.2λby 0.2λ. The success of this work provides a platform for future metamaterial-based sensors for biomolecular detection.

preprint2010arXiv

A simplified approach to electromagnetism using geometric algebra

A new simplified approach for teaching electromagnetism is presented using the formalism of geometric algebra (GA) which does not require vector calculus or tensor index notation, thus producing a much more accessible presentation for students. The four-dimensional spacetime proposed is completely symmetrical between the space and time dimensions, thus fulfilling Minkowski's original vision. In order to improve student reception we also focus on forces and the conservation of energy and momentum, which take a very simple form in GA, so that students can easily build on established intuitions in using these laws developed from studying Newtonian mechanics. The potential formulation is also integrated into the presentation that allows an alternate solution path, as well as an introduction to the Lagrangian approach. Several problems are solved throughout the text to make the implementation clear. We extend previous treatment of this area, through including the potential formulation, the conservation of energy and momentum, the generalization for magnetic monopoles, as well as simplifying previously reported results through eliminating the need for the spacetime metric.

preprint2010arXiv

Compact electric-LC resonators for metamaterials

Alternative designs to an electric-LC (ELC) resonator, which is a type of metamaterial inclusion, are presented in this article. Fitting the resonator with an interdigital capacitor (IDC) helps to increase the total capacitance of the structure. In effect, its resonance frequency is shifted downwards. This implies a decreased overall resonator size with respect to its operating wavelength. As a result, the metamaterial, composed of an array of IDC-loaded ELC resonators with their collective electromagnetic response, possesses improved homogeneity and hence is less influenced by diffraction effects of individual cells. The impact of incorporating an IDC into ELC resonators in terms of the electrical size at resonance and other relevant properties are investigated through both simulation and experiment.

preprint2010arXiv

Constructing quantum games from a system of Bell's inequalities

We report constructing quantum games directly from a system of Bell's inequalities using Arthur Fine's analysis published in early 1980s. This analysis showed that such a system of inequalities forms a set of both necessary and sufficient conditions required to find a joint distribution function compatible with a given set of joint probabilities, in terms of which the system of Bell's inequalities is usually expressed. Using the setting of a quantum correlation experiment for playing a quantum game, and considering the examples of Prisoners' Dilemma and Matching Pennies, we argue that this approach towards constructing quantum games addresses some of their well known criticisms.

preprint2010arXiv

Constructing quantum games from symmetric non-factorizable joint probabilities

We construct quantum games from a table of non-factorizable joint probabilities, coupled with a symmetry constraint, requiring symmetrical payoffs between the players. We give the general result for a Nash equilibrium and payoff relations for a game based on non-factorizable joint probabilities, which embeds the classical game. We study a quantum version of Prisoners' Dilemma, Stag Hunt, and the Chicken game constructed from a given table of non-factorizable joint probabilities to find new outcomes in these games. We show that this approach provides a general framework for both classical and quantum games without recourse to the formalism of quantum mechanics.

preprint2010arXiv

Memristor MOS Content Addressable Memory (MCAM): Hybrid Architecture for Future High Performance Search Engines

Large-capacity Content Addressable Memory (CAM) is a key element in a wide variety of applications. The inevitable complexities of scaling MOS transistors introduce a major challenge in the realization of such systems. Convergence of disparate technologies, which are compatible with CMOS processing, may allow extension of Moore's Law for a few more years. This paper provides a new approach towards the design and modeling of Memristor (Memory resistor) based Content Addressable Memory (MCAM) using a combination of memristor MOS devices to form the core of a memory/compare logic cell that forms the building block of the CAM architecture. The non-volatile characteristic and the nanoscale geometry together with compatibility of the memristor with CMOS processing technology increases the packing density, provides for new approaches towards power management through disabling CAM blocks without loss of stored data, reduces power dissipation, and has scope for speed improvement as the technology matures.

preprint2009arXiv

Non-factorizable Joint Probabilities and Evolutionarily Stable Strategies in the Quantum Prisoner's Dilemma Game

The well known refinement of the Nash Equilibrium (NE) called an Evolutionarily Stable Strategy (ESS) is investigated in the quantum Prisoner's Dilemma (PD) game that is played using an Einstein-Podolsky-Rosen type setting. Earlier results report that in this scheme the classical NE remains intact as the unique solution of the quantum PD game. In contrast, we show here that interestingly in this scheme a non-classical solution for the ESS emerges for the quantum PD.

preprint2002arXiv

Parameter identification using the Hilbert transform

Many physical systems can be adequately modelled using a second order approximation. The problem of plant identification reduces to the problem of estimating the position of a single pair of complex conjugate poles. One approach to the problem is to apply the method of least squares to the time domain data. This type of computation is best carried out in "batch" mode and applies to an entire data set. Another approach would be to design an adaptive filter and to use autoregressive, AR, techniques. This would be well suited to continuous real-time data and could track slow changes on the underlying plant. I this paper we present a very fast but approximate technique for the estimation of the position of a single pair of complex conjugate poles, using the Hilbert transform to reconstruct the analytic signal.

preprint2002arXiv

The physical basis for Parrondo's games

Several authors have implied that the original inspiration for Parrondo's games was a physical system called a ``flashing Brownian ratchet''. The relationship seems to be intuitively clear but, surprisingly, has not yet been established with rigor. In this paper, we apply standard finite-difference methods of numerical analysis to the Fokker-Planck equation. We derive a set of finite difference equations and show that they have the same form as Parrondo's games. Parrondo's games, are in effect, a particular way of sampling a Fokker-Planck equation. Physical Brownian ratchets have been constructed and have worked. It is hoped that the finite element method presented here will be useful in the simulation and design of flashing Brownian ratchets.