An evaluation of the neocognitron

We describe a sequence of experiments investigating the strengths and limitations of Fukushima's neocognitron as a handwritten digit classifier. Using the results of these experiments as a foundation, we propose and evaluate improvements to Fukushima's original network in an effort to obtain higher recognition performance. The neocognitron's performance is shown to be strongly dependent on the choice of selectivity parameters and we present two methods to adjust these variables. Performance of the network under the more effective of the two new selectivity adjustment techniques suggests that the network fails to exploit the features that distinguish different classes of input data. To avoid this shortcoming, the network's final layer cells were replaced by a nonlinear classifier (a multilayer perceptron) to create a hybrid architecture. Tests of Fukushima's original system and the novel systems proposed in this paper suggest that it may be difficult for the neocognitron to achieve the performance of existing digit classifiers due to its reliance upon the supervisor's choice of selectivity parameters and training data. These findings pertain to Fukushima's implementation of the system and should not be seen as diminishing the practical significance of the concept of hierarchical feature extraction embodied in the neocognitron. © 1997 IEEE.

Dynamics of industry architecture and firm’s capability development : role of knowledge integration within product innovation

Aligned with the decline of Marshalian view of industry as constituting homogeneous set of firms, the new perspective is emerging by concentrating more on dynamics of sectors as the building block of industrial changes. Based on new assumptions, much of the action in terms of strategy, technology, and knowledge development does not happen either among firms within a stable industry, or through the growth or decline of certain sectors compared to others. Instead, the action happens in terms of the definition, redefinition, drawing, and redrawing of the very nature of these sectors. Technology does not progress and develop within a sector; rather it shapes (and is shaped by) the encompassing architecture of multiple sectors.

Automated fit quantification of tibial nail designs during the insertion using computer three-dimensional modelling

Intramedullary nailing is the standard fixation method for displaced diaphyseal fractures of the tibia. An optimal nail design should both facilitate insertion and anatomically fit the bone geometry at its final position in order to reduce the risk of stress fractures and malalignments. Due to the nonexistence of suitable commercial software, we developed a software tool for the automated fit assessment of nail designs. Furthermore, we demonstrated that an optimised nail, which fits better at the final position, is also easier to insert. Three-dimensional models of two nail designs and 20 tibiae were used. The fitting was quantified in terms of surface area, maximum distance, sum of surface areas and sum of maximum distances by which the nail was protruding into the cortex. The software was programmed to insert the nail into the bone model and to quantify the fit at defined increment levels. On average, the misfit during the insertion in terms of the four fitting parameters was smaller for the Expert Tibial Nail Proximal bend (476.3 mm2, 1.5 mm, 2029.8 mm2, 6.5 mm) than the Expert Tibial Nail (736.7 mm2, 2.2 mm, 2491.4 mm2, 8.0 mm). The differences were statistically significant (p ≤ 0.05). The software could be used by nail implant manufacturers for the purpose of implant design validation.

Practical path planning and obstacle avoidance for autonomous mowing

There is a need for systems which can autonomously perform coverage tasks on large outdoor areas. Unfortunately, the state-of-the-art is to use GPS based localization, which is not suitable for precise operations near trees and other obstructions. In this paper we present a robotic platform for autonomous coverage tasks. The system architecture integrates laser based localization and mapping using the Atlas Framework with Rapidly-Exploring Random Trees path planning and Virtual Force Field obstacle avoidance. We demonstrate the performance of the system in simulation as well as with real world experiments.

Towards coordinated vision-based docking using an Autonomous Surface Vehicle

This paper describes the development and experimental evaluation of a novel vision-based Autonomous Surface Vehicle with the purpose of performing coordinated docking manoeuvres with a target, such as an Autonomous Underwater Vehicle, on the water’s surface. The system architecture integrates two small processor units; the first performs vehicle control and implements a virtual force obstacle avoidance and docking strategy, with the second performing vision-based target segmentation and tracking. Furthermore, the architecture utilises wireless sensor network technology allowing the vehicle to be observed by, and even integrated within an ad-hoc sensor network. The system performance is demonstrated through real-world experiments.

Collaboration in Web N.0: Stigmergy and virtual pheromones

The aim of this project was to develop a general theory of stigmergy and a software design pattern to build collaborative websites. Stigmergy is a biological term used when describing some insect swarm-behaviour where 'food gathering' and 'nest building' activities demonstrate the emergence of self-organised societies achieved without an apparent management structure. The results of the project are an abstract model of stigmergy and a software design pattern for building Web 2.0 components exploiting this self-organizing phenomenon. A proof-of-concept implementation was also created demonstrating potential commercial viability for future website projects.

