Lambda-neighborhood wavelet shrinkage We propose a wavelet-based denoising methodology based on total energy of a neighboring pair of coefficients plus their "parental" coefficient. The model is based on a Bayesian hierarchical model using a contaminated exponential prior on the total mean energy in a neighborhood of wavelet coefficients. The hyperparameters in the model are estimated by the empirical Bayes method, and the posterior mean, median and Bayes factor are obtained and used in the estimation of the total mean energy. Shrinkage of the neighboring coefficients are based on the ratio of the estimated and the observed energy. It is shown that the methodology is comparable and often superior to several existing and established wavelet denoising methods that utilize neighboring information, which is demonstrated by extensive simulations on a standard battery of test functions. An application to real-word data set from inductance plethysmography is also considered. (C) 2012 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 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

bayesian estimation
block thresholding
noncentral chi-square
nonparametric regression


Bidirectional colorless gigabit WDM-passive optical networks by use of injection locking and optical carrier suppression A new bidirectional wavelength division multiplexed-passive optical network architecture for colorless optical line terminal and optical network unit was proposed by the use of injection locking of FabryPerot laser diode and optical carrier suppression. Error free transmissions (bit error rate of 10?9) of both 1.25-Gb/s downstream signal and upstream signal were experimentally demonstrated at three representative wavelengths (1530.364, 1540.14, and 1556.713 nm). Accordingly, both optical line terminal and optical network unit were colorlessly operated within 25-nm range. Also, there was little impact of leaked channel on adjacent main one.

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

injection locking
optical carrier suppression

reflective semiconductor optical amplifier


Engineering societal information systems by agent-oriented modeling This article is concerned with the engineering of societal information systems where technical components of a system - software agents - support the social network around which the system is centered. We propose agent-oriented modeling as a suitable software engineering approach for developing open and adaptive societal information systems. The article first outlines the steps of the software engineering process of agent-oriented modeling and shows how the resulting models can be mapped to the simulation environment. It then describes two case studies where agent-oriented modeling has successfully been applied. The first case study addresses the development of an agent-based decision-making system for helping customers in grocery shopping. The second case study treats the engineering of a societal information system for helping patients in finding healthcare providers. The simulation results from both case studies are presented and discussed. We conclude the article by comparing related work and drawing conclusions.

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

agent
multi-agent system
agent-oriented modeling
socio-technical system


Modeling output energy based on fossil fuels and electricity energy consumption on dairy farms of Iran: Application of adaptive neural-fuzzy inference system technique An ANFIS modeling of energy demand in dairy farming is reported. The total energy output was calculated as 58,315MJcow?1. Fuels and electricity energy were inputs and output energy was output of modeling. Linear regression analysis was done to compare the results using R2, RMSE and MAPE. ANFIS performed better versus regression analysis (higher R2, less RMSE and MAPE).

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

dairy farming
energy consumption
electricity

adaptive neural-fuzzy inference system
fossil-based fuels


A method for determining generators shares in loads, line flows and losses This paper presents a new method for calculating the individual generators shares in line flows, line losses and loads. The method is described and illustrated on active power flows, but it can be applied in the same way to reactive power flows. Starting from a power flow solution, the line flow matrix is formed. This matrix is used for identifying node types, tracing the power flow from generators downstream to loads, and to determine generators participation factors to lines and loads. Neither exhaustive search nor matrix inversion is required. Hence, the method is claimed to be the least computationally demanding amongst all of the similar methods.

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

power flow tracing
open access transmission
energy market


Knowledge-based assessment of watershed condition The USDA Forest Service and Environmental Protection Agency have cooperatively developed a knowledge base for assessment and monitoring of ecological states and processes in sixth-code watersheds. The knowledge base provides a formal logical specification for evaluating watershed processes, patterns, general effects of human influence, and specific effects on salmon habitat. The knowledge base was designed in the NetWeaver knowledge base development system and evaluated in the Ecosystem Management Decision Support (EMDS) system. EMDS is an application framework for knowledge-based decision support of ecological landscape analysis at any geographic scale. The system integrates geographic information system and knowledge base system technologies to provide an analytical tool for environmental assessment and monitoring. The basic objective of EMDS is to improve the quality and completeness of environmental assessments and the efficiency with which they are performed. This paper presents an overview of the NetWeaver and EMDS systems, describes the general structure of the knowledge base for watershed assessment, and presents a small example of its use for evaluating erosion processes. Published by Elsevier Science B.V.

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

watershed assessment
ecosystem management
decision support
netweaver


gray-box extraction of execution graphs for anomaly detection Many host-based anomaly detection systems monitor a process by observing the system calls it makes, and comparing these calls to a model of behavior for the program that the process should be executing. In this paper we introduce a new model of system call behavior, called an execution graph . The execution graph is the first such model that both requires no static analysis of the program source or binary, and conforms to the control flow graph of the program. When used as the model in an anomaly detection system monitoring system calls, it offers two strong properties: (i) it accepts only system call sequences that are consistent with the control flow graph of the program; (ii) it is maximal given a set of training data, meaning that any extensions to the execution graph could permit some intrusions to go undetected. In this paper, we formalize and prove these claims. We additionally evaluate the performance of our anomaly detection technique.

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


Self-localization method for mobile robot using acoustic beacons In this paper, we have proposed a low-cost self-localization method which uses 4 elements of microphones, wheel rotation and sound sources as beacons, whose absolute location and frequency bands are known. The proposed method consists of following 4 steps. The proposed method (i) execute self-localization using wheel-based odometry, (ii) estimate direction-of-arrival (DOA) of the sound sources using sounds recorded by the elements of the microphone array, (iii) predict the DOA of the sound sources from estimated location and pose, and (iv) conduct self-localization by integrating all of the information. To evaluate the proposed method, experiments were conducted. The proposed method was compared to the conventional methods, which were wheel-based odometry and self-localization using only DOA. In the experiments, we have supposed the house-cleaning robot and its trajectory. As results, without any obstacles or walls, the mean of the estimation errors by wheel-based odometry were 670 mm and 0.08 rad, and those of self-localization using only DOA were 2870 m and 0.07 rad in the worst case. In contrast with these methods, proposed method results in 69 mm, 0.02 rad as the worst estimation error of self location and pose. From the result with occlusion of a sound source, the mean of the localization error increased 60 mm, as the proposed method detects the incorrect DOA and prevents it from estimation. From the result with reflective wave from wall, there was a place where the localization error was large. The cause of this error was considered as directivity of sound source. These results indicate that the proposed method is feasible under indoor environment.

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

mobile robot
acoustic beacons
microphone array


A DDS-based middleware for quality-of-service and high-performance networked robotics Social robots must adapt to dynamic environments, human interaction partners and challenging new stringent tasks. Their inner software is usually distributed and should be designed and deployed carefully because slight changes in the robot's requirements can have an important impact not only on the existing source code but also on the resulting performance at run-time. This paper proposes an implementation of this inner software using a new lightweight middleware for networked robotics called Nerve. The principal novelty this middleware has with respect to other state-of-the-art approaches is that it guarantees both scalability and QoS, which are key requirements for real-time robotics software. The benefits of Nerve have been proved through its use in two key components of the cognitive system of a social robot: (i) the visual attention mechanism, used to extract relevant data from perceived images; and (ii) a robot learning by imitation control architecture that allows the social robot to be taught by people using natural demonstrations (i.e. using the same communication channels that would be used to teach people). Nerve makes use of existing patterns for networked applications together with the recent Data Distribution Service specification, which is a publish/subscribe standard for real-time and distributed systems that provides a wide set of QoS policies. In this paper, these different QoS policies have been applied carefully to achieve the best performance of the target robot. Copyright (C) 2012 John Wiley & Sons, Ltd.

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

