Instantaneous stiffness analysis and simulation for hexapod machines This paper introduces a derivation and simulation technique of instantaneous stiffness for 66 Stewart platforms (hexapods) with the interest in increasing machining accuracy of the new type hexapod machines. It clearly expresses that high non-linearity of motions and driving forces of the parallel mechanisms results in the asymmetric stiffness matrix, and the change in geometry and the loading are the significant factors to the asymmetry. Also, based on the theoretical calculation the simulations for the hexapod machining cycles numerically and illustratively present the instantaneous stiffnesses and deflections of the end-effector (tool tip). Therefore, this work can provide a theoretical principle and an application tool for the anticipation and the evaluation for hexapod machining performance, design optimisation and machining accuracy control, etc.

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

instantaneous stiffness
parallel mechanisms
simulation
machining accuracy

hexapod machine tools
end-effector deflection


Center particle swarm optimization Center particle swarm optimization algorithm (CenterPSO) is proposed where a center particle is incorporated into linearly decreasing weight particle swarm optimization (LDWPSO). Unlike other ordinary particles in LDWPSO, the center particle has no explicit velocity, and is set to the center of the swarm at every iteration. Other aspects of the center particle are the same as that of the ordinary particle, such as fitness evaluation and competition for the best particle of the swarm. Because the center of the swarm is a promising position, the center particle generally gets good fitness value. More importantly, due to frequent appearance as the best particle of swarm, it often attracts other particles and guides the search direction of the whole swarm. CenterPSO and LDWPSO are extensively compared on three well-known benchmark functions with 10, 20, 30 dimensions. Experimental results show that CenterPSO achieves not only better solutions but also faster convergence. Furthermore, CenterPSO and LDWPSO are compared as neural network training algorithms. The results show that CenterPSO achieves better performance than LDWPSO.

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

neural networks
evolutionary computation


Prediction of fat oxidation capacity using (1)H-NMR and LC-MS lipid metabolomic data combined with phenotypic data There is evidence from clinical trials that a low capacity to oxidize dietary fats may predispose human individuals to weight gain, obesity, and weight regain following weight loss. These observations have led to a need to identify plasma markers of fat oxidation capacity in order to avoid time consuming direct measurements by indirect calorimetry. The aim of this study was to investigate whether prediction of fat oxidation capacity in an obese population is possible, using (1)H-NMR and LC-MS-based metabolic profiling of blood plasma samples collected before and after a high fat test meal from 100 obese women, who represented the extremes of fat oxidizing capacity. Subject characteristics (baseline anthropometrics, body composition and dietary records) and clinical data (blood values and derived measures for insulin resistance) were recorded into a phenotypic dataset. Filtering by orthogonal signal correction, variable reduction by spectra segmentation, Mann-Whitney U tests and genetic algorithms were applied to spectral data together with partial least squares regression models for prediction. Our findings suggested that only a small fraction of subject variation contained in metabolic profiles is related to fat oxidation capacity and variable reduction methods improved fat oxidation capacity predictability. The LC-MS dataset led to higher specificity (fasting: 86%; postprandial: 73%) and sensitivity (fasting: 75%; postprandial: 75%) than classification using the (1)H-NMR dataset (specificity: fasting: 50%; postprandial: 60%; sensitivity: fasting: 67%; postprandial: 62%). Inclusion of phenotypic variables increased specificity and sensitivity values in both fasting and postprandial time points. However, the moderate specificity and sensitivity values indicated that fat oxidation capacity may only be reflected in subtle differences in the metabolic profiles analyzed. In future studies, metabolomics data may be supplemented with gene variation and gene expression data to caption the properties of fat oxidation capacity more precisely. (C) 2008 Elsevier B.V. All rights reserved.

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

fat oxidation capacity
metabolomics
obesity
orthogonal signal correction
partial least squares


integrating models with domain-specific modeling languages Model integration is inescapable: any non-trivial system will be too large to fit sensibly in a single model. The model will have to be split, maybe into different aspects or languages, different modeler roles and tasks, different phases of the software development life cycle, etc. In Domain-Specific Modeling, the possibilities to integrate models are fundamentally better than with general-purpose languages as the company has full access to the language definitions. We describe and compare different ways to integrate DSM models, based on real world experience of what has been shown to work in practice on industrial scales.

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

metamodel
domain-specific modeling
language integration


Metal/semiconductor contact properties of Al/Co(II)complex compounds A ligand(N-APTH) and Co(II)complex compound of bidentate ligand which contains a ring of the pyrimidine have been produced. For the optical transmission measurements of the Co(II)complex compound thin films, a UVVisible (UVVis) spectrophotometer was employed. As a result of optical measurements, it was revealed that Co(II)complex compound tends to show a semiconductor characteristic with the bandgap value of 3.46eV. An attempt has been made to explore the rectifying and ohmic properties of Al/Co(II)complex compound/Cu structures assuming that Co(II)complex compound may exhibit a rectifier or ohmic behavior, depending on the fabrication process, when brought into an appropriate contact with a metal. From currentvoltage (IV) measurements, it was found that the device could show good ohmic and rectifying properties intentionally depending on the experimental process followed during fabrication.

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

schottky barrier rectification thermionic emission organic compounds


Reducing the number of sequential diagnosis iterations in hypercubes dIn this note, we use a vertex-isoperimetric inequality to show that the number of test and repair iterations needed to perform sequential diagnosis of d-dimensional hypercubes is upper bounded by d - r, where r is an element of theta(d). This result improves the best bound of d test and repair iterations previously known. Numerical evaluation has shown that the actual value of r ranges from 0.16d to 0.31d.

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

massively parallel systems
system-level diagnosis


Enhancement of Self-organisation in Wireless Networking through a Cross-Layer Approach Self-organisation has emerged as a very promising approach to the design, deployment, operation, control and evolution of complex wireless networks. The dominant strictly layered design style may how- ever not be able to accommodate many useful optimisations, and we conjecture that cross-layer design may offer a more promising approach. In support of this conjecture we demonstrate through simulation-based approach a cross-layer approach to routing in wireless ad hoc networks that exhibits high degrees of self-configuration, self-optimisation and self-healing. Simulation studies show a substantial improvement in self-organisation properties of wireless networks over comparable layered designs.

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


Hybrid GA-BF based intelligent PID controller tuning for AVR system This paper deals with hybrid system (GA-BF) based on the conventional GA (Genetic Algorithm) and BF (Bacterial Foraging) which is the social foraging behavior of bacteria. A variety of test function is introduced and simulated to illustrate the characteristics and performance by mutation, crossover, variation of step size, variation of chemotactic step, and variation of lifetime of bacteria in the proposed hybrid system GA-BF. The simulated results represent that the proposed method is highly satisfactory. This approach provides us with novel hybrid model based on foraging behavior and also with a possible new connection between evolutionary forces in social foraging and distributed nongradient optimization algorithm design for global optimization over noisy surfaces. (c) 2010 Published by Elsevier B.V.

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

bacterial foraging optimization
optimal algorithm


Automatic intra-register vectorization for the Intel (R) architecture Recent extensions to the Intel((R)) Architecture feature the SIMD technique to enhance the performance of computational intensive applications that perform the same operation on different elements in a data set. To date, much of the code that exploits these extensions has been hand-coded. The task of the programmer is substantially simplified, however, if a compiler does this exploitation automatically. The high-performance Intel((R)) C++/Fortran compiler supports automatic translation of serial loops into code that uses the SIMD extensions to the Intel((R)) Architecture. This paper provides a detailed over-view of the automatic vectorization methods used by this compiler together with an experimental validation of their effectiveness.

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


A Parallel IRRWBF LDPC Decoder Based on Stream-Based Processor Low-density parity check (LDPC) codes have gained much attention due to their use of various belief-propagation (BP) decoding algorithms to impart excellent error-correcting capability. The BP decoders are quite simple; however, their computation-intensive and repetitive process prohibits their use in energy-sensitive applications such as sensor networks. Bit flipping-based decoding algorithms, especially implementation-efficient, reliability ratio-based, weighted bit-flipping (IRRWBF) decoding; have shown an excellent tradeoff between error-correction performance and implementation cost. In this paper, we show that with IRRWBF, iterative re-computation can be replaced by iterative selective updating. When compared with the original algorithm, simulation results show that, decoding speed can be increased by 200 to 600 percent, as the number of decoding iterations is increased from 5 to 1,000. The decoding steps are broken down into various stages such that the update operations are mostly of the single-instruction, multiple-data (SIMD) type. In this paper, we show that by using Intel Wireless MMX 2 accelerating technology in the proposed algorithm, the speed increased by 500 to 1,500 percent. The results of implementing the proposed scheme using an Intel/Marvell PXA320 (806 MHz) CPU are presented. The proposed scheme can be used effectively in real-time LDPC codes for energy-sensitive mobile devices.

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

data-parallel computing
error correcting code
low-density parity-check (ldpc) code
simd processors


Unsupervised morphological parsing of Bengali Unsupervised morphological analysis is the task of segmenting words into prefixes, suffixes and stems without prior knowledge of language-specific morphotactics and morpho-phonological rules. This paper introduces a simple, yet highly effective algorithm for unsupervised morphological learning for Bengali, an IndoAryan language that is highly inflectional in nature. When evaluated on a set of 4,110 human-segmented Bengali words, our algorithm achieves an F-score of 83%, substantially outperforming Linguistica, one of the most widely-used unsupervised morphological parsers, by about 23%.

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

word segmentation
data annotation
unsupervised learning
asian language processing


Progressive cross-section display of 3D medical images The paper presents a hierarchical coding algorithm for 3D medical images based upon hierarchical interpolation with radial basis function networks. By using the properties of the Kronecker product the computation of the network parameters and the 3D image reconstruction are efficiently done in (L-4) computation time and O(L-3) storage space, when applied to 3D images of size (L x L x L). A further reduction in processing time is accomplished by using sparse matrix techniques. The salient features of the proposed coding method are that arbitrary cross-section images can be progressively displayed without reconstruction of the whole 3D image; the first image reconstruction starts as soon as the first data transmission has been completed; no expanding procedure is required in 3D image reconstruction, and the blocking effects are not apparent even in the lowest-resolution image. Experimental results using two 3D MRI images, of size (128 x 18 x 64) and with 8-bit grey levels, show that the coding performance is better than that of the 3D DCT coding by about 0.25 bits pixel(-1) at higher bit rates, and that the new cross-section display method synthesises the coarsest (finest) section image about six (three) times faster than the standard method that requires the whole 3D image reconstruction.

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

progressive transmission
radial basis function network
3d mri image
cross section display


Hand image recognition by the techniques of hand shape scaling and image weight scaling This research uses the object extracting technique to extract the thumb, index, middle, ring, and small fingers from the hand images. The algorithm developed in this research can find the precise locations of the fingertips and the finger-to-finger-valleys. The extracted fingers contain many useful geometry features. One can use these features to do the person identification. The geometry descriptor is used to transfer geometry features of these finger images to another feature-domain for image-comparison. Image is scaled to make the finger image has more salient feature. Image is also magnifying by the basis of distance-multiplying-pixel-gray-level. After the image magnifying, the finger-image will possess more salient feature. Image subtraction is used to exam the difference of the two images.

finger shape computation and identification


A quantum chemical study of repair of O6-methylguanine to guanine by tyrosine: Evaluation of the winged helix-turn-helix model The winged helix-turn-helix model for the repair of O6-MeG to guanine involving the reaction of O6-MeG with a tyrosine residue of the protein O6-alkylguanine-DNA alkyltransferase (AGT) was examined by studying the reaction mechanism and barrier energies. Molecular geometries of the species and complexes involved in the reaction, i.e. the reactant, intermediate and product complexes as well as transition states, were optimized employing density functional theory in gas phase. It was followed by single point energy calculations using density functional theory along with a higher basis set and second order M phi ller-Plesset perturbation theory (MP2) along with two different basis sets in gas phase and aqueous media. For the solvation calculations in aqueous media, the integral equation formalism of the polarizable continuum model (IEF-PCM) was employed. Vibrational frequency analysis was performed for each optimized structure and genuineness of transition states was ensured by visualizing the vibrational modes. It is found that tyrosine can repair O6-MeG to guanine by a two-step reaction. The present results have been compared with those obtained considering the helix-turn-helix model where the repair reaction primarily involves cysteine and occurs in a single-step. It is concluded that the repair through tyrosine envisaged in the winged helix-turn-helix model would be less efficient than that through cysteine envisaged in the helix-turn-helix model.

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

cancer
dna damage
dna repair
o6-methylguanine
mutation
winged helix-turn-helix model


Prediction of potential toxicity and side effect protein targets of a small molecule by a ligand-protein inverse docking approach Determination of potential drug toxicity and side effect in early stages of drug development is important in reducing the cost and time of drug discovery. In this work, we explore a computer method for predicting potential toxicity and side effect protein targets of a small molecule. A ligand-protein inverse docking approach is used for computer-automated search of a protein cavity database to identify protein targets. This database is developed from protein 3D structures in the protein data bank (PDB). Docking is conducted by a procedure involving multiple conformer shape-matching alignment of a molecule to a cavity followed by molecular-mechanics torsion optimization and energy minimization on both the molecule and the protein residues at the binding region. Potential protein targets are selected by evaluation of molecular mechanics energy and, while applicable, further analysis of its binding competitiveness against other ligands that bind to the same receptor site in at least one PDB entry. Our results on several drugs show that 83% of the experimentally known toxicity and side effect targets for these drugs are predicted. The computer search successfully predicted 38 and missed five experimentally confirmed or implicated protein targets with available structure and in which binding involves no covalent bond. There are additional 30 predicted targets yet to be validated experimentally. Application of this computer approach can potentially facilitate the prediction of toxicity and side effect of a drug or drug lead. (C) 2001 Elsevier Science Inc. All rights reserved.

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

adme/tox
adverse drug reactions
computer-aided drug design
drug safety evaluation
drug target
scoring function
protein receptors
toxicity prediction
aspirin
gentamicin
ibuprofen
indinavir
neomycin
penicillin
tamoxifen
vitamin c


Kirchhoff index of composite graphs ? Let G1+G2 G 1 + G 2 , G1?G2 G 1 ? G 2 and G1{G2} G 1 { G 2 } be the join, corona and cluster of graphs G1 G 1 and G2 G 2 , respectively. In this paper, Kirchhoff index formulae of these composite graphs are given.

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