A computer generated model of adenosine receptors rationalising binding and selectivity of receptor ligands

Computer graphic analyses on a broad spectrum of adenosine receptor ligands has shown that both the A1 and A2 adenosine receptors have three binding sites. The spatial relationship of these three binding sites has been defined. Adenosine orientation at A1 and A2 is different.

Creating good lives through computer games

In this chapter we aim to explore how videogames can lead to improvements in wellbeing. Following Keyes (2007) and Huppert and So (2012) we view wellbeing as a multidimensional concept with both hedonic and eudaimonic aspects. In this chapter we take a broad approach in terms of exploring the impact of videogames on the psychological, social, and physical components of wellbeing. We explore how videogames have been shown to have an impact in each of these domains. Although there is a great deal of evidence for the actual and potential positive impacts of videogames, there are many unanswered questions regarding the situations in which there is likely to be an impact of videogame play on wellbeing, as well as the aspects of wellbeing that are likely to be impacted by videogame play. We conclude the chapter by outlining the key questions for future research. Our focus in this chapter is on the positive influences of videogames. We do not explore research on contexts in which negative impacts are possible or subgroups for which videogames could cause harm. However, these questions are obviously important and we see balanced engagement with age-appropriate videogames as a key prerequisite for any of the wellbeing benefits discussed below.

ICEPOLE: High-speed, hardware-oriented authenticated encryption

This paper introduces our dedicated authenticated encryption scheme ICEPOLE. ICEPOLE is a high-speed hardware-oriented scheme, suitable for high-throughput network nodes or generally any environment where specialized hardware (such as FPGAs or ASICs) can be used to provide high data processing rates. ICEPOLE-128 (the primary ICEPOLE variant) is very fast. On the modern FPGA device Virtex 6, a basic iterative architecture of ICEPOLE reaches 41 Gbits/s, which is over 10 times faster than the equivalent implementation of AES-128-GCM. The throughput-to-area ratio is also substantially better when compared to AES-128-GCM. We have carefully examined the security of the algorithm through a range of cryptanalytic techniques and our findings indicate that ICEPOLE offers high security level.

John Andrews : Architecture a Performing Art

The distinguished Australian architect surveys his career and examines how his architectural theories are expressed in his designs.

World architecture 1900-2000 : A critical mosaic : Southeast Asia and Oceania [Volume 10]

"World Architecture records the major architectural contributions made in all regions of the world to the development of human culture. Grouped into 10 geographical regions and representing five twenty-year-periods, the buildings have been selected by approximately 80 eminent international architectural critics. Each volume contains 100 buildings from one particular region, each object accompanied by an analytical text as well as by drawings and photographs. Introduction essays by the general editor, Kenneth Frampton, and the editor(s) of each volume complete the survey. The series comprises 10 volumes. The books are handsome, linen-bound and stitched, generously formatted (21,5 x 28,5 cm/8,4 x 11 inches) and contain approx. 300 pages and 400 colour prints each. This unique project gives the most precise and authoritative description of 1000 of the century's most notable buildings. Countries: Brunei, Burma, Cambodia, Indonesia, Laos, Malaysia, The Philippines, Singapore, Thailand, Vietnam and Australia, New Zealand, Papua New Guinea, and Oceania."

The Venice Architecture Biennale avoids lessons from the past

This article reviews the 14th Architectural Biennale in Venice.

A tale of two solvers: Eager and lazy approaches to bit-vectors

The standard method for deciding bit-vector constraints is via eager reduction to propositional logic. This is usually done after first applying powerful rewrite techniques. While often efficient in practice, this method does not scale on problems for which top-level rewrites cannot reduce the problem size sufficiently. A lazy solver can target such problems by doing many satisfiability checks, each of which only reasons about a small subset of the problem. In addition, the lazy approach enables a wide range of optimization techniques that are not available to the eager approach. In this paper we describe the architecture and features of our lazy solver (LBV). We provide a comparative analysis of the eager and lazy approaches, and show how they are complementary in terms of the types of problems they can efficiently solve. For this reason, we propose a portfolio approach that runs a lazy and eager solver in parallel. Our empirical evaluation shows that the lazy solver can solve problems none of the eager solvers can and that the portfolio solver outperforms other solvers both in terms of total number of problems solved and the time taken to solve them.