Constraints of Second-Order Vanishing Moments on Lattice Structures for Non-separable Orthogonal Symmetric Wavelets In this paper, a design method of two-dimensional (2D) orthogonal symmetric wavelets is proposed by using a lattice structure for multi-dimensional (M-D) linear-phase paraunitary filter banks (LPPUFB), which the authors have proposed as a previous work and then modified by Lu Gan et al. The derivation process for the constraints on the second-order vanishing moments is shown and some design examples obtained through optimization with the constraints are exemplified. In order to verity the significance of the constraints, some experimental results are shown for Lena and Barbara image.

O O O B I O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

orthogonal transforms
non-separable filter banks
video coding


In-depth analysis of the naming game dynamics: The homogeneous mixing case Language emergence and evolution have recently gained growing attention through multi-agent models and mathematical frameworks to study their behavior. Here we investigate further the Naming Game, a model able to account for the emergence of a shared vocabulary of form-meaning associations through social/cultural learning. Due to the simplicity of both the structure of the agents and their interaction rules, the dynamics of this model can be analyzed in great detail using numerical simulations and analytical arguments. This paper first reviews some existing results and then presents a new overall understanding.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cultural evolution
language self-organization
social interaction
emergence of consensus
statistical physics


Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach The maximization of the log-likelihood function required in the estimation of spatial autoregressive linear regression models is a computationally intensive procedure that involves the manipulation of matrices of dimension equal to the size of the data set. Common computational approaches applied to this problem include the use of the eigenvalues of the spatial weights matrix (W), the application of Cholesky decomposition to compute the Jacobian term |I??W|, and various approximations. These procedures are computationally intensive and/or require significant amounts of memory for intermediate data structures, which becomes problematic in the analysis of very large spatial data sets (tens of thousands to millions of observations). In this paper, we outline a new method for evaluating the Jacobian term that is based on the characteristic polynomial of the spatial weights matrix W. In numerical experiments, this algorithm approaches linear computational complexity, which makes it the fastest direct method currently available, especially for very large data sets.

O B I I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

maximum likelihood estimation
characteristic polynomial


A novel hybridization of echo state networks and multiplicative seasonal ARIMA model for mobile communication traffic series forecasting For mobile communication traffic series, an accurate multistep prediction result plays an important role in network management, capacity planning, traffic congestion control, channel equalization, etc. A novel time series forecasting based on echo state networks and multiplicative seasonal ARIMA model are proposed for this multiperiodic, nonstationary, mobile communication traffic series. Motivated by the fact that the real traffic series exhibits periodicities at the cycle of 6, 12, and 24h, as well as 1week, we isolate most of mentioned above features for each cell and integrate all the wavelet multiresolution sublayers into two parts for consideration of alleviating the accumulated error. On seasonal characters, multiplicative seasonal ARIMA model is to predict the seasonal part, and echo state networks are to deal with the smooth part because of its prominent approximation capabilities and convenience. Experimental results on real traffic dataset show that proposed method performs well on the prediction accuracy.

O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

echo state networks
multiplicative seasonal arima

multiresolution analysis
traffic forecasting
fourier spectrum


compiling issues for supercomputers Accurate and fast methods for computing data dependencies are vital to the efficiency of vectorizing and parallelizing compilers. Program transformations employed by these compilers are effective only if dependencies are computed as accurately as possible. In this paper we consider two issues for supercomputer compilers. First, we discuss in detail exact and inexact tests for computing data dependencies and focus on the linearization scheme. We then discuss a program transformation call loop spreading which allows us to execute in parallel adjacent loops with interloop dependencies.

O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O B O O O O O O O O B O O O O O B O O O O O O O O O O O O O B O O O O O B O O O O B I O O O O O O O O O B O O O O B

dependencies
efficiency
parallel
supercomputer
paper
program transformation
scheme

method
data dependence
computation
parallel compiler
compilation
effect


A Bayesian approach for incorporating expert opinions into decision support systems: A case study of online consumer-satisfaction detection This paper introduces a decision support framework to fuse information sources. Fusing big data with human opinions ensures higher-quality decisions. The paper demonstrates the advantage of the Bayesian machinery for information fusion.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

knowledge fusion
expert system
domain knowledge
classification
bayes
text mining


ON THE SEGMENTATION AND CLASSIFICATION OF HAND RADIOGRAPHS This research is part of a wider project to build predictive models of bone age using hand radiograph images. We examine ways of finding the outline of a hand from an X-ray as the first stage in segmenting the image into constituent bones. We assess a variety of algorithms including contouring, which has not previously been used in this context. We introduce a novel ensemble algorithm for combining outlines using two voting schemes, a likelihood ratio test and dynamic time warping (DTW). Our goal is to minimize the human intervention required, hence we investigate alternative ways of training a classifier to determine whether an outline is in fact correct or not. We evaluate outlining and classification on a set of 1370 images. We conclude that ensembling with DTW improves performance of all outlining algorithms, that the contouring algorithm used with the DTW ensemble performs the best of those assessed, and that the most effective classifier of hand outlines assessed is a random forest applied to outlines transformed into principal components.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hand segmentation
outline classification
outline ensemble


Parameter estimation in batch process using EM algorithm with particle filter This paper investigates a parameter estimation problem for batch processes through the maximum likelihood method. In batch processes, the initial state usually relates to the states of previous batches. The proposed algorithm takes batch-to-batch correlations into account by employing an initial state transition equation to model the dynamics along the batch dimension. By treating the unmeasured states and the parameters as hidden variables, the maximum likelihood estimation is accomplished through the expectation-maximization (EM) algorithm, where the smoothing for the terminal state and the filtering for the initial state are specially considered. Due to the nonlinearity and non-Gaussianity in the state space model, particle filtering methods are employed for the implementation of filtering and smoothing. Through alternating between the expectation step and the maximization step, the unknown parameters along with states are estimated. Simulation examples demonstrate the proposed estimation approach. (C) 2013 Elsevier Ltd. All rights reserved.

B I O B I O B I O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

batch process
parameter estimation
particle filter
em algorithm


Correlated network data publication via differential privacy With the increasing prevalence of information networks, research on privacy-preserving network data publishing has received substantial attention recently. There are two streams of relevant research, targeting different privacy requirements. A large body of existing works focus on preventing node re-identification against adversaries with structural background knowledge, while some other studies aim to thwart edge disclosure. In general, the line of research on preventing edge disclosure is less fruitful, largely due to lack of a formal privacy model. The recent emergence of differential privacy has shown great promise for rigorous prevention of edge disclosure. Yet recent research indicates that differential privacy is vulnerable to data correlation, which hinders its application to network data that may be inherently correlated. In this paper, we show that differential privacy could be tuned to provide provable privacy guarantees even in the correlated setting by introducing an extra parameter, which measures the extent of correlation. We subsequently provide a holistic solution for non-interactive network data publication. First, we generate a private vertex labeling for a given network dataset to make the corresponding adjacency matrix form dense clusters. Next, we adaptively identify dense regions of the adjacency matrix by a data-dependent partitioning process. Finally, we reconstruct a noisy adjacency matrix by a novel use of the exponential mechanism. To our best knowledge, this is the first work providing a practical solution for publishing real-life network data via differential privacy. Extensive experiments demonstrate that our approach performs well on different types of real-life network datasets.

O B I O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O B I O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O

network data
differential privacy
data correlation


