Sketches from the subject and neighbour lands of Venice.

"Sequel to ... 'Architectural and historical sketches, chiefly Italian'."--Pref.

Ars pictoria, or, An academy treating of drawing, painting, limning, etching : to which are added XXXI copper plates, expressing the choicest, nearest, and most exact grounds and rules of symmetry /

Errata for Ars pictoria, p. [8] of preliminaries. Errata for Appendix, p. 39.

A vade mecum for malt-worms: or, A guide to good fellows. Being a description of the manners and customs of the most eminent publick houses, in and about the cities of London and Westminster. With a hint on the props (or principal customers) of each house. In a method so plain that any thirsty person (of the meanest capacity) may easily find the nearest way from one house to another.

Mode of access: Internet.

Horæ momenta cravenæ, or, The Craven dialect, exemplified in two dialogues, between farmer Giles and his neighbour Bridget. To which is annexed a copious glossary.

Subsequently issued under title: The Craven dialect.

Quantum-error correction on linear-nearest-neighbor qubit arrays

A quantum circuit implementing 5-qubit quantum-error correction on a linear-nearest-neighbor architecture is described. The canonical decomposition is used to construct fast and simple gates that incorporate the necessary swap operations allowing the circuit to achieve the same depth as the current least depth circuit. Simulations of the circuit's performance when subjected to discrete and continuous errors are presented. The relationship between the error rate of a physical qubit and that of a logical qubit is investigated with emphasis on determining the concatenated error correction threshold.

An empirical study of Hoelfding Racing for model selction in K-nearest neighbor classification

Racing algorithms have recently been proposed as a general-purpose method for performing model selection in machine teaming algorithms. In this paper, we present an empirical study of the Hoeffding racing algorithm for selecting the k parameter in a simple k-nearest neighbor classifier. Fifteen widely-used classification datasets from UCI are used and experiments conducted across different confidence levels for racing. The results reveal a significant amount of sensitivity of the k-nn classifier to its model parameter value. The Hoeffding racing algorithm also varies widely in its performance, in terms of the computational savings gained over an exhaustive evaluation. While in some cases the savings gained are quite small, the racing algorithm proved to be highly robust to the possibility of erroneously eliminating the optimal models. All results were strongly dependent on the datasets used.

Within-site variation in lichen growth rates and its implications for direct lichenometry

Variation in lichen growth rates poses a significant challenge for the application of direct lichenometry, i.e. the construction of lichen dating curves from direct measurement of growth rates. To examine the magnitude and possible causes of within-site growth variation, radial growth rates (RaGRs) of thalli of the fast-growing foliose lichen Melanelia fuliginosa ssp. fuliginosa (Fr. ex Duby) Essl. and the slow-growing crustose lichen Rhizocarpon geographicum (L.) DC. were studied on two S-facing slate rock surfaces in north Wales, UK using digital photography and an image analysis system (Image-J). RaGRs of M. fuliginosa ssp. fuliginosa varied from 0.44 to 2.63 mmyr-1 and R. geographicum from 0.10 to 1.50 mmyr-1.5. Analysis of variance suggested no significant variation in RaGRs with vertical or horizontal location on the rock, thallus diameter, aspect, slope, light intensity, rock porosity, rock surface texture, distance to nearest lichen neighbour or distance to vegetation on the rock surface. The frequency distribution of RaGR did not deviate from a normal distribution. It was concluded that despite considerable growth rate variation in both species studied, growth curves could be constructed with sufficient precision to be useful for direct lichenometry. © 2014 Swedish Society for Anthropology and Geography.

Searching for Nearest Strings with Neural-Like String Embedding

We analyze an approach to a similarity preserving coding of symbol sequences based on neural distributed representations and show that it can be viewed as a metric embedding process.

Algorithm of Construction of Ordering of the Objects Nearest to the Any Relation on Set of Objects

The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is resulted. The algorithm based on a method of the consecutive analysis of variants and the analysis of conditions of acyclicity is offered.

Algorithm of Consecutive Definition of Ranking of the Objects Nearest to the set Cyclic Relation between Objects

The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is resulted. The algorithm based on a method of the consecutive analysis of variants and the analysis of conditions of acyclicity is offered.

Classification of Biomedical Signals using the Dynamics of the False Nearest Neighbours (DFNN) Algorithm

* This study was supported in part by the Natural Sciences and Engineering Research Council of Canada, and by the Gastrointestinal Motility Laboratory (University of Alberta Hospitals) in Edmonton, Alberta, Canada.

A LOFAR mini-survey for low-frequency radio emission from the nearest brown dwarfs

We have conducted a mini-survey for low-frequency radio emission from some of the closest brown dwarfs to the Sun with rapid rotation rates: SIMP J013656.5 +093347, WISEPC 150649.97+702736.0, and WISEPA J174124.26+255319.5.We have placed robust 3s upper limits on the flux density in the 111 – 169 MHz frequency range for these targets: WISE 1506: < 0:72 mJy; WISE 1741: < 0:87 mJy; SIMP 0136: < 0:66 mJy. At 8 hours of integration per target to achieve these limits, we find that systematic and detailed study of this class of object at LOFAR frequencies will require a substantial dedication of resources.