On the transformation of sentences with genitive relations to SQL queries The genitive relation is one of the most complex semantic structures, since it could express wide range of different connection types between entities, even in a single language. Thus, transformation of its syntactic form to a formal computer language is far from clear. In the last decade, several natural language database interfaces (NLIDBs) have been proposed, however, a detailed or a general description of this problem is still missing in the literature. In this paper, we present a general solution for translating genitive phrases into SQL queries which contains both language dependent and language independent parts. Our solution is optimized and tested for Hungarian, however, most of the work can be easily adopted for other languages as well.

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

natural language interfaces to databases


Transparency powers levels in Yb3+-doped fiber due to temperature changes The critical power level provides an objective tool for the determination of the maximum power available in a fiber laser based on physical parameters such as core diameter, temperature, and absorption and emission cross section for both the pump and laser wavelengths. This work presents a theoretical study of critical power levels when Ytterbium-doped fibers are exposed to changes of temperatures. We found that critical power curves extend their wavelength dependence, ranging from 1?m to 1.2-?m when fibers were heated up 300K. However, critical power values were rather high compared to the values obtained at room temperature. Nevertheless, low critical powers were obtained at low temperatures as 77K in a reduced interval of wavelengths, i.e., from 1-?m to 1.1-?m.

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

ytterbium-doped optical fibers
optical fiber laser
ytterbium-doped fiber laser


Multi-return function call It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. This paper conducts a fairly wide-ranging tour of such a feature: a formal semantics for a minimal lambda-calculus capturing the mechanism; a motivating example; a static type system; useful transformations; implementation concerns and experience with an implementation; and comparison to related mechanisms, such as exceptions, sum-types and explicit continuations. We conclude that multiple-return function call is not only a useful and expressive mechanism, both at the source-code and intermediate-representation level, but is also quite inexpensive to implement.

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

design
languages
performance
theory
functional programming
procedure call
control structures
lambda calculus
compilers
programming languages


DESIGN OF NOVEL SCALAR QUANTIZER MODEL FOR GAUSSIAN SOURCE This paper proposes the novel model of scalar quantizer that combines two classical models, the model of scalar compandor and the model of Lloyd-Max's scalar quantizer. Particularly, the proposed model utilizes the advantages of the both models while tending to minimize their deficiencies. The performance analysis of the novel quantizer is carried out assuming the Gaussian source of unit variance. It is demonstrated that with the novel model of quantizer near to the Lloyd-Max's optimal performances can be achieved. Moreover, we showed that for a fixed number of quantizaton levels, the average complexity of the novel quantizer is significantly smaller than that of the Lloyd-Max's scalar quantizer.

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

compandor
gaussian source
novel model
scalar quantizer


Role of scandium atom in ScxY3?xN@C80(CF3)n (n=0, 2) on nuclear quadrupole interaction, electric field gradient and asymmetric parameters Electronic structures and magnetic properties of ScxY3?xN@C80(CF3)n were studied. The magnetic parameters were originated in distorted electron density distribution. Spin relaxation time was based on nuclear quadrupole interaction based on EFG and ?.

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

endohedral metallofullerene
nmr spectroscopy
electronic spin resonance
density function theory
chemical shift


On the Maximal Interval Subgraph of a Tree We study the problem of finding the maximum interval subgraph in a tree. This problem is related to the Double Digestion Problem of DNA physical mapping. We show that the complexity of an algorithm of Wang is O(n). We also present a linear algorithm of our own. We study the case when the edges of the tree is weighted as well. An algorithm with complexity O(n(3)) is presented.

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


Modified simple column configurations for quaternary distillations Distillation is the most energy demanding, capital intensive and widely used separation method. For quaternary distillation, the conventional simple column configurations employ three columns to achieve four products with any specified purity. In this paper, the modified simple column configurations are studied which use two columns to accomplish four-component separations with any specified purity. The modified simple column configurations have the significant process intensification feature that they use less number of columns and heat exchangers. To study the performance of the modified simple column configurations different four-component mixtures with different feed compositions were analyzed. The performance was studied in terms of energy, capital cost saving and column sections function. It was demonstrated that for the composition cases considered the proposed configurations have similar or better energy performance than the traditional simple column sequences, however significant capital cost reductions are achieved in all the cases studied. (C) 2011 Elsevier Ltd. All rights reserved.

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

multicomponent distillation
energy and capital cost saving
process synthesis and simulation


ECG Pattern Analysis for Emotion Detection Emotion modeling and recognition has drawn extensive attention from disciplines such as psychology, cognitive science, and, lately, engineering. Although a significant amount of research has been done on behavioral modalities, less explored characteristics include the physiological signals. This work brings to the table the ECG signal and presents a thorough analysis of its psychological properties. The fact that this signal has been established as a biometric characteristic calls for subject-dependent emotion recognizers that capture the instantaneous variability of the signal from its homeostatic baseline. A solution based on the empirical mode decomposition is proposed for the detection of dynamically evolving emotion patterns on ECG. Classification features are based on the instantaneous frequency (Hilbert-Huang transform) and the local oscillation within every mode. Two experimental setups are presented for the elicitation of active arousal and passive arousal/valence. The results support the expectations for subject specificity, as well as demonstrating the feasibility of determining valence out of the ECG morphology (up to 89 percent for 44 subjects). In addition, this work differentiates for the first time between active and passive arousal, and advocates that there are higher chances of ECG reactivity to emotion when the induction method is active for the subject.

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

arousal
valence
instantaneous frequency
oscillation

electrocardiogram
emotion recognition
affective computing
active stress
passive stress
bivariate empirical mode decomposition
intrinsic mode function


Optimization and anti-optimization solution of combined parameterized and improved interval analyses for structures with uncertainties Linear discretized structures with uncertain-but-bounded properties are analyzed. Parameterized (PIA) and Improved (IIA-EUI) Interval Analyses are compared. A new method combining PIA and IIA-EUI is presented. The new method by optimization and anti-optimization solution reduces the dependency. Numerical tests show efficiency of the new method to treat structural uncertainties.

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

improved interval analysis via extra unitary interval


STATISTICAL APPROXIMATION BY MEANS OF OPERATORS CONSTRUCTED BY q-LAGRANGE POLYNOMIALS In this paper, using q-Lagrange polynomials, a sequence of positive linear operators are constructed. Approximation properties of these q-type operators are established via A-statistical convergence. Furthermore, we compute rates of A-statistical convergence by means of modulus of continuity, the elements of the Lipschitz class, Peetre's K-functional and the Lipschitz type maximal function, respectively. This statistical approximation process enables us more powerful results than the classical aspects.

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

positive linear operators
modulus of continuity
the lipschitz type maximal function

q-lagrange polynomials
a-statistical convergence
the korovkin theorem
peetre's k-functional


On lower bounds for the fixed charge problem First attempt using quadratic approximations for solving fixed charge problem (FCTP). Provides a quadratic lower bound for FCTP optimal solution. Experiments with 42 problems provided optimal solutions for 50% of the problems. Provides superior starting conditions for any established algorithm to accelerate convergence. Comparative study of the quadratic lower bound to the square-root lower bound.

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

transportation problem
quadratic approximation
branching method