robotics
middleware
data distribution service
performance
qos


Wavelet-based semi-fragile watermarking with tamper detection In this letter. a novel wavelet-based semi-fragile watermarking scheme is presented which exploiting the time-frequency feature of discrete wavelet transform (DWT) and high sensitivity on initial value of chaotic map. We also analyze the robustness to mild modification and fragility to malicious attack of our scheme. Its application includes tamper detection. image verification and copyright protection of multimedia content. Simulation results show the scheme can detect and localize Malicious attacks with high peak signal-to-noise ratio (PSNR), while tolerating certain degree of JPEG compression and channel additive white Gaussian noise (AWGN).

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


on complementary and independent mappings on databases We define the notion of independent views to indicate whether the range values of the two views may be achieved independently The concept of complementary views indicates when the domain element can be uniquely determined by the range values of the two complementary views We consider the relationship between independent and complementary views In unrestricted domains, a view (but not the identity or empty view) can have more than one complementary, independent view Databases, however, are more restricted domains They are finite power sets A view is monotonic if it preserves inclusion However, in finite power sets when all views are monotonic, if a given view has another view which is independent and complementary, then this view is unique.

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

view update
database theory
complementary mappings
relational databases


A part recognition based computer aided assembly system In this paper, a new approach has been developed to recognize the CAD models through their face adjacency relations and attributes and to automatically assemble the recognized parts in a CAD environment. Adjacent faces and the face attributes belonging to each face of parts designed in a CAD platform are derived by using of standard for the exchange of product data (STEP) file. They are represented in a square matrix format named face oriented relation matrix (FORM). An expert system was developed and embedded within the system. A knowledge base of the expert system is generated using a text editor. Reasoning the face adjacency relations and the face attributes in the knowledge base and FORM, the parts are recognized. Then, a reference face belonging to recognized parts is determined and they are positioned and assembled in assembly file through their reference faces. Part recognition approach developed in this study is applied to a computer aided assembly system. But it may be useful and practical for different CAD/CAM applications such as process planning and group technology too. The algorithm has been applied to a diesel automobile engine which has complex parts to demonstrate its efficiency and capability. (C) 2007 Elsevier B.V. All rights reserved.

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

step
form
part recognition
computer aided assembly
expert system


New linear codes with covering radius 2 and odd basis On the way of generalizing recent results by Cock and the second author, it is shown that when the basis q is odd, BCH codes can be lengthened to obtain new codes with covering radius R = 2. These constructions (together with a lengthening construction by the first author) give new infinite families of linear covering codes with codimension r = 2k + 1 (the case q = 3, r = 4k + 1 was considered earlier). New code families with r = 4k are also obtained. An updated table of upper bounds on the length function for linear codes with r less than or equal to 24, R = 2, and q = 3, 5 is given.

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


achieving pervasive awareness through artwork Aesthetics and ludic aspects of pervasive awareness applications make the awareness system more attractive and aesthetically pleasing to its users. The same objective can be achieved by adding pervasive awareness features to an aesthetic object such as an artwork. In this article we describe how an artwork can be transformed to an pervasive awareness application by adding awareness features into the artwork.

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


Three-dimensional absorbing boundary for analysis of fluid-saturated porous media Saturated porous media shows a complicated interaction behaviour of solid and fluid. The new formulation, called thin layer method, is able to absorb all kind of energies. It computes the associated mode shapes for both Rayleigh and Love surface waves in saturated soil. In this method, effect of pore water pressure generation is considered in three-dimensional condition. In the soil-structure interaction analysis the submerged condition affects significantly the characteristics of the waves generated by the dynamic excitations and increases the soil stiffness when loading rate is fast relative to the pore fluid diffusions rate. The present method can take into account the effects of pore fluid motions relative to the soil skeleton and thus the effects of submerged soil. Good results with compare to analytical solution in spite of zero distance between structure and boundary shows that this absorbing boundary can greatly suppress spuriously reflected waves and efficiently model the far field of the system with sufficient accuracy.

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


The V1-V2-V3 complex: quasiconformal dipole maps in primate striate and extra-striate cortex The mapping function w = k log(z + a) is a widely accepted approximation to the topographic structure of primate V1 foveal and parafoveal regions. A better model, at the cost of an additional parameter, captures the full field topographic map in terms of the dipole map function w = k log[(z + a)/(z + b)]. However, neither model describes topographic shear since they are both explicitly complex-analytic or conformal. In this paper, we adopt a simple ansatz for topographic shear in V1, V2, and V3 that assumes that cortical topographic shear is rotational, i.e. a compression along iso-eccentricity contours. We model the constant rotational shear with a quasiconformal mapping, the wedge mapping. Composing this wedge mapping with the dipole mapping provides an approximation to V1, V2, and V3 topographic structure, effectively unifying all three areas into a single V1-V2-V3 complex using five independent parameters. This work represents the first full-field, multi-area, quasiconformal model of striate and extra-striate topographic map structure. (C) 2002 Elsevier Science 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 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 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 O O O O O O O O O O O O

quasiconformal mapping
topographic shear

topography
visuotopy
primary visual cortex (v1)
striate cortex
extra-striate cortex
models of visual cortex


Improving the anytime behavior of two-phase local search Algorithms based on the two-phase local search (TPLS) framework are a powerful method to efficiently tackle multi-objective combinatorial optimization problems. TPLS algorithms solve a sequence of scalarizations, that is, weighted sum aggregations, of the multi-objective problem. Each successive scalarization uses a different weight from a predefined sequence of weights. TPLS requires defining the stopping criterion (the number of weights) a priori, and it does not produce satisfactory results if stopped before completion. Therefore, TPLS has poor "anytime" behavior. This article examines variants of TPLS that improve its "anytime" behavior by adaptively generating the sequence of weights while solving the problem. The aim is to fill the "largest gap" in the current approximation to the Pareto front. The results presented here show that the best adaptive TPLS variants are superior to the "classical" TPLS strategies in terms of anytime behavior, matching, and often surpassing, them in terms of final quality, even if the latter run until completion.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-objective
anytime algorithms
two-phase local search


Deferiprone Deferiprone (DFP) has been evaluated in a wide range of disorders, but most data come from transfusion-dependent thalassemia. The safety and tolerability profile includes gastrointestinal complaints, liver enzymes elevation, weight gain, arthropathy, neutropenia, and agranulocytosis. The last requires close monitoring of blood count and precludes the use of DFP in conditions with bone marrow abnormalities. The efficacy profile is similar among the three available chelators. For DFP, the choice of dosage is crucial to optimize the effect on liver iron concentration, according to the iron load degree and transfusional iron input. Growing evidence indicates that DFP, alone or in combination with deferoxamine, is effective in removing cardiac iron and preventing cardiac iron load. The available data consolidate an important role of DFP in the management of iron overload. There is a need to compare directly the relative value of the available chelators in the long-term prevention of iron toxicity by well-designed randomized controlled trials.

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


