an improved selective-repeat arq scheme for irda links at high bit error rate In this paper, we propose an improved selective-repeat automatic repeat request (ARQ) scheme which operates with a finite receiver buffer. The throughput performance of the proposed ARQ scheme is examined and compared with the throughput of the IrDA adopted go-back- N ARQ scheme over half-duplex infrared links. Simulation results show that it significantly outperforms the existing go-back- N ARQ scheme, particularly for links with high bit error rate. We also explore that without adapting window size at high bit error rate, the proposed scheme provides a significant improvement in the throughput over a range of bit error rates including high bit error rate. The proposed ARQ scheme is a good compromise between the go-back- N ARQ and the ideal selective repeat ARQ in throughput performance and receiver buffer size. Therefore, it would be applied on IrDA links for achieving high throughput at high error rate.

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


Designing and Implementation of Industrial Process Control and Monitoring System Using Fuzzy PID and WSN The paper addresses the nonlinear control design problem for a two tank system. Three crucial industrial parameters i.e. temperature, level and flow are used in this work. Mathematical modeling of the proposed two tank system is presented in this work and the proposed system is also implemented using Lab View. Industrial parameters are controlled by Fuzzy PID controller which greatly improves the performance of the system. This system can be adopted by industries to improve their processes and it can also be used by academia for teaching purposes. This system provides real time simulation and hardware implementation which provide aid in learning for the graduate and undergraduate control students.

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

industrial process control system
industrial parameters control system


A review of current methods to generate synthetic spatial microdata using reweighting and future directions Synthetic spatial microdata enable analyses of artificial populations in the form of individual unit record files at a small area level. They allow analyses of estimates of variables that are otherwise not available at this small area level, while preserving the confidentiality of personal data. This type of data has mainly been used to provide more detailed census data and for spatial microsimulation modelling: for example to analyse social policy and population changes, transportation, marketing strategies or health outcomes. We argue that many potential applications for synthetic spatial microdata remain to be developed. One reason for this is the lack of information about and confidence in this type of data. Introductory literature about creating synthetic spatial microdata and discussions on the decisions that need to be taken during the data generation process are rare. In this paper, we therefore review currently existing methods to generate synthetic spatial microdata in a manner which will support most readers who are considering this approach, and we address the main issues of the data generation process with regards to analyses of neighbourhood level data. We discuss further possible applications of these data and the importance of synthetic spatial microdata.

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

synthetic microdata
small area estimation
neighbourhoods


Learning to locate informative features for visual identification Object identification is a specialized type of recognition in which the category (e. g. cars) is known and the goal is to recognize an object's exact identity (e. g. Bob's BMW). Two special challenges characterize object identification. First, inter-object variation is often small (many cars look alike) and may be dwarfed by illumination or pose changes. Second, there may be many different instances of the category but few or just one positive "training" examples per object instance. Because variation among object instances may be small, a solution must locate possibly subtle object-specific salient features, like a door handle, while avoiding distracting ones such as specular highlights. With just one training example per object instance, however, standard modeling and feature selection techniques cannot be used. We describe an on-line algorithm that takes one image from a known category and builds an efficient "same" versus "different" classification cascade by predicting the most discriminative features for that object instance. Our method not only estimates the saliency and scoring function for each candidate feature, but also models the dependency between features, building an ordered sequence of discriminative features specific to the given image. Learned stopping thresholds make the identifier very efficient. To make this possible, category-specific characteristics are learned automatically in an off-line training procedure from labeled image pairs of the category. Our method, using the same algorithm for both cars and faces, outperforms a wide variety of other methods.

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

object recognition
parametric models
interclass transfer
learning from new examples
one-shot learning


Teaching short-circuit withstand test on power transformers to M.Sc. students and junior engineers using MATLAB-SIMULINK This article describes an efficient method of teaching short-circuit withstand test on power transformer to power system graduate students and junior power engineers. The purpose of the presented method could be a part of a high-voltage course for M.Sc. students in electrical engineering departments and a train for junior engineers in industry. The article shows how to simulate the components of testing circuit and transformer to teach them the test. Evaluation of the simulations with 20 students and 20 junior engineers was very positive in terms of their developing confidence and understanding short-circuit withstand test on power transformers. 2010 Wiley Periodicals, Inc. Comput Appl Eng Educ 20: 484492, 2012

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

matlab-simulink
short-circuit withstand test


Exploration into Single Image Super-Resolution via Self Similarity by Sparse Representation A novel method for single image super resolution without any training samples is presented in the paper By sparse representation the method attempts to recover at each pixel its best possible resolution Increase based on the self similarity of the Image patches across different scale and rotation transforms The experiments indicate that the proposed method can produce robust and competitive results.

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


Reactive linearized equations of perturbed compressible variables for low-Mach number variable-density flows A hydrodynamic/acoustic splitting approach is proposed to study noise emitted from reactive variable-density flows. A simulation using the variable-density low-Mach number equations provides a solution of the hydrodynamic motions of the flow (base-flow), and a set of equations for perturbed variables is additionally solved to capture the acoustic motions. A rigorous derivation of these equations for the assumed base-flow is given, which compared to its non-reacting counterpart includes additional terms related to variable-density flows. Two different test cases are presented. First, the Kirchhoff vortex is simulated to highlight instability issues related to constant-density flows. Second, an academic test case for variable-density flows is proposed in the form of a reacting dipole, which is used to underline the stability of the proposed perturbed equations in such a scenario. Various intermediate forms of the derived perturbation equations are juxtaposed and analyzed with respect to their stability for these two test cases, and assumptions made in their derivation are numerically justified.

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

computational acoustics
variable-density
low-mach
hydrodynamic/acoustic splitting
combustion noise


Equitable service by a facility: Minimizing the Gini coefficient In this paper, we investigate the location of facilities with equity considerations, namely, minimizing the Gini coefficient of the Lorenz curve based on service distances. Properties of the Gini coefficient in the context of location analysis are investigated both for demand originating at points and demand generated in an area. An algorithm that finds the optimal location of one facility in a bounded area in the plane when demand is generated at a set of demand points, is constructed. Randomly generated problems with up to 10,000 demand points are successfully solved in a reasonable computer time.

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


pupillary responses to emotionally provocative stimuli This paper investigated in two experiments pupillary responses to emotionally provocative sound stimuli. In experiment one, 30 subjects' pupillary responses were measured while listening to 10 negatively and 10 positively arousing sounds, and 10 emotionally neutral sounds. In addition, the subjects rated their subjective experiences to these stimuli. The results showed that the pupil size was significantly larger after highly arousing positive and negative stimuli than after neutral stimuli with medium arousal. In experiment two, the contents of the stimuli were more controlled than in experiment one. 22 subjects' pupillary responses were measured while listening to four negatively and four positively arousing sounds, and four emotionally neutral sounds. The results showed that the pupil size was significantly larger during negative highly arousing stimuli than during moderately arousing positive stimuli. The pupil size was also significantly larger after highly arousing negative stimuli than after moderately arousing neutral and positive stimuli. The results of the two experiments suggest that pupil size discriminates during and after different kinds of emotional stimuli. Thus, the measurement of pupil size variation my be a potentially useful computer input signal, for example, for affective computing.

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