Behavioral analysis of a fault-tolerant software system with rejuvenation In recent years, considerable attention has been devoted to continuously running software systems whose performance characteristics are smoothly degrading in time. Software aging often affects the performance of a software system and eventually causes it to fail. A novel approach to handle transient software failures due to software aging is called software rejuvenation, which can be regarded as a preventive and proactive solution that is particularly useful for counteracting the aging phenomenon. In this paper, we focus on a high assurance software system with fault-tolerance and preventive rejuvenation, and analyze the stochastic behavior of such a highly critical software system. More precisely, we consider a fault-tolerant software system with two-version redundant structure and random rejuvenation schedule, and evaluate quantitatively some dependability measures like the steady-state system availability and MTTF based on the familiar Markovian analysis. In numerical examples, we examine the dependence of two fault tolerant techniques; design and environment diversity techniques, on the system dependability measures.

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

software fault tolerance
bivariate failure mode
continuous-time markov chain


real-world mvd's According to database theory, a database designer can specify any set of data dependencies, no matter how complex, to constrain a database scheme. This paper investigates how much complexity is actually needed in real-world situations. It is shown that every "natural" set of mvd's must belong to a class of mvd's called conflict-free. Conflict-free sets of mvd's have the desirable property that they allow a unique 4NF dependency preserving database scheme; moreover, non conflict-free sets have no such normalization. If a set of mvd's is not conflict-free, then the dependencies are inadequately specified; there are semantic concepts that are unrepresented in the scheme. These concepts are isolated, and it is shown that adding these concepts amounts to making the set of mvd's conflict-free.

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

dependencies semantic theory complexity paper normalization database scheme class

situated
conflict
data dependence
design
concept


Moving boundary simulations with dynamic mesh smoothing We develop a dynamic mesh adjustment scheme for moving boundary problems such as those encountered in fluid structure interaction. The scheme is implemented in an arbitrary Lagrangian Eulerian (ALE) flow solver for unstructured hybrid meshes and dual time-stepping for Navier Stokes problems. The mesh improvement strategy is an extension of our previous work on mesh optimization based on quality metrics. In the associated numerical experiments, we consider translation and rotation of a profile interior to the flow field. Numerical results for vortex shedding past the moving profile demonstrate the simulation capability and display the effects of dynamic mesh adjustment. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

moving boundary
mesh smoothing
mesh optimization

moving mesh
fluid/structure interaction
unstructured hybrid mesh


An integrated knowledge-based system for grasslands ecosystems In this study, an integrated knowledge-based system (KBS) for the hilly, sandy grassland ecosystems was developed. The system is a component of the Inner Mongolia Grassland Ecosystem Research Information Systems (IMGERIS). IMGERIS is an important subsystem of Chinese Ecological Research Network (CERN). The system was designed to manage land use, planting species/variety, and optimal coverage of plants. The system integrated a KBS for ecosystem with a model system that includes theoretical models of soil water dynamics. The KBS in the system was coded in Prolog and the model system for soil water dynamics was coded in C. The model system was integrated with the KBS.

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

knowledge-based systems
integrated systems


PARAMETER IDENTIFICATION FOR ASYMMETRICAL POLYNOMIAL LOSS FUNCTION The parameter identification for problems where losses arising from overestimation and underestimation are different and can be described by an asymmetrical and polynomial function is investigated in this paper. The Bayes decision rule allowing to minimize potential losses is used. Calculation algorithms are based on the nonparametric methodology of statistical kernel estimators, which releases the method from dependence on distribution type. Three basic cases are considered in detail: a linear, a quadratic, and finally a general concept for a higher degree polynomial - here the cube-case is described in detail as an example. For each of them, the final result constitutes a numerical procedure enabling to effectively calculate the optimal value of a parameter in question, presented in its complete form which demands neither detailed knowledge of the theoretical aspects nor laborious research of the user. Although the above method was investigated from the point of view of automatic control problems, it is universal in character and can be applied to a wide range of tasks, also outside the realm of engineering.

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

parameter identification
asymmetrical polynomial loss function
kernel estimators

bayes estimation
nonparametric estimation
numerical algorithm


Optical Spatial Modulation In this paper, a power and bandwidth efficient pulsed modulation technique for optical wireless (OW) communication is proposed. The scheme is called optical spatial modulation (OSM). In OSM, multiple transmit units exist where only one transmitter is active at any given time instance. The spatially separated transmit units are considered as spatial constellation points. Each unique sequence of incoming data bits is mapped to one of the spatial constellation points, i.e., activating one of the transmit units. This is the fundamental concept of the spatial modulation (SM) technique. In OW communication systems, the active transmitter radiates a certain intensity level at a particular time instance. At the receiver side, the optimal SM detector is used to estimate the active transmitter index. An overall increase in the data rate by the base 2 logarithm of the number of transmit units is achieved. The optical MIMO (multiple-input multiple-output) channel and the channel impulse response are obtained via Monte Carlo simulations by applying ray tracing techniques. It will be shown in this paper that the optical MIMO channel is highly correlated if transmitter and receiver locations are not optimized, which results in a significant power penalty. The power efficiency can be improved by increasing the number of receive units to enhance receive diversity and/or by using soft and hard channel coding techniques. Conversely, it is shown that aligning transmit and receive units creates nearly uncorrelated channel paths and results in substantial enhancements in system performance even as compared to the diversity or coding gain. The resultant aligned scheme is shown to be very efficient in terms of power and bandwidth as compared to on-off keying, pulse position modulation, and pulse amplitude modulation. In this paper also, the upper bound bit error ratios of coded and uncoded OSM are analyzed. The analytical results are validated via Monte Carlo simulations and the results demonstrate a close match.

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

diversity
pulse amplitude modulation
pulse position modulation
spatial modulation

direct detection
hard coding
intensity modulation
multiple input multiple output
optical wireless communication
on-off keying
soft coding


Practical Inference With Systems of Gradual Implicative Rules A general approach to practical inference with gradual implicative rules and fuzzy inputs is presented. Gradual rules represent constraints restricting outputs of a fuzzy system for each input. They are tailored for interpolative reasoning. Our approach to inference relies on the use of inferential independence. It is based on fuzzy output computation under an interval-valued input. A double decomposition of fuzzy inputs is done in terms of a-cuts and in terms of a partitioning of these cuts according to areas where only a few rules apply. The case of 1-D and 2-D inputs is considered, as well as higher dimensional cases. An application to H cheese-making process illustrates the approach.

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

fuzzy rules
inference method
input decomposition


A New Placement-Ideal Layout for Multiway Replication Storage System Technology trends are making sophisticated replication-based storage architectures become a standard commercial practice in today's computing. Existing solutions successfully developed optimal and near-optimal parallelism layouts such as declustered parity organizations at small-scale storage architectures. There are very few studies on multiway replication-based storage architectures that are significantly different from parity-based storage architectures. It is difficult to scale up to a large size because current placement-ideal solutions have a limited number of configurations. In this paper, we retrofit the desirable properties of optimal parallelism definitions in parity architectures for replication architectures, and propose a novel placement-ideal data layout-shifted declustering. Shifted declustering layout obtains optimal parallelism in a wide range of configurations, and obtains optimal high performance and load balancing in both fault-free and degraded mode. Our theoretical proofs and comprehensive simulation results show that shifted declustering is superior in performance, load balancing, and reliability to traditional layout schemes such as standard mirroring, chained declustering, group-rotational declustering, and existing parity layout schemes PRIME and RELPR [4].

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


using data mining techniques to address critical information exchange needs in disaster affected public-private networks Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how to efficiently discover, collect, organize, search and disseminate real-time disaster information. In this paper, we address several key problems which inhibit better information sharing and collaboration between both private and public sector participants for disaster management and recovery. We design and implement a web based prototype implementation of a Business Continuity Information Network (BCIN) system utilizing the latest advances in data mining technologies to create a user-friendly, Internet-based, information-rich service and acting as a vital part of a company's business continuity process. Specifically, information extraction is used to integrate the input data from different sources; the content recommendation engine and the report summarization module provide users personalized and brief views of the disaster information; the community generation module develops spatial clustering techniques to help users build dynamic community in disasters. Currently, BCIN has been exercised at Miami-Dade County Emergency Management.

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

spatial clustering
critical information
disaster management
information extraction
data mining

dynamic dashboard
multi-document summarization


The role of color diagnosticity in object recognition and representation The role of color diagnosticity in object recognition and representation was assessed in three Experiments. In Experiment 1a, participants named pictured objects that were strongly associated with a particular color (e.g., pumpkin and orange). Stimuli were presented in a congruent color, incongruent color, or grayscale. Results indicated that congruent color facilitated naming time, incongruent color impeded naming time, and naming times for grayscale items were situated between the congruent and incongruent conditions. Experiment 1b replicated Experiment 1a using a verification task. Experiment 2 employed a picture rebus paradigm in which participants read sentences one word at a time that included pictures of color diagnostic objects (i.e., pictures were substituted for critical nouns). Results indicated that the reading times of these pictures mirrored the pattern found in Experiment 1. In Experiment 3, an attempt was made to override color diagnosticity using linguistic context (e.g., a pumpkin was described as painted green). Linguistic context did not override color diagnosticity. Collectively, the results demonstrate that color information is regularly utilized in object recognition and representation for highly color diagnostic items.

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

color diagnosticity
object recognition
rebus


First-class nonstandard interpretations by opening closures We motivate and discuss a novel functional programming construct that allows convenient modular run-time nonstandard interpretation via reflection on closure environments. This map-closure construct encompasses both the ability to examine the contents of a closure environment and to construct a new closure with a modified environment. From the user's perspective, map-closure is a powerful and useful construct that supports such tasks as tracing, security logging, sandboxing, error checking, profiling, code instrumentation and metering, run-time code patching, and resource monitoring. From the implementor's perspective, map-closure is analogous to call/cc. Just as call/cc is a non-referentially-transparent mechanism that reifies the continuations that are only implicit in programs written in direct style, map-closure is a non-referentially-transparent mechanism that reifies the closure environments that are only implicit in higher-order programs. Just as CPS conversion is a non-local but purely syntactic transformation that can eliminate references to call/cc, closure conversion is a non-local but purely syntactic transformation that can eliminate references to map-closure. We show how the combination of map-closure and call/cc can be used to implement set! as a procedure definition and a local macro transformation.

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

design
languages
referential transparency
lambda lifting


Spectral graph features for the classification of graphs and graph sequences In this paper, the classification power of the eigenvalues of six graph-associated matrices is investigated. Each matrix contains a certain type of geometric/ spatial information, which may be important for the classification process. The performances of the different feature types is evaluated on two data sets: first a benchmark data set for optical character recognition, where the extracted eigenvalues were utilized as feature vectors for multi-class classification using support vector machines. Classification results are presented for all six feature types, as well as for classifier combinations at decision level. For the decision level combination, probabilistic output support vector machines have been applied, with a performance up to 92.4%. To investigate the power of the spectra for time dependent tasks, too, a second data set was investigated, consisting of human activities in video streams. To model the time dependency, hidden Markov models were utilized and the classification rate reached 98.3%.

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

graph classification
spectrum
graph-associated matrices
human activity recognition


Reinforcement learning agents Reinforcement Learning (RL) is learning through direct experimentation. It does not assume the existence of a teacher that provides examples upon which learning of a task takes place. Instead, in RL experience is the only teacher. With historical roots on the study of biological conditioned reflexes, RL attracts the interest of Engineers and Computer Scientists because of its theoretical relevance and potential applications in fields as diverse as Operational Research and Intelligent Robotics. Computationally, RL is intended to operate in a learning environment composed by two subjects: the learner and a dynamic process. At successive time steps, the learner makes an observation of the process state, selects an action and applies it back to the process. Its goal is to find out an action policy that controls the behavior of the dynamic process, guided by signals (reinforcements) that indicate how badly or well it has been performing the required task. These signals are usually associated to a dramatic condition - e.g., accomplishment of a subtask (reward) or complete failure (punishment), and the learner tries to optimize its behavior by using a performance measure (a function of the received reinforcements). The crucial point is that in order to do that, the learner must evaluate the conditions (associations between observed states and chosen actions) that led to rewards or punishments. Starting from basic concepts, this tutorial presents the many flavors of RL algorithms, develops the corresponding mathematical tools, assess their practical limitations and discusses alternatives that have been proposed for applying RL to realistic tasks.

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

adaptive systems
artificial life
autonomous agents
machine learning
optimization
optimal control


Smaller nets may perform better: special transfer functions In an earlier study we stated sufficient conditions on the transfer function f of a feedforward multilayered neural net such that the output on n defines the net up to trivial changes and smaller nets can have better performance on finite sets. Here we prove that 1/(1+e?x), tanhx, (1?e?x)/(1+e?x) and invtanx satisfy these conditions.

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

identification from input/output relation


Speaker state classification based on fusion of asymmetric simple partial least squares (SIMPLS) and support vector machines ? This paper presents our studies of the effects of acoustic features, speaker normalization methods, and statistical modeling techniques on speaker state classification. We focus on the investigation of the effect of simple partial least squares (SIMPLS) in unbalanced binary classification. Beyond dimension reduction and low computational complexity, SIMPLS classifier (SIMPLSC) shows, especially, higher prediction accuracy to the class with the smaller data number. Therefore, an asymmetric SIMPLS classifier (ASIMPLSC) is proposed to enhance the performance of SIMPLSC to the class with the larger data number. Furthermore, we combine multiple system outputs (ASIMPLS classifier and Support Vector Machines) by score-level fusion to exploit the complementary information in diverse systems. The proposed speaker state classification system is evaluated with several experiments on unbalanced data sets. Within the Interspeech 2011 Speaker State Challenge, we could achieve the best results for the 2-class task of the Sleepiness Sub-Challenge with an unweighted average recall of 71.7%. Further experimental results on the SEMAINE data sets show that the ASIMPLSC achieves an absolute improvement of 6.1%, 6.1%, 24.5%, and 1.3% on the weighted average recall value, over the AVEC 2011 baseline system on the emotional speech binary classification tasks of four dimensions, namely, activation, expectation, power, and valence, respectively.

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

partial least squares
asymmetric simpls
fusion

speaker state recognition
support vector machine
sleepiness detection
speech emotion recognition


SUBJECTIVE ASSESSMENT OF MENTAL WORKLOAD - A FUZZY LINGUISTIC MULTICRITERIA APPROACH In this paper, a fuzzy linguistic multi-criteria method for subjective assessment of mental workload is proposed. The criteria ratings and the corresponding importance weights are assessed in linguistic terms, which are described by fuzzy numbers with triangular and trapezoidal membership function. A fuzzy weighted average algorithm, based on the extension principle, is employed to aggregate these fuzzy numbers. The aggregated fuzzy number is then translated back to linguistics and the overall mental workload is expressed in linguistic terms.

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

subjective assessment
mental workload
linguistic
multicriteria
fuzzy weighted average