Formal power series and regular operations on fuzzy languages ? In this paper we study formal power series over a quantale with coefficients in the algebra of all languages over a given alphabet, and representation of fuzzy languages by these formal power series. This representation generalizes the well-known representation of fuzzy languages by their cut and kernel languages. We show that regular operations on fuzzy languages can be represented by regular operations on power series which are defined by means of operations on ordinary languages. We use power series in study of fuzzy languages which are recognized by fuzzy finite automata and deterministic finite automata, and we study closure properties of the set of polynomials and the set of polynomials with regular coefficients under regular operations on power series.

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

regular operations
formal power series
quantale

language
fuzzy language
polynomial
fuzzy automaton
deterministic automaton
derivative automaton


Linear precoding of unitary space-time code for GLRT decoder For unitary space-time code (USTC), the impact of spatial correlation on error performance is investigated. A tighter and simpler upper bound is derived for generalized likelihood ratio test decoder. We establish that the spatial correlation does not change the diversity gain, whereas it degrades the error performance of USTC. Motivated by the precoding of space-time block code, we designed a precoder for USTC to handle the case of the joint transmit-receive correlation. Numerical results show that the degradation in performance due to spatial correlation can be considerably compensated by the proposed algorithm.

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

pair-wise error probability
unitary space-time code


General Forms of (alpha, beta)-Fuzzy Subhypergroups of Hypergroups Based on the concepts of "gamma-belongingness (is an element of(gamma))" and "delta-quasi-coincidence (q(delta))" of a fuzzy point with a fuzzy set which generalize the concepts of "belongingness (is an element of)" and "quasi-coincidence (q)" of a fuzzy point with a fuzzy set introduced by Liu and Pu, this paper considers general forms of (alpha, beta)-fuzzy subhypergroups of a hypergroup, where alpha, beta is an element of {is an element of(gamma), q(delta), is an element of(gamma) boolean AND q(delta), is an element of(gamma) boolean OR q(delta)} and alpha not equal is an element of(gamma) boolean AND q(delta). The notion of (alpha, beta)-fuzzy subhypergroups of a hypergroup is introduced, and several properties are investigated. A special attention is given to (is an element of(gamma), is an element of(gamma) boolean OR q(delta))-fuzzy subhypergroups. Their characterizations and homo-morphism properties are considered.

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

(epsilon(gamma), epsilon(gamma) boolean or(q delta))-fuzzy subhypergroup


Importance sampling for spatial scan analysis: computing scan statistic p-values for marked point processes ? Each point in an observed point pattern representing potential target detections (e.g., mines for minefield detection and localization) often is accompanied by a scalar mark representing the detector's level of confidence in that particular detection. Scan analysis for clustering should take this additional mark information into account. We present an importance sampling method for deciding, based on an observed marked point pattern, if a scan statistic S provides significant evidence of increased activity in some localized region of time or space. Our method allows consideration of scan statistics based simultaneously on multiple scan geometries. Our approach yields an unbiased p-value estimate of the form where B? plays the role of the Bonferroni upper bound and the correction factor ? measures the conservativeness of this upper bound. The variance of our importance sampling estimate is typically smaller than that of the naive hit-or-miss Monte Carlo technique when the p-value is small. Furthermore, our estimate is often accurate for critical values which are not far enough in the tails of the null distribution to allow for accurate approximations via extreme value theory. In this article, we develop our importance sampling p-value estimator for the case of marked spatial Poisson processes using multiple scan geometries, and illustrate the approach via application to minefield reconnaissance.

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

spatial scan analysis
importance sampling
marked point pattern
minefield


A trust model of cloud computing based on Quality of Service Trust plays an important role in commercial cloud environments. It is one of the biggest challenges of cloud technology. Trust enables users to select the best resources in a heterogeneous cloud infrastructure. We introduce a novel trust model based on past credentials and present capabilities of a cloud resource provider. Trust value is calculated using four parameters such as availability, reliability, turnaround efficiency, and data integrity. Atrust management system is proposed implementing this trust model. The paper describes how a service level agreement is prepared combining quality of service requirements of user and capabilities of cloud resource provider. We also demonstrate that our proposed model performs better than the first in first out model and similar trust models.

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

availability
reliability
turnaround efficiency
data integrity
cloud computing


A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING This article develops an algorithm for a group of guards staticaly positioned in a non-covex polygonal environment with holes. Each guard possesses a single searchlight, a ray sensor which can rotate about the guard's position but cannot penetrate the boundary of the environment. A point is detected by a searchlight if and only if the point is on the ray at some instant. Targets are points which move arbitraily fast. The objective of the proposed algorithm is to compute a schedule to rotate a set of searchlights in such a way that any target in an environment will necessarily be detected in finite time. This is known as the Searchlight Scheduling Problem and was described originally in 1990 by Sugihara et al. We take an approach known as exact cell decomposition in the motion planning literature. The algorithm operates by decomposing the searchlights' joint configuration space and environment, and then by constructing a so-called information graph. Searching the information graph for a path between desired states yields a search schedule. We also introduce a new problem called the phi-Searchlight Scheduling Problem in which phi-searchlights sense not just along a ray, but over a finite field of view. We show that our results for searchlight scheduling can be directly extended for phi-searchlight scheduling. Proofs of completeness, complexity bounds, and computed examples are presented.

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

searchlight scheduling
exact cell decomposition
motion planning

visibility
pursuit-evasion
computational geometry


stylization-based ray prioritization for guaranteed frame rates This paper presents a new method to control graceful scene degradation in complex ray-based rendering environments. It proposes to constrain the image sampling density with object features, which are known to support the comprehension of the three-dimensional shape. The presented method uses Non-Photorealistic Rendering (NPR) techniques to extract features such as silhouettes, suggestive contours, suggestive highlights, ridges and valleys. To map different feature types to sampling densities, we also present an evaluation of the features impact on the resulting image quality. To reconstruct the image from sparse sampling data, we use linear interpolation on an adaptively aligned fractal pattern. With this technique, we are able to present an algorithm that guarantees a desired minimal frame rate without much loss of image quality. Our scheduling algorithm maximizes the use of each given time slice by rendering features in order of their corresponding importance values until a time constraint is reached. We demonstrate how our method can be used to boost and guarantee the rendering time in complex ray-based environments consisting of geometric as well as volumetric data.

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

ray based image generation
line features


A Modified Pulse Coupled Neural Network with Anisotropic Synaptic Weight Matrix for Image Edge Detection Pulse coupled neural network (PCNN) is a new type of artificial neural network specific for image processing applications. It is a single layer, two dimensional network with neurons which have I : I correspondence to the pixels of an input image. It is convenient to process the intensities and spatial locations of image pixels simultaneously by applying a PCNN. Therefore, we propose a modified PCNN with anisotropic synaptic weight matrix for image edge detection from the aspect of intensity similarities of pixels to their neighborhoods. By applying the anisotropic synaptic weight matrix, the interconnections are only established between the central neuron and the neighboring neurons corresponding to pixels with similar intensity values in a 3 by 3 neighborhood. Neurons corresponding to edge pixels and non-edge pixels will receive different input signal from the neighboring neurons. By setting appropriate threshold conditions, image step edges can be detected effectively. Comparing with conventional PCNN based edge detection methods, the proposed modified PCNN is much easier to control, and the optimal result can be achieved instantly after all neurons pulsed. Furthermore, the proposed method is shown to be able to distinguish the isolated pixels from step edge pixels better than derivative edge detectors.

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

