Electroacoustic music is relatively new and something of an experiment in Malaysia. Involvement in various technology- and art-related performing and composing activities has nurtured my interest, particularly with reference to electroacoustic music.

Unlike visual art, it is not known exactly where and when our historical perspectives in sound art originate, and I would suggest that no electroacoustic music or pieces are known to have been performed or presented in Malaysia since the art form was first pioneered in the West more than fifty years ago.

This paper introduces some thoughts and possibilities relating to electroacoustic music from the Malaysian perspective.

In this article the authors present an overview of the current situation in Ukraine, with regards to the question of analytical terminology applied to new methods of creation in electronic music composition. The article establishes the differences and the similarities between the analyses of instrumental and electronic music structures, while considering the role of technology in the creation of new electronic music works. This paper also establishes a link between the origin of current analytical processes and electronic music practice in Ukraine, taking into account the function of a given terminology and its characteristic elements relating to a local geographical and cultural context. The authors underline the importance of integrating new music forms in academic circles and discuss external influences in the development of new musical systems. This is demonstrated by exposing selected musical materials, which can be considered representative of the creative and theoretical processes found in the field of electronic music in Ukraine.

Wireless Fantasy, Vladimir Ussachevsky's 4½-minute tribute to the birth of wireless radio, utilises a rich collection of sound materials, from antique spark generators and shortwave radio sounds to a recorded segment of Wagner's Parsifal. Wireless Fantasy is here examined not as much for the cultural meaning of its sources but for insight into Ussachevsky's dramatic counterpointing of those sources in real time. The analytical methodology focuses on pitch, rhythm, and timbre equally, using both standard music notation and spectral analysis to examine the contrapuntal elements in this classic electroacoustic composition. Special attention is paid to the coincidence of accent between the source materials that generates the work's climax and to the involvement of all the sources in articulating its final cadence. The larger issue of quotation within electroacoustic composition is discussed with regard to an abstract reference in the work's coda.

We study semirandom k-colourable graphs made up as follows. Partition the vertex set V = {1, . . ., n} randomly into k classes V1, . . ., Vk of equal size and include each Vi–Vj-edge with probability p independently (1 ≤ i < j ≤ k) to obtain a graph G0. Then, an adversary may add further Vi–Vj-edges (i≠j) to G0, thereby completing the semirandom graph G = G*n,p,k. We show that if np ≥ max{(1 + ϵ)klnn, C0k2} for a certain constant C0>0 and an arbitrarily small but constant ϵ>0, an optimal colouring of G*n,p,k can be found in polynomial time with high probability. Furthermore, if np ≥ C0max{klnn, k2}, a k-colouring of G*n,p,k can be computed in polynomial expected time. Moreover, an optimal colouring of G*n,p,k can be computed in expected polynomial time if k ≤ ln1/3n and np ≥ C0klnn. By contrast, it is NP-hard to k-colour G*n,p,k With high probability if .

The Tenth ACM SIGPLAN International Conference on Functional Programming (ICFP) was held in September, 2005, in Tallinn, Estonia; Benjamin Pierce chaired the program committee. After the conference, extended versions of some of the presented papers were solicited for this special issue of JFP. All submitted papers were reviewed following standard JFP procedures and four were ultimately accepted; they form the body of this special issue.

The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this methodology, the syntactic and deductive apparatus of a system is encoded as the canonical forms of associated LF types; an encoding is correct (adequate) if and only if it defines a compositional bijection between the apparatus of the deductive system and the associated canonical forms. Given an adequate encoding, one may establish metatheoretic properties of a deductive system by reasoning about the associated LF representation. The Twelf implementation of the LF logical framework is a convenient and powerful tool for putting this methodology into practice. Twelf supports both the representation of a deductive system and the mechanical verification of proofs of metatheorems about it. The purpose of this article is to provide an up-to-date overview of the LF λ-calculus, the LF methodology for adequate representation, and the Twelf methodology for mechanizing metatheory. We begin by defining a variant of the original LF language, called Canonical LF, in which only canonical forms (long βη-normal forms) are permitted. This variant is parameterized by a subordination relation, which enables modular reasoning about LF representations. We then give an adequate representation of a simply typed λ-calculus in Canonical LF, both to illustrate adequacy and to serve as an object of analysis. Using this representation, we formalize and verify the proofs of some metatheoretic results, including preservation, determinacy, and strengthening. Each example illustrates a significant aspect of using LF and Twelf for formalized metatheory.

We study a point process describing the asymptotic behaviour of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/3, where λ is a fixed real number. In particular, we show that this point process has a surprising rigidity. Fluctuations in the large values will be balanced by opposite fluctuations in the small values such that the sum of the values larger than a small ϵ (a scaled version of the number of vertices in components of size greater than εn2/3) is almost constant.

