Object-oriented subspace analysis for airborne hyperspectral remote sensing imagery An object-oriented mapping approach based on subspace analysis of airborne hyperspectral images was investigated in this paper. Hyperspectral features were extracted based on subspace learning approaches, in order to reduce the redundancy of spectral space and extract the characteristic images for the further object-oriented classification. In this paper, three kinds of spectral feature extraction (FE) methods were utilized to obtain the subspace of airborne hyperspectral data: (1) unsupervised FE, such as PCA (principal component analysis), ICA (independent component analysis) and MNF (maximum noise fraction); (2) supervised FE, e.g. DBFE (decision boundary feature extraction), DAFE (discriminant analysis feature extraction) and NWFE (nonparametric weighted feature extraction); and (3) linear mixture analysis. Afterwards, the extracted subspace features were fed into the object-based classification system. The FNEA (fractal net evolution approach) was utilized to extract objects from the subspace images and SVM (support vector machines) was then used to classify the object-based features. Experiments were conducted on two airborne hyperspectral datasets: (1) the AVIRIS dataset over the northwest Indiana's Pine with 220 spectral bands (agricultural region), and (2) the ROSIS dataset over Pavia University, northern of Italy with 102 spectral bands (urban region). Results revealed that the proposed object-based approach could give significantly higher accuracies than the traditional pixel-based subspace classification.

O B I O O O O O O O O O O O O B 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hyperspectral images
subspace analysis
feature extraction


Reynolds stress modelling of jet and swirl interaction inside a gas turbine combustor Influences of the inlet swirl levels on the interaction between the dilution air jets and the swirling cross-flow to the interior flow field inside a gas turbine combustor were investigated numerically by Reynolds stress transport model (RSTM). Due to the intense swirl and jet interaction, a high level of swirl momentum is transported to the centreline and hence, an intense vortex core is formed. The strength of the centreline vortex core was found to depend on the inlet swirl levers. For the higher swirling inlet, the decay of the swirling motion causes strong streamline variation of pressure; and consequently leads to an elevated level of deceleration of its axial velocity. Predictions contrasted with measurements indicate that the stress model reproduces the flow correctly and is able to reflect the influences of inlet swirl levels on the interior flow structure. Copyright (C) 1999 John Wiley & Sons, Ltd.

O O O O O O B 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 B I I O O O O O O O O O O O O O B 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 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 O O O O O O O O O O O O

three-dimensional flow
turbulence modelling
incompressible fluid


arbitrary viewpoint image synthesis for real-time processing system using multiple image sensors We have studied arbitrary viewpoint image synthesis using multiple sensors based on image-based rendering, in which the depth estimation is required for generating precise virtual images. Major problems in this estimation process include the increase of computational efforts and the decrease in performance for occluded regions. To solve these difficulties, we improve our depth estimation process by using the multi-resolution method and by weighting similar pixels to the target pixel in the block matching. Furthermore, we incorporate the proposed method to our prototype hardware system using the CMOS image sensors we have originally developed. Experimental results show that our proposed method and prototype system are efficient and effective compared to the previous work and that arbitrary viewpoint images are synthesized favorably.

B I I 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

fpga
cmos image sensor
object shape estimation
real-time synthesis


Intelligent backstepping control for wheeled inverted pendulum The adaptive output recurrent cerebellar model articulation control (AORCMAC) is an adaptive system with simple computation, good generalization capability and fast learning property. The proposed AORCMAC has superior capability to the conventional cerebellar model articulation controller (CMAC) in efficient learning mechanism and dynamic response. In this study, an intelligent backstepping tracking control system is proposed for wheeled inverted pendulums (WIPs) with unknown system dynamics and external disturbance. In this control system, an ABORCMAC is used to copy an ideal backstepping control (IBC), and a compensated controller is designed to compensate for difference between the IBC law and AORCMAC. Moreover, all adaptation laws of the proposed system are derived based on the Lyapunov stability analysis, the Taylor linearization technique, so that the stability of the closed-loop system can be guaranteed.

O O O O B I I O O B I 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 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


Situated robot learning for multi-modal instruction and imitation of grasping A key prerequisite to make user instruction of work tasks by interactive demonstration effective and convenient is situated multi-modal interaction aiming at an enhancement of robot learning beyond simple low-level skill acquisition. We report the status of the Bielefeld GRAVIS-robot system that combines visual attention and gestural instruction with an intelligent interface for speech recognition and linguistic interpretation to allow multi-modal task-oriented instructions. With respect to this platform, we discuss the essential role of learning for robust functioning of the robot and sketch the concept of an integrated architecture for situated learning on the system level. It has the long-term goal to demonstrate speech-supported imitation learning of robot actions. We describe the current state of its realization to enable imitation of human hand postures for flexible grasping and give quantitative results for grasping a broad range of everyday objects.

O O B O O O O B O B 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 O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O O O O O O O B B 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 B O O O O O O

interactive demonstration
imitation
learning
architecture
grasping


Pareto-based evolutionary computational approach for wireless sensor placement Wireless sensor networks (WSNs) have become increasingly appealing in recent years for the purpose of data acquisition, surveillance, event monitoring, etc. Optimal positioning of wireless sensor nodes is an important issue for small networks of relatively expensive sensing devices. For such networks, the placement problem requires that multiple objectives be met. These objectives are usually conflicting, e.g. achieving maximum coverage and maximum connectivity while minimizing the network energy cost. A flexible algorithm for sensor placement (FLEX) is presented that uses an evolutionary computational approach to solve this multiobjective sensor placement optimization problem when the number of sensor nodes is not fixed and the maximum number of nodes is not known a priori. FLEX starts with an initial population of simple WSNs and complexifies their topologies over generations. It keeps track of new genes through historical markings, which are used in later generations to assess two networks compatibility and also to align genes during crossover. It uses Pareto-dominance to approach Pareto-optimal layouts with respect to the objectives. Speciation is employed to aid the survival of gene innovations and facilitate networks to compete with similar networks. Elitism ensures that the best solutions are carried over to the next generation. The flexibility of the algorithm is illustrated by solving the device/node placement problem for different applications like facility surveillance, coverage with and without obstacles, preferential surveillance, and forming a clustering hierarchy.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

wireless sensor network
optimal node placement
multiobjective optimization


Converse duality in nonlinear programming with cone constraints The purpose of this paper is to establish various converse duality results for nonlinear programming with cone constraints and its four dual models introduced by Chandra and Abha [S. Chandra, Abha, A note on pseudo-invex and duality in nonlinear programming, European Journal of Operational Research 122 (2000) 161165].

B I O B I O O O O O O O O O O O O B 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 B I O O O O O O O O


Asymptotic results for batch-variance methods in simulation output analysis We consider the hatching methods for estimating the variance of the sample variance based on steady-state correlated data. Intensive research has been devoted to the problem of estimating the variance of the sample, mean, but little to the sample variance when the desired performance measure is the population variance. The batch-variance estimator (for the variance of the sample variance) is a function of the batch variances. which are the sample variances of the hatched data. By viewing the sample variance as a sample mean of squared terms. we show that the asymptotic results for the batch-variance and batch-mean estimators are analogous in two ways. First. both. have the same convergence rates. Second, whether batch means or batch variances are employed, a single rule applies to both multipliers in the asymptotic formula. The constant multipliers are the same. and the other multipliers depend on the data properties, which are analogous for batch variances and batch means with squared terms. We prove these results analytically for the nonoverlapping batch-variance method and argue that they can be extended to cover the overlapping batch-variance method. (C) 2004 Elsevier Ltd. All rights reserved.

O O O O O O B I 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 B I 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 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 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 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

batch means
batch variances
sample variance
simulation output analysis