pulse coupled neural network
anisotropic synaptic weight matrix
derivative edge detectors


Reactive transport model for the ambient unsaturated hydrogeochemical system at Yucca Mountain, Nevada To assist a technical review of a potential application for a geologic repository, a reactive transport model is presented for the ambient hydrogeochemical system at Yucca Mountain (YM). The model simulates two-phase, non-isothermal, advective and diffusive flow and transport through one-dimensional matrix and fracture continua (dual permeability) containing ten kinetically reactive hydrostratigraphic layers. We developed a thermodynamic interpretation of ambient groundwater chemistry at YM from limited analytical data and then combined it with insights from experimental and site-specific data to craft a conceptual model describing thermodynamic and kinetic relationships in the mineral/glasswatergas system. The model was calibrated by adjusting uncertain thermodynamic and kinetic parameters to reflect observed trends at YM. The following calibration criteria were used to ensure that model predictions are consistent with hydrochemical and petrologic data from YM: (1) calculated multicomponent matrix pore water compositions do not vary significantly from reinterpreted analytical data; (2) simulated variations in matrix silica concentrations with depth are bounded by the observed analytical range; and (3) feldspars and glass dissolve while clays and calcite precipitate. The largest changes in calculated species concentrations occur in response to glass dissolution. Simulated matrix groundwater compositions at the depth of the potential repository are largely inherited from percolating waters rather than controlled by in situ chemical reactions. Predictions about groundwater flow pathways in the ambient YM system are sensitive to assumptions regarding percolation flux and fracturematrix interactions. Confidence in complex reactive transport models of the thermally perturbed YM repository system depends on successful representation of ambient system conditions.

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

reactive transport model
groundwater chemistry
yucca mountain

geochemistry
hydrology
unsaturated zone
groundwater flow and transport


Atomicity and isolation for transactional processes Processes are increasingly being used to make complex application logic explicit. Programming using processes has significant advantages but it poses a difficult problem from the system point of view in that the interactions between processes cannot be controlled using conventional techniques. In terms of recovery, the steps of a process are different from operations within a transaction. Each one has its own termination semantics and there are dependencies among the different steps. Regarding concurrency control, the flow of control of a process is more complex than in a flat transaction. A process may, for example, partially roll back its execution or may follow one of several alternatives. In this article, we deal with the problem of atomicity and isolation in the context of processes. We propose a unified model for concurrency control and recovery for processes and show how this model can be implemented in practice, thereby providing a complete framework for developing middleware applications using processes.

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

unified theory of concurrency control and recovery


A subspace trust-region method for seismic migration inversion In seismic exploration, regularized migration inversion of seismic data usually requires solving a weighted least-squares problem with constrains. It is well known that directly solving this problem using some decomposition techniques is very time-consuming, which makes it less possible for practical use. For iterative methods, previous research is mainly on solving the inverse model in a full space. In this paper, a robust subspace method is applied to seismic migration inversion with Gaussian beam representations of Green's function. The problem is first formulated by incorporating regularizing constraints, and then, it is changed from full space to subspace and solved by a trust-region method. To test the potential of the application of the developed method, synthetic data simulations are performed. The results show that this method is very promising for ill-posed seismic migration inversion problems.

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


Lattice-valued continuous convergence is induced by a lattice-valued uniform convergence structure We define a stratified L-uniform convergence structure on the set of all continuous mappings from a stratified L-limit space to a stratified L-uniform convergence space. This structure induces L-continuous convergence. This shows that the category of all L-limit-uniformizable spaces is cartesian closed. (C) 2006 Elsevier B.V. All rights reserved.

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

l-fuzzy convergence
l-topology
l-filter
l-convergence space
l-limit space
l-uniform convergence space
function spaces


Combined effects of shear and buoyancy for mixed convection in an enclosure Mixed convection in an enclosure is studied numerically, by adopting a streamfunctionvorticity formulation with a finite difference numerical solution scheme. Two aspects of this study are worthy of note, namely, the forced convection induced by the moving wall as well as the natural convection generated by buoyancy. Flow is generated by the top horizontal or one of the vertical boundary walls any of which can slide along its own plane, while the induced temperature gradient arising from the boundary conditions initiates buoyancy. A parametric investigation of the numerical solutions helps us to make valuable observations of both the heat transfer and flow processes. For the different parameters studied, streamfunction plots not only reflect the influence of the boundary conditions, but also the effect of the different dimensionless variables on the flow profile. Variations of the flow profiles as a function of time as well as a function of Grashof number are reported. While the Nusselt number varies considerably with time, the isotherms do not change appreciably with Grashof number as the solution approaches steady state.

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

streamfunctionvorticity
mixed convection
nusselt number
grashof number
finite difference
heat transfer


Acceleration of molecular mechanic simulation by parallelization and fast multipole techniques Simulations of classical molecular dynamic (MD) systems can be sped up considerably by parallelizing the existing codes for distributed memory machines. In classical MD the CPU time is typically a function of the square of the number of atoms. The size of the molecular system which can be solved is therefore often limited by the CPU available. There are different approaches for reducing computation time. One consists in parallelizing sequential O(N2) algorithms. The other is replacing the calculation of non-bonding forces by a less complex algorithm which can then be parallelized. We have generated a code (MEGADYN) for the simulation of MD of large simulation ensembles (up to 106 atoms) on the basis of classical force field methods. A reduction of complexity of the calculation of forces and energy down to O(N) was achieved by employing Greengards fast multipole method (FMM) to the Coulomb interaction. Within the framework of FMM the periodic boundary conditions are realized in a minimum image convention type manner. Thus MEGADYN can be used to simulate NVT as well as NPT ensembles.

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

parallel processing
molecular dynamics
sp2
membranesimulation


How to involve structural modeling for cartographic object recognition tasks in high-resolution satellite images? With the new generation of satellite systems, very high resolution satellite images will be available daily at a high delivery rate. The exploitation of such a huge amount of data will be made possible by the design of high performance analysis algorithms for decision making systems. In particular, the detection and recognition of complex man-made objects is a new challenge coming with this new level of resolution. In this study, we develop a system that recognizes such structured and compact objects like bridges or roundabouts. The original contribution of this work is the use of structural shape attributes in an appearance-based statistical learning method framework leading to valuable recognition and false alarm rates. This hybrid structural/statistical approach aims to construct an intermediate step between the low-level image characteristics and high-level semantic concepts.

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


