End-pumped continuous-wave passively modelocked Nd : YVO4 laser with low pump power

A simple cw mode-locked solid-state laser, which is end-pumped by a low-power laser diode, was demonstrated by optimizing the laser-mode size inside the gain medium. The optimum ratio between mode and pump spot sizes inside the laser crystal was estimated for a cw mode-locked laser, taking into account the input pump power. Calculation and experiment have shown that the optimum ratio was about 3 when the pump power is 2 W, which is different from the value regularly used in passively mode-locked solid-state lasers. This conclusion is also helpful in increasing the efficiency of high-power ultrashort lasers. (C) 2006 Society of Photo-Optical Instrumentation Engineers.

Continuous speech research based on HyperSausage Neuron

In this paper, we presents HyperSausage Neuron based on the High-Dimension Space(HDS), and proposes a new algorithm for speaker independent continuous digit speech recognition. At last, compared to HMM-based method, the recognition rate of HyperSausage Neuron method is higher than that of in HMM-based method.

A widely tunable continuous-time LPF for a direct conversion DBS Tuner

A continuous-time 7th-order Butterworth Gm-C low pass filter (LPF) with on-chip automatic tuning circuit has been implemented for a direct conversion DBS tuner in a 0.35um SiGe BiCMOS technology. The filter's -3dB cutoff frequency f(0) can be tuned from 4MHz to 40MHz. A novel translinear transconductor (Gm) cell is used to implement the widely tunable and high linear filter. The filter has -0.5dB passband gain, 28nV/Hz(1/2) input referred noise, -2dBVrms passband IIP3, 24dBVrms stopband IIP3. The I/Q LPFs with the tuning circuit draw 16mA (with f(0)=20MHz) from 3.3 V supply, and occupy an area of 0.45 mm(2).

Continuous-wave electrically injected InP/GaInAsP equilateral-triangle-resonator lasers

Equilateral-triangle-resonator (ETR) microlasers with an output waveguide connected to one of the vertices of the ETR are fabricated using standard photolithography and inductively-coupled-plasma etching techniques. Continuous-wave electrically injected 1550 nm ETR laser with side length ranged from 15 to 30 tm are realized at room temperature.

Continuous speech research based on HyperSausage Neuron

In this paper, we presents HyperSausage Neuron based on the High-Dimension Space(HDS), and proposes a new algorithm for speaker independent continuous digit speech recognition. At last, compared to HMM-based method, the recognition rate of HyperSausage Neuron method is higher than that of in HMM-based method.

Period Continuous Tuning of an Efficient Mid-Infrared Optical Parametric Oscillator Based on a Fan-out Periodically Poled MgO-Doped Lithium Niobate

We report a period continuously tunable, efficient, mid-infrared optical parametric oscillator (OPO) based on a fan-out periodically poled MgO-doped congruent lithium niobate (PPMgLN). The OPO is pumped by a Nd:YAG laser and a maximum idler output average power of 1.65 W at 3.93 mu m is obtained with a pump average power of 10.5 W, corresponding to the conversion efficiency of about 16% from the pump to the idler. The output spectral properties of the OPO with the fan-out crystal are analyzed. The OPO is continuously tuned over 3.78-4.58 mu m (idler) when fan-out periods are changed from 27.0 to 29.4 mu m. Compared with temperature tuning, fan-out period continuous tuning has faster tuning rate and wider tuning range.

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.