a context-aware approach based on self-organizing maps to study web-users' tendencies from their behaviour In the context of a highly volatile web of uneven quality, the identification of content deemed valuable by end users is of paramount importance. Where page content undergoes rapid change, this issue is particularly challenging. Web browsing activity represents a unique source of context by which the value of web pages can be determined via an assessment of individual user interactions, such as scrolling, clicking, saving and so forth. Over time, this data set forms a pattern of activity which can be mined for meaning. In this paper we present an approach to web content, based on Kohonen mapping, used to generate a topological model of users' behaviour over web-pages. Each web-document can thus be represented as a semantic map built by adopting unsupervised techniques where similar users' behaviour are mapped close together, with identification of information stability emerging as a by product of the identification of similarity in user activity over content. In this model, the more similar the outputs of the map for each user who has endorsed a web-page, the more the web site is considered current or in context with changing information. We illustrate the potential application of this approach to our ongoing work in social search.

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 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 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 B 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

self-organizing map
distributed systems
kohonen maps
context-awareness
computational trust


A linear time algorithm for computing a most reliable source on a tree network with faulty nodes Given an unreliable communication network, we seek for a node which maximizes the expected number of nodes that are reachable from it. Such a node is called a most reliable source (MRS) of the network. In communication networks, failures may occur to both links and nodes. Previous studies have considered the case where each link has an independent operational probability, while the nodes are immune to failures. In practice, however, failures may happen to the nodes as well, including both transmitting fault and receiving fault. Recently, another variant of the MRS problem is studied, where all links are immune to failures and each node has an independent transmitting probability and receiving probability, and an O(n(2)) time algorithm is presented for computing an MRS on tree networks with n nodes. In this paper, we present a faster algorithm for this problem, with a time complexity of O(n). (C) 2010 Published by Elsevier BM.

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 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 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

most reliable source
transmitting probability
receiving probability


Controllable adiabatic manipulation of the qubit state We propose a scheme which implements a controllable change of the state of the target spin qubit in such a way that both the control and the target spin qubits remain in their ground states. The interaction between the two spins is mediated by an auxiliary spin, which can transfer to its excited state. Our scheme suggests a possible relationship between the gate and adiabatic quantum computation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


A new bidirectional heteroassociative memory encompassing correlational, competitive and topological properties In this paper, we present a new recurrent bidirectional model that encompasses correlational, competitive and topological model properties. The simultaneous use of many classes of network behaviors allows for the unsupervised learning/categorization of perceptual patterns (through input compression) and the concurrent encoding of proximities in a multidimensional space. All of these operations are achieved within a common learning operation, and using a single set of defining properties. It is shown that the model can learn categories by developing prototype representations strictly from exposition to specific exemplars. Moreover, because the model is recurrent, it can reconstruct perfect outputs from incomplete and noisy patterns. Empirical exploration of the models properties and performance shows that its ability for adequate clustering stems from: (1) properly distributing connection weights, and (2) producing a weight space with a low dispersion level (or higher density). In addition, since the model uses a sparse representation (k k -winners), the size of topological neighborhood can be fixed, and no longer requires a decrease through time as was the case with classic self-organizing feature maps. Since the models learning and transmission parameters are independent from learning trials, the model can develop stable fixed points in a constrained topological architecture, while being flexible enough to learn novel patterns.

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 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

bidirectional heteroassociative memory
topological architecture

competitive learning
unsupervised learning
categorization
self-organizing map


a service re-design methodology for multi-channel adaptation Many available services have been designed for a single-channel world, Web and Internet typically. In a real world scenario, an ever-growing number of users take advantage of different kinds of communication channels and devices. In this paper, we propose a methodology to formalize the re-design process of these services to support multi-channel access in different contexts. The methodology considers the channel characteristics, the location of users and the context of use to characterize the new services. It has been tested in a case study: the Italian National Project of Identification and Registration of Bovine Animals.

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 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 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

location awareness
multi-channel application
qualities of services
service re-design


Value-at-Risk-Based Two-Stage Fuzzy Facility Location Problems Reducing risks in location decisions when coping with imprecise information is critical in supply chain management so as to increase competitiveness and profitability. In this paper, a two-stage fuzzy facility location problem with Value-at-Risk (VaR), called VaR-FFLP, is proposed, which results in a two-stage fuzzy zero-one integer programming problem. Some properties of the VaR-FFLP, including the value of perfect information (VPI), the value of fuzzy solution (VFS), and the bounds of the fuzzy solution, are discussed. Since the fuzzy parameters of the location problem are represented in the form of continuous fuzzy variables, the determination of VaR is inherently an infinite-dimensional optimization problem that cannot be solved analytically. Therefore, a method based on the discretization of the fuzzy variables is proposed to approximate the VaR. The Approximation Approach converts the original problem into a finite-dimensional optimization problem. A pertinent convergence theorem for the Approximation Approach is proved. Subsequently, by combining the Simplex Algorithm, the Approximation Approach, and a mechanism of genotype-phenotype-mutation-based binary particle swarm optimization (GPM-BPSO), a hybrid GPM-BPSO algorithm is being exploited to solve the VaR-FFLP. A numerical example illustrates the effectiveness of the hybrid GPM-BPSO algorithm and shows its enhanced performance in comparison with the results obtained by other approaches using genetic algorithm (GA), tabu search (TS), and Boolean BPSO (B-BPSO).

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 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

binary particle swarm optimization (bpso)


eCloudRFID A mobile software framework architecture for pervasive RFID-based applications In the last few years, RFID technology has become a stimulating and rapidly expanding area of research and development. The technology's ability to precisely identify objects at low cost and without line of sight creates new and emerging opportunities for RFID applications that could become an integral part of our daily lives. Mobile RFID services for the Internet of Things can be created using RFID as an enabling technology in mobile devices. This pervasiveness enables embedded systems to interact with the user continuously, providing data from their sensors and responding to requests from the users too. Humans, devices and things are both the content providers and users of these mobile services. Mobile RFID services can be either provided on mobile devices applications as stand-alone services or combined with legacy and end-to-end systems. However, to develop and deploy this kind of system, it is necessary for an effective software development infrastructure to be able to deal with the restrictions and limitations imposed by related business areas, RFID and pervasive applications. This work presents a software framework architecture for mobile devices that aims to facilitate the development process of embedded RFID applications and the integration process of business applications and EPC Network instances. The framework provides for applications a common communication interface to abstract different devices and reading protocols as well as functions to process and distribute data.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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

middleware rfid
embedded framework
pervasive computing


A note on exact and heuristic algorithms for the identical parallel machine scheduling problem A recent paper (Davidovi? etal., J. Heuristics, 18:549569, 2012) presented a bee colony metaheuristic for scheduling independent tasks to identical processors, evaluating its performance on a benchmark set of instances from the literature. We examine two exact algorithms from the literature, the former published in 1995, the latter in 2008 (and not cited by the authors). We show that both such algorithms solve to proven optimality all the considered instances in a computing time that is several orders of magnitude smaller than the time taken by the new algorithm to produce an approximate solution.

O O O O O O O O O B 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 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

identical parallel machine scheduling
exact algorithms


Off-line optimization and control for real time integration of a three-phase hydrogenation catalytic reactor In order to develop and test the integration procedure, in this paper a real time process integration involving the optimization and control of the process is presented, in this case, with the two-layer approach. The used optimization algorithms were Levenberg-Marquardt and SQP that solve a non-linear least square problem subject to bounds on the variables. The two-layer approach is a hierarchical control structure where an optimization layer calculates the set points and manipulated variables to the advanced controller, which is based on the dynamic matrix control with constraints (QDMC). The non-isothermal dynamic model of the three-phase slurry catalytic reactor with appropriate solution procedure was utilized in this work (Vasco de Toledo, E. C., Santana, P. L., Maciel, M. R. W., & Maciel Filho, R. (2001). Dynamic modeling of a three-phase catalytic slurry reactor. Chemical Engineering Science, 56, 6055-6061). The model consists on mass and heat balance equations for the catalyst particles as well as for the bulk phases of gas and liquid. The model was used to describe the dynamic behavior of hydrogenation reaction of o-cresol to obtain 2-methil-cyclohexanol, in the presence of a catalyst Ni/SiO2. (c) 2005 Elsevier Ltd. All rights reserved.

