Equivalence of Szegedy’s and coined quantum walks

Szegedy’s quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover’s algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms involving coined quantum walks, which are walks on the vertices of the original graph with an internal degree of freedom. The first scheme is equivalent to a coined quantum walk with one walk step per query of Grover’s oracle, and the second is equivalent to a coined quantum walk with two walk steps per query of Grover’s oracle. These equivalences lie outside the previously known equivalence of Szegedy’s quantum walk with absorbing vertices and the coined quantum walk with the negative identity operator as the coin for marked vertices, whose precise relationships we also investigate.     

Szegedy’s quantum walk with queries

When searching for a marked vertex in a graph, Szegedy’s usual search operator is defined by using the transition probability matrix of the random walk with absorbing barriers at the marked vertices. Instead of using this operator, we analyze searching with Szegedy’s quantum walk by using reflections around the marked vertices, that is, the standard form of quantum query. We show we can boost the probability to 1 of finding a marked vertex in the complete graph. Numerical simulations suggest that the success probability can be improved for other graphs, like the two-dimensional grid. We also prove that, for a certain class of graphs, we can express Szegedy’s search operator, obtained from the absorbing walk, using the standard query model.     

Valiant’s model and the cost of computing integers

Let (n) be the minimum number of arithmetic operations required to build the integer from the constants 1 and 2. A sequence x_n is said to be easy to compute if there exists a polynomial p such that for all It is natural to conjecture that sequences such as or n! are not easy to compute. In this paper we show that a proof of this conjecture for the first sequence would imply a superpolynomial lower bound for the arithmetic circuit size of the permanent polynomial. For the second sequence, a proof would imply a superpolynomial lower bound for the permanent or P PSPACE.     

A quantum mechanical model of consciousness and the emergence of ‘I’

There have been suggestions that the unity of consciousness may be related to the kind of holism depicted only in quantum physics. This argument will be clarified and strengthened. It requires the brain to contain a quantum system with the right properties — a Bose-Einstein condensate. It probably does contain one such system, as both theory and experiment have indicated. In fact, we cannot pay full attention to a quantum whole and its parts simultaneously, though we may oscillate between the two. In a quantum theory of consciousness, emergent meanings arise as an inevitable consequence of Heisenberg's Uncertainty Principle.     

Generating MDA’s platform independent model using URDAD

This paper formulates a set of minimal requirements for the Platform Independent Model (PIM) of the Model Driven Architecture (MDA). It then defines the Use Case, Responsibility Driven Analysis and Design methodology (URDAD) which provides a simple, algorithmic design methodology generating a PIM satisfying the specified PIM requirements.     

Handwriting character classification using Freeman’s olfactory KIII model

KIII model is an olfactory model proposed by W. J. Freeman referring to a physiological structure of mammal??s olfactory system. The KIII model has been applied to kinds of pattern recognition systems, for example, electronic nose, tea classification, etc. However, the dynamics of neurons in the KIII model is given by Hodgkin-Huxley??s second-order differential equation and it consumes a very high computation cost. In this paper, we propose a simplified dynamics of chaotic neuron instead of the Hodgkin-Huxley dynamics at first, and secondly, we propose to use Fourier transformation with high resolution capability to extract features of time series behaviors of internal states of M1 nodes in KIII model instead of the conventional standard deviation method. Furthermore, paying attention to the point that human brain does visual processing as same as olfactory processing in the sense of information processing, a handwriting image recognition problem is treated as a new application field of KIII model. Through the computer simulation of the handwriting character classification, it is shown that the proposed method is useful by the comparison of experiment results with both computation time and recognition accuracy.     

Identification of material parameters for McGinty’s model using adaptive RBFs and optimization

In this paper, an optimization approach is adopted to obtain the 12 material parameters used in McGinty’s Model for AL6022 by minimizing the differences between simulation and experimental stress–strain curves. Since the differences between the two stress–strain curves are implicitly related to the change of material parameters, the metamodeling technique is utilized to create explicit, approximate functions of these relationships. Radial basis functions (RBFs), which are shown from previous studies to be effective for both low- and high-order nonlinear responses, are used for the metamodels that are adaptively updated in the optimization work. Two optimization formulation schemes are studied to address the issue of using inaccurate RBF models in optimization. The sampling, metamodeling, and optimization works are performed using the integrated optimization framework HiPPO.     

