Transformations for nonideal uniform circular arrays operating in correlated signal environments

The Davies transformation is a method to transform the steering vector of a uniform circular array (UCA) to one with Vandermonde form. As such, it allows techniques such as spatial smoothing for direction-of-arrival (DOA) estimation in a correlated signal environment, developed originally for uniform linear arrays, to be applied to UCAs. However, the Davies transformation can be highly sensitive to perturbations of the underlying array model. This paper presents a method for deriving a more robust transformation using optimization techniques. The effectiveness of the method is illustrated through a number of DOA estimation examples.     

QoS provisioning in cellular networks based on mobility prediction techniques

In cellular networks, QoS degradation or forced termination may occur when there are insufficient resources to accommodate handoff requests. One solution is to predict the trajectory of mobile terminals so as to perform resource reservations in advance. With the vision that future mobile devices are likely to be equipped with reasonably accurate positioning capability, we investigate how this new feature may be used for mobility predictions. We propose a mobility prediction technique that incorporates road topology information, and describe its use for dynamic resource reservation. Simulation results are presented to demonstrate the improvement in reservation efficiency compared with several other schemes.     

Characterization of zero locations of polytopes of real polynomials

Given a stability region of a polytope of polynomials, the edge theorem can be used to verify certain root-clustering properties of the polytope. The authors consider the inverse problem; starting with a polytope of real polynomials, they present a result that allows the construction of the smallest set of regions in the complex plane which characterizes its zero location     

Implementing CS1 with embedded instructional research design in laboratories

Closed laboratories are becoming an increasingly popular approach to teaching introductory computer science courses. Unlike open laboratories that tend to be an informal environment provided for students to practice their skills with attendance optional, closed laboratories are structured meeting times that support the lecture component of the course, and attendance is required. This paper reports on an integrated approach to designing, implementing, and assessing laboratories with an embedded instructional research design. The activities reported here are parts of a departmentwide effort not only to improve student learning in computer science and computer engineering (CE) but also to improve the agility of the Computer Science and Engineering Department in adapting the curriculum to changing technologies, incorporate research, and validate the instructional strategies used. This paper presents the design and implementation of the laboratories and the results and analysis of student performance. Also described in this paper is cooperative learning in the laboratories and its impact on student learning.     

Pseudorandomness of Basic Structures in the Block Cipher KASUMI

The notion of pseudorandomness is the theoretical foundation on which to consider the soundness of a basic structure used in some block ciphers. We examine the pseudorandomness of the block cipher KASUMI, which will be used in the next‐generation cellular phones. First, we prove that the four‐round unbalanced MISTY‐type transformation is pseudorandom in order to illustrate the pseudorandomness of the inside round function FI of KASUMI under an adaptive distinguisher model. Second, we show that the three‐round KASUMI‐like structure is not pseudorandom but the four‐round KASUMI‐like structure is pseudorandom under a non‐adaptive distinguisher model.     

Groups of algebraic integers used for coding QAM signals

Linear block codes over Gaussian integers and Eisenstein integers were used for coding over two-dimensional signal space. A group of Gaussian integers with 2²ⁿ elements was constructed to code quadrature amplitude modulation (QAM) signals such that a differentially coherent method can be applied to demodulate the QAM signals. This paper shows that one subgroup of the multiplicative group of units in the algebraic integer ring of any quadratic number field with unique factorization, modulo the ideal (Pⁿ), can be used to obtain a QAM signal space of 2p^2n-2 points, where p is any given odd prime number. Furthermore, one subgroup of the multiplicative group of units in the quotient ring Z[ω]/(pⁿ) can be used to obtain a QAM signal space of 6p^2n-2 points; one subgroup of the multiplicative group of units in the quotient ring Z[i](pⁿ) can be used to obtain a QAM signal space of 4p^2n-2 points which is symmetrical over the quadrants of the complex plane and useful for differentially coherent detection of QAM signals; the multiplicative group of units in the quotient ring Z[ω]/(2ⁿ) can be used to obtain a QAM signal space of 3·2^2n-2 points, where i=√-1, ω=(-1+√-3)/2=(-1+i√3)/2, p is any given odd prime number, Z[i] and Z[ω] are, respectively, the Gaussian integer ring and the Eisenstein integer ring. These multiplicative groups can also be used to construct block codes over Gaussian integers or Eisenstein integers which are able to correct some error patterns     

The PBD-Closure of Constant-Composition Codes

We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the sizes of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.     

ANDES: efficient evaluation of NOT-twig queries in relational databases

Despite a large body of work on XPath query processing in relational environment, systematic study of queries containing not-predicates have received little attention in the literature. Particularly, several xml supports of industrial-strength commercial rdbms fail to efficiently evaluate such queries. In this paper, we present an efficient and novel strategy to evaluate not -twig queries in a tree-unaware relational environment. not -twig queries are XPath queries with ancestor–descendant and parent–child axis and contain one or more not-predicates. We propose a novel Dewey-based encoding scheme called Andes (ANcestor Dewey-based Encoding Scheme), which enables us to efficiently filter out elements satisfying a not-predicate by comparing their ancestor group identifiers. In this approach, a set of elements under the same common ancestor at a specific level in the xml tree is assigned same ancestor group identifier. Based on this scheme, we propose a novel sql translation algorithm for not-twig query evaluation. Experiments carried out confirm that our proposed approach built on top of an off-the-shelf commercial rdbms significantly outperforms state-of-the-art relational and native approaches. We also explore the query plans selected by a commercial relational optimizer to evaluate our translated queries in different input cardinality. Such exploration further validates the performance benefits of Andes.     

Feedback predictive control for constrained fuzzy systems with Markovian jumps

In this paper, a feedback model predictive control method is presented to tackle control problems with constrained multivariables for uncertain discrete‐time nonlinear Markovian jump systems. An uncertain Markovian jump fuzzy system (MJFS) is obtained by employing the Takagi‐Sugeno (T‐S) fuzzy model to represent a discrete‐time nonlinear system with norm bounded uncertainties and Markovain jump parameters. To achieve more generality, the transition probabilities of the Markov chain are assumed to be partly unknown and partly accessible. The predictive formulation adopts an on‐line optimization paradigm that utilizes the closed‐loop state feedback controller and is solved using the standard semi‐definite programming (SDP). To reduce the on‐line computational burden, a mode independent control move is calculated at every sampling time based on a stochastic fuzzy Lyapunov function (FLF) and a parallel distributed compensation (PDC) scheme. The robust mean square stability, performance minimization and constraint satisfaction properties are guaranteed under the control move for all admissible uncertainties. A numerical example is given to show the efficiency of the developed approach. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Parallel triangulation of a polygon in two calls to the trapezoidal map

We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors.