Comparative multiresolution wavelet analysis of ERP spectral bands using an ensemble of classifiers approach for early diagnosis of Alzheimer's disease Early diagnosis of Alzheimer's disease (AD) is becoming an increasingly important healthcare concern. Prior approaches analyzing event-related potentials (ERPs) had varying degrees of success, primarily due to smaller study cohorts, and the inherent difficulty of the problem. A new effort using multiresolution analysis of ERPs is described. Distinctions of this study include analyzing a larger cohort, comparing different wavelets and different frequency bands, using ensemble-based decisions and, most importantly, aiming the earliest possible diagnosis of the disease. Surprising yet promising outcomes indicate that ERPs in response to novel sounds of oddball paradigm may be more reliable as a biomarker than the more commonly used responses to target sounds.

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

alzheimer's disease diagnosis
event-related potentials
ensemble classifiers


Patient-specific surgical planning and hemodynamic computational fluid dynamics optimization through free-form haptic anatomy editing tool (SURGEM) The first version of an anatomy editing/surgical planning tool (SURGEM) targeting anatomical complexity and patient-specific computational fluid dynamics (CFD) analysis is presented. Novel three-dimensional (3D) shape editing concepts and humanshape interaction technologies have been integrated to facilitate interactive surgical morphology alterations, grid generation and CFD analysis. In order to implement manual hemodynamic optimization at the surgery planning phase for patients with congenital heart defects, these tools are applied to design and evaluate possible modifications of patient-specific anatomies. In this context, anatomies involve complex geometric topologies and tortuous 3D blood flow pathways with multiple inlets and outlets. These tools make it possible to freely deform the lumen surface and to bend and position baffles through real-time, direct manipulation of the 3D models with both hands, thus eliminating the tedious and time-consuming phase of entering the desired geometry using traditional computer-aided design (CAD) systems. The 3D models of the modified anatomies are seamlessly exported and meshed for patient-specific CFD analysis. Free-formed anatomical modifications are quantified using an in-house skeletization based cross-sectional geometry analysis tool. Hemodynamic performance of the systematically modified anatomies is compared with the original anatomy using CFD. CFD results showed the relative importance of the various surgically created features such as pouch size, vena cave to pulmonary artery (PA) flare and PA stenosis. An interactive surgical-patch size estimator is also introduced. The combined design/analysis cycle time is used for comparing and optimizing surgical plans and improvements are tabulated. The reduced cost of patient-specific shape design and analysis process, made it possible to envision large clinical studies to assess the validity of predictive patient-specific CFD simulations. In this paper, model anatomical design studies are performed on a total of eight different complex patient specific anatomies. Using SURGEM, more than 30 new anatomical designs (or candidate configurations) are created, and the corresponding user times presented. CFD performances for eight of these candidate configurations are also presented.

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

computational fluid dynamics
congenital heart defects

patient specific surgical planning
computer aided design


On the use of cepstral analysis in acoustic feedback cancellation Acoustic feedback limits the maximum stable gain of a public address system. This may make the system unstable resulting in a howling artifact, a phenomenon known as Larsen effect. Acoustic feedback cancellation methods use an adaptive filter to identify the acoustic feedback path and then remove its influence from the system. However, if the traditional gradient-based or least-squares-based adaptive filtering algorithms are used, a bias is introduced in the estimate of the acoustic feedback path because the system input and loudspeaker signals are highly correlated. This work proposes a new method based on cepstral analysis of the error signal to identify the acoustic feedback path in order to reduce the bias problem. Simulation results in one typical acoustic environment demonstrate that, when the source signal is white noise or speech, the presented method can estimate the feedback path with a misalignment of ? 25 dB and increase by 30 dB the maximum stable gain of a public address system.

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

public address system
larsen effect
acoustic feedback cancellation
adaptive filtering
cepstral analysis


Optimal multicast route packing This paper considers the hop-constrained multicast route packing problem with a bandwidth reservation to build QoS-guaranteed multicast routing trees with a minimum installation cost. Given a set of multicast sessions, each of which has a hop limit constraint and a bandwidth requirement, the problem is to determine the set of multicast routing trees in an arc-capacitated network with the objective of minimizing the cost. For the problem, we propose a branch-and-cut-and-price algorithm, which can be viewed as a branch-and-bound method incorporating both the strong cutting plane algorithm and the column generation method. We implemented and tested the proposed algorithm on randomly generated problem instances with sizes up to 30 nodes, 570 arcs, and 10 multicast sessions. The test results show that the algorithm can obtain the optimal solution to practically sized problem instances within a reasonable time limit in most cases.

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

multicast
column generation
cutting plane


Component-Based Modeling and Reachability Analysis of Genetic Networks Genetic regulatory networks usually encompass a multitude of complex, interacting feedback loops. Being able to model and analyze their behavior is crucial for understanding their function. However, state space explosion is becoming a limiting factor in the formal analysis of genetic networks. This paper explores a modular approach for verification of reachability properties. A framework for component-based modeling of genetic regulatory networks, based on a modular discrete abstraction, is introduced. Then a compositional algorithm to efficiently analyze reachability properties of the model is proposed. A case study on embryonic cell differentiation involving several hundred cells shows the potential of this approach.

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

genetic regulatory network
component model
formal verification
modularity


Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty In this paper, a mixed integer linear programming (MILP) formulation is developed for the design and planning of supply chains with reverse flows while considering simultaneously production, distribution and reverse logistics activities. It is also considered products demand uncertainty using a scenario tree approach. As main goal the model defines the maximization of the expected net present value and the results provide details on sizing and location of plants, warehouses and retailers, definition of processes to install, establishment of forward and reverse flows and inventory levels to attain. The model is applied to a representative European supply chain case study and its applicability is demonstrated.

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

design
planning
reverse logistics
uncertainty
milp


incentive and rebuke based reputation model for peer to peer applications Peer-to-peer applications are very popular due to their decentralized and anonymous characteristics. Though this provides more opportunities for information exchange it still faces problems from malicious behavior. It is necessary to motivate peers to share their information and also to have some rigid rules for misbehaving peers. In this paper we propose a reputation model that provides incentives to the most trusted peers and reduces the effect of colluding peers and the peers behaving with dynamic personality. The model enforces peers to gradually increase or decrease their performance so that peers who suddenly drag their performance are viewed with an eye towards disturbing the system and hence their trust value is lowered. Peers are forced to provide correct evaluation by using credibility of the feedback sources. Collaborative nature of good peers helps to isolate misbehaving peers.

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

colluding collaborative trust reputation


Artificial neural network modeling to evaluate and predict the deformation behavior of stainless steel type AISI 304L during hot torsion The deformation behavior of type 304L stainless steel during hot torsion is investigated using artificial neural network (ANN). Torsion tests in the temperature range of 6001200C and in the (maximum surface) strain rate range of 0.1100s?1 were carried out. These experiments provided the required data for training the neural network and for subsequent testing. The input parameters of the model are strain, log strain rate and temperature while torsional flow stress is the output. A three layer feed-forward network was trained with standard back propagation (BP) and Resilient propagation (Rprop) algorithm. The paper makes a robust comparison of the performances of the above two algorithms. The network trained with Rprop algorithm is found to perform better and also needs less number of iterations for convergence. The developed ANN model employing this algorithm could efficiently track the work hardening, dynamic softening and flow localization regions of the deforming material. Sensitivity analysis showed that temperature and strain rate are the most significant parameters while strain affects the flow stress only moderately. The ANN model, described in this paper, is an efficient quantitative tool to evaluate and predict the deformation behavior of type 304L stainless steel during hot torsion.

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

artificial neural network
deformation behavior
hot torsion
back propagation
resilient propagation
sensitivity


An efficient condition for a graph to be Hamiltonian Let G=(V,E) G = ( V , E ) be a 2-connected simple graph and let dG(u,v) d G ( u , v ) denote the distance between two vertices u,v u , v in G . In this paper, it is proved: if the inequality dG(u)+dG(v)?|V(G)|-1 d G ( u ) + d G ( v ) ? | V ( G ) | - 1 holds for each pair of vertices u and v v with dG(u,v)=2 d G ( u , v ) = 2 , then G is Hamiltonian, unless G belongs to an exceptional class of graphs. The latter class is described in this paper. Our result implies the theorem of Ore [Note on Hamilton circuits, Amer. Math. Monthly 67 (1960) 55]. However, it is not included in the theorem of Fan [New sufficient conditions for cycles in graph, J. Combin. Theory Ser. B 37 (1984) 221227].

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


Clustering and its validation in a symbolic framework Clustering of symbolic data, using different validity indices, is proposed for determining the optimal number of meaningful clusters. Symbolic objects include linguistic, nominal, boolean, and interval-type of features, along with quantitative attributes. Clustering in this domain involves the use of symbolic dissimilarity between the objects. The novelty of the method lies in transforming the different clustering validity indices, like Normalized Modified Huberts statistic, DaviesBouldin index and Dunns index, from the quantitative domain to the symbolic framework. The effectiveness of symbolic clustering is demonstrated on several real life benchmark data sets.

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


Approximating minimum power covers of intersecting families and directed edge-connectivity problems Given a (directed) graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Let g = (V, epsilon) be a graph with edge costs {c(epsilon) : e is an element of epsilon} and let k be an integer. We consider problems that seek to find a min-power spanning subgraph G of g, that satisfies a prescribed edge-connectivity property. In the Min-Power k-Edge-Outconnected Subgraph problem we are given a root r is an element of V, and require that G contains k pairwise edge-disjoint r upsilon-paths for all upsilon is an element of V - r. In the Min-Power k-Edge-Connected Subgraph problem G is required to be k-edge-connected. For k = 1, these problems are at least as hard as the Set-Cover problem and thus have an Omega(ln vertical bar V vertical bar) approximation threshold. For k = Omega(n(epsilon)), they are unlikely to admit a polylogarithmic approximation ratio [15]. We give approximation algorithms with ratio O(k ln vertical bar V vertical bar). Our algorithms are based on a more general O(ln vertical bar V vertical bar)-approximation algorithm for the problem of finding a min-power directed edge-cover of an intersecting set-family; a set-family F is intersecting if X boolean AND Y, X boolean OR Y is an element of F for any intersecting X, Y is an element of F, and an edge set I covers F if for every X is an element of F there is an edge in I entering X. (C) 2010 Elsevier B.V. All rights reserved.

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

approximation algorithms
intersecting families

wireless networks
power minimization
directed graphs
edge-connectivity


A density-driven publish subscribe service for mobile ad-hoc networks This paper studies a density driven virtual topography based publish/subscribe service for mobile ad hoc networks. Two variants of the service are presented and evaluated by extensive simulations; the first is very communication frugal while the latter trades a higher message overhead for faster latency. Both variants are also being compared to two other representative approaches for publish/subscribe in ad hoc networks, a dissemination tree based scheme and an efficient flooding based scheme. It is shown that the density-driven approach outperforms the others in most tested scenarios. (C) 2012 Elsevier B.V. All rights reserved.

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


Breakout Local Search for the Max-Cut problem Given an undirected graph G=(V,E) where each edge of E is weighted with an integer number, the maximum cut problem (Max-Cut) is to partition the vertices of V into two disjoint subsets so as to maximize the total weight of the edges between the two subsets. As one of Karp's 21 NP-complete problems, Max-Cut has attracted considerable attention over the last decades. In this paper, we present Breakout Local Search (BLS) for Max-Cut. BLS explores the search space by a joint use of local search and adaptive perturbation strategies. The proposed algorithm shows excellent performance on the set of well-known maximum cut benchmark instances in terms of both solution quality and computational time. Out of the 71 benchmark instances, BLS is capable of finding new improved results in 34 cases and attaining the previous best-known result for 35 instances, within computing times ranging from less than 1 s to 5.6 h for the largest instance with 20,000 vertices. (C) 2012 Elsevier Ltd. All rights reserved.

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

max-cut
local search and heuristics
adaptive diversification
metaheuristics


On special differential superordinations using a generalized S?l?gean operator and Ruscheweyh derivative In the present paper we establish several differential superordinations regarding the new operator R D ? , ? n defined by using the generalized S?l?gean operator D ? n f ( z ) and Ruscheweyh derivative Rnf(z) R n f ( z ) , R D ? , ? n : A ? A ,

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

differential superordination
convex function
best subordinant
differential operator


a generative probabilistic approach to visualizing sets of symbolic sequences There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative probabilistic model for visualizing sets of discrete symbolic sequences. The model, a constrained mixture of discrete hidden Markov models, is a generalization of density-based visualization methods previously developed for static data sets. We illustrate our approach on sequences representing web-log data and chorals by J.S. Bach.

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

hidden markov model
em algorithm
latent space models
topographic mapping


Performance of RBF neural networks for array processing in impulsive noise environment ? This paper addresses the array processing problems (mainly focuses on direction of arrival estimation and beamforming) of mobile communication system using linear antenna arrays in high impulsive noise environment. One possible way to simulate the impulsive noise is to introduce alpha-stable distribution as the noise model. In order to reduce the computational complexity, the problems of DOA and beamforming are approached as a nonlinear mapping which can be modeled using a suitable radial-basis function neural network (RBFNN) trained with inputoutput pairs. This paper discusses the application of a three-layer RBFNN to perform the DOA estimation and beamforming in presence of impulsive noise. The performance of the network is compared to that of the algorithms based fractional lower-order statistics. Simulations show that the RBFNN is appropriate to approach the DOA estimation and beamforming. At the same time, the RBFNN substantially reduces the computation complexity.

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


Visual simulation of shockwaves We present an efficient method for visual simulations of shock phenomena in compressible, inviscid fluids. Our algorithm is derived from one class of the finite volume method especially designed for capturing shock propagation, but offers improved efficiency through physically-based simplification and adaptation for graphical rendering. Our technique is capable of handling complex, bidirectional objectshock interactions stably and robustly. We describe its applications to various visual effects, including explosion, sonic booms and turbulent flows. Furthermore, we explore parallelization schemes and demonstrate the scalability of our method on shared-memory, multi-core architectures.

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

physically-based modeling
animation
fluid simulation
parallel algorithms


Impact of computer training courses on reduction of loneliness of older people in Finland and Slovenia Previous research has shown loneliness as a threat for the quality of life of older people; therefore the goal of the intervention in a quasi-experimental study was to evaluate and discuss the self-reported level of loneliness of older people in Finland and Slovenia before and after a computer intervention. Intervention in a quasi-experimental study was conducted among 58 older participants at the baseline (M=72.4years) and 45 older participants at the follow-up research study (M=72.9years). Inferential statistics showed a significant difference in the reduction of loneliness between the countries, and a decreased level of loneliness of older people after completing the computer training course. Although older people experience many age-related problems which may reduce their interest in learning information and communication technology (ICT) skills, it is important that they are computer-proficient, because computer engagement can reduce the level of loneliness of older people and in this way has a positive effect on their quality of life.

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

older people
loneliness
computer training course


A general structure of achievement function for a goal programming model A key element of a goal programming model is the achievement function; that is, the function that measures the degree of minimisation of the unwanted deviation variables of the goals considered in the model. The three oldest and still most widely used forms of achievement functions are the following: Archimedean, lexicographic and MINMAX. While they are the most common, other newer versions can offer theoretical and practical advantages. These newer forms will be analytically described and interpreted in utility terms throughout this paper. The presentation will end with a very general structure, which encompasses as particular cases basically all the achievement functions proposed in the literature.

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


A design for a class of nonlinear systems with delay time using fuzzy logic The goal of this paper is to design a controller for a class of nonlinear systems with delay time using fuzzy logic. The control scheme considered in this paper integrates a fuzzy component and a sliding control component. In the former, the fuzzy system can be considered as a universal approximator to approximate the unknown functions in plant. In the latter, a variable structure control with a sector guarantees the global stability of the closed-loop system when a variable, involving tracking error, travels outside of the sector. The adaptive laws to adjust the parameters in the system are developed based on the Lyapunov synthesis approach. It is shown that the proposed adaptive controller guarantees tracking error, between the outputs of the considered system and desired values, to be asymptotical in decay.

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

delay time
global stability
nonlinear systems


Projection X-Space Magnetic Particle Imaging Projection magnetic particle imaging (MPI) can improve imaging speed by over 100-fold over traditional 3-D MPI. In this work, we derive the 2-D x-space signal equation, 2-D image equation, and introduce the concept of signal fading and resolution loss for a projection MPI imager. We then describe the design and construction of an x-space projection MPI scanner with a field gradient of 2.35 T/m across a 10 cm magnet free bore. The system has an expected resolution of 3.5 x 8.0 mm using Resovist tracer, and an experimental resolution of 3.8 x 8.4 mm resolution. The system images 2.5 cm x 5.0 cm partial field-of views (FOVs) at 10 frames/s, and acquires a full field-of-view of 10 cm 5.0 cm in 4 s. We conclude by imaging a resolution phantom, a complex "Cal" phantom, mice injected with Resovist tracer, and experimentally confirm the theoretically predicted x-space spatial resolution.

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

angiography biomedical imaging
magnetic particle imaging (mpi)
magnetic particles


Best-matching with interdependent preferencesimplications for capacitated cluster formation and evolution The notion of interdependent preferences is introduced to the generalized best matching problem. The problem (BMP-IP) is analogous to the capacitated clustering problem. A novel binary quadratic programming formulation is developed for the BMP-IP. Efficient evolutionary heuristics are developed to handle the formation and evolution of clusters. Results show significant impacts of IP on the static and dynamic BMP.

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

quadratic assignment problem
genetic algorithm
evolutionary algorithm
association/dissociation
emergence
collaborative control theory


path planning method for robots in complex ground environment based on cultural algorithm In complex ground environment, different regions have different road conditions. Path planning for robots in such environment is an open problem, which lacks effective methods. A novel global path planning method based on common sense and evolution knowledge is proposed by adopting dual evolution structure in culture algorithms. Common sense describes ground information and feasibility of environment, which is used to evaluate and select the paths. Evolution knowledge describes the angle relationship between the path and the obstacles, or the common segments of paths, which is used to judge and repair infeasible individuals. Taken two types of environments with different obstacles and road conditions as examples, simulation results indicate that the algorithm can effectively solve path planning problem in complex ground environment and decrease the computation complexity for judgment and repair of infeasible individuals. It also can improve the convergence speed and have better computation stability.

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

evolution knowledge
cultural algorithm
complex ground environment
path planning
common sense


Optimal rapid multidisciplinary response networks: RAPIDDISK The role of uncertainty in information rich design systems is critical to the development of advanced propulsion systems. Future turbine engines would have lower lifetime operating costs similar to current evolving automotive systems. Detailed multi-physics models (thermo-fluid, structural and mechanical systems) and an operational environment are enablers of rapid correction and model-based predictive analyses. Bayesian machine learning paradigms are developed to identify the behavior of turbo-machinery components for preliminary design. The embedded models approach enables systematic evolution from individual components level to the advanced engine. The embedded models approach enables systematic evolution from individual components level to the advanced engine. A rapid response strategy is proposed, for design of turbine disks by using multidisciplinary optimization and neural networks. iSIGHT optimization software is interfaced with ANSYS to find optimum designs for a given set of design boundary conditions (rpm, live rim load, thermals, etc.). The optimum designs obtained from iSIGHT for different set of design conditions are used for machine learning and design knowledge recognition using the neural network technique. The trained network is used to predict responses for design boundary conditions. Responses predicted by the neural network are validated using ANSYS. Discrete design points are chosen from the wide design space of turbine disks. A hierarchical neural network approach provides an ability to quickly train the network and predict responses (weight, stresses, burst margin, etc.) for applied design conditions. This basic building process involves four steps starting from identifying design boundary conditions to the prediction of design shape for the disk. Sensitivity-based scaling rules are developed, to accommodate different materials for the disk. The technique is developed in RAPIDDISK, which provides an optimal preliminary shape and design attributes for a turbine disk.

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

isight
neural networks
rapid response strategy
rapiddisk

basic building block approach and disk optimization


Clustering based on eigenspace transformation CBEST for efficient classification Large remote sensing datasets, that either cover large areas or have high spatial resolution, are often a burden of information mining for scientific studies. Here, we present an approach that conducts clustering after gray-level vector reduction. In this manner, the speed of clustering can be considerably improved. The approach features applying eigenspace transformation to the dataset followed by compressing the data in the eigenspace and storing them in coded matrices and vectors. The clustering process takes the advantage of the reduced size of the compressed data and thus reduces computational complexity. We name this approach Clustering Based on Eigen-space Transformation (CBEST). In our experiment with a subscene of Landsat Thematic Mapper (TM) imagery, CBEST was found to be able to improve speed considerably over conventional K-means as the volume of data to be clustered increases. We assessed information loss and several other factors. In addition, we evaluated the effectiveness of CBEST in mapping land cover/use with the same image that was acquired over Guangzhou City, South China and an AVIRIS hyperspectral image over Cappocanoe County, Indiana. Using reference data we assessed the accuracies for both CBEST and conventional K-means and we found that the CBEST was not negatively affected by information loss during compression in practice. We discussed potential applications of the fast clustering algorithm in dealing with large datasets in remote sensing studies.

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

land cover/use mapping
large dataset
landsat thematic mapper image
k-means
unsupervised classification


Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers Silva et al proposed a universal secure network coding scheme based on MRD codes which can be applied to any underlying net work code This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re select the tapping links during the transmission We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al s code for all choices of code parameters even with a restricted number of tapped links We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure

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

secure network coding
linear network coding
mrd code


Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service In the design and analysis of any queueing system, one of the main objectives is to reduce congestion which can be achieved by controlling either arrival-rates or service-rates. This paper adopts the latter approach and analyzes a single-server finite-buffer queue where customers arrive according to the Poisson process and are served in batches of minimum size a a with a maximum threshold limit b b . The service times of the batches are arbitrarily distributed and depends on the size of the batches undergoing service. We obtain the joint distribution of the number of customers in the queue and the number with the server, and distributions of the number of customers in the queue, in the system, and the number with the server. Various performance measures such as the average number of customers in the queue (system) and with the server etc. are obtained. Several numerical results are presented in the form of tables and graphs and it is observed that batch-size-dependent service rule is more effective in reducing the congestion as compared to the one when service rates of the batches remain same irrespective of the size of the batch. This model has potential application in manufacturing, computer-communication network, telecommunication systems and group testing.

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

batch-size-dependent service
bulk-service
finite-buffer


Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation The computation of the greatest common divisor (GCD) of many polynomials is a nongeneric problem. Techniques defining "approximate GCD" solutions have been defined, but the proper definition of the "approximate" GCD, and the way we can measure the strength of the approximation has remained open. This paper uses recent results on the representation of the GCD of many polynomials, in terms of factorisation of generalised resultants, to define the notion of "approximate GCD" and define the strength of any given approximation by solving an optimisation problem. The newly established framework is used to evaluate the performance of alternative procedures which have been used for defining approximate GCDs. (c) 2006 Elsevier Ltd. All rights reserved.

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


Modelling of dispersant application to oil spills in shallow coastal waters Application of dispersants in shallow water remains an issue of debate within the spill response community. An experimental oil spill to evaluate potential environmental impacts and benefits of applying dispersants to spills in shallow water has therefore been under consideration. One site being considered was Matagorda Bay, on the Texas coast. Coupled three-dimensional oil spill and hydrodynamic models were used to assist in the design of such an experiment. The purpose of the modeling work was to map hydrocarbon concentration contours in the water column and on the seafloor as a function of time following dispersant application. These results could assist in determining the potential environmental impact of the experiment, as well as guiding the water column sampling activities during the experiment itself. Eight potential experimental oil spill scenarios, each of 10 bbl in volume, were evaluated: 4 release points, each under two alternate wind conditions. All scenarios included application of chemical dispersants to the slick shortly after release. Slick lifetimes were under 5 h. Due to the shallow depths, some fraction (27%) of the released hydrocarbons became associated with bottom sediments. The algorithms used for the oil dropletsediment interactions are theoretical, and have not been verified or tested against experimental data, so the mass balances computed here must be considered tentative. Currents computed by the hydrodynamic model are consistent with previous observations: the circulation is largely tidally driven, especially near the ship channel entrance. In the center of the bay, the circulation appears relatively weak. The use of water column drifters with surface markers during the experiment would augment model results in assisting activities to monitor concentrations. These simulations suggest that the eventual behavior of an oil droplet cloud in the middle of the bay will be relatively insensitive to release point or time in the tidal cycle. A limited analysis was run to evaluate model sensitivity to the oil-sediment sorption coefficient. Increasing this coefficient by a factor of 10 results in an approximately linear increase in the fraction of oil in the sediments. Sensitivity of estimated time-to-zero-volume for the 0.1-ppm concentration contour demonstrated that the model prediction of 3.5 days was associated with an uncertainty of 12 h for a release of 10 barrels. This time estimate is also a function of the oil-sediment interaction rate, since more oil in the sediments means less oil in the water column.

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

oil spill model
hydrodynamics
nearshore dispersant application
shallow waters


Multi-objective cooperative coevolution of artificial neural networks (multi-objective cooperative networks) In this paper we present a cooperative coevolutive model for the evolution of neural network topology and weights, called MOBNET. MOBNET evolves subcomponents that must be combined in order to form a network, instead of whole networks. The problem of assigning credit to the subcomponents is approached as a multi-objective optimization task. The subcomponents in a cooperative coevolutive model must fulfill different criteria to be useful, these criteria usually conflict with each other. The problem of evaluating the fitness on an individual based on many criteria that must be optimized together can be approached as a multi-criteria optimization problems, so the methods from multi-objective optimization offer the most natural way to solve the problem. In this work we show how using several objectives for every subcomponent and evaluating its fitness as a multi-objective optimization problem, the performance of the model is highly competitive. MOBNET is compared with several standard methods of classification and with other neural network models in solving four real-world problems, and it shows the best overall performance of all classification methods applied. It also produces smaller networks when compared to other models. The basic idea underlying MOBNET is extensible to a more general model of coevolutionary computation, as none of its features are exclusive of neural networks design. There are many applications of cooperative coevolution that could benefit from the multi-objective optimization approach proposed in this paper.

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

evolutionary computation
multi-objective optimization
topology evolution
automatic neural network design


reduced cell switching in a mobile computing environment With the huge growth and the market for laptop and palmtop computer purchases, a rapid increase of mobile usage in the Internet is expected. As mobile nodes move in a wireless computer network, a mobile node must determine when to switch its link-level point of attachment to the wired network. In this paper, we present six cell switching techniques and discuss their attributes. Specifically, we present the Late, Early, and Strong cell switching techniques and three variations of them. We then investigate the performance of these six techniques to discover the best method a mobile node should use to determine when to perform its re-attachment to the wired network.

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

network
wireless
point
use
method
market
laptop
performance
attributes
switch
internet
paper
mobile computing

environments mobility variation computation linking


Modelling of aniline-vermiculite and tetramethylammonium-vermiculite; Test of force fields Molecular mechanics simulations in Cerius(2) have been used for modelling vermiculite intercalated with tetramethylammonium and aniline cations. The published structure data obtained for these intercalated structures from X-ray single crystal diffraction have been used to test the force fields and modelling strategy for organo-clays. The strategy of modelling was based on the nonbond host-guest interactions and on rigid silicate layers and rigid guest species. The rigidity of silicate layers requires that the cell parameters a, b and gamma are kept fixed during the energy minimisation. The energy term was set up using the nonbond interaction terms only and the Crystal Packer module in Cerius(2) has been used for the energy minimisation. In Crystal Packer the rigid units, i.e. the silicate layers and guest species can be translated and rotated during energy minimisation and the cell parameters c, alpha, and beta have been varied. Three sets of Van derWaals (VDW) parameters available in Crystal Packer: Tripos, Universal and Dreiding have been used in present molecular simulations. Ab initio MP2 calculations were performed to justify the application of the force field. The best agreement of molecular mechanics simulations with both: experimental and ab initio data was obtained with the Tripos VDW parameters for both intercalates. The results of modelling are in good agreement with the experimental data as to the cell parameters and the interlayer packing. The cell parameters reported by Vahedi-Faridi and Guggenheim (1997) for tetramethylammonium-vermiculite are: c = 13.616 Angstrom, alpha = 90 degrees, beta = 97.68 degrees; from the present modelling we obtained: c = 13.609 Angstrom, alpha = 90.19 degrees, beta = 97.56 degrees. Tetramethylammonium-cations are arranged in one layer in the interlayer space. One C-C edge of NC4 tetrahedra is perpendicular to the silicate layers. The deep immersion of the methyl groups into the ditrigonal cavities suggested by Vahedi-Faridi and Guggenheim was not confirmed by modelling. Slade and Stone (1984) presented the measured cell parameters for aniline vermiculite: c = 14.89 Angstrom, alpha = 90 degrees, beta = 97 degrees; present result is: c = 14.81 Angstrom , alpha = 90.72 degrees, beta = 96.70 degrees for partially exchanged vermiculite and c = 14.84 Angstrom, alpha = 90.53 degrees, beta = 97.17 degrees for fully exchanged vermiculite. The aniline cations are positioned over the ditrigonal cavities alternating in their anchoring to lower and upper silicate layer. The C-N bonds are perpendicular to layers.

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

vermiculite
aniline
tetramethylammonium
molecular mechanics


Quasi-hierarchical Powell-Sabin B-splines Hierarchical Powell-Sabin splines are C(1)-continuous piecewise quadratic polynomials defined on a hierarchical triangulation. The mesh is obtained by partitioning an initial conforming triangulation locally with a triadic split, so that it is no longer conforming. We propose a normalized quasi-hierarchical basis for this spline space. The basis functions have a local support, they form a convex partition of unity, and they admit local subdivision. We show that the basis is strongly stable on uniform hierarchical triangulations. We consider two applications: data fitting and surface modelling. (C) 2008 Elsevier B.V. All rights reserved.

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

powell-sabin splines
quasi-hierarchical splines
normalized basis
adaptive refinement


Root images of median filters Median filters are frequently used in signal analysis because of their smoothing properties and their insensitivity with respect to outliers in the data. Since median filters are nonlinear filters, the tools of linear theory are not applicable to them. One approach to deal with nonlinear filters consists in investigating their root images (fixed elements or signals transparent to the filter). Whereas for one-dimensional median filters the set of all root signals can be completely characterized, this is not true for higher dimensional filters. In 1989, Dohler stated a result on certain root images for two-dimensional median filters. Although Dohlers results are true for a wide class of median filters, his arguments were not correct and his assertions do not hold universally. In this paper we give a rigorous proof of Dohlers results. Moreover, his approach is generalized to the d-dimensional case.

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

d-dimensional digital geometry
digital convexity


Multi-level lot sizing and job shop scheduling with compressible process times: A cutting plane approach Simultaneous lot sizing and scheduling problem is formulated in a job shop. Machines are flexible to change their working speeds. Some valid inequalities are developed based on problem structures. The cuts are used in cut-and-branch and branch-and-cut approaches on a set of test data. The cuts are ranked by TOPSIS method by defining a set of performance indexes.

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

(p) production
process compressibility
cutting planes
multi-level lot sizing


An Exact Penalty Method for Free Terminal Time Optimal Control Problem with Continuous Inequality Constraints In this paper, we consider a class of optimal control problems with free terminal time and continuous inequality constraints. First, the problem is approximated by representing the control function as a piecewise-constant function. Then the continuous inequality constraints are transformed into terminal equality constraints for an auxiliary differential system. After these two steps, we transform the constrained optimization problem into a penalized problem with only box constraints on the decision variables using a novel exact penalty function. This penalized problem is then solved by a gradient-based optimization technique. Theoretical analysis proves that this penalty function has continuous derivatives, and for a sufficiently large and finite penalty parameter, its local minimizer is feasible in the sense that the continuous inequality constraints are satisfied. Furthermore, this local minimizer is also the local minimizer of the constrained problem. Numerical simulations on the range maximization for a hypersonic vehicle reentering the atmosphere subject to a heating constraint demonstrate the effectiveness of our method.

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

optimal control
constrained optimization

nonlinear programming
exact penalty functions
hypersonic vehicles


aesop: a tool for automated transistor sizing This work addresses the problem of automating the electrical optimization of combinatorial MOS circuits. Improvements to a circuit's speed, area and power consumption are sought through modifications to the transistor sizes in the circuit; no changes in the circuit structure, number of gates or clocking are introduced. Linear algorithms are presented for computing optimal transistor sizes to minimize delay, area or power. These algorithms are implemented in an interactive tool, Aesop. Aesop is a powerful and fast what-if tool that allows the designer to explore the space of designs having optimal transistor sizes. When compared to manual designs, the circuits produced by Aesop are typically faster or have substantially lower area and power consumption. Compared to untuned circuits, Aesop typically increases circuit speed by a factor of 2 to 4. Alternatively, power consumption and transistor area can be reduced by 25 50\% with no sacrifice in circuit speed. These improvements are computed interactively on a professional workstation for circuits containing thousands of transistors.

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

structure
power consumption
factor
space
delay
tool
power
circuits

interaction optimality size design computation clock algorithm automation exploration change


Object density-based image segmentation and its applications in biomedical image analysis In many applications of medical image analysis, the density of an object is the most important feature for isolating an area of interest (image segmentation). In this research, an object density-based image segmentation methodology is developed, which incorporates intensity-based, edge-based and texture-based segmentation techniques. The proposed method consists of three main stages: preprocessing, object segmentation and final segmentation. Image enhancement, noise reduction and layer-of-interest extraction are several subtasks of preprocessing. Object segmentation utilizes a marker-controlled watershed technique to identify each object of interest (OI) from the background. A marker estimation method is proposed to minimize over-segmentation resulting from the watershed algorithm. Object segmentation provides an accurate density estimation of OI which is used to guide the subsequent segmentation steps. The final stage converts the distribution of OI into textural energy by using fractal dimension analysis. An energy-driven active contour procedure is designed to delineate the area with desired object density. Experimental results show that the proposed method is 98% accurate in segmenting synthetic images. Segmentation of microscopic images and ultrasound images shows the potential utility of the proposed method in different applications of medical image processing.

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

object density-based image segmentation
medical images
mathematical morphology
marker-controlled watershed
active contour without edges


active transaction approach for collaborative virtual environments Active Transactions is a novel approach for Collaborative Virtual Environments (CVE). It is based on the transaction concept from database systems, however it was adapted to fit better the requirements of CVE.The transactions brings new benefits for CVE. They guarantee atomic execution of their updates. They provide advanced consistency guarantees that may result in simpler application design, and the speculative transaction execution enables to exploit prediction algorithms to provide an user with high responsiveness.The transaction concept is combined with active replication of the scene data. Active replication enables some performance optimizations of the transaction concept. Therefore, we call it active transaction approach.

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

networked virtual reality
scene graph
distributed graphics


Inequalities for convex sequences and their applications Using the theory of majorization, new inequalities for convex sequences are proved. A necessary and sufficient condition for a convex sequence is established. This reveals an important relationship between the convex sequence and the majorized inequality. Finally, some applications of our new inequalities and some improvements of certain known results are presented.

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

convex function
hermitehadamards inequality
maclaurins inequality
estimate


A study of degradation of indium tin oxide thin films on glass for display applications Indium tin oxide (ITO) has been widely used in liquid crystal displays (LCD). Contamination and moisture have proved to have the adverse effect of causing ITO corrosion/degradation. The purpose of this paper is to determine if scratching the surface of ITO is a cause of ITO degradation. Additionally, the influence of the width of ITO tracks on degradation was observed under accelerated testing. Simultaneously, anisotropic conductive adhesive film (ACF) was added to the ITO surface, to determine any adverse degradation effect. It was determined that the time to initiate corrosion was faster if the ITO was scratched, and that the degradation was directly related to the surface area of the ITO electrodes.

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

ito corrosion
accelerated degradation test


Earliness-tardiness scheduling with setup considerations The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented. (C) 2003 Elsevier Ltd. All rights reserved.

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

earliness-tardiness scheduling
mip formulation
branch-and-bound
heuristics


Solving equations in the relational algebra Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study sparse equations, which are equations with at most polynomially many solutions. We look at their complexity and compare their expressive power with that of similar notions in the powerset algebra.

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

nested relation
fagin's theorem
sparse expression
parity


On optimal intervention for customer lifetime value The potential value of a customer to a commercial organisation can be a core ingredient in decision-making. There is a growing literature on the topic, much of it presented in rather general terms. In this paper, we examine a particular aspect, namely the expected income to the firm from a customer over his lifetime (period of tenure with the firm). To derive quantitative results, we adopt a type of model in which there are underlying income and cost processes for a customer that evolve over time. In addition, we include a customer-specific effect that reflects the fact that some customers give rise to more income than others. These two stochastic elements are monitored by the firm for each new customer over an initial probationary period. Depending on the result of this assessment the firm might decide to offer a continuation of the account, perhaps on modified terms. The problem for the firm, which is the case addressed here, is to determine the length of the probationary period and the criterion for continuation. We set out a framework in which these two aspects may be optimised.

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

stochastic processes
uncertainty modelling
banking
account management
customer review


LCD Motion Blur: Modeling, Analysis, and Algorithm Liquid crystal display (LCD) devices are well known for their slow responses due to the physical limitations of liquid crystals. Therefore, fast moving objects in a scene are often perceived as blurred. This effect is known as the LCD motion blur. In order to reduce LCD motion blur, an accurate LCD model and an efficient deblurring algorithm are needed. However, existing LCD motion blur models are insufficient to reflect the limitation of human-eye-tracking system. Also, the spatiotemporal equivalence in LCD motion blur models has not been proven directly in the discrete 2-D spatial domain, although it is widely used. There are three main contributions of this paper: modeling, analysis, and algorithm. First, a comprehensive LCD motion blur model is presented, in which human-eye-tracking limits are taken into consideration. Second, a complete analysis of spatiotemporal equivalence is provided and verified using real video sequences. Third, an LCD motion blur reduction algorithm is proposed. The proposed algorithm solves an l(1)-norm regularized least-squares minimization problem using a subgradient projection method. Numerical results show that the proposed algorithm gives higher peak SNR, lower temporal error, and lower spatial error than motion-compensated inverse filtering and Lucy-Richardson deconvolution algorithm, which are two state-of-the-art LCD deblurring algorithms.

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

human visual system
liquid crystal displays (lcds)
spatial consistency
temporal consistency


Prefetch-Aware Memory Controllers Existing DRAM controllers employ rigid, nonadaptive scheduling and buffer management policies when servicing prefetch requests. Some controllers treat prefetches the same as demand requests, and others always prioritize demands over prefetches. However, none of these rigid policies result in the best performance because they do not take into account the usefulness of prefetches. If prefetches are useless, treating prefetches and demands equally can lead to significant performance loss and extra bandwidth consumption. In contrast, if prefetches are useful, prioritizing demands over prefetches can hurt performance by reducing DRAM throughput and delaying the service of useful requests. This paper proposes a new low hardware cost memory controller, called as Prefetch-Aware DRAM Controller (PADC), that aims to maximize the benefit of useful prefetches and minimize the harm caused by useless prefetches. The key idea is to 1) adaptively prioritize between demands and prefetches, and 2) drop useless prefetches to free up memory system resources, based on prefetch accuracy. Our evaluation shows that PADC significantly outperforms previous memory controllers with rigid prefetch handling policies. Across a wide range of multiprogrammed SPEC CPU 2000/2006 workloads, it improves system performance by 8.2 and 9.9 percent on four and eight-core systems while reducing DRAM bandwidth consumption by 10.7 and 9.4 percent, respectively.

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

memory systems
prefetching
multi-core systems


HMM-Based Lexicon-Driven and Lexicon-Free Word Recognition for Online Handwritten Indic Scripts Research for recognizing online handwritten words in Indic scripts is at its early stages when compared to Latin and Oriental scripts. In this paper, we address this problem specifically for two major Indic scripts-Devanagari and Tamil. In contrast to previous approaches, the techniques we propose are largely data driven and script independent. We propose two different techniques for word recognition based on Hidden Markov Models (HMM): lexicon driven and lexicon free. The lexicon-driven technique models each word in the lexicon as a sequence of symbol HMMs according to a standard symbol writing order derived from the phonetic representation. The lexicon-free technique uses a novel Bag-of-Symbols representation of the handwritten word that is independent of symbol order and allows rapid pruning of the lexicon. On handwritten Devanagari word samples featuring both standard and nonstandard symbol writing orders, a combination of lexicon-driven and lexicon-free recognizers significantly outperforms either of them used in isolation. In contrast, most Tamil word samples feature the standard symbol order, and the lexicon-driven recognizer outperforms the lexicon free one as well as their combination. The best recognition accuracies obtained for 20,000 word lexicons are 87.13 percent for Devanagari when the two recognizers are combined, and 91.8 percent for Tamil using the lexicon-driven technique.

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

word recognition
lexicon driven
lexicon free
devanagari
tamil

online handwriting recognition
bag of symbols
symbol order variation


Breaching Euclidean distance-preserving data perturbation using few known inputs We examine Euclidean distance-preserving data perturbation as a tool for privacy-preserving data mining. Such perturbations allow many important data mining algorithms (e.g. hierarchical and k-means clustering), with only minor modification, to be applied to the perturbed data and produce exactly the same results as if applied to the original data. However, the issue of how well the privacy of the original data is preserved needs careful study. We engage in this study by assuming the role of an attacker armed with a small set of known original data tuples (inputs). Little work has been done examining this kind of attack when the number of known original tuples is less than the number of data dimensions. We focus on this important case, develop and rigorously analyze an attack that utilizes any number of known original tuples. The approach allows the attacker to estimate the original data tuple associated with each perturbed tuple and calculate the probability that the estimation results in a privacy breach. On a real 16-dimensional dataset, we show that the attacker, with 4 known original tuples, can estimate an original unknown tuple with less than 7% error with probability exceeding 0.8. (C) 2012 Elsevier B.V. All rights reserved.

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


Multi-Modal Sensing M2M Healthcare Service in WSN A multi-modal sensing M2M healthcare monitoring system for the continuous monitoring of patients under their natural physiological states or elderly persons with chronic diseases is summarized. The system is designed for homecare or the monitoring of the elderly who live in country side or small rest home without enough support from caregivers or doctors, instead of patient monitoring in big hospital environment. Further insights into the natural cause and progression of diseases are afforded by context-aware sensing, which includes the use of accelerometers to monitor patient activities, or by location-aware indoor tracking based on ultrasonic and RF sensing. Moreover, indoor location tracking provides information about the location of patients in their physical environment and helps the caregiver in the provision of appropriate support.

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

routing protocol
multi-hop communication


Automatic detection of musicians ancillary gestures based on video analysis A novel approach for the detection of ancillary gestures produced by clarinetists during musical performances. Detect, segment and track points of interest and parts of the musician body in video scenes. Detect the three most commonly seen ancillary gestures of this class of musicians. Evaluation with respect to the precision and recall in detecting ancillary gestures on 12,423 video frames. Precision in detecting ancillary gestures varies between 78.4% and 92.8%, while the recall varies between 85.3% and 95.5%.

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


A parameter-reduced volterra model for dynamic RF power amplifier Modeling based on orthonormal basis functions A nonlinear dynamic behavioral model for radio frequency power amplifiers is presented. It uses orthonormal basis functions, Kautz functions, with complex poles that are different for each nonlinear order. It has the same general properties as Volterra models, but the number of parameters is significantly smaller. Using frequency weighting the out-of-band model error can be reduced. Using experimental data it was found that the optimal poles were the same for different input powers and for the different nonlinear orders. The optimal poles were also the same for direct and inverse models, which could be explained theoretically to be a general property of nonlinear systems with negligible linear memory effects. The model can be used as either a direct or inverse model with the same model error for power amplifiers with negligible linear memory effects. (c) 2007 Wiley Periodicals, Inc.

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

nonlinear distortion
orthogonal functions
radio transmitters
inverse problems
parameter reduction


Spatially correlated forest stand structures: A simulation approach using copulas Spatial structure of forest stands is one of the main drivers of forest growth and yield, and is an important indicator of wildlife habitat, aesthetics, and other non-timber forest uses. Because spatial structure is costly to measure, a number of approaches for simulating spatial structures have been proposed. In this paper, we propose a simple approach that is capable of generating multispecies stand structures. Based on the method of copulas (Genest and MacKay, 1986, Am. Stat. 40:280283), we utilize a normal copula to simulate spatially correlated stand structures. Species composition, diameter, height, and crown ratio distributions of each species, and their correlation with underlying spatial patterns are all controlled by user inputs. Example data sets are used to demonstrate how to estimate required parameters and compare simulated spatial structures with observed spatial structures. Except at the smallest scales (<10m in the longleaf pine dataset and <2m in the mixed Acadian Forest dataset), the simulated stand structures adequately captured the observed spatial patterns. Based on these comparisons, we conclude that the system is capable of simulating a range of forest stand spatial structures.

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


effective query expansion with the resistance distance based term similarity metric In this paper, we define a new query expansion method that relies on term similarity metric derived from the electric resistance network. This proposed metric lets us measure the mutual relevancy in between terms and between their groups. This paper shows how to define this metric automatically from the document collection, and then apply it in query expansion for document retrieval tasks. The experiments show this method can be used to find good expansion terms of search queries and improve document retrieval performance on two TREC genomic track datasets.

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


An extensible system for source code analysis Constructing code analyzers may be costly and error prone ii inadequate technologies and tools are used. If they are written in a conventional programming language, for instance, several thousand lines of code may be required even for relatively simple analyses. One way of facilitating the development of code analyzers is to define a Very high-level domain-oriented language and implement an application generator that creates the analyzers from the specification of the analyses they are intended to perform. This paper presents a system for developing code analyzers that uses a database to store both a no-loss fine-grained intermediate representation and the results of the analyses. The system uses an algebraic representation, called F(p), as the user-visible intermediate representation. Analyzers are specified in a declarative language, called F(p) - I,which enables an analysis to be specified in the form of a traversal of an algebraic expression, with access to, and storage of, the database information the algebraic expression indices. A foreign language interface allows the analyzers to be embedded in C programs. This is useful for implementing the user interface of an analyzer, for example, or to facilitate interoperation of the generated analyzers with pre-existing tools. The paper evaluates the strengths and limitations of the proposed system, and compares it to other related approaches.

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

reverse engineering
software maintenance
intermediate program representations
tool generation
integration


proposal of an improved motion estimation module for svc In October 2007 ITU-T and MPEG organizations published the Scalable Video Coding (SVC) specification as an addendum to the H.264 standard. Basically SVC enables H.264 video encoders to support temporal, spatial and SNR scalability. This new functionalities lead to more flexibility on bandwidth management and robustness against packet losses. It is therefore more suitable for heterogeneous multimedia applications like IPTV and mobile networks. However implementations of SVC specification are still limited due the augmented computational complexity. One of the most critical SVC algorithms is the motion estimation module, which allows identification of extra intra and inter-layer redundancies. The great computation demand of this module is responsible for the large SVC encoder latency time, restraining its use in real-time applications. We propose in this paper a new motion estimation approach specially designed to reduce memory accesses and data comparisons in order to increase performance. Experimental results prove significant gains in speed (up to 6 times faster) with small effects on quality (less than 0.2 dB).

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


continuous archival and analysis of user data in virtual and immersive game environments We present a continuous and unobtrusive approach to analyze and reason about users' personal experiences of interacting with virtual and game environments. Focusing on an immersive educational game environment that we are developing, this is achieved through the capture and storage of user's movements and events that occur as a result of interactions with and within immersive environments. Termed immersidata , we then query and analyze immersidata to make sense of user behavior.Two example approaches are described. The first describes an application ISIS (Immersidata analySIS) that provides a tool for analysis of user behavior/experience through the indexing of immersidata with video clips of students' gaming sessions. This approach is described by way of an example to identify the causes of interruptions or breaks in interactions/focus of attention to facilitate the identification of problematic design. In our second example we describe our work towards classifying students' performance through immersidata. To this aim, we describe one example of transforming immersidata into multivariate time series and then by applying feature subset selection techniques we identify the features that differentiate students. We describe the application of this approach to identify novice and expert players with 90\\% accuracy. One proposal is to use this to customize the game environment appropriate to the students' ability. Finally, we present future directions for the continuation of the work presented herein and also, the application of the immersidata system to capture, store and analyze personal behavior/experiences and provide appropriate feedback in our work and home environments.

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

breaks
feature subset selection
immersidata analysis
multivariate time series


Hybrid state approach for modelling electrical and mechanical systems Many engineering systems contain discrete components or decision makers as well as continuous dynamical components. The variables in these systems can be quantitatively represented by discrete and continuous states. These states affect each other in the system. These types of complex systems can be modelled by hybrid state systems. In this study, a hybrid state approach is presented to model electrical and mechanical systems. Two representative examples, which can not be directly modelled by the nonlinear system approach, are provided to demonstrate the effectiveness of the hybrid state approach in modelling. (c) 2005 Elsevier Ltd. All rights reserved.

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

hybrid systems
discrete and continuous systems


A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, two diversity maintaining methods, called adaptive dual mapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments.

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

memetic algorithm
local search
dual mapping
dynamic optimization problems

genetic algorithm
crossover-basedhill climbing
mutation-based hill climbing
triggeredrandom immigrants


Replication methods for load balancing on distributed storages in P2P networks In a Peer-to-Peer (P2P) network, in order to improve the search performance and to achieve load balancing, replicas of original data are created and distributed over the Internet. However, the replication methods which have been proposed so far focus only on the improvement of search performance. In this paper, we examine the load on the storage systems, which is due to writing and reading, and propose two replication methods for balancing the load on the storages distributed over P2P networks while limiting the degradation of the search performance within an acceptable level. Furthermore, we investigate the performance of our proposed replication methods through computer simulations, and show their effectiveness in balancing the load.

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

peer-to-peer (p2p)
power-law network
replication method
storage load balancing


Security models for delegated keyword searching within encrypted contents Within modern internet infrastructure including networks that are ubiquitous, there is often a need for delegatable communication between nodes without compromising the confidentiality of information. In practice, this should be enforced while allowing some basic functionality for intermediate delegated nodes such as searching through encrypted content. This can be achieved using a Public key encryption with keyword search (PEKS) scheme, first proposed by Boneh et al., which enables to search publicly encrypted messages for keywords without revealing any information about the message. The issue of PEKS schemes being vulnerable to keyword guessing attacks (KGAs) was first shown by Byun et al., and two of the most recent PEKS schemes, i.e., due to Rhee et al. in (ASIACCS, pp 376379, 2009; IEICE Electron Express 6(5):237243, 2009) and (J Syst Softw 83(5):763771, 2010), respectively, are designed with this security in mind. In this paper, we treat this KGA problem in detail and define new security models to capture KGAs against PEKS and designated PEKS schemes. These models are more security sufficient than the model considered by Rhee et al. (J Syst Softw 83(5):763771, 2010); indeed the latter model does not afford sufficient adversarial capability in the sense that it is much weaker than the adversarial capability considered in the original IND-CKA model of Boneh et al. Our new models allow to capture KGAs on three recent designated PEKS schemes that cannot be captured in the weaker model of Rhee et al.

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

public-key encryption with keyword search


Positive solutions for a fractional boundary value problem with p-Laplacian operator In this paper, we are mainly concerned with positive solutions for a p-Laplacian fractional boundary value problem. By virtue of Jensens inequalities and some new properties of the Green function of the problem, we adopt the Krasnoselskii-Zabreiko fixed point theorem to establish the results of existence and multiplicity of the positive solutions. Finally, a uniqueness theorem is established by using a fixed point theorem of concave operator and an example is given to illustrate the result.

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

krasnoselskii-zabreiko fixed point theorem


The relationship between citation errors and library anxiety: An empirical study of doctoral students in education The present study investigated whether levels of library anxiety predict simultaneously the citation error rate and quality of reference lists in doctoral dissertation proposals among 93 doctoral students in education. This study was unique for at least two reasons. First, it was one of the first studies to examine bibliographic citation inaccuracies in doctoral research proposals. Second, the current investigation was one of the first to investigate the psychological characteristics of doctoral students who commit such errors. A canonical correlation analysis revealed a multivariate relationship between levels of library anxiety and both the citation error rate and quality of reference lists. This finding suggests that level of library anxiety plays an important role in students' ability to construct accurate reference lists. The implications of these findings are discussed. Published by Elsevier Ltd.

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


efficient user revocation for privacy-aware pki Privacy-aware Public Key Infrastructure (PKI) can maintain user access control and yet protect user privacy, which is envisioned as a promising technique in many emerging applications. To justify the applicability of privacy-aware PKI and optimize the performance, it is highly important to ensure the efficiency of handling user revocations. In practice, user revocation can be due to various predictable and unpredictable reasons, e.g., subscription expiration, network access policy violation, group changing, secret key exposure, etc. Both predictable and unpredictable reasons can happen concurrently, which makes the design of efficient user revocation mechanism challenging. In this paper, we study how to achieve optimized user revocation cost with respect to various revocation approaches. We also propose an advanced scheme Delta-RL that ensures an optimized overall performance in terms of communication, computation and storage, as justified by the extensive analysis.

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


managing space for finite-state verification Finite-state verification (FSV) techniques attempt to prove properties about a model of a system by examining all possible behaviors of that model. This approach suffers from the state-explosion problem, where the size of the model or the analysis costs may be exponentially large with respect to the size of the system. Using symbolic data structures to represent subsets of the state space has been shown to usually be an effective optimization approach for hardware verification. The value for software verification, however, is still unclear. In this paper, we investigate applying two symbolic data structures, Binary Decision Diagrams (BDDs) and Zero-suppressed Binary Decision Diagrams (ZDDs), in two FSV tools, LTSA and FLAVERS. We describe an experiment showing that these two symbolic approaches can improve the performance of both FSV tools and are more efficient than two other algorithms that store the state space explicitly. Moreover, the ZDD-based approach often runs faster and can handle larger systems than the BDD-based approach.

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


Design of convergent product concepts based on functionality: An association rule mining and decision tree approach Recent trends in paradigms of digital convergence have accentuated the notions of convergent products that are formed by adding new functions to an existing base product. However, a lacuna still remains in the literature as to systematic design of convergent product concepts (CPCs) based on functionality. This study proposes a systematic approach to design of CPCs based on online community information using data mining techniques. At the heart of the suggested approach is the combined use of association rule mining (ARM) and decision tree (DT) for discovering the significant relationships among items and detecting the meaningful conditions of items. Specifically, the proposed approach is composed of four steps: data collection and transformation, definition of target functions, identification of critical product features, and specification of design details. Three maps - function co-preferences map, feature relations map, and concepts specification map - are developed to aid decision making in design of CPCs, structuring and visualizing design implications. A case of the portable multimedia player (PMP) is presented to illustrate the proposed approach. We believe that our approach can reduce uncertainty and risk involved in the concept design stage. (C) 2012 Elsevier Ltd. All rights reserved.

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

convergent product
concept design
online community information

new product development (npd)
text mining
association rule mining (arm)
decision tree (dt)


A control system for automated multiscale measuring systems Quality inspection of micro systems on wafer scale must cope with conflicting demands: nanometer accuracy and high velocity in a comparatively large workspace. An Automated Multiscale Measuring System (AMMS) combines multiple sensors that operate at specific scales by an intelligent measurement strategy in order to balance speed and accuracy. The AMMS demonstrator is based on a modified Mahr MFU 100 with a position and tilt deflection measurement resolution of 1 nm. In this paper multiscale models of a horizontal axis with an operating range of 200 mm and their application to state linearization and control parameterization of the residual dynamics according to multiscale sensor system characteristics are developed and discussed. Main modeling issues are sliding and submicron presliding friction for model-based compensation and control, reaching from submicron positioning to high-velocity trajectory tracking with desired performance. A new experimental design for the identification of presliding friction parameters and a higher-order friction calculator are presented. Experimental results show the effectiveness of this approach. (C) 2011 Elsevier Ltd. All rights reserved.

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

multiscale inspection system
multiscale parameterization
coordinate measurement machine