Continuous similarity-based queries on streaming time series In many applications, local or remote sensors send in streams of data, and the system needs to monitor the streams to discover relevant events/patterns and deliver instant reaction correspondingly. An important scenario is that the incoming stream is a continually appended time series, and the patterns are time series in a database. At each time when a new value arrives (called a time position), the system needs to find, from the database, the nearest or near neighbors of the incoming time series up to the time position. This paper attacks the problem by using Fast Fourier Transform (FFT) to efficiently find the cross correlations of time series, which yields, in a batch mode, the nearest and near neighbors of the incoming time series at many time positions. To take advantage of this batch processing in achieving fast response time, this paper uses prediction methods to predict future values. When the prediction length is long, FFT is used to compute the cross correlations of the predicted series (with the values that have already arrived) and the database patterns, and to obtain predicted distances between the incoming time series at many future time positions and the database patterns. If the prediction length is short, the direct computation method is used to obtain these predicted distances to avoid the overhead of using FFT. When the actual data value arrives, the prediction error together with the predicted distances is used to filter out patterns that are not possible to be the nearest or near neighbors, which provides fast responses. Experiments show that with reasonable prediction errors, the performance gain is significant. Especially, when the long term predictions are available, the proposed method can handle incoming data at a very fast streaming rate.

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

similarity search
data mining
data stream processing
time series analysis
nearest neighbor search
continuous query


Parallel evolutionary algorithms based on shared memory programming approaches In this work, two parallel techniques based on shared memory programming are presented. These models are specially suitable to be applied over evolutionary algorithms. To study their performance, the algorithm UEGO (Universal Evolutionary Global Optimizer) has been chosen.

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

evolutionary algorithm
computational experiment


Active site dynamics and combined quantum mechanics/molecular mechanics (QM/MM) modelling of a HIV-1 reverse transcriptase/DNA/dTTP complex We have investigated the structure and dynamics of the HIV-1 reverse transcriptase (HIV-RT) active site, by modelling the active conformation of the HIV-1 RT/DNA/deoxythymidine triphosphate (dTTP) ternary complex. This has included molecular dynamics simulations with the CHARMM27 force field, and combined quantum mechanics/molecular mechanics (QM/MM) calculations. Three different ternary systems were studied to investigate the effects of different protonation states of the dTTP substrate (a deprotonated and two different mono-protonated triphosphate forms of dTTP at the active site), and the effects of different possible protonation state of potentially catalytic aspartate residues (Asp185 and Asp186) were tested. Several potentially important hydrogen-bonding interactions with amino acids and bound water molecules in the deoxyribonucleoside triphosphate (dNTP) binding pocket were examined. The model of the deprotonated form of the dTTP substrate with the two aspartates in their charged (basic) form seemed to be the most stable and its orientation was in good agreement with X-ray crystallographic structure. In addition, two different semiempirical (AM1/CHARMM and PM3/CHARMM) QM/MM methods were tested for the HIV-RT system, in structural optimizations. Both methods provided conformations of the triphosphate moiety in either fully deprotonated or mono-protonated forms, which agreed well with the experimental structure of dTTP. The only significant difference between the AM1/CHARMM and PM3/CHARMM minimized structures is that the PM3/CHARMM P?O3? optimized distance (important for nucleotide addition) is longer by 0.66 in the deprotonated system but shorter by 0.37 in the mono-protonated triphosphate system as compared with those obtained from AM1/CHARMM minimized structure. The obtained results suggest that both of these QM/MM methods, and the stochastic boundary molecular dynamics approach applied in this work, can give reasonable results for modelling the catalytically active complex of this important enzyme. The results provide insight into the structure and interactions of the active site of this important enzyme, with implications for its mechanism, which may be useful in inhibitor design.

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

hiv-1 rt
aids
qm/mm
semiempirical method


Bicriteria p-Hub Location Problems and Evolutionary Algorithms In this paper, we present two bicriteria uncapacitated, multiple allocation p-hub location problems. In the first problem, our first objective is to minimize the total transportation costs of the uncapacitated multiple allocation p-hub median problem with a positive interhub transfer cost. Our second objective is to minimize the total traveling costs between hub points and origin-destination points. In this case, the interhub transfer cost is negligible, and the problem turns into a well-known facility location problem, i.e., the p-median problem. In the second problem, we address the delays occurring with the congestion during service at the hubs. We consider the trade-off between our first objective and a new objective function, which is to minimize the maximum delay at each hub. We propose bicriteria evolutionary algorithms to approximate the efficient frontiers of these problems. We test the performance of our algorithm on Turkish Postal System, Australian Post, and U. S. Civil Aeronautics Board data sets.

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

p-hub location
multiple criteria
heuristics


Polynomial time samplable distributions This paper studies the complexity of the polynomial-time samplable (P-samplable) distributions, which can be approximated within an exponentially small Factor by sampling algorithms in time polynomial in the length of their outputs. The paper shows that common assumptions in complexity theory yield the separation of polynomial-time samplable distributions from the polynomial-lime computable distributions with respect to polynomial domination, average-polynomial domination, polynomial equivalence, and average-polynomial equivalence. (C) 1999 Academic Press.

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

average-case complexity
sampling algorithm
domination condition
strong one-way functions


An efficient dynamic reliability-dependent bit allocation for biometric discretization A biometric discretization scheme converts biometric features into a binary string via segmenting every one-dimensional feature space into multiple labelled intervals, assigning each interval-captured feature element with a short binary string and concatenating the binary output of all feature elements into a bit string. This paper proposes a bit allocation algorithm for biometric discretization to allocate bits dynamically to every feature element based on a Binary Reflected Gray code. Unlike existing bit allocation schemes, our scheme bases upon a combination of bit statistics (reliability measure) and signal to noise ratio (discriminability measure) in performing feature selection and bit allocation procedures. Several empirical comparative studies are conducted extensively on two popular face datasets to justify the efficiency and feasibility of our proposed approach.

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


An efficient and accurate short-characteristics solver for radiative transfer problems In Turek (Computing 54, 27-38, 1995), the concept of the generalized mean intensity has been proposed as a special numerical approach to the (linear) radiative transfer equations which can result in a significant reduction of the dimension of the discretized system, without eliminating any information for the specific intensities. Moreover, in combination with Krylov-space methods (CG, Bi-CGSTAB, etc.), robust and very efficient solvers as extensions of the classical approximate Lambda-iteration have been developed. In this paper, the key tool is the combination of special renumbering techniques together with finite difference-like discretization strategies for the arising transport operators which are based on short-characteristic upwinding techniques of variable order and which can be applied to highly unstructured meshes with locally varying mesh widths. We demonstrate how such special upwinding schemes can be constructed of first order, and particularly of second order accuracy, always leading to lower triangular system matrices on general meshes. As a consequence, the global matrix assembling can be avoided ("on-the-fly") so that the storage cost is almost optimal, and the solution of the corresponding convection-reaction subproblems for each direction can be obtained very efficiently. As a further consequence, this approach results in a direct solver in the case of no scattering, while in the case of non-vanishing absorption and scattering coefficients the resulting convergence rates for the full systems depend only on their ratio and the absolute size of these physical quantities, but only weakly on the grid size or mesh topology. We demonstrate these results via prototypical configurations and we examine the resulting accuracy and efficiency for different computational domains, meshes and problem parameters.

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

mean intensity formulation
integro-differential equations
constant characteristics
upwind discretization
krylov-methods
lower triagonal matrices