TRACKING MULTIPLE PERSONS BASED ON ATTRIBUTED RELATIONAL GRAPH The appearance model is very effective in tracking multiple persons. The main difficulty in tracking persons is to represent appearance reliably and effectively, especially in the presence of occlusions. In this paper, an effective Attributed Relational Graph (ARG) based tracking algorithm is presented to track multiple persons even under occlusions. The appearance of each person is expressed by an ARG model which not only combines color feature with spatial information but also illustrates the relations among body parts. The similarity of ARG models is computed to build a matching matrix in consecutive frames. Four tracking situations are determined according to the matching matrix. In addition, to track persons under occlusions, probabilistic relaxation labeling in the ARG models of body parts is deduced to label occluded persons optimally. Experimental validation of the proposed tracking method is verified and presented on indoor and outdoor sequences.

O O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

appearance model
attributed relational graph
probabilistic relaxation labeling


Tolerance analysis of a product coupling geometric and architectural specifications in a probabilistic approach This article describes tolerance analysis using a reliability-based approach to ensuring that a functional condition is satisfied. A particular feature of this procedure is that it defines the combined effects of geometric and dimensional ISO specifications for product parts, and the architectural parameters that define the relative positions of parts in contact. In the first part, we describe configuring the product parameters by geometric deviations, and from this, a global model is produced to characterise the variation in rotor/stator clearance in a turboshaft engine turbine. This model relies on tolerance zone dimensions, dimensional tolerances and architectural parameters. When clearance is examined using the reliability-based approach, links emerge between the turbines architectural parameters and its geometric and dimensional specifications. Indicators can then be deduced which guide the designer in selecting the optimum turbine architectures.

B I O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

tolerance analysis
probabilistic approach


An E-valuation framework for developing net-enabled business metrics through functionality interaction Managers engaged in net-enabled business planning seek metrics to help them analyze the success of their e-business investments. Likewise, researchers require metrics to build analytical models and conduct empirical research on the impact of e-business strategies on firm performance. In this article, the authors develop a comprehensive E-Valuation Framework for identifying net-enabled applications and their resulting user-based functionalities for activities across the value chain. The authors propose that the real value from net-enabled applications can be found in functionality interactions, where one application enables or enhances functionality in another application. The comprehensive framework can be used to generate three types of metrics managers can use to evaluate their net-enabled strategic initiatives. Further. a classification of net-enabled organizations provides the basis for selecting applications critical to a firm's strategic thrusts. We make use of the resource-based view of the firm and real-options analysis to discuss how successful application deployment is based on the resources and assets the firm possesses as well as managing the rollout of an applications portfolio over time. The framework allows managers to map their organization's net-enabled initiatives into a coherent, easily understood visual representation and provides direction for researchers evaluating the efficacy of net-enabled business strategies.

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

e-valuation framework
net-enabled business strategy
e-metrics
resource-based view
real-options analysis


Influence of the surface roughness of the bottom electrode on the resistive-switching characteristics of Al/Al2O3/Al and Al/Al2O3/W structures fabricated on glass at 300C Bipolar and unipolar resistive switching is observed in MIM structures based on Al2O3. The relationship VFORM>VSET>VRESET was found while the IOFF/ION ratio is around 106. VSET is progressively reduced thus compromising endurance and reliability. The surface roughness of the bottom electrode influences the conduction mechanisms. The low thermal budget used enables integration of these devices into BEOL processing.

O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O


A regeneratable dynamic differential evolution algorithm for neural networks with integer weights Neural networks with integer weights are more suited for embedded systems and hardware implementations than those with real weights. However, many learning algorithms, which have been proposed for training neural networks with float weights, are inefficient and difficult to train for neural networks with integer weights. In this paper, a novel regeneratable dynamic differential evolution algorithm (RDDE) is presented. This algorithm is efficient for training networks with integer weights. In comparison with the conventional differential evolution algorithm (DE), RDDE has introduced three new strategies: (1) A regeneratable strategy is introduced to ensure further evolution, when all the individuals are the same after several iterations such that they cannot evolve further. In other words, there is an escape from the local minima. (2) A dynamic strategy is designed to speed up convergence and simplify the algorithm by updating its population dynamically. (3) A local greedy strategy is introduced to improve local searching ability when the population approaches the global optimal solution. In comparison with other gradient based algorithms, RDDE does not need the gradient information, which has been the main obstacle for training networks with integer weights. The experiment results show that RDDE can train integer-weight networks more efficiently.

O O O B I O O B I O B I B I O B I O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O B I O O O O O O O B I O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

differential evolution
integer weights
neural networks
greedy
embedded systems


Failure mode and effects analysis using intuitionistic fuzzy hybrid TOPSIS approach Failure mode and effects analysis (FMEA) is an effective reliability analysis technique used to identify and evaluate potential failures in systems, products, processes, and/or designs. In traditional FMEA, prioritization of failure modes is carried out by utilizing risk priority numbers (RPNs), which can be acquired by the multiplication of three risk factors: occurrence (O), severity (S) and detection (D). However, there are some inherent deficiencies in the conventional RPN method, which affect its effectiveness and thus limit its applications. In response, this paper introduces a new modified TOPSIS method, named intuitionistic fuzzy hybrid TOPSIS approach, to determine the risk priorities of failure modes identified in FMEA. Moreover, both the subjective and objective weights of risk factors are taken into consideration in the process of risk and failure analysis. A product example of the color super twisted nematic is presented at last to demonstrate the potential applications of the proposed approach, and the merits are highlighted by comparing with some existing methods.

B I I I I O O O O O O B I I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

failure mode and effects analysis
modified topsis


Real-time radiology new concepts for teleradiology We propose two new concepts for teleradiology: real-time radiology and seamless operation of a workstation to view images from both local and remote hospitals. In this paper, we describe an experimental real-time radiology system with a new multimedia diagnostic workstation, which has been established under teleradiology concepts and can be used for cooperative diagnosis by interchanging radiographic images bilaterally in real-time during an audiovisual discussion. The clinical evaluation of real-time radiology using a newly developed diagnostic workstation demonstrated the system to be practical and routinely available to enhance the radiological diagnostic quality of teleradiology.

O O O O O B O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B


Improvement of Learning of Fuzzified Neural Networks for the Chemical Plant Diagnosis Using a Statistic-based Grade Assignment We have proposed a fuzzified neural network based failure diagnosis for chemical plants. The proposed method used the fuzzified neural network which is a kind of standard layered neural networks with fuzzy weights and fuzzy biases. For constructing fuzzy models, time series data from process control systems is modified and used as the training data. In order to use the raw time series data as the training data, a reliability grade is assigned to each input-output pair of the raw time series data. Since the training data plays significant role for the suitability, it is important for our method to assign a reliability grade to every input-output pair of the raw time series data. In this paper, we propose a novel grade assignment method for the fuzzified neural network based failure diagnosis.

O O O O B I I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

chemical plants
fuzzified neural networks

distributed control systems
fault diagnosis
failure detection
plant operation
fuzzy nonlinear regression


Large deviations analysis of the generalized processor sharing policy In this paper we consider a stochastic server (modeling a multiclass communication switch) fed by a set of parallel buffers. The dynamics of the system evolve in discrete-time and the generalized processor sharing (GPS) scheduling policy of [25] is implemented. The arrival process in each buffer is an arbitrary, and possibly autocorrelated, stochastic process. We obtain a large deviations asymptotic for the buffer overflow probability at each buffer. In the standard large deviations methodology, we provide a lower and a matching (up to first degree in the exponent) upper bound on the buffer overflow probabilities. We view the problem of finding a most likely sample path that leads to an overflow as an optimal control problem. Using ideas from convex optimization we analytically solve the control problem to obtain both the asymptotic exponent of the overflow probability and a characterization of most likely modes of overflow. These results have important implications for traffic management of high-speed networks. They extend the deterministic, worst-case analysis of [25] to the case where a detailed statistical model of the input traffic is available and can be used as a basis for an admission control mechanism.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