O B 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 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 O O O O O O O O O O B 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 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 B O O O O O O O O O O O O O O O O O O O O

hydrogenation
dynamic modeling
optimization
advanced controller


A workflow engine-driven SOA-based cooperative computing paradigm in grid environments The grid has been proposed as a promising service-oriented platform for increasingly complex cooperative computing. The platforms of service-oriented grids are often Web-based where participants collaborate to achieve a common goal by sharing scarce Web-Based Computational/ Computing Resources (WBCR). To share the WBCR effectively is a challenging problem in boundary-spanning grid environments, particularly when these resources are subject to both static and dynamic usage. To set up the certificate-based usage policy described in this paper, we first explore a workflow engine-driven SOA-based resource access control mechanism. Then, aiming at setting up a cooperative computing paradigm from the resource sharing perspective, an infrastructure derived from a specific project of SOA&EDSCCE (SOA-Based&Engine-Driven Structured Cooperative Computing Environment) is proposed for promoting its cooperative computing in grid environment based on the control disciplines and the WBCR usage policy. The main contributions of this paper are twofold: 1) a workflow engine-driven SOA-based WBCR sharing mechanism is presented in accordance with to the certificate-based usage policy; and 2) a specific infrastructure of cooperative computing is put forward for the collaboration based on the WBCR sharing mechanism.

O O O O B I O O B O O B 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 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 B I 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 O 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

workflow engine
service-oriented architecture (soa)
certificate


A new method for inverse electromagnetic casting problems based on the topological derivative The inverse electromagnetic casting problem consists in looking for a suitable set of electric wires such that the electromagnetic field induced by an alternating current passing through them makes a given mass of liquid metal acquire a predefined shape. In this paper we propose a new method for the topology design of such inductors. The inverse electromagnetic casting problem is formulated as an optimization problem, and topological derivatives are considered in order to locate new wires in the right position. Several numerical examples are presented showing that the proposed technique is effective to design suitable inductors.

O O 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 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

topological derivatives
electromagnetic casting

topological asymptotic analysis
inverse problem


Translation and scale invariants of Legendre moments By convention, the translation and scale invariant functions of Legendre moments are achieved by using a combination of the corresponding invariants of geometric moments. They can also be accomplished by normalizing the translated and/or scaled images using complex or geometric moments. However, the derivation of these functions is not based on Legendre polynomials. This is mainly due to the fact that it is difficult to extract a common displacement or scale factor from Legendre polynomials. In this paper, we introduce a new set of translation and scale invariants of Legendre moments based on Legendre polynomials. The descriptors remain unchanged for translated, elongated, contracted and reflected non-symmetrical as well as symmetrical images. The problems associated with the vanishing of odd-order Legendre moments of symmetrical images are resolved. The performance of the proposed descriptors is experimentally confirmed using a set of binary English, Chinese and Latin characters. In addition to this, a comparison of computational speed between the proposed descriptors and the aforesaid geometric moments-based method is also presented.

B I I I O B I O O O O 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 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 B I 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 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

legendre moments
translation and scale invariants
geometric moments

image normalization
aspect ratio invariants


An \(H^1\)-Galerkin mixed finite element method for time fractional reactiondiffusion equation In this article, an \(H^1\)-Galerkin mixed finite element (MFE) method for solving time fractional reactiondiffusion equation is presented. The optimal time convergence order \(O(\varDelta t^{2-\alpha })\) and the optimal spatial rate of convergence in \(H^1\) and \(L^2\)-norms for variable \(u\) and its gradient \(\sigma \) are derived. Moreover, some numerical results are shown to support our theoretical analysis.

O O O O O O O B I I I O O O O O O O O O O O O B 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


Fuzzy systems design: direct and indirect approaches A systematic classification of the data-driven approaches for design of fuzzy systems is given in the paper. The possible ways to solve this modelling and identification problem are classified on the basis of the optimisation techniques used for this purpose. One algorithm for each of the two basic categories of design methods is presented and its advantages and disadvantages are discussed. Both types of algorithms are self-learning and do not require interaction during the process of fuzzy model design. They perform adaptation of both the fuzzy model structure (rule-base) and the parameters. The indirect approach exploits the dual nature of Takagi-Sugeno (TS) models and is based on recently introduced recursive clustering combined with Kalman filtering-based procedure for recursive estimation of the parameter of the local sub-models. Both algorithms result in finding compact and transparent fuzzy models. The direct approach solves the optimisation problem directly, while the indirect one decomposes the original problem into on-line clustering and recursive estimation problems and finds a sub-optimal solution in real-time. The later one is computationally very efficient and has a range of potential applications in real-time process control, moving images recognition, autonomous systems design etc. It is extended in this paper for the case of multi-input-multi-output (MIMO systems). Both approaches have been tested with real data from an engineering process.

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

fuzzy models design
takagi-sugeno and mamdani fuzzy models
on-line clustering
recursive least squares estimation
genetic algorithms


Analysis of zero-inflated clustered count data: A marginalized model approach Min and Agresti (2005) proposed random effect hurdle models for zero-inflated clustered count data with two-part random effects for a binary component and a truncated count component. In this paper, we propose new marginalized models for zero-inflated clustered count data using random effects. The marginalized models are similar to Dobbie and Welshs (2001) model in which generalized estimating equations were exploited to find estimates. However, our proposed models are based on a likelihood-based approach. A Quasi-Newton algorithm is developed for estimation. We use these methods to carefully analyze two real datasets.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Logic minimization for large-scale networks based on multi-signal implications This paper presents a novel implication-based method for logic minimization in large-scale, multi-level networks. It significantly reduces network size through repeated addition and removal of redundant subnetworks, utilizing multisignal implications and relationships among these implications. These are handled on a transitive implication graph, proposed ill this paper, which offers the practical use of implications for logic minimization. The proposed method holds great promise for the achievement of an interactive logic design environment for large-scale networks.

B I 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 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


A Curve Evolution Approach for Unsupervised Segmentation of Images With Low Depth of Field In this paper, we describe a novel algorithm for unsupervised segmentation of images with low depth of field (DOF). First of all, a multi-scale reblurring model is used to detect the object of interest (OOI) in saliency space. Then, to determine the boundary of OOI, an active contour model based on hybrid energy function is proposed. In this model, a global energy item related with the saliency map is adopted to find the global minimum, and a local energy term regarding the low DOF image is used to improve the segmentation precision. In addition, an adaptive parameter is attached to this model to balance the weight of global and local energy. Furthermore, an unsupervised curve initialization method is designed to reduce the number of evolution iterations. Finally, we conduct experiments on various low DOF images, and the results demonstrate the high robustness and precision of the proposed approach.

O B I O O O O O O O B I I I O O O O O O O O O O O O O O B 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 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

low depth of field
active contour model
curve evolution

image segmentation
unsupervised initialization


A dynamic model of optimal investment in research and development with international knowledge spillovers We consider a two-country endogenous growth model where an economic follower absorbs part of the knowledge generated in a leading country. To solve a suitably defined infinite horizon dynamic optimization problem an appropriate version of the Pontryagin maximum principle is developed. The properties of optimal controls and the corresponding optimal trajectories are characterized by the qualitative analysis of the solutions of the Hamiltonian system arising through the implementation of the Pontryagin maximum principle.

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 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 B I I