Locating factors of the infinite Fibonacci word Let tau = (root 5 - 1)/2. Let a, b be two distinct letters. The infinite Fibonacci word is the infinite word G = babbababbabbababbababbabba... whose nth letter is a (resp., b) if [(n + 1)tau] - [n tau] = 0 (resp., 1). For a factor w of G, the location of w is the set of all positions in G at which w occurs. Only the locations of the following factors of G are already known: squares, singular words and those factors of G whose lengths are Fibonacci numbers. The purpose of this paper is to determine the locations of all factors of G. Our results contain all the known ones as consequences. Moreover, using our results, we are able to identify any factor of G whenever its starting position and length are given; also we are able to tell whether two suffixes of G have a common prefix of a certain length. (c) 2005 Elsevier B.V. All rights reserved.

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


A QUANTITATIVE VERSION OF THE GIBBARD-SATTERTHWAITE THEOREM FOR THREE ALTERNATIVES The Gibbard-Satterthwaite theorem states that every nondictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random manipulation by a single random voter will succeed with a nonnegligible probability for any election rule among three alternatives that is far from being a dictatorship and from having only two alternatives in its range.

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

gibbard-satterthwaite theorem
arrow theorem
algorithmic game theory


statistical transliteration for english-arabic cross language information retrieval Out of vocabulary (OOV) words are problematic for cross language information retrieval. One way to deal with OOV words when the two languages have different alphabets, is to transliterate the unknown words, that is, to render them in the orthography of the second language. In the present study, we present a simple statistical technique to train an English to Arabic transliteration model from pairs of names. We call this a selected n-gram model because a two-stage training procedure first learns which n-gram segments should be added to the unigram inventory for the source language, and then a second stage learns the translation model over this inventory. This technique requires no heuristics or linguistic knowledge of either language. We evaluate the statistically-trained model and a simpler hand-crafted model on a test set of named entities from the Arabic AFP corpus and demonstrate that they perform better than two online translation sources. We also explore the effectiveness of these systems on the TREC 2002 cross language IR task. We find that transliteration either of OOV named entities or of all OOV words is an effective approach for cross language IR.

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

training
translation
task
systems
statistical transliteration
test
language
demonstrate
heuristics
knowledge
model
named entities
online
information retrieval

statistics
out of vocabulary words
rendering
cross language information retrieval
segmentation
linguistics
effect
evaluation
exploration


NEPER: a multiple strategy wheat expert system This paper presents a methodology for developing a strategic Expert System for wheat crop production, which has been developed using a Multiple Design approach. This Expert System consists of six subsystems; namely, variety selection, land preparation, sowing, irrigation, fertilization, and harvest. These subsystems exchange data between them through a common database. Each subsystem advises wheat growers on the corresponding plan(s), comprising a set of agricultural/chemical operations before or during the growing season. Applying an appropriate plan reduces risk to farmers from having a problem during the growing season. The system was verified, validated, and, tested in the field. Beneficial economic and environmental impacts have been demonstrated.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 system
hierarchical system
hierarchical structure
hierarchical intelligence


Reduced-cost microwave filter modeling using a two-stage Gaussian process regression approach A technique for the reduced-cost modeling of microwave filters is presented. Our approach exploits variable-fidelity electromagnetic (EM) simulations, and Gaussian process regression (GPR) carried out in two stages. In the first stage of the modeling process, a mapping between EM simulation filter models of low and high fidelity is established. The mapping is subsequently used in the second stage, making it possible for the final surrogate model to be constructed from training data obtained using only a fraction of the number of high-fidelity simulations normally required. As demonstrated using three examples of microstrip filters, the proposed technique allows us to reduce substantially (by up to 80%) the central processing unit (CPU) cost of the filter model setup, as compared to conventional (single-stage) GPRthe benchmark modeling method in this study. This is achieved without degrading the model generalization capability. The reliability of the two-stage modeling method is demonstrated through the successful application of the surrogates to surrogate-based filter design optimization. 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:453462, 2015.

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

gaussian processes
surrogate modeling
electromagnetic simulation
computer-aided design


Artificial neural network software for real-time estimation of olive oil qualitative parameters during continuous extraction This work provides a software based on the combination of a artificial neural network (ANN) approach and a numerical method (called refining algorithm) for the estimation of the acidity level and of peroxides number of olive oil extracted by a continuous extraction process. The estimation is achieved through the measurement of some agronomical and technological parameters commonly measured by the technicians working at the oil mills. The ANN based approach is able to perform a rough prediction of the two parameters; this prediction is then refined by means of the numerical approach. The devised software, developed using a database of experimental data collected in the years 19972004 in the Tuscany Region (Italy), is able to estimate the two parameters during the continuous oil extraction, thus allowing a real-time control of the oil quality during the extraction process. The experimental data are related to different kinds of extraction systems: the data collected before 2003 are mainly referred to three phases decanting while the one collected in years 20032004, are referred to a two phases decanter. The goal of this approach is to build up a fast and reliable quality control without performing the standard laboratory analysis. The results of the estimation achieved by the ANN based system are compared with the results of the chemical analyses carried out by Florence Commerce Chamber Laboratorio Chimico MerceologicoAzienda Speciale CCIAA di Firenze according in force to European Union Rules standards. The mean error in estimation of the parameters with the combination of the ANN approach and the refining algorithm, in comparison with the standard chemical analysis, is in the range 68% for an oil extraction with a three phases decanting system and about 67% for an oil extraction with a two phases decanting system. The maximum error affecting the method (ANN+Refining) described in this work is about 15% for the first case and about 11% for the second one. The system developed in the present work is actually running on the oil mill TEM Toscana Enologica Mori of Florence, Italy. The present work has been financed by the Tuscany Regional Agricultural Development and Innovation Office (ARSIA: Azienda Regionale per lo Sviluppo e lInnovazione dellAgricoltura) and is a part of a 3-year project whose objective is to create an entirely software+hardware controlled oil mill.

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

olive oil
peroxides number
artificial neural network

olive oil acidity level
olive oil centrifugal process


Mobile decision support for in-store purchase decisions Consumer decision making is a well-known application domain for decision support systems. Emerging from this domain is support for consumers on the go, when they are actually inside a retail store. This paper introduces a product attractiveness cue as a way of delivering decision support in this context. The paper also provides an experiment to examine the effectiveness of these cues in a laboratory environment. On the basis of these results (N=86), the attractiveness cue was shown effective in improving the consideration set quality of the participants. This effect was stable across treatments with 10 and 20 products.

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

decision support systems
consumer decision making
product attractiveness cue


Identification of adenine nucleotide translocase 4 inhibitors by molecular docking ANT4 is a germ cell specific ATP transporter in mitochondria. ANT4 is required for spermatogenesis and male fertility. ANT4 has uniquely conserved structure which is different from somatic isoforms. Molecular docking identified a compound inhibiting ANT4 with modest selectivity. The study provides a basis for developing novel male contraceptives.

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

adenine nucleotide translocase
ant4
molecular docking


Selective Progesterone Receptor Modulators (SPRMs) Endometriosis, the presence of endometrial tissue outside the uterus, is a progressive, estrogen-dependent disease and occurs nearly exclusively in menstruating women of reproductive age. Pain syndrome, however, represents the major clinical problem of this disease, manifested as dysmenorrhea, pelvic pain, lower abdominal pain, and dyspareunia. The manifestation of the disease, that is, the pain syndrome, rather than the disease itself currently represents the major indication for both the medical and surgical therapies of endometriosis. The major drawbacks of current medical therapies of endometriosis are sometimes severe side effects. In this review, selective progesterone receptor modulators (SPRMs, mesoprogestins) as a potential therapeutic concept in endometriosis are discussed. Due to endometrial selectivity and favorable pharmacological profile, SPRMs may have advantages over the current medical treatments of this disease. Other emerging therapeutic approaches for this disease are also mentioned.

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


