A neural network-based scheme coupled with the RPV model inversion package

A hybrid scheme for the inversion of the Rahman-Pinty-Verstraete (RPV) model is presented. It combines the inversion technique described by Lavergne et al. (Lavergne, T., Kaminski, T., Pinty, B., Taberner, M., Gobron, N., Verstraete, M.M., Vossbeck, M., Widlowski, J.L., Giering, R. (2007). Application to MISR land products of an RPV model inversion package using adjoint and Hessian codes. Remote Sensing of Environment, 107, 362-375.) and a multilayer backpropagation feedforward neural network. The RPV inversion package is applied to a sample set of pixels within the satellite scene. Subsequently the pairs of bidirectional reflectance factors (BRF) and model parameters estimated from the sample set of pixels are used to train the neural network. Since the mathematical formulation of the RPV model is embedded in these training data variables, the neural network can efficiently retrieve the model parameters for the whole satellite scene. This scheme has been tested for a MISR L2 BRF scene, MISR L1B2-derived BRF data corresponding to two different dates and a mosaic of MISR L2 BRF scenes acquired over Southern Africa covering a large extent of Miombo woodland. The results show this strategy retrieves the RPV model parameters and uncertainties with high accuracy and considerable speed over large areas.     

The impact of misregistration on SRTM and DEM image differences

Image differences between Shuttle Radar Topography Mission (SRTM) data and other Digital Elevation Models (DEMs) are often performed for either accuracy assessment or for estimating vegetation height across the landscape. It has been widely assumed that the effect of sub-pixel misregistration between the two models on resultant image differences is negligible, yet this has not previously been tested in detail. The aim of this study was to determine the impact that various levels of misregistration have on image differences between SRTM and DEMs. First, very accurate image co-registration was performed at two study sites between higher resolution DEMs and SRTM data, and then image differences (SRTM–DEM) were performed after various levels of misregistration were systematically introduced into the SRTM data. It was found that: (1) misregistration caused an erroneous and dominant correlation between elevation difference and aspect across the landscape; (2) the direction of the misregistration defined the direction of this erroneous and systematic elevation difference; (3) for sub-pixel misregistration the error due solely to misregistration was greater than, or equal to the true difference between the two models for substantial proportions of the landscape (e.g., greater than 33% of the area for a half-pixel misregistration); and (4) the strength of the erroneous relationship with aspect was enhanced by steeper terrain. Spatial comparisons of DEMs were found to be sensitive to even sub-pixel misregistration between the two models, which resulted in a strong erroneous correlation with aspect. This misregistration induced correlation with aspect is not likely specific to SRTM data only; we expect it to be a generic relationship present in any DEM image difference analysis.     

A general topology-based framework for adaptive insertion of cohesive elements in finite element meshes

Large-scale simulation of separation phenomena in solids such as fracture, branching, and fragmentation requires a scalable data structure representation of the evolving model. Modeling of such phenomena can be successfully accomplished by means of cohesive models of fracture, which are versatile and effective tools for computational analysis. A common approach to insert cohesive elements in finite element meshes consists of adding discrete special interfaces (cohesive elements) between bulk elements. The insertion of cohesive elements along bulk element interfaces for fragmentation simulation imposes changes in the topology of the mesh. This paper presents a unified topology-based framework for supporting adaptive fragmentation simulations, being able to handle two- and three-dimensional models, with finite elements of any order. We represent the finite element model using a compact and “complete” topological data structure, which is capable of retrieving all adjacency relationships needed for the simulation. Moreover, we introduce a new topology-based algorithm that systematically classifies fractured facets (i.e., facets along which fracture has occurred). The algorithm follows a set of procedures that consistently perform all the topological changes needed to update the model. The proposed topology-based framework is general and ensures that the model representation remains always valid during fragmentation, even when very complex crack patterns are involved. The framework correctness and efficiency are illustrated by arbitrary insertion of cohesive elements in various finite element meshes of self-similar geometries, including both two- and three-dimensional models. These computational tests clearly show linear scaling in time, which is a key feature of the present data-structure representation. The effectiveness of the proposed approach is also demonstrated by dynamic fracture analysis through finite element simulations of actual engineering problems.

Efficient embedded wavelet codec based on list structure

