In this paper, we propose two algorithms, B-N2N and B-N2S, that solve the node-to-node and node-to-set disjoint paths problems in the bicube, respectively. We prove their correctness and that the time complexities of the B-N2N and B-N2S algorithms are O(n2) and O(n2 log n), respectively, if they are applied in an n-dimensional bicube with n ≥ 5. Also, we prove that the maximum lengths of the paths generated by B-N2N and B-N2S are both n + 2. Furthermore, we have shown that the algorithms can be applied in the locally twisted cube, too, with the same performance.

Crosstalk between lines plays an important role in the transmission of signal. Hence it is of great significance to establish the transmission lines model accurately to evaluate factors affecting crosstalk coupling between lines and to improve the anti-interference capability of the system. As twisted-pair line is widely used for its unique twist structure which improves the anti-interference performance of cables, this paper presents a method of constructing transmission lines model of the shielded twisted-pair line (STP) with two twisted pairs based on S-parameters. Firstly, the transmission lines model of STP with one twisted pair is established. The establishment of distributed capacitance matrix of this model depends on the dielectric constant of insulation layer that surrounds a conductor, but the dielectric constant is often unknown. In this respect, a method to obtain the distributed capacitance matrix based on the S-parameters of this model is proposed. Due to twisting, there is a great deal of variability between the distribution parameters along the length of the STP. As the spatial distribution of conductors in the cross-section of twisted-pair line vary along with the cable length, the distribution parameters matrices also change as they move. The cable is divided into several segments, and the transmission lines model of STP is obtained with the cascade of each segment model. For the STP with two twisted pairs, the crosstalk between pairs is analyzed based on the mixed mode S-parameters. Combined with the transmission lines model of STP with one twisted pair, that of STP with two twisted pairs is obtained. The terminal response voltage can be calculated from the transmission lines model and cable terminal conditions. The validity of the transmission lines model is verified by the consistency between the terminal responses calculated by the model and by the simulated. As the theoretical and simulation results are compatible, the modeling method for the STP with two twisted pairs can be used for the STP with more twisted pairs. In practical engineering application, S-parameters and mixed mode S-parameters can be obtained by testing. That means the transmission lines model of STP can be established based on the test results.

In this paper, a special class of two-generator quasi-twisted (QT) codes with index 2 will be presented. We explore the algebraic structure of the class of QT codes and the form of their Hermitian dual codes. A sufficient condition for self-orthogonality with Hermitian inner product is derived. Using the class of Hermitian self-orthogonal QT codes, we construct two new binary quantum codes [[70, 42, 7]]2, [[78, 30, 10]]2. According to Theorem 6 of Ref.[2], we further can get 9 new binary quantum codes. So a total of 11 new binary quantum codes are obtained and there are 10 quantum codes that can break the quantum Gilbert-Varshamov (GV) bound.

It is found that the electrical resistance-length characteristic in an electroactive supercoiled polymer artificial muscle strongly depends on the temperature. This may come from the thermal expansion of coils in the artificial muscle, which increases the contact area of neighboring coils and results in a lower electrical resistance at a higher temperature. On the other hand, the electrical resistance-length characteristic collected during electrical driving seriously deviates from those collected at constant temperatures. Inhomogeneous heating during electrical driving seems to be a key for the deviation.

Angular Momentum (AM) has been considered as a new dimension of wireless transmissions as well as the intrinsic property of Electro-Magnetic (EM) waves. So far, AM is utilized as a discrete mode not only in the quantum states, but also in the statistical beam forming. Traditionally, the continuous value of AM is ignored and only the quantized mode number is identified. However, the recent discovery on electrons in spiral motion producing twisted radiation with AM, including Spin Angular Momentum (SAM) and Orbital Angular Momentum (OAM), proves that the continuous value of AM is available in the statistical EM wave beam. This is also revealed by the so-called fractional OAM, which is reported in optical OAM beams. Then, as the new dimension with continuous real number field, AM should turn out to be a certain spectrum, similar to the frequency spectrum usually in the wireless signal processing. In this letter, we mathematically define the AM spectrum and show the applications in the information theory analysis, which is expected to be an efficient tool for the future wireless communications with AM.

S-shaped nonlinearity is found in the electrical resistance-length relationship in an electroactive supercoiled polymer artificial muscle. The modulation of the electrical resistance is mainly caused by the change in the contact condition of coils in the artificial muscle upon deformation. A mathematical model based on logistic function fairly reproduces the experimental data of electrical resistance-length relationship.