Delay-range-dependent robust stabilisation and H-infinity control for nonlinear uncertain stochastic fuzzy systems with mode-dependent time delays and Markovian jump parameters This article focuses on the problems of robust stabilisation and H-infinity control for nonlinear uncertain stochastic systems with mode-dependent time delay and Markovian jump parameters represented by the Takagi-Sugeno (T-S) fuzzy model approach. The system under consideration involves parameter uncertainties, Ito-type stochastic disturbances, Markovian jump parameters and unknown nonlinear disturbances. The purpose is to design a state feedback controller such that the closed-loop system is robustly exponentially stable in the mean square and satisfies a prescribed H-infinity performance level. Novel delay-range-dependent conditions in the form of linear matrix inequalities (LMIs) are derived for the solvability of robust stabilisation and H-infinity control problem. A desired fuzzy controller can be constructed by solving a set solutions of LMIs and can be easily calculated by Matlab LMI control toolbox. Finally, a numerical example is presented to illustrate the proposed method.

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

stochastic fuzzy systems
markovian jump parameters

robust h-infinity control
mode-dependent delays
linear matrix inequalities (lmis)


simple heuristics and ptass for intersection graphs in wireless ad hoc networks In wireless ad hoc networks, each wireless device has a transmission range, which is usually modeled as a disk centered at this node. A wireless node can send message directly to all nodes lying inside this disk. We present several intersection graphs to model the wireless networks. Then we present some simple heuristics and/or PTASs to approximate the maximum independent set, the minimum vertex cover and the minimum graph coloring in these graph models.

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

wireless networks
wireless
intersection
independent set
graph models
device
message
graph
heuristics
model
vertex cover

vertex coloring
approximation
wireless ad hoc networks
ptas
disk graphs
graph coloring


Galerkin technique based on beam functions in application to the parametric instability of thermal convection in a vertical slot A Fourier-Galerkin spectral technique for solving coupled higher-order initial-boundary value problems is developed. Conjugated systems arising in thermoconvection that involve both equations of fourth and second spatial orders are considered. The set of so-called beam functions is used as basis together with the harmonic functions. The necessary formulas for expressing each basis system into series with respect to the other are derived. The convergence rate of the spectral solution series is thoroughly investigated and shown to be fifth-order algebraic for both linear and nonlinear problems. Though algebraic, the fifth-order rate of convergence is fully adequate for the generic problems under consideration, which makes the new technique a useful tool in numerical approaches to convective problems. An algorithm is created for the implementation of the method and the results are thoroughly tested and verified on different model examples. The spatial and temporal approximation of the scheme is tested. To further validate the scheme, a singular asymptotic expansion is derived for small values of the modulation frequency and amplitude and the numerical and analytic results are found to be in good agreement. The new technique is applied to the G-jitter flow, and the Floquet stability diagrams are produced. We obtain the expected alternating isochronous and subharmonic branches and find that stable motions are always isochronous while unstable motions can be either isochronous or subharmonic. The numerical investigation also leads to novel conclusions regarding the dependence of the amplitude of the solutions on some of the governing parameters. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

spectral methods
natural convection
singular perturbation expansion
g-jitter


The effects of quantum dot coverage in InAs/(In)GaAs nanostructures for long wavelength emission We present a study on the effects of quantum dot coverage on the properties of InAs dots embedded in GaAs and in metamorphic In0.15Ga0.85As confining layers grown by molecular beam epitaxy on GaAs substrates. We show that redshifted emission wavelengths exceeding 1.3?m at room temperature were obtained by the combined use of InGaAs confining layers and high quantum dot coverage. The use of high InAs coverage, however, leads to detrimental effects on the optical and electrical properties of the structures. We relate such behaviour to the formation of extended structural defects originating from relaxed large-sized quantum dots that nucleate in accordance to thermodynamic equilibrium theories predicting the quantum dot ripening. The effect of the reduced lattice-mismatch of InGaAs metamorphic layers on quantum dot ripening is discussed in comparison with the InAs/GaAs system.

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

quantum dots
long wavelength emission
molecular beam epitaxy
quantum dot ripening


NONLINEAR PHENOMENA IN DIGITAL NETWORKS The paper is devoted to the analysis of queueing systems in the context of the network and communications theory. We investigate a theorem on the law of the iterated logarithm for a queue of customers in an open queueing network and its applications to the mathematical models of the Negative ACKnowledgement and Internet systems.

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

open queueing network
queue of customers
law of the iterated logarithm


Checking of conceptual models with integrity constraints Due to the raising level of abstraction in information systems development many activities of this process are migrating to its early phases. The same is true for testing - modern CASE tools are undertaking validation of software models. In this paper the methodology for checking of conceptual models is proposed as the step-wise process during which model elements including integrity constraints are progressively checked for their adequacy to values of objects, their relationships and constraints of the corresponding problem domain. The checking process is associated with the particular methodology for development of ordered and precise conceptual models (OPCM), which brings improvements to their quality: conformity to normal forms and ontological foundations, and to the observed reality. The rules for checking of integrity constraints are proposed on the base of taxonomy created in the result of analysis of the most promising methods for conceptual modelling.

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

conceptual model
integrity constraint
ordering
entity
uml
ocl


revealing relationships in search engine results The amount of information available in the Internet is so vast that finding the desired information in such an unstructured repository easily becomes a tedious task. Graphical cluster-based representations of results from search engines shift the user's mental load from slower thought-intensive processes of reading information got from linear lists of results to faster perceptual processes such as pattern recognition in a visual display. In this paper we investigate the subject by presenting the design proposal of a new system that uses concepts of Information Visualization to help the user of Internet search engines to identify the group of documents that are related to the needed information by examining or browsing documents in the group. Some results of preliminary usability tests for the system are also provided shedding some light to the subject.

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

search engine results
information visualization

query results visualization
world wide web


Parameter tuning, feature selection and weight assignment of features for case-based reasoning by artificial immune system Case-based reasoning (CBR), a popular problem solving methodology in data mining, solves new problems by analyzing solutions for similar past problems. The many advantages of CBR include rapid learning, the ability to use numerous unrestricted domains, minimal knowledge requirements, and effective presentation of knowledge. However, a major difficulty when applying CBR algorithms is selection of appropriate parameter values, features and weight assignment of features, to avoid constructing poor models. Unfortunately, key CBR parameters, beneficial features and the weight assignment of features vary across different problems. This study developed an efficient CBR approach based on artificial immune system algorithm (AISCBR) to increase classification accuracy by improving parameter tuning, feature selection and weight assignment of features. The proposed approach was then compared with those of other studies using the same University of California, Irvine (UCI) data sets. The experimental results showed that the AISCBR can provide better performance than other existing methods, because higher classification accurate rates can be obtained.

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

artificial immune system algorithm
parameter tuning
feature selection
weight assignment


Articulated mesh animation from multi-view silhouettes Details in mesh animations are difficult to generate but they have great impact on visual quality. In this work, we demonstrate a practical software system for capturing such details from multi-view video recordings. Given a stream of synchronized video images that record a human performance from multiple viewpoints and an articulated template of the performer, our system captures the motion of both the skeleton and the shape. The output mesh animation is enhanced with the details observed in the image silhouettes. For example, a performance in casual loose-fitting clothes will generate mesh animations with flowing garment motions. We accomplish this with a fast pose tracking method followed by nonrigid deformation of the template to fit the silhouettes. The entire process takes less than sixteen seconds per frame and requires no markers or texture cues. Captured meshes are in full correspondence making them readily usable for editing operations including texturing, deformation transfer, and deformation model learning.

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


