Mixed feature selection based on granulation and approximation

Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mainly designed for dealing with numerical or categorical attributes. However, data usually comes with a mixed format in real-world applications. In this paper, we generalize Pawlak’s rough set model into δ neighborhood rough set model and k-nearest-neighbor rough set model, where the objects with numerical attributes are granulated with δ neighborhood relations or k-nearest-neighbor relations, while objects with categorical features are granulated with equivalence relations. Then the induced information granules are used to approximate the decision with lower and upper approximations. We compute the lower approximations of decision to measure the significance of attributes. Based on the proposed models, we give the definition of significance of mixed features and construct a greedy attribute reduction algorithm. We compare the proposed algorithm with others in terms of the number of selected features and classification performance. Experiments show the proposed technique is effective.     

Effects of spatial variability in light use efficiency on satellite-based NPP monitoring

Light use efficiency (LUE) algorithms are a potentially effective approach to monitoring global net primary production (NPP) using satellite-borne sensors such as the Moderate Resolution Imaging Spectroradiometer (MODIS). However, these algorithms are applied at relatively coarse spatial resolutions (≥1 km), which may subsume significant heterogeneity in vegetation LUE (ε_n, g MJ⁻¹) and, hence, introduce error. To examine the effects of spatial heterogeneity on a LUE algorithm, imagery from the Advanced Very High Resolution Radiometer (AVHRR) at ≈1-km resolution was used to implement a LUE approach for NPP estimation over a 25-km² area of corn (Zea mays L.) and soybean (Glycine max Merr.) in central Illinois, USA. Results from several ε_n formulations were compared with a NPP reference surface based on measured NPPs and a high spatial resolution land cover surface derived from Landsat ETM+. Determination of ε_n based on measurements of biomass production and monitoring of absorbed photosynthetically active radiation (APAR) revealed that ε_n of soybean was 68% of that for corn. When a LUE algorithm for estimating NPP was implemented in the study area using the assumption of homogeneous cropland and the ε_n for corn, the estimate for total biomass production was 126% of that from the NPP reference surface. Because of counteracting errors, total biomass production using the soybean ε_n was closer (86%) to that from the NPP reference surface. Retention of high spatial resolution land cover to assign ε_n resulted in a total NPP very similar to the reference NPP because differences in leaf phenology between the crop types were small except early in the growing season. These results suggest several alternative approaches to accounting for land cover heterogeneity in ε_n when implementing LUE algorithms at coarse resolution.     

Spatially referenced methods of processing raster and vector data

The authors consider a general method of constructing addressing and arithmetic systems for two-dimensional image data using the hierarchy of ‘molecular’ tilings based on an original isohedral ‘atomic’ tiling. (Each molecular title at level k is formed from a constant number of tiles at level k−1; this is termed the ‘aperture’ property of the hierarchy.) In addition they present 11 objective criteria (which are of significance in cartographic image processing), by which these hierarchies and tilings may be described and compared.

Of the 11 topologically distinct types of isohedral tiling, three ([3⁶], [4⁴] and [6³]) are composed of regular polygons, and two of these ([3⁶] and[4⁴]) satisfy the condition that all tiles have the same ‘orientation’. In general, although each level in a hierarchy is topologically equivalent, the tiles may differ in shape at different levels and only [6³], [4⁴], [4.8²] and [4.6.12] are capable of giving rise to hierarchies in which the tiles at all levels are the same shape. The possible apertures of hierarchies obeying this condition are n² (for any n > 1)in the cases of [6³] and [4⁴]; n² or 2n² in the case of [4.8²]; and n² or 3n² in the case of [4.6.12].

In contrast the only tiling exhibiting the uniform ‘adjacency’ criterion is[3⁶]. However, hierarchies based on this atomic tiling generate molecular tiles with different shapes at every level. If these disadvantages are accepted, hierarchies based on first-level molecular tiles referred to as the 4-shape, 4′-shape, 7-shape and 9-shape are generated. Of these the 4-shape and the 9-shape appear to satisfy many of the cartographically desirable properties in addition to having an atomic tiling which exhibits uniform adjacency.

