Search

According to previous studies, ultrasound exposure appears to be a noninvasive method for modulating brain activity related to cognition and consciousness; however, its effects on emotional states remain unclear. Therefore, an animal model is required in which the effects and effect mechanisms of ultrasound exposure can be investigated. Thus, we used olfactory bulbectomized rats as an animal model of depression and investigated their emotional state following ultrasound exposure.In male Wistar/ST olfactory bulbectomized rats, hyperemotionality was evaluated according to hyperemotionality scoring and the scores before and after 24-h ultrasound exposure were compared. Elevated plus maze (EPM) tests were also conducted after 24-h ultrasound exposure, and blood samples were collected in which plasma corticosterone concentrations were measured.Following exposure to high-frequency (~50 kHz) ultrasound vocalizations (USVs) associated with the pleasant emotions of rats, the hyperemotionality scores of olfactory bulbectomized rats were significantly reduced. Additionally, the latency of the first entry into the open arm of the EPM was significantly decreased in USV-exposed olfactory bulbectomized rats, as were their plasma corticosterone levels. Furthermore, artificial ultrasound (50 kHz) at a similar frequency to that of USV also significantly decreased the hyperemotionality score of olfactory bulbectomized rats.Ultrasound exposure improved depressive-like behavior in olfactory bulbectomized rats and reduced their plasma corticosterone levels. Thus, we recommend the use of olfactory bulbectomized rats as an animal model for investigating the effects and effect mechanisms of ultrasound exposure.

Ultrasonic vocalization (USVs) is a promising tool to measure behavioral anxiety in rodents as USV recording is noninvasive, behaviorally relevant, ethological, and reproducible. Studies reporting the effects of stress-induced USVs in adult mice remain limited and debated. We investigated the conditions under which mice emit aversive USVs and evaluated the effects of psychiatric drugs on stress-induced USVs. Male C57BL/6J mice were used. USVs during entire stress sessions were recorded according to their frequency. To investigate the effect of psychiatric drugs on USVs, the number of USVs under cold-restraint stress conditions before and after drug administration was compared. Immediately after stress exposure, blood samples were collected and plasma corticosterone levels were measured. The combination of cold and restraint stress conditions significantly increased the USV numbers and plasma corticosterone levels compared with each stress alone. A benzodiazepine anxiolytic (midazolam) and δ-opioid receptor agonist putative anxiolytic (KNT-127) significantly reduced the stress-induced USV number and plasma corticosterone levels; however, a monoaminergic antidepressant (duloxetine) and N-methyl-D-aspartic acid receptor antagonist antidepressant (ketamine) did not reduce the USV numbers. No changes were noted in the USV numbers after repeated exposure to cold-restraint stress on days 1 and 3. The suppressive effect of midazolam on day 3 was comparable to that on day 1. Stress-induced USV may be used as a quantitative measure of anxiety to systematically assess the effects of anxiolytics. Therefore, cold-restraint stress-induced USVs may be used as a novel tool to measure rodent anxiety and as a useful anxiolytic-screening system.

Strongly asymmetric public key agreement (SAPKA) is a class of key exchange between Alice and Bob that was introduced in 2011. The greatest difference from the standard PKA algorithms is that Bob constructs multiple public keys and Alice uses one of these to calculate her public key and her secret shared key. Therefore, the number of public keys and calculation rules for each key differ for each user. Although algorithms with high security and computational efficiency exist in this class, the relation between the parameters of SAPKA and its security and computational efficiency has not yet been fully clarified. Therefore, our main objective in this study was to classify the SAPKA algorithms according to their properties. By attempting algorithm attacks, we found that certain parameters are more strongly related to the security. On this basis, we constructed concrete algorithms and a new subclass of SAPKA, in which the responsibility of maintaining security is significantly more associated with the secret parameters of Bob than those of Alice. Moreover, we demonstrate 1. insufficient but necessary conditions for this subclass, 2. inclusion relations between the subclasses of SAPKA, and 3. concrete examples of this sub-class with reports of implementational experiments.

A new public key agreement (PKA) algorithm, called the strongly-asymmetric algorithm (SAA-5), was introduced by Accardi et al. The main differences from the usual PKA algorithms are that Bob has some independent public keys and Alice produces her public key by using some part of the public keys from Bob. Then, the preparation and calculation processes are essentially asymmetric. This algorithms has several free parameters more than the usual symmetric PKA algorithms and the velocity of calculation is largely dependent on the parameters chosen, however, the performance of it has not yet been tested. The purpose of our study was to discuss efficient parameters to share the key with high speeds in SAA-5 and to optimize SAA-5 in terms of calculation speed. To find efficient parameters of SAA-5, we compared the calculation speed with Diffie&ndash, Hellman (D-H) while varying values of some parameters under the circumstance where the length of the secret shared key (SSK) was fixed. For optimization, we discuss a more general framework of SAA-5 to find more efficient operations. By fixing the parameters of the framework properly, a new PKA algorithm with the same security level as SAA-5 was produced. The result shows that the calculation speed of the proposed PKA algorithm is faster than D-H, especially for large key lengths. The calculation speed of the proposed PKA algorithm increases linearly as the SSK length increases, whereas D-H increases exponentially.