ERK Signaling Regulates Macrophage Colony-Stimulating Factor Expression Induced by Titanium Particles in MC3T3.E1 Murine Calvarial Preosteoblastic Cells Periprosthetic osteolysis poses a significant clinical problem for patients who have undergone total joint arthroplastic surgeries. It has been widely recognized that there is a strong correlation between wear particles from orthopedic implants and osteolysis. However, the molecular mechanism underlying osteolysis still remains unclear. Although wear particles interact with a mixed cellular environment, namely macrophages and immune cells, osteoblasts compose the majority of the cell population surrounding orthopedic implants. Osteoblasts are also one of the major sources of receptor activator of nuclear factor-kappa beta (NF-?B) ligand (RANKL), a factor necessary for osteoclastogenesis. However, macrophage colony-stimulating factor (M-CSF), another cytokine responsible for preosteoclast proliferation, must also be present with RANKL for osteoclastogenesis to occur. The purpose of our study is to determine the signal transduction pathway by which titanium (Ti) particles, a metallic component of many orthopedic implants, induce M-CSF expression in MC3T3.E1 murine calvarial preosteoblastic cells. Using reverse transcriptase-polymerase chain reaction (RT-PCR) and enzyme- linked immunosorbent assay (ELISA), our study demonstrated that submicron-sized Ti particles induce M-CSF expression via the extracellular signal-regulated kinase (ERK) pathway in a dose-dependent manner. Moreover, inhibition studies showed that a specific ERK inhibitor, PD98059, significantly downregulated M-CSF production. Our results support the hypothesis that submicron-sized Ti particles can induce M-CSF expression in osteoblasts and thus may have a significant role in contributing to the onset of periprosthetic osteolysis

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


An efficient coefficient-partitioning algorithm for realizing low-complexity digital filters Algorithms that minimize the complexity of multiplication in digital filters focus on reducing the number of adders needed to implement the coefficient multipliers. Previous works have not analyzed the complexity of each adder, which is significant in low-complexity implementation. A multiplication algorithm for low-complexity implementation of digital filters with a minimum number of full adders (NFAs) and improved speed is proposed here. The authors exploit the fact that when multiplication is implemented using shifts and adds, the adder width can be minimized by limiting the shifts of the operands to shorter lengths. The coefficient-partitioning (CP) algorithm proposed here minimizes the shifts of the operands of the adders by partitioning each coefficient into two subcomponents. The authors show that by combining three methods, the CP algorithm, an efficient coefficient coding scheme known as pseudo floating-point (PFP) representation, and the well-known common subexpression elimination (CSE), the NFAs required in each adder of the multiplier can be reduced considerably. Design examples show that the method offers an average FA reduction of 30% for finite-impulse response (FIR) filters and 20% for infinite-impulse response (HR) filters over CSE methods.

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

adder complexity
coefficient partitioning
finite-impulse response (fir) filters
infinite-impulse response (iir) filters
pseudofloating-point representation


Placement of sensors in operational modal analysis for truss bridges A modal approach is considered for sensor placement evaluation in operational modal analysis (OMA) where modal participation at individual degree of freedom (DOF) is evaluated separately for the target modes and subsequently locations are identified using these participation profiles. Modal contribution in output energy (MCOE) is proposed as modal measure to evaluate modal participation and has been applied in this modal approach framework for sensor placement evaluation. MCOE is evaluated using observability grammian for any types of response measurement (displacement, velocity or acceleration), while a system is released from any initial condition. Further, existing modal measures e.g. modal Hankel singular value (MHSV) and system norms (H2, H? and Hankel) are explained in perspective of OMA. To understand the efficiency of this proposed technique, MCOE is compared in terms of modal participation with existing modal measures as well as with other techniques like effective independence (EI) and modal kinetic energy (MKE). Analytical similarity is found for participation of a mode with EI method. Further, an existing large truss bridge structure is considered for comparative study based on modal participation of individual target modes along each DOF with acceleration measurement. In this comparison, MCOE technique is found to be in very good agreement with EI method as expected, while good agreement is observed with MHSV as well as norms and reasonable agreement with MKE method. Further, the adopted modal approach uses a flexible and insightful methodology for sensor location evaluation for multiple target modes.

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

sensor placement
modal approach
grammian

operational modal analysis (oma)
system norm
hankel singular value (hsv)


Mobile sensor networks for modelling environmental pollutant distribution This article proposes to deploy a group of mobile sensor agents to cover a polluted region so that they are able to retrieve the pollutant distribution. The deployed mobile sensor agents are capable of making point observation in the natural environment. There are two approaches to modelling the pollutant distribution proposed in this article. One is a model-based approach where the sensor agents sample environmental pollutant, build up an environmental pollutant model and move towards the region where high density pollutant exists. The modelling technique used is a distributed support vector regression and the motion control technique used is a distributed locational optimising algorithm (centroidal Voronoi tessellation). The other is a model-free approach where the sensor agents sample environmental pollutant and directly move towards the region where high density pollutant exists without building up a model. The motion control technique used is a bacteria chemotaxis behaviour. By combining this behaviour with a flocking behaviour, it is possible to form a spatial distribution matched to the underlying pollutant distribution. Both approaches are simulated and tested with a group of real robots.

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

mobile sensor network
model-based
model-free
pollutant monitoring


Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t if the two endpoints are specified, HPPs if only one endpoint is specified. We show that HPPs,t is -differential approximable and HPPs is -differential approximable. Moreover, we observe that these problems cannot be differential approximable better than . Based upon these results, we obtain new bounds for standard ratio: a -standard approximation for Max HPPs,t and a for Max HPPs, which can be improved to for Max HPPs,t[a,2a] (all the edge weights are within an interval [a,2a]), to for Max HPPs[a,2a] and to for Min HPPs,t[a,2a], to for Min HPPs[a,2a].

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

approximate algorithms
differential ratio
complexity theory
combinatorial optimization
performance ratio
analysis of algorithms


An improved distance metric for the interpolation of link-based traffic data using kriging: a case study of a large-scale urban road network The interpolation of link-based traffic data is an important topic for transportation researchers and engineers. In recent years the kriging method has been used in traffic data interpolation from the viewpoint of spatial analysis. This method has shown promising results, especially for a large-scale road network. However, existing studies using the Euclidean distance metric, which is widely used in traditional kriging, fail to accurately describe the spatial distance in a road network. In this article we introduce road network distance to describe spatial distance between road links, and we propose an improved distance metric called approximate road network distance (ARND), based on the isometric embedding theory, for solving the problem of the invalid spatial covariance function in kriging caused by the non-Euclidean distance metric. An improved Isomap algorithm is also proposed for obtaining the ARND metric. This study is tested on a large-scale urban road network with sparse road-link travel speeds derived from approximately 1200 'floating cars' (GPS-enabled taxis). Comparison was conducted on both the Euclidean distance metric and the ARND metric. The validation results show that the use of the ARND metric can obtain better interpolation accuracy in different time periods and urban regions with different road network structures. Therefore, we conclude that the improved distance metric has the ability for improving kriging interpolation accuracy for link-based traffic data within real situations, providing more reliable basic traffic data for various traffic applications.

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

traffic data interpolation
kriging
distance metric
isometric embedding

geographic information systems for transportation (gis-t)


WAVELET NEURAL NETWORK AS A MULTIVARIATE CALIBRATION METHOD IN VOLTAMMETRIC ELECTRONIC TONGUES The paper presents a multi-output wavelet neural network (WNN) which, taking benefit of wavelets and neural networks, is able to accomplish data feature extraction and modeling. In this work. WNN is implemented with a feed-forward one-hidden layer architecture, whose activation functions in its hidden layer neurons are wavelet functions, in our case, the first derivative of a Gaussian function. The network training is performed using a backpropagation algorithm, adjusting the connection weights along with the network parameters. This principle is applied to the simultaneous quantification of heavy metals present in liquid media. taking the cyclic voltammogram obtained with a modified epoxy-graphite composite sensor as departure information. The combination between processing tools and electrochemical sensors is already known as an electronic tongue.

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