Challenging SMT solvers to verify neural networks In recent years, Satisfiability Modulo Theory (SMT) solvers are becoming increasingly popular in the Computer Aided Verification and Reasoning community. Used natively or as back-engines, they are accumulating a record of success stories and, as witnessed by the annual SMT competition, their performances and capacity are also increasing steadily. Introduced in previous contributions of ours, a new application domain providing an outstanding challenge for SMT solvers is represented by verification of Multi-Layer Perceptrons (MLPs) a widely-adopted kind of artificial neural network. In this paper we present an extensive evaluation of the current state-of-the-art SMT solvers and assess their potential in the promising domain of MLP verification.

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

empirical evaluation of smt solvers
applications of automated reasoning
formal methods for adaptive systems


On the alternating sums of powers of consecutive odd integers By applying the symmetry of the fermionic p-adic q-integral on Z(p), which is defined Kim [2]; we give recurrence identities the second kind Euler polynomials and the alternating sums of powers of consecutive odd integers.

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

the second kind euler polynomials
alternating sums


A full coupled numerical analysis approach for buried structures subjected to subsurface blast The physical processes during an explosion in soil and the subsequent response of buried structures are extremely complex. Combining all these processes into a single analysis model involves several numerical difficulties but such a model will enable more realistic reproduction of the underlying physical processes. This paper presents a full coupled numerical analysis approach, in which the SPH (smooth particle hydrodynamics) method is adopted to model the near field medium to cater for large deformation, while the conventional FEM is used to model the intermediate and the far field soil medium and the structural response. A robust three-phase soil model developed by the authors is employed to model the soil mass. The numerical model is verified against empirical predictions and the comparison shows a favorable agreement.

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

buried structure
sphfem coupled method
stress wave
in-structure shock


Order Acceptance and Scheduling Problems in Two-machine Flow Shops: New Mixed Integer Programming Formulations We consider the order acceptance and scheduling problem in two machine flow shops. Two new mixed integer linear programming formulations are presented for the problem. Several techniques are developed to improve each of these formulations. Larger instances of the problem are solved within a reasonable amount of time.

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

order acceptance
scheduling
mixed integer programming


A heuristic algorithm for solving hazardous materials distribution problems A type of decision of major importance that directly affects the performance of a distribution system is the routing and scheduling of delivery trucks. The determination of hazardous materials distribution routes can be defined as a bi-objective vehicle routing problem with time windows since risk minimization accompanies the cost minimization in the objective function. The objective of this paper is to present a new heuristic algorithm for solving the bi-objective vehicle routing and scheduling problem. The proposed algorithm has been applied to several benchmark problems. The results of these applications seem to be quite encouraging. Furthermore, the proposed algorithm has been integrated within a GIS based decision support system for hazardous materials logistics operations providing valid preliminary results on a set of case studies.

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

vehicle routing and scheduling
heuristic
hazardous materials


Exploiting indoor location and mobile information for context-awareness service Personal mobile devices such as cellular phones, smart phones and PMPs have advanced incredibly in the past decade. The mobile technologies make research on the life log and user-context awareness feasible. In other words, sensors in mobile devices can collect the variety of users information, and various works have been conducted using that information. Most of works used a users location information as the most useful clue to recognize the user context. However, the location information in the conventional works usually depends on a GPS receiver that has limited function, because it cannot localize a person in a building and thus lowers the performance of the user-context awareness. This paper develops a system to solve such problems and to infer a users hidden information more accurately using Bayesian network and indoor-location information. Also, this paper presents a new technique for localization in a building using a decision tree and signals for the Wireless LAN because the decision tree has many advantages which outweigh other localization techniques.

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

context awareness
indoor localization
mobile device


Max-Min Fairness and Its Applications to Routing and Load-Balancing in Communication Networks: A Tutorial This tutorial is devoted to the notion of Max-Min Fairness (MMF), associated optimization problems, and their applications to multi-commodity flow networks. We first introduce a theoretical background for a generic MMF optimization problem and discuss its relation to lexicographic optimization. We next present resolution algorithms for convex MMF optimization, and analyze their properties. In the second half of the tutorial we discuss its applications to communication networks, in particular to routing and load-balancing. We state several properties with respect to each of the studied problems and analyze the behavior of the algorithms.

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

max-min fairness
multi-commodity flow
load-balancing


Domain monotonicity and the performance of local solutions strategies for CDPS-based distributed sensor interpretation and distributed diagnosis The growth in computer networks has created the potential to harness a great deal of computing power, but new models of distributed computing are often required. Cooperative distributed problem solving (CDPS) is the subfield of multi-agent systems (MAS) that is concerned with how large-scale problems can be solved using a network of intelligent agents working together. Building CDPS systems for real-world applications is still very difficult, however, in large part because the effects that domain and strategy characteristics have on the performance of CDPS systems are not well understood. This paper reports on the first results from a new simulation-based analysis system that has been created to study the performance of CDPS-based distributed sensor interpretation (DSI) and distributed diagnosis ( DD). To demonstrate the kind of results that can be obtained, we have investigated how the monotonicity of a domain affects the performance of a potentially very efficient class of strategies for CDPS-based DSI/DD. Local solutions strategies attempt to limit communications among the agents by focusing on using the agents local solutions to produce global solutions. While these strategies have been described as being important for effective CDPS-based DSI/DD, they need not perform well if a domain is non-monotonic. We had previously suggested that the reason they have performed well in several research systems was that many DSI/DD domains are what we termed nearly monotonic. In this paper, we will provide quantitative results that relate the performance of local solutions strategies to the monotonicity of a domain. The experiments confirm that domain monotonicity can be important to consider, but they also show that it is possible for these strategies to be effective even when domains are relatively non-monotonic. What is required is that the agents receive a significant fraction of the data that is relevant to their subproblems. This has important implications for the design of DSI/DD systems using local solutions strategies. In addition, while the work indicates that many DSI/DD domains are likely to be nearly monotonic according to our original definitions, it also shows that these measures are not as predictive of performance as other measures we de ne. This means that near monotonicity alone does not explain why local solutions strategies have performed well in previous systems. Instead, a likely explanation is that these systems typically involved only a small number of agents.

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

cooperative distributed problem solving
distributed sensor interpretation
distributed diagnosis
domain monotonicity


Cross-cultural comparison of hand gestures of Japanese and Germans for tabletop systems This study compares gesture use of Japanese and Germans. Gestures were generated for map application and a video walkthrough. Participants gestures were quantitatively and qualitatively analyzed. Gestures were similar in physical aspects. But gestures differed in symbolic and metaphorical aspects.

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

cultural differences
user study
surface gestures
german


Converting subalgebra bases with the Sagbi walk ? We present an algorithm which converts a given Sagbi basis of a polynomial K -subalgebra A A with respect to one monomial ordering to the Sagbi basis of A A with respect to another monomial ordering, under the assumption that the subalgebra A A admits a finite Sagbi basis with respect to all monomial orderings. The Sagbi walk method converts a Sagbi basis by partitioning the computations following a path in the Sagbi fan.

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


Effect of carrier-induced Hall current on magneto-optical spectra of carbon nanotubes Absorption spectra of a single-wall carbon nanotube in a magnetic field perpendicular to the tube axis are calculated for parallel polarized light. Hall current is induced by carrier doping and it strongly reduces the lowest spectral peak.

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


A tabu-search hyperheuristic for timetabling and rostering Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques.

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

hyperheuristic scheduling rostering timetabling