Visual marking and change detection The preview benefit from prior exposure of response-irrelevant (distracter) objects in visual search has been accounted for in terms of top-down inhibition (i.e. visual marking), bottom-up abrupt onset capture, or asynchrony-dependent perceptual segregation. We assess the relative contribution of abrupt onset and visual marking in a paradigm combining visual search with a visual working memory task. We investigated time-based selection of multiple objects for storage in visual working memory, using a change detection paradigm (Luck and Vogel in Nature 390:279281, 1997) with distracter preview. We varied preview exposure (short vs. long), in a series of three experiments. The contribution of asynchrony-related perceptual segregation was assessed across experiments by varying the complexity of the stimuli (colored squares, oriented bars and oriented T-shapes) and the type of change detection (color or orientation), resulting in different levels of perceptual segregation between visual elements. The results suggest that bottom-up abrupt onset, visual marking and perceptual segregation factors co-operate in time-based selection for storage in visual working memory.

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

visual marking
visual working memory
change detection


using object deputy database to realize multi-representation geographic information system Multi-representation geographic information system (GIS) is used to store and manage geographic objects with different scales and semantics. It is difficult for relational and object-oriented databases to support multi-representation GIS. This paper proposed a new approach to realize multi-representation GIS using our object deputy database, where an object can have multiple deputy objects which inherit attributes and methods of the source object and can have their own attributes and methods. Multi-representations of a geographic object are defined by its deputy objects. So deputy objects can be used to represent viewpoint-multiplicity and role-multiplicity of geographic objects. Dynamic classification and automatic consistency maintenance of geographic objects can be supported through the update propagation mechanism of our object deputy database. In addition, the bilateral links between a geographic object and its deputy objects make cross-representation query easier. We have implemented a multi-representation GIS based on our object deputy database. Experiments show our method is more efficient than the traditional ones.

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


Completely generalized multivalued nonlinear co-quasi-variational-like inclusions In this paper, we introduce and study completely generalized multivalued nonlinear co-quasi-variational-like inclusions. By using J(eta)-proximal mapping [1], we propose an iterative algorithm for computing the approximate solutions of completely generalized multivalued nonlinear co-quasi-variational- like inclusions problem. We prove that approximate solutions obtained by the proposed algorithm converge to the exact solutions of completely generalized multivalued nonlinear co-quasi-variational-like inclusions problem. Some special cases are also discussed. (c) 2006 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 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 O O O O O O O O O O O O O O O O O O O O

variational-like inclusions
eta-subdifferentiable
j(eta)-proximal mapping
reflexive banach spaces


Decentralized mining social network communities with agents Network community mining algorithms aim at efficiently and effectively discovering all such communities from a given network. Many related methods have been proposed and applied to different areas including social network analysis, gene network analysis and web clustering engines. Most of the existing methods for mining communities are centralized. In this paper, we present a multi-agent based decentralized algorithm, in which a group of autonomous agents work together to mine a network through a proposed self-aggregation and self-organization mechanism. Thanks to its decentralized feature, our method is potentially suitable for dealing with distributed networks, whose global structures are hard to obtain due to their geographical distributions, decentralized controls or huge sizes. The effectiveness of our method has been tested against different benchmark networks. (C) 2013 Elsevier Ltd. All rights reserved.

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

social network
community mining
decentralized algorithm


fault-tolerant wormhole routing in tori We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only local knowledge of faults. Messages are routed via shortest paths when there are no faults, and this constraint is only slightly relaxed to facilitate routing in the presence of faults. The key concept we use is that, for each fault region, a fault ring consisting of fault free nodes and physical channels can be formed around it. These fault rings can be used to route messages around fault regions. We prove that at most four additional virtual channels are sufficient to make any fully-adaptive algorithm tolerant to multiple faulty blocks in torus networks. As an example of this technique, we present simulation results for a fully-adaptive algorithm and show that good performance can be obtained with as many as 10\% links faulty.

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

deadlocks
adaptive routing
multicomputer networks
fault-tolerant routing
message routing
performance evaluation


A Fast High-Level Event-Driven Thermal Estimator for Dynamic Thermal Aware Scheduling Thermal aware scheduling (TAS) is an important system level optimization for many-core systems. A fast event driven thermal estimation method, which includes both the dynamic and leakage power models, for monitoring temperature and guiding dynamic TAS (DTAS) is proposed in this paper. The fast event driven thermal estimation is based upon a thermal map, with occasional thermal sensor-based calibration, which is updated only when a high level event occurs. To minimize the overhead, while maintaining the estimation accuracy, prebuilt look-up-tables and predefined leakage calibration parameters are used to speed up the thermal solution. Experimental results show our method is accurate, producing thermal estimations of similar quality to an existing open-source thermal simulator, while having a considerably reduced computational complexity. Based on this predictive approach, we take full advantage of a projected future thermal map to develop several heuristic policies for DTAS. We show that our proposed predictive policies are significantly better, in terms of minimizing average/peak temperature, reducing the dynamic thermal management overhead and improving other real-time features, than existing DTAS schedulers, making them highly suitable for heuristically guiding thermal aware task allocation and scheduling.

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

dynamic thermal aware scheduling (dtas)
event-driven
multiprocessor
predictive policy


Study of Image Quality of Superimposed Projection Using Multiple Projectors In this correspondence, we discuss the quality of images realized by a recently proposed method of generating a high-resolution image by superimposing multiple low-resolution images projected by different projectors. We show several fundamental properties of this method: 1) the accuracy of the image realization (e.g., resolution of the realized image) is heavily affected by the structures of the images to be realized, and 2) there is a tradeoff between the image quality and the maximum brightness of the images to be realized. These are properties peculiar to multiprojector super-resolution and are in contrast with multicamera super-resolution. The results will be helpful in evaluating the usefulness of the method.

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

multiprojector system
projector-camera
super-resolution


a framework for agent-based distributed machine learning and data mining This paper proposes a framework for agent-based distributed machine learning and data mining based on (i) the exchange of meta-level descriptions of individual learning processes among agents and (ii) online reasoning about learning success and learning progress by learning agents. We present an abstract architecture that enables agents to exchange models of their local learning processes and introduces a number of different methods for integrating these processes. This allows us to apply existing agent interaction mechanisms to distributed machine learning tasks, thus leveraging the powerful coordination methods available in agent-based computing, and enables agents to engage in meta-reasoning about their own learning decisions. We apply this architecture to a real-world distributed clustering application to illustrate how the conceptual framework can be used in practical systems in which different learners may be using different datasets, hypotheses and learning algorithms. We report on experimental results obtained using this system, review related work on the subject, and discuss potential future extensions to the framework.

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

multiagent learning
frameworks and architectures
unsupervised clustering


High performance service discovery in large-scale multi-agent and mobile-agent systems With increasing requirements of distributed software systems, software agents are becoming a mainstream technology for software engineering and data management. Scalability and adaptability are two key challenges that must be addressed. In this work a new model is introduced for building large-scale distributed software systems with high dynamics, using a hierarchy of homogeneous agents that has the capability of service discovery. The performance of the agent system can be improved using different combinations of optimisation strategies. A modelling and simulation environment has been developed to aid the performance evaluation process. Two case studies are given and simulation results are included that show the impact of the agent mobility and the choice of performance optimisation strategies on the overall system performance.

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

service discovery
performance evaluation
modelling and simulation


Variational Optical Flow Estimation Based on Stick Tensor Voting Variational optical flow techniques allow the estimation of flow fields from spatio-temporal derivatives. They are based on minimizing a functional that contains a data term and a regularization term. Recently, numerous approaches have been presented for improving the accuracy of the estimated flow fields. Among them, tensor voting has been shown to be particularly effective in the preservation of flow discontinuities. This paper presents an adaptation of the data term by using anisotropic stick tensor voting in order to gain robustness against noise and outliers with significantly lower computational cost than (full) tensor voting. In addition, an anisotropic complementary smoothness term depending on directional information estimated through stick tensor voting is utilized in order to preserve discontinuity capabilities of the estimated flow fields. Finally, a weigthed non-local term that depends on both the estimated directional information and the occlusion state of pixels is integrated during the optimization and the occlusion state of pixels is integrated during the optimization process in order to denoise the final flow field. The proposed approach yields state-of-the-art results on the Middlebury benchmark.

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

stick tensor voting
variational optical flow


Reduction of large frequency response function data sets using a robust singular value decomposition In several mechanical engineering applications high spatial resolution frequency response function (FRF) measurements are required. Adapted optical measurement instruments like the laser scanning Doppler vibrometer (SLDV) exist to perform this task. The result of this high spatial resolution measurement is that a large amount of data is available. The processing of this data i.e. extracting modal parameters from the FRFs can be a time consuming task. On the other hand, when measuring on real-life structures, a portion of the FRFs is corrupted with high levels of noise (this is caused by laser drop outs which result in outliers in the measurements). In this article a data reduction method will be introduced which can be used to reduce the amount of data in order to limit the computation time. The method is based on a robust singular value decomposition (SVD). In contrast to existing SVD based techniques, outliers in the data can be handled efficiently. A validation of the technique is performed both on a simulation and on scanning laser vibrometer measurements of a car door and a circuit board.

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


Consequences of impaired data quality on information retrieval in electronic patient records To assess the quality of specific information in electronic patient records and the consequences of sub-optimal data quality on automated information retrieval. Patient records were evaluated with respect to accuracy of data relevant for retrieval according to a source-oriented, time-oriented and concept-oriented view of the record. Retrieval effectiveness was estimated using various methods based on record structure, text based retrieval and combinations of these. 98.1% of record documents were consistent regarding author, 99.8% regarding department of origin and 90.9% regarding document date. Document type was definitely not consistent in 8% of the documents. Estimated recall was 97% with 50% precision for document retrieval on the basis of date, and varying from 31 to 100% for retrieval based on document type. Retrieval based on manually supplied semantic tags performed better than simple string-based methods and improved when combined with string-matching mechanisms. Data attributes central for automated document retrieval in electronic patient records showed variable accuracy, with potentially negative consequences for basic record navigation. Text-based retrieval was inferior to methods based on data representing record structure. Quality of specific information elements suffered from lack of precise definitions and adequate mechanisms for quality assurance.

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

evaluation studies
medical records
computerized
information storage and retrieval
neurology


Adolescents' privacy concerns and information disclosure online: The role of parents and the Internet We examined factors affecting adolescents' online privacy perception and behavior. Restrictive parental mediation increased information disclosure among adolescents. SNS use and online gaming increased information disclosure among adolescents. Instructive parental mediation decreased information disclosure among adolescents. Self-disclosure to parents increased adolescents' concerns about online privacy.

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

adolescents
online privacy
parental mediation


Filter ranking in high-dimensional space High-dimensional index structures are a means to accelerate database query processing in high-dimensional data, like multimedia feature vectors. A particular interest in many application scenarios is to rank data items with respect to a certain distance function and, thus, identifying the nearest neighbor(s) of a query item. In this paper, we propose a novel ranking algorithm that (1) operates on arbitrary high-dimensional filter indexes, like the VA-file, the VA+-file, the LPC-file, or the AV-method. Our ranking algorithm (2) exhibits a nearly balanced I/O load to retrieve subsequent items. Finally, it (3) strictly obeys a predefined main memory threshold and even (4) terminates successfully when memory restrictions are very tight.

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

high-dimensional indexing
approximation index
nearest neighbor search
storage and access


High-speed inter-view frame mode decision procedure for multi-view video coding With the amazing development of visual identification systems, multi-view video which is one of the main types of three-dimensional (3D) video signals, captured by a set of video cameras from various viewpoints, has attracted much interest recently. The multi-view video coding (MVC) uses the joint multi-view video model (JMVM) established on H.264/AVC as the core codec to achieve excellent coding efficiency. However, the concomitant problem is the huge encoding complexity especially due to the heavy Rate-to-Distortion Cost (RDCost) computational load of the mode decision (MD) process, which limits the applications of MVC for mobile terminals and embedded systems. In this paper, a high-speed MD (HSMD) algorithm is proposed for the inter-view frames of multi-view video signal. The redundant candidate modes of each macroblock (MB) in the inter-view frames are eliminated to reduce the original RDCost computational load by utilizing multiple efficiency parameters. The quantitative analysis verifies our proposal in theory and the simulation results show that the proposed HSMD algorithm can reduce the encoding time by over 90% for the inter-view video frames with negligible quality loss compared with the original JMVM codec. The proposed algorithm can be widely employed for real-time multi-view signal encoding especially under the mobile and embedded environments to realize the real-time encoding process.

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

inter-view
hbp
mb energy
mode similarity


An Approach to Constructing Three-Dimensional Tissue The authors propose an approach to constructing three-dimensional tissue with capillaries using cellulose hollow fibers. Fibronectin (FN) was immobilized on hollow fibers to assure cell attachment. Bovine coronary artery smooth muscle cells (BCASMC) and L cells were seeded on FN-immobilized fibers and cultured for an extended period of time. The cells proliferated and formed multicellular layers on the fibers. The hollow fibers were removed by enzymatic digestion using cellulase. The cellulase treatment did not damage L cells, although some cells fell off from the fibers. On the other hand, no deterioration was observed in the BCASMC aggregate structure. The BCASMC aggregates maintained several lumens after removal of the hollow fibers by cellulase digestion. The authors believe that their approach offers a useful method to tissue engineering in preparation of three-dimensional tissue structure.

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

cellulose hollow fiber
fn immobilization
three-dimensional capillary structure


TCP performance over wireless MIMO channels with ARQ and packet combining Multiple-input multiple-output (MIMO) wireless communication systems that employ multiple transmit and receive antennas can provide very high-rate data transmissions without increase in bandwidth or transmit power. For this reason, MIMO technologies are considered as a key ingredient in the next generation wireless systems, where provision of reliable data services for TCP/IP applications such as wireless multimedia or Internet is of extreme importance. However, while the performance of TCP has been extensively studied over different wireless links, little attention has been paid to the impact of MIMO systems on TCP. This paper provides an investigation on the performance of modern TCP systems when used over wireless channels that employ MIMO technologies. In particular, we focus on two representative categories of MIMO systems, namely, the BLAST systems and the space-time block coding ( STBC) systems, and how the ARQ and packet combining techniques impact on the overall TCP performance. We show that, from the TCP throughput standpoint, a more reliable channel may be preferred over a higher spectral efficient but less reliable channel, especially under low SNR conditions. We also study the effect of antenna correlation on the TCP throughput under various conditions.

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