spinner, using non sequential and contextual functions for early learners Spinner is a media collection, interaction and sharing device for early learners that promotes play and exploration using a novel set of interactive techniques and designs based around a non sequential, contextual physical interface [2] and a graphical user interface (GUI).

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

physical networks
media creation
collaborative systems


A dynamic model of an underwater vehicle with a robotic manipulator using Kane's method Development of a robust autonomous Underwater Robotic Vehicle (URV) is a key element to the exploitation of marine resources. An accurate dynamic model is important for both controller design and mission simulation, regardless of the control strategy employed. In this paper, a dynamic model for an underwater vehicle with an n-axis robot arm is developed based on Kane's method. The technique provides a direct method for incorporating external environmental forces into the model. The model developed in this paper includes four major hydrodynamic forces: added mass, profile drag, fluid acceleration, and buoyancy. The model derived is a closed form solution which can be utilized in modem model-based control schemes.

O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O

underwater robotic vehicle
hydrodynamic forces


Towards the Model Driven Development of context-aware pervasive systems In this work, we introduce a Model Driven Development method for developing context-aware pervasive systems. This method allows us to specify a context-aware pervasive system at a high level of abstraction by means of a set of models, which describes both the system functionality and the context information. From these models, an automated code generation strategy is applied. This strategy allows us to generate the system Java code that provides the system functionality and as well as an OWL specification that represents the context information and allows us to manage this information without additional burden. Furthermore, this specification is used by a reasoner at runtime to infer context knowledge that is not directly observable, and it is also used by machine learning algorithms to give support to the system adaptation according to the context information. (C) 2009 Elsevier B.V. All rights reserved.

O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An efficient algorithm for computing moments on a block representation of a grey-scale image Computing lower order moments is important in image processing. Suppose the input grey image with size N x N has been compressed into the block representation where the number of blocks is K, commonly K < N-2 due to the compression effect. This correspondence presents an efficient algorithm for computing lower order moments on the block representation directly. Our proposed algorithm takes O(K) time which is proportional to the number of blocks. Experimental results reveal the computational advantage of our proposed algorithm. In addition, the results of this paper can be viewed as a generalization of the previous result by Spiliotis and Mertzios for computing lower order moments from the binary image domain to the grey image domain. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

O O O O O O O O B I O O O O O B I I O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O B I O O O O O O O O O O O O O

block representation
grey image
lower order moments


An Adaptive Multi-Range-Sensing Method for 3D Localization of Passive RFID Tags The RFID tag system has received a lot of attention for ubiquitous computing. An RFID tag is attached to an object. With the unique ID of the RFID tag. a user identifies the object provided with the RFID tag and derives appropriate information about the object. One important application in the RFID technology is localizing RFID tags, which can be very useful in acquiring the position information concerning the RFID tags. It can be applied to navigation systems and positional detection systems for mobile robots. This paper proposes a new adaptive multirange-sensing method for 3D localization of passive RFID tags by using a probabilistic approach. In this method, a mobile object (human, robot, etc.) with an RFID reader estimates the positions of RFID tags with multiple communication ranges dynamically. The effectiveness of the proposed method was demonstrated in experiments.

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

rfid (radio frequency identification)
passive rfid tag
transmission power


Identifying an appropriate pedagogy for virtual worlds: A Communal Constructivism case study As increasing numbers of educators explore the use of virtual worlds for education, there is a need to consider which pedagogical approaches can provide an opportunity to do more than recreate the traditional classroom by leveraging the unique characteristics and potential that the technology can offer. This study identifies Communal Constructivism as a potentially appropriate pedagogy for use in the virtual world Second Life Five groups of learners took part in a learning experience specifically designed to provide opportunity for the features of Communal Constructivism to emerge through the affordances of the technology. The chat logs, learning artefacts, post-activity semi-structured interviews and researcher's observations from each of the five groups were analysed to explore participants' experiences and both the operation and outcome of the pedagogy in action Findings from the qualitative analysis of the data sets indicate that learners collaboratively constructed knowledge for themselves as a group and for others, as the features of the pedagogy emerged (C) 2010 Elsevier Ltd All rights reserved

O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

collaborative learning
interactive learning environments
pedagogical issues
teaching/learning strategies


Resource allocation in uplink wireless multi-cell OFDMA networks We propose deterministic and stochastic models for wireless OFDMA networks. We maximize signal to interference noise ratio and total capacity of the system. We derive equivalent mixed integer programs and piecewise linear approximations. We propose a meta-heuristic procedure to obtain near optimal solutions. The numerical results are obtained in significantly less computational cost.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

wireless multi-cell ofdma networks
mixed integer linear programming
mixed integer nonlinear programming
variable neighborhood search


Modelling earthing systems and cables with moment methods Purpose - The purpose of this paper is to present a method to model earthing systems subjected to lightning strikes with a one-dimensional moment method. This paper was conducted because an accurate method to model earthing systems subjected to lightning strikes, was deemed necessary. To name a few examples of relevant situations: supply stations of railway systems, from which also critical signalling infrastructure is fed, earthing systems of cellular phone basestations, located in the vicinity of high-antenna towers, prone to lightning strikes, and gas and oil pipelines. There exist already methods to solve this problem, based on circuit theory, but the electromagnetic method of this work is based directly on Maxwell's equations and therefore more accurate. Design/methodology/approach - The earthing electrodes and meshes are represented as wire scatterers. First, the method is outlined for scatterers in a single medium. Next, the method is extended to model to presence of the soil-air interface layer. An approximate technique, known as the modified image theory, is used to account for the vicinity of the soil. Finally, a second extension is given so that cables without metal sheets which are in the vicinity of the earthing systems, can be included in the model. Thereafter, it is described how the method can be used to calculate the effects of lightning strikes on earthing structures, and finally a validation of the method is presented. Findings - The method is validated by applying it to simple situations which can also analytically be calculated, and by applying it to earthing structures for which the transient voltage was measured or calculated with circuit methods. A good agreement is seen. However, the method is computationally very expensive. Research limitations/implications - In order to account for the influence of the air-ground interface, an approximate method was used: the modified image method, and not the exact Sommerfeld theory. This was done because of its simplicity and in order to speed up the calculation process. Furthermore, cables can be included in the model, but they must be of simple structure: a cylindrical core, surrounded by an insulating cladding. Originality/value - A few authors have already described this method to simulate lightning strikes on earthing systems-However, in this paper, a new and easy model for underground cables in the vicinity of earthing systems is presented.

O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O

method of moments
electromagnetism
electric current
image processing


Failure size proportional models and an analysis of failure detection abilities of software testing strategies This paper combines two distinct areas of research, namely software reliability growth modeling, and efficacy studies on software testing methods. It begins by proposing two software reliability growth models with a new approach to modeling. These models make the basic assumption that the intensity of failure occurrence during the testing phase of a piece of software is proportional to the s-expected probability of selecting a failure-causing input. The first model represents random testing, and the second model represents partition testing. These models provide the s-expected number of failures over a period, which in turn is used in analyzing the failure detection abilities of testing strategies. The specific areas of investigation are conditions that enable partition testing yielding optimal results, and comparison between partition testing and random testing in terms of efficacy.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O B I O O O O

failure regions
majorization
nhpp
schur functions