A new efficient image codec called embedded wavelet coding based on list structure (EWCBL) is proposed in this paper. By combining the techniques of morphological representation and quadtree partitioning, EWCBL effectively exploits both within-subband clustering and cross-subband similarity of wavelet coefficients. Based on the list structure, a fine fractional bit-plane coding is employed to achieve excellent rate-distortion performance. The patterned morphological dilation is introduced to greatly reduce the redundant test operations. Experimental results show that the proposed EWCBL outperforms state-of-the-art embedded codecs for both lossy and lossless compression. Moreover, the good performance and features of embeddedness and scalability are achieved with relatively low complexity.     

Adopting organizational virtualization in B2B firms: An empirical study in Singapore

We empirically tested a parsimonious model that incorporates cost-benefit analysis/transaction cost theory, institutional theory, and organizational capability-based theory to predict organizational adoption of IT-facilitated virtualization in an Asian context. Virtualization implies the use of IT and communication technology by organizations in managing their interactions and key business operations with stakeholders, such as customers, suppliers and employees. Our research extends existing literature by using organizational structure adoption theories. The study should provide insights into the salient adoption issues of Asian firms. A survey was conducted of B2B organizations in Singapore. Results indicated that an increase in the level of net perceived benefits, external influences, and organizational capabilities had a positive effect on organizational decision makers’ intention to use virtualization. In particular, external influences were found to be the most important antecedents of intention to adopt virtualization in B2B organizations in Singapore.     

Two proposals for the inclusion of directory information in the last-level private caches of glueless shared-memory multiprocessors

In glueless shared-memory multiprocessors where cache coherence is usually maintained using a directory-based protocol, the fast access to the on-chip components (caches and network router, among others) contrasts with the much slower main memory. Unfortunately, directory-based protocols need to obtain the sharing status of every memory block before coherence actions can be performed. This information has traditionally been stored in main memory, and therefore these cache coherence protocols are far from being optimal. In this work, we propose two alternative designs for the last-level private cache of glueless shared-memory multiprocessors: the lightweight directory and the SGluM cache. Our proposals completely remove directory information from main memory and store it in the home node’s L2 cache, thus reducing both the number of accesses to main memory and the directory memory overhead. The main characteristics of the lightweight directory are its simplicity and the significant improvement in the execution time for most applications. Its drawback, however, is that the performance of some particular applications could be degraded. On the other hand, the SGluM cache offers more modest improvements in execution time for all the applications by adding some extra structures that cope with the cases in which the lightweight directory fails.     

The segmented presentation of visually structured texts: Effects on text comprehension

The effects of a segmented presentation applied to a visually structured text were examined in the context of the explosion of small-screen devices. Empirical research investigating the influence of text signaling on text processing suggests that the text visual structure may influence comprehension by facilitating the construction of a coherent text representation. Undergraduate students were asked to read a text under different segmented conditions varying on the type of information provided about the text visual structure and on the segmentation unit. When the segmented presentation did not supply any information or when it only offered local information about the text visual structure, text comprehension depended on the segmentation unit. When the segmentation unit did not fit the text visual structure, an erroneous text representation was constructed, whereas the compatible segmentation unit led to a correct text comprehension. When the segmented presentation rendered the global text visual structure, the segmentation unit had no effect on comprehension and more readers constructed a correct and close text representation. Thus, the text visual structure seems to play a role in text comprehension and this role has to be taken into account for text segmented presentation.     

An approach to mining bundled commodities

Although bundled commodities are largely existed in supermarket, there are few investigations about bundled commodities mining. In this study, interval-valued association rules as a novel and possible approach to solving the bundled commodities mining issue, is proposed. Properties research based on interval-valued association rules is conducted, and an interval-valued rule pattern: F, ,  is constructed, where F denotes set of interval-valued ruses, and denote the disjunctive operation and conjunctive operation, respectively. Furthermore, one of the properties satisfied by the interval-valued rules: A  C = B  C and A  C = B  C  A = B, where A, B, C are there different rules, is validated and utilized to mine the bundled commodities. Finally, a large-scale software engineering project relative to interval-valued rule mining is implemented to merge flight testing information about aircrafts which validates the technique of mining bundled commodities can be discovered a special relation between objects. These initial investigations provide a researchable framework for bundled commodities mining.     

Design of variable structure control for fuzzy nonlinear systems

In this paper, the variable structure control problem is presented for Takagi–Sugeno fuzzy systems with uncertainties and external disturbances. The sliding surfaces for the T–S fuzzy system are proposed by using a Lyapunov function and a fuzzy Lyapunov function, respectively. And we design the variable structure controllers such that the global T–S fuzzy system confined on the sliding surfaces is asymptotically stable. Two examples are given to illustrate the effectiveness of our proposed methods.