mimo
blast
arq
packet combining
antenna correlation


A comparison of feature selection models utilizing binary particle swarm optimization and genetic algorithm in determining coronary artery disease using support vector machine The aim of this study is to search the efficiency of binary particle swarm optimization (BPSO) and genetic algorithm (GA) techniques as feature selection models on determination of coronary artery disease (CAD) existence based upon exercise stress testing (EST) data. Also, increasing the classification performance of the classifier is another aim. The dataset having 23 features was obtained from patients who had performed EST and coronary angiography. Support vector machine (SVM) with k-fold cross-validation method is used as the classifier system of CAD existence in both BPSO and GA feature selection techniques. Classification results of feature selection technique using BPSO and GA are compared with each other and also with the results of the whole features using simple SVM model. The results show that feature selection technique using BPSO is more successful than feature selection technique using GA on determining CAD. Also with the new dataset composed by feature selection technique using BPSO, this study reached more accurate values of success on CAD existence research with more little complexity of classifier system and more little classification time compared with whole features used SVM.

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

binary particle swarm optimization
genetic algorithm
support vector machine
exercise stress testing
coronary artery disease


A new strongly competitive group testing algorithm with small sequentiality In many fault detection problems, we want to identify all defective items from a sample set of items using the minimum number of tests. Group testing is for the scenario where each test is performed on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number of defective items in the sample set is usually unknown. In this paper, we investigate new algorithms for the group testing problem with unknown number of defective items. We consider the scenario where the performance of a group testing algorithm is measured by two criteria: the primary criterion is the number of tests performed, which measures the total cost spent; and the secondary criterion is the number of stages the algorithm works in, which is referred to as the sequentiality of the algorithm in this paper and measures the minimum amount of time required by using the algorithm to identify all the defective items. We present a new algorithm Recursive Binary Splitting (RBS) for the above group testing problem with unknown number of defective items, and prove an upper bound on the number of tests required by RBS. The computational results show that RBS exhibits very good practical performance, measured in terms of both the above two criteria.

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

fault detection
group testing
algorithms
sequentiality


Observer network and forest fire detection Future Generation Communication Environment (FGCA) is defined as advanced communication and networking environment where all applications and services are focused on users. In this paper an example of such an application is described where the "user" is the natural environment and the goal is the environment protection. An idea of observer network is introduced and described as an advanced communication, networking and processing framework for fusion and interpretation of information collected over sensor network having the main goal enhanced environment protection. The framework is inspired by formal theory of perception aimed for environmental intelligence implementation. Environmental intelligence is interpreted as a self-protecting feature of environment gained by integration of sensing devices into environment and appropriate fusion and interpretation of sensing data. Our particular case study was forest fire monitoring observer network. It was implemented as a multi agent system. The paper describes multi agent architecture and the principles of the agent ontology. The multi agent architecture gives the observer network additional flexibility and modularity. Although our case study was forest fire monitoring the same architecture could be used in detection of any kind of phenomenon required in environmental intelligence. (C) 2009 Elsevier B.V. All rights reserved.

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

sensor network
observer network
forest fire detection


On the Efficiency of Peer-to-Peer File Sharing In Peer-to-Peer (P2P) file sharing networks, the average download time is determined by how efficiently the upload bandwidth of each peer can be utilized. In this paper, we will first propose a stochastic model for P2P file sharing networks. By numerically solving the proposed model, we will be able to gain interesting insight on how the performance of a P2P file sharing network is affected by different parameters such as the piece numbers of the file, the number of neighbors of a peer, and the seed departure rate etc. We will also validate the stochastic model through simulations and provide some useful guidelines on how to design an efficient P2P system based on our results.

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


Protection of Proteins from Oxidative Stress: A New Illusion or a Novel Strategy? Proteins damaged by oxidative stress have the most dangerous consequences. Oxidized protein derivatives inveigle lipids and carbohydrates into metabolic transformations that result in loss of protein functions and accumulation of glycated proteins and advanced glycated end products, which are difficult to remove from living tissues. Hydrophobic antioxidants are not very effective in protecting proteins from oxidative modification. At the same time, the natural hydrophilic antioxidant and anti-glycating agent carnosine efficiently prevents oxidative modification of proteins and increases the life span of experimental animals under unfavorable conditions. It can be considered a potent natural geroprotector.

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


Compressive Imaging of Subwavelength Structures The problem of imaging extended targets (sources or scatterers) is formulated in the framework of compressed sensing with emphasis on subwavelength resolution. The proposed formulation of the problems of inverse source/scattering is essentially exact and leads to the random partial Fourier measurement matrix in the case of periodic targets. In the case of square-integrable targets, the proposed sampling scheme in the Littlewood-Paley wavelet basis block-diagonalizes the scattering matrix with each block in the form of a random partial Fourier matrix corresponding to each dyadic scale of the target. The resolution issue is analyzed from two perspectives: stability and the signal-to-noise ratio (SNR). The subwavelength modes are shown to be typically unstable unless the measurement is carried out in near field. The number of the stable modes typically increases as the negative dth (the dimension of the target) power of the distance between the target and the sensors/source (in the unit of wavelength). The resolution limit is shown to be inversely proportional to the SNR in the high SNR limit. Numerical simulations are provided to validate the theoretical predictions.

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


Derived components regression using the BACON algorithm Partial least squares and principal components regression are commonly used regularized regression methods which use derived components instead of original predictors. The components are derived from the estimated variancecovariance matrix and regression is run using the least squares. Therefore, they are not robust and a few outliers may have drastic effects on the obtained results. These regression methods are robustified by using the BACON algorithm which provides robust measures for both dispersion and regression. The proposed methods are illustrated by examples and their properties are investigated using both real data and simulation experiments.

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

principal components
partial least squares
bacon algorithm
outliers


Resource efficiency of the GigaNetIC chip multiprocessor architecture In this article, we present the prototypical implementation of the scalable GigaNetIC chip multiprocessor architecture. We use an FPGA-based rapid prototyping system to verify the functionality of our architecture in a network application scenario before fabricating the ASIC in a modern CMOS standard cell technology. The rapid prototyping environment gives us the opportunity to test our multiprocessor architecture with Ethernet-based data streams in a real network scenario. Our system concept is based on a massively parallel processor structure. Due to its regularity, our architecture can be easily scaled to accommodate a wide range of packet processing applications with various performance and throughput requirements at high reliability. Furthermore, the composition based on predefined building blocks guarantees fast design cycles and simplifies system verification. We present standard cell synthesis results as well as a performance analysis for a firewall application with various couplings of hardware accelerators. Finally, we compare implementations of our architecture with state-of-the-art desktop CPUs. We use simple, general-purpose applications as well as the introduced packet processing tasks to determine the performance capabilities and the resource efficiency of the GigaNetIC architecture. We show that, if supported by the application, parallelism offers more opportunities than increasing clock frequencies.

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

chip multiprocessor
rapid prototyping
asic
giganetic

network on chip
system on chip
fpga
giganoc


