Polarisation diversity of conformal arrays based on geometric algebra via convex optimisation

A simple and general design procedure is presented for the polarisation diversity of arbitrary conformal arrays; this procedure is based on the mathematical framework of geometric algebra and can be solved optimally using convex optimisation. Aside from being simpler and more direct than other derivations in the literature, this derivation is also entirely general in that it expresses the transformations in terms of rotors in geometric algebra which can easily be formulated for any arbitrary conformal array geometry. Convex optimisation has a number of advantages; solvers are widespread and freely available, the process generally requires a small number of iterations and a wide variety of constraints can be readily incorporated. The study outlines a two-step approach for addressing polarisation diversity in arbitrary conformal arrays: first, the authors obtain the array polarisation patterns using geometric algebra and secondly use a convex optimisation approach to find the optimal weights for the polarisation diversity problem. The versatility of this approach is illustrated via simulations of a 7×10 cylindrical conformal array. © 2012 The Institution of Engineering and Technology.

stochastic process algebra based software process simulation modeling

Chinese Acad Sci, ISCAS Lab Internet Software Technologies

Extensions of a Theory of Networks for Approximation and Learning: Outliers and Negative Examples

Learning an input-output mapping from a set of examples can be regarded as synthesizing an approximation of a multi-dimensional function. From this point of view, this form of learning is closely related to regularization theory. In this note, we extend the theory by introducing ways of dealing with two aspects of learning: learning in the presence of unreliable examples and learning from positive and negative examples. The first extension corresponds to dealing with outliers among the sparse data. The second one corresponds to exploiting information about points or regions in the range of the function that are forbidden.

Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification

In this paper we present some extensions to the k-means algorithm for vector quantization that permit its efficient use in image segmentation and pattern classification tasks. It is shown that by introducing state variables that correspond to certain statistics of the dynamic behavior of the algorithm, it is possible to find the representative centers fo the lower dimensional maniforlds that define the boundaries between classes, for clouds of multi-dimensional, mult-class data; this permits one, for example, to find class boundaries directly from sparse data (e.g., in image segmentation tasks) or to efficiently place centers for pattern classification (e.g., with local Gaussian classifiers). The same state variables can be used to define algorithms for determining adaptively the optimal number of centers for clouds of data with space-varying density. Some examples of the applicatin of these extensions are also given.

Relation algebra operations on formal contexts.

This paper discusses the use of relation algebra operations on formal contexts. These operations are a generalisation of some of the context operations that are described in the standard FCA textbook (Ganter & Wille, 1999). This paper extends previous research in this area with respect to applications and implementations. It also describes a software tool (FcaFlint) which in combination with FcaStone facilitates the application of relation algebra operations to contexts stored in many formats.

Rough sets, their extensions and applications

Q. Shen and R. Jensen, 'Rough sets, their extensions and applications,' International Journal of Automation and Computing (IJAC), vol. 4, no. 3, pp. 217-218, 2007.

Algebra Llinol - Cyflwyniad

Cyfieithiad yw'r llyfr hwn o Linear Algebra - An Introduction a ymddangosodd gyntaf yn 1978 ac a gyhoeddwyd gan y cwmni Van Nostrand Reinhold. Cafwyd Ail Argraffiad yn 1982 a dros y blynyddoedd bu nifer o ail brintiadau. Yn y cyfamser cyfieithwyd y llyfr i'r Groeg a Thwrceg. Er i'r llyfr gael ei ddefnyddio dros y blynyddoedd gan nifer o fyfyrwyr yn Aberystwyth a oedd yn cyflwyno eu gwaith yn Gymraeg, nid oedd ar gael yn y Gymraeg. Dyma, o'r diwedd, ymgais i wneud rhyw fath o iawn am hynny. Er bod y llyfr wedi bod allan o brint yn y Saesneg ers rhai blynyddoedd yn awr, mae'n amlwg ei fod yn dal i gael ei gymeradwyo mewn nifer o brifysgolion. Felly, y gobaith yw y bydd o ddefnydd. Efallai mai'r peth nesaf bydd ei gyfiethu'n ?l i'r Saesneg! Mae nifer o newidiadau yn y fersiwn hwn. Mae'n siwr bod nifer o gamgymeriadau ac efallai gwelliannau posibl i'r cyfieithu - byddwn yn ddiolchgar dderbyn unrhyw awgrymiadau. Gellir eu cyflwyno hefyd drwy Dr Gwion Evans o'r Adran Fathemateg, Prifysgol Aberystwyth.

Customers' responses to retail brand extensions

Alexander, N.; and Colgate, N. (2005). Customers' responses to retail brand extensions. Journal of Marketing Management. 21(3-4), pp.393-419 RAE2008

Constructing extensions of CP-maps via tensor dilations with rhe help of von Neumann modules

Gohm, Rolf; Skeide, M., (2005) 'Constructing extensions of CP-maps via tensor dilations with rhe help of von Neumann modules', Infinite Dimensional Analysis, Quantum Probability and Related Topics 8(2) pp.291-305 RAE2008

An Efficient User-Level Shared Memory Mechanism for Application-Specific Extensions

This paper focuses on an efficient user-level method for the deployment of application-specific extensions, using commodity operating systems and hardware. A sandboxing technique is described that supports multiple extensions within a shared virtual address space. Applications can register sandboxed code with the system, so that it may be executed in the context of any process. Such code may be used to implement generic routines and handlers for a class of applications, or system service extensions that complement the functionality of the core kernel. Using our approach, application-specific extensions can be written like conventional user-level code, utilizing libraries and system calls, with the advantage that they may be executed without the traditional costs of scheduling and context-switching between process-level protection domains. No special hardware support such as segmentation or tagged translation look-aside buffers (TLBs) is required. Instead, our ``user-level sandboxing'' mechanism requires only paged-based virtual memory support, given that sandboxed extensions are either written by a trusted source or are guaranteed to be memory-safe (e.g., using type-safe languages). Using a fast method of upcalls, we show how our mechanism provides significant performance improvements over traditional methods of invoking user-level services. As an application of our approach, we have implemented a user-level network subsystem that avoids data copying via the kernel and, in many cases, yields far greater network throughput than kernel-level approaches.

A Biomechanical Model of Human Oculomotor Plant Kinematics Based Upon Geometric Algebra

A biomechanical model of the human oculomotor plant kinematics in 3-D as a function of muscle length changes is presented. It can represent a range of alternative interpretations of the data as a function of one parameter. The model is free from such deficits as singularities and the nesting of axes found in alternative formulations such as the spherical wrist (Paul, l98l). The equations of motion are defined on a quaternion based representation of eye rotations and are compact atnd computationally efficient.

Projective injections of geometries and their affine extensions

We present a general method allowing the construction geometries whose diagram is an extension of the diagram of a given geometry. Some applications of this construction process are described. © 1995 Birkhäuser Verlag.