Application of a data-driven monitoring technique to diagnose air leaks in an automotive diesel engine: A case study This paper presents a case study of the application of a data-driven monitoring technique to diagnose air leaks in an automotive diesel engine. Using measurement signals taken from the sensors/actuators which are present in a modern automotive vehicle, a data-driven diagnostic model is built for condition monitoring purposes. Detailed investigations have shown that measured signals taken from the experimental test-bed often contain redundant information and noise due to the nature of the process. In order to deliver a clear interpretation of these measured signals, they therefore need to undergo a compression and an extraction stage in the modelling process. It is at this stage that the proposed data-driven monitoring technique plays a significant role by taking only the important information of the original measured signals for fault diagnosis purposes. The status of the engine's performance is then monitored using this diagnostic model. This condition monitoring process involves two separate stages of fault detection and root-cause diagnosis. The effectiveness of this diagnostic model was validated using an experimental automotive 1.9L four-cylinder diesel engine embedded in a chassis dynamometer in an engine test-bed. Two joint diagnostics plots were used to provide an accurate and sensitive fault detection process. Using the proposed model, small air leaks in the inlet manifold plenum chamber with a diameter size of 26mm were accurately detected. Further analyses using contribution to T2 and Q statistics show the effect of these air leaks on fuel consumption. It was later discovered that these air leaks may contribute to emissions fault. In comparison to the existing model-based approaches, the proposed method has several benefits: (i) it makes no simplifying assumptions, as the model is built entirely from the measured signals; (ii) it is simple and straight-forward; (iii) there is no additional hardware required for modelling; (iv) it is a time and cost-efficient way to deliver condition monitoring (i.e. fault diagnosis application); (v) it is capable of pin-pointing the root-cause and the effect of the problem; and (vi) it is feasible to be implemented in practice.

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

application
condition monitoring
diagnosis
air leaks
automotive diesel engine


Guaranteed cost control of T-S fuzzy systems with state and input delays This paper focuses on the problem of guaranteed cost control for T-S fuzzy systems with state and input delays. Stability and stabilization conditions are first proposed, which are delay-dependent for state delay and delay-independent for input delay. Further, the guaranteed cost problem is addressed. All the results are presented in terms of linear matrix inequalities (LMIs). Some examples are used to illustrate the effectiveness and feasibility of the approaches proposed in this paper. (C) 2007 Elsevier B.V. All rights reserved.

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

t-s fuzzy model
time-delay
robust control


the mir flickr retrieval evaluation In most well known image retrieval test sets, the imagery typically cannot be freely distributed or is not representative of a large community of users. In this paper we present a collection for the MIR community comprising 25000 images from the Flickr website which are redistributable for research purposes and represent a real community of users both in the image content and image tags. We have extracted the tags and EXIF image metadata, and also make all of these publicly available. In addition we discuss several challenges for benchmarking retrieval and classification 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 B O O O O

content-based image retrieval
relevance feedback
image collections


does word sense disambiguation improve information retrieval? A basic form of semantic annotation is to label a word in a document with its correct sense based on the context in which the word occurs, thus providing the disambiguated sense of the word. Performing this task automatically is known as word sense disambiguation, which has been extensively studied in the natural language processing literature. Will semantic annotation of word senses improve information retrieval? This paper provides some thoughts on this question, which lies at the intersection of natural language processing and information retrieval.

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

information retrieval
word sense disambiguation


Task assignment in a heterogeneous server farm with switching delays and general energy-aware cost structure We model a server farm with switching delays and a general cost structure. We derive value functions for M/G/1 M / G / 1 queues with switching delay. Switching (setup) delay shows up as an additional term in the value function. We develop energy-aware policies that also control the set of active servers. Our heuristics outperform standard policies over a wide range of parameters.

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


Signal mass and Ca2+ kinetics in local calcium events: a modeling study We use a detailed modeling formalism based on numerical simulations of local calcium release events where the blurring of the image, the presence of diffusional barriers provided by large organelles situated close to the release site, as well as the variable position of the scan line with respect to the release site are taken into consideration. We have investigated the effect of the fluorescence noise fluctuations on the accuracy in computing the signal mass from linescan recordings and obtained a quantitative description of both the signal mass and the local increase in the free Ca2+ level as a function of the release current, the release duration and the orientation of the scan line, for three different levels of noise magnitudes. The model could provide a very good fit to a wide set of available experimental data regarding the signal mass of puffs visualized by fluorescence microscopy in the Xenopus oocyte loaded with 40 mu M Oregon Green-1 in the absence of the calcium chelator EGTA. Numerical simulations also predict the amplitude and the kinetics of calcium signals evolving in the absence of the indicator, and indicate that sub-maximal activation of IP3 receptors could produce in average levels of about 2 mu M and 0.4 mu M free Ca2+ close to a release site located in the animal or in the vegetal hemisphere, respectively, whereas the maximal levels reached in more rare events could be 11 mu M and 4 mu M, respectively.

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

calcium release
numerical simulations
signal mass


Chain rules for linear openness in metric spaces and applications In this work we present a general theorem concerning chain rules for linear openness of set-valued mappings acting between metric spaces. As particular cases, we obtain classical and also some new results in this field of research, including the celebrated LyusternikGraves Theorem. The applications deal with the study of the well-posedness of the solution mappings associated to parametric systems. Sharp estimates for the involved regularity moduli are given.

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


toward error-bounded algorithms for infinite-horizon dec-pomdps Over the past few years, attempts to scale up infinite-horizon DECPOMDPs are mainly due to approximate algorithms, but without the theoretical guarantees of their exact counterparts. In contrast, ?-optimal methods have only theoretical significance but are not efficient in practice. In this paper, we introduce an algorithmic frame-work (?- pi ) that exploits the scalability of the former while preserving the theoretical properties of the latter. We build upon ?- pi a family of approximate algorithms that can find (provably) errorbounded solutions in reasonable time. Among this family, h-pi uses a branch-and-bound search method that computes a near-optimal solution over distributions over histories experienced by the agents. These distributions often lie near structured, low-dimensional subspace embedded in the high-dimensional sufficient statistic. By planning only on this subspace, h-pi successfully solves all tested benchmarks, outperforming standard algorithms, both in solution time and policy quality.

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

artificial intelligence
point-based solvers
decentralized pomdps


Machining precedence of 21/2D interacting features in a feature-based data model In process planning, determining feature's machining precedence is an essential step. The task becomes more difficult if features interact with each other, in which case the feature precedence information may suggest multiple machining sequences of the features. This paper considers interacting features in a feature-based model for process planning tasks. For each feature, precedence information is generated considering both roughing and finishing operations. A rule-based system is developed and implemented based on the information about machining precedence of the interacting features. The STEP-NC data model is used as the underlying data model. This model is object-oriented and compliant with the existing STEP standards. The output of the system is also in the STEP format through an information model developed using the EXPRESS language.

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

machining features
feature interaction
step-nc


A compact substrate integrated waveguide H-plane horn antenna with dielectric arc lens An H-plane horn antenna constructed into SIW (substrate integrated waveguide) is proposed. It has a dielectric arc lens for better directivity and a simple microstrip transition as feed. The horn, the lens and the transition share the same substrate. The resulting formula from optical principles shows that the suitable dielectric lens can improve the directivity of the antenna significantly. A prototype was fabricated; the antenna size is 39.175 x 14 x 2 mm(3). The frequency band is from 25.5 to 28.5 GHz. The measured gain of this antenna is about 9 dB; the bandwidth, at 10 dB return loss, is over 12%. (c) 2007 Wiley Periodicals, Inc.

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

