Calculation of light delay for coupled microrings by FDTD technique and Pade approximation

The Pade approximation with Baker's algorithm is compared with the least-squares Prony method and the generalized pencil-of-functions (GPOF) method for calculating mode frequencies and mode Q factors for coupled optical microdisks by FDTD technique. Comparisons of intensity spectra and the corresponding mode frequencies and Q factors show that the Pade approximation can yield more stable results than the Prony and the GPOF methods, especially the intensity spectrum. The results of the Prony method and the GPOF method are greatly influenced by the selected number of resonant modes, which need to be optimized during the data processing, in addition to the length of the time response signal. Furthermore, the Pade approximation is applied to calculate light delay for embedded microring resonators from complex transmission spectra obtained by the Pade approximation from a FDTD output. The Prony and the GPOF methods cannot be applied to calculate the transmission spectra, because the transmission signal obtained by the FDTD simulation cannot be expressed as a sum of damped complex exponentials. (C) 2009 Optical Society of America

Silica-based 64-channel arrayed waveguide gratings with double functions

Silica-based 64-channel arrayed waveguide gratings (AWGs) with double functions and 0.4 nm (50 GHz) channel spacing have been designed and fabricated. On the same component, Gauss and flat-top output response spectra are obtained simultaneously. The test results show that when the insertion loss ranges from 3.5 dB to 6 dB,the crosstalk is better than -34 dB, the 1 dB bandwidth is 0.12 nm, the 3 dB bandwidth is 0,218 nm, and the polarization-dependent loss (PDL) is less than 0.5 dB for Gauss response. When the insertion loss ranges,from 5.8 dB to 7.8 dB, the crosstalk is better than -30 dB, the 1 dB bandwidth is 0.24 nm, the 3 dB bandwidth is 0.33 nm, and the PDL is less than 0.2 dB for flat-top response.

Generalized Viscoplastic Modeling of Debris Flow

Various concepts have been proposed or used in the development of rheological models for debris flow. The earliest model developed by Bagnold was based on the concept of the “dispersive” pressure generated by grain collisions. Bagnold’s concept appears to be theoretically sound, but his empirical model has been found to be inconsistent with most theoretical models developed from non-Newtonian fluid mechanics. Although the generality of Bagnold’s model is still at issue, debris-flow modelers in Japan have generally accepted Takahashi’s formulas derived from Bagnold’s model. Some efforts have recently been made by theoreticians in non-Newtonian fluid mechanics to modify or improve Bagnold’s concept or model. A viable rheological model should consist both of a rate-independent part and a rate-dependent part. A generalized viscoplastic fluid (GVF) model that has both parts as well as two major rheological properties (i.e., the normal stress effect and soil yield criterion) is shown to be sufficiently accurate, yet practical, for general use in debris-flow modeling. In fact, Bagnold’s model is found to be only a particular case of the GVF model. Analytical solutions for (steady) uniform debris flows in wide channels are obtained from the GVF model based on Bagnold’s simplified assumption of constant grain concentration.

Practical Evaluation of Security against Generalized Interpolation Attack

Interpolation attack was presented by Jakobsen and Knudsen at FSE'97. Interpolation attack is effective against ciphers that have a certain algebraic structure like the PURE cipher which is a prototype cipher, but it is difficult to apply the attack to real-world ciphers. This difficulty is due to the difficulty of deriving a low degree polynomial relation between ciphertexts and plaintexts. In other words, it is difficult to evaluate the security against interpolation attack. This paper generalizes the interpolation attack. The generalization makes easier to evaluate the security against interpolation attack. We call the generalized interpolation attack linear sum attack. We present an algorithm that evaluates the security of byte-oriented ciphers against linear sum attack. Moreover, we show the relationship between linear sum attack and higher order differential attack. In addition, we show the security of CRYPTON, E2, and RIJNDAEL against linear sum attack using the algorithm.

practical type checking of functions defined on context-free languages

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

pattern matching compilation of functions defined in context-free languages

LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed.

facilitating formal specification acquisition by using recursive functions on context-free languages

Although formal specification techniques are very useful in software development, the acquisition of formal specifications is a difficult task. This paper presents the formal specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of specifications. Construction and validation of LFC specifications are machine-aided. The basic ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are described.

combining cfg and recursive functions to get a new language

We propose a new functional programming language(FPL) which differs in some aspects from most well known FPLs[l].We descrihc the prohlmm domain,the language,explain why we need it.

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.