Three-qubit Grover’s algorithm using superconducting quantum interference devices in cavity-QED

We present a scheme for the implementation of three-qubit Grover’s algorithm using four-level superconducting quantum interference devices (SQUIDs) coupled to a superconducting resonator. The scheme is based on resonant, off-resonant interaction of the cavity field with SQUIDs and application of classical microwave pulses. We show that adjustment of SQUID level spacings during the gate operations, adiabatic passage, and second-order detuning are not required that leads to faster implementation. We also show that the marked state can be searched with high fidelity even in the presence of unwanted off-resonant interactions, level decay, and cavity dissipation.     

Investigation of the relationship between Ironworker’s gait stability and different types of load carrying using wearable sensors

Load carrying can cause changes in gait stability. Maintaining gait stability (body balance) on a steel frame is an important factor in the prevention of accidents. However, the effects of load carrying on a restricted surface (width), where ironworkers usually perform their jobs, have rarely been investigated. In this context, this study investigates the effect of different types of load-carrying scenarios on the gait stability of ironworkers. Accordingly, to identify the relationships between the weight of load, type of load-carrying method, type of load-carrying tools, and gait stability, represented as the dynamic time warping (DTW) values, an experiment was conducted under 15 different load-carrying conditions. The change in DTW according to the different load conditions was as follows: For one-handed load-carrying using a toolbox, the average DTW values were 23.31 at a weight of 3 kg, 23.80 at 6 kg, 33.20 at 10 kg, 65.84 at 16 kg, and 103.50 at 20 kg. Moreover, for one-handed load-carrying using a bucket, the average DTW values were 23.07 at 3 kg, 24.76 at 6 kg, 34.35 at 10 kg, 77.52 at 16 kg, and 108.28 at 20 kg. Finally, in the case of both-handed load carrying, the average DTW values were 24.31 at 6 kg, 28.11 at 10 kg, 27.23 at 16 kg, 37.90 at 20 kg, and 40.96 at 32 kg. As the weight of the load increased, the DTW values in almost all the experimental cases also increased. Furthermore, the DTW values for bucket carrying and tool box carrying showed clear differences above a certain weight (16 kg). Thus, the results of the experiments indicate that different types of load-carrying conditions significantly affect the ironworkers’ gait stability as they walk on a steel frame. Finally, the calculated DTW values were compared with the subjective perceived ratings to validate the experimental results. The DTW value was highly correlated with the subjective perceived rating scores (Pearson coefficient: 0.929). The results of this study will facilitate the use of gait stability measurements to enhance the construction safety of ironworkers.     

Content-based image retrieval using student’s t-mixture model and constrained multiview nonnegative matrix factorization

Multimedia Tools and Applications - The expensive and time-consuming effort required for archiving images is the main motive for developing an effective retrieval system. This paper addresses a...     

On the effect of quantum noise in a quantum prisoner’s dilemma cellular automaton

The disrupting effect of quantum noise on the dynamics of a spatial quantum formulation of the iterated prisoner’s dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e., with local and synchronous interaction. It is concluded in this article that quantum noise induces in fair games the need for higher entanglement in order to make possible the emergence of the strategy pair (Q, Q), which produces the same payoff of mutual cooperation. In unfair quantum versus classic player games, quantum noise delays the prevalence of the quantum player.     

Molecular dynamics simulation of nanofluid’s flow behaviors in the near-wall model and main flow model

The flow behaviors of nanofluids were studied in this paper using molecular dynamics (MD) simulation. Two MD simulation systems that are the near-wall model and main flow model were built. The nanofluid model consisted of one copper nanoparticle and liquid argon as base liquid. For the near-wall model, the nanoparticle that was very close to the wall would not move with the main flowing due to the overlap between the solid-like layer near the wall and the adsorbed layer around the nanoparticle, but it still had rotational motion. When the nanoparticle is far away from the wall (d > 11 Å), the nanoparticle not only had rotational motion, but also had translation. In the main flow model, the nanoparticle would rotate and translate besides main flowing. There was slip velocity between nanoparticles and liquid argon in both of the two simulation models. The flow behaviors of nanofluids exhibited obviously characteristics of two-phase flow. Because of the irregular motions of nanoparticles and the slip velocity between the two phases, the velocity fluctuation in nanofluids was enhanced.     