Gaining insight through case-based explanation Traditional explanation strategies in machine learning have been dominated by rule and decision tree based approaches. Case-based explanations represent an alternative approach which has inherent advantages in terms of transparency and user acceptability. Case-based explanations are based on a strategy of presenting similar past examples in support of and as justification for recommendations made. The traditional approach to such explanations, of simply supplying the nearest neighbour as an explanation, has been found to have shortcomings. Cases should be selected based on their utility in forming useful explanations. However, the relevance of the explanation case may not be clear to the end user as it is retrieved using domain knowledge which they themselves may not have. In this paper the focus is on a knowledge-light approach to case-based explanations that works by selecting cases based on explanation utility and offering insights into the effects of feature-value differences. In this paper we examine to two such a knowledge-light frameworks for case-based explanation. We look at explanation oriented retrieval (EOR) a strategy which explicitly models explanation utility and also at the knowledge-light explanation framework (KLEF) that uses local logistic regression to support case-based explanation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Large nonstationary random responses of shell structures with geometrical and material nonlinearities A novel approach for the prediction of large nonlinear nonstationary random responses of shell structures discretized by the finite element method is presented. It combines: (a) the hybrid-strain-based finite element formulation with emphasis on deformations of finite strains, finite rotations and correct prediction of rigid-body modes; and (b) the stochastic central difference method with time co-ordinate transformation, adaptive time schemes, and the averaged deterministic central difference scheme. The novel approach was applied to a cantilever plate and a spherical cap. The former exhibited stiffness hardening while the latter softening in the large nonlinear range. Computed results for the linear case of the cantilever plate were included for comparison to those previously available in the literature. These results are in excellent agreement. It is concluded that for the first time, a general, accurate and efficient approach, that can deal with systems whose nonlinearities are updated at every time step which is frequently encountered in the updated Lagrangian finite element formulation, is available for the prediction of very large geometrically and materially nonlinear responses of discretized shell structures under strong nonstationary random excitations.

O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O

nonstationary random response
large nonlinear deformations


Robust aspects of solutions in deterministic multiple objective linear programming We study questions of robustness of linear multiple objective problems in the sense of post-optimal analysis, that is, we study conditions under which a given efficient solution remains efficient when the criteria/objective matrix undergoes some alterations. We consider addition or removal of certain criteria, convex combination with another criteria matrix, or small perturbations of its entries. We provide a necessary and sufficient condition for robustness in a verifiable form and give two formulae to compute the radius of robustness.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I

multiple objective linear problem
robust efficient solutions


An augmented Lagrangian optimization method for contact analysis problems, 1: formulation and algorithm A review of existing augmented Lagrangian methods (ALM) for contact analysis problems reveals that they have not been implemented with automatic penalty updates as intended in their original development. Therefore, although the methods are an improvement over the penalty methods, solution with them still depends on the user-specified penalty values for the contact constraints. To overcome this drawback, an ALM is developed and discussed for contact analysis problems that automatically update the user-specified penalty values to obtain the final appropriate values. Further, to solve the frictional contact analysis problem accurately, a two-phase formulation is proposed. Solution of the Phase 1 problem removes penetration of the contacting nodes and brings them exactly to their initial contact points. In addition, a new contact constraint is introduced which allows determination of the precise friction force at the contacting nodes. Phase 2 of the formulation checks the friction conditions and solves the friction problem to bring the structure to an equilibrium state. Phases 1 and 2 are then combined to provide a general algorithm for multi-node frictional contact problems. The two-phase procedure also removes dependence of the contact solution on the number of load steps for the elastostatic problem. Numerical evaluation of the formulation and the algorithm is presented in Part 2 of the paper.

O B I B O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O

frictional contact
optimization
augmented lagrangian
elastostatic


An adjoint-based lattice Boltzmann method for noise control problems In this paper optimal control of acoustic problems is addressed within the lattice Boltzmann method framework. To this end, an adjoint-based lattice Boltzmann method is proposed to solve the adjoint problem. The adjoint state provides an easy access to the optimization gradients. The line search step in Newton's descent method is performed through a combination of complex differentiation and adjoint problem in the lattice Boltzmann method. The implementation of an active noise reduction method for two-dimensional weakly compressible (low Mach number) flows is discussed, and the applicability of the method is assessed.

O O B I I O O O O O O O O O O O O O O O O B I I O O O O O O B I I O O O O O B I O O O O O O O O O B O O O O O O O O O O O O O O O O O O B I O O B I I O O O O B I I O O O O O O O O O O O O O O O O O O O

lattice boltzmann method
adjoint problem
optimization
active noise reduction


MODELING COGNITIVE-DEVELOPMENT ON BALANCE SCALE PHENOMENA We used cascade-correlation to model human cognitive development on a well studied psychological task, the balance scale. In balance scale experiments, the child is asked to predict the outcome of placing certain numbers of equal weights at various distances to the left or right of a fulcrum, Both stage Progressions and information salience effects have been found with children on this task. Cascade-correlation is a generative connectionist algorithm that constructs its own network topology as it learns. Cascade-correlation networks provided better fits to these human data than did previous models, whether rule-based or connectionist. The network model was used to generate a variety of novel predictions for psychological research.

O O O B I O O O O O O O B I O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Global optimal real-time control of the Quebec urban drainage system A global optimal control (GOC) system was implemented in 1999 on the Quebec Urban Community's (QUC) Westerly sewer network to manage flows and water levels in real-time in order to, among others, reduce the frequency and volumes of combined sewer overflows discharged into the St. Charles River and St. Lawrence River. This paper presents some of the salient results of the first three years of operation. The configuration of the GOC system is discussed and operational observations are made about the reliability of some of the major components. Furthermore, an economical analysis presents how cost-effective the real-time control system is for the QUC.

O O O O O O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

combined sewer overflow
real-time control
sewer networks


Hybrid GABF based intelligent PID controller tuning for AVR system This paper deals with hybrid system (GABF) based on the conventional GA (Genetic Algorithm) and BF (Bacterial Foraging) which is the social foraging behavior of bacteria. A variety of test function is introduced and simulated to illustrate the characteristics and performance by mutation, crossover, variation of step size, variation of chemotactic step, and variation of lifetime of bacteria in the proposed hybrid system GABF. The simulated results represent that the proposed method is highly satisfactory. This approach provides us with novel hybrid model based on foraging behavior and also with a possible new connection between evolutionary forces in social foraging and distributed nongradient optimization algorithm design for global optimization over noisy surfaces.

O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bacterial foraging optimization
optimal algorithm


Using the One-vs-One decomposition to improve the performance of class noise filters via an aggregation strategy in multi-class classification problems Noise filters are preprocessing techniques designed to improve data quality in classification tasks by detecting and eliminating examples that contain errors or noise. However, filtering can also remove correct examples and examples containing valuable information, which could be useful for learning. This fact usually implies a margin of improvement on the noise detection accuracy for almost any noise filter. This paper proposes a scheme to improve the performance of noise filters in multi-class classification problems, based on decomposing the dataset into multiple binary subproblems. Decomposition strategies have proven to be successful in improving classification performance in multi-class problems by generating simpler binary subproblems. Similarly, we adapt the principles of the One-vs-One decomposition strategy to noise filtering, making the noise identification process simpler. In order to integrate the filtering results achieved in the binary subproblems, our proposal uses a soft voting approach considering a reliability level based on the aggregation of the noise degree prediction calculated for each binary classifier. The experimental results show that the One-vs-One decomposition strategy usually increases the performance of the noise filters studied, which can detect more accurately the noisy examples.

O O O O O O O O O B I O O O O O O O B O B I O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O

class noise
noise filters
decomposition strategies
classification