In this note we give a very short proof for the description of all maximum size two-part Sperner systems.

Control flow compilation is a hybrid between classical WAM compilation and meta-call, limited to the compilation of non-recursive clause bodies. This approach is used successfully for the execution of dynamically generated queries in an inductive logic programming setting (ILP). Control flow compilation reduces compilation times up to an order of magnitude, without slowing down execution. A lazy variant of control flow compilation is also presented. By compiling code by need, it removes the overhead of compiling unreached code (a frequent phenomenon in practical ILP settings), and thus reduces the size of the compiled code. Both dynamic compilation approaches have been implemented and were combined with query packs, an efficient ILP execution mechanism. It turns out that locality of data and code is important for performance. The experiments reported in the paper show that lazy control flow compilation is superior in both artificial and real life settings.

Existential types provide a simple and elegant foundation for understanding generative abstract data types of the kind supported by the Standard ML module system. However, in attempting to extend ML with support for recursive modules, we have found that the traditional existential account of type generativity does not work well in the presence of mutually recursive module definitions. The key problem is that, in recursive modules, one may wish to define an abstract type in a context where a name for the type already exists, but the existential type mechanism does not allow one to do so. We propose a novel account of recursive type generativity that resolves this problem. The basic idea is to separate the act of generating a name for an abstract type from the act of defining its underlying representation. To define several abstract types recursively, one may first ‘forward-declare’ them by generating their names, and then supply each one's identity secretly within its own defining expression. Intuitively, this can be viewed as a kind of backpatching semantics for recursion at the level of types. Care must be taken to ensure that a type name is not defined more than once, and that cycles do not arise among ‘transparent’ type definitions. In contrast to the usual continuation-passing interpretation of existential types in terms of universal types, our account of type generativity suggests a destination-passing interpretation. Briefly, instead of viewing a value of existential type as something that creates a new abstract type every time it is unpacked, we view it as a function that takes as input a pre-existing undefined abstract type and defines it. By leaving the creation of the abstract type name up to the client of the existential, our approach makes it significantly easier to link abstract data types together recursively.

We have studied the update operator ⊕1 defined for update sequences by Eiter et al. without tautologies and we have observed that it satisfies an interesting property. This property, which we call Weak Independence of Syntax (WIS), is similar to one of the postulates proposed by Alchourrón, Gärdenfors, and Makinson (AGM); only that in this case it applies to nonmonotonic logic. In addition, we consider other five additional basic properties about update programs and we show that ⊕1 satisfies them. This work continues the analysis of the AGM postulates with respect to the ⊕1 operator under a refined view that considers N2 as a monotonic logic which allows us to expand our understanding of answer sets. Moreover, N2 helped us to derive an alternative definition of ⊕1 avoiding the use of unnecessary extra atoms.

We present an algorithm which for any aperiodic and primitivesubstitution outputs a finite representation ofeach special word in the shift space associated to that substitution, and determines when suchrepresentations are equivalent under orbit and shift tail equivalence. Thealgorithm has been implemented and applied in the study of certainnew invariants for flow equivalence of substitutional dynamical systems.

Sturmian words are infinite words that have exactlyn+1 factors of length n for every positive integer n. A Sturmian word sα,p is also definedas a coding over a two-letter alphabet of the orbit of point ρ under the action of the irrational rotation Rα : x → x + α (mod 1).A substitution fixes a Sturmian word if and only if it is invertible.The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give an alternative geometric proof of Yasutomi's characterizationof all pairs (α,p) such that sα,p is a fixedpoint of some non-trivial substitution.

This paper describes a modification of the power set construction for the transformation of self-verifying nondeterministic finite automata to deterministic ones. Using a set counting argument, the upper bound for this transformation can be lowered from $2^n$ to $O(\frac{2^n}{\sqrt{n}}).$

We present a compositional programme logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as function parameters, return values, content of references and parts of data structures. The programme logic extends our earlier logic for alias-free imperative higher-order functions with new operators which serve as building blocks for clean structural reasoning about programms and data structures in the presence of aliasing. This has been an open issue since the pioneering work by Cartwright–Oppen and Morris twenty-five years ago. We illustrate usage of the logic for description and reasoning through concrete examples including a higher-order polymorphic Quicksort. The logical status of the new operators is clarified by translating them into (in)equalities of reference names.

We consider the distribution of the value of the optimal k-assignment in an m × n matrix, where the entries are independent exponential random variables with arbitrary rates. We give closed formulas for both the Laplace transform of this random variable and for its expected value under the condition that there is a zero-cost (k − 1)-assignment.

Improving upon work in [2], the precise value of the set reconstruction number is given for all cyclic groups of odd order.