Methods for aggregating intuitionistic uncertain linguistic variables and their application to group decision making With respect to multiple attribute group decision making (MAGDM) problems in which the attribute weights and the expert weights take the form of real numbers and the attribute values take the form of intuitionistic uncertain linguistic variables, new group decision making methods have been developed. First, operational laws, expected value definitions, score functions and accuracy functions of intuitionistic uncertain linguistic variables are introduced. Then, an intuitionistic uncertain linguistic weighted geometric average (IULWGA) operator and an intuitionistic uncertain linguistic ordered weighted geometric (IULOWG) operator are developed. Furthermore, some desirable properties of these operators, such as commutativity, idempotency, monotonicity and boundedness, have been studied, and an intuitionistic uncertain linguistic hybrid geometric (IULHG) operator, which generalizes both the IULWGA operator and the IULOWG operator, was developed. Based on these operators, two methods for multiple attribute group decision making problems with intuitionistic uncertain linguistic information have been proposed. Finally, an illustrative example is given to verify the developed approaches and demonstrate their practicality and effectiveness.

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

uncertain linguistic variable
intuitionistic fuzzy set
geometric operator


On end extensions of models of subsystems of peano arithmetic We sun,ey results and problems concerning subsystems of Peano Arithmetic. lu particular; we deal with end extensions of models of such theories. First, we discuss the results of Paris and Kirby (Logic Colloquium '77, North-Holland, Amsterdam, 1978, pp. 199-209) and of Clote (Fund. Math. 127 (1986) 163; Fund. Math. 158 (1998) 301), which generalize the MacDowell and Specker theorem (PMC. Symp. on Foundation of Mathematics, Warsaw, 1959, Pergamon Press, Oxford, 1961, pp. 257-263) we also discuss a related problem of Kaufmann (On existence of Sigma (n) end extensions, Lecture Notes in Mathematics. Vol. 859, Springer, Berlin, 1980, p. 92). Then we sketch an alternative proof of Clote's theorem, using the arithmetized completeness theorem in the spirit of McAloon (Trans. Amer. Math. Sec. 239 (1978) 253) and Paris (Some conservation results for fragments of arithmetic Lecture Notes in h;Mathematics, Vol. 890, Springer, Berlin, 1981, p. 251). (C) 2001 Elsevier Science B.V. All rights reserved.

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

sigma(n)-induction schema
sigma(n)-collection schema
end extension
sigma(n)-ultrafilter


Parallel processing simulation of dynamic properties of filled rubber compounds based on cellular automata ? We present a cellular automaton-based computational model for the simulation of significant dynamic properties of carbon black-filled rubber compounds. The goal is to devise a tool that enables the parallel processing simulation and the analysis of compounds behaviour at different carbon black values of loading and dispersion. In order to model a significant slice of a real sample, a very high level of computational resources is required, hence the need for massive parallel computers and techniques. Finally, performance evaluations are presented.

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

cellular automata
simulation
rubber compounds


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

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


Job challenge as a motivator in a principalagent setting We analyze the tradeoff between monetary and non-monetary incentives in a principalagent framework where the principal chooses job-challenge (job-design) to provide non-monetary incentives. We capture the construct of job-challenge as a motivator based on Atkinson (1958). In: Atkinson, J.W. (Ed.), Motires in Fantasy, Action and Society, Van Nostrand, Princeton, NJ. Specifically, more challenging jobs reduce the probability of success but increase the marginal productivity of the agent's effort. This provides the agent with a sense of accomplishment from which the agent derives utility. We show that there are three effects of job-challenge when we consider information asymmetries. The substitution effect arises because non-monetary incentives can be used to substitute for monetary incentives. The risk effect arises because job challenge can be used to impose some of the risk needed to mitigate the impact of hidden-action, rather than having to impose risk through monetary incentives which could be costlier to the principal. The informativeness effect arises because the final outcome is more informative on the hidden-action of the agent and thus less risk needs to be imposed through the monetary incentives than in a model that does not feature job-challenge. The cost to the principal of designing challenging jobs arises from the decreased expected output.

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

gaming
agency theory
task design
information asymmetry


Navigation in hyperspace: An evaluation of the effects of navigational tools and subject matter expertise on browsing and information retrieval in hypertext This study examined the effectiveness of a map and a textual contents list on the navigation performance of subjects with and without prior knowledge of the text topic. After reading the text, subjects used the document to answer ten questions. The results showed that performance in the map condition was superior to that of the contents list condition, which in turn was superior to that of the hypertext only condition (no navigational aid). In addition, knowledgeable subjects performed better than non-knowledgeable subjects, except in the map condition where their performance was equivalent, The results also show that non-knowledgeable users tend to rely more heavily on navigational aids than knowledgeable users, and that aids were used primarily during browsing. These results are discussed in relation to the ways in which navigational aids interact with the prior knowledge of the user to enhance or impede performance. (C) 1998 Elsevier Science B.V.

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

hypertext
information retrieval
navigation
navigational aids
browsing


EOG-based visual navigation interface development This paper presents an EOG-based (Electrooculography) interface for Human Computer Interface (HCI) purposes. The solution enables the filtering of the recorded signals and identification of characteristic peak amplitudes associated with eye saccades, blinks or winks by using a classifier based on a set of fuzzy logic rules and a deterministic finite automaton. The identified eye saccades were assigned to six low-level commands for navigation purposes. An experiment study was conducted in order to check the accuracy and the performances of the proposed interface compared with three traditional input control interfaces. Experimental results show that the developed interface has good performance and can be used for online communication and control in EOG-based HCI systems or even for first-person navigation metaphors in games industry.

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

electrooculography
navigation
fuzzy logic
deterministic finite automaton

human computer interaction
virtual environment


Numerical and analytical solution of compressible flow over double wedge and biconvex airfoils Purpose - The purpose of this paper is to carry out a comprehensive study of compressible flow over double wedge and biconvex airfoils using computational fluid dynamics (CFD) and three analytical models including shock and expansion wave theory, Busemann's second-order linearized approximation and characteristic method (CHM). Design/methodology/approach - Flow over double-wedge and biconvex airfoils was investigated by the CFD technique using the Spalart-Allmaras turbulence model for computation of the Reynolds stresses. Flow was considered compressible, two dimensional and steady. The no slip condition was applied at walls and the Sutherland law was used to calculate molecular viscosity as a function of static temperature. First-order upwind discretization scheme was used for the convection terms. Finite-volume method was used for the entire solution domain meshed by quadratic computational cells. Busemann's theory, shock and expansion wave technique and CHM were the analytical methods used in this work. Findings - Static pressure, static temperature and aerodynamic coefficients of the airfoils were calculated at various angles of attack. In addition, aerodynamic coefficients of the double-wedge airfoil were obtained at various free stream Mach numbers and thickness ratios of the airfoil. Static pressure and aerodynamic coefficients obtained from the analytical and numerical methods were in excellent agreement with average error of 1.62 percent. Variation of the static pressure normal to the walls was negligible in the numerical simulation as well as the analytical solutions. Analytical static temperature far from the walls was consistent with the numerical values with average error of 3.40 percent. However, it was not comparable to the numerical temperature at the solid walls. Therefore, analytical solutions give accurate prediction of the static pressure and the aerodynamic coefficients, however, for the static temperature; they are only reliable far from the solid surfaces. Accuracy of the analytical aerodynamic coefficients is because of accurate prediction of the static pressure which is not considerably influenced by the boundary layer. Discrepancies between analytical and numerical temperatures near the walls are because of dependency of temperature on the boundary layer and viscous heating. Low-speed flow near walls causes transformation of the kinetic energy of the free stream into enthalpy that leads to high temperature on the solid walls; which is neglected in the analytical solutions. Originality/value - This paper is useful for researchers in the area of external compressible flows. This work is original.

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

aerodynamics
turbulence flow
waves
programming and algorithm theory


A new evolutionary computation technique for economic dispatch with security constraints This paper presents an efficient and reliable evolutionary based approach to solve the economic load dispatch (ELD) with security constraints. A new approach is proposed which employs attractive and repulsive particle swarm optimization (ARPSO) algorithm for ELD. Incorporation of ARPSO as a derivative-free optimization technique in solving ELD with security (voltages and line-flows) constraints significantly relieves the assumptions imposed on the optimized objective function. The proposed approach has been implemented on three representative systems, i.e. IEEE 14 bus, IEEE 30 bus and IEEE 57 bus systems, respectively. The feasibility of the proposed method is demonstrated and the results are compared with linear programming, quadratic programming and genetic algorithm, respectively. The premature convergence problem, that is common in all evolutionary computation techniques, is solved in ARPSO by including the diversity factor in the Type 1 PSO algorithm. The developed algorithms are computationally faster (in terms of the number of load flows carried out) than the other methods because only one run is required.

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

economic load dispatch
particle swarm optimization

power system optimization
line-flow
voltage constraints


user defined structural searches in mediawiki Wikipedia has been the poster child of user contributed content using the space of MediaWiki as the canvas on which to write. While well suited for authoring simple hypermedia documents, MediaWiki does not lend itself easily to let the author create dynamically assembled documents, or create pages that monitor other pages. While it is possible to create such "special" pages, it requires PHP coding and thus administrative rights to the MediaWiki server. We present in this paper work on a structural query language (MediaWiki Query Language - MWQL) to allow users to add dynamically evaluated searches to ordinary wiki-pages.

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


KNEM: A generic and scalable kernel-assisted intra-node MPI communication framework The multiplication of cores in todays architectures raises the importance of intra-node communication in modern clusters and their impact on the overall parallel application performance. Although several proposals focused on this issue in the past, there is still a need for a portable and hardware-independent solution that addresses the requirements of both point-to-point and collective MPIoperations inside shared-memory computing nodes. This paper presents the KNEMmodule for the Linuxkernel that provides MPIimplementations with a flexible and scalable interface for performing kernel-assisted single-copy data transfers between local processes. It enables high-performance communication within most existing MPIimplementations and brings significant application performance improvements thanks to more efficient point-to-point and collective operations.

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

intra-node communication
kernel assistance
portability
hardware-independence


Preliminary study on the accuracy of respiratory input impedance measurement using the interrupter technique Respiratory input impedance contains information about the state of pulmonary mechanics in the frequency domain. In this paper the possibility of respiratory impedance measurement by interrupter technique as well as the accuracy of this approach are assessed. Transient states of flow and pressure recorded during expiratory flow interruption are simulated with a complex, linear model for the respiratory system and then used to calculate the impedance, including three states of respiratory mechanics and the influence of the measurement noise. The results of computations are compared to the known, theoretical impedance of the model. At 1kHz sampling rate, the optimal time window lays between 100 and 200ms and is centred around the pressure jump caused by the flow interruption. The proposed algorithm yields satisfactory accuracy in the range from 10 to 400Hz, particularly to 150Hz. Depending on the simulated respiratory system state, the error of calculated impedance (relative Euclidean distance between the vectors of computed and theoretical values), for the window of 190ms, varies between 5.0% and 7.1%.

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

respiratory mechanics
input impedance
interrupter technique

mathematical modelling
measurement accuracy


finding the minimum visible vertex distance between two non-intersecting simple polygons In this paper, we present an &Ogr; ( n log n ) algorithm for finding the minimum Euclidean visible vertex distance between two nonintersecting simple polygons, where n is the number of vertices in a polygon. The algorithm is based on applying a divide and conquer method to two preprocessed facing boundaries of the polygons. We also derive an &Ogr; ( n log n ) algorithm for finding a minimum sequence of separating line segments between two nonintersecting polygons.

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

distance method polygon algorithm paper sequence log


A comparison of strong and weak distributed transverse coupling between VLSI interconnects Crosstalk under strong and weak coupling is compared and the two cases are shown to be identical for the important low-frequency range, where the significant components of the input excitation He. The validity of weak coupling is established in terms of rise time and physical length of interconnects.

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

vlsi interconnect
weak and strong coupling


Set-point weighted PID controllers for unstable systems The methods proposed by Astrom and Hagglund (IFAC Adaptive Control of Chemical Processes, Pergamon Press, New York, 1985, pp. 205210), Mantz and Tacconi (Int. J. Control 49 (1989) 14651471; Ind. Eng. Chem. Res. 20 (1990) 12491253) for selection of set-point weighting parameters for stable systems are extended to unstable first-order plus time-delay (FOPTD) systems. Since these methods require the real part of the dominant pole, an analytical solution is derived for calculation of dominant poles of the closed-loop system given the PID controllers settings. For PID controller settings given by DePaor and O'Malley (Int. J. Control 49 (1989) 12731284) and Clement and Chidambaram (Chem. Eng. Commun. 62 (1997) 6374), the set-point weighting parameters are calculated and simple equations are given for the parameters in terms of ? (ratio of time delay to dominant time constant). Simulation results on an unstable FOPTD transfer function model and higher-order transfer function model show that the overshoot is significantly reduced by employing the set-point weighting parameters in the PID controller. The performances of the closed-loop servo responses for all the extended methods are compared.

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


An analytical model for delivery evaluation of multimodal contents in pervasive computing Recent advance of mobile and interactive devices, such as smart phones, PDAs, and handheld computers, enables to deliver multimodal contents based on users and their environments. In pervasive computing. multimodal contents are mainly composed of multiple components which are often delivered from distributed multiple sources. Therefore, how appropriate contents can be provided to users and how computing resources can be effectively exploited are critical issues. In this paper, an analytical model for multi modal contents is developed based on a queueing theory for the purpose of delivery evaluation of the contents. The model can be applied to estimate how delivery parameters of multimodal contents, such as arrival rates, drop rates, and the number of packets, can impact overall the quality of services in terms of temporal aspects. A numerical example of weather information delivery is provided to illustrate the effectiveness of the proposed model. (C) 2009 Elsevier B.V. All rights reserved.

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

analytical model
multimodal contents
queueing theory


The complexity of weighted Boolean #CSP with mixed signs We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set Gamma of rational-valued functions, which generalize constraints. Each function assigns a weight to every assignment to a set of Boolean variables. Our dichotomy extends previous work in which the weight functions were restricted to being non-negative. We represent a weight function as a product of the form (-1)(s)g, where the polynomial s determines the sign of the weight and the non-negative function g determines its magnitude. We show that the problem of computing the partition function (the Sum of the weights of all possible variable assignments) is in polynomial time if either every function in Gamma can be defined by a "pure affine" magnitude with a quadratic sign polynomial or every function can be defined by a magnitude of "product type" with a linear sign polynomial. In all other cases, computing the partition function is FOP-complete. (C) 2009 Elsevier B.V. All rights reserved.

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

constraint satisfaction
partition function


Temporal stability of small disturbances in MHD JefferyHamel flows In this paper, the temporal development of small disturbances in magnetohydrodynamic (MHD) JefferyHamel flows is investigated, in order to understand the stability of hydromagnetic steady flows in convergent/divergent channels at very small magnetic Reynolds number Rm R m . A modified form of normal modes that satisfy the linearized governing equations for small disturbance development asymptotically far downstream is employed [A. McAlpine, P.G. Drazin, On the spatio-development of small perturbations of JefferyHamel flows, Fluid Dyn. Res. 22 (1998) 123138]. The resulting fourth-order eigenvalue problem which reduces to the well known OrrSommerfeld equation in some limiting cases is solved numerically by a spectral collocation technique with expansions in Chebyshev polynomials. The results indicate that a small divergence of the walls is destabilizing for plane Poiseuille flow while a small convergence has a stabilizing effect. However, an increase in the magnetic field intensity has a strong stabilizing effect on both diverging and converging channel geometry.

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

eigenvalue problem
orrsommerfeld equation

mhd jefferyhamel flow
small disturbances stability
spectral method


A novel binary adaptive weight GSA based feature selection for face recognition using local gradient patterns, modified census transform, and local binary patterns The present paper proposes a novel feature selection scheme for face recognition problems, employing a new modified version of the gravitational search algorithm, a recently proposed metaheuristic optimization algorithm. The feature selection scheme, which reduces the dimensionality of the set of extracted features by choosing the features with high discriminative power, has been employed in conjunction with three contemporary feature extraction algorithms popularly employed for face recognition purposes, namely local binary pattern (LBP), modified census transform (MCT), and local gradient pattern (LGP) algorithms. The feature selectionis carried out by formulating a fitness function as a ratio of the within class distance to the between class distance and then a binary version of traditional GSA is developed for solving this problem. This binary GSA (named BGSA) is further enhanced to propose a novel binary variation of GSA with dynamic adaptive inertia weight (named BAW-GSA). Six new algorithms for face recognition are proposed hybridizing BGSA or BAW-GSA with each of LBP, MCT and LGP algorithms. In each algorithm, the classification step is carried out using backpropagation neural network. The algorithms were extensively tested for five benchmark face databases (Yale A, Yale B extended, ORL, LFW and AR) and it was conclusively proven that our proposed algorithms could comfortably outperform several competing, contemporary algorithms existing in literature and, among all algorithms considered, LGP hybridized with BAW-GSA emerged as the most superior algorithm.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 gravitational search algorithm (bgsa)

binary adaptive weight gravitational search algorithm (baw-gsa)


Reliability sampling plans for lognormal distribution, based on progressively-censored samples This paper presents reliability sampling plans for the lognormal distribution based on progressively censored samples. In constructing these sampling plans, large-sample approximations to the best linear unbiased estimators of the location & scale parameters are used. For some selected progressive censoring schemes, reliability sampling plans are tabulated for p(alpha) and p(beta) to match MIL-STD-105, While in general, variable-sampling plans require smaller sample size when compared with attribute-sampling plans, the ordinary complete and right-censored life test experiments are special cases of the progressively censored experiment, Hence, the progressively censored reliability sampling plans in this paper are widely applicable, General application of the procedure is discussed, and two examples are provided.

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

acceptance sampling
approximate moment of order statistic
best linear unbiased estimation
order statistic
s-normal distribution
type ii progressive censoring


Group affinity based social trust model for an intelligent movie recommender system As many researchers have taken an interest in social networks with the development of the user-generated web, trust management and its application have come into the spotlight. User information that is extracted by behavior patterns and user profiles provides the essential relationship between individuals. In this paper, we propose an intelligent movie recommender system with a social trust model. The proposed system is based on a social network for analyzing social relationships between users and generated group affinity values with user profiles. In experiments, the performance of this system is evaluated with precision-recall and F-measures.

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

recommender systems
information technology


Impact of VSC faults on dynamic performance and low voltage ride through of DFIG This paper investigates the impacts of various GSC and RSC faults. Faults as misfire, fire-through, flashover and faults across the DC-link capacitor. Fire-through, flashover and DC-link capacitor short-circuit have severe impacts. LVRT capability of the DFIG is affected by the Faults. Suggestion is proposed for the fault detection of a DFIG for the practical application.

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


The auditory perceived quality of hands-free telephones: Auditory judgements, instrumental measurements and their relationship In this paper quality evaluation procedures for hands-free telephones are described with reference to some examples. The paper briefly describes the hearing tests conducted in order to investigate the auditory perceived quality in single talk condition. The parameters found to be most relevant in this situation are listed. Special tests were conducted in order to evaluate the conversational quality of the systems. The parameters found to be most interesting are listed as well. Instrumental measurements, showing procedures for instrumental evaluation, are shown using the examples of the different hands-free telephones. As a consequence from the auditory evaluation a classification of different types of hands-free telephones is proposed, For each class of hands-free telephones the relevant instrumental measurement parameters are listed.

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

quality evaluation
instrumental measurement
auditory evaluation


Are Reanalysis Data Useful for Calculating Climate Indices over South America? Precipitation and temperature climate indices are calculated using the National Centers for Environmental Prediction/National Center for Atmospheric Research (NCEP/NCAR) reanalysis and validated against observational data from some stations over Brazil and other data sources. The spatial patterns of the climate indices trends are analyzed for the period 19611990 over South America. In addition, the correlation and linear regression coefficients for some specific stations were also obtained in order to compare with the reanalysis data. In general, the results suggest that NCEP/NCAR reanalysis can provide useful information about minimum temperature and consecutive dry days indices at individual grid cells in Brazil. However, some regional differences in the climate indices trends are observed when different data sets are compared. For instance, the NCEP/NCAR reanalysis shows a reversal signal for all rainfall annual indices and the cold night index over Argentina. Despite these differences, maps of the trends for most of the annual climate indices obtained from the NCEP/NCAR reanalysis and BRANT analysis are generally in good agreement with other available data sources and previous findings in the literature for large areas of southern South America. The pattern of trends for the precipitation annual indices over the 30 years analyzed indicates a change to wetter conditions over southern and southeastern parts of Brazil, Paraguay, Uruguay, central and northern Argentina, and parts of Chile and a decrease over southwestern South America. All over South America, the climate indices related to the minimum temperature (warm or cold nights) have clearly shown a warming tendency; however, no consistent changes in maximum temperature extremes (warm and cold days) have been observed. Therefore, one must be careful before suggesting any trends for warm or cold days.

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

regional climate changes
ncep reanalysis


VIRaL: Visual Image Retrieval and Localization New applications are emerging every day exploiting the huge data volume in community photo collections. Most focus on popular subsets, e.g., images containing landmarks or associated to Wikipedia articles. In this work we are concerned with the problem of accurately finding the location where a photo is taken without needing any metadata, that is, solely by its visual content. We also recognize landmarks where applicable, automatically linking them to Wikipedia. We show that the time is right for automating the geo-tagging process, and we show how this can work at large scale. In doing so, we do exploit redundancy of content in popular locationsbut unlike most existing solutions, we do not restrict to landmarks. In other words, we can compactly represent the visual content of all thousands of images depicting e.g., the Parthenon and still retrieve any single, isolated, non-landmark image like a house or a graffiti on a wall. Starting from an existing, geo-tagged dataset, we cluster images into sets of different views of the same scene. This is a very efficient, scalable, and fully automated mining process. We then align all views in a set to one reference image and construct a 2D scene map. Our indexing scheme operates directly on scene maps. We evaluate our solution on a challenging one million urban image dataset and provide public access to our service through our online application, VIRaL.

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

image clustering
sub-linear indexing
location recognition
landmark recognition
image localization