h-plane horn antenna
dielectric are lens
optics principle
radiation pattern


Improving recognition accuracy on structured documents by learning structural patterns In this paper, we present a probabilistic method that can improve the efficiency of document classification when applied to structured documents. The analysis of the structure of a document is the starting point of document classification. Our method is designed to augment other classification schemes and complement pre-filtering information extraction procedures to reduce uncertainties. To this end, a probabilistic distribution on the structure of XML documents is introduced. We show how to parameterise existing learning methods to describe the structure distribution efficiently. The learned distribution is then used to predict the classes of unseen documents. Novelty detection making use of the structure-based distribution function is also discussed. Demonstration on model documents and on Internet XML documents are presented.

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

bayesian networks
probabilistic tree model


Hospital capacity management decisions: Emphasis on cost control and quality enhancement This paper empirically examines the effects of several key hospital demographic factors (hospital size, location, teaching involvement) and service characteristics on hospital capacity management decisions, and the effects of hospital capacity resource management choices on cost control and quality enhancement. In this research structural equation modeling (SEM) was used as the research vehicle. SEM modeling measures multiple relationships among independent and dependent variables, thus accommodating aggregated dependent relationships simultaneously in one comprehensive model. Several managerial insights emerged from the research: (a) outpatient service, health care network, workforce competence, and information technology are identified as key indicators of hospital capacity resource management decisions in the current health care environment; (b) hospital cost control is influenced by equipment/technology and workforce decisions; (c) hospital quality performance is associated with equipment/technology decisions, and positively but not strongly related to workforce decisions; (d) location, size and service mix have a significant impact on hospital capacity decisions; and (e) staff training, staff competence, and job enlargement are key operational indicators influencing workforce development/management decisions.

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

capacity management
cost control
structural equation modeling

health care systems
quality assurance
workforce development


Developing a SPASE Query Language The advent of the Virtual Observatory has begun an evolution in the space physics data environment. A number of nascent and discipline specific Virtual Observatories have started to emerge with an emphasis on data search and retrieval. As this new data environment takes shape an emphasis will be placed on interdisciplinary communication in attempts to address large scale and global problems. To this end we formulate the development of a query language to facilitate Virtual Observatory to Virtual Observatory communication. Furthermore, we outline the goals of such a language, how it would work and how existing community efforts can be leveraged to speed the development of this query language.

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

data retrieval
virtual observatory communication


On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms In this work, we clarify, extend and solve an open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end delay bounds. We first focus on the difference between the time a packet finishes service in a scheduling algorithm and its virtual finish time under a CPS (General Processor Sharing) scheduler, called GPS-relative delay. We prove that, under a slightly restrictive but reasonable computational model, the lower bound computational complexity of any scheduling algorithm that guarantees O(1) CPS-relative delay bound is Omega(log(2)n) (widely believed as a "folklore theorem" but never proved). We also discover that, surprisingly, the complexity lower bound remains the same even if the delay bound is relaxed to O(n(a)) for 0 < a < 1. This implies that the delay-complexity tradeoff curve is "flat" in the "interval" [O(1), O(n)). We later extend both complexity results (for O(1) or O(n(a)) delay) to a much stronger computational model. Finally, we show that the same complexity lower bounds are conditionally applicable to guaranteeing tight end-to-end delay bounds. This is done by untangling the relationship between the GPS-relative delay bound and the end-to-end delay bound.

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

computational complexity
packet scheduling
delay bound


Visualizing space, time, and agents: production, performance, and preference Visualizations of space, time, and agents (or objects) are ubiquitous in science, business, and everyday life, from weather maps to scheduling meetings. Effective communications, including visual ones, emerge from use in the field, but no conventional visualization form has yet emerged for this confluence of information. The real-world spiral of production, comprehension, and use that fine-tunes communications can be accelerated in the laboratory. Here, we do so in search of effective visualizations of space, time, and agents. Users production, preference, and performance aligned to favor matrix representations with time as rows or columns and space and agents as entries. Overall, performance and preference were greater for matrices with discrete dots representing cell entries than for matrices with lines, but lines connecting cells may provide an advantage when evaluating temporal sequence. Both the diagram type and the technique have broader applications.

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

diagram production comprehension preference space time


Modeling and experimental methods to predict oxygen distribution in bone defects following cell transplantation We have developed a mathematical model that allows simulation of oxygen distribution in a bone defect as a tool to explore the likely effects of local changes in cell concentration, defect size or geometry, local oxygen delivery with oxygen-generating biomaterials (OGBs), and changes in the rate of oxygen consumption by cells within a defect. Experimental data for the oxygen release rate from an OGB and the oxygen consumption rate of a transplanted cell population are incorporated into the model. With these data, model simulations allow prediction of spatiotemporal oxygen concentration within a given defect and the sensitivity of oxygen tension to changes in critical variables. This information may help to minimize the number of experiments in animal models that determine the optimal combinations of cells, scaffolds, and OGBs in the design of current and future bone regeneration strategies. Bone marrow-derived nucleated cell data suggest that oxygen consumption is dependent on oxygen concentration. OGB oxygen release is shown to be a time-dependent function that must be measured for accurate simulation. Simulations quantify the dependency of oxygen gradients in an avascular defect on cell concentration, cell oxygen consumption rate, OGB oxygen generation rate, and OGB geometry.

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

oxygen consumption
bone defect
oxygen tension

tissue engineering
mathematical modeling


Prediction of externally applied forces to human hands using frequency content of surface EMG signals In this work, a new signal processing method was proposed in order to predict externally applied forces to human hands by deriving a relationship between the surface electromyographic (SEMG) signals and experimentally known forces. This relationship was investigated by analyzing the spectral features of the SEMG signals. SEMG signals were recorded from three subjects during isometric contraction and from another three subjects during anisometric contraction. In order to determine forceSEMG signal relationship, higher order frequency moments (HOFMs) of the signals were calculated and used as characterizing features of SEMG signals. Subsequently, artificial neural networks (ANN) with backpropagation algorithm were trained by using the HOFMs. Root mean square difference (RMSD) between the actual and predicted forces was calculated to evaluate force prediction performance of the ANN. In addition to RMSD, cross-correlation coefficients between actual and predicted force time histories were also calculated for anisometric experiment results. The RMSD values ranged from 0.34 and 0.02 in the isometric contraction experiments. In the anisometric contraction tests, RMSD results were between 0.23 and 0.09 and cross-correlation coefficients ranged from 0.91 to 0.98. In order to compare the performance of the HOFMs with a widely used EMG signal processing technique, root-mean-squared (RMS) values of the EMG signals were also calculated and used to train the ANN as another characterizing feature of the signal. Predicted forces using HOFMs technique were in general closer to the actual forces than those of obtained by using RMS values. The results indicated that the proposed signal processing method showed an encouraging performance for predicting the forces applied to the human hands, and the spectral features of the EMG signal might be used as input parameter for the myoelectric controlled prostheses.

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

higher order frequency moments
externally applied forces


