2D and 3D modelling of building form subjected to ember attack

This paper furthers the research of Rollo, Luther and Atkinson 1999, and Rollo, Honey, Atkinson and Luther 2003, regarding the way in which building shape appears to contribute to the collection of fire-brand debris subject to ember attack. The paper will present a range of 2D fluid-mapping and 3D wind tunnel studies (Melaragno 1982) which have been correlated with the transportation characteristics of an ember laden air-field (Cheney and Sullivan 1997). Working with a range of generic building types the paper also introduces simple spatial modelling techniques which are being developed to illustrate the relationship between ember capture and changes in wind speed and air pressure.

A multi-wavelet based technique for calculating dense 2D disparity maps from stereo

A vision based approach for calculating accurate 3D models of the objects is presented. Generally industrial visual inspection systems capable of accurate 3D depth estimation rely on extra hardware tools like laser scanners or light pattern projectors. These tools improve the accuracy of depth estimation but also make the vision system costly and cumbersome. In the proposed algorithm, depth and dimensional accuracy of the produced 3D depth model depends on the existing reference model instead of the information from extra hardware tools. The proposed algorithm is a simple and cost effective software based approach to achieve accurate 3D depth estimation with minimal hardware involvement. The matching process uses the well-known coarse to fine strategy, involving the calculation of matching points at the coarsest level with consequent refinement up to the finest level. Vector coefficients of the wavelet transform-modulus are used as matching features, where wavelet transform-modulus maxima defines the shift invariant high-level features with phase pointing to the normal of the feature surface. The technique addresses the estimation of optimal corresponding points and the corresponding 2D disparity maps leading to the creation of accurate depth perception model.

Spherical harmonics descriptor for 2D-image retrieval

In this paper, spherical harmonics are proposed as shape descriptors for 2D images. We introduce the concept of connectivity; 2D images are decomposed using connectivity, which is followed by 3D model construction. Spherical harmonics are obtained for 3D models and used as descriptors for the underlying 2D shapes. Difference between two images is computed as the Euclidean distance between their spherical harmonics descriptors. Experiments are performed to test the effectiveness of spherical harmonics for retrieval of 2D images. Item S8 within the MPEG-7 still images content set is used for performing experiments; this dataset consists of 3621 still images. Experimental results show that the proposed descriptors for 2D images are effective

Inorganic-organic hybrids of the p,p'-diphenylmethylenediphosphinate ligand with bivalent metals: a new 2D-layered phenylphosphinate zinc(II) complex

By reaction of Zn(CH₃COO)₂ with p,p′-diphenylmethylenediphosphinic acid in water a new inorganic–organic polymeric hybrid of formula [Zn(CH₂(P(Ph)O₂)₂)] has been synthesized and completely characterized. The X-ray analysis established that the structure consists of 2D-layered polymeric array, the 2D-sheets being built up through strong covalent linkages between the zinc metal and the oxygen donors of the phenylphosphinate ligand. The 2D-layers, which are featuring a mesh-net fashion, present voids of various dimensionality, up to 24-membered rings. The organic parts of the hybrid ligand, namely the phenyl rings, are shielding the inorganic skeleton of the layers, preventing the propagation of the polymer in the third dimension. No water molecules are present in the lattice, both of coordination and crystallization. Crystal data are: monoclinic, P2₁Ic, a=11.840(2), b=9.646(9), c=12.516(5) Å, β=95.03(2), V=1423.9(15) ų, Z=4. The solid material has been characterized by ³¹P MAS NMR spectroscopy and thermogravimetric analysis.

Managing data using neighbor replication on triangular-grid structure

Data is one of the domains in grid research that deals with the storage, replication, and management of large data sets in a distributed environment. The all-data-to-all sites replication scheme such as read-one write-all and tree grid structure (TGS) are the popular techniques being used for replication and management of data in this domain. However, these techniques have its weaknesses in terms of data storage capacity and also data access times due to some number of sites must ‘agree’ in common to execute certain transactions. In this paper, we propose the all-data-to-some-sites scheme called the neighbor replication on triangular grid (NRTG) technique by considering only neighbors have the replicated data, and thus, minimizes the storage capacity as well as high update availability. Also, the technique tolerates failures such as server failures, site failure or even network partitioning using remote procedure call (RPC).

Minimum span frequency assignment problem on triangular lattices

This paper considers the Minimum Span Frequency Assignment Problem with Interference Graph on Triangular Grid (MSFAP-TG), a special case of the Minimum Span Frequency/Channel Assignment (MSFAP) for cellular systems and optical networks. The MSFAP-TG is interesting in its own right and thus worth studying. In this paper, we propose strong integer programming formulations for the MSFAP-TG and present polyhedral results on these formulations. In solving the MSFAP-TG, we implement these integer programs to obtain exact solutions. We also develop a heuristic for obtaining feasible solutions and upper bounds for the problems. With the use of these upper bounds, and a simple lower bound, the computation time of the exact algorithm can be improved substantially. The heuristic turns out to be quite good in terms of the quality of upper bounds and is extremely efficient in computation time. Last of all, we present new concepts for tackling large scale MSFAP-TGs.

Fitting triangular norms to empirical data