A new class of public key agreement (PKA) algorithms called strongly-asymmetric algorithms (SAA) was introduced in a previous paper by some of the present authors. This class can be shown to include some of the best-known PKA algorithms, for example the Diffie&ndash, Hellman and several of its variants. In this paper, we construct a new version of the previous construction, called SAA-5, improving it in several points, as explained in the Introduction. In particular, the construction complexity is reduced, and at the same time, robustness is increased. Intuitively, the main difference between SAA-5 and the usual PKA consists of the fact that in the former class, B (Bob) has more than one public key and A (Alice) uses some of them to produce her public key and others to produce the secret shared key (SSK). This introduces an asymmetry between the sender of the message (B) and the receiver (A) and motivates the name for this class of algorithms. After describing the main steps of SAA-5, we discuss its breaking complexity assuming zero complexity of discrete logarithms and the computational complexity for both A and B to create SSK.

Recently, it has been shown that the mathematical model of photosynthetic process can be described by quantum network. The model is based on fully connected network, and the dynamics is written by the GKSL master equation. The system at room temperature is susceptible to a dissipative and dephasing noise from the environment. The previous research showed that the efficiency of energy transfer can be increased by dephasing noise in the case that there is no dissipative noise. In this study, we calculate the efficiency of energy transfer in the case of considering both noises rigorously and show that the transfer efficiency becomes better when the dephasing noise is stronger than the dissipative one.

A strongly asymmetric public key agreement (SAPKA) is the class of public key distribution between Alice and Bob where some processes are different in users. This class was introduced by Accardi et al. \cite{A11,A11-2}, and it is shown that it includes usual symmetric public key agreement (PKA), for example Diffie-Hellman PKA. This framework has several free parameters more than symmetric PKAs, and security advantages based on mathematical conditions, so called compatibility condition. In this paper, we explain the definition of SAPKA, and discuss about its strength against attack by constructing an example.

A lifting is a map from the state of a system to that of a compound system, which was introduced in Accardi and Ohya (Appl. Math. Optim. 39:33–59, 1999). The lifting can be applied to various physical processes.

Ohya and Volovich proposed the polynomial time quantum algorithm to solve SAT problem which is one of NP-complete problems. This algorithm contains effective amplification process, so called a Chaos Amplifie, based on classical Chaotic dynamics. Recently we described this process by the GKSL master equation on two qubits system. In this talk, we introduce an efficien quantum algorithm for searching problem using the Chaos Amplifie.

Quantum mutual entropy and quantum capacity are rigorously defined by Ohya, and they are quite useful in the study of quantum communication processes [4, 7, 8, 9,10]. Mathematical models of optical communication processes are described by a quantum channel and optical states, and quantum capacity is one of the most important criteria to measure the efficiency of information transmission [4,7,8]. In actual optical communication, a laser beam is used for a signal, and it is denoted mathematically by a coherent state. Further, optical communication using a squeezed state, which is expected to be more efficient than that using a coherent state is proposed. In this paper, we define several quantum channels, that is, a squeezed channel and a coherent channel and so on. We compare them by calculating quantum capacity.

In this Letter, we construct a novel model of universal quantum Turing machine (QTM) by means of a property of Riemann zeta function, which is free from the specific time for an input data and efficiently simulates each step of a given QTM.

The well known quantum algorithm for search problem is Grover's one. However, its computational complexity is not a polynomial in the input. In this study, we propose a polynomial time quantum algorithm for it based on quantum binary search and an amplification process. This process can be written as a quantum Turing machine form, a so called generalized quantum Turing machine GQTM. We introduce the definition of GQTM and its language classes.

The adaptive dynamics is known as a new mathematics to treat with a complex phenomena, for example, chaos, quantum algorithm and psychological phenomena. In this paper, we briefly review the notion of the adaptive dynamics, and explain the definition of the generalized Turing machine (GTM) and recognition process represented by the Fock space. Moreover, we show that there exists the quantum channel which is described by the GKSL master equation to achieve the Chaos Amplifier used in [M. Ohya and I. V. Volovich, J. Opt. B 5(6) (2003) 639., M. Ohya and I. V. Volovich, Rep. Math. Phys. 52(1) (2003) 25.]

We have studied a quantum algorithm for several years, and developed some applications for difficult problems, NPC problems and NP intermidiate problems. In order to discuss the computational complexity of quantum algorithm, we defined a generalized quantum Turing machine using a density operator on a Hilbert space and quantum channels on it. Since the properity of quantum channel, this mathematical model can describe not only unitary process of quantum algorithm but also measurement process and non‐linear dynamical process. Then we can calculate the computational complexity of quantum algorithm more regorously.In this paper, we review our results, and discuss why quantum algorithms are more effective than classical ones. Moreover, we propose a quantum algorotihm for EXPTIME problem.

Ohya and Volovich found the quantum algorithm with a chaos dynamics, called the OV SAT algorithm which enabled to solve NP-Complete problem in polynomial time. It is proved that the unitary operator of the quantum algorithm can be constructed by a product of so called fundamental gates. To discuss the computational complexity rigorously, we introduced a generalized quantum Turing machine(GQTM) where the computational process is given by quantum channels including a dispative dynamics and the configuration is represented by density operators. In this paper, we explain the GQTM and the OV SAT algorithm, then we discuss the computational complexity of OV SAT algorithm. Finally, we introduce some resent results and topics by use of GQTM.

It is known that Drug Delivery System (DDS) is useful to remedy against tumors for the reduction of side effects and the effective dosage. However the shape, in particular, the size of drug (medicine) is empirically decided in the present stage, which will be related to a question how much medicine should be dosed. Taking a particular reaction of tumor tissues called the EPR effect into consideration, we try to mathematically describe the behavior (dynamics) of drug in blood vessel by applying several techniques used in mathematics and physics. In this paper, we estimate the configuration of drug which is most effective to remedy for tumors under various conditions. As a result, this model and its simulation will be useful to design the drug in nano-level.

Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm., Comment: 19 pages