In recent years the generalized balanced ternary addressing system has been developed to exploit the image processing power of the 7-shape. The authors have generalized and extended this system as ‘tesseral addressing and arithmetic’, showing how it can be used to render a 4-shape into a spatially correct linear quadtree.     

Gasochromic effect of palladium doped peroxopolytungstic acid films prepared by the sol-gel route

Gasochromic palladium doped peroxopolytungstic acid (Pd:P-PTA) films have been prepared using dip-coating deposition from peroxopolytungstic acid (P-PTA) sols into which PdCl₂ was added in molar ratios Pd:W=1:125, 1:100, 1:53, and 1:40. These films exhibit reversible colouring/bleaching changes when exposed to hydrogen or hydrogen/argon mixture (4%) and air, alternatively. Gasochromically coloured and bleached films were characterised using in-situ Fourier transform infrared (FT-IR) spectroscopy. The vibrational modes of as-deposited, coloured and bleached films were assigned and the polaron absorption, which characterises the IR spectra of coloured films, was detected. Colouring/bleaching kinetics of films exposed to H₂ and H₂/Ar mixture as a function of the concentration of the catalyst and temperature of heat-treatment is reported. Proton (σ_pr) and electronic (σ_el) conductivities determined from impedance spectra revealed an increase in σ_el from 10⁻⁵ S cm⁻¹ in bleached state, to 10⁻³ S cm⁻¹ in coloured state, while σ_pr remained constant (10⁻² S cm⁻¹).     

Flow Curves: an Intuitive Interface for Coherent Scene Deformation

Effective composition in visual arts relies on the principle of movement, where the viewer's eye is directed along subjective curves to a center of interest. We call these curves subjective because they may span the edges and/or center‐lines of multiple objects, as well as contain missing portions which are automatically filled by our visual system. By carefully coordinating the shape of objects in a scene, skilled artists direct the viewer's attention via strong subjective curves. While traditional 2D sketching is a natural fit for this task, current 3D tools are object‐centric and do not accommodate coherent deformation of multiple shapes into smooth flows. We address this shortcoming with a new sketch‐based interface called Flow Curves which allows coordinating deformation across multiple objects. Core components of our method include an understanding of the principle of flow, algorithms to automatically identify subjective curve elements that may span multiple disconnected objects, and a deformation representation tailored to the view‐dependent nature of scene movement. As demonstrated in our video, sketching flow curves requires significantly less time than using traditional 3D editing workflows.     

Initial-interval driven biasing of nodal concentration along a fixed curve

Element size transitioning in the construction of spatial meshes for finite element models is often controlled by biasing the concentration of nodes, towards one end or the other, along each of a set of curves in the model. A simple, common and efficient scheme to implement such nodal concentration biasing along a given curve is to require that the nodal spacings δ_i be (sequence) terms bⁱδ₀ of a geometric series. Current practice takes the parameter value b, or its equivalent, as an independent input, so that the initial nodal spacing δ₀ must be a computed output. This is the most straightforward approach, but the lack of direct control over the value δ₀ is a significant shortcoming. In an element size transitioning scenario, δ₀ is often a parameter for which the model builder/analyst has independent quantitative information. It may represent the a priori known thickness of a thin bond or weld, for example. A more rational choice for these cases, proposed by this paper, is a scheme for which δ₀ is an independent input parameter instead of b. The parameter b is computed by a convergence-guaranteed algorithm for which the existence of b as a single-valued function of its input is proven.     

草绘3维人体建模的模板形变方法

目的 采用草绘交互方式直接构造3维人体模型是当前人体建模研究的重要课题之一.提出一种草绘3维人体建模的模板形变方法.方法 针对输入的草图,首先,采用关节点定位方法获取草图中的人体关节点,根据人体结构学约束识别人体骨架结构,通过解析人体轮廓草图获取人体草图特征;其次,通过骨架模板和外观轮廓模板形变,将草图特征映射到3维人体模型,实现3维人体建模.结果 草图解析方法能有效提取草图特征,通过模板形变方法生成3维人体模型,并在模型上保持草图特征;能适应不同用户的绘制习惯,且生成的3维人体模型可用于人体动画设计.结论 提出一种草绘3维人体建模的模板形变方法,支持用户采用草绘方式进行3维人体模型设计,方法具有良好的用户适应性,对3维动画创作具有重要意义.     