Data augmentation: an alternative approach to the analysis of spectroscopic data The need for inferential models capable of accurately predicting product qualities has never been greater than it is today in the chemical process industry. However, due to production Limitations and the need to reduce costs, obtaining sufficient relevant data to enable accurate and robust calibration models to be derived is a major challenge. This is due to the intrinsic sparsity of the process data resulting from the small number of objects available, e.g., batches, compared with the large number of process variables (wavelengths) measured. This paper examines a method of applying Partial Least Squares (PLS) to a database, which has been enhanced through the addition of Gaussian noise to the original data, for the development of a robust calibration model. The addition of Gaussian noise to the process variables alone has been shown to lead to a decrease in the error of the predictor as a consequence of the increase in the data density. (C) 1998 Elsevier Science B.V. All rights reserved.

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

data augmentation
partial least squares
gaussian noise


Randomness testing of non-cryptographic hash functions for real-time hash table based storage and look-up of URLs Non-cryptographic hash functions have been investigated to identify their pseudo-random nature when employed in the implementation of hash tables for real-time storage and look-up of uniform resource locators. Statistical studies have been performed on the sequences generated using five widely used non-cryptographic hash functions: (1) CRC, (2) Adler, (3) DJBX33A, (4) FNV, and (5) Murmur. The comparative analysis of tested non-cryptographic hash functions shows that the Adler hash function is not suitable for hash table implementation, whereas, the rest of non-cryptographic hash functions exhibit similar and better randomizing features which make them an attractive choice for hash table implementation.

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

non-cryptographic hash functions
randomization functions
statistical analysis