Study on the enantioselectivity inhibition mechanism of acetyl-coenzyme A carboxylase toward haloxyfop by homology modeling and MM-PBSA analysis Acetyl-coenzyme A carboxylase (ACCase) has been identified as one of the most important targets of herbicide Aryloxyphenoxypropionates (APPs). ACCase shows different enantioselectivity toward APPs, and only (R)-enantiomers of APPs have the herbicidal activity. In order to deeply understand the enantioselective recognition mechanism of ACCase, (R)-haloxyfop, which is a typical commercial herbicide from APPs, is selected and the relative binding free energy between ACCase and (R)-haloxyfop is investigated and compared with that between ACCase and (S)-haloxyfop by homology modeling and molecular mechanics-Poisson-Boltzmann surface area (MM-PBSA) method. Further free energy analysis reveals that the preference of ACCase toward (R)-haloxyfop is mainly driven by Van der Waals interaction. The analysis of the interaction between the active site residues of ACCase CT domain and (R)-haloxyfop shows the van der Waals interactions have a close relationship with the addition effect of each residue. An understanding of the enantioselective recognition mechanism between ACCase and haloxyfop is desirable to discover novel chiral herbicides.

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

acetyl-coenzyme a carboxylase
haloxyfop, homology modeling
mm-pbsa analysis


Serial 3D model reconstruction for machining evolution of rotational parts by merging semantic and graphic process planning information The manufacturing of a mechanical part is a dynamic evolution process from a raw workpiece to the final part, in which the generation of serial 3D models reflecting the changes on geometric shapes is especially critical to digital manufacturing. In this paper, an approach driven by the process planning course, the machining semantics and the machining geometry to reconstruct incrementally the serial 3D models for rotational parts dynamic evolution is proposed. The two major techniques involved are: (1) extraction of machining semantics based on process planning language understanding; (2) 3D reconstruction from 2D procedure working drawings guided by machining semantics and visualization for the reconstructed series of 3D models. Compared with the conventional 3D reconstruction methods, this approach introduced the process planning course and relevant information to implement a dynamic, incremental and knowledge-based reconstruction which can greatly reduce the efforts in reconstruction and extend the collection of geometric shapes to be reconstructed.

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

serial 3d model reconstruction
process planning course
process planning information
machining semantics
merging


EFFECTS OF COATING RATE ON MORPHOLOGY OF COPPER SURFACES We have used standard fractal analysis and Markov approach to obtain further insights on roughness and multifractality of different surfaces. The effect of coating rates on generating topographic rough surfaces in copper thin films with same thickness has been studied using atomic force microscopy technique (AFM). Our results show that by increasing the coating rates, correlation length (grain sizes) and Markov length are decreased and roughness exponent is decreased and our surfaces become more multifractal. Indeed, by decreasing the coating rate, the relaxation time of embedding the particles is increased.

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

rough surface
multi-fractality
markov process


Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution In this paper, a memetic algorithm (MA) based on differential evolution (DE), namely MADE, is proposed for the multi-objective no-wait flow-shop scheduling problems (MNFSSPs). Firstly, a largest-order-value rule is presented to convert individuals in DE from real vectors to job permutations so that the DE can be applied for solving flow-shop scheduling problems (FSSPs). Secondly, the DE-based parallel evolution mechanism is applied to perform effective exploration, and several local searchers developed according to the landscape of multi-objective FSSPs are applied to emphasize local exploitation. Thirdly, a speed-up computing method is developed based on the property of the no-wait FSSPs. In addition, the concept of Pareto dominance is used to handle the updating of solutions in sense of multi-objective optimization. Due to the well balance between DE-based global search and problem-dependent local search as well as the utilization of the speed-up evaluation, the MNFSSPs can be solved effectively and efficiently. Simulation results and comparisons demonstrate the effectiveness and efficiency of the proposed MADE.

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

differential evolution
memetic algorithm
local search


improving binding times without explicit cps-conversion A major obstacle in partial evaluation (program specialization) is the need for binding time improvements . By reorganizing a source program, the residual programs obtained by specializing the source program may be improved: more computations can be done statically, that is, at specialization time. One well-known effective reorganization is (manual or automatic) conversion into continuation passing style (cps). This conversion allows data consumers to be propagated through frozen expressions to the data producers . In this paper we show how such improvements can be obtained without affecting the source program: by writing the program specializer itself in cps ; traditionally, specialization has been formulated in direct style. The advantages of avoiding cps-converting source programs are: (1) no cps-conversion phase is needed; (2) the generated residual programs are not in cps; (3) since no source level continuations are added, there is no overhead of manipulating closure representations in the generating extensions (e.g. compilers) obtained by self-application; (4) manual binding time debugging is easier since binding time analysis is done on a non-converted program. We have implemented a cps-based program specializer; it is integrated in the partial evaluator Similix 4.0. Using a cps-specializer, partially static data structures can be handled safely in a straightforward way. The difficulty is to ensure automatically that residual expressions that become part of a partially static data structure are neither duplicated nor discarded. This is achieved by binding such residual expressions in automatically inserted frozen let-expressions; cps is needed to propagate operations on the partially static data structure through these frozen let-expressions. Based on this idea, we have implemented an extension of Similix 4.0 that handles partially static data structures.

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

partial evaluation
program
time analysis
specialization
data structures
data
direct
binding
paper
continuation
writing
debugging

express operability compilation extensibility timing effect conversation integrability


Integration of multivariate SPM and FDD by parity space technique for a food pasteurization process Multivariate statistical process monitoring (MSPM), contribution plots, and parity space fault diagnosis (FD) techniques are used to detect abnormal operation of dynamic processes and diagnose sensor and actuator faults. The methods are illustrated by monitoring the critical control points (CCP) and diagnosing causes of abnormal operation of a pilot pasteurization plant. An empirical model of the process is developed by using subspace state space system identification methods and normal process data. The process data collected under the influence of different magnitude and duration of faults in sensors and actuators are used to validate the MSPM and FD techniques. T-2 and squared prediction error (SPEN) charts are used as MSPM charts. A parity space technique for dynamic stochastic systems and dynamic trends in contribution plots of T-2 and SPEN statistics are used for FD. The detection and FD by these techniques show significant improvements over univariate methods. (C) 2001 Published by Elsevier Science Ltd. All rights reserved.

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

statistical process monitoring
fault diagnosis
contribution plots
parity space


The size of subsequence automaton Given a set of strings, the subsequence automaton accepts all subsequences of these strings. We derive a lower bound for the maximum number of states of this automaton. We prove that the size of the subsequence automaton for a set of k strings of length n is Omega(n(k)/(k + 1)(k)k!) for any k >= 1. It solves an open problem because only the case k <= 2 was shown before. (c) 2005 Elsevier B.V. All rights reserved.

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

searching subsequences
directed acyclic subsequence graph


Modelling inpatient length of stay by a hierarchical mixture regression via the EM algorithm The modelling of inpatient length of stay (LOS) has important implications in health care studies. Finite mixture distributions are usually used to model the heterogeneous LOS distribution, due to a certain proportion of patients sustaining-a longer stay. However, the morbidity data are collected from hospitals, observations clustered within the same hospital are often correlated. The generalized linear mixed model approach is adopted to accommodate the inherent correlation via unobservable random effects. An EM algorithm is developed to obtain residual maximum quasi-likelihood estimation. The proposed hierarchical mixture regression approach enables the identification and assessment of factors influencing the long-stay proportion and the LOS for the long-stay patient subgroup. A neonatal LOS data set is used for illustration, (C) 2003 Elsevier Science Ltd. All rights reserved.

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