The Interplay Between the Speaker’s and the Hearer’s Perspective

The neutralization of contrasts in form or meaning that is sometimes observed in language production and comprehension is at odds with the classical view that language is a systematic one-to-one pairing of forms and meanings. This special issue is concerned with patterns of forms and meanings in language. The papers in this special issue arose from a series of workshops that were organized to explore variants of bidirectional Optimality Theory and Game Theory as models of the interplay between the speaker’s and the hearer’s perspective.     

Thwarting intercept-and-resend attack on Zhang’s quantum secret sharing using collective rotation noises

This work deliberately introduces collective-rotation noise into quantum states to prevent an intercept-resend attack on Zhang’s quantum secret sharing scheme over a collective-noise quantum channel (Zhang in Phys A 361:233–238, 2006). The noise recovering capability of the scheme remains intact. With this design, the quantum bit efficiency of the protocol is doubled when compared to Sun et al.’s improvement on Zhang’s scheme (Sun et al. in Opt Commun 283:181–183, 2010).     

Weak Galerkin method for the Biot’s consolidation model

We develop a weak Galerkin (WG) finite element method for the Biot’s consolidation model in the classical displacement–pressure two-field formulation. Weak Galerkin linear finite elements are used for both displacement and pressure approximations in spatial discretizations. Backward Euler scheme is used for temporal discretization in order to obtain an implicit fully discretized scheme. We study the well-posedness of the linear system at each time step and also derive the overall optimal-order convergence of the WG formulation. Such WG scheme is designed on general shape regular polytopal meshes and provides stable and oscillation-free approximation for the pressure without special treatment. Numerical experiments are presented to demonstrate the efficiency and accuracy of the proposed weak Galerkin finite element method.     

Narrow privacy and desynchronization in Vaudenay’s RFID model

Forward privacy of RFID systems and its relaxed version, narrow forward privacy, are generally considered satisfactory for practical needs. Unfortunately, the attempt to get forward privacy by symmetric-key cryptography failed. Also, all symmetric-key cryptography-based RFID systems proposed so far that are strictly narrow forward private (that is, narrow forward private but not forward private) suffer from desynchronization. Under these circumstances, the question whether the attempt to exceed these limits is doomed to failure or not was frequently asked. The paper we are proposing wants to clarify this matter. Thus, we show that forward privacy in Vaudenay’s RFID model cannot be achieved with symmetric-key cryptography. Then, we show that strictly narrow forward privacy can be achieved with symmetric-key cryptography only by RFID systems with unbounded desynchronization. This last result holds for strictly narrow destructive privacy and strictly narrow strong privacy too, if one wants to achieve them with symmetric-key cryptography.

     

Exploring the relationships between single-vehicle traffic accident and driver’s route familiarity on the mountainous highways

Cognition, Technology & Work - Route familiarity has been found greatly associated with driver behaviour and traffic safety. This study aimed to investigate relationships between mountainous...     

Beyond roll-up’s and drill-down’s: An intentional analytics model to reinvent OLAP

This paper structures a novel vision for OLAPby fundamentally redefining several of the pillars on which OLAP has been based for the last 20 years. We redefine OLAP queries, in order to move to higher degrees of abstraction from roll-up’s and drill-down’s, and we propose a set of novel intentional OLAP operators, namely, describe, assess, explain, predict, and suggest, which express the user’s need for results. We fundamentally redefine what a query answer is, and escape from the constraint that the answer is a set of tuples; on the contrary, we complement the set of tuples with models (typically, but not exclusively, results of data mining algorithms over the involved data) that concisely represent the internal structure or correlations of the data. Due to the diverse nature of the involved models, we come up (for the first time ever, to the best of our knowledge) with a unifying framework for them, that places its pillars on the extension of each data cell of a cube with information about the models that pertain to it — practically converting the small parts that build up the models to data that annotate each cell. We exploit this data-to-model mapping to provide highlights of the data, by isolating data and models that maximize the delivery of new information to the user. We introduce a novel method for assessing the surprise that a new query result brings to the user, with respect to the information contained in previous results the user has seen via a new interestingness measure. The individual parts of our proposal are integrated in a new data model for OLAP, which we call the Intentional Analytics Model. We complement our contribution with a list of significant open problems for the community to address.