Robust fuzzy clustering of relational data Popular relational-data clustering algorithms, relational dual of fuzzy c-means (RFCM), non-Euclidean RFCM (NERFCM) (both by Hathaway et al), and FANNY (by Kaufman and Rousseeuw) are examined. A new algorithm, which is a generalization of FANNY, called the fuzzy relational data clustering (FRC algorithm, is introduced, having an identical objective functional as RFCM. However, the FRC does not have the restriction of RFCM, which is that the relational data is derived from Euclidean distance as the measure of dissimilarity between the objects, and it also does not have limitations of FANNY, including the use of a fixed membership exponent, or a fuzzifier exponent, m. The FRC algorithm is further improved by incorporating the concept of Dave's object data noise clustering (NC algorithm, done by proposing a concept of noise-dissimilarity. Next, based on the constrained minimization, which includes an inequality constraint for the memberships and corresponding Kuhn-Tucker conditions, a noise resistant, FRC algorithm is derived which works well for all types of non-Euclidean dissimilarity data. Thus it is shown that the extra computations for data expansion (beta-spread transformation) required by the NERFCM algorithm are not necessary. This new algorithm is called robust non-Euclidean fuzzy relational data clustering (robust-NE-FRC), and its robustness is demonstrated through several numerical examples. Advantages of this new algorithm are: faster convergence, robustness against outliers, and ability to handle all kinds of relational data, including non-Euclidean. The paper also presents a new and better interpretation of the noise-class.

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

relational data classification
robust clustering


some examples of the use of function-producing functions Examples of the technique of defining and using function-producing functions are given in order to demonstrate certain simple but powerful programming methods.

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


Behavior of viscous solutions in Lagrangian formulation In this paper, the behavior of shock-capturing methods in Lagrangian coordinate is investigated. The relation between viscous shock and inviscid one is analyzed quantitatively, and the procedure of a viscous shock formation and propagation with a jump type initial data is described. In general, a viscous shock profile and a discontinuous one include different energy and momentum, and these discrepancies result in the generation of waves in all families when a single wave Riemann problem (shock or rarefaction) is solved. Employing this method, some anomalous behavior, such as, viscous shock interaction, shock passing through ununiform grids, postshock oscillations and lower density phenomenon is explained well. Using some classical schemes to solve the inviscid flow in Lagrangian coordinate may be not adequate enough to correctly describe flow motion in the discretized space. Partial discrepancies between von Neumann artificial viscosity method and Godunov method are exhibited. Some reviews are given to those methods which can ameliorate even eliminate entropy errors. A hybrid scheme based on the understanding to the behavior of viscous solution is proposed to suppress the overheating error.

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

lagrangian coordinate
overheating
viscosity


Code Generation: A Strategy for Neural Network Simulators We demonstrate a technique for the design of neural network simulation software, runtime code generation. This technique can be used to give the user complete flexibility in specifying the mathematical model for their simulation in a high level way, along with the speed of code written in a low level language such as C+?+. It can also be used to write code only once but target different hardware platforms, including inexpensive high performance graphics processing units (GPUs). Code generation can be naturally combined with computer algebra systems to provide further simplification and optimisation of the generated code. The technique is quite general and could be applied to any simulation package. We demonstrate it with the Brian simulator (http://?www.?briansimulator.?org).

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

code generation
simulation
graphics processing units
computer algebra systems

spiking neural networks
numerical integration
python
c+?+


A bat-neural network multi-agent system (BNNMAS) for stock price prediction: Case study of DAX stock price Creating an intelligent system that can accurately predict stock price in a robust way has always been a subject of great interest for many investors and financial analysts. Predicting future trends of financial markets is more remarkable these days especially after the recent global financial crisis. So traders who access to a powerful engine for extracting helpful information throw raw data can meet the success. In this paper we propose a new intelligent model in a multi-agent framework called bat-neural network multi-agent system (BNNMAS) to predict stock price. The model performs in a four layer multi-agent framework to predict eight years of DAX stock price in quarterly periods. The capability of BNNMAS is evaluated by applying both on fundamental and technical DAX stock price data and comparing the outcomes with the results of other methods such as genetic algorithm neural network (GANN) and some standard models like generalized regression neural network (GRNN), etc. The model tested for predicting DAX stock price a period of time that global financial crisis was faced to economics. The results show that BNNMAS significantly performs accurate and reliable, so it can be considered as a suitable tool for predicting stock price specially in a long term periods.

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

bat algorithm
artificial neural network
multi-agent system
fundamental analysis


A spectral/B-spline method for the NavierStokes equations in unbounded domains The numerical method presented in this paper aims at solving the incompressible NavierStokes equations in unbounded domains. The problem is formulated in cylindrical coordinates and the method is based on a Galerkin approximation scheme that makes use of vector expansions that exactly satisfy the continuity constraint. More specifically, the divergence-free basis vector functions are constructed with Fourier expansions in the ? and z directions while mapped B-splines are used in the semi-infinite radial direction. Special care has been taken to account for the particular analytical behaviors at both end points r=0 and r??. A modal reduction algorithm has also been implemented in the azimuthal direction, allowing for a relaxation of the CFL constraint on the timestep size and a possibly significant reduction of the number of DOF. The time marching is carried out using a mixed quasi-third order scheme. Besides the advantages of a divergence-free formulation and a quasi-spectral convergence, the local character of the B-splines allows for a great flexibility in node positioning while keeping narrow bandwidth matrices. Numerical tests show that the present method compares advantageously with other similar methodologies using purely global expansions.

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

navierstokes equations
unbounded domains

spectral methods
b-splines
divergence-free vector expansions


The method of fundamental solutions for layered elastic materials In this paper, we investigate the application of the method of fundamental solutions to two-dimensional elasticity problems in isotropic and anisotropic single materials and bimaterials. A domain decomposition technique is employed in the bimaterial case where the interface continuity conditions are approximated in the same manner as the boundary conditions. The method is tested on several test problems and its relative merits and disadvantages are discussed.

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

method of fundamental solutions
elasticity


The 3G transition: Changes in the US wireless industry The transition of the wireless industry from second generation (2G) to third generation (3G) is more than a simple technology upgrade. The industry's service profile will move far beyond telephony and services will converge with the computing and content sectors. This will bring many more players into this already huge industry. Thus the transition to 3G needs to be regarded as a major economic transformation as it requires a major reconfiguration of the existing value networks. Standards have traditionally been essential in the success of wireless services and will play an increasingly critical role in the future. Due to the on-going transition, wireless standardization has changed considerablyreflecting changes in the configuration of the value network. While the number of major air-interface standards has been reduced to just two, the overall number of standards bodies has increased by almost an order of magnitude while the number and scope of interfaces being standardized has grown at a breathtaking pace. This growth reflects the need to support the industry's new coordination requirements at critical interfaces in the value network. At the same time, the importance of the traditional standards development organizations (SDOs) has diminished as more nimble industry consortia have taken over the main responsibilities for standardization. The major standardization battlegrounds have shifted up the protocol stack to the service enabler level. In addition, the manufacture of handsets and other mobile communication devices is transitioning to a more horizontal industry structure. These changes, along with changes in the way value is extracted from new services and their influence on the reconfiguration of the industry are discussed.

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


fault localization using visualization of test information Attempts to reduce the number of delivered faults in softwareare estimated to consume 50\% to 80\% of the developmentand maintenance effort [3]. Among the tasks requiredto reduce the number of delivered faults, debugging is oneof the most time-consuming [2, 12], and locating the errorsis the most dif.cult component of this debugging task (e.g.,[13]). Clearly, techniques that can reduce the time requiredto locate faults can have a signi.cant impact on the cost andquality of software development and maintenance.

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

task
visualization
test
software development
maintenance
fault
cost
debugging
component

locatability
and program analysis techniques
testing information
timing
fault localization
informal


document annotation and ontology population from linguistic extractions In this paper, we present a workbench for semi-automatic ontology population from textual documents. It provides an environment for mapping the linguistic extractions with the domain ontology thanks to knowledge acquisition rules. Those rules are activated when a pertinent linguistic tag is reached. Those linguistic tags are then mapped to a concept, one of its attributes or even a semantic relation between several concepts. The rules instantiate these concepts, attributes and relations in the knowledge base constrained by the domain ontology. This paper deals with the underlying knowledge capture process and presents the first experiments realized on a real client application from the legal publishing domain.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 extraction from text
method for ontology population
knowledge acquisition tool
knowledge capture for the semantic web
semantic web


BeWell: Sensing Sleep, Physical Activities and Social Interactions to Promote Wellbeing Smartphone sensing and persuasive feedback design is enabling a new generation of wellbeing apps capable of automatically monitoring multiple aspects of physical and mental health. In this article, we present BeWell+ the next generation of the BeWell smartphone wellbeing app, which monitors user behavior along three health dimensions, namely sleep, physical activity, and social interaction. BeWell promotes improved behavioral patterns via feedback rendered as an ambient display on the smartphones wallpaper. With BeWell+, we introduce new mechanisms to address key limitations of the original BeWell app; specifically, (1) community adaptive wellbeing feedback, which generalizes to diverse user communities (e.g., elderly, children) by promoting better behavior yet remains realistic to the users lifestyle; and, (2) wellbeing adaptive energy allocation, which prioritizes monitoring fidelity and feedback responsiveness on specific health dimensions (e.g., sleep) where the user needs additional help. We evaluate BeWell+ with a 27 person, 19 day field trial. Our findings show that not only can BeWell+ operate successfully on consumer smartphones; but also users understand feedback and respond by taking steps towards leading healthier lifestyles.

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


Region-based segmentation of 2D and 3D images with tissue-like P systems Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform computations by applying a finite set of rules in a synchronous, maximally parallel way. In this paper, we develop a variant of P-system, called tissue-like P system in order to design in this computational setting, a region-based segmentation algorithm of 2D pixel-based and 3D voxel-based digital images. Concretely, we use 4-adjacency neighborhood relation between pixels in 2D and 6-adjacency neighborhood relation between voxel in 3D for segmenting digital images in a constant number of steps. Finally, specific software is used to check the validity of these systems with some simple examples.

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

digital image
region-based segmentation
digital topology


Multi-view Laplacian twin support vector machines Twin support vector machines are a recently proposed learning method for pattern classification. They learn two hyperplanes rather than one as in usual support vector machines and often bring performance improvements. Semi-supervised learning has attracted great attention in machine learning in the last decade. Laplacian support vector machines and Laplacian twin support vector machines have been proposed in the semi-supervised learning framework. In this paper, inspired by the recent success of multi-view learning we propose multi-view Laplacian twin support vector machines, whose dual optimization problems are quadratic programming problems. We further extend them to kernel multi-view Laplacian twin support vector machines. Experimental results demonstrate that our proposed methods are effective.

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

twin support vector machines
laplacian support vector machines

laplacian twin support vector machines
semi-supervised learning
multi-view learning


Building a data-mining grid for multiple human brain data analysis E-science is about global collaboration in key areas of science such as cognitive science and brain science, and the next generation of infrastructure such as the Wisdom Web and Knowledge Grids. As a case study, we investigate human multiperception mechanism by cooperatively using various psychological experiments, physiological measurements, and data mining techniques for developing artificial systems which match human ability in specific aspects. In particular, we observe fMRI (functional magnetic resonance imaging) and EEG (electroencephalogram) brain activations from the viewpoint of peculiarity oriented mining and propose a way of peculiarity oriented mining for knowledge discovery in multiple human brain data. Based on such experience and needs, we concentrate on the architectural aspect of a brain-informatics portal from the perspective of the Wisdom Web and Knowledge Grids. We describe how to build a data-mining grid on the Wisdom Web for multiaspect human brain data analysis. The proposed methodology attempts to change the perspective of cognitive scientists from a single type of experimental data analysis toward a holistic view at a long-term, global field of vision.

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

the wisdom web
peculiarity oriented mining
multiaspect human brain data analysis

the data-mining grid
brain-informatics portals


Self-organization of shift-invariant receptive fields This paper proposes a new learning rule by which cells with shift-invariant receptive fields are self-organized. With this learning rule, cells similar to simple and complex cells in the primary visual cortex are generated in a network. To demonstrate the new learning rule, we simulate a three-layered network that consists of an input layer (or the retina), a layer of S-cells (or simple cells), and a layer of C-cells (or complex cells). During the learning, straight lines of various orientations sweep across the input layer. Here both S- and C-cells are created through competition. Although S-cells compete depending on their instantaneous outputs, C-cells compete depending on the traces (or temporal averages) of their outputs. For the self-organization of S-cells, only winner S-cells increase their input connections in a similar way to that for the neocognitron. In other words, the winner S-cells have LTP (long term potentiation) in their input connections. For the self-organization of C-cells, however, loser C-cells decrease their input connections (LTD=long term depression), while winners increase their input connections (LTP). Here both S- and C-cells are accompanied by inhibitory cells. Modification of inhibitory connections together with excitatory connections is important for creation of C-cells as well as S-cells.

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

shift-invariant receptive field
self-organization
competitive learning
neural network model
visual system
complex and simple cells


Local-in-time adjoint-based method for design optimization of unsteady flows We present a new local-in-time discrete adjoint-based methodology for solving design optimization problems arising in unsteady aerodynamic applications. The new methodology circumvents storage requirements associated with the straightforward implementation of a global adjoint-based optimization method that stores the entire flow solution history for all time levels. This storage cost may quickly become prohibitive for large-scale applications. The key idea of the local-in-time method is to divide the entire time interval into several subintervals and to approximate the solution of the unsteady adjoint equations and the sensitivity derivative as a combination of the corresponding local quantities computed on each time subinterval. Since each subinterval contains relatively few time levels, the storage cost of the local-in-time method is much lower than that of the global methods, thus making the time-dependent adjoint optimization feasible for practical applications. Another attractive feature of the new technique is that the converged solution obtained with the local-in-time method is a local extremum of the original optimization problem. The new method carries no computational overhead as compared with the global implementation of adjoint-based methods. The paper presents a detailed comparison of the global- and local-in-time adjoint-based methods for design optimization problems governed by the unsteady compressible 2-D Euler equations.

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

time-dependent optimization
discrete adjoint equations
gradient methods


Receptor recognition mechanism of human influenza A H1N1 (1918), avian influenza A H5N1 (2004), and pandemic H1N1 (2009) neuraminidase Influenza A neuraminidase (NA) is a target for anti-influenza drugs. The function of this enzyme is to cleave a glycosidic linkage of a host cell receptor that links sialic acid (Sia) to galactose (Gal), to allow the virus to leave an infected cell and propagate. The receptor is an oligosaccharide on the host cell surface. There are two types of oligosaccharide receptor; the first, which is found mainly on avian epithelial cell surfaces, links Sia with Gal by an alpha 2,3 glycosidic linkage; in the second, found mainly on human epithelial cell surfaces, linkage is via an alpha 2,6 linkage. Some researchers believe that NAs from different viruses show selectivity for each type of linkage, but there is limited information available to confirm this hypothesis. To see if the linkage type is more specific to any particular NA, a number of NA-receptor complexes of human influenza A H1N1 (1918), avian influenza A H5N1 (2004), and a pandemic strain of H1N1 (2009) were constructed using homology modeling and molecular dynamics simulation. The results show that the two types of receptor analogues bound to NAs use different mechanisms. Moreover, it was found that a residue unique to avian virus NA is responsible for the recognition of the Sia alpha 2,3Gal receptor, and a residue unique to human virus NA is responsible for the recognition of Sia alpha 2,6Gal. We believe that this finding could explain how NAs of different virus origins always possess some unique residues.

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

avian influenza
neuraminidase
molecular dynamics
glycosidic linkage
cell receptor

hemagglutinin
binding mechanism
molecular recognition


New Results on Noncommutative and Commutative Polynomial Identity Testing Using ideas from automata theory, we design the first polynomial deterministic identity testing algorithm for the sparse noncommutative polynomial identity testing problem. Given a noncommuting black-box polynomial f is an element of F{x(1),...,x(n)} of degree d with at most t monomials, where the variables x(i) are noncommuting, we give a deterministic polynomial identity test that checks if C equivalent to 0 and runs in time polynomial in d, n, vertical bar C vertical bar, and t. Our algorithm evaluates the black-box polynomial for x(i) assigned to matrices over F and, in fact, reconstructs the entire polynomial f in time polynomial in n, d and t. We apply this idea also to the reconstruction of black-box noncommuting algebraic branching programs (considered by Nisan (1995) and Raz and Shpilka (2005)) and obtain some results and connections to the problem of exact learning of noncommuting ABPs. Finally, we turn to commutative identity testing and explore the complexity of the problem when the coefficients of the input polynomial come from an arbitrary finite commutative ring with unity whose elements are uniformly encoded as strings and the ring operations are given by an oracle. We show that several algorithmic results for polynomial identity testing over fields also hold when the coefficients come from such finite rings.

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

polynomial identity testing
automata theory


changes to jflap to increase its use in courses JFLAP is software for experimenting with formal languages and automata theory. In this Tips and Techniques session we describe the recent changes to JFLAP to make it more usable in an automata theory course.

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


Steno: Automatic Optimization of Declarative Queries Declarative queries enable programmers to write data manipulation code without being aware of the underlying data structure implementation. By increasing the level of abstraction over imperative code, they improve program readability and, crucially, create opportunities for automatic parallelization and optimization. For example, the Language Integrated Query (LINQ) extensions to C# allow the same declarative query to process in-memory collections, and datasets that are distributed across a compute cluster. However, our experiments show that the serial performance of declarative code is several times slower than the equivalent hand-optimized code, because it is implemented using run-time abstractions-such as iterators-that incur overhead due to virtual function calls and superfluous instructions. To address this problem, we have developed Steno, which uses a combination of novel and well-known techniques to generate code for declarative queries that is almost as efficient as hand-optimized code. Steno translates a declarative LINQ query into type-specialized, inlined and loop-based imperative code. It eliminates chains of iterators from query execution, and optimizes nested queries. We have implemented Steno for uniprocessor, multiprocessor and distributed computing platforms, and show that, for a real-world distributed job, it can almost double the speed of end-to-end execution.

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

design
query optimization
abstract machines


basis function construction for hierarchical reinforcement learning Much past work on solving Markov decision processes (MDPs) using reinforcement learning (RL) has relied on combining parameter estimation methods with hand-designed function approximation architectures for representing value functions. Recently, there has been growing interest in a broader framework that combines representation discovery and control learning, where value functions are approximated using a linear combination of task-dependent basis functions learned during the course of solving a particular MDP. This paper introduces an approach to automatic basis function construction for hierarchical reinforcement learning (HRL). Our approach generalizes past work on basis construction to multi-level action hierarchies by forming a compressed representation of a semi-Markov decision process (SMDP) at multiple levels of temporal abstraction. The specific approach is based on hierarchical spectral analysis of graphs induced on an SMDP's state space from sample trajectories. We present experimental results on benchmark SMDPs, showing significant speedups when compared to hand-designed approximation architectures.

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

hierarchical reinforcement learning
representation discovery


Discovering simulation models Process mining is a tool to extract non-trivial and useful information from process execution logs. These so-called event logs (also called audit trails, or transaction logs) are the starting point for various discovery and analysis techniques that help to gain insight into certain characteristics of the process. In this paper we use a combination of process mining techniques to discover multiple perspectives (namely, the control-flow, data, performance, and resource perspective) of the process from historic data, and we integrate them into a comprehensive simulation model. This simulation model is represented as a colored Petri net (CPN) and can be used to analyze the process, e.g., evaluate the performance of different alternative designs. The discovery of simulation models is explained using a running example. Moreover, the approach has been applied in two case studies; the workflows in two different municipalities in the Netherlands have been analyzed using a combination of process mining and simulation. Furthermore, the quality of the CPN models generated for the running example and the two case studies has been evaluated by comparing the original logs with the logs of the generated models.

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


Geomorphometric landscape analysis using a semi-automated GIS-approach This paper presents LANDFORM, a customized GIS application for semi-automated classification of landform elements, based on topographic attributes like curvature or elevation percentile. These parameters are derived from a Digital Elevation Model (DEM) and used as thresholds for the classification of landform elements like crests, flats, depressions and slopes. With a new method, slopes were further subdivided into upper, mid and lower slopes at significant breakpoints along slope profiles. The paper discusses the results of a fuzzy set algorithm used to compare the similarity between the map generated by LANDFORM and the visual photo-interpretation conducted by a soil expert over the same area. The classification results can be used in applications related to precision agriculture, land degradation studies, and spatial modelling applications where landscape morphometry is identified as an influential factor in the processes under study.

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

landscape analysis
landform
gis
spatial modelling

terrain analysis
geomorphometry
terrain attributes


Variance swap with mean reversion, multifactor stochastic volatility and jumps Consider the asset dynamics with mean reversion, multi-factor volatility and jumps. We derive the multivariate characteristic function of log-asset values at different discrete time points. We derive closed-form solutions to various types of discrete variance swaps. Numerical examples confirm the accuracy and efficiency of the solution. Empirical study shows that the second volatility factor is significant to variance swaps.

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

pricing
multi-factor stochastic volatility
jump diffusion


Sequential data assimilation with multiple models Data assimilation is an essential tool for predicting the behavior of real physical systems given approximate simulation models and limited observations. For many complex systems, there may exist several models, each with different properties and predictive capabilities. It is desirable to incorporate multiple models into the assimilation procedure in order to obtain a more accurate prediction of the physics than any model alone can provide. In this paper, we propose a framework for conducting sequential data assimilation with multiple models and sources of data. The assimilated solution is a linear combination of all model predictions and data. One notable feature is that the combination takes the most general form with matrix weights. By doing so the method can readily utilize different weights in different sections of the solution state vectors, allow the models and data to have different dimensions, and deal with the case of a singular state covariance. We prove that the proposed assimilation method, termed direct assimilation, minimizes a variational functional, a generalized version of the one used in the classical Kalman filter. We also propose an efficient iterative assimilation method that assimilates two models at a time until all models and data are assimilated. The mathematical equivalence of the iterative method and the direct method is established. Numerical examples are presented to demonstrate the effectiveness of the new method.

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

uncertainty quantification
model averaging


Models of Collaboration as the Foundation for Collaboration Technologies Can models of collaboration serve as foundations for development of collaborative technologies in much the same way that engineers use models when developing complex systems? We explore this issue by investigating how eight approaches to understanding or modeling collaboration could be used to improve technologies that support processes used in a large aerospace program. Some modeling approaches are ostensive, defining how collaboration should be achieved or how the technology should be used. These approaches provide ways of documenting, analyzing, simulating, and automating the process. Other approaches are performative, describing actual collaboration behavior and actual technology use. Performative approaches reveal the variability in collaboration and deviations from the intended process. Technologies can benefit from and facilitate both types of modeling approaches by recording collaborative events for later analysis. We conclude by considering ways that modeling collaboration could contribute to requirements analysis, new collaboration capabilities, adoption, and maximizing benefit from technologies.

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

coordination theory
social network models
temporal models
workflow


Branching bisimulation for probabilistic systems: Characteristics and decidability We address the concept of abstraction in the setting of probabilistic reactive systems, and study its formal underpinnings for the strictly alternating model of Hansson. In particular, we define the notion of branching bismilarity and study its properties by studying two other equivalence relations, viz. coloured trace equivalence and branching bisimilarity using maximal probabilities. We show that both alternatives coincide with branching bisimilarity. The alternative characterisations have their own merits and focus on different aspects of branching bisimilarity. Coloured trace equivalence can be understood without knowledge of probability theory and is independent of the notion of a scheduler. Branching bisimilarity, rephrased in terms of maximal probabilities gives rise to an algorithm of polynomial complexity for deciding the equivalence. Together they give a better understanding of branching bisimilarity. Furthermore, we show that the notions of branching bisimilarity in the alternating model of Hansson and in the non-alternating model of Segala differ: branching bisimilarity in the latter setting turns out to discriminate between systems that are intuitively branching bisimilar. (c) 2006 Elsevier B.V. All rights reserved.

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

branching bisimulation
probabilistic systems
alternating model
abstraction


On the hardness of the Consensus String problem Finding the consensus of a given set of strings is a hard and challenging problem. The problem is formally defined as follows: given a set of strings S = {s(1), ... , s(k)} and a constant d, find, if it exists, a string e such that the distance of s* from each of the strings does not exceed d. This problem has many applications. Two examples are: In biology, it may be used to seek a common ancestor to given sections of DNA. In web searching it may be used as a clustering aid. The stringology community researched this problem under the Hamming distance. In that metric the problem is NP-hard. A lot of work has been also done in the Euclidean metric. In this paper we consider the Consensus problem under other string metrics. We show that this problem is NP-hard for the swap metric and APX-hard for the reversal metric. (C) 2013 Elsevier B.V. All rights reserved.

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

consensus
hamming distance
swap
reversal

combinatorial problems
computational complexity


Developmental Pattern of VIP Binding Sites in the Human Hypothalamus We have studied the developmental patterns of vasoactive intestinal polypeptide (VIP) binding sites in the human hypothalamus. VIP recognition sites were widely distributed throughout the rostrocaudal extent of the hypothalamus. VIP binding was generally low in the fetal and neonatal periods and a tendency in increasing densities was observed during postnatal development. The age comparison of binding density indicates variations in several structures. Thus, the densities were higher in older infants in the preoptic area, lamina terminalis, and infundibular (IN) nucleus. These differences suggest the implication of VIP receptors in the development of this brain structure and the maintenance of its various functions

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

vip binding sites
hypothalamus
development
human
fetal and neonatal periods


Almost strictly total positivity of NUAT B-spline basis Total positivity of spline basis has been well known in the theory of computer aided geometry design, which is highly related with good shape preserving property. Almost strictly total positivity is stronger, which could determine the positive minors while the other is zero. In this paper, a geometrical approach is proposed to prove the collection matrices of NUAT B-spline basis are almost strictly totally positive. In this paper, knot insertion algorithm combined with coefficient variation of NUAT B-spline function, we put forward an intuitive and geometrical method.

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

knot insertion algorithm
coefficient variation


Stress history generation for truss bridges using multi-level models A technique is described for the automatic computation of numerical stress histories in the steel truss railway bridges, caused by the passage of pre-defined trains. The 3-D frame of the bridge is combined with finite element method plate/shell sub-models of selected details. The effects of joint rigidity and interaction of structural elements are taken into account by the global model. Joint geometry is introduced by the local sub-models. Connection nodes in the global beam model correspond to the end cross-section centroids of the sub-model. Their displacements are interpreted as imposed deformations on the sub-models. The load cases for the global model simulate the passage of two vertical unit forces along the stringers. The load cases for the sub-model are imposed unit deformations. Combining these, and applying train loads, numerical stress histories are obtained. The method is illustrated by test load results of an existing railway bridge.

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

multi-level models
geometrical stress concentrations
steel bridges
finite element modelling.


Effects of scholar's gender and professional position on publishing productivity in different publication types. Analysis of a Finnish university This paper examines the effects of a scholar's position and gender on publishing productivity in several types of scientific publications: monographs, articles in journals, articles in edited books, and articles in conference proceedings. The data consist of 1,367 scholars who worked at the University of Helsinki, Finland, during the period 2002-2004. The analysis shows that professors are the most productive, PhDs publish more than non-PhDs, and men perform better than women, also when other scholarly characteristics are controlled for. These differences are greater for monographs and articles in edited books than for articles in journals. In terms of conference proceedings, no remarkable productivity differences were found.

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


A new stiffened shell element for geometrically nonlinear analysis of composite laminates A new stiffened shell element combining shallow beam and shallow shell elements is developed for geometrically nonlinear analysis of stiffened composite laminates under mechanical loading. The formulation of this element is based on the principle of virtual displacements in conjunction with the co-rotational form of the total Lagrangian description of motion. In the finite element formulation, both the shell and the beam (stiffener) elements account for transverse shear deformations and material anisotropy. The cross section of the stiffener (beam) can be arbitrary in geometry and lamination. In order to combine the stiffener with the shell element, constraint conditions are applied to the displacement and rotation fields of the stiffener. These constraint conditions ensure that the cross section of the stiffener remains co-planar with the shell section after deformation. The resulting expressions for the displacement and rotation fields of the stiffener involve only the nodal unknowns of the shell element, thus reducing the total number of degrees-of-freedom. Also, the discretization of the entire stiffened shell structure becomes more flexible. The robustness of the stiffened shell element has been proven by comparison against other shell elements considered previously.

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

stiffened shell
finite element
composite
nonlinear


learning to recommend from positive evidence In recent years, many systems and approaches for recommending information, products or other objects have been developed. In these systems, often machine learning methods that need training input to acquire a user interest profile are used. Such methods typically need positive and negative evidence of the user's interests. To obtain both kinds of evidence, many systems make users rate relevant objects explicitly. Others merely observe the user's behavior, which fairly obviously yields positive evidence; in order to be able to apply the standard learning methods, these systems mostly use heuristics that attempt to find also negative evidence in observed behavior. In this paper, we present several approaches to learning interest profiles from positive evidence only, as it is contained in observed user behavior. Thus, both the problem of interrupting the user for ratings and the problem of somewhat artificially determining negative evidence are avoided. The learning approaches were developed and tested in the context of the Web-based ELFI information system. It is in real use by more than 1000 people. We give a brief sketch of ELFI and describe the experiments we made based on ELFI usage logs to evaluate the different proposed methods.

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

order
user behavior
use
input
context
paper
evidence
information system
user
training
machine learning
systems
users
behavior
learning
heuristics
profiles

web-based
adaptive recommendation interfaces
object
standardization
evaluation of methods
experience
relevance
user modeling
informal
evaluation
posit
product
recommendation
method
sketching


Bias and pathology in minimax search This article presents the results of experiments designed to gain insight into the effect of the minimax algorithm on the error of a heuristic evaluation function. Two types of effect of minimax are considered: (a) evaluation accuracy (Are the minimax backed-up values more accurate than the heuristic values themselves?), and (b) decision accuracy (Are moves played by deeper minimax search better than those by shallower search?). The experiments were performed in the King-Rook-King (KRK) chess endgame and in randomly generated game trees. The results show that, counter-intuitively, evaluation accuracy may decline with search depth, whereas at the same time decision accuracy improves with depth. In the article, this is explained by the fact that minimax in combination with a noisy evaluation function introduces a bias into the backed-up evaluations, which masks the evaluation effectiveness of minimax, but this bias still permits decision accuracy to improve with depth. This observed behaviour of minimax in the KRK endgame is discussed in the light of previous studies of pathology in minimax. It is shown that explaining the behaviour of minimax in an actual chess endgame in terms of previously known results requires special care. (c) 2005 Elsevier B.V. All rights reserved.

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

minimax principle
evaluation-function quality
minimax pathology


Analytical determination of firing times in stochastic nonlinear neural models We present for the first time an analytical approach for determining the time of firing of nonlinear stochastic neuronal models. The theory of Markov processes is applied to the FitzhughNagumo system with a constant mean, Gaussian white noise input, representing stochastic excitation and inhibition. An equation obtained for the mean of the time to first spike is solved by means of an accurate one-dimensional approximation. Verification of the method is obtained through the excellent agreement between the moments of the firing time found by numerical solution of differential equations and those obtained by simulation of the solutions of the model stochastic differential equations. We also find a maximum at small noise values which constitutes a form of stochastic resonance.

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

stochastic neuron models
interspike intervals


EEDTC: Energy-efficient dominating tree construction in multi-hop wireless networks Motivated by reducing communication overhead and prolonging network lifetime in multi-hop wireless networks, we propose an energy-efficient dominating tree construction (EEDTC) algorithm to construct a dominating tree that can serve as a communication backbone in wireless infrastructures. The algorithm uses k-hop neighbors' information (k is an element of [1, D-G], where D-G is the diameter of graph G). EEDTC has a theoretical approximation factor of at most 9. When k is equal to 1, it has O(n) message complexity and O(inverted right perpendicularn(1-1)/D(G)inverted left perpendicular - 1) time complexity. Due to the low message complexity, EEDTC performs well on energy consumption. The energy-aware ranking technique that is introduced can also balance energy consumption in the network, and hence reduce the probability of network failures caused by energy depletion of back bone nodes. (C) 2008 Elsevier B.V. All rights reserved.

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

energy-efficient
connected dominating set
ad hoc network
wireless sensor network


Loosely coupled interorganizational workflows:: modeling and analyzing workflows crossing organizational boundaries Todays corporations often must operate across organizational boundaries. Phenomena such as electronic commerce, extended enterprises, and the Internet stimulate cooperation between organizations. Therefore, it is interesting to consider workflows distributed over a number of organizations. Interorganizational workflow offers companies the opportunity to re-shape business processes beyond the boundaries of their own organizations. Two important questions are addressed in this paper: (1) what are the minimal requirements any interorganizational workflow should satisfy? and (2) how does one decide whether an interorganizational workflow, modeled in terms of Petri nets, is consistent with an interaction structure specified through a message sequence chart?

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

workflow management
verification
message sequence charts


sms-based web search for low-end mobile devices Short Messaging Service (SMS) based mobile information services have become increasingly common around the world, especially in emerging regions among users with low-end mobile devices. This paper presents the design and implementation of SMSFind, an SMS-based search system that enables users to obtain extremely concise (one SMS) message of 140 bytes) and appropriate search responses for queries across arbitrary topics in one round of interaction. SMSFind is designed to complement existing SMS-based search services that are either limited in the topics they recognize or involve a human in the loop. Given an unstructured search query, SMSFind, uses a conventional search engine as a back-end to elicit several search responses and uses a combination of information retrieval techniques to extract the most appropriate 140-byte snippet as the final SMS search response. We show that SMSFind returns appropriate responses for 57.3\% of ChaCha search queries in our test set; this accuracy rate is high given that ChaCha employs a human to answer the same questions. We have also deployed a pilot version of SMSFind for use with a small focus group in Kenya to explore the interaction issues of such a system and share our experience.

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


Fast frequency hopping codes applied to SAC optical CDMA network A new code family, fast frequency hopping code (FFH), was presented for applications in SAC optical CDMA network. A complete SAC optical CDMA system with moderate security was constructed. The numerical result shown that the SAC optical CDMA network using the proposed FFH code can provide favorable performance.

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

arrayed-waveguide grating (awg)
fiber bragg grating (fbg)
fast frequency hopping (ffh) code
spectral amplitude coding (sac)