wavelet neural network
multivariate calibration
electronic tongue


product-line architectures, aspects, and reuse (tutorial session) GenVoca PLA designs have been created for diverse domains: 2-way radios, extensible compilers, communication protocols, command-and-control fire support, avionics, and matrix computation libraries [7]. GenVoca designs are used in industry; its central concepts relate a wide variety of contemporary and classical research topics, including: aspect-oriented programming, parameterized programming, OO frameworks, Perry's lite semantics [8], generative programming [7], design maintenance [9], and layered software.

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

communication protocols
software
reuse
research
maintenance
computation
design
tutorial
support
libraries
generative programming

framework
program
aspect
semantic
product line
architecture
command-and-control
concept
domain
compilation
extensibility
aspect-oriented programming


evolutionary algorithms and multi-objectivization for the travelling salesman problem This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-objective case, diversity can be introduced by the multi-objective view of the algorithm and the dynamic use of objectives. Using the travelling salesman problem as an example we illustrate that two basic approaches, a) the addition of new objectives to the existing problem and b) the decomposition of the primary objective into sub-objectives, can improve performance compared to a single-objective genetic algorithm when objectives are used dynamically. Based on decomposition we propose the concept "Multi-Objectivization via Segmentation" (MOS), at which the original problem is reassembled. Experiments reveal that this new strategy clearly outperforms both the traditional genetic algorithm (GA) and the algorithms based on existing multiobjective approaches even without changing objectives.

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

multi-objective optimization
genetic algorithms
multi-objectivization


Object class recognition and localization using sparse features with limited receptive fields We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first apply Gabor filters at all positions and scales; feature complexity and position/scale invariance are then built up by alternating template matching and max pooling operations. We refine the approach in several biologically plausible ways. Sparsity is increased by constraining the number of feature inputs, lateral inhibition, and feature selection. We also demonstrate the value of retaining some position and scale information above the intermediate feature level. Our final model is competitive with current computer vision algorithms on several standard datasets, including the Caltech 101 object categories and the UIUC car localization task. The results further the case for biologically-motivated approaches to object classification.

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

object class recognition
sparsity
localized features


Damage detection method based on operating deflection shape curvature extracted from dynamic response of a passing vehicle This paper describes the development of a local damage detection method for beam and plate like structures based on operating deflection shape curvature extracted from dynamic response of a passing vehicle, which serves both as exciter and message carrier. Based on the operating deflection shape curvature and the assumption that the intact structure is smooth and homogenous, a new damage detection algorithm called Global Filtering Method (GFM) is proposed. The new method using only information from damaged structures has been verified by both numerical simulations and experiments. Even if only using operating deflection shape curvatures at relatively few frequencies near the first natural frequency, not only local damage in beam could be detected in the numerical simulation, delamination as small as 8mm in composite plate could also be detected in the laboratory. Compared with traditional methods using operating deflection shape data extracted from FRFs; it is time-saving, easier to implement and produces greater accuracy as it does not require many preinstalled sensors and solving eigenvector or singular value problems.

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

damage detection
operating deflection shape curvature
global filtering method
passing vehicle


maximizing the sustained throughput of distributed continuous queries Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of processors, and their processing sequence, form a query configuration with inherent constraints on the throughput it can support. In this paper we propose to optimize stream queries with respect to a version of throughput measure, the profiled input throughput. This measure is focused on matching the expected behavior of the input streams. To prune the search space we used hill-climbing techniques that proved to be efficient and effective.

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


Asymptotic analysis of industrial dynamical model In this paper, we set up the dynamical models for an industrial system by means of ordinary or delay differential equations. By the qualitative analyses to the equilibrium points of the differential equations, we indicate how the parameters influence the equilibrium states of the system. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

ordinary and delay differential equations


The role of Internet in the development of future software projects Purpose - The Internet has evolved, prompted in part by new Web 2.0 technologies, to become a more widespread platform for interaction, communication, and activism. Virtual communities, or groups of people informally bound together by shared expertise, synthesise this Internet evolution and the Web 2.0 technology. Users increasingly want to engage online with one another and with organisations of all kinds. These novel Internet-based technologies dominate the new business models of the digital economy giving companies radical new ways to harvest the talents of innovators working outside corporate boundaries. One of the most illustrative examples of this new trend is the Open Source Software (OSS) projects development. This paper aims to analyse the structure and topology of the virtual community supporting one of the most successfully OSS projects, Linux. The objective is to provide conclusions for being successful in the development of future virtual communities. As companies learn to manage these virtual communities, they will develop smarter and faster ways to create value through them. Design/methodology/approach - The interactions of the virtual community members of an ARM-embedded Linux project website is analysed through social network analysis techniques. The participants' activity is studied and some conclusions about the participation features are obtained using the Gini coefficient. In particular, a participation inequality behaviour or a concentration on a small number of developers is clearly observed. Findings - The paper deals with the guidelines that virtual communities should follow to be successful. Results about the structure of a successful virtual community and its time evolution are provided to determine the mentioned guidelines. Research limitations/implications - The research is limited to a particular virtual community engaged with the development of the ARM-embedded Linux OSS. Other successful virtual communities can be analysed, and the conclusions could be compared. Anyway, the proposed analysis methodology can be extended to other virtual communities. Originality/value - The paper fulfils the development and features of Internet virtual communities to be successful. Results have important implications over the development of new software business models based on virtual communities and open source software. Contributions about the best organisation of virtual communities leading to a successful development of the underlying project are presented.

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

social networks
computer software
information transfer


implicit data structures (preliminary draft) We consider representations of data structures in which the relative ordering of the values stored is implicit in the pattern in which the elements are retained, rather than explicit in pointers. Several implicit schemes for storing data are introduced to permit efficient implementation of the instructions insert, delete and find . &thgr;(@@@@N) basic operations are shown to be necessary and sufficient, in the worst case, to perform these instructions provided that the data elements are kept in some fixed partial order. We demonstrate, however, that further improvements can be made if an arrangement other than a fixed partial order is used. A structure, based on a fixed partial order, is introduced to facilitate multiple key searches. This structure, together with the retrieval scheme based upon it, is shown to be within a constant factor of the optimal one based on a partial order.

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

order
structure
values
factor
arrangement
data structures
implementation
retrieval
data
demonstrate
case
pointers
scheme
pattern

partial ordering
efficiency
optimality
instruction
operability
relation


High frequency performance of nano-scale ultra-thin-body Schottky-barrier n-MOSFETs The high frequency performances of nano-scale ultra-thin-body (UTB) Schottky-barrier n-MOSFETs (SB-nMOSFETs) are investigated using 2D full-band self-consistent ensemble Monte Carlo method. The UTB SB-nMOSFET devices offer excellent RF performance with high values of f (T) and f (max). The significant dependence of f (T) and f (max) on gate voltage and weak dependence on barrier height are demonstrated. Meanwhile, the significant dependence of g (m) and g (ds) on both gate voltage and SB height are shown. Moreover, the scalability of f (T) is outstanding and close to the ideal case (f (T) ae 1/L (g) (2) ). The high frequency performances of 45 nm channel length SB-nMOSFETs at ballistic transport limit are also investigated. Results show that scattering strongly affects the capacitances C (gs), C (gd) and C (ds). At ballistic transport limit the f (T) and f (max) are almost 10 times larger. The Scattering effects in nano-scale SB-nMOSFETs cannot be neglected.

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