knowledge spillovers
infinite horizon
pontryagin maximum principle

optimal economic growth
transversality conditions


tap control for headphones without sensors A tap control technique for headphones is proposed. A simple circuit is used to detect tapping of the headphone shell by using the speaker unit in the headphone as a tap sensor. No additional devices are required in the headphone shell and cable, so the user can use their favorite headphones as a controller while listening music. A prototype is implemented with several calibration processes to compensate the differences in headphones and users' tapping actions. Tests confirm that the user can control a music player by tapping regular headphones.

B O O B O O O B 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 B 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 B O O O O O O O O O O O O O O O O O B


topical locality in the web Most web pages are linked to others with related content . This idea, combined with another that says that text in, and possibly around, HTML anchors describe the pages to which they point , is the foundation for a usable World-Wide Web. In this paper, we examine to what extent these ideas hold by empirically testing whether topical locality mirrors spatial locality of pages on the Web. In particular, we find that the likelihood of linked pages having similar textual content to be high; the similarity of sibling pages increases when the links from the parent are close together; titles, descriptions, and anchor text represent at least part of the target page; and that anchor text may be a useful discriminator among unseen child pages. These results show the foundations necessary for the success of many web systems, including search engines, focused crawlers, linkage analyzers, and intelligent web agents.

O B O O B O B 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 B O O B O O O O O O O O O O O O O B O B B 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 B O O O 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 B B O O O O O O O O O B O

spatial systems web text links similarity paper locality

contention
agent
search engine
usability
test
intelligence
web page
world wide web


Modified constrained learning algorithms incorporating additional functional constraints into neural networks ? In this paper, two modified constrained learning algorithms are proposed to obtain better generalization performance and faster convergence rate. The additional cost terms of the first algorithm are selected based on the first-order derivatives of the activation functions of the hidden neurons and the second-order derivatives of the activation functions of the output neurons, while the additional cost terms of the second one are selected based on the first-order derivatives of the activation functions of the output neurons and the second-order derivatives of the activation functions of the hidden neurons. In the course of training, the additional cost terms of the proposed algorithms can penalize the input-to-output mapping sensitivity and the high frequency components simultaneously so that the better generalization performance can be obtained. Finally, theoretical justifications and simulation results are given to verify the efficiency and effectiveness of our proposed learning algorithms.

O 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 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 B I O O B I 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

generalization performance
convergence rate
mapping sensitivity
high frequency components


DYNAMIC ENVIRONMENT ROBOT PATH PLANNING USING HIERARCHICAL EVOLUTIONARY ALGORITHMS The problem of path planning deals with the computation of an optimal path of the robot, from source to destination, such that it does not collide with any obstacle on its path. In this article we solve the problem of path planning separately in two hierarchies. The coarser hierarchy finds the path in a static environment consisting of the entire robotic map. The resolution of the map is reduced for computational speedup. The finer hierarchy takes a section of the map and computes the path for both static and dynamic environments. Both the hierarchies make use of an evolutionary algorithm for planning. Both these hierarchies optimize as the robot travels in the map. The static environment path is increasingly optimized along with generations. Hence, an extra setup cost is not required like other evolutionary approaches. The finer hierarchy makes the robot easily escape from the moving obstacle, almost following the path shown by the coarser hierarchy. This hierarchy extrapolates the movements of the various objects by assuming them to be moving with same speed and direction. Experimentation was done in a variety of scenarios with static and mobile obstacles. In all cases the robot could optimally reach the goal. Further, the robot was able to escape from the sudden occurrence of obstacles.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

evolutionary algorithms
robot path planning

dynamic obstacles
hierarchical genetic algorithms
robotics


Detecting Phenotype-Specific Interactions between Biological Processes from Microarray Data and Annotations High throughput technologies enable researchers to measure expression levels on a genomic scale. However, the correct and efficient biological interpretation of such voluminous data remains a challenging problem. Many tools have been developed for the analysis of GO terms that are over-or under-represented in a list of differentially expressed genes. However, a previously unexplored aspect is the identification of changes in the way various biological processes interact in a given condition with respect to a reference. Here, we present a novel approach that aims at identifying such interactions between biological processes that are significantly different in a given phenotype with respect to normal. The proposed technique uses vector-space representation, SVD-based dimensionality reduction, differential weighting, and bootstrapping to asses the significance of the interactions under the multiple and complex dependencies expected between the biological processes. We illustrate our approach on two real data sets involving breast and lung cancer. More than 88 percent of the interactions found by our approach were deemed to be correct by an extensive manual review of literature. An interesting subset of such interactions is discussed in detail and shown to have the potential to open new avenues for research in lung and breast cancer.

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 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 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

phenotype-specific interactions
microarrays
gene ontology
single value decomposition


Computer simulation of production systems for woven fabric manufacture This paper reports a research and development of a suite of generic software program entitled TEXSIM (TEXtile SIMulator). The software is mainly intended to create simulation models of weaving of production systems without any programming and automatically performs the simulation study and produces results to understand the stochastic behaviour of the system as well as to analyze the system performances to solve the real life weaving production management problems. The 'TEXSIM' reads the input parameters from the user in an on-line session through its user-interface, written in FORTRAN'77, and interactively uses WITNESS, a manufacturing simulation package containing the basic simulation model building blocks, and creates the simulation model in accordance with the user's specifications and conducts the simulation experiments and produces results. The objective is to focus on the practicality and simplicity of simulation model building of a weaving production system with a readily available suite of user-friendly program TEXSIM within few minutes without expertise and back ground of simulation technique and the knowledge of computer simulation programming as well as the skill of handling of commercial simulation package. It also highlights the importance of use of computer simulation technique as a modern, powerful and flexible management analysis tool in weaving factories. Textile engineers and technologists, particularly the managers who have no background of simulation can take full advantages of the use of simulation technique to analyze their present complex weaving production systems, rather than using the conventional analytical rule of thumb methods, to help the management to plan, design and operate their systems in an efficient manner to improve the manufacturing productivity. TEXSIM also facilitates the scheduling of production within the factory through simulation. (C) 2000 Elsevier Science Ltd. All rights reserved.

O B O O O O O O O O O O O O O O O O B I I I 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 B O O B O O O O B O O 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 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 B O O 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 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 B 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 B O O O O O O O O

suite of generic software
simulation
witness

system performance
os/2 environment
model library file


optimization of range checking An analysis is given for optimizing run-time range checks in regions of high execution frequency. These optimizations are accomplished using strength reduction, code motion and common subexpression elimination. Test programs, using the above optimizations, are used to illustrate run-time improvements.

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 B B O O O O B O O O O O O O O O O O


New Autoantibodies in Pediatric OpsoclonusMyoclonus Syndrome Opsoclonusmyoclonus syndrome (OMS) is a rare neurologic disorder comprising the main symptoms of eye-movement disturbances, muscle jerks, and severe ataxia. In children and adults, some cases are associated with a tumor as a paraneoplastic syndrome, whereas in children the paraneoplastic form is almost exclusively associated with neuroblastoma. The detection of autoantibodies in some OMS sera led to the hypothesis that the syndrome is of autoimmune origin. Beside autoantibodies against intracellular proteins, such as anti-Hu, ?-enolase, and KHSRP, specific binding of autoantibodies to the surface of neuroblastoma cells and cerebellar granular neurons have been found. Antiproliferative and proapoptotic effects of these autoantibodies on neuroblastoma cell lines were noted as well. These results support the concept of a humoral autoimmune process in the pathogenesis of OMS

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 B 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 B O O O O B O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O