Converting OBR-Scolio Ontology in OWL DL We developed the OBR-Scolio ontology that models scoliosis as pathological state of spine using the method of extracting from the FMA reference ontology in anatomical domain and the principal ontology framework of the OBR reference ontology, which is spread over anatomy, physiology and pathology domains. Following the FMA modeling framework, OBR-Scolio ontology initially is created in Prot g using its frame based representation. In order to enable more powerful reasoning support, ontology visualization, and more precise concepts' definition and description, we converted OBR-Scolio in OWL DL language, due to its higher expressiveness. The paper addresses and discusses the key conversion principles, as well as our experience in such conversion, and the results obtained from Racer reasoner.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

medical ontologies
ontology conversion
frame-based representation
description logic


BIOMODULE: a Java program to help model and interpret the stratigraphic record ? A combination of a stratigraphic simulation package (STRATA) and an evolutionary-ecological model (BIOSTRAT) can be used to simulate the distribution of species within a sequence stratigraphic framework. BIOMODULE is an extension of this model approach in that it facilitates the visualization and interpretation of those simulations and their input data. Environmental factors (e.g., sea-level changes or sedimentation rates) and ecological factors (preferred water depth, depth tolerance, abundance) that determine the spatial and temporal distribution of species are easily and quickly investigated. In addition, BIOMODULE can be used to compile the stratigraphic first and last appearances of those species and export them into available graphic correlation software packages (Conop9 and GraphCor). This can be used to test the graphic correlation technique and investigate its accuracy and precision under a range of different conditions (e.g., different stratigraphic architectures and sampling densities) since the true correlation of the different sections is already known.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

biostratigraphy
stratigraphy
computer simulation


Generative embeddings based on Rician mixtures for kernel-based classification of magnetic resonance images Classical approaches to classifier learning for structured objects (such as images or sequences) are based on probabilistic generative models. On the other hand, state-of-the-art classifiers for vectorial data are learned discriminatively. In recent years, these two dual paradigms have been combined via the use of generative embeddings (of which the Fisher kernel is arguably the best known example); these embeddings are mappings from the object space into a fixed dimensional score space, induced by a generative model learned from data, on which a (maybe kernel-based) discriminative approach can then be used. This paper proposes a new semi-parametric approach to build generative embeddings for classification of magnetic resonance images (MRI). Based on the fact that MRI data is well described by Rice distributions, we propose to use Rician mixtures as the underlying generative model, based on which several different generative embeddings are built. These embeddings yield vectorial representations on which kernel-based support vector machines (SVM) can be trained for classification. Concerning the choice of kernel, we adopt the recently proposed nonextensive information theoretic kernels. The methodology proposed was tested on a challenging classification task, which consists in classifying MRI images as belonging to schizophrenic or non-schizophrenic human subjects. The classification is based on a set of regions of interest (ROIs) in each image, with the classifiers corresponding to each ROI being combined via AdaBoost. The experimental results show that the proposed methodology outperforms the previous state-of-the-art methods on the same dataset.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

rician mixture
em algorithm
generative embedding
discriminative learning
information theory
boosting


Modeling generalized cylinders using direction map representation For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in developable surface patches of the cylindrical type. To solve the contour blending problem of generalized cylinder, the presented algorithms have adopted the algorithms and properties of linear interpolation by direction map (LIDM) that interpolate geometric shapes based on direction map merging and group scaling operations. Moreover, we propose an algorithm to develop generated developable surface patches on a plane. Proposed algorithms are fast to compute and easy to implement.

O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O

generalized cylinder
direction map representation
developable surface


Logic-based approach for digital forensic investigation in communication Networks In this paper, we provide a logic for digital investigation of security incidents and its high-level-specification language. The logic is used to prove the existence or non-existence of potential attack scenarios which, if executed on the investigated system, would produce the different forms of specified evidence. To generate executable attack scenarios showing with details how the attack scenario was conducted and how the system behaved accordingly, we develop in this paper a Model Checker tool which provides tolerance to unknown attacks and integrates a technique for hypothetical actions generation

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I

investigation-based temporal logic of actions


Patient registries: useful tools for clinical research in myasthenia gravis Clinical registries may facilitate research on myasthenia gravis (MG) in several ways: as a source of demographic, clinical, biological, and immunological data on large numbers of patients with this rare disease; as a source of referrals for clinical trials; and by allowing rapid identification of MG patients with specific features. Physician-derived registries have the added advantage of incorporating diagnostic and treatment data that may allow comparison of outcomes from different therapeutic approaches, which can be supplemented with patient self-reported data. We report the demographic analysis of MG patients in two large physician-derived registries, the Duke MG Patient Registry, at the Duke University Medical Center, and the INNCB MG Registry, at the Istituto Neurologico Carlo Besta, as a preliminary study to assess the consistency of the two data sets. These registries share a common structure, with an inner core of common data elements (CDE) that facilitate data analysis. The CDEs are concordant with the MG-specific CDEs developed under the National Institute of Neurological Disorders and Stroke Common Data Elements Project.

B I O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O B I I O

myasthenia gravis
patient registries
common data elements


Comparison of PLS algorithms in gasoline and monitoring with MIR and NIR The objective of the present work was to compare different partial least squares algorithms upon mid- and near-infrared data. The applied techniques were single PLS, multiblock PLS and serial PLS. The comparison was made upon values of Q(y)(2) determined in leave one out validation, mean square error of prediction using 80% of the data as calibration set and 20% as validation, and 95% confidence intervals for this parameter. A comparison between regression coefficients for all algorithms was also performed, after selecting the number of latent variables. In order to perform this study, three parameters were used: flash point in gas oil, benzene and research octane number in gasoline. Serial PLS gave the best results in all analysed cases, followed by one single PLS with MIR or NIR. Multiblock PLS gave intermediate results between both single PLS. However, for the studied parameters, the best calibration model was single PLS, since the results were quite accurate and achieved in less time. (c) 2005 Elsevier B.V. All rights reserved.

O O O O O B O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multiblock partial least squares
mid-infrared spectroscopy
near-infrared spectroscopy


A comparison of wavelet and curvelet for breast cancer diagnosis in digital mammogram This paper presents a comparative study between wavelet and curvelet transform for breast cancer diagnosis in digital mammogram. Using multiresolution analysis, mammogram images are decomposed into different resolution levels, which are sensitive to different frequency bands. A set of the biggest coefficients from each decomposition level is extracted. Then a supervised classifier system based on Euclidian distance is constructed. The performance of the classifier is evaluated using a 25-fold cross validation followed by a statistical analysis. The experimental results suggest that curvelet transform outperforms wavelet transform and the difference is statistically significant.

O O O B O B O B I O O B I O O O O O O O B O B O O B I O O B I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O O

wavelet
curvelet
breast cancer
digital mammogram
multiresolution


analyzing change in spatial data by utilizing polygon models Analyzing change in spatial data is critical for many applications including developing early warning systems that monitor environmental conditions, epidemiology, crime monitoring, and automatic surveillance. In this paper, we present a framework for the detection and analysis of patterns of change; the framework analyzes change by comparing sets of polygons. A contour clustering algorithm is utilized to obtain polygon models from spatial datasets. A set of change predicates is introduced to analyze changes between different models which capture various types of changes, such as novel concepts, concept drift, and concept disappearance. We evaluate our framework in case studies that center on ozone pollution monitoring, and on diagnosing glaucoma from visual field analysis.

O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O

novelty detection
change analysis
spatial data mining
density-based clustering