ultra thin body (utb)
schottky-barrier mosfets (sb-mosfets)


Pricing of risk for loss guaranteed intra-domain internet service contracts The Internet today offers primarily a best-effort service. Research and technology development efforts are currently underway to allow provisioning of better than best-effort Quality of Service (QoS) assurances. The residual uncertainty in QoS can be managed using pricing strategies. In this article, we develop a spot pricing framework for intra-domain expected bandwidth contracts with loss-based QoS guarantees. The framework builds on a nonlinear pricing scheme for cost recovery from earlier work and extends it to price risk. A utility-based options pricing approach is developed to account for the uncertainties in delivering loss guarantees. Application of options pricing techniques in Internet services provides a mechanism for fair risk sharing between the provider and the customer, and may be extended to price other uncertainties in QoS guarantees.

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

internet quality of service
loss guarantee
real options
risk management
simulation


A Target Position Decision Algorithm Based on Analysis of Path Departure for an Autonomous Path Keeping System To realize a path keeping system (PKS), it is essential to guide autonomous vehicle (AV) to a desired direction while maintaining safety. To maintain a desired driving path, it is necessary for an AV to perceive its surrounding environment by gathering directional information while traveling. Therefore, precise localization of an AV and autonomous guidance are essential technologies for the successful implementation of a PKS. As a type of radio guidance, an AV can use trilateration to identify its location relative to three reference positions by measuring the strength, time, or time difference of the reception of transmitted radio signals. Direction of arrival (DOA) techniques can also be used to estimate the direction of a signal emitted from a transmitter, and this information can be used to set the driving direction of an AV. However, in a practical environment, estimation errors may arise when the AV estimates its location or the direction of signal emitted from a transmitter, and these errors may cause the problem of path departure. To address this problem, we conducted a mathematical analysis to identify potential errors in estimating location and direction. Herein we propose a target position decision algorithm for PKS, which uses trilateration and DOA (PKS-TnD) to drive an AV in a desired direction to avoid path departure. By using this algorithm, an AV calculates its next target position based on the error constraints of trilateration and DOA by means of numerical analysis. Additionally, an energy efficiency problem is also formulated herein and energy use is optimized by using a Lagrangian equation.

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

path keeping system
trilateration
direction of arrival
energy efficiency

autonomous driving system
error probability analysis


The novel SCR-based ESD protection with low triggering and high holding voltages This paper introduces a novel silicon controlled rectifier (SCR)-based circuit. The proposed device using 70nm DRAM process obtained the high holding and low triggering voltages by using variable IR drop. These characteristics enable to discharge electrostatic discharge (ESD) current and ensure latch-up immunity for normal operations. Also, the proposed scheme is easily implemented through the modification of the metal connection compare to the conventional SCR-based device. We investigated electrical characteristics by both measurements and TCAD simulations. Measurement results showed the proposed SCR had triggering voltage of 6.2V, holding voltage of 3.3V, and the second breakdown current of 58mA/?m.

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

holding voltage
triggering voltage
breakdown current

discharge electrostatic discharge (esd)
silicon controlled rectifier (scr)


On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties In this paper, the complexity and some other properties of several multi-stage problems with a non-regular performance measure are investigated. Mainly, we deal with two-machine problems. The problems are extensions of a one-machine problem with a common due date and a non-regular optimization criterion, where the sum of absolute deviations of the completion times from the due date is to be minimized. There are two reasonable generalizations: Either, the objective function is kept the same as in the one-machine problem, where the completion time is now the completion time of the last operation of the job, or a second penalty is added to this term which takes into account the storage costs of the intermediate. For both types of problems, we study the flow shop, the job shop, and the open shop environment. In the case of intermediate storage costs, we distinguish the cases of a due date d=0 (which leads to a regular optimization criterion) and a non-restrictive due date. We obtain the following results. The two-machine flow shop problem with intermediate storage costs defined in this paper is NP-hard in the strong sense for d=0 as well as for a non-restrictive due date. We prove the similar results for the two-machine open shop problem. In absence of intermediate storage costs, the open shop and the job shop problem are polynomially solvable for a non-restrictive due date. The just-in-time production philosophy has lead to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single-stage problems. This paper describes the two main approaches to extend the objective function to multi-stage environments and investigates the computational complexity of the problems obtained. The investigations in this paper may serve as a starting point for the development of appropriate algorithms for the type of problem considered.

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


Different temporal patterns of vector soliton bunching induced by polarization-dependent saturable absorber A fiber laser with a PID-SESAM or a PD-SESAM is constructed for obtaining vector soliton bunching. Only the vibrating soliton bunching is generated from the fiber laser with a PID-SESAM. There are abundant temporal patterns of soliton bunching generated from the fiber laser with a PD-SESAM. The polarization property of the saturable absorber plays a pivotal role for achieving different temporal patterns.

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

vector soliton
soliton bunching
fiber laser


Variable space hidden Markov model for topic detection and analysis Discovering topics from large amount of documents has become an important task recently. Most of the topic models treat document as a word sequence, whether in discrete character or term frequency form. However, the number of words in a document is greatly different from that in other documents. This will lead to several problems for current topic models in dealing with topics analysis. On the other hand, it is difficult to perform topic transition analysis based on current topic models. In an attempt to overcome these deficiencies, a variable space hidden Markov model (VSHMM) is proposed to represent the topics, and several operations based on space computation are presented. A hierarchical clustering algorithm with dynamically changing of the component number in topic model is proposed to demonstrate the effectiveness of the VSHMM. Method of document partition based on topic transition is also present. Experiments on a real-world dataset show that the VSHMM can improve the accuracy while decreasing the algorithms time complexity greatly compared with the algorithm based on current mixture model.

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

topic detection
variable space hidden markov model
topic transition
hierarchical clustering


Enhancement of an industrial finite-volume code for large-eddy-type simulation of incompressible high Reynolds number flow using near-wall modelling We present a validation strategy for enhancement of an unstructured industrial finite-volume solver designed for steady RANS problems for large-eddy-type simulation with near-wall modelling of incompressible high Reynolds number flow. Different parts of the projection-based discretisation are investigated to ensure LES capability of the numerical method. Turbulence model parameters are calibrated by using a minimisation of least-squares functionals for first and second order statistics of the basic benchmark problems decaying homogeneous turbulence and turbulent channel flow. Then the method is applied to the flow over a backward facing step at Reh=37,500. Of special interest is the role of the spatial and temporal discretisation error for low order schemes. For wall-bounded flows, present results confirm existing best practice guidelines for mesh design. For free-shear layers, a sensor to quantify the resolution quality of the LES based on the resolved turbulent kinetic energy is presented and applied to the flow over a backward facing step at Reh=37,500.

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

navierstokes model
large-eddy simulation
detached-eddy simulation
wall-functions
projection method
finite volume method