A visual shape descriptor using sectors and shape context of contour lines This paper describes a visual shape descriptor based on the sectors and shape context of contour lines to represent the image local features used for image matching. The proposed descriptor consists of two-component feature vectors. First, the local region is separated into sectors and their gradient magnitude and orientation values are extracted; a feature vector is then constructed from these values. Second, local shape features are obtained using the shape context of contour lines. Another feature vector is then constructed from these contour lines. The proposed approach calculates the local shape feature without needing to consider the edges. This can overcome the difficulty associated with textured images and images with ill-defined edges. The combination of two-component feature vectors makes the proposed descriptor more robust to image scale changes, illumination variations and noise. The proposed visual shape descriptor outperformed other descriptors in terms of the matching accuracy: 14.525% better than SIFT, 21% better than PCA-SIFT, 11.86% better than GLOH, and 25.66% better than the shape context.

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 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 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 B I

local descriptor
object recognition
image retrieval


From modulated Hebbian plasticity to simple behavior learning through noise and weight saturation Synaptic plasticity is a major mechanism for adaptation, learning, and memory. Yet current models struggle to link local synaptic changes to the acquisition of behaviors. The aim of this paper is to demonstrate a computational relationship between local Hebbian plasticity and behavior learning by exploiting two traditionally unwanted features: neural noise and synaptic weight saturation. A modulation signal is employed to arbitrate the sign of plasticity: when the modulation is positive, the synaptic weights saturate to express exploitative behavior; when it is negative, the weights converge to average values, and neural noise reconfigures the networks functionality. This process is demonstrated through simulating neural dynamics in the autonomous emergence of fearful and aggressive navigating behaviors and in the solution to reward-based problems. The neural model learns, memorizes, and modifies different behaviors that lead to positive modulation in a variety of settings. The algorithm establishes a simple relationship between local plasticity and behavior learning by demonstrating the utility of noise and weight saturation. Moreover, it provides a new tool to simulate adaptive behavior, and contributes to bridging the gap between synaptic changes and behavior in neural computation.

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 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 B 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

computational models
neural plasticity
neuromodulation


Investigation of the substrate activation mechanism and electroless NiP coating ductility and adhesion The effects of different factors: concentration of Sn and Pd ions, temperature, pH, additives, surface roughness, time of treatment on sensitization, activation and electroless deposition were investigated. The adsorption and desorption of tin and palladium ions have been investigated using the method of radioactive isotopes and X-ray photoelectron spectroscopy. A mechanism of sensitization and activation was established. The established characters of ductility and adhesion between the electrolessly deposited NiP alloy and dielectrics depending on annealing temperature were explained on the basis of the changes in the alloy structure and phase transformations. The proposed methods of metallization are widely used in electronics and instrument-making. As a result, Au, Ag and Pd were adequately replaced with the alloys of non-precious metals, usage of toxic substances was eliminated and the technology was significantly simplified. A new resistless technology is proposed.

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 B 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 B 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 O O O O O O O O O O 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

electroless deposition
sensitization
activation
ductility
resistless technology


Model checking conditional CSL for continuous-time Markov chains In this paper, we consider the model-checking problem of continuous-time Markov chains (CTMCs) with respect to conditional logic. To the end, we extend Continuous Stochastic Logic introduced in Aziz et al. (2000) [1] to Conditional Continuous Stochastic Logic (CCSL) by introducing a conditional probabilistic operator. CCSL allows us to express a richer class of properties for CTMCs. Based on a parameterized product obtained from the CTMC and an automaton extracted from a given CCSL formula, we propose an approximate model checking algorithm and analyse its complexity. Crown Copyright (C) 2012 Published by 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 B I O O O O O B I I 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

continuous stochastic logic
conditional logic

formal methods
probabilistic systems
continuous-time markov chains


new perspectives and methods in link prediction This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse networks presents a significant challenge due to the inherent disproportion of links that can form to links that do form. Previous research has typically approached this as an unsupervised problem. While this is not the first work to explore supervised learning, many factors significant in influencing and guiding classification remain unexplored. In this paper, we consider these factors by first motivating the use of a supervised framework through a careful investigation of issues such as network observational period, generality of existing methods, variance reduction, topological causes and degrees of imbalance, and sampling approaches. We also present an effective flow-based predicting algorithm, offer formal bounds on imbalance in sparse network link prediction, and employ an evaluation method appropriate for the observed imbalance. Our careful consideration of the above issues ultimately leads to a completely general framework that outperforms unsupervised link prediction methods by more than 30\% AUC.

O O O O O B I O O O O O O B I O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O


stereophonic and surface sound generation for exploratory data analysis The analysis and interpretation of very high dimensional data require the development and use of data presentation techniques that harness human perceptual powers. The University of Lowell's Exploratory Visualization project (Exvis) aims at designing, implementing, and evaluating perceptually-based tools for data presentation using both visual and auditory domains. This paper describes several auditory data presentation techniques, including the generation of stereophonic sound with apparent depth and sound that appears to emanate from a two-dimensional area. Both approaches can produce sound with auditory texture .

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

sound generation visualization use analysis interpretation human project data paper tools surface

present
developer
domain
data analysis
high-dimensional data


Application of continuation method and bifurcation for the acetylcholine neurocycle considering partial dissociation of acetic acid In this paper, bifurcation and chaotic behavior of the two-enzyme-two-compartment acetylcholine (ACh) neurocycle model developed earlier (Mustafa, Elkamel, et al., 2009; Mustafa, Ibrahim, et al., 2009; Mustafa et al., 2012) are investigated considering the partial dissociation of acetic acid in both presynaptic and postsynaptic neurons as well. The two-parameter continuation technique is used to investigate static and dynamic solutions of the ACh cholinergic neurocycle system based on feed choline concentration as the main bifurcation parameter. A detailed bifurcation analysis is carried out in order to uncover some important features of the system, such as static bifurcation, dynamic bifurcation and chaotic behavior. These findings are related to the real phenomena occurring in the neurons, like periodic stimulation of neural cells and non-regular functioning of ACh receptors. It is found that pH exists in the range of 7.05-7.75 which is inside the physiological range of pH in the brain taking into consideration partial dissociation of the acetic acid. The disturbances and irregularities (chaotic attractors) occurring in the ACh cholinergic system may be good indications to cholinergic diseases such as the Alzheimer's and Parkinson's diseases. Crown Copyright (C) 2012 Published by Elsevier Ltd. All rights reserved.

O O O O O B O O B O O O O O B I 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 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 O O O O B O O O B O O O O O O O O O O O O O O O O O B 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 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

acetylcholine
choline
acetic acid
bifurcation

hydrogen ions
period doubling
dynamic behavior
chaos


A decision support framework for internal audit prioritization in a rental car company: A combined use between DEA and AHP Corporate scandals such as those at Tyco, Enron, and WorldCom have caused the decline of public trust in accounting and reporting practices. In response, US passed the Sarbanes Oxley Law (Sarbanes) in 2002, the most important corporate governance law since securities laws in 1930s. Section 302 of Sarbanes mandates corporations to ensure accurate financial disclosure and to take greater financial reporting and control responsibilities. Management is required to make an annual assertion regarding the design and effectiveness of companys internal controls. Consequently, many internal auditing resources are stretched. The objective of this case study is to develop a multi-criteria decision making aid that can identify the most critical businesses units within a corporation. Using the aid, we can use efficiently and effectively the internal auditing resources. Internal audits determine if the accounting processes and systems are working as intended. It focuses on the reliability of the accounting data and evaluates business through financial, operational, and compliance review. It assesses the risk of asset loss, studies business processes, and identifies opportunities to improve efficiency and effectiveness. This study explores the potential of applying data envelopment analysis (DEA) and analytic hierarchy process (AHP) to determine the business units that need audit. Compared with conventional methods, the proposed combined model incorporates a much wider range of quantitative and qualitative criteria, and provides a more detailed and thorough study. The proposed evaluation framework is comprehensive and flexible and it shows great potential for internal audit prioritization and resource allocation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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