a new environment for teaching introductory computer science In 1973, a great amount of frustration was being vented about student inability to formulate and solve problems on a computer; at that time, a suggestion was made to separate problem solving from programmingto make problem solving language independent [1]. This approach was acknowledged in 1978 as one of four common methods of teaching college-level introductory computer science [2]. Finally, in 1981 and 1982, this method, or a variant of it, was widely proclaimed [3] [4] [5]. We adopted this approach of instruction in our introductory course in 1977 and the results have been less than spectacular. We don't make this point to discredit the approach; its existence has made manifest the necessity of teaching problem solving in an introductory course. Rather, we believe that the added teaching of a separate problem solving methodology is not by itself sufficient.

O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O B I O O O O O O O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O B O O O O O

computer science
instruction
teaching
point
method
methodology
language


A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation Harmonic estimation for a signal distorted with additive noise has been an area of interest for researchers in many disciplines of science and engineering. This paper presents a new algorithm based on the foraging behavior of E. coli bacteria in our intestine to estimate the harmonic components present in power system voltage/current waveforms. The basic foraging strategy is made adaptive, through a Takagi-Sugeno fuzzy scheme, depending on the operating condition to make the convergence faster. Besides, the harmonic estimation is linear in amplitude and nonlinear in phase. As the proposed algorithm does not rely on Newton-like gradient descent methods, this is used for phase estimation whereas the linear least square scheme estimates the amplitude, thereby presenting the hybrid method. The improvement in % error, as well as the processing time compared with the conventional discrete Fourier transform and genetic algorithm method is demonstrated in this paper. Besides, the performance is quite acceptable even in the presence of decaying dc component as well as to change in amplitude and phase angle of harmonic components.

O O O O B I O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bacterial foraging
harmonic estimation
least square

cost function
discrete fourier transform (dft)
genetic algorithm (ga)


MNPP: Mobile Network Prefix Provisioning for Enabling Route Optimization in Geographic Vehicular Networks Recent advances in the development of wireless vehicular networks have become a cornerstone of Intelligent Transportation Systems (ITS). Vehicles support network mobility (NEMO) can establish IPv6 data communications. However, due to characteristics of NEMO, data packets destined for equipments in an in-vehicle network of a vehicle are not optimally transmitted to the vehicle equipments, e.g., arising of sub-optimal routing. In this paper, we introduce a mechanism for route optimization (RO) developed as part of the GeoNet project. The mechanism named as Mobile Network Prefix Provisioning (MNPP) enables a vehicle to provision its mobile network prefix (MNP) assigned to its equipments to neighbor vehicles so that the neighbor vehicles are able to send data packets directly to the equipments of the vehicle. Thanks to the direct communication between two vehicles, the packet delivery cost is significantly minimized.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Adaptive genetic operators based on coevolution with fuzzy behaviors This paper presents a technique for adapting control parameter settings associated with genetic operators. Its principal features are: I) the adaptation takes place at the individual level by means of fuzzy logic controllers (FLCs) and 2) the fuzzy rule bases used by the FLCs come from a separate genetic algorithm (GA) that coevolves with the GA that applies the genetic operator to be controlled. The goal is to obtain fuzzy rule bases that produce suitable control parameter values for allowing the genetic operator to show an adequate performance on the particular problem to be solved. The empirical study of an instance of the technique has shown that it adapts the parameter settings according to the particularities of the search space allowing significant performance to be achieved for problems with different difficulties.

O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Modeling the three-dimensional structures of an unbound single-chain variable fragment (scFv) and its hypothetical complex with a Corynespora cassiicola toxin, cassiicolin Rubber trees infected with a host-specific cassiicolin toxin often experience considerable leaf fall, which in turn results in loss of crop productivity. It was recently revealed that cassiicolin-specific single-chain variable fragments (scFv) can successfully reduce the toxic effects of cassiicolin. However, the detailed mechanism of antibody action remains poorly understood. The primary sequence of the newly sequenced cassiicolin-specific scFv was highly homologous to several members of single-chain antibodies in the 14B7 family. In this study, with the aid of homology modeling, the three-dimensional structure of cassiicolin-specific scFv was elucidated, and was found to exhibit a characteristic immunoglobulin fold that mainly consists of beta sheets. Additionally, molecular docking between the modeled scFv antibody and the available three-dimensional crystal structure of cassiicolin toxin was also performed. The predicted structural complex and the change in accessible surface area between the toxin and the scFv antibody upon complexation reveal the potential role of certain complementarity determining region (CDR) amino acid residues in the formation of the complex. These computational results suggest that mutagenesis experiments that are aimed at validating the model and improving the binding affinity of cassiicolin-specific scFv antibodies for the toxin should be performed.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cassiicolin-specific scfv antibody
protein-protein docking
antibody-antigen interaction


Dynamics of a circular membrane with an eccentric circular areal constraint: Analysis and accurate simulations The dynamics of a circular membrane with an eccentric circular areal constraint is studied under arbitrary initial conditions. The symmetric and antisymmetric modes of vibrations are investigated and the results are compared with those in the literature. The accuracy of the eigenfrequencies and mode shapes are studied for different sizes and locations of the constraint and it is shown that proper choice of the number of angular modes is critical to accurate computation of the mode shapes; fewer or more number of angular modes can provide relatively accurate eigenfrequencies but completely inaccurate mode shapes. The orthogonality of distinct modes of constrained membranes is mathematically established in this work. The orthogonality property of the modes is used to compute the modal coefficients for simulation of the dynamics. In comparison to prior work, where the objective has been limited to computing the first few eigenfrequencies, this work presents a method for accurately computing the eigenfrequencies, mode shapes, and modal coefficients needed for dynamics simulation. Numerical simulations and video animations of vibration of constrained membranes are presented for arbitrary initial conditions.

O O O B I O O O O O O O O O B O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O B O O O O O O O O O

circular membrane
orthogonality
vibration
accuracy
simulations
animations


Universal routing schemes In this paper, we deal with the compact routing problem, that is implementing routing schemes that use a minimum memory size on each router. A universal routing scheme is a scheme that applies to all n-node networks. In [31], Peleg and Upfal showed that one cannot implement a universal routing scheme with less than a total of Omega(n(1+1/(2s+4))) memory bits for any given stretch factor s greater than or equal to 1. We improve this bound for stretch factors s, 1 less than or equal to s <2, by proving that any near-shortest path universal routing scheme uses a total of Omega(n(2)) memory bits in the worst-case. This result is obtained by counting the minimum number of routing functions necessary to route on all n-node networks. Moreover, and more fundamentally, we give a tight bound of Theta(nlogn) bits for the local minimum memory requirement of universal routing scheme of stretch factors s, 1 less than or equal to s <2. More precisely, for any fixed constant epsilon, 0 <epsilon <1, there exists a n-node network G on which at least Omega(n(epsilon)) routers require Theta(n log n) bits each to code any routing function on G of stretch factor <2. This means that, whatever you choose the routing scheme, there exists a network on which one cannot compress locally the routing information better than routing tables do.

O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

universal routing schemes
implementation


Objective weights with intuitionistic fuzzy entropy measures and computational experiment analysis It is important to properly assess the weights of attributes when solving multi-attribute decision problems because variations in the weights often influence the rankings of the alternatives. In this paper, we propose an alternative objective weighting method to generate objective weights based on intuitionistic fuzzy (IF) entropy measures, which depend on the nature of a decision matrix in an intuitionistic fuzzy environment. Instead of the traditional fuzzy entropy measure, which is characterized by using the discriminating power to calculate the attribute weights, the proposed approach adopts the IF entropy measure, which emphasizes the credibility of the data. The IF entropy measure applied here is derived from a geometric interpretation of intuitionistic fuzzy sets and incorporates the concept of a ratio of distance measures. We implement four distance measures in the proposed approach and compare them in a computational experiment. The experimental results indicate that different IF entropy measures used in weighting methods can generate distinct objective attribute weights. In particular, when the number of attributes increases, the discrepancy between the IF entropy measures increases.