clustered data
generalized linear mixed models
mixture distribution


All-or-Nothing Transforms as a countermeasure to differential side-channel analysis Side-channel attacks on hardware implementations of cryptographic algorithms have recently been the focus of much attention in the research community. Differential power analysis (DPA) has been shown to be particularly effective at retrieving secret information stored within an implementation. The design of DPA-resistant systems that are efficient in terms of speed and area poses a significant challenge. All-or-Nothing Transforms are cryptographic transforms, which are currently employed in numerous applications. We examine All-or-Nothing Encryption systems from the DPA perspective. This paper shows that All-or-Nothing cryptosystems, whilst not preventing side-channel leakage, do fundamentally inhibit DPA attacks. Furthermore, we develop extensions to the All-or-Nothing protocol to strengthen the DPA resistance of the cryptosystem, providing a practical alternative to masking countermeasures for symmetric ciphers.

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

side-channel attacks
all-or-nothing transforms


Phase calibration technique for mismatch optimization in image-reject receivers This paper presents phase calibration technique without using any external tone for weaver image-reject receiver. Error signal (phase mismatch information) is generated using a simple algorithm and this signal is used for mismatch elimination. Calibration system has been implemented using simulink which shows an image rejection ratio of 59.5 dB can be achieved for RF signal operating at 1.8 GHz.

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


a computing perspective on the bologna process The Bologna process is intended to culminate in the formation of the European Higher Education Area (EHEA) by 2010. Its aim is to facilitate the mobility of people, the transparency and recognition of qualifications, quality and development of a European dimension to higher education, and the attractiveness of European institutions for third country students.This paper provides an overview of progress towards implementation in EHEA member states using official documents and interview data from faculty teaching computing in countries represented at the ITiCSE 2006 meeting. The key areas where the structures established by the Bologna process are problematic for computing education arise from the rapidly changing nature of the curriculum. It seems that the maturity and capability criteria, as well as the manner in which learning outcomes are specified, being developed within the Bologna process are too general. This endangers the properties of transparency and mobility that the process intends to promote.Progression and prerequisite knowledge in computing degrees can be very specific. For instance, generic learning outcomes for an introductory programming course quite rightly will not specify the programming language, or languages, used to implement algorithms. However, suppose a student intends to study an advanced algorithms and data structures course in which Java is the language of implementation which has an introductory course in programming as a prerequisite. If the introductory course language was Standard ML it is not clear that the prerequisite course actually provides the student with a suitable background. These types of complexities are typical of computing, where early subject curricula are not standardised nationally or internationally, and create significant hurdles for realising the Bologna objectives.

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

bologna declaration
europe
standardization and curriculum issues
computer science education


LOD visibility culling and occluder synthesis Level-of-detail occlusion culling is a novel approach to the management of occluders that can be easily integrated into most current visibility culling algorithms. The main contribution of this paper is an algorithm that automatically generates sets of densely overlapping boxes with enhanced occlusion properties from non-convex subsets. We call this method occluder synthesis because it is not sensitive to the way the objects are tesselated but to the space enclosed by them. The extension of this technique by allowing a bounded amount of image error is also discussed. We show that visibility computations can be based on a multiresolution model which provides several representations of these occluders with varying visibility accuracy. Our tests show that occlusion performance in tesselated scenes is improved severely even if no image-error is allowed.

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


GROUP DECISION-MAKING AND CONSENSUS UNDER FUZZY PREFERENCES AND FUZZY MAJORITY We present how fuzzy logic with linguistic quantifiers, mainly its calculi of linguistically quantified propositions, can be used in group decision making. The fuzzy linguistic quantifiers (exemplified by most, almost all,...) are employed to represent a fuzzy majority which is in many cases closer to a real human perception of the very essence of majority, Fuzzy logic provides here means for a formal handling of such a fuzzy majority which was not possible by using traditional formal apparata. Assuming fuzzy individual and social preference relations, as it is commonly done, and employing in addition a fuzzy majority expressed by a fuzzy linguistic quantifier, we redefine solution concepts in group decision making, and present new 'soft' degrees of consensus.

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

fuzzy logic
linguistic quantifier
fuzzy majority
group decision making
consensus


Parallel bulk-loading of spatial data Spatial database systems have been introduced in order to support non-traditional data types and more complex queries. Although bulk-loading techniques for access methods have been studied in the spatial database literature, parallel bulk-loading has not been addressed in a parallel spatial database context. Therefore, we study the problem of parallel bulk-loading, assuming that an R-tree like access method need to be constructed, from a spatial relation that is distributed to a number of processors. Analytical cost models and experimental evaluation based on real-life and synthetic datasets demonstrate that the index construction time can be reduced considerably by exploiting parallelism. I/O costs, CPU time and communication costs are taken into consideration in order to investigate the efficiency of the proposed algorithm.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 databases
spatial access methods
bulk-loading
query processing


Genetic algorithms for designing loop layout manufacturing systems A common layout for flexible manufacturing system is loop network with machines arranged in a cycle and materials transported in only one direction around the cycle. Congestion is a common measure for evaluating a loop layout. This paper investigates the problem of designing loop layout system with both of minsum and minmax congestion measures. A hybrid heuristic of genetic algorithms and neighborhood search is developed for solving such problem and preliminary computational results are reported.

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

genetic algorithms and manufacturing systems


Taylor series approach to fuzzy multiobjective linear fractional programming This paper presents the use of a Taylor series for fuzzy multiobjective linear fractional programming problems (FMOLFP). The Taylor series is a series expansion that a representation of a function. In the proposed approach, membership functions associated with each objective of fuzzy multiobjective linear fractional programming problem transformed by using a Taylor series are unified. Thus, the problem is reduced to a single objective. Practical applications and numerical examples are used in order to show the efficiency and superiority of the proposed approach.

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


A power efficient gain enhancing technique for current mirror operational transconductance amplifiers In this paper, a power efficient voltage gain enhancing technique is described. This technique is suitable for the amplifiers which use current starving method for gain enhancement (explained in the text). The proposed technique makes use of the current which conventionally goes to ground, through a parallel path. In this paper, the new technique is demonstrated for current mirror type of operational transconductance amplifier (OTA). Simulation results show that gain improves by a factor ~2, while consuming the same power as conventional OTA. The added advantage of this technique is that it does not affect the voltage swing while increasing the gain. Compared to the conventional current starving technique, the proposed technique also improves the noise performance and settling speed of the amplifier. The results are compared with the conventional technique, in terms of gain, settling and noise performance. A comparison of FoM (MHz.pF/mA), with other amplifiers, is given at the end as well.

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