Sketch-based design for green geometry and image deformation

User interfaces have traditionally followed the WIMP (window, icon, menu, pointer) paradigm. Though functional and powerful, they are usually cumbersome for a novice user to design a complex model, requiring considerable expertise and effort. This paper presents a system for designing geometric models and image deformation with sketching curves, with the use of Green coordinates. In 3D modeling, the user first creates a 3D model by using a sketching interface, where a given 2D curve is interpreted as the projection of the 3D curve. The user can add, remove, and deform these control curves easily, as if working with a 2D line drawing. For a given set of curves, the system automatically identifies the topology and face embedding by applying graph rotation system. Green coordinates are then used to deform the generated models with detail-preserving property. Also, we have developed a sketch-based image-editing interface to deform image regions using Green coordinates. Hardware-assisted schemes are provided for both control shape deformation and the subsequent surface optimization, the experimental results demonstrate that 3D/2D deformations can be achieved in realtime.     

Integrated optical pH sensor using replicated chirped grating coupler sensor chips

Integrated optical sensor chips suitable for high-resolution pH measurements are presented. The pH-sensitive swelling of a polymer membrane is detected by refractometry using a compact multi-channel sensor module. The signal transduction is achieved by means of chirped grating couplers which allow simple yet high functionality sensor modules to be built. The experiments have been performed with high sensitivity replicated polycarbonate TiO₂ waveguide sensor chips coated with an ultrathin photopatterned hydrogel membrane having functional groups which reversibly change from the neutral state to a charged state upon acidification. A resolution δpH <±1.1×10⁻⁴ in terms of the pH (at pH 7.5) has been obtained in a dual-channel module with size 10×10×10 cm³.     

The singular cases for γ-spline interpolation

We derive a natural extension of Boehm's free-form γ-spline, the G² interpolating γ-spline. Primarily, the conditions under which singularities in the spline formulation occur are investigated. Also, the effect that these singularities have on the interpolant are studied. Comparisons are made to the behavior of the interpolating ν-spline.     

Expositing stages of VPRS analysis in an expert system: Application with bank credit ratings

The variable precision rough sets model (VPRS) along with many derivatives of rough set theory (RST) necessitates a number of stages towards the final classification of objects. These include, (i) the identification of subsets of condition attributes (β-reducts in VPRS) which have the same quality of classification as the whole set, (ii) the construction of sets of decision rules associated with the reducts and (iii) the classification of the individual objects by the decision rules. The expert system exposited here offers a decision maker (DM) the opportunity to fully view each of these stages, subsequently empowering an analyst to make choices during the analysis. Its particular innovation is the ability to visually present available β-reducts, from which the DM can make their selection, a consequence of their own reasons or expectations of the analysis undertaken. The practical analysis considered here is applied on a real world application, the credit ratings of large banks and investment companies in Europe and North America. The snapshots of the expert system presented illustrate the variation in results from the ‘asymmetric’ consequences of the choice of β-reducts considered.     

基于最小二乘网格的模型变形算法

针对自由变形技术难以保持模型细节的问题,提出一种基于最小二乘网格的模型变形算法.通过顶点位置约束的全局拉普拉斯光顺分解出表示模型低频信号的最小二乘网格,并求出高频信号在该网格上的编码;通过用户交互,基于均值坐标对最小二乘网格进行自由变形;根据最小二乘网格各顶点处局部标架在变形时的几何变换求出变形后的高频编码,通过解码求出变形后的网格模型.实验结果表明,该算法简单、高效且便于用户交互,有效地保持了模型的几何细节.     

An improved lower bound on approximation algorithms for the Closest Substring problem

The Closest Substring problem (the CSP problem) is a basic NP-hard problem in the study of computational biology. It is known that the problem has polynomial time approximation schemes. In this paper, we prove that unless the Exponential Time Hypothesis fails, the CSP problem has no polynomial time approximation schemes of running time f(1/ε)n^o(1/ε) for any function f. This essentially excludes the possibility that the CSP problem has a practical polynomial time approximation scheme even for moderate values of the error bound ε. As a consequence, it is unlikely that the study of approximation schemes for the CSP problem in the literature would lead to practical approximation algorithms for the problem for small error bound ε.     

