This paper gives new methods for calculating the time-domain response for a nite-length distributed RC line. We begin with the solution for di usion in a semi-in nite distributed RC line [4, 12] and apply the method of images (re ections) to obtain the voltage response for a nite-length RC line. Second, we describe a general approach for calculating the time-domain response for nite RC lines wi...

We prove that the mapping class group of a compact surface with a nite number of punctures and non-empty boundary is order automatic. More precisely, the group is right-orderable, has an automatic structure as described by Mosher, and there exists a nite state automaton that decides, given the Mosher normal forms of two elements of the group, which of them represents the larger element of the g...

We study the problem of eeciently learning to play a game optimally against an unknown adversary chosen from a computationally bounded class. We both contribute to the line of research on playing games against nite automata, and expand the scope of this research by considering new classes of adversaries. We introduce the natural notions of games against recent history adversaries (whose current...

Combinatorial problems are often speciied declaratively in logic programs with constraints over nite domains. This paper presents several program transformation and optimization techniques for improving the performance of the class of programs with nite-domain constraints. The techniques include planning the evaluation order of body goals, reducing the domain of variables, planning the instanti...

We present new, e cient algorithms for some fundamental computations with nite dimensional (but not necessarily commutative) associative algebras over nite elds. For a semisimple algebra A we show how to compute a complete Wedderburn decomposition of A as a direct sum of simple algebras, an isomorphism between each simple component and a full matrix algebra, and a basis for the centre of A. If ...

This paper presents an improved training algorithm for second-order dy-namical recurrent networks applied to the problem of nite-state au-tomata (FSA) induction. Second-order networks allow for a natural encoding of nite-state automata in which each second-order connection weight corresponds to one transition in a nite-state automaton. In practice , however, when trained using gradient descent,...

A simple O(n log n) algorithm is presented for computing the maximum Euclidean distance between two nite planar sets of n points. When the n points form the vertices of simple polygons, then the complexity reduces to O(n).

We prove the following two variants of the defect theorem. Let X be a nite set of words over a nite alphabet. Then if a nonperiodic bi-in nite word w has two X-factorizations, then the combinatorial rank of X is at most card(X) 1, i.e. there exists a set F such that X F+ with card(F ) < card(X). Further, if card(X) = 2 and a bi-in nite word possesses two X-factorizations which are not shift-equ...

The hydrothermal technique was used to make nickel telluride nanorods (NiTe NRs) utilizing ascorbic acid and cetrimonium bromide (CTAB) as reducing agents. Temperature dependent magnetic study for NiTe NRs shows a ferromagnetism behavior. Under 532 nm laser excitation, the obtained materials had better optical limiting property, with two photon absorption coefficient of 6.6 × 10− 10 m/W an 2.44...

Abstract Nickel ditelluride (NiTe 2 ), a recently discovered Type-II Dirac semimetal with topological fermions near the Fermi energy, is expected to exhibit strong thickness-mediated electronic tunability and intrinsic two-gap superconductivity in single-layer limit. Realizing such intriguing phenomena requires fabrication of ultrathin NiTe films an understanding underlying physics that still u...