auditing
data envelopment analysis
analytic hierarchy process

multiple criteria analysis
competitiveness


The effect of beta-saturated pyrrolic rings on the electronic structures and aromaticity of magnesium porphyrin derivatives: A density functional study Density functional theory (DFT) calculation on the molecular structures, molecular orbitals, electronic absorption spectra, and magnetic properties of magnesium porphyrin (MgPor) and a series of five hydrogenated magnesium porphyrin complexes with different number of beta-saturated pyrrolic rings, namely MgPor-beta-1Hy, MgPor-beta-opp-2Hy, MgPor-beta-adj-2Hy, MgPor-beta-3Hy, and MgPor-beta-4Hy, clarifies the red-shift of the lowest energy absorption band from chlorophyll a to bacteriochlorophyll and reveals the strong chemical stability for both of them. The energy levels of highest occupied molecular orbitals (HOMO) and HOMO-1 for MgPor are reversed upon hydrogenation at beta-positions (2 and 3, 7 and 8, 12 and 13, and 17 and 18) of porphyrin ring. Along with the increase of beta-saturated pyrrolic rings from I, 2, 3, to 4, the HOMO energy increases from -4.78 eV to -3.10 eV in a regular manner. In contrast, the lowest unoccupied molecular orbitals (LUMO) energy levels of MgPor, MgPor-beta-1Hy, and MgPor-beta-opp-2Hy are very similar with each other. As a result, the lowest energy absorption band involving main transition from HOMO to LUMO is red-shifted from MgPor-beta-1Hy to MgPor-beta-opp-2Hy which is representative of chlorophyll a and bacteriochlorophyll, respectively. Natural hydroporphyrins represented by MgPor, MgPor-beta-1 Hy, and MgPor-beta-opp-2Hy have turned out to be aromatic and stable enough, in good accordance with the ubiquity of their derivatives in the nature. In contrast, MgPor-beta-adj-2Hy. MgPor-beta-3Hy, and MgPor-beta-4Hy with relatively weak aromaticity seem to be unstable and therefore were not found in nature. (C) 2011 Elsevier Inc. All rights reserved.

O O O O O O O O O O O B O B I O O O O O B I I 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 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 B O O O O O O O O O O O O O O O O O O

magnesium porphyrin
density functional theory
aromaticity

beta-saturated pyrrolic rings
electronic structure


Automatic registration of optical aerial imagery to a LiDAR point cloud for generation of city models This paper presents a framework for automatic registration of both the optical and 3D structural information extracted from oblique aerial imagery to a Light Detection and Ranging (LiDAR) point cloud without prior knowledge of an initial alignment. The framework employs a coarse to fine strategy in the estimation of the registration parameters. First, a dense 3D point cloud and the associated relative camera parameters are extracted from the optical aerial imagery using a state-of-the-art 3D reconstruction algorithm. Next, a digital surface model (DSM) is generated from both the LiDAR and the optical imagery-derived point clouds. Coarse registration parameters are then computed from salient features extracted from the LiDAR and optical imagery-derived DSMs. The registration parameters are further refined using the iterative closest point (ICP) algorithm to minimize global error between the registered point clouds. The novelty of the proposed approach is in the computation of salient features from the DSMs, and the selection of matching salient features using geometric invariants coupled with Normalized Cross Correlation (NCC) match validation. The feature extraction and matching process enables the automatic estimation of the coarse registration parameters required for initializing the fine registration process. The registration framework is tested on a simulated scene and aerial datasets acquired in real urban environments. Results demonstrates the robustness of the framework for registering optical and 3D structural information extracted from aerial imagery to a LiDAR point cloud, when co-existing initial registration parameters are unavailable.

O O O O B I 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

scene modeling
sensor fusion
3d registration


wireless authentication using remote passwords Current wireless authentication mechanisms typically rely on inflexible shared secrets or a heavyweight public-key infrastructure with user-specific digital certificates and, as such, lack general support for environments with dynamic user bases where guest access is frequent. Simple Authentication for the Web (SAW) facilitates dynamic user bases in the context of web site logins by enabling users to authenticate to personal messaging identifiers (e.g., email addresses, IM handles, cell phone numbers). SAW, however, is ill-suited for wireless authentication because, in most cases, it is dependent on client-side Internet connectivity. Wireless Authentication using Remote Passwords (WARP) overcomes this constraint by building a hybrid protocol that combines the principles of SAW authentication with the Secure Remote Password (SRP) protocol.

O O O O O O O O O O O O O O O O O O O O O O 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 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 B O O O O O O B O


Selection of human embryos for transfer by Bayesian classifiers In this work we approach by Bayesian classifiers the selection of human embryos from images. This problem consists of choosing the embryos to be transferred in human-assisted reproduction treatments, which Bayesian classifiers address as a supervised classification problem. Different Bayesian classifiers capable of taking into account diverse dependencies between variables of this problem are tested in order to analyse their performance and validity for building a potential decision support system. The analysis by receiver operating characteristic (ROC) proves that the Bayesian classifiers presented in this paper are an appropriated and robust approach for this aim. From the Bayesian classifiers tested, the tree augmented naive Bayes, k k -dependence Bayesian and naive Bayes classifiers showed to perform almost as well as the semi naive Bayes and selective naive Bayes classifiers.

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 B 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 B I 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

supervised learning
embryo image classification
in vitro fertilisation
bayes methods


A framework for computation-memory algorithmic optimization for signal processing The heterogeneity of today's computing environment means computation-intensive signal processing algorithms, must be optimized for performance in a machine dependent fashion. In this paper, we present a dynamic memory model and associated optimization framework that finds a machine-dependent, near-optimal implementation of an algorithm by exploiting the computation-memory tradeoff. By. optimal, we mean an implementation that has the fastest running time given the specification of the machine memory hierarchy. We discuss two instantiations of the framework: fast IP address lookup, and fast nonuniform scalar quantizer and unstructured vector quantizer encoding. Experiments show that both instantiations outperform techniques that ignore this computation-memory tradeoff.

O O O O 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

computation theory
memory management
packet switching
vector quantization


how to learn enough data mining to be dangerous in 60 minutes The field of data mining provides some methods highly relevant to researchers when mining software repositories. Whether one predicts bug locations, discovers hidden architectural structures and software patterns, or identifies experts of modules, data mining algorithms are usually the working horses for these studies. The goal of this tutorial is to convey some of the most relevant theoretical foundations and practical issues when using data mining algorithms. The tutorial will first discuss the usual data mining tasks (prediction, filtering, smoothing, and elucidation of the most likely explanation or structure). Then, it will introduce a general framework for data mining paving the way to explain the functionality of some of the most used data mining algorithms. The tutorial will close with an overview over the typical evaluation methods for induced results and a number of pointers for further study. Where possible, it will use examples from software engineering.

O 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


Energy-efficient mobile web in a bundle ? ?? The mobile Internet that was a huge hype ten years ago is finally here. We have a wealth of mobile devices that allow us to enjoy and consume Internet content from any number of web sites and services. With faster processors and radio links, our use of the Internet and the traffic mobile users generate grows at a tremendous pace. In this development, we still have a huge challenge to tackle: energy efficiency. When ten years ago one would recharge his personal mobile device once a week, we now do that daily; Smart phones today are not able to carry enough energy to allow us several days of usage time. The focus on this paper is to present and analyse one solution to help us in our daily lives. We implement and study a scheme where web content, a page, is delivered as a whole to a mobile device, instead of sending each individual object of the page separately. Combined with RRC state based header compression and selective content compression, our proposal allows the radio to keep in low power state for longer durations, and as a consequence brings huge energy savings. Download times also decrease, thus bringing increased Quality of Experience.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 networks
power consumption
web access
optimisation
bundling


