Investigations into the effect of LOS signal blocking on capacity of an indoor MIMO system

In indoor environments the properties of communication channel are affected by the presence of various objects which block the Line Of Sight signal propagation. For example, this occurs because of presence of movement of humans and furniture. In this paper, the effect of reflection and scattering due to the presence of such objects is studied with respect to the capacity of a multiple input multiple output (MIMO) wireless system. The carried out investigations are performed by applying a simple electromagnetic model, in which transmitting and receiving antennas of MIMO system, as well as signal blocking objects, are represented by wire dipoles. In order to provide a fair assessment, calculations of MIMO capacity are performed under both fixed transmitted power and fixed received power conditions.

Formalising progress properties of non-blocking programs

A non-blocking program is one that uses non-blocking primitives, such as load-linked/store-conditional and compare-and-swap, for synchronisation instead of locks so that no process is ever blocked. According to their progress properties, non-blocking programs may be classified as wait-free, lock-free or obstruction-free. However, a precise description of these properties does not exist and it is not unusual to find a definition that is ambiguous or even incorrect. We present a formal definition of the progress properties so that any confusion is removed. The formalisation also allows one to prove the widely believed presumption that wait-freedom is a special case of lock-freedom, which in turn is a special case of obstruction-freedom.

A design pattern for efficient retrieval of large data sets from remote data sources

Retrieving large amounts of information over wide area networks, including the Internet, is problematic due to issues arising from latency of response, lack of direct memory access to data serving resources, and fault tolerance. This paper describes a design pattern for solving the issues of handling results from queries that return large amounts of data. Typically these queries would be made by a client process across a wide area network (or Internet), with one or more middle-tiers, to a relational database residing on a remote server. The solution involves implementing a combination of data retrieval strategies, including the use of iterators for traversing data sets and providing an appropriate level of abstraction to the client, double-buffering of data subsets, multi-threaded data retrieval, and query slicing. This design has recently been implemented and incorporated into the framework of a commercial software product developed at Oracle Corporation.

Searching oligo sets of human chromosome 12 using evolutionary strategies

DNA microarray is a powerful tool to measure the level of a mixed population of nucleic acids at one time, which has great impact in many aspects of life sciences research. In order to distinguish nucleic acids with very similar composition by hybridization, it is necessary to design probes with high specificities, i.e. uniqueness, and also sensitivities, i.e., suitable melting temperature and no secondary structure. We make use of available biology tools to gain necessary sequence information of human chromosome 12, and combined with evolutionary strategy (ES) to find unique subsequences representing all predicted exons. The results are presented and discussed.

Implicit learning is not subject to blocking

Explicit (aware) learning has been shown to evidence certain characteristics, such as extinction, blocking, occasion setting, and reliance on context. These characteristics have not been assessed in implicit (unaware) learning. The current study investigated whether implicit learning is subject to blocking. Participants completed a cued reaction time task, where they watched rapid presentations of a random sequence of 8 pairs of shapes, and responded to two target shapes. One target was always preceded by a cue. The experimental group completed a pretraining phase where half the cue, one shape, was followed by the target. Both experimental and control groups completed a training phase where both elements of the cue, two shapes, were followed by the target. Both aware and unaware participants evidenced learning, whereby responding was faster for cued than uncued targets. Aware participants in the experimental group responded faster to targets preceded by the pretrained element than by the other element of the cue. Control and unaware experimental participants were faster to respond to targets preceded by either element of the cue. As blocking was only evident in aware participants, but implicit learning was observed in all participants, it is concluded that implicit learning is not subject to blocking.

Dynamics of learning with restricted training sets

The dynamics of supervised learning in layered neural networks were studied in the regime where the size of the training set is proportional to the number of inputs. The evolution of macroscopic observables, including the two relevant performance measures can be predicted by using the dynamical replica theory. Three approximation schemes aimed at eliminating the need to solve a functional saddle-point equation at each time step have been derived.

Noise, regularizers, and unrealizable scenarios in online learning from restricted training sets

We study the dynamics of on-line learning in multilayer neural networks where training examples are sampled with repetition and where the number of examples scales with the number of network weights. The analysis is carried out using the dynamical replica method aimed at obtaining a closed set of coupled equations for a set of macroscopic variables from which both training and generalization errors can be calculated. We focus on scenarios whereby training examples are corrupted by additive Gaussian output noise and regularizers are introduced to improve the network performance. The dependence of the dynamics on the noise level, with and without regularizers, is examined, as well as that of the asymptotic values obtained for both training and generalization errors. We also demonstrate the ability of the method to approximate the learning dynamics in structurally unrealizable scenarios. The theoretical results show good agreement with those obtained by computer simulations.