A New Self-Healing Methodology for RF Amplifier Circuits Based on Oscillation Principles This paper proposes a new self-healing methodology for embedded RF amplifiers in RF sub-systems. The proposed methodology is based on oscillation principles in which the device-under-test (DUT) generates its test signature with the help of additional circuitry. In the proposed methodology, the self-generated test signature from the RF amplifier is analyzed by using on-chip resources for testing and controlling its calibration knobs to compensate for multi-parameter variations in the manufacturing process. Thus, the proposed methodology enables self-test and self-calibration/correction of RF amplifiers without the need for an external test stimulus, enabling true self-healing RF designs. The proposed methodology is demonstrated through simulations as well as measurements performed on an RF LNA, which were designed in a commercially-available SiGe BiCMOS process technology.

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

agilent's advance design system (ads)
cadence
low noise amplifier (lna)
matlab
oscillation-based test
oscillations
self-calibration
self-healing
self-testing
yield


Performance Analysis of Multi-hop Wireless Networks under Different Hopping Strategies with Spatial Diversity This paper derives two main end-to-end performance metrics, namely the spatial capacity density and the average end-to-end delay of the multi-hop wireless ad hoc networks with multi-antenna communications. Based on the closed-form expressions of these performance metrics, three hopping strategies, i.e., the closest neighbor, the furthest neighbor and the randomly selected neighbor hopping strategies have been investigated. This formulation provides insights into the relations among node density, diversity gains, number of hops and some other network design parameters which jointly determine network performances, and a method of choosing the best hopping strategy which can be formulated from a network design perspective.

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

performance metrics
network design
hopping strategy

stochastic geometry
statistical mechanics
multi-antenna


Three-fast-searchable graphs In the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G G is cleared in exactly |E(G)| | E ( G ) | moves. Such a restriction obviously necessitates a larger number of searchers. We examine this model, and characterize graphs for which 2 or 3 searchers are sufficient. We prove that the corresponding decision problem is NP-complete.

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

computational complexity
graph searching


A new algorithm for one-warehouse multi-retailer systems under stationary nested policy This study aims at optimally coordinating inventory among all the partners in a supply chain system with a central warehouse and multiple local retailers so as to minimize the average total costs. After reviewing the literature, we found that no study proposes an efficient solution approach that guarantees to solve the optimal solution for the one-warehouse multi-retailer (OWMR) lot-sizing problem. The solution approaches in the literature share a common problem, namely, they do not have insights into the characteristics of the optimal-cost curve. Therefore, this study first focuses on performing a full theoretical analysis on the characteristics of the optimal-cost curve. Then, by utilizing our theoretical results, we derive an effective search algorithm that is able to solve the optimal solution for the OWMR lot-sizing problem under stationary nested policy. Based on our random experiments, we demonstrate that our search algorithm out-performs the other heuristics.

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

stationary nested policy
characteristics
search algorithm


WBAN data scheduling and aggregation under WBAN/WLAN healthcare network Nowadays, wireless body area networks (WBANs) become an emerging technology which has grown considerably. An increase in the deployment of devices on patients promotes researchers and application developers to focus on issues related to WBAN networks. Therefore, several studies have been done in this field by researchers. The IEEE 802.15.6 standard was proposed to satisfy all the requirements for WBANs communication. As sensed data in such type of networks, it should be transmitted in a reliable and QoS based way. A public-BAN is defined as a network of several personal-BANs. The centralized public-BAN consists of a static coordinator and several personal-BANs. The static coordinator is able to command a portable coordinator in order to control a personal-BAN and runs as an Internet Gateway. In this paper, we considered bridging communications between the IEEE 802.15.6-based WBANs and the IEEE 802.11e-based centralized public-BAN (WLAN). Especially, we proposed two new scheduling algorithms to satisfy QoS requirements in WBAN networks and to overcome the starvation mode of the packets without the highest priority. In order to perform this aim, we introduced the critical delay (CD) as a parameter to serve packets taking into account their priorities and classify them into an aggregated frame. The performance of our proposed schedulers is compared with Priority Queue scheduler (PQ) and Priority Queue Aggregation scheduler (PQA). Conducted simulations illustrate that our proposed schedulers performance overcomes the other schedulers in term of latency, throughput and dropped packets for emergency, general monitoring and controlled load traffics.

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


Evidence-Based Trust: A Mathematical Model Geared for Multiagent Systems An evidence-based account of trust is essential for an appropriate treatment of application-level interactions among autonomous and adaptive parties. Key examples include social networks and service-oriented computing. Existing approaches either ignore evidence or only partially address the twin challenges of mapping evidence to trustworthiness and combining trust reports from imperfectly trusted sources. This article develops a mathematically well-formulated approach that naturally supports discounting and combining evidence-based trust reports. This article understands an agent Alice's trust in an agent Bob in terms of Alice's certainty in her belief that Bob is trustworthy. Unlike previous approaches, this article formulates certainty in terms of evidence based on a statistical measure defined over a probability distribution of the probability of positive outcomes. This definition supports important mathematical properties ensuring correct results despite conflicting evidence: (1) for a fixed amount of evidence, certainty increases as conflict in the evidence decreases and (2) for a fixed level of conflict, certainty increases as the amount of evidence increases. Moreover, despite a subtle definition of certainty, this work (3) establishes a bijection between evidence and trust spaces, enabling robust combination of trust reports and (4) provides an efficient algorithm for computing this bijection.

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

theory
algorithms
application-level trust
evidence-based trust


evolutional analysis of licenses in foss FOSS (Free and Open Source Software) is repeatedly modified and reused by other FOSS or proprietary software systems. They are released to others under specific licenses whose terms and conditions are usually written on the source-code files as program comments. There are a few researches which automatically analyze the licenses in a FOSS release, but there is no statistical study on the evolution of licenses along the evolution of FOSS. In this paper, we analyze licenses through FreeBSD, OpenBSD, Eclipse, and ArgoUML evolution, using our license analysis tool Ninka, and discuss characteristics on the evolution of the license used in those systems.

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


Adaptive Sink Mobility in Event-Driven Densely Deployed Wireless Sensor Networks Optimizing energy consumption in wireless sensor networks is of, paramount importance. There is a recent trend to deal with this problem by introducing mobile elements (sensors or sink nodes) in the network. The majority of these approaches assume time-driven scenarios and/or single-hop communication between participating nodes. However, there lire several real-life applications for which an event-based and multi-hop operation is more appropriate. In this paper we propose to adaptively move the sink node inside the covered region, according to the evolution of current events, so its to minimize the energy consumption incurred by the multi-hop transmission of the event-related data. Both analytical and simulation results are given For two optimization strategies: minimizing the overall energy consumption, and minimizing the maximum load on a specific sensor respectively. We show that by adaptively moving the sink, significant power saving can be achieved, prolonging the lifetime of the network.

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

energy efficiency
controlled mobility
multi-hop communications


Yet shorter warmup by combining no-state-loss and MRRL for sampled LRU cache simulation Sampling is a well known technique for speeding up time-consuming architectural simulations. An important issue with sampling is the hardware state at the beginning of each sampling unit. This paper presents a highly accurate and highly efficient warmup method for sampled cache simulation by combining no-state-loss (NSL) and memory reference reuse latency (MRRL). Our combined warmup scheme MRRLNSL achieves the same accuracy for sampled LRU cache simulation as MRRL with a two orders of magnitude shorter warmup. Compared to NSL, MRRLNSL has a factor 26 shorter warmup while inducing a small absolute miss rate error of 0.1%.

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

computer architecture
sampled simulation
cold-start problem