In this paper, we consider a wide family of λ-quasi-twisted (λ-QT) codes of index 2 and provide a bound on the minimum Hamming distance. Moreover, we give a sufficient condition for dual containing with respect to Hermitian inner product of these involved codes. As an application, some good stabilizer quantum codes over small finite fields F2 or F3 are obtained from the class of λ-QT codes.

In a multiprocessor system, processors are connected based on various types of network topologies. A network topology is usually represented by a graph. Let G be a graph and u, v be any two distinct vertices of G. We say that G is pancyclic if G has a cycle C of every length l(C) satisfying 3≤l(C)≤|V(G)|, where |V(G)| denotes the total number of vertices in G. Moreover, G is panpositionably pancyclic from r if for any integer m satisfying $r leq m leq rac{|V(G)|}{2}$, G has a cycle C containing u and v such that dC(u,v)=m and 2m≤l(C)≤|V(G)|, where dC(u,v) denotes the distance of u and v in C. In this paper, we investigate the panpositionable pancyclicity problem with respect to the n-dimensional locally twisted cube LTQn, which is a popular topology derived from the hypercube. Let D(LTQn) denote the diameter of LTQn. We show that for n≥4 and for any integer m satisfying $D(LTQ_n) + 2 leq m leq rac{|V(LTQ_n)|}{2}$, there exists a cycle C of LTQn such that dC(u,v)=m, where (i) 2m+1≤l(C)≤|V(LTQn)| if m=D(LTQn)+2 and n is odd, and (ii) 2m≤l(C)≤|V(LTQn)| otherwise. This improves on the recent result that u and v can be positioned with a given distance on C only under the condition that l(C)=|V(LTQn)|. In parallel and distributed computing, if cycles of different lengths can be embedded, we can adjust the number of simulated processors and increase the flexibility of demand. This paper demonstrates that in LTQn, the cycle embedding containing any two distinct vertices with a feasible distance is extremely flexible.

We have proposed a mortar-shaped structure to improve response time and alignment uniformity of twisted vertically aligned (TVA) mode liquid crystal displays (LCDs) for high-contrast reflective color LCDs. From the results of the simulation, we clarified that response time, alignment uniformity and viewing angle range of TVA-mode LCDs were improved by controlling the liquid crystal alignment axis-symmetrically in each pixel.

The aim of this research is realizing a high resolution and a fast color switching of electronic papers. In this report, we realized basis of electric papers comprised on magnetic Janus particles was established. Colored and magnetic Janus particles were successfully prepared, and magnetic Janus particles were introduced into honeycomb matrices. Introduced magnetic Janus particles quickly respond to an external magnetic field.

In this paper, we provided a new variant of Weil pairing on a family of genus 2 curves with the efficiently computable automorphism. Our pairing can be considered as a generalization of the omega pairing given by Zhao et al. We also report the algebraic cost estimation of our pairing. We then show that our pairing is more efficient than the variant of Tate pairing with the automorphism given by Fan et al. Furthermore, we show that our pairing is slightly better than the twisted Ate pairing on Kawazoe-Takahashi curve at the 192-bit security level.

We propose a novel acceleration scheme for Monte Carlo based statistical static timing analysis (MC-SSTA). MC-SSTA, which repeatedly executes ordinary STA using a set of randomly generated gate delay samples, is widely accepted as an accuracy reference. A large number of random samples, however, should be processed to obtain accurate delay distributions, and software implementation of MC-SSTA, therefore, takes an impractically long processing time. In our approach, a generalized hardware module, the STA processing element (STA-PE), is used for the delay evaluation of a logic gate, and netlist-specific information is delivered in the form of instructions from an SRAM. Multiple STA-PEs can be implemented for parallel processing, while a larger netlist can be handled if only a larger SRAM area is available. The proposed scheme is successfully implemented on Altera's Arria II GX EP2AGX125EF35C4 device in which 26 STA-PEs and a 624-port Mersenne Twister-based random number generator run in parallel at a 116 MHz clock rate. A speedup of far more than10 is achieved compared to conventional methods including GPU implementation.

A reverse mode liquid crystal (LC) display has been investigated. A driving voltage strongly depends on a morphology which changes by reactive mesogens, photo initiators and LCs. It becomes higher when the domain size of the liquid crystal and the particle of the polymer reactive mesogen are smaller.

