3D Scene Reconstruction from Multiple Spherical Stereo Pairs

We propose a 3D environment modelling method using multiple pairs of high-resolution spherical images. Spherical images of a scene are captured using a rotating line scan camera. Reconstruction is based on stereo image pairs with a vertical displacement between camera views. A 3D mesh model for each pair of spherical images is reconstructed by stereo matching. For accurate surface reconstruction, we propose a PDE-based disparity estimation method which produces continuous depth fields with sharp depth discontinuities even in occluded and highly textured regions. A full environment model is constructed by fusion of partial reconstruction from spherical stereo pairs at multiple widely spaced locations. To avoid camera calibration steps for all camera locations, we calculate 3D rigid transforms between capture points using feature matching and register all meshes into a unified coordinate system. Finally a complete 3D model of the environment is generated by selecting the most reliable observations among overlapped surface measurements considering surface visibility, orientation and distance from the camera. We analyse the characteristics and behaviour of errors for spherical stereo imaging. Performance of the proposed algorithm is evaluated against ground-truth from the Middlebury stereo test bed and LIDAR scans. Results are also compared with conventional structure-from-motion algorithms. The final composite model is rendered from a wide range of viewpoints with high quality textures.     

GLL parse-tree generation

Backtracking techniques which are often used to extend recursive descent (RD) parsers can have explosive run-times and cannot deal with grammars with left recursion. GLL parsers are fully general, worst-case cubic parsers which have the recursive descent-like property that they are easy to write and to use for grammar debugging. They have the direct relationship with the grammar that an RD parser has. In this paper we give an algorithm for generating GLL parsers which build an SPPF representation of the derivations of the input, complementing our existing GLL recognition algorithm, and we show that such parsers and recognisers are worst-case cubic.     

Design of an integrated UWB antenna with dual band notch characteristics

A miniaturized couple-line-fed planar ultra-wideband (UWB) antenna is proposed, which has a dual band-notched characteristic as well as two integrated monopoles. Narrowband notches are generated at frequencies of 3.5 GHz and 5.5 GHz using independently controlled bent resonators, whereas the monopoles are designed for radiation at 900 MHz and 2.4 GHz. The proposed design is simulated with full wave solvers and verified with measurements. A good agreement is observed between the simulations and measurements for the antenna's return loss, gain and radiation pattern performances.     

Critical superparamagnetic/single-domain grain sizes in interacting magnetite particles: implications for magnetosome crystals

Magnetotactic bacteria contain chains of magnetically interacting crystals (magnetosome crystals), which they use for navigation (magnetotaxis). To improve magnetotaxis efficiency, the magnetosome crystals (usually magnetite or greigite in composition) should be magnetically stable single-domain (SSD) particles. Smaller single-domain particles become magnetically unstable owing to thermal fluctuations and are termed superparamagnetic (SP). Previous calculations for the SSD/SP threshold size or blocking volume did not include the contribution of magnetic interactions. In this study, the blocking volume has been calculated as a function of grain elongation and separation for chains of identical magnetite grains. The inclusion of magnetic interactions was found to decrease the blocking volume, thereby increasing the range of SSD behaviour. Combining the results with previously published calculations for the SSD to multidomain threshold size in chains of magnetite reveals that interactions significantly increase the SSD range. We argue that chains of interacting magnetosome crystals found in magnetotactic bacteria have used this effect to improve magnetotaxis.     

Parikh matrices and amiable words

Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same Parikh matrix; these words are called “amiable”. The presented results extend the results obtained in [A. Atanasiu, Binary amiable words, Int. J. Found. Comput. Sci. 18 (2) (2007) 387–400] for the binary case. In particular it is shown that all the words having the same Parikh matrix can be obtained one from another by applying only two types of transformations. Moreover, the mirrors of two amiable words are also amiable (thus forming a symmetrical class of words).     

Evolution of ion-induced ripple patterns on SiO2 surfaces

The evolution of nanoscale ripple patterns during sub-keV ion sputtering of thermally grown, fused and single crystalline SiO₂ surfaces has been investigated by means of atomic force microscopy. For all three materials, different dependencies of the ripple wavelength and the surface roughness on the ion fluence have been found. Within the Bradley-Harper model of pattern formation, the observed differences are consistent with different amounts of surface and near-surface mass transport by ion-enhanced viscous flow which might result from different surface energies of the SiO₂ specimens.     

A space efficient solution to the frequent string mining problem for many databases

The frequent string mining problem is to find all substrings of a collection of string databases which satisfy database specific minimum and maximum frequency constraints. Our contribution improves the existing linear-time algorithm for this problem in such a way that the peak memory consumption is a constant factor of the size of the largest database of strings. We show how the results for each database can be stored implicitly in space proportional to the size of the database, making it possible to traverse the results in lexicographical order. Furthermore, we present a linear-time algorithm which calculates the intersection of the results of different databases. This algorithm is based on an algorithm to merge two suffix arrays, and our modification allows us to also calculate the LCP table of the resulting suffix array during the merging.     

密封装置有效热管理的散热解决方案

由于密封装置中缺乏有效的热管理,将不可避免地导致温度上升至极点,从而损坏电气设备。热量在密封装置中迅速累积,如果不采取其他措施,热量只能经由密封装置的外壳,以辐射和对流的形式缓慢地向外散发。