O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

intuitionistic fuzzy entropy
computational experiment

multi-attribute decision
intuitionistic fuzzy set
objective weight


memory access patterns of parallel scientific programs A parallel simulator, PSIMUL, has been used to collect information on the memory access patterns and synchronization overheads of several scientific applications. The parallel simulation method we use is very efficient and it allows us to simulate execution of an entire application program, amounting to hundreds of millions of instructions. We present our measurements on the memory access characteristics of these applications; particularly our observations on shared and private data, their frequency of access and locality. We have found that, even though the shared data comprise the largest portion of the data in the application program, on the average a small fraction of the memory references are to shared data. The low averages do not preclude bursts of traffic to shared memory nor does it rule out positive benefits from caching shared data. We also discuss issues of synchronization overheads and their effect on performance.

O B O O B O O O B O O O O O O B O O O O B O O B O O O O B O B B B O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O B O O O O O O O B O O O B O B O O O O O O O O B O O O O O O B O O O B O O O O O O O O O O O O O B O O O O O O O O B O B I O O O O O O O O O O B O O O O O B O O O B O B

applications
use
simulation
synchronization
performance
collect
access
traffic
locality
program
shared memory
method
parallel
data
effect

measurement
efficiency
parallel simulation
informal
pattern
posit
sharing
observability
instruction
memorialized
caches


Non-parametric smoothing of the location model in mixed variable discrimination The location model is a familiar basis for discriminant analysis of mixtures of categorical and continuous variables. Its usual implementation involves second-order smoothing, using multivariate regression for the continuous variables and log-linear models for the categorical variables. In spite of the smoothing, these procedures still require many parameters to be estimated and this in turn restricts the categorical variables to a small number if implementation is to be feasible. In this paper we propose non-parametric smoothing procedures for both parts of the model. The number of parameters to be estimated is dramatically reduced and the range of applicability thereby greatly increased. The methods are illustrated on several data sets, and the performances are compared with a range of other popular discrimination techniques. The proposed method compares very favourably with all its competitors.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mixed integer programming classification


large scale multi-label classification via metalabeler The explosion of online content has made the management of such content non-trivial. Web-related tasks such as web page categorization, news filtering, query categorization, tag recommendation, etc. often involve the construction of multi-label categorization systems on a large scale. Existing multi-label classification methods either do not scale or have unsatisfactory performance. In this work, we propose MetaLabeler to automatically determine the relevant set of labels for each instance without intensive human involvement or expensive cross-validation. Extensive experiments conducted on benchmark data show that the MetaLabeler tends to outperform existing methods. Moreover, MetaLabeler scales to millions of multi-labeled instances and can be deployed easily. This enables us to apply the MetaLabeler to a large scale query categorization problem in Yahoo!, yielding a significant improvement in performance.

B I O O O B O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O B O O B I B I O O O O O O O O O

query categorization
metalabeler
large scale

hierarchical classification
meta model
multi-label classification


About a new family of multidistances In this paper the family of multi-argument functions called multidistances is considered, which have recently been introduced in some recent papers by J. Martin and G. Mayor. These refer to n-dimensional ordered lists of elements and extend the usual concept of distance between a couple of points in a metric space. In particular Martin and Mayor investigate three classes of multidistances, namely Fermat, sum-based and OWA-based multidistances. In this note we start by focusing on a specific property of multidistances, i.e. regularity, and alternative proof of the regularity of the sum-based multidistances is provided. Secondly a new family of multidistance functions are introduced, which are a generalization of the sum-based multidistances and which we call arithmetic geometric multidistances. (C) 2011 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O

sum-based multidistances
arithmetic-geometric multidistances


A relevance feedback image retrieval scheme using multi-instance and pseudo image concepts Content-based image search has long been considered a difficult task. Making correct conjectures on the user intention (perception) based on the query images is a critical step in the content-based search. One key concept in this paper is how we find the user preferred low-level image characteristics from the multiple positive samples provided by the user. The second key concept is how we generate a set of consistent "pseudo images" when the user does not provide a sufficient number of samples. The notion of image feature stability is thus introduced. The third key concept is how we use negative images as pruning criterion. In realizing the preceding concepts, an image search scheme is developed using the weighted lowlevel image features. At the end, quantitative simulation results are used to show the effectiveness of these concepts.

O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A FPGA-BASED RECONFIGURABLE PARALLEL ARCHITECTURE FOR HIGH-PERFORMANCE NUMERICAL COMPUTATION Many real-world engineering problems require high computational power, especially regarding the processing time. Current parallel processing techniques play an important role in reducing the processing time. Recently, reconfigurable computation has gained large attention thanks to its ability to combine hardware performance and software flexibility. Also, the availability of high-density Field Programmable Gate Array devices and corresponding development systems allowed the popularization of reconfigurable computation, encouraging the development of very complex, compact, and powerful systems for custom applications. This work presents an architecture for parallel reconfigurable computation based on the dataflow concept. This architecture allows reconfigurability of the system for many problems and, particularly, for numerical computation. Several experiments were done analyzing the scalability of the architecture, as well as comparing its performance with other approaches. Overall results are relevant and promising. The developed architecture has performance and scalability suited for engineering problems that demand intensive numerical computation.

O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computer architecture
reconfigurable computing


Scheduling transactions with stringent real-time constraints Many real-time database systems (RTDBS) are used to support mission-critical applications such as avionics control systems and defense systems, in which transactions have stringent real-time constraints. In these hard real-time systems, a transaction missing its deadline could lead to catastrophic consequences. The difficulties of providing a guarantee of meeting transaction deadlines in hard RTDBS lie in the problems of priority inversion and deadlocks. The transaction blocking delay due to priority inversion can be unbounded, which is unacceptable in most hard RTDBS. Several priority ceiling protocols have: been proposed to solve these two problems. However, they are too conservative in scheduling transactions for the single-blocking and deadlock-free properties, leading to many unnecessary transaction blockings. The main reason for their conservatism is their implicit assumption that if a transaction's operation conflicts with that of another executing transaction, it is presumably unable to preempt the conflicting transaction. In this paper, we propose a new priority ceiling protocol that allows a higher priority transaction to preempt a lower priority transaction on data conflicts by using the notion of dynamic adjustment of serialization order. We devise a worst-case schedulability analysis for the new protocol which provides a better schedulability condition compared to other protocols. The simulation results show that the new priority ceiling protocol outperforms other protocols. (C) 2000 Published by Elsevier Science Ltd.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

priority ceiling protocols
database systems

concurrency control
transaction scheduling
real-time systems


A discrete mixture-based kernel for SVMs: Application to spam and image categorization In this paper, we investigate the problem of training support vector machines (SVMs) on count data. Multinomial Dirichlet mixture models allow us to model efficiently count data. On the other hand, SVMs permit good discrimination. We propose, then, a hybrid model that appropriately combines their advantages. Finite mixture models are introduced, as an SVM kernel, to incorporate prior knowledge about the nature of data involved in the problem at hand. For the learning of our mixture model, we propose a deterministic annealing component-wise EM algorithm mixed with a minimum description length type criterion. In the context of this model, we compare different kernels. Through some applications involving spam and image database categorization, we find that our data-driven kernel performs better.