LSM: A layer subdivision method for deformable object matching

A deformation technique is a method to deform any part of, or an entire object, into a desired shape. Existing deformation methods take a lot of computational cost to represent smoothness correctly due to the constraints caused by differential coefficients of high degree. Thus, it is very difficult to find a general solution. In this paper we propose a LSM (layered subdivision method) that integrates a controlling mechanism, surface deformation, and mesh refinement processing 3D modeling and free-form deformable object matching. The proposed method is considerably more efficient and robust when compared to the existing method of free-form surface, because of the computation of the reference points of deformation edge using geometry of free-form surface. This approach can be applied to automatic inspection of NURBS models and object recognition.     

Triple positive solutions for some second-order boundary value problem on a measure chain

In this paper, we study the existence of three positive solutions for the second-order two-point boundary value problem on a measure chain,

where f:[t₁,σ(t₂)]×[0,∞)×R→[0,∞) is continuous and p:[t₁,σ(t₂)]→[0,∞) a nonnegative function that is allowed to vanish on some subintervals of [t₁,σ(t₂)] of the measure chain. The method involves applications of a new fixed-point theorem due to Bai and Ge [Z.B. Bai, W.G. Ge, Existence of three positive solutions for some second order boundary-value problems, Comput. Math. Appl. 48 (2004) 699–707]. The emphasis is put on the nonlinear term f involved with the first order delta derivative x^Δ(t).     

Roe-type schemes for dense gas flow computations

Dense gas dynamics studies the dynamic behavior of gases in the thermodynamic region close to the liquid–vapor critical point, where the perfect gas law is no longer valid, and has to be replaced by more complex equations of state. In such a region, some fluids, known as the Bethe–Zel’dovich–Thompson fluids, can exhibit non-classical nonlinearities, such as expansion shocks, and mixed shock-fan waves. In the present work, the problem of choosing a suitable numerical scheme for dense gas flow computations is addressed. In particular, some extensions of classical Roe’s scheme to real gas flows are reviewed and their performances are evaluated for flow problems involving non-classical nonlinearities. A simplification to Roe’s linearization procedure is proposed, which does not satisfy the U-property exactly, but significantly reduces complexity and computational costs. Such simplification introduces an additional error O(δx²), with δx the mesh size, with respect to the first-order accurate Roe’s scheme, and O(δx⁶) with respect to its higher-order MUSCL extensions. Numerical experiments, concerning a one-dimensional dense gas shock tube, supersonic flow of a BZT gas past a forward-facing step, and transonic dense gas flow through a turbine cascade, show a negligible influence of the adopted linearization procedure on the solution accuracy, whereas it significantly affects computational efficiency.     

At Last an ISO C Binding of GKS

The C⁴ bindings of GKS1 and other semantic computer graphics standards like GKS–3D² and PHIGS³ are long overdue. While GKS was completed in 1985 and GKS–3D² (and PHIGS³) became an international standard in 1988, none of their C bindings could be standardized, for the simple reason that the C language itself was not a standard. Instead, a host of de facto GKS/C bindings⁹ appeared.
This paper will give the flavour of the ISO C binding^5,6 of GKS; the main features will be outlined.
1983 CR Categories: D.3.0,I.3.0,I.3.4.     

How age affects the speed of perception of computer icons

The use of computers is constantly increasing. At the same time the population of the industrialised world is aging. In this study we investigated the speed with which users of different ages can find a specific computer icon from a group of others. Our results show that search performance slows with age when calculated across all three levels of inter-icon spacing (χ² (4) = 14.904, p < .05) and icon size (χ² (4) = 15.674, p < .05) used in this study. However, individual variability in search performance was very high within all age groups. Our study suggests that icons used in graphical user interfaces should be at least about 1 degree in size (about 0.7 cm at a viewing distance of 40 cm) for the majority of users to be able to perform their computerised tasks with relative ease. Also, the inter-icon spacing should be moderate, preferably about the same as the icon size. Ideally user interfaces should be adaptable to individual user needs and preferences.