This chapter discusses some specific tools that can be used to build triangular norms based on a finite number of (possibly noisy) observations. Such problem arises in applications, when observed data (e.g., decision patterns of experts) need to be modelled with a special class of functions, such as triangular norms. We show how this problem can be transformed into a constrained regression problem, and then efficiently solved. We also discuss related operators: uninorms, nullnorms and associative copulas.

Studies on the mechanism of the peroxyoxalate chemiluminescence reaction : part 2, further identification of intermediates using 2D EXSY 13C nuclear magnetic resonance spectroscopy

Further consideration has been given to the reaction pathway of a model peroxyoxalate chemiluminescence system. Again utilising doubly labelled oxalyl chloride and anhydrous hydrogen peroxide, 2D EXSY ¹³C nuclear magnetic resonance (NMR) spectroscopy experiments allowed for the characterisation of unknown products and key intermediate species on the dark side of the peroxyoxalate chemiluminescence reaction. Exchange spectroscopy afforded elucidation of a scheme comprised of two distinct mechanistic pathways, one of which contributes to chemiluminescence. ¹³C NMR experiments carried out at varied reagent molar ratios demonstrated that excess amounts of hydrogen peroxide favoured formation of 1,2-dioxetanedione: the intermediate that, upon thermolysis, has been long thought to interact with a fluorophore to produce light.

Generalised 2D-correlation NMR analysis of a wine fermentation

A wine fermentation has been monitored on a daily basis by 1H NMR spectroscopy. Following data pre-processing that includes synthesis of the spectra to ensure all peaks are of constant half-width, the series of spectra were examined using generalised two-dimensional correlation techniques. Synchronous and asynchronous data maps have been generated and employed to interpret the changes in the fermentation process as a function of time. The results illustrate the potential of high resolution NMR with multivariate data analysis as a tool for process monitoring and the manner in which two-dimensional correlation mapping can aid in data interpretation.

Construction of k-Lipschitz triangular norms and conorms from empirical data

This paper examines the practical construction of k-Lipschitz triangular norms and conorms from empirical data. We apply a characterization of such functions based on k-convex additive generators and translate k-convexity of piecewise linear strictly decreasing functions into a simple set of linear inequalities on their coefficients. This is the basis of a simple linear spline-fitting algorithm, which guarantees k-Lipschitz property of the resulting triangular norms and conorms.

Managing data using neighbour replication on a triangular-grid structure

Data in grid research deals with storage, replication, and management of large data sets in a distributed environment. The all-data-to-all-sites replication schemes, like Read-One Write-All (ROWA) and Tree Grid Structure (TGS), are the popular techniques in grid. However, these techniques have a weakness in data storage capacity and data access times. In this paper, we propose the all-data-to-some-sites scheme called the 'Neighbour Replication on Triangular Grid' (NRTG) technique. The proposed scheme minimises the storage capacity as well as data access time with high update availability. It also tolerates failures such as server and site failures.

A characterization theorem for t-representable n-dimensional triangular norms

n-dimensional fuzzy sets are an extension of fuzzy sets that includes interval-valued fuzzy sets and interval-valued Atanassov intuitionistic fuzzy sets. The membership values of n-dimensional fuzzy sets are n-tuples of real numbers in the unit interval [0,1], called n-dimensional intervals, ordered in increasing order. The main idea in n-dimensional fuzzy sets is to consider several uncertainty levels in the memberships degrees. Triangular norms have played an important role in fuzzy sets theory, in the narrow as in the broad sense. So it is reasonable to extend this fundamental notion for n-dimensional intervals. In interval-valued fuzzy theory, interval-valued t-norms are related with t-norms via the notion of t-representability. A characterization of t-representable interval-valued t-norms is given in term of inclusion monotonicity. In this paper we generalize the notion of t-representability for n-dimensional t-norms and provide a characterization theorem for that class of n-dimensional t-norms. © 2011 Springer-Verlag Berlin Heidelberg.

A unified 2D-3D video scene change detection framework for mobile camera platforms

In this paper, we present a novel scene change detection algorithm for mobile camera platforms. Our approach integrates sparse 3D scene background modelling and dense 2D image background modelling into a unified framework. The 3D scene background modelling identifies inconsistent clusters over time in a set of 3D cloud points as the scene changes. The 2D image background modelling further confirms the scene changes by finding inconsistent appearances in a set of aligned images using the classical MRF background subtraction technique. We evaluate the performance of our proposed system on a number of challenging video datasets obtained from a camera placed on a moving vehicle and the experiments show that our proposed method outperforms previous works in scene change detection, which suggested the feasibility of our approach.

Boosting performance for 2D linear discriminant analysis via regression

Two Dimensional Linear Discriminant Analysis (2DLDA) has received much interest in recent years. However, 2DLDA could make pairwise distances between any two classes become significantly unbalanced, which may affect its performance. Moreover 2DLDA could also suffer from the small sample size problem. Based on these observations, we propose two novel algorithms called Regularized 2DLDA and Ridge Regression for 2DLDA (RR-2DLDA). Regularized 2DLDA is an extension of 2DLDA with the introduction of a regularization parameter to deal with the small sample size problem. RR-2DLDA integrates ridge regression into Regularized 2DLDA to balance the distances among different classes after the transformation. These proposed algorithms overcome the limitations of 2DLDA and boost recognition accuracy. The experimental results on the Yale, PIE and FERET databases showed that RR-2DLDA is superior not only to 2DLDA but also other state-of-the-art algorithms.