O O O O O O O O B O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B O O O O O O O O O O O O O O O O O O B O O O O B O B I O O O O O O O O O

svm
kernels
multinomial dirichlet
finite mixture models
em
deterministic annealing
spam
image database


Tilings of Convex Polygons with Congruent Triangles By the spectrum of a polygon A we mean the set of triples (alpha,beta,gamma) such that A can be dissected into congruent triangles of angles alpha,beta,gamma. We propose a technique for finding the spectrum of every convex polygon. Our method is based on the following classification. A tiling is called regular if there are two angles of the triangles, alpha and beta such that at every vertex of the tiling the number of triangles having angle alpha equals the number of triangles having angle beta. Otherwise the tiling is irregular. We list all pairs (A,T) such that A is a convex polygon and T is a triangle that tiles A regularly. The list of triangles tiling A irregularly is always finite, and can be obtained, at least in principle, by considering the system of equations satisfied by the angles, examining the conjugate tilings, and comparing the sides and the area of the triangles to those of A. Using this method we characterize the convex polygons with infinite spectrum, and determine the spectrum of the regular triangle, the square, all rectangles, and the regular N-gons with N large enough.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

tilings with congruent triangles
regular and irregular tilings


Three-dimensional control-volume distributed multi-point flux approximation coupled with a lower-dimensional surface fracture model A novel cell-centred control-volume distributed multi-point flux approximation (CVD-MPFA) finite-volume formulation is presented for discrete fracturematrix simulations on unstructured grids in three-dimensions (3D). The grid is aligned with fractures and barriers which are then modelled as lower-dimensional surface interfaces located between the matrix cells in the physical domain. The three-dimensional pressure equation is solved in the matrix domain coupled with a two-dimensional (2D) surface pressure equation solved over fracture networks via a novel surface CVD-MPFA formulation. The CVD-MPFA formulation naturally handles fractures with anisotropic permeabilities on unstructured grids. Matrixfracture fluxes are expressed in terms of matrix and fracture pressures and define the transfer function, which is added to the lower-dimensional flow equation and couples the three-dimensional and surface systems. An additional transmission condition is used between matrix cells adjacent to low permeable fractures to couple the velocity and pressure jump across the fractures. Convergence and accuracy of the lower-dimensional fracture model is assessed for highly anisotropic fractures having a range of apertures and permeability tensors. A transport equation for tracer flow is coupled via the Darcy flux for single and intersecting fractures. The lower-dimensional approximation for intersecting fractures avoids the more restrictive CFL condition corresponding to the equi-dimensional approximation with explicit time discretisation. Lower-dimensional fracture model results are compared with equi-dimensional model results. Fractures and barriers are efficiently modelled by lower-dimensional interfaces which yield comparable results to those of the equi-dimensional model. Pressure continuity is built into the model across highly conductive fractures, leading to reduced local degrees of freedom in the CVD-MPFA approximation. The formulation is applied to geologically complex fracture networks in three-dimensions. The effects of the fracture permeability, aperture and grid resolution are also assessed with respect to convergence and computational cost.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

three-dimensions
cvd-mpfa
fracture network
lower-dimensional
fracture matrix transfer


A uniform approach for programming distributed heterogeneous computing systems libWater programming model, which extends OpenCL with a simplified interface. A lightweight distributed runtime system based on asynchronous command execution. A powerful representation that collects and arranges dependencies between commands. Dynamic Collective Replacement and Device-Host-Device Copy Removal optimizations. A study of the performance of the library on three compute clusters.

O O O O O O B I O O B I O O B O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

opencl
heterogeneous computing
programming model
runtime system


Supporting the application of Situated Cellular Agents in non-uniform spaces The paper presents Situated Cellular Agents (SCA), systems of reactive agents that are heterogeneous and populate a structured environment. The structure of this environment is defined as a non-uniform network of sites in which agents are situated. The behavior of SCA agents (i.e. change of state and position) is influenced by states and types of agents that are situated in adjacent and at-a-distance sites. After an outline of SCA approach and its main applications, the paper introduces an ongoing project to develop a tool to support the development and execution of SCA applications.

O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multi agent systems
mas-based modelling
development environment


A new geometric descriptor for symbols with affine deformations ? We propose a new geometric invariant (CHAR) robust to affine deformation. We propose a new feature descriptor (CHARS) for shape matching. CHARS is more informative to the shapes with rich structures. Experiments under different affine parameters show the robustness of our method. Experiments on similar symbols show good discrimination of our method.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

shape descriptor
affine invariants
symbol recognition
characteristic ratio


Children's Internet information seeking, life satisfaction, and loneliness: The mediating and moderating role of self-esteem This study investigated the longitudinal associations between children's Internet information seeking, life satisfaction, and feelings of loneliness as well as the mediating and moderating role of self-esteem in these associations. A total of 455 Chinese elementary school students participated in two waves of a survey with a 6-month interval, and 19 of these students participated in focus group interviews. The results indicated that seeking school- and life-related information on the Internet predicted more life satisfaction and less loneliness through improved self-esteem. Furthermore, self-esteem moderated the effects of Internet information seeking on loneliness. Internet information seeking predicted less loneliness only for children with low self-esteem. A moderating role of self-esteem in the associations between Internet information seeking and life satisfaction was not found in this study. (C) 2013 Elsevier Ltd. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

media in education
elementary education
pedagogical issues


Structuring the modeling space and supporting evolution in software product line engineering The scale and complexity of product lines means that it is practically infeasible to develop a single model of the entire system, regardless of the languages or notations used. The dynamic nature of real-world systems means that product line models need to evolve continuously to meet new customer requirements and to reflect changes of product line artifacts. To address these challenges, product line engineers need to apply different strategies for structuring the modeling space to ease the creation and maintenance of models. This paper presents an approach that aims at reducing the maintenance effort by organizing product lines as a set of interrelated model fragments defining the variability of particular parts of the system. We provide support to semi-automatically merge fragments into complete product line models. We also provide support to automatically detect inconsistencies between product line artifacts and the models representing these artifacts after changes. Furthermore, our approach supports the co-evolution of models and their respective meta-models. We discuss strategies for structuring the modeling space and show the usefulness of our approach using real-world examples from our ongoing industry collaboration.

O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Modality independent elastography (MIE): A new approach to elasticity imaging The correlation between tissue stiffness and health is an accepted form of organ disease assessment. As a result, there has been a significant amount of interest in developing methods to image elasticity parameters (i.e., elastography). The modality independent elastography (MIE) method combines a nonlinear optimization framework, computer models of soft-tissue deformation, and standard measures of image similarity to reconstruct elastic property distributions within soft tissue. In this paper, simulation results demonstrate successful elasticity image reconstructions in breast cross-sectional images acquired from magnetic resonance (MR) imaging. Results from phantom experiments illustrate its modality independence by reconstructing elasticity images of the same phantom in both MR and computed tomographic imaging units. Additional results regarding the performance of a new multigrid strategy to MIE and the implementation of a parallel architecture are also presented.

O O B O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B O O O B O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

elasticity
elastography
image similarity
soft tissue
stiffness

breast cancer
image registration
inverse problem
mutual information
young's modulus


Uniqueness of meromorphic functions and differential polynomials In this paper, we study the uniqueness theorem of meromorphic functions concerning differential polynomials, and obtain two theorems, which improve and generalize the related results of Fang, S.S. Bhoosnurmath and R.S. Dyavanal and Xiao-Yu Zhang and Wei-Chuan Lin.

B O O O O B I O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O

meromorphic function
entire function
share values