Parallel fast inter mode decision for H.264/AVC encoding One hardware friendly parallel fast inter mode decision algorithm is proposed for H.264/AVC encoding. Motion estimation for different block sizes are conducted in parallel. Simplified distortion and bitrate estimation methods are used for efficient hardware implementation. Dependencies among coding units are removed for parallel processing. The coding cost of each mode can be obtained simultaneously.

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

fast mode decision
h.264/avc
video codec design
parallel encoding


a collective discrimination of moments and segments as an exploitation of the watch-and-comment concept Digital TV provides greater interaction between content/service and the viewer. Besides interacting with resident applications, the possibility of access services external to the set-top box expands the range for interactive applications. This paper explores the Watch-and-Comment (WaC) paradigm and proposes its specialization for the collective discrimination of moments and segments of continuous media, for use in applications such as: selection, voting, exclusion, classification, evaluation, among others. As a proof of concept, we developed a prototype of software that extends the middleware Ginga to support the collective discrimination of moments and segments of continuous media in digital TV. The prototype supports multiple devices and uses the Universal Plug and Play (UPnP) protocol to discover services.

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

lan
interactive multimedia
interactive video


Formal-language-constrained path problems Given an alphabet Sigma, a (directed) graph G whose edges are weighted and Sigma-labeled, and a formal language L subset of or equal to Sigma*, the formal-language-constrained shortest/simple path problem consists of finding a shortest (simple) path p in G complying with the additional constraint that l(p) is an element of L. Here l(p) denotes the unique word obtained by concatenating the Sigma-labels of the edges along the path p. The main contributions of this paper include the following: (1) We show that the formal-language-constrained shortest path problem is solvable efficiently in polynomial time when L is restricted to be a context-free language (CFL). When L is specified as a regular language we provide algorithms with improved space and time bounds. (2) In contrast, we show that the problem of finding a simple path between a source and a given destination is NP-hard, even when L is restricted to fixed simple regular languages and to very simple classes of graphs (e.g., complete grids). (3) For the class of treewidth-bounded graphs, we show that (i) the problem of finding a regular-language-constrained simple path between source and destination is solvable in polynomial time and (ii) the extension to finding CFL-constrained simple paths is NP-complete. Our results extend the previous results in [SIAM J. Comput., 24 (1995), pp. 1235-1258; Proceedings of the 76th Annual Meeting of the Transportation Research Board, 1997; and Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems, 1990, pp. 230-242]. Several additional extensions and applications of our results in the context of transportation problems are presented. For instance, as a corollary of our results, we obtain a polynomial-time algorithm for the best k-similar path problem studied in [Proceedings of the 76th Annual Meeting of the Transportation Research Board, 1997]. The previous best algorithm was given by [Proceedings of the 76th Annual Meeting of the Transportation Research Board, 1997] and takes exponential time in the worst case.

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

formal languages
computational complexity
transportation planning
world wide web
shortest paths
query processing
multicriteria problems


A production inventory model with fuzzy production and demand using fuzzy differential equation: An interval compared genetic algorithm approach In this paper, a production inventory model, specially for a newly launched product, is developed incorporating fuzzy production rate in an imperfect production process. Produced defective units are repaired and are sold as fresh units. It is assumed that demand coefficients and lifetime of the product are also fuzzy in nature. To boost the demand, manufacturer offers a fixed price discount period at the beginning of each cycle. Demand also depends on unit selling price. As production rate and demand are fuzzy, the model is formulated using fuzzy differential equation and the corresponding inventory costs and components are calculated using fuzzy Riemann-integration. ?-cut ? - cut of total profit from the planning horizon is obtained. A modified Genetic Algorithm (GA) with varying population size is used to optimize the profit function. Fuzzy preference ordering (FPO) on intervals is used to compare the intervals in determining fitness of a solution. This algorithm is named as Interval Compared Genetic Algorithm (ICGA). The present model is also solved using real coded GA (RCGA) and Multi-objective GA (MOGA). Another approach of interval comparisonorder relations of intervals (ORI) for maximization problems is also used with all the above heuristics to solve the model and results are compared with those are obtained using FPO on intervals. Numerical examples are used to illustrate the model as well as to compare the efficiency of different approaches for solving the model.

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

fuzzy production
fuzzy differential equation
fuzzy preference ordering
interval compared genetic algorithm


Shape-based image retrieval using support vector machines, Fourier descriptors and self-organizing maps Image retrieval based on image content has become an important topic in the fields of image processing and computer vision. In this paper, we present a new method of shape-based image retrieval using support vector machines (SVM), Fourier descriptors and self-organizing maps. A list of predicted classes for an input shape is obtained using the SVM, ranked according to their estimated likelihood. The best match of the image to the top-ranked class is then chosen by the minimum mean square error. The nearest neighbors can be retrieved from the self-organizing map of the class. We employ three databases of 99, 216, and 1045 shapes for our experiment, and obtain prediction accuracy of 90%, 96.7%, and 84.2%, respectively. Our method outperforms some existing shape-based methods in terms of speed and accuracy.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 recognition
support vector machine
self-organizing map
fourier descriptor


Collecting information on the quality of prescribing in primary care using semi-automatic data extraction from GPs' electronic medical records Objectives: To evaluate a semi-automatic data extraction from the electronic medical record (EMR) of general practitioners (GPs) through a comparison with a paper sheets data collection simultaneously used in a primary care research project on the quality of prescribing for osteoarthritis in the elderly. Subjects: One hundred and fifty-two GPs using five different EMR-software systems participated with the semi-automatic data extraction from the EMR and 233 GPs collected data with paper registration sheets. Methods: The proportion of patients with respectively a drug prescription, paracetamol, a non-steroidal anti-inflammatory drug (NSAID) and ibuprofen were compared between the semi-automatic extraction and the paper data collection and among the EMR-software systems. Results: Using the semi-automatic data extraction, a significantly lower proportion of patients on drugs was obtained compared to the paper data collection (adjusted OR: 0.31; 95% CI 0.25-0.39). However, the proportion of patients on a specific type of drug was comparable. Within the results from the semi-automatic extraction, the results were heterogeneous among the different EMR-software systems. Conclusions: The semi-automatic data extraction with multiple EMR-software systems proposed in this study seems suitable for quality of prescribing assessment in primary care. However, it may be less reliable when only a single EMR-software is used. (c) 2005 Elsevier Ireland 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O B I O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information systems
primary health care
medical records systems
computerized
quality assurance
health care
prescriptions


General Solutions of Equations in Multiple-Valued Logic Reproductive general solutions of equations in one variable on multiple-valued logic were described in [1] All the general solutions of equations over finite sets were determined in [2] Using ideas from [1] and [2], we describe all the general solutions of equations in one variable on multiple-valued logic

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

multiple-valued logic
equation
general solution


Automatic event-triggered call-forwarding mechanism for mobile phones Call forwarding is a traditional telecom service that allows a user to forward incoming calls to another telephone number. call-forwarding algorithm (CFA) for mobile phones. By installing a software in a smartphone, call forwarding is automatically triggered (e.g., when the phone is plugged in a charger or is turned off) or disabled (e.g., when the phone is unplugged from the charger or is turned on). We investigate the performance of the CFA through analytic analysis, simulation, and measurement. Our study indicates that CFA is very feasible for commercial usage. Copyright (c) 2011 John Wiley & Sons, Ltd.

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