In the case of Barreto-Naehrig pairing-friendly curves of embedding degree 12 of order r, recent efficient Ate pairings such as R-ate, optimal, and Xate pairings achieve Miller loop lengths of(1/4) ⌊log2 r⌋. On the other hand, the twisted Ate pairing requires (3/4) ⌊log2 r⌋ loop iterations, and thus is usually slower than the recent efficient Ate pairings. This paper proposes an improved twisted Ate pairing using Frobenius maps and a small scalar multiplication. The proposed idea splits the Miller's algorithm calculation into several independent parts, for which multi-pairing techniques apply efficiently. The maximum number of loop iterations in Miller's algorithm for the proposed twisted Ate pairing is equal to the (1/4) ⌊log2 r ⌋ attained by the most efficient Ate pairings.

This work presents a statistical model for the radiated susceptibility (RS) of an unshielded twisted-wire pair (TWP) running above ground, illuminated by a random electromagnetic field. The incident field is modeled as a superposition of elemental plane waves with random angular density, phase, and polarization. The statistical properties of both the differential-mode (DM) and the common-mode (CM) noise voltages induced across the terminal loads are derived and discussed.

We observe a natural generalisation of the ate and twisted ate pairings, which allow for performance improvements in non standard applications of pairings to cryptography like composite group orders. We also give a performance comparison of our pairings and the Tate, ate and twisted ate pairings for certain polynomial families based on operation count estimations and on an implementation, showing that our pairings can achieve a speedup of a factor of up to two over the other pairings.

This paper presents implementation techniques of fast Ate pairing of embedding degree 12. In this case, we have no trouble in finding a prime order pairing friendly curve E such as the Barreto-Naehrig curve y2=x3+a, a∈Fp. For the curve, an isomorphic substitution from G2 ⊂ E(Fp12 into G'2 in subfield-twisted elliptic curve E'(Fp2) speeds up scalar multiplications over G2 and wipes out denominator calculations in Miller's algorithm. This paper mainly provides about 30% improvement of the Miller's algorithm calculation using proper subfield arithmetic operations. Moreover, we also provide the efficient parameter settings of the BN curves. When p is a 254-bit prime, the embedding degree is 12, and the processor is Pentium4 (3.6 GHz), it is shown that the proposed algorithm computes Ate pairing in 13.3 milli-seconds including final exponentiation.

For ID-based cryptography, not only pairing but also scalar multiplication must be efficiently computable. In this paper, we propose a scalar multiplication method on the circumstances that we work at Ate pairing with Barreto-Naehrig (BN) curve. Note that the parameters of BN curve are given by a certain integer, namely mother parameter. Adhering the authors' previous policy that we execute scalar multiplication on subfield-twisted curve (Fp2) instead of doing on the original curve E(Fp12), we at first show sextic twisted subfield Frobenius mapping (ST-SFM) in (Fp2). On BN curves, note is identified with the scalar multiplication by p. However a scalar is always smaller than the order r of BN curve for Ate pairing, so ST-SFM does not directly applicable to the above circumstances. We then exploit the expressions of the curve order r and the characteristic p by the mother parameter to derive some radices such that they are expressed as a polynomial of p. Thus, a scalar multiplication [s] can be written by the series of ST-SFMs . In combination with the binary method or multi-exponentiation technique, this paper shows that the proposed method runs about twice or more faster than plain binary method.

For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k=9 or curves with k=12. The case k=9 has not been studied in the literature, and so it is not clear how efficiently pairings can be computed in that case. In this paper, we present efficient methods for the k=9 case, including generation of elliptic curves with the shorter Miller loop, the denominator elimination and speed up of the final exponentiation. Then we compare the performance of these choices. From the analysis, we conclude that for pairing-based cryptography at the AES 128 security level, the Barreto-Naehrig curves are the most efficient choice, and the performance of the case k=9 is comparable to the Barreto-Naehrig curves.

MT19937 is a kind of Mersenne Twister, which is a pseudo-random number generator. This study presents new designs for a MT19937 circuit suitable for custom computing machinery for high-performance scientific simulations. Our designs can generate multiple random numbers per cycle (multi-port design). The estimated throughput of a 52-port design was 262 Gbps, which is 115 times higher than the software on a Pentium 4 (2.53 GHz) processor. Multi-port designs were proven to be more cost-effective than using multiple single-port designs. The initialization circuit can be included without performance loss in exchange for a slight increase of logic scale.