Support Vector Machines for classification and locating faults on transmission lines This paper presents a new approach to classify fault types and predict the fault location in the high-voltage power transmission lines, by using Support Vector Machines (SVM) and Wavelet Transform (WT) of the measured one-terminal voltage and current transient signals. Wavelet entropy criterion is applied to wavelet detail coefficients to reduce the size of feature vector before classification and prediction stages. The experiments performed for different kinds of faults occurred on the transmission line have proved very good accuracy of the proposed fault location algorithm. The fault classification error is below 1% for all tested fault conditions. The average error of fault location in a 380kV360-km transmission line is below 0.26% and the maximum error did not exceed 0.95km.

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 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

support vector machines
wavelet transform


Avoiding semantic and temporal gaps in developing software intensive systems Development of software intensive systems (systems) in practice involves a series of self-contained phases for the lifecycle of a system. Semantic and temporal gaps, which occur among phases and among developer disciplines within and across phases, hinder the ongoing development of a system because of the interdependencies among phases and among disciplines. Such gaps are magnified among systems that are developed at different times by different development teams, which may limit reuse of artifacts of systems development and interoperability among the systems. This article discusses such gaps and a systems development process for avoiding them.

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

software systems development process gaps phases disciplines developer semantic temporal

meta-artifact domain rules tacit knowledge architecture extensions enablers information


An efficient conditionally anonymous ring signature in the random oracle model A conditionally anonymous ring signature is an exception since the anonymity is conditional. Specifically, it allows an entity to confirm/refute the signature that he generated before. A group signature also shares the same property since a group manager can revoke a signer's anonymity using the trapdoor information. However, the special node (i.e., group manager) does not exist in the group in order to satisfy the ad hoc fashion. In this paper, we construct a new conditionally anonymous ring signature, in which the actual signer can be traced without the help of the group manager. The big advantage of the confirmation and disavowal protocols designed by us are non-interactive with constant costs while the known schemes suffer from the linear cost in terms of the ring size n or security parameter s. (c) 2012 Elsevier B.V. All rights reserved.

O 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 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


Behavioral clusters in dynamic graphs Discover interesting patterns on longitudinal studies of vertex behavior over time. Apply machine learning to parallel graph analysis in a modular fashion. Finding behavior clusters of vertices in a dynamic graph. Apply NMF to group vertices that rise and fall in influence together.

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

dynamic graph analysis
streaming
matrix factorization
nonnegative matrix factorization (nmf)
low rank approximation


Numerical analysis and optimal design for new automotive door sealing with variable cross-section Five variables for featuring sealing cross-section geometry. Combination of BP and GA for cross-section design optimization. 3D numerical analysis for the curved corner parts closing process. Door sealing with variable cross-section based on complex profile.

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

variable cross-section
geometrical optimization
door seal closing effort
finite element analysis


Text-Informed Audio Source Separation. Example-Based Approach Using Non-Negative Matrix Partial Co-Factorization The so-called informed audio source separation, where the separation process is guided by some auxiliary information, has recently attracted a lot of research interest since classical blind or non-informed approaches often do not lead to satisfactory performances in many practical applications. In this paper we present a novel text-informed framework in which a target speech source can be separated from the background in the mixture using the corresponding textual information. First, given the text, we propose to produce a speech example via either a speech synthesizer or a human. We then use this example to guide source separation and, for that purpose, we introduce a new variant of the non-negative matrix partial co-factorization (NMPCF) model based on a so-called excitation-filter-channel speech model. Such a modeling allows sharing the linguistic information between the speech example and the speech in the mixture. The corresponding multiplicative update (MU) rules are eventually derived for the parameters estimation and several extensions of the model are proposed and investigated. We perform extensive experiments to assess the effectiveness of the proposed approach in terms of source separation and alignment performance.

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


Invertible Color-to-Monochrome Conversion Based on Color Quantization with Lightness Constraint A method obtaining a monochrome image which can rebuild colors is proposed. In this method, colors in an input image are quantized under a lightness constraint and a palette, which represents relationship between quantized colors and gray-levels, is generated. Using the palette, an output monochrome image is obtained. Experiments show that the proposed method obtains good monochrome and rebuilt color images.

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

color-to-monochrome conversion
k-means
color image
recoloring


Parameterizing above or below guaranteed values We consider new parameterizations of NP-optimization problems that have nontrivial lower and/or upper bounds oil their optimum Solution size. The natural parameter, we argue, is the quantity above the lower bound or below the upper bound. We show that for every problem in MAX SNP, the optimum Value is bounded below by all unbounded function of the input-size, and that the above-guarantee parameterization with respect to this lower bound is fixed-parameter tractable. We also observe that approximation algorithms give nontrivial lower or upper bounds oil the solution size and that the above or below guarantee question with respect to these bounds is fixed-parameter tractable for a Subclass of NP-optimization problems. We then introduce the notion of 'tight' lower and upper bounds and exhibit a number of problems for which the above-guarantee and below-guarantee parameterizations with respect to a tight bound is fixed-parameter tractable or W-hard. We show that if we parameterize "sufficiently" above or below the tight bounds, then these parameterized versions are nor fixed-parameter tractable unless P = NP. for a Subclass of NP-optimization problems. We also list several directions to explore in this paradigm. (c) 2009 Elsevier Inc. 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parameterized complexity
np-optimization problems
fixed-parameter tractability
above guarantee parameterizations


Modelling complex systems for project planning: a semiotics motivated method A large and complex IT project may involve multiple organizations and be constrained within a temporal period. An organization is a system comprising of people, activities, processes, information, resources and goals. Understanding and modelling such a project and its interrelationship with relevant organizations are essential for organizational project planning. This paper introduces the problem articulation method (PAM) as a semiotic method for organizational infrastructure modelling. PAM offers a suite of techniques, which enables the articulation of the business, technical and organizational requirements, delivering an infrastructural framework to support the organization. It works by eliciting and formalizing (e. g. processes, activities, relationships, responsibilities, communications, resources, agents, dependencies and constraints) and mapping these abstractions to represent the manifestation of the "actual" organization. Many analysts forgo organizational modelling methods and use localized ad hoc and point solutions, but this is not amenable for organizational infrastructures modelling. A case study of the infrared atmospheric sounding interferometer (IASI) will be used to demonstrate the applicability of PAM, and to examine its relevancy and significance in dealing with the innovation and changes in the organizations.

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 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

systems modelling
requirements articulation
organizational semiotics


Integration of information from several vision systems for a common task of surveillance In this paper we describe the integration of vision information obtained by a fixed camera and the information obtained by a binocular active vision system. Both systems acquire images from the same environment. The information redundancy is exploited to achieve a higher degree of robustness in detecting and tracking intruders. Global information about intruders is obtained by the fixed vision system whereas information about a specific intruder (that invades a critical area, for example) is obtained by the binocular system.

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 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


Blue electroluminescent materials based on phenylanthracene-substituted fluorene derivatives for organic light-emitting diodes We synthesized blue fluorescent materials based on anthracenefluorene hybrid. These materials have the good potentials for efficient blue OLEDs as the emitters. A white OLED using one of these materials as blue emitter was demonstrated.

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

organic light-emitting diode
anthracene
blue emission
suzuki reaction