Nonlinear nonviscous hydrodynamical models for charge transport in the framework of extended thermodynamic methods This paper develops a procedure, based on methods of extended thermodynamics, to design nonlinear hydrodynamical models for charge transport in metals or in semiconductors, neglecting viscous phenomena. Models obtained in this way allow the study of the motion of electric charges in the presence of arbitrary external electric fields and may be useful when one wishes to study phenomena in a neighborhood of a stationary nonequilibrium process: indeed, the drift velocity of the charge gas with respect to the crystal lattice is not regarded as a small parameter. (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 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

kinetic and transport theory
nonequilibrium thermodynamics
nonlinear phenomena
modeling semiconductor devices


Formal foundations for situation awareness based on dependent type theory Cognitive situation awareness has recently caught the attention of the information fusion community. Some approaches have developed formalizations that are both ontology-based and underpinned with Situation Theory. While the semantics of Situation Theory is very attractive from the cognitive point of view, the languages that are used to express knowledge and to reason with suffer from a number of limitations concerning both expressiveness and reasoning capabilities. In this paper we propose a more general formal foundation denoted S-DTT (Situation-based Dependent Type Theory) that is expressed with the language of the Extended Calculus of Constructions (ECC), a widely used theory in mathematical formalization and in software validation. Situation awareness relies on small blocks of knowledge called situation fragment types whose composition leads to a very expressive and unifying theory. The semantic part is provided by an ontology that is rooted in the S-DTT theory and, on which higher-order reasoning can be performed. The basis of the theory is summarized and its expressing power is illustrated with numerous examples. A scenario in the healthcare context for patient safety issues is detailed and a comparison with well-known approaches is discussed. (C) 2012 Elsevier B.V. All rights reserved.

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

ontologies
dependent types
aggregation
subsumption
type inhabitation


a highly parallel implementation of k-means for multithreaded architecture We present a parallel implementation of the popular k-means clustering algorithm for massively multithreaded computer systems, as well as a parallelized version of the KKZ seed selection algorithm. We demonstrate that as system size increases, sequential seed selection can become a bottleneck. We also present an early attempt at parallelizing k-means that highlights critical performance issues when programming massively multithreaded systems. For our case studies, we used data collected from electric power simulations and run on the Cray XMT.

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


Optimization of nonconventional wells under uncertainty using statistical proxies The determination of the optimal type and placement of a nonconventional well in a heterogeneous reservoir represents a challenging optimization problem. This determination is significantly more complicated if uncertainty in the reservoir geology is included in the optimization. In this study, a genetic algorithm is applied to optimize the deployment of nonconventional wells. Geological uncertainty is accounted for by optimizing over multiple reservoir models (realizations) subject to a prescribed risk attitude. To reduce the excessive computational requirements of the base method, a new statistical proxy (which provides fast estimates of the objective function) based on cluster analysis is introduced into the optimization process. This proxy provides an estimate of the cumulative distribution function (CDF) of the scenario performance, which enables the quantification of proxy uncertainty. Knowledge of the proxy-based performance estimate in conjunction with the proxy CDF enables the systematic selection of the most appropriate scenarios for full simulation. Application of the overall method for the optimization of monobore and dual-lateral well placement demonstrates the performance of the hybrid optimization procedure. Specifically, it is shown that by simulating only 10% or 20% of the scenarios (as determined by application of the proxy), optimization results very close to those achieved by simulating all cases are obtained.

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

advanced wells
reservoir simulation
risk analysis
stochastic optimization
uncertainty management


resource allocation across multiple cloud data centres Web applications with rich AJAX-driven user interfaces make asynchronous server-side calls to switch application state. To provide the best user experience, the response time of these calls must be as low as possible. Since response time is bounded by network delay, it can be minimised by placing application components closest to the network location of the majority of anticipated users. However, with a limited budget for hosting applications, developers need to select data centre locations strategically. In practice, the best choice is difficult to achieve manually due to dynamic client workloads and effects such as flash crowds. In this paper, we propose a cloud management middleware that automatically adjusts the placement of web application components across multiple cloud data centres. Based on observations and predictions of client request rates, it migrates application components between data centres. Our evaluation with two data centres and globally distributed clients on PlanetLab shows that our approach can decrease median client response times by 21\% for a realistic multi-tier web application.

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

management middleware
resource allocation
web applications


Effects of loading on spinal shrinkage in males of different age groups A reduction in stature (shrinkage) has been used as a measure of the load on the spine. Musculoskeletal effects of ageing may influence individual responses to compressive loading on the spine and the resultant loss in stature. The aim was to apply the technique of precision stadiometry for assessment of spinal shrinkage in a comparison of responses of two different age groups performing a regimen of circuit weight training. In all, 20 subjects (10 aged 1825 and 10 aged 4760 years) participated in the study. Each performed two sets of a 12-station circuit of exercises, the loading being established relative to individual capabilities. Recovery procedures using a semi-supine posture intervened between the two sets and again post-exercise; altogether seven measures of change in stature were obtained using precision stadiometry. The two groups showed a similar pattern of spinal shrinkage, losses in stature being greater for the first set compared to the later set of exercises. Subjects gained height whilst in the formal recovery posture, but responses were inconsistent during warm-up, cool-down and active recovery. Irrespective of age, the spine was less responsive to loading as the duration of activity was increased. It was concluded that provided loading is related to individual capability, healthy older operators are not necessarily compromised by their age in activities that include handling and lifting weights.

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


Attention-Based Detection of Unknown Objects in a Situated Vision Framework We present an attention-based approach for the detection of unknown objects in a 3D environment. The ability to address individual objects in the environment without having previous knowledge about their properties or their identity is one important requirement of the Situated Vision theory. Based on saliency maps, our attention system determines the regions where objects are likely to be found; these are the proto-objects whose extent is refined by a 2D segmentation step. At the same time a 3D scene model is built from measurements of a depth camera. The detected objects are projected into the 3D scene, resulting in 3D object models which are incrementally updated. We show the validity of our approach in an RGB-D sequence recorded in an office environment.

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

object detection
computational visual attention


Logic of knowledge and discovery via interacting agents Decision algorithm for true and satisfiable statements ? In this paper we study logical properties of the operation chance discovery (CD) via structures based on special Kripke/Hintikka models. These models use as bases partially ordered sets of indexes (indexes of steps in a computation, or ones indicating time points in a time flow), and clusters of states associated to each index. The language chosen to build the logical formulas includes modal/temporal operations, operations for the agents knowledge, local and global operations for CD, operation of local common knowledge, and an operation for chance of discovery via agents interactions. We introduce and study a logic (of knowledge and discovery via interaction of agents), LDKa, which is defined by semantics, as the set of all formulas that are valid in all suggested models. The paper provides an algorithm to recognize logical laws (and satisfiable formulas) of LDKa. The algorithm replaces a formula with a rule in a special, so-called reduced normal form, and, then it verifies the validity of this rule in specific models of exponential size in the size of the rule. We show that the problem of computing the true logical laws of LDKa is decidable.

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

chance discovery (cd)
modal logic
temporal logic
agents knowledge logic
hybrid logics
decidability
inference rules
rules in normal reduced form


structuring interactive tv documents Interactive video technology is meant to support user-interaction with video in scene objects associated with navigation in video segments and access to text-based metadata. Interactive TV is one of the most important applications of this area, which has required the development of standards, techniques and tools, such as MPEG-4 and MPEG-7, to create, to describe, to deliver and to present interactive content.In this scenario, the structure and organization of documents containing multimedia metadata play an important role. However, the Interactive TV documents structuring and organization has not been properly explored during the development of advanced Interactive TV services.This work presents a model to structure and to organize documents describing Interactive TV programs and its related media objects, as well as the links between them. This model gives support to represent contextual information, and makes possible to use relevant metadata information in order to implement advanced services like object-based searches, in- movie (scenes, frames, in-frame regions) navigation, and personalization. To demonstrate the functionalities of our model, we have developed an application which uses an Interactive TV program's documents descriptions to present information about in-frame video objects.

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


Motion adaptation based on character shape With the increasing performances of the graphics hardware, virtual reality applications are reaching a new level of realism. It is now possible to animate entire crowds of virtual avatars, or to display in real-time highly realistic deformable characters. This new type of applications requires that characters are deformed, either to generate a large number of individuals for creating a crowd, or to match a particular shape. To make the animation fit to the animated character and to prevent self-collisions, adapting the motion is mandatory. Unlike previous approaches which relied on skeletal models, this paper presents a method considering the actual shape of the character's body to perform the adaptation. Our approach uses spacetime optimization to remove the self-penetration, and finally re-establishes the balance of the motion. We also introduce an interpolation scheme based on radial basis functions that can blend pre-calculated adaptations, and thus achieve real-time performances. Copyright (C) 2008 John Wiley & Sons, Ltd.

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


managing deviant behavior in online communities Wherever groups of people gather, norms for appropriate behavior emerge, and some people chose to violate those norms. What is an exercise of free speech to one person, to another is disruptive, harassing, racist, or worse. For groups that communicate online, a range of technical and social mechanisms are available to help create a climate conducive to meeting the group's stated mission. How do designers of online systems decide what kind of conduct is acceptable? How are these expectations communicated to members? How can designers help prevent and manage deviant behavior? What are the implications of corporate control of content for ideals of free expression? This panel brings together experts from media theory, computer-supported collaborative learning (CSCL), computer-supported cooperative work (CSCW), and online entertainment to explore current issues in this complex research area.

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

deviant behavior
norms
online communities

community standards
socio-technical systems


Real-time stylistic prediction for whole-body human motions The ability to predict human motion is crucial in several contexts such as human tracking by computer vision and the synthesis of human-like computer graphics. Previous work has focused on off-line processes with well-segmented data; however, many applications such as robotics require real-time control with efficient computation. In this paper, we propose a novel approach called real-time stylistic prediction for whole-body human motions to satisfy these requirements. This approach uses a novel generative model to represent a whole-body human motion including rhythmic motion (e.g., walking) and discrete motion (e.g., jumping). The generative model is composed of a low-dimensional state (phase) dynamics and a two-factor observation model, allowing it to capture the diversity of motion styles in humans. A real-time adaptation algorithm was derived to estimate both state variables and style parameter of the model from non-stationary unlabeled sequential observations. Moreover, with a simple modification, the algorithm allows real-time adaptation even from incomplete (partial) observations. Based on the estimated state and style, a future motion sequence can be accurately predicted. In our implementation, it takes less than 15ms for both adaptation and prediction at each observation. Our real-time stylistic prediction was evaluated for human walking, running, and jumping behaviors.

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

human motion prediction
multifactor state-space models
style-content separation


Solving multi-period project selection problems with fuzzy goal programming based on TOPSIS and a fuzzy preference relation Project portfolio decisions are complex multi-objective problems. We propose a fuzzy goal programming model for project portfolio selection. The proposed model is based on TOPSIS and a fuzzy preference relation. TOPSIS is used to reduce the multi-objective problem into a bi-objective problem. A fuzzy preference relation is used to capture uncertain preferences toward fuzzy goals.

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

fuzzy goal programming
fuzzy preference relation
topsis

type ii fuzzy set
multi-objective project selection


Enhancing quality of knowledge synthesized from multi-database mining Multi-database mining using local pattern analysis could be considered as an approximate method of mining multiple large databases. Thus, it might be required to enhance the quality of knowledge synthesized from multiple databases. Also, many decision-making applications are directly based on the available local patterns in different databases. The quality of synthesized knowledge/decision based on local patterns in different databases could be enhanced by incorporating more local patterns in the knowledge synthesizing/processing activities. Thus, the available local patterns play a crucial role in building efficient multi-database mining applications. We represent patterns in condensed form by employing a coding called ACP coding. It allows us to consider more local patterns by lowering further the user inputs, like minimum support and minimum confidence. The proposed coding enables more local patterns participate in the knowledge synthesizing/processing activities and thus, the quality of synthesized knowledge based on local patterns in different databases gets enhanced significantly at a given pattern synthesizing algorithm and computing resource.

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

acp coding
quality of synthesized knowledge

space efficient representation of local association rules


designing and evaluating the tabletop game experience for senior citizens In this paper, we report on the design and evaluation of a tabletop game especially created for senior citizens. The game is intended to provide leisure and fun and is played with four players on an augmented tabletop. It evolved from existing games and rules that are popular and familiar amongst senior citizens. Several aspects that are part of the gaming experience, such as immersion, flow, affect and, challenge, were assessed experimentally. The gaming experience was measured relatively by subjectively comparing user reactions across two sessions, one using a conventional board game and another using a digital tabletop version of the same game. Our results indicate that senior citizens found the tabletop version of the game to be more immersive and absorbing. We also discuss some implications to tabletop game design that can be deduced from the qualitative feedback provided by our participants.

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

elderly
board-games
user-centered design
focus group
ethnography


Minimizing the Total Energy Consumption in Multi-hop UWASNs This paper investigates the total energy consumption in multi-hop underwater acoustic sensor networks (UWASNs) for a given target signal to noise ratio (SNR) requirement. Specifically, our aim is to minimize the energy consumption along the route between source and destination and to find the optimal hop distance that result in minimum energy consumption, by taking into account the propagation characteristics of sound signals through the underwater acoustic medium. The proposed study will form the basis for the design of energy efficient routing protocols that select minimum energy route in UWASNs. The impact of various characteristics of underwater acoustic signal propagation such as attenuation, noise, and the dependence of usable bandwidth and transmit power on distance, are considered for the energy consumption analysis. Further, analysis is carried out for both shallow and deep water scenarios under the assumption that each node can adjust its transmission power for a link so that the signal reaches the destination node, satisfying a target received SNR. We observe that, a linear equidistant network consumes minimum energy for both shallow as well as deep water scenarios.

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


Finding Recurrent Patterns from Continuous Sign Language Sentences for Automated Extraction of Signs We present a probabilistic framework to automatically learn models of recurring signs from multiple sign language video sequences containing the vocabulary of interest. We extract the parts of the signs that are present in most occurrences of the sign in context and are robust to the variations produced by adjacent signs. Each sentence video is first transformed into a multidimensional time series representation, capturing the motion and shape aspects of the sign. Skin color blobs are extracted from frames of color video sequences, and a probabilistic relational distribution is formed for each frame using the contour and edge pixels from the skin blobs. Each sentence is represented as a trajectory in a low dimensional space called the space of relational distributions. Given these time series trajectories, we extract signemes from multiple sentences concurrently using iterated conditional modes (ICM). We show results by learning single signs from a collection of sentences with one common pervading sign, multiple signs from a collection of sentences with more than one common sign, and single signs from a mixed collection of sentences. The extracted signemes demonstrate that our approach is robust to some extent to the variations produced within a sign due to different contexts. We also show results whereby these learned sign models are used for spotting signs in test sequences.

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

pattern extraction
sign language recognition
signeme extraction
sign modeling


On the scalability of biocomputing algorithms: The case of the maximum clique problem The paper aims at demonstrating and confirming that breadth first search or pruning techniques can substantially improve the effectiveness of biomolecular algorithms. A breadth first search-based DNA algorithm solving the maximum clique problem for a graph is presented, and its complexity and scalability parameters are studied. The analysis shows that parameters like the number of steps, the length and volume of DNA strands, the number of enzymes and the concentration of the molecules encoding solutions are dramatically improved in comparison with previous approaches to the same problem and, theoretically, they would allow to process graphs with thousands of vertices. These parameters are also compared with several related results focusing on the scalability of DNA computing methods. Finally, an analysis of error-resistance of the algorithm is given. (C) 2011 Elsevier B.V. All rights reserved.

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

dna computing
breadth first search
maximum clique problem


Intelligent control of a stepping motor drive using an adaptive neurofuzzy inference system Stepping motors are widely used in robotics and in the numerical control of machine tools where they have to perform high-precision positioning operations. However, the variations of the mechanical configuration of the drive, which are common to these two applications, can lead to a loss of synchronism for high stepping rates. Moreover, the classical open-loop speed control is weak and a closed-loop control becomes necessary. In this paper, fuzzy logic is applied to control the speed of a stepping motor drive with feedback. A neuro-fuzzy hybrid approach is used to design the fuzzy rule base of the intelligent system for control. In particular, we used the ANFIS methodology to build a Sugeno fuzzy model for controlling the stepping motor drive. An advanced test bed is used in order to evaluate the tracking properties and the robustness capacities of the fuzzy logic controller.

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


A partial solution to the problem of proper reparametrization for rational surfaces ? ?? Given an algebraically closed field K K , and a rational parametrization P P of an algebraic surface V?K3 V ? K 3 , we consider the problem of computing a proper rational parametrization Q Q from P P (reparametrization problem ). More precisely, we present an algorithm that computes a rational parametrization Q Q of V V such that the degree of the rational map induced by Q Q is less than the degree induced by P P . The properness of the output parametrization Q Q is analyzed. In particular, if the degree of the map induced by Q Q is one, then Q Q is proper and the reparametrization problem is solved. The algorithm works if at least one of two auxiliary parametrizations defined from P P is not proper.

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

rational surface
degree of a rational map


Making Aggregation Work in Uncertain and Probabilistic Databases We describe how aggregation is handled in the Trio system for uncertain and probabilistic data. Because "exact" aggregation in uncertain databases can produce exponentially sized results, we provide three alternatives: a low bound on the aggregate value, a high bound on the value, and the expected value. These variants return a single result instead of a set of possible results, and they are generally efficient to compute for both full-table and grouped aggregation queries. We provide formal definitions and semantics and a description of our open source implementation for single-table aggregation queries. We study the performance and scalability of our algorithms through experiments over a large synthetic data set. We also provide some preliminary results on aggregations over joins.

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


Sustainable synthesis of biogas processes using a novel concept of eco-profit The objective of this contribution is to perform the sustainable mixed-integer linear programming (MILP) synthesis of biogas processes based on life cycle assessment (LCA). An aggregated model previously developed by authors for the efficient optimisation of biogas processes has been upgraded with LCA, using the novel concept of eco-profit. Eco-profit is defined as the difference between burdening (eco-cost) and unburdening (eco-benefit) the environment, where eco-cost and eco-benefit calculations are based on LCA. The advantage of eco-profit is that it is expressed as a monetary value. Therefore. eco-profit and economic profit can be merged together and the preferred solutions are those with maximal total profit. The single-and multi-objective optimisations were performed on a model of the biogas production processes. Within the former, economic, eco- and total profit were maximised separately and, within the latter, maximisation of economic profit vs. eco-profit was introduced. All the results obtained from single- and multi-criteria optimisation show that biogas production is a sustainable alternative that provides an important eco-profit. (c) 2012 Elsevier Ltd. All rights reserved.

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


A graph theoretic approach linking design dimensioning and process planning The purpose of this paper and its companion (Part 1) is to present a rigorous graph theoretic model to link designing with process planning. Part 1 explains how to develop process plans from design dimension trees. Part 2 explains how knowledge of the structure of datum-hierarchy trees underlying process plans can be used to formulate design heuristics for part dimensioning. The design dimension trees resulting from application of the heuristics have the fewest number of constraints on process planning and allow parts to be produced with minimal tolerance stack-ups and production costs. Several rules are presented to demonstrate the concepts and approach.

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

datum-hierarchy tree
tolerance stack
part variation
design heuristic


Nash-type equilibrium theorems and competitive Nash-type equilibrium theorems In this paper, we consider two types of equilibrium problems. We study the constrained Nash-type equilibrium problems with multivalued payoff functions. We also study the competitive Nash-type equilibrium problems with multivalued payoff functions. In these two equilibrium problems, we want to find a strategy combination such that each player wishes to find a minimal loss from his multivalued payoff function. We use a fixed-point theorem of Park to prove the existence results of these two types of equilibrium problems. (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 O O O O O O O O O O O O O O O O O O O O O O O

nash equilibrium problem
closed multimap
c-quasiconvex
continuous selection


Remarks on the periodic boundarv value problems for integrodifferential equations of Volterra type This paper is concerned with the monotone method on the periodic boundary value problems for integrodifferential equations of Volterra type. This problem has been studied by several authors [1-6]. The purpose of this paper is to relax the restrictions as much as possible on the coefficients M and N that appear in the one-sided Lipschitz condition. (C) 2004 Elsevier Ltd. All rights reserved.

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

periodic boundary value problem
lower and upper solutions
monotone iteration
contraction mapping
poincare operator


A two-stage design of adaptive fuzzy controllers for time-delay systems with unknown models In this article, a systematic two-stage design method for adaptive fuzzy controllers is presented. The proposed control scheme has low computational complexity. Moreover, the exact mathematical model of the plant to be controlled is not required. The fuzzy controller under consideration is based on the proportional-derivative fuzzy control scheme and triangular membership functions. In the design procedure, the domain intervals of the input and output variables are selected with a heuristic approach to minimize a cost function under the constraint of tolerable overshoots in the response curve. A learning scheme is then proposed to automatically adjust the parameters in the fuzzy controller to reduce the error of the system. It can also be used adaptively to improve the system performance of a time-varying system. Simulations and comparisons are included to demonstrate the effectiveness of the proposed method.

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

if-then rule
triangular membership function


A linear nonconforming finite element method for Maxwell's equations in two dimensions. Part I: Frequency domain We suggest a linear nonconforming triangular element for Maxwell's equations and test it in the context of the vector Helmholtz equation. The element uses discontinuous normal fields and tangential fields with continuity at the midpoint of the element sides, an approximation related to the Crouzeix-Raviart element for Stokes. The element is stabilized using the jump of the tangential fields, giving us a free parameter to decide. We give dispersion relations for different stability parameters and give some numerical examples, where the results converge quadratically with the mesh size for problems with smooth boundaries. The proposed element is free from spurious solutions and, for cavity eigenvalue problems, the eigenfrequencies that correspond to well-resolved eigenmodes are reproduced with the correct multiplicity. (C) 2010 Published by Elsevier Inc.

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

maxwell's equations
stabilized methods
interior penalty method
nonconforming method


Aesthetics-Based Stereoscopic Photo Cropping for Heterogeneous Displays Stereoscopic displays are becoming ubiquitous, ranging from large 3-D TVs to small mobile phones. Stereoscopic photos need to be carefully adapted to be effectively viewed on the displays other than originally intended. In this paper, we present a method that can automatically crop and scale an existing stereoscopic photo to a variety of displays while preserving its aesthetic value. We formulate stereoscopic photo adaptation as an optimization problem that aims to preserve the aesthetic value of the input photo. We define a wide range of energy terms to preserve the stereoscopic photo aesthetics by borrowing rules from stereoscopic photography. Our experiments on a wide variety of stereoscopic photos demonstrate that our method can robustly produce display-dependent stereoscopic photos that deliver pleasant viewing experiences.

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

aesthetics
photo cropping
stereoscopic photography


Adaptive Search Window for High Efficiency Video Coding This paper presents an adaptive search window based on prediction error of neighboring blocks, first projection method proved to be less complex by statistical proof and then experimental results are conducted on various video sequence by correlating different frames. Threshold values for changing different search range are chosen from average SAD of designated region of block and finally by effectively switching from different search range, unwanted computation are eliminated. As local characteristics of the motion is utilized for selecting the search range, the proposed algorithm achieves several times faster than the exhaustive search with negligible performance degradation. For QCIF, CIF WQVGA, 720p and 1080p size videos the proposed method attains 54% reduction of computational complexity, while maintaining video quality.

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

motion estimation
hevc
adaptive selection
thresholding


A schedule-based pathfinding algorithm for transit networks using pattern first search The lack of effective and efficient schedule-based pathfinding algorithms for transit networks has limited the application of GIS in transit trip planning services. This paper introduces a schedule-based path finding algorithm for transit networks. Based on a pattern-centered spatiotemporal transit network model, the algorithm searches the network by following route patterns. A pattern is a spatial layout of a route in transit terminology. A route usually has many patterns to serve various locations at different times. This path search algorithm is significantly different from traditional shortest path algorithms that are based on adjacent node search. By establishing a set of lemmas and theorems the paper proves that paths generated by the PFS algorithm are schedule-coordinated fastest paths for trips with given constraints. After analyzing computation and database query complexities of the algorithm the paper indicates that the PFS is efficient in computation and database query. Finally, effectiveness and efficiency of the algorithm are demonstrated by implementations in GIS-based online transit trip planners in Wisconsin, US.

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

gis
transit network
pathfinding
algorithm
trip planning


Integrating statistical and hydrological models to identify implementation sites for agricultural conservation practices ? Novel techniques identify the best location for conservation practice installation. Trellis plots help to determine the optimal distance to maximize pollution reduction. Surface plots were created to visualize watershed response to pollution reduction. This study helps decision makers and stakeholders in local and watershed-scale planning.

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

best management practices
swat
mixed effect model
stream order
surface plot


building a case for fipa compliant multiagent approaches for wireless sensor networks There have been some efforts to apply agent based approaches in Wireless Sensor Networks (WSNs) for different application scenarios in recent past. These efforts have met with varying levels of success so far. However, the efforts to assess the suitability of Foundation for Intelligent Physical Agents (FIPA) compliant multiagent solutions for WSNs are almost non-existent. In this paper we present a scenario from an industrial domain and asses the suitability of a FIPA compliant multiagent based solution for it. The scenario is based on a WSN deployment in an underground mine where it could be put to use for several purposes like hazardous gas plume detection and tracking, mine lighting control, Proximate Environment Monitoring (PEM), structural health monitoring of mine structure, to name a few. However, we only consider the PEM usage scenario in this paper.

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

multiagent systems
middleware
fipa compliance


Eigenvalue approach in a three-dimensional generalized thermoelastic interactions with temperature-dependent material properties A three-dimensional model of the generalized thermoelasticity without energy dissipation under temperature-dependent mechanical properties is established. The modulus of elasticity is taken as a linear function of the reference temperature. The resulting formulation in the context of Green and Naghdi model II is applied to a half-space subjected to a time-dependent heat source and traction free surface. The normal mode analysis and eigenvalue approach techniques are used to solve the resulting non-dimensional coupled equations. Numerical results for the field quantities are given in the physical domain and illustrated graphically. The results are also compared to results obtained in the case of temperature-independent modulus of elasticity.

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

thermoelasticity
green and naghdi model ii
normal mode analysis
eigenvalue approach


A Note on Nonexpansive, Essentially LR Automorphisms of Topological Markov Shifts We show that there is a nonexpansive, essentially LR automorphism ? of the full 2-shift such that for all n?N, ? n is not LR.

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

symbolic dynamics
topological markov shift
textile system
37b10


a new worm exploiting ipv4-ipv6 dual-stack networks It is commonly believed that the IPv6 protocol can provide good protection against network worms due to its huge address space. However, it is proved to be incorrect by our study on the new "dual-stack worm" which can spread in IPv4-IPv6 dual-stack networks. It is found in this paper that the dual-stack worm can collect the IPv6 addresses of all running hosts on the link-local quickly and effectively, which may result in accelerated worm spreading on the IPv6 link-locals. This worm applies a two-level scanning mechanism to find its targets in dual-stack networks, which is investigated by exploring its similarity to the self-replicating behaviors of biological viruses. Based on the ideas of classifying the population into different species or patches, we categorized all vulnerable hosts into two species and separated all dual-stack hosts into several patches to model the propagation of this worm by differential equations. Simulation is performed to validate the worm propagation model and to study the propagation of the worm in various dual-stack networks with different patch parameters. The simulation results show that the worm is able to spread much faster in IPv4-IPv6 dual-stack network than that in the pure IPv4 Internet. It is also noted that the dual-stack links may influence the propagation of the worm in the Internet

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


Connectivity evaluation and error performance of millimeter-wave wireless backhaul networks The general trend in the backhaul link technology arena is the increasing use of high-speed microwave solutions. The ever-rising demand for high capacities at low cost has recently enhanced the interest in wireless backhaul networks. Evaluating the connectivity of the wireless multi-hop backhaul networks is a significant task. Taking into account the high frequency of operation, a novel analytical and engineering propagation model is presented for the calculation of connectivity. Furthermore, the minimum required node density in order to keep the network connected is also calculated. The sensitivity of network connectivity on frequency operation, transmission power, and climatic conditions is also investigated. Finally, the error performance of the backhaul network links is finally presented, and some very useful conclusions are drawn.

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

wireless backhaul networks
error performance

isolation probability
minimum node density


Continuous attractors of a class of recurrent neural networks ? Recurrent neural networks (RNNs) may possess continuous attractors, a property that many brain theories have implicated in learning and memory. There is good evidence for continuous stimuli, such as orientation, moving direction, and the spatial location of objects could be encoded as continuous attractors in neural networks. The dynamical behaviors of continuous attractors are interesting properties of RNNs. This paper proposes studying the continuous attractors for a class of RNNs. In this network, the inhibition among neurons is realized through a kind of subtractive mechanism. It shows that if the synaptic connections are in Gaussian shape and other parameters are appropriately selected, the network can exactly realize continuous attractor dynamics. Conditions are derived to guarantee the validity of the selected parameters. Simulations are employed for illustration.

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

continuous attractors
recurrent neural networks

gaussian functions
convergence
stable equilibrium point