MUAP extraction and classification based on wavelet transform and ICA for EMG decomposition We have developed an effective technique for extracting and classifying motor unit action potentials (MUAPs) for electromyography (EMG) signal decomposition. This technique is based on single-channel and short period?9s real recordings from normal subjects and artificially generated recordings. This EMG signal decomposition technique has several distinctive characteristics compared with the former decomposition methods: (1) it bandpass filters the EMG signal through wavelet filter and utilizes threshold estimation calculated in wavelet transform for noise reduction in EMG signals to detect MUAPs before amplitude single threshold filtering; (2) it removes the power interference component from EMG recordings by combining independent component analysis (ICA) and wavelet filtering method together; (3) the similarity measure for MUAP clustering is based on the variance of the error normalized with the sum of RMS values for segments; (4) it finally uses ICA method to subtract all accurately classified MUAP spikes from original EMG signals. The technique of our EMG signal decomposition is fast and robust, which has been evaluated through synthetic EMG signals and real EMG signals.

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

emg signal decomposition
wavelet filtering

motor unit action potentials (muaps)
independent component analysis (ica)
minimum spanning tree (mst)


ALGORITHMS FOR OMEGA-REGULAR GAMES WITH IMPERFECT INFORMATION We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations. Such games occur in the synthesis of a controller that does not see the private state of the plant. Our main results are twofold. First, we give a fixed-point algorithm for computing the set of states from which a player can win with a deterministic observation-based strategy for any omega-regular objective. The fixed point is computed in the lattice of antichains of state sets. This algorithm has the advantages of being directed by the objective and of avoiding an explicit subset construction on the game graph. Second, we give an algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buchi objective. This set is of interest because in the absence of perfect information, randomized strategies are more powerful than deterministic ones. We show that our algorithms are optimal by proving matching lower bounds.

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

algorithms
randomized strategies
antichains


Relations among conditional probabilities We describe a universal Grobner basis of relations among conditional probabilities in a discrete probability space, with any set of conditioned-upon events. They may be specialized to the partially-observed random variable case, the purely conditional case, and other special cases. We also investigate the connection to generalized permutohedra and describe a "conditional probability simplex" which is the image of a multigraded moment map. (C) 2012 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 B I O O O O O O O O O O O O O O O O O


A property of left-linear rewrite systems preserving recognizability Let R be a left-linear rewrite system over sign(R), and let Sigma = (g,#) boolean OR sign(R), where g is an element of Sigma(1) - sign(R) and # is an element of Sigma(0) - sign(R). We show that R effectively preserves Sigma-recognizability if and only if R effectively preserves recognizability. (C) 2000 Elsevier Science B.V. All rights reserved.

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

sets of descendants
tree automata
recognizability preserving


Parallel hyperbolic PDE simulation on clusters: Cell versus CPU Increasingly, high-performance computing is looking towards data-parallel computational devices to enhance computational performance. Two technologies that have received significant attention are IBM's Cell Processor and NVIDIA's CUDA programming model for graphics processing unit (CPU) computing. In this paper we investigate the acceleration of parallel hyperbolic partial differential equation simulation on structured grids with explicit time integration on clusters with Cell and CPU backends. The message passing interface (MPI) is used for communication between nodes at the coarsest level of parallelism. Optimizations of the simulation code at the several finer levels of parallelism that the data-parallel devices provide are described in terms of data layout, data flow and data-parallel instructions. Optimized Cell and CPU performance are compared with reference code performance on a single x86 central processing unit (CPU) core in single and double precision. We further compare the CPU. Cell and CPU platforms on a chip-to-chip basis, and compare performance on single cluster nodes with two CPUs, two Cell processors or two CPUs in a shared memory configuration (without MPI). We finally compare performance on clusters with 32 CPUs, 32 Cell processors, and 32 CPUs using MPI. Our CPU cluster results use NVIDIA Tesla CPUs with GT200 architecture, but some preliminary results on recently introduced NVIDIA CPUs with the next-generation Fermi architecture are also included. This paper provides computational scientists and engineers who are considering porting their codes to accelerator environments with insight into how structured grid based explicit algorithms can be optimized for clusters with Cell and CPU accelerators. It also provides insight into the speed-up that may be gained on current and future accelerator architectures for this class of applications.

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

parallel performance
gpu
hyperbolic system
code optimization


Enhanced Cohen class timefrequency methods based on a structure tensor analysis: Applications to ISAR processing When dealing with timefrequency analysis, each distribution belonging to the Cohen class (CC) is defined by its kernel. It introduces a timefrequency smoothing which impacts on the timefrequency resolution and the cross-term disappearance. Depending on the application, the practitioner has to find the best compromise. In this paper, we suggest combining several CC timefrequency representations (TFRs), corresponding to coarse-to-fine scales of smoothing. Taking advantage of this diversity, our approach consists in differentiating the signal, assumed to be characterized by 2-D near-linear stable trajectories in the timefrequency plane, and the cross-terms, assumed to be geometrically unstructured. For this purpose, a confidence map for each TFR is deduced from a local variational analysis of the timefrequency distribution. The set of confidence maps is then used to combine the different TFRs in order to obtain an enhanced TFR. Our approach is compared with various conventional TFRs by using synthetic data. Despite a comparatively higher computational cost, the resulting enhanced TFR exhibits a high timefrequency resolution while having limited cross-terms. As simulation results confirm the effectiveness of our method, it is then applied in the field of inverse synthetic aperture radar (ISAR) processing.

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

timefrequency analysis
structure tensor
inverse synthetic aperture radar

gradient
coherence map
aggregation operator


Assessing the suitability of an honest rating mechanism for the collaborative creation of structured knowledge Creating and maintaining semantic structures such as ontologies continues to be an important issue. The approach investigated here is to let members of an online community create structured knowledge collaboratively and to use ratings to evaluate the data created. Obviously, such ratings have to be of high quality. Honest rating mechanisms (HRMs) known from literature are a promising means to gain such high-quality ratings. However, the design of such mechanisms for collaborative knowledge creation and their effectiveness have not been studied so far. To evaluate the effects of an HRM on rating quality in this context, we have conducted several experiments with online communities. We find that an HRM increases rating quality and "punishes" rating errors. We also find that rating-based rewards increase the quality of the structured knowledge created.

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


Filling polygonal holes using C-1 cubic triangular spline patches We use the method of energy minimization to fill polygonal holes by C-1 cubic triangular spline patches. We implement the method in MATLAB. Several numerical examples are shown. (C) 2000 Elsevier Science B.V. All rights reserved.

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

minimal energy method
triangular splines


An optimized task-farm model to integrate reduced dimensionality Schrdinger equations on distributed memory architectures This paper investigates the parallelization of a quantum reactive scattering code that tackles the problem of integrating a two-dimensional Schrdinger equation. Computational codes integrating differential equations associated with quantum chemistry problems are known to be difficult to parallelize. A detailed examination of the algorithms and a careful analysis of possible sources for inefficiency is performed to devise a suitable parallelization strategy on MIMD-DM machines. As a result of the study, a task-farm model was adopted. The efficiency of the adopted parallel model is discussed with the help of several test calculations to pave the way for future work on full dimensional Schrdinger equations.

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

differential equations
quantum reactive scattering

load balancing
mimd-dm architecture
task-farm model
performance evaluation