Dual-orthogonal radial basis function networks for nonlinear time series prediction

A new structure of Radial Basis Function (RBF) neural network called the Dual-orthogonal RBF Network (DRBF) is introduced for nonlinear time series prediction. The hidden nodes of a conventional RBF network compare the Euclidean distance between the network input vector and the centres, and the node responses are radially symmetrical. But in time series prediction where the system input vectors are lagged system outputs, which are usually highly correlated, the Euclidean distance measure may not be appropriate. The DRBF network modifies the distance metric by introducing a classification function which is based on the estimation data set. Training the DRBF networks consists of two stages. Learning the classification related basis functions and the important input nodes, followed by selecting the regressors and learning the weights of the hidden nodes. In both cases, a forward Orthogonal Least Squares (OLS) selection procedure is applied, initially to select the important input nodes and then to select the important centres. Simulation results of single-step and multi-step ahead predictions over a test data set are included to demonstrate the effectiveness of the new approach.

Interference cancellation in two-path successive relay system with network coding

This paper proposes a novel interference cancellation algorithm for the two-path successive relay system using network coding. The two-path successive relay scheme was proposed recently to achieve full date rate transmission with half-duplex relays. Due to the simultaneous data transmission at the relay and source nodes, the two-path relay suffers from the so-called inter-relay interference (IRI) which may significantly degrade the system performance. In this paper, we propose to use the network coding to remove the IRI such that the interference is first encoded with the network coding at the relay nodes and later removed at the destination. The network coding has low complexity and can well suppress the IRI. Numerical simulations show that the proposed algorithm has better performance than existing approaches.

Robots can't really be intelligent can they?

The whole concept of just what is and what is not, intelligence is a vitally important one. As humans interact more with machines, so the similarities and differences between human and machine intelligence need to be looked at in a sensible, scientific way. This paper considers human and machine intelligence and links them closely to physical characteristics, as exhibited by robots. Potential interfaces between humans and machines are also considered, as is the state of the art in direct physical links between humans and machines.

Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

Fractional order modeling of large three-dimensional RC networks

An incidence matrix analysis is used to model a three-dimensional network consisting of resistive and capacitive elements distributed across several interconnected layers. A systematic methodology for deriving a descriptor representation of the network with random allocation of the resistors and capacitors is proposed. Using a transformation of the descriptor representation into standard state-space form, amplitude and phase admittance responses of three-dimensional random RC networks are obtained. Such networks display an emergent behavior with a characteristic Jonscher-like response over a wide range of frequencies. A model approximation study of these networks is performed to infer the admittance response using integral and fractional order models. It was found that a fractional order model with only seven parameters can accurately describe the responses of networks composed of more than 70 nodes and 200 branches with 100 resistors and 100 capacitors. The proposed analysis can be used to model charge migration in amorphous materials, which may be associated to specific macroscopic or microscopic scale fractal geometrical structures in composites displaying a viscoelastic electromechanical response, as well as to model the collective responses of processes governed by random events described using statistical mechanics.

Counting in Egyptian children with Down Syndrome

This exploratory study is concerned with the performance of Egyptian children with Down syndrome on counting and error detection tasks and investigates how these children acquire counting. Observations and interviews were carried out to collect further information about their performance in a class context. Qualitative and quantitative analysis suggested a notable deficit in counting in Egyptian children with Down syndrome with none of the children able to recite the number string up to ten or count a set of five objects correctly. They performed less well on tasks which added more load on memory. The tentative finding of this exploratory study supported previous research findings that children with Down syndrome acquire counting by rote and links this with their learning experiences.

Understanding digital literacies: a practical introduction

Understanding Digital Literacies provides an accessible and timely introduction to new media literacies. It supplies readers with the theoretical and analytical tools with which to explore the linguistic and social impact of a host of new digital literacy practices. Each chapter in the volume covers a different topic, presenting an overview of the major concepts, issues, problems and debates surrounding the topic, while also encouraging students to reflect on and critically evaluate their own language and communication practices. Features include: coverage of a diverse range of digital media texts, tools and practices including blogging, hypertextual organisation, Facebook, Twitter, YouTube, Wikipedia, websites and games an extensive range of examples and case studies to illustrate each topic, such as how blogs have affected our thinking about communication, how the creation and sharing of digital images and video can bring about shifts in social roles, and how the design of multiplayer online games for children can promote different ideologies a variety of discussion questions and mini-ethnographic research projects involving exploration of various patterns of media production and communication between peers, for example in the context of Wikinomics and peer production, social networking and civic participation, and digital literacies at work end of chapter suggestions for further reading and links to key web and video resources a companion website providing supplementary material for each chapter, including summaries of key issues, additional web-based exercises, and links to further resources such as useful websites, articles, videos and blogs.

A fast adaptive tunable RBF network for nonstationary systems

This paper describes a novel on-line learning approach for radial basis function (RBF) neural network. Based on an RBF network with individually tunable nodes and a fixed small model size, the weight vector is adjusted using the multi-innovation recursive least square algorithm on-line. When the residual error of the RBF network becomes large despite of the weight adaptation, an insignificant node with little contribution to the overall system is replaced by a new node. Structural parameters of the new node are optimized by proposed fast algorithms in order to significantly improve the modeling performance. The proposed scheme describes a novel, flexible, and fast way for on-line system identification problems. Simulation results show that the proposed approach can significantly outperform existing ones for nonstationary systems in particular.