Opportunistic Spectrum Access Based on a Constrained Multi-Armed Bandit Formulation Tracking and exploiting instantaneous spectrum opportunities are fundamental challenges in opportunistic spectrum access (OSA) in presence of the bursty traffic of primary users and the limited spectrum sensing capability of secondary users. In order to take advantage of the history of spectrum sensing and access decisions, a sequential decision framework is widely used to design optimal policies. However, many existing schemes, based on a partially observed Markov decision process (POMDP) framework, reveal that optimal policies are non-stationary in nature which renders them difficult to calculate and implement. Therefore, this work pursues stationary OSA policies, which are thereby efficient yet low-complexity, while still incorporating many practical factors, such as spectrum sensing errors and a priori unknown statistical spectrum knowledge. First, with an approximation on channel evolution, OSA is formulated in a multi-armed bandit (MAB) framework. As a result, the optimal policy is specified by the well-known Gittins index rule, where the channel with the largest Gittins index is always selected. Then, closed-form formulas are derived for the Gittins indices with tunable approximation, and the design of a reinforcement learning algorithm is presented for calculating the Gittins indices, depending on whether the Markovian channel parameters are available a priori or not. Finally, the superiority of the scheme is presented via extensive experiments compared to other existing schemes in terms of the quality of policies and optimality.

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

partially observed markov decision process (pomdp)


Collaborative routing and data delivery architecture for commercial wireless sensor networks Lately, wireless sensor network applications have emerged for provision of commercial services to end users. This results in commercial deployment of sensor networks which is as an important research area due to a number of design and quality of service challenges. An important technical challenge for sensor service provision to end users is managing dynamic network conditions such as unreliability of sensor nodes and network links which results in frequent service outages. This research is aimed at addressing this challenge. It presents a novel architecture which utilizes the availability of multiple sensor networks under different administrative domains, deployed in an area such that maximum network connectivity and high service availability are ensured. The architecture incorporates modifications and enhancements at the medium access control and the routing layers of sensor nodes for the collaborative operation of sensor networks. The design is based on IEEE 802.15.4 standard and ad hoc on demand distance vector routing protocol. The proposed architecture is mathematically analyzed with regards to overheads associated with the design such as routing and communication, and techniques to minimize these overheads are recommended. Through simulations using OMNET++, we show that the proposed architecture effectively provides connectivity for disconnected nodes achieving an overall increase in throughput for all the cooperating networks.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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 O O O O O O O O O O O O O O O O O


Questioning the relative virtues of dynamic lot sizing rules This paper begins by relating a brief history of lot sizing to a review of current educational literature, identifying the patterns and inconsistencies concerning which rules are used for demonstration. To independently establish the relative virtues of this broad range of techniques, nine such rules are selected and subjected to 3060 rolling horizon simulation tests each. The results of this comprehensive deterministic study are succinctly summarized, demonstrating not only that various published lot sizing rules vary in terms of cost performance, they also possess distinct strengths and weaknesses with respect to sparse demand patterns, short versus longer planning horizons, and degree of nervousness. In the case of nervousness, some rules are found vulnerable to an intriguing harmonic effect created by the apparent interaction between order cycle length and planning horizon. The study also found that one of the most impressive lot sizing techniques with respect to all these factors is a simple rule published in 1981 but remarkably overlooked in lot sizing literature since. Dynamic lot sizing rules have been a feature of inventory management literature for several decades. These techniques determine economical replenishment schedules, serve as components of more complex planning algorithms, and demonstrate a range of valuable concepts to the student of inventory management. Yet the diversity of such rules now available is subject to remarkable inconsistency in textbook coverage, perpetuating the impression that they are largely equivalent. The purpose of this study is to document this inconsistency in a survey of current texts and educational material, and then definitively refute the truism that distinctions between these rules are unimportant. The relative virtues of nine published rules are scrutinized in a comprehensive simulation study of 27,540 experiments, yielding more than one surprise from this long-established field of literature.

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 O O O O O O O O O O O O O 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 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 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 O O O O O O O O O O O O O O O O O O O O O


Progressive encoding and compression of surfaces generated from point cloud data We present a new algorithm for compressing surfaces created from oriented points, sampled using a laser range scanner or created from polygonal surfaces. We first use the input data to build an octree whose nodes contain planes that are constructed as the least square fit of the data within that node. Then, given an error threshold, we prune this octree to remove redundant data while avoiding topological changes created by merging disjoint linear pieces. From this octree representation, we provide a progressive encoding technique that encodes the octree structure as well as the plane equations. We encode the planes using distances to three points and a single bit. To decode these planes, we solve a constrained optimization problem that has closed-form solution. We then reconstruct the surface from this representation by implicitizing the discontinuous linear pieces at the leaves of the octree and take a level set of this implicit representation. Our tests show that the proposed method compresses surfaces with higher accuracy and smaller file sizes than other methods. (C) 2012 Elsevier Ltd. All rights reserved.

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 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


The UPPAM continuous-time RNN model and its critical dynamics study ? There have been numerous recurrent neural network models diversely developed for modeling or simulating the associative memory behavior of human beings in the past decades, and the existing results for each model individual are in certain sense redundant with similarity. By utilizing the innate character of general activation operators, i.e., the uniformly pseudo-projection-anti-monotone property, a unified continuous-time recurrent neural network model is introduced, which can jointly cover almost all of the known continuous-time recurrent neural network individuals. Under the critical condition which is the intrinsic bounded line of stability and instability, we develop some convergence and stability theory for the unified recurrent neural network model when the time is continuous. The study shows that the approach adopted in the present paper is powerful, particularly in the sense of unifying, simplifying and extending the currently existing various models and dynamics results of continuous-time RNNs.

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 B I I 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 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

uniformly pseudo-projection-anti-monotone rnns model


instance-wise points-to analysis for loop-based dependence testing We present a points-to analysis that aims at enabling loop-based dependence analysis in the presence of Java references. The analysis is based on an abstraction called element-wise points-to (ewpt) mapping . An ewpt mapping summarizes, in a compact representation, the relation between a pointer and the heap object it points to, for every instance of the pointer inside a loop and for every array element directly accessible through this pointer. Such instance-wise and element-wise information is especially important for loop-based dependence analyses and for a language where multi-dimensional arrays are implemented as arrays of pointers. We describe an iterative algorithm to compute ewpt mappings. We also present techniques to remove objects from ewpt mappings for destructive updates.The points-to algorithm was implemented and evaluated on a set of benchmark programs. We demonstrate that ewpt information can significantly improve the precision of dependence analysis. In many cases, the dependence analysis reports no false dependences due to array accesses.

O O B O O O O O O O O B O O O O O O B O O B O B O O B O O O O B O O O O O O O O O O O O B B 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 B O O B O O O B O B 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 B O O B 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

benchmark analysis arrays presence object java representation pointers compact abstraction language demonstrate relation algorithm

precise
point
heap analysis
computation
map
pointer analysis
access
informal
pointer arrays
program
dependencies
test
dependence analysis
iter
update


Rainbow connection in oriented graphs ? An edge-coloured graph G G is said to be rainbow-connected if any two vertices are connected by a path whose edges have different colours. The rainbow connection number of a graph is the minimum number of colours needed to make the graph rainbow-connected. This graph parameter was introduced by G.Chartrand, G.L.Johns, K.A.McKeon and P.Zhang in 2008. Since, the topic drew much attention, and various similar parameters were introduced, all dealing with undirected graphs. Here, we initiate the study of rainbow connection in oriented graphs. An early statement is that the rainbow connection number of an oriented graph is lower bounded by its diameter and upper bounded by its order. We first characterize oriented graphs having rainbow connection number equal to their order. We then consider tournaments and prove that (i) the rainbow connection number of a tournament can take any value from 2 to its order minus one, and (ii) the rainbow connection number of every tournament with diameter d d is at most d+2 d + 2 .

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 B I 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 B I O O 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 B I O O O O O O O O O O O O O O O O