Other UNSW
Other UNSW
11 results
Filters
Availability

Publication Year

Resource Type

Publication Search Results
Sort
Results per page
Now showing
1 - 10 of 11
-
(1995) Heiser, Gernot; Altermatt, Peter; Williams, Angela-Margaret; Sproul, Alistair; Green, MartinConference PaperThis paper describes the use of three-dimensional (3D) device modelling for the optimisation of the rear contact geometry of high-efficiency silicon solar cells. We describe the techniques and models used as well as their limitations. Our approach is contrasted with previously published 3D studies of high-efficiency silicon solar cells. Results show that the optimum spacing is about 2/3 of that predicted by 2D simulations, and exhibits a much stronger dependence on contact spacing. The optimal value found is about 60% of that of the present UNSW PERL cells, however, the possible efficiency gain is only about 0.1% absolute.
-
(1998) Wilson, William Hulme; Halford, Graeme SConference PaperThis paper describes experiments on on the robustness of tensor product networks using distributed representations, for recall tasks. The results of the experiments indicate, among other things, that the degree of robustness increases with the number of binding units and decreases with the fraction of the space of possible facts that have been taught to the network. Mean recall scores decrease linearly with the proportion of binding units inactivated, and recall score variance depends linearly on number of binding units and on number of facts taught to the network.
-
(1995) Wilson, William HulmeConference PaperThis paper concerns a class of recurrent neural networks related to Elman networks (simple recurrent networks) and Jordan networks and a class of feedforward networks architecturally similar to Waibel’s TDNNs. The recurrent nets used herein, unlike standard Elman/Jordan networks, may have more than one state vector. It is known that such multi-state Elman networks have better learning performance on certain tasks than standard Elman networks of similar weight complexity. The task used involves learning the graphotactic structure of a sample of about 400 English words. Learning performance was tested using regimes in which the state vectors are, or are not, zeroed between words: the former results in larger minimum total error, but without the large oscillations in total error observed when the state vectors are not periodically zeroed. Learning performance comparisons of the three classes of network favour the feedforward nets.
-
(1997) Zhao, Yong; Zhang, Guangqing; Fun, D; Yu, DavidConference Paper
-
(1999) Frith, Anthony; Wolfe, Joseph; Ball, Marilyn; Hughes, MargaretConference Paper
-
(1999) Frith, Anthony; Wolfe, Joseph; Ball, Marilyn; Hughes, MargaretConference Paper
-
(1994) Dunlop, Peter; Bignell, Catherine; Jackson, John; Hibbert, D. BrynnConference Paper
-
(1995) Ye, A; Peng, Gang-Ding; Chu, PakConference Paper
-
(1996) Peng, Gang-Ding; Chu, Pak; Ziong, Z; Whitbread, Trevor; Chaplin, RodneyConference Paper
-
(1997) Waite, David; Tolmier, Davis; Yeomans, W; Buckley, C; Barclay, ShaunConference Paper