A convex optimization approach for clone detection in wireless sensor networks When deployed unattended in hostile environments, static and mobile Wireless Sensor Networks (WSNs) are vulnerable to node capture and cloning attacks, where an adversary physically compromises network nodes and extracts all information known to them, including the assigned cryptographic material and the internal states of network protocols. The obtained knowledge is used to disrupt the network by deploying and controlling copies of captured nodes (clones). Recently, a variety of novel clone detection methods have been developed, using concepts such as birthday paradox, sequential detection or random encounters in mobile environments. At present there is no framework to evaluate an individual detection method based on the WSN performance under attack or to compare and choose a method appropriate for a given application. In this paper, we develop an optimization framework for choosing the parameters of a detection method so that the cost of clone detection is minimized. We show that every detection method can be characterized in terms of four costs, namely, the impact of leaving undetected cloned nodes in the network, the cost of revoking nodes falsely identified as compromised, and the costs of communication and storage. A convex combination of these costs defines the cost of clone detection, which is then minimized with respect to the parameters of the detection method. Using this framework, we analyze existing clone detection algorithms and provide efficient methods for obtaining optimal detection parameters. (C) 2012 Elsevier B. V. All rights reserved.

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


Wildlife video key-frame extraction based on novelty detection in semantic context There is a growing evidence that visual saliency can be better modeled using top-down mechanisms that incorporate object semantics. This suggests a new direction for image and video analysis, where semantics extraction can be effectively utilized to improve video summarization, indexing and retrieval. This paper presents a framework that models semantic contexts for key-frame extraction. Semantic context of video frames is extracted and its sequential changes are monitored so that significant novelties are located using a one-class classifier. Working with wildlife video frames, the framework undergoes image segmentation, feature extraction and matching of image blocks, and then a co-occurrence matrix of semantic labels is constructed to represent the semantic context within the scene. Experiments show that our approach using high-level semantic modeling achieves better key-frame extraction as compared with its counterparts using low-level features.

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

high-level features
key-frame extraction
co-occurrence matrix


Gaussian processes based bivariate control parameters optimization of variable-rate granular fertilizer applicator Taking into account the scarcity of feasible fertilizing rate feedback from on-board sensors and the limited computation power of controller mounted on the variable-rate granular fertilizer applicator, optimum control index chart is a good option for controller design to achieve accurate variable-rate fertilizing control. The index chart contains a list of optimum control parameters optimized to meet combined objectives: fertilizing accuracy, energy saving and fertilizing consistency. To generate such list, the probabilistic meta-model based on Gaussian Processes (GP) is firstly utilized to identify the variable-rate fertilizing process with the indoor experimental data. Consequently, the meta-model-based optimization process is presented with the given fertilizing rate, previous opening length and its adjusting direction. The optimal control parameters chart is obtained by the iterative multi-objectives optimization based on Genetic Algorithm (GA). Thus, the fertilizing prescription can be converted to the controllers actions by searching the optimum control parameters chart. The well-trained GP models predict the fertilizing rate and the fertilizing coefficient of variation with limiting mean relative error to 0.014 and 0.089, respectively. Finally, by considering four main error sources, the verified fertilizing model improves the average fertilizing rate error to no more than 5% at given management zone scale in field test.

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

variable rate technology (vrt)
precision agriculture
gaussian processes (gp)
genetic algorithm (ga)


a family of growth models for representing the price process in online auctions Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functional object. Various nonparametric smoothing methods exist to recover the functional object from the observed discrete bid data. Previous studies use penalized polynomial and monotone smoothing splines; however, these require the determination and storage of a large number of coefficients and often lengthy computational time. We present a family of parametric growth curves that describe the price-evolution during online auctions. This approach is parsimonious and has an appealing interpretation in the online auction context. We also provide an automated fitting algorithm that is computationally fast. Methods are illustrated using eBay data.

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

price dynamics
functional data analysis (fda)


Curvature of n-dimensional space curves in grey-value images Local curvature represents an important shape parameter of space curves which are well described by differential geometry. We have developed an estimator for local curvature of space curves embedded in n-dimensional (n-D) grey-value images. There is neither a segmentation of the curve needed nor a parametric model assumed. Our estimator works on the orientation field of the space curve. This orientation field and a description of local structure is obtained by the gradient structure tensor. The orientation field has discontinuities; walking around a closed contour yields two such discontinuities in orientation. This field is mapped via the Knutsson mapping to a continuous representation; from a n-D vector to a symmetric n(2)-D tensor field. The curvature of a space curve, a coordinate invariant property, is computed in this tensor field representation. An extensive evaluation shows that our curvature estimation is unbiased even in the presence of noise, independent of the scale of the object and furthermore the relative error stays small.

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

curvature
gradient structure tensor
knutsson mapping


Leishmania DNA Quantification by Real-time PCR in Naturally Infected Dogs Treated with Miltefosine A new drug that has just become available in India for treatment of human visceral leishmaniasis (VL) is miltefosine, an alkyphospholipid that was originally developed as an oral antineoplastic agent. Miltefosine is not only directly toxic for Leishmania parasite, but it also enhances both T cell and macrophage activation and production of microbicidal reactive nitrogen and oxygen intermediates. It is highly effective in the treatment of Leishmania infection in mice and human beings. However, adverse effects in dogs treated with miltefosine have been reported, but there are no data on the efficacy of this drug for the treatment of canine visceral leishmaniasis (CVL). The aim of this study was to use a real-time PCR assay to monitor the Leishmania load in the blood samples and lymph node aspirates of 18 naturally infected dogs before and after treatment with miltefosine (2 mg/kg for 30 days). The results of our study showed that the therapy with miltefosine shows a drastic and progressive reduction of parasite load in lymph node aspirates, but does not suppress the parasite in lymph nodes. In all dogs the real-time PCR assay demonstrated an irregular presence of parasites in blood. Therefore, blood does not seem a suitable substrate for the purpose of quantifying Leishmania DNA.

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


Minimax robust nonstationary signal estimation based on a p-point uncertainty model ? We propose a time-varying Wiener filter for nonstationary signal estimation that is robust in a minimax sense. This robust Wiener filter optimizes worst-case performance within novel p-point uncertainty classes of nonstationary random processes. Furthermore, it features constant performance within these uncertainty classes and requires less detailed prior knowledge than the ordinary time-varying Wiener filter. We also propose a timefrequency formulation that is intuitively appealing since signal subspaces are replaced by timefrequency regions, and an efficient on-line implementation using local cosine bases. Our theory is illustrated by numerical simulations and a real-data example.

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

robust signal estimation
wiener filters
timefrequency signal processing
denoising
signal enhancement


Fitting censored quantile regression by variable neighborhood search Quantile regression is an increasingly important topic in statistical analysis. However, fitting censored quantile regression is hard to solve numerically because the objective function to be minimized is not convex nor concave in regressors. Performance of standard methods is not satisfactory, particularly if a high degree of censoring is present. The usual approach is to simplify (linearize) estimator function, and to show theoretically that such approximation converges to optimal values. In this paper, we suggest a new approach, to solve optimization problem (nonlinear, nonconvex, and nondifferentiable) directly. Our method is based on variable neighborhood search approach, a recent successful technique for solving global optimization problems. The presented results indicate that our method can improve quality of censored quantizing regressors estimator considerably.

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

quantile regression
global optimization
variable neighborhood search

censored regression
powell estimator
metaheuristics