An advanced hydro-mechanical constitutive model for unsaturated soils with different initial densities This paper presents an advanced constitutive model for unsaturated soils, using Bishops effective stress (??) and the effective degree of saturation (Se) as two fundamental constitutive variables in the proposed constitutive model. A sub-loading surface and a unified hardening parameter (H) are introduced into the ??Se modelling framework to interpret the effects of initial density on coupled hydro-mechanical behaviour of compacted soils. Compared with existing models in the literature, the main advantage of the proposed model that it is capable of modelling hydro-mechanical behaviour of unsaturated soils compacted to different initial densities, such as the dependence of loadingcollapse volume on initial void ratio and density effect on the shearing-induced saturation change. The proposed model requires 13 material parameters, all of which can be calibrated through conventional laboratory tests. Numerical studies are conducted to assess the performance of the model for a hypothetical soil under two typical hydro-mechanical loading scenarios. The proposed advanced unsaturated soil model is then validated against a number of experimental results for both isotropic and triaxial conditions reported in the literature.

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

unsaturated soils
compacted soils
bishops effective stress
degree of saturation
initial densities


understanding the value of software engineering technologies When AI search methods are applied to software process models, then appropriate technologies can be discovered for a software project. We show that those recommendations are greatly affected by the business context of its use. For example, the automatic defect reduction tools explored by the ASE community are only relevant to a subset of software projects, and only according to certain value criteria. Therefore, when arguing for the value of a particular technology, that argument should include a description of the value function of the target user community.

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

artificial intelligence
software economics


The unfinished history of usage rights for spectrum The key task in the next stage of spectrum management is to adapt regulation to the prospect of widespread sharing, on a much more sophisticated basis than sharing is used today. There is a role for the regulator to take steps to expand the area of choice within which public and private sector users can operate. This is best done in general by enhancing the flexibility of usage rights, which itself is best achieved by enhancing the freedom to trade them in the dimensions of time, space, level of interference and priority of access, by subdividing, re-aggregating, etc. However, there are considerable transactions cost impediments to trading where unlicensed users are involved. This creates a role for the regulator pro-actively to investigate different allocations, to make provisions for the most promising to occur and to incorporate both in refarming exercises and in primary assignments based on auctions configurations of usage rights, which might favour promising avenues of shared spectrum use.

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

spectrum
usage rights
unlicensed
refarming


A discrete scheme of LaplaceBeltrami operator and its convergence over quadrilateral meshes ? LaplaceBeltrami operator and its discretization play a central role in the fields of image processing, computer graphics, computer aided geometric design and so on. In this paper, a discrete scheme for LaplaceBeltrami operator over quadrilateral meshes is constructed based on a bilinear interpolation of the quadrilateral. Convergence results for the proposed discrete scheme are established under some conditions. Numerical results which justify the theoretical analysis are also given.

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

laplacebeltrami operator
quadrilateral meshes
discretization
convergence
bilinear interpolation


Energy and Time Efficient Algorithm for Cloud Offloading Using Dynamic Profiling With the advent of computationally intensive application for mobile devices there is need of time and energy efficient component offloading algorithm which involves execution of resource intensive components of an application on remote machine. Traditional solution includes offloading of entire application (no partition), offloading predetermined components (static partition) or making offloading decision at runtime for each component (01 ILP). Our proposed solution of dynamic profiling uses depth-first search (topological sorting) to calculate the offloading point at runtime. The subsequent nodes are offloaded with high probability. Experimental result demonstrates that proposed algorithm is better than 01 ILP in time domain while outperforming no-partitioning and static-partitioning in energy 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Adaptive critic design-based robust neural network control for nonlinear distributed parameter systems with unknown dynamics In this paper, an adaptive critic design (ACD)-based robust on-line neural network control design is developed for a class of parabolic partial differential equation (PDE) systems with unknown nonlinear dynamics. First, the Galerkin method is applied to the parabolic PDE system to derive a finite-dimensional slow one and an infinite-dimensional stable fast subsystem. The obtained slow system is an ordinary differential equation (ODE) system with unknown nonlinearities, which accurately describes the dynamics of the slow modes of the PDE system. Then, a novel ACD-based robust optimal control scheme is proposed for the resulting nonlinear slow system with unknown dynamics. An action neural network (NN) is employed to approximate all the derived unknown nonlinear terms and a robust control term is further developed to attenuate the NN reconstruction errors and disturbances. Especially, by developing novel critic signals and Lyapunov function candidate, together with the adaptive bounding technique, no a prior knowledge for the bounds of the disturbance term, the NN ideal weights of action NN and critic NN and the NN reconstruction errors is required. Finally, simulation results demonstrate the effectiveness of the proposed robust optimal control scheme.

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

adaptive critic designs
adaptive dynamic programming
learning control
neural networks
uniformly ultimate boundedness


Web Services with generic simulation models for discrete event simulation Today the Internet and the World Wide Web (WWW) are on the cusp of a paradigm shift. Up to now most actions in the WWW are sorts of human-computer interaction, but the introduction of the eXtensible Markup Language (XML) changed the perception. The Internet will be seen as a great space of information and with the use of XML and following technologies like Web Services, Grid Computing and Semantic Web the difference between human-machine interaction and machine-machine interaction vanishes. This work investigates the usefulness of XML in the simulation domain and uses Web Service technology to build the SimASP framework for discrete event simulation (DES). (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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

web service
xml
discrete event simulation


the impact of sample reduction on pca-based feature extraction for supervised learning "The curse of dimensionality" is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimensions. In this paper, different feature extraction (FE) techniques are analyzed as means of dimensionality reduction, and constructive induction with respect to the performance of Nave Bayes classifier. When a data set contains a large number of instances, some sampling approach is applied to address the computational complexity of FE and classification processes. The main goal of this paper is to show the impact of sample reduction on the process of FE for supervised learning. In our study we analyzed the conventional PCA and two eigenvector-based approaches that take into account class information. The first class-conditional approach is parametric and optimizes the ratio of between-class variance to the within-class variance of the transformed data. The second approach is a nonparametric modification of the first one based on the local calculation of the between-class covariance matrix. The experiments are conducted on ten UCI data sets, using four different strategies to select samples: (1) random sampling, (2) stratified random sampling, (3) kd -tree based selective sampling, and (4) stratified sampling with kd -tree based selection. Our experiments show that if the sample size for FE model construction is small then it is important to take into account both class information and data distribution. Further, for supervised learning the nonparametric FE approach needs much less instances to produce a new representation space that result in the same or higher classification accuracy than the other FE approaches.

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

supervised learning
feature extraction
sample reduction


A topology preserving level set method for geometric deformable models Active contour and surface models, also known as deformable models, are powerful image segmentation techniques. Geometric deformable models implemented using level set methods have advantages over parametric models due to their intrinsic behavior, parameterization independence, and ease of implementation. However, a long claimed advantage of geometric deformable models-the ability to automatically handle topology changes-turns out to be a liability in applications where the object to be segmented has a known topology that must be preserved. In this paper, we present a new class of geometric deformable models designed using a novel topology-preserving level set method, which achieves topology preservation by applying the simple point concept from digital topology. These new models maintain the other advantages of standard geometric deformable models including subpixel accuracy and production of nonintersecting curves or surfaces. Moreover, since the topology-preserving constraint is enforced efficiently through local computations, the resulting algorithm incurs only nominal computational overhead over standard geometric deformable models. Several experiments on simulated and real data are provided to demonstrate the performance of this new deformable model algorithm.

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

topology preservation
level set method
digital topology

geometric deformable model
topological constraint
simple points
active contours


Elastic Geodesic Paths in Shape Space of Parameterized Surfaces This paper presents a novel Riemannian framework for shape analysis of parameterized surfaces. In particular, it provides efficient algorithms for computing geodesic paths which, in turn, are important for comparing, matching, and deforming surfaces. The novelty of this framework is that geodesics are invariant to the parameterizations of surfaces and other shape-preserving transformations of surfaces. The basic idea is to formulate a space of embedded surfaces (surfaces seen as embeddings of a unit sphere in R-3) and impose a Riemannian metric on it in such a way that the reparameterization group acts on this space by isometries. Under this framework, we solve two optimization problems. One, given any two surfaces at arbitrary rotations and parameterizations, we use a path-straightening approach to find a geodesic path between them under the chosen metric. Second, by modifying a technique presented in [25], we solve for the optimal rotation and parameterization (registration) between surfaces. Their combined solution provides an efficient mechanism for computing geodesic paths in shape spaces of parameterized surfaces. We illustrate these ideas using examples from shape analysis of anatomical structures and other general surfaces.

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

riemannian distance
parameterization invariance
path-straightening


On the coupling of the homotopy perturbation method and Laplace transformation In this paper, a Laplace homotopy perturbation method is employed for solving one-dimensional non-homogeneous partial differential equations with a variable coefficient. This method is a combination of the Laplace transform and the Homotopy Perturbation Method (LHPM). LHPM presents an accurate methodology to solve non-homogeneous partial differential equations with a variable coefficient. The aim of using the Laplace transform is to overcome the deficiency that is mainly caused by unsatisfied conditions in other semi-analytical methods such as HPM, VIM, and ADM. The approximate solutions obtained by means of LHPM in a wide range of the problem's domain were compared with those results obtained from the actual solutions, the Homotopy Perturbation Method (HPM) and the finite element method. The comparison shows a precise agreement between the results, and introduces this new method as an applicable one which it needs fewer computations and is much easier and more convenient than others, so it can be widely used in engineering too. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

laplace homotopy perturbation method (lhpm)


Central Limit Theorems for Super Ornstein-Uhlenbeck Processes Suppose that X={X t :t?0} is a supercritical super Ornstein-Uhlenbeck process, that is, a superprocess with an Ornstein-Uhlenbeck process on \(\mathbb{R}^{d}\) corresponding to \(L=\frac{1}{2}\sigma^{2}\Delta-b x\cdot\nabla\) as its underlying spatial motion and with branching mechanism ?(?)=???+?? 2+?(0,+?)(e ??x ?1+?x)n(dx), where ?=???(0+)>0, ??0, and n is a measure on (0,?) such that ?(0,+?) x 2 n(dx)<+?. Let \(\mathbb{P} _{\mu}\) be the law of X with initial measure ?. Then the process W t =e ??t ?X t ? is a positive \(\mathbb{P} _{\mu}\)-martingale. Therefore there is W ? such that W t ?W ?, \(\mathbb{P} _{\mu}\)-a.s. as t??. In this paper we establish some spatial central limit theorems for X.

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

central limit theorem
backbone decomposition
super ornstein-uhlenbeck process
branching process
branching ornstein-uhlenbeck process
ornstein-uhlenbeck process
60j80
60g57
60j45


e-Learning recommender system for a group of learners based on the unified learner profile approach In the age of information explosion, e-learning recommender systems (eL_RSs) have emerged as effective information filtering techniques that attempt to provide the most appropriate learning resources for learners while using e-learning systems. These learners are differentiated on the basis of their learning styles, goals, knowledge levels and others. Several attempts have been made in the past to design eL_RSs to recommend resources to individuals; however, an investigation of recommendations to a group of learners in e-learning is still in its infancy. In this paper, we focus on the problem of recommending resources to a group of learners rather than to an individual. The major challenge in group recommendation is how to merge the individual preferences of different learners that form a group and extract a pseudo unified learner profile (ULP) that closely reflects the preferences of all learners. Firstly, we propose a profile merging scheme for the ULP by utilizing learning styles, knowledge levels and ratings of learners in a group. Thereafter, a collaborative approach is proposed based on the ULP for effective group recommendations. Experimental results are presented to demonstrate the effectiveness of the proposed group recommendation strategy for e-learning.

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

recommender systems
learning styles
knowledge levels


sms-based human-hosted interactive tv in finland Interactive TV entertainment has brought to life a new kind of TV game show host culture in Finland. A qualitative study of SMS-to-TV human-hosted interactive TV games, specifically, TV-mobile games and call quizzes, was conducted by recording sample interactive TV programs and corresponding discussion forums on the Internet and analyzing the content. The role of the human host in these programs was analyzed and discussed to answer these questions: Why is this interactive entertainment popular? What different dimensions can be found? How could this field be used more effectively and what are the aspects developers should pay attention to while designing iTV entertainment? This research is important beyond Finland since Finland tends to pioneer interactive entertainment that later spreads out to other countries

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 channel aided LMMSE estimation for timefrequency selective channels in OFDM context This paper proposes a linear minimum mean square error-based (LMMSE) channel estimation method, which allows avoiding the necessary knowledge of the channel covariance matrix or its estimation. To do so, a perfectly tunable filter acting like an artificial channel is added at the receiver side. We show that an LMMSE estimation of the sum of this artificial channel and the physical channel only needs the covariance matrix of the artificial channel, and the channel estimation is finally obtained by subtracting the frequency coefficients of the added filter. We call this method artificial channel aided-LMMSE (ACA-LMMSE). Theoretical developments and simulations prove that its performance is close to theoretical LMMSE, and we show that this method reduces the computational complexity, compared to usual LMMSE, due to the covariance matrix used for ACA-LMMSE is computed only once throughout the transmission duration. We put the conditions on the artificial channel parameters to get the expected mask effect. Simulations display the performance of the proposed method, in terms of MMSE and bit error rate (BER). Indeed, the difference of BER between our method and the theoretical LMMSE is less than 2dB.

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

mean square error methods
digital radio mondiale


Prediction of automobile tire cornering force characteristics by finite element modeling and analysis In this study, a detailed finite element model of a radial automobile tire is constructed for the prediction of cornering force characteristics during the design stage. The nonlinear stressstrain relationship of rubber as well as a linear elastic approximation, reinforcement, large displacements, and frictional ground contact are modeled. Validity of various simplifications is checked. The cornering force characteristics obtained by the finite element tire model are verified on the experimental setup constructed for this purpose.

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

pneumatic tires
nonlinear finite element analysis
tire testing


Design and Implementation of a MPPT Circuit for a Solar UAV This paper presents a maximum power point tracking (MPPT) circuit for an Unmanned Air Vehicle. The design of the MPPT is proposed utilizing a boost-converter topology. The power of the photovoltaic cells is monitored by a closed-loop microcontroller based control system, and the PWM signal of the boost converter continuously adjusted to extract maximum power. The MPPT is used to charge the Lithium-ion Polymer battery and feed the electrical load of the unmanned aircraft.

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


Technical assessment and evaluation of environmental models and software: Letter to the Editor This letter details the collective views of a number of independent researchers on the technical assessment and evaluation of environmental models and software. The purpose is to stimulate debate and initiate action that leads to an improved quality of model development and evaluation, so increasing the capacity for models to have positive outcomes from their use. As such, we emphasize the relationship between the model evaluation process and credibility with stakeholders (including funding agencies) with a view to ensure continued support for modelling efforts. Many journals, including EM&S, publish the results of environmental modelling studies and must judge the work and the submitted papers based solely on the material that the authors have chosen to present and on how they present it. There is considerable variation in how this is done with the consequent risk of considerable variation in the quality and usefulness of the resulting publication. Part of the problem is that the review process is reactive, responding to the submitted manuscript. In this letter, we attempt to be proactive and give guidelines for researchers, authors and reviewers as to what constitutes best practice in presenting environmental modelling results. This is a unique contribution to the organisation and practice of model-based research and the communication of its results that will benefit the entire environmental modelling community. For a start, our view is that the community of environmental modellers should have a common vision of minimum standards that an environmental model must meet. A common vision of what a good model should be is expressed in various guidelines on Good Modelling Practice. The guidelines prompt modellers to codify their practice and to be more rigorous in their model testing. Our statement within this letter deals with another aspect of the issue it prompts professional journals to codify the peer-review process. Introducing a more formalized approach to peer-review may discourage reviewers from accepting invitations to review given the additional time and labour requirements. The burden of proving model credibility is thus shifted to the authors. Here we discuss how to reduce this burden by selecting realistic evaluation criteria and conclude by advocating the use of standardized evaluation tools as this is a key issue that needs to be tackled.

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

software verification
environmental assessment


On the Wadge reducibility of k-partitions We establish some results on the Wadge degrees and on the Boolean hierarchy of k-partitions of some spaces, where k is a natural number. The main attention is paid to the Baire space, Baire domain and their close relatives. For the case of Delta(0)(2)-measurable k-partitions the structures of Wadge degrees are characterized completely. For many degree structures, undecidability of the first-order theories is shown, for any k >= 3. (C) 2009 Elsevier Inc. 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 O O O O O O O O O O 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

baire space
baire domain
wadge reducibility

k-partition
discrete weak semilattice
forest
homomorphic preorder


Simulation of axonal excitability using a Spreadsheet template created in Microsoft Excel The objective of this present study was to implement an established simulation protocol (A.M. Brown, A methodology for simulating biological systems using Microsoft Excel, Comp. Methods Prog. Biomed. 58 (1999) 18190) to model axonal excitability. The simulation protocol involves the use of in-cell formulas directly typed into a spreadsheet and does not require any programming skills or use of the macro language. Once the initial spreadsheet template has been set up the simulations described in this paper can be executed with a few simple keystrokes. The model axon contained voltage-gated ion channels that were modeled using Hodgkin Huxley style kinetics. The basic properties of axonal excitability modeled were: (1) threshold of action potential firing, demonstrating that not only are the stimulus amplitude and duration critical in the generation of an action potential, but also the resting membrane potential; (2) refractoriness, the phenomenon of reduced excitability immediately following an action potential. The difference between the absolute refractory period, when no amount of stimulus will elicit an action potential, and relative refractory period, when an action potential may be generated by applying increased stimulus, was demonstrated with regard to the underlying state of the Na+ and K+ channels; (3) temporal summation, a process by which two sub-threshold stimuli can unite to elicit an action potential was shown to be due to conductance changes outlasting the first stimulus and summing with the second stimulus-induced conductance changes to drive the membrane potential past threshold; (4) anode break excitation, where membrane hyperpolarization was shown to produce an action potential by removing Na+ channel inactivation that is present at resting membrane potential. The simulations described in this paper provide insights into mechanisms of axonal excitation that can be carried out by following an easily understood protocol.

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

axon
hodgkin huxley
microsoft excel
simulation
spreadsheet


Trabecular bone remodelling under pathological conditions based on biochemical and mechanical processes involved in BMU activity In adulthood, bone tissue is continuously renewed by processes governed by basic multicellular units composed of osteocytes, osteoclasts and osteoblasts, which are subjected to local mechanical loads. Osteocytes are known to be integrated mechanosensors that regulate the activation of the osteoclasts and osteoblasts involved in bone resorption and apposition processes, respectively. After collagen tissue apposition, a process of collagen mineralisation takes place, gradually increasing the effective stiffness of bone. This study presents a new model based on physicochemical parameters involved in spongy bone remodelling under pathological conditions. Our model simulates the transient evolution of both geometry and effective Young's modulus of the trabeculae, also taking turnover into account. Various loads were applied on a trabecula in order to determine the evolution of bone volume fraction under pathological conditions. A parametric study performed on the model showed that one key parameter here is the kinetic constant of hydroxyapatite crystallisation. We subsequently tested our model on a pathological case approaching osteoporosis, involving a decrease in the number of viable osteocytes present in bone. The model converges to a lower value (-5%) for bone volume fraction than with a normal quantity of osteocytes. This useful tool offers new perspectives for predicting bone remodelling deficits on a local scale in patients with pathological conditions such as osteoporosis and in bedridden patients, as well as for astronauts subjected to weightlessness in space.

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


Robust and Imperceptible Dual Watermarking for Telemedicine Applications In this paper, the effects of different error correction codes on the robustness and imperceptibility of discrete wavelet transform and singular value decomposition based dual watermarking scheme is investigated. Text and image watermarks are embedded into cover radiological image for their potential application in secure and compact medical data transmission. Four different error correcting codes such as Hamming, the Bose, Ray-Chaudhuri, Hocquenghem (BCH), the ReedSolomon and hybrid error correcting (BCH and repetition code) codes are considered for encoding of text watermark in order to achieve additional robustness for sensitive text data such as patient identification code. Performance of the proposed algorithm is evaluated against number of signal processing attacks by varying the strength of watermarking and covers image modalities. The experimental results demonstrate that this algorithm provides better robustness without affecting the quality of watermarked image.This algorithm combines the advantages and removes the disadvantages of the two transform techniques. Out of the three error correcting codes tested, it has been found that ReedSolomon shows the best performance. Further, a hybrid model of two of the error correcting codes (BCH and repetition code) is concatenated and implemented. It is found that the hybrid code achieves better results in terms of robustness. This paper provides a detailed analysis of the obtained experimental results.

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

singular value decomposition
error correcting codes

image watermarking
steganography
discrete wavelet transforms


Robust estimation of dimension reduction space Most dimension reduction methods based on nonparametric smoothing are highly sensitive to outliers and to data coming from heavy-tailed distributions. Two recently proposed methods, minimum average variance estimation and outer product of gradients, can be and are made robust in such a way that preserves all advantages of the original approach. Their extension based on the local one-step M-estimators is sufficiently robust to outliers and data from heavy-tailed distributions, it is relatively easy to implement, and surprisingly, it performs as well as the original methods when applied to normally distributed data.

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

l- and m-estimation
nonparametric regression


Complexity of deciding sense of direction In this paper we prove that deciding whether a distributed system (represented as a colored digraph with n nodes) has weak sense of direction is in AC(1) (using n(6) processors). Moreover, we show that deciding sense of direction is in P. Our algorithms can also be used to decide in AC(1) whether a colored graph is a Cayley color graph.

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

distributed systems
computational complexity
cayley graphs


Probabilistic Fuzzy Image Fusion Approach for Radar Through Wall Sensing This paper addresses the problem of combining multiple radar images of the same scene to produce a more informative composite image. The proposed approach for probabilistic fuzzy logic-based image fusion automatically forms fuzzy membership functions using the Gaussian-Rayleigh mixture distribution. It fuses the input pixel values directly without requiring fuzzification and defuzzification, thereby removing the subjective nature of the existing fuzzy logic methods. In this paper, the proposed approach is applied to through-the-wall radar imaging in urban sensing and evaluated on real multi-view and polarimetric data. Experimental results show that the proposed approach yields improved image contrast and enhances target detection.

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


Inductive time-space lower bounds for SAT and related problems We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows. 1. We present a technique that uniformly improves upon most known nonlinear time lower bounds for nondeterminism and alternating computation, on both subpolynomial (n(o(1))) space RAMs and sequential one-tape machines with random access to the input. We obtain improved lower bounds for Boolean satisfiability (SAT), as well as all NP-complete problems that have efficient reductions from SAT, and Sigma(k)-SAT, for constant k >= 2. For example, SAT cannot be solved by random access machines using n(root 3) time and subpolynomial space. 2. We show how indirect diagonalization leads to time-space lower bounds for computation with bounded nondeterminism. For both the random access and multitape Turing machine models, we prove that for all k >= 1, there is a constant c(k) > 1 such that linear time with n(1/k) nondeterministic bits is not contained in deterministic n(ck) time with subpolynomial space. This is used to prove that satisfiability of Boolean circuits with n inputs and n(k) size cannot be solved by deterministic multitape Turing machines running in n(k.ck) time and subpolynomial space.

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

lower bounds
satisfiability
diagonalization
bounded nondeterminism

time-space tradeoffs
polynomial-time hierarchy


General form of lattice-valued fuzzy sets under the cutworthy approach In this note a new solution of problem of Synthesis of fuzzy sets is presented. In other words, necessary and sufficient conditions are formulated, under which for a given family of subsets F of a set X and a fixed complete lattice L there is a fuzzy set it : X -> L, such that the collection of cuts of it coincides with F. Moreover, it is proved that the general form of lattice-valued fuzzy sets (considering families of cuts) are the type of fuzzy sets having the codomain (0, 1}(c) for a suitable chosen cardinal c. (C) 2007 Elsevier B.V. All rights reserved.

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


Mechanotransduction in Cardiac Myocytes Cardiac myocytes react to diverse mechanical demands with a multitude of transient and long-term responses to normalize the cellular mechanical environment. Several stretch-activated signaling pathways have been identified, most prominently guanine nucleotide binding proteins (G-proteins), mitogen-activated protein kinases (MAPK), Janus-associated kinase/signal transducers and activators of transcription (JAK/STAT), protein kinase C (PKC), calcineurin, intracellular calcium regulation, and several autocrine and paracrine factors. Multiple levels of crosstalk exist between pathways. The cellular response to changes in the mechanical environment can lead to cardiac myocyte hypertrophy, cellular growth that can be accompanied by pathological myocyte dysfunction, and tissue fibrosis. Several candidates for the primary mechanosensor in cardiac myocytes have been identified, ranging from stretch-activated ion channels in the membrane to yet-unknown mechanosensitive mechanisms in the nucleus. New and refined experimental techniques will exploit advances in molecular biology and biological imaging to study mechanotransduction in isolated cells and genetically engineered mice to explore the function of individual proteins.

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


Design of a sliding window scheme for detecting high packet-rate flows via random packet sampling We discuss the design of a sliding window scheme for detecting high packet-rate flows via random packet sampling. We determine the values of control parameters, such as the sampling rate and window length, to minimize the false positive ratio, while keeping the false negative ratio sufficiently low and making the on-line processing possible. Under mild assumptions, we formulate this problem as a nonlinear program and provide its numerically feasible global optimal solution. We then conduct sampling experiments with public trace data and discuss the fundamental characteristics of the sliding window scheme with random packet sampling.

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

random packet sampling
sliding window scheme


The Fuzzy Metric-Truth reasoning approach to decision making in soft computing milieux This article considers fuzzy approximate reasoning utilizing the metric-ruth approach. This approach assesses the truth of a sentence on the basis of its distance from the respective true one. The author has previously examined this subject matter from the logico-methodological point of view. This article focuses on the aspects typical of fuzzy if-then rules within control and decision making.

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


Querying a summary of database For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for end-users to efficiently use the produced summaries. This paper presents a first attempt to develop a querying tool for the SAINTETIQ summarization model. The proposed search algorithm takes advantage of the hierarchical structure of the SAINTETIQ summaries to efficiently answer questions such as "how are, on some attributes, the tuples which have specific characteristics?" Moreover, this algorithm can be seen both as a boolean querying mechanism over a hierarchy of summaries, and as a flexible querying mechanism over the underlying relational tuples.

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

linguistic summaries
summary querying
relational database
fuzzy labels


Subband domain coding of binary textual images for document archiving In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded, The method is suitable for keyword search in the compressed data. It is observed that very high compression ratios are obtained with this method. Simulation studies are presented.

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

binary image coding
binary subband decomposition
document retrieval


On-Site Volume Rendering with GPU-Enabled Devices Now that high-performance computing systems can rely more on a cloud based infrastructure, it becomes much more important to have ubiquitous data processing and visualization capability. This will allow data sharing among numerous clients using shared data repositories through a secure web server. Thanks to the wide availability of GPU support in todays mobile devices such as smart phones and tablets, as well as the recently published WebGL standard, pervasive computing for high-quality and real-time volume rendering may be realized on such high-performance platforms. We have invented two high-performance volume renderers, namely, single-pass GPU ray caster and fast 3D texture slicer, for both mobile and desktop platforms. Rigorous experiments and performance assessments reveal that the proposed mobile 3D image rendering system outperforms the existing approaches in the literature.

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


Multipartite Priority Queues We introduce a framework for reducing the number of element comparisons performed in priority-queue operations. In particular, we give a priority queue which guarantees the worst-case cost of O(1) per minimum finding and insertion, and the worst-case cost of O(log n) with at most log n + O(1) element comparisons per deletion, improving the bound of 2 log n + O(1) known for binomial queues. Here, n denotes the number of elements stored in the data structure prior to the operation in question, and log n equals log(2)(max {2, n}). As an immediate application of the priority queue developed, we obtain a sorting algorithm that is optimally adaptive with respect to the inversion measure of disorder, and that sorts a sequence having n elements and I inversions with at most n log(I/n) + O(n) element comparisons.

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

heaps
meticulous analysis
constant factors


Bounds on codes derived by counting components in Varshamov graphs We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code.

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


Forecasting of circuit-breaker behaviour in high-voltage electrical power systems: Necessity for future maintenance management Two research projects were started in order to investigate new methods of maintenance management. The first project was finished in April 1999, dealing with the problem of relating the information of individual devices with their importance in the complete system. The combination of both sets of information is the aim of reliability centred maintenance (RCM). More important devices can be maintained more frequently than those of less importance, leading to reduced maintenance costs but retaining a high level of reliability of the system. The question of how new methods of maintenance influence behaviour in future, cannot be answered right now. The forecasting of the behaviour of circuit-breakers will now be investigated in a further project in the field of maintenance management. A software model will be developed in strong co-ordination with partners of some electrical power system utilities. The model shall include the simulation of the behaviour of circuit-breakers in the future regarding maintenance activities as well as the operational stresses of the present. This paper will give an overview of the actual activities and aims of the project. Main activities have been the definition of investigated circuit-breaker types and the methodology for the starting steps of the project.

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


Quality as empowerment: going around in circles The article introduces a new international educational community based on Students Quality Circles, in which industry and education have learned to collaborate for mutual benefit. In each country represented in this special issue, there have been distinctive bottom-up initiatives, informed by the experience of collaboration. We emphasise Quality as Empowerment.

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

bottom-up
collaborative advantage
compliance
continuous improvement
top-down


A computer-vision based precision seed drill guidance assistance This paper presents a control mechanism aiming to position seed drills relative to the previous lines, while sowing. The position was measured by a machine vision system and used in a feedback control loop. An articulated mechanism was used to ensure the lateral displacement of the drill relative to the tractor. The behaviour of the whole outfit was studied during several field tests. The standard deviation of the error, measured as the difference between the observed inter-row distance and its set value, was 23mm and its range was less than 100mm, which was sufficient to fulfil the requirements of the application. Sources of systematic errors were also identified as linked to the geometric considerations. Their correction requires an accurate mounting of the camera, which may be possible for a serial montage.

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


Rulebased regulatory and metabolic model for Quorum sensing in P. aeruginosa In the pathogen P. aeruginosa, the formation of virulence factors is regulated via Quorum sensing signaling pathways. Due to the increasing number of strains that are resistant to antibiotics, there is a high interest to develop novel antiinfectives. In the combat of resistant bacteria, selective blockade of the bacterial celltocell communication (Quorum sensing) has gained special interest as antivirulence strategy. Here, we modeled the las, rhl, and pqs Quorum sensing systems by a multilevel logical approach to analyze how enzyme inhibitors and receptor antagonists effect the formation of autoinducers and virulence factors.

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

quorum sensing
multilevel logical approach

boolean network
generegulatory network
inhibitor
pseudomonas aeruginosa
pqs system


Strong and ultra separation axioms on fuzzy bitopological spaces Given a fuzzy bitopological space (X, tau(1), tau(2)), we introduce a new notion of fuzzy pairwise separation axioms by using the family of its level bitopologies l alpha(tau(1)), l alpha(tau(2)), alpha is an element of [0,1). We prove that these concepts are good extension and we compare them with its corresponding FPTi (Kandil and El-Shafee, 1991) and FPT*(i) (Abu Safiya et al., 1994) (i = 0, 1,2, 3, 4), respectively. We show that these notions are not equivalent and we give a number of examples which illustrate this fact. (C) 1999 Elsevier Science B.V. All rights reserved.

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

fuzzy bitopologicai spaces
alpha-level bitopological spaces
strong fuzzy pairwise separation axioms
alpha-bitopologically generated


Secure and scalable mobility management scheme for the Internet of Things integration in the future internet architecture Internet of Things is becoming a reality with the rapid development of communication technologies. This evolution presents an enrichment of the users' experiences, but also challenges regarding network scalability, security, privacy vulnerabilities, and mobility support. Mobility support for the Future Internet is focused on ID/Locator split architectures since the limitations of the current internet. This work analyses the security challenges for the HIMALIS (Heterogeneity Inclusion and Mobility Adaptation through Locator ID Separation) architecture for the particularities from the Internet of Things and the ID/Locator management messages vulnerable to attacks. This work proposes a secure and scalable mobility management scheme that considers the constraints from the Internet of Things, solving the possible security and privacy vulnerabilities of the HIMALIS architecture. The proposed scheme supports scalable inter-domain authentication and secure location update and binding transfer for the mobility process. The proposed scheme has been verified and evaluated successfully with the AVISPA framework.

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

internet of things
future internet architecture
security
privacy
mobility


Influence of different shoulder-elbow configurations on steering precision and steering velocity in automotive context Influence of posture on driving precision and steering velocity was investigated. Arm posture influences steering precision and steering velocity. Steering precision and velocity are significantly increased in mid-positions. Driver safety can be enhanced by implementing these data in the design process. Subjective comfort rating confirmed experimental results.

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


Modelling procedures for directed network of data blocks Here are presented procedures for modelling data in a network. The methods are extensions of PCA or PLS regression to a forward network of data blocks. It is assumed that the data blocks are organised in a network such that one data block leads to one or more other data blocks. The procedures are stepwise ones. At each step a passage through the network is carried out. From the input weight vectors of the input or starting blocks, the score and loading vectors of all data blocks are computed. It is investigated if some score/loading vectors are not significant. If some are, they are deleted and revised estimation of the input weights are carried out. When one step is finished, all data matrices are adjusted for score and loading vectors found. A new passage through the network is carried out on the reduced matrices. If no significant loading/score vectors are found for a given set of input weights, the modelling stops. In case of one data block, the algorithm reduces to PCA. In case of two data blocks it reduces to PLS regression. Most methods used in PCA or PLS regression can be applied to this procedure, e.g., cross-validation and re-sampling procedures. It is pointed out, how these methods can be used to extend other regression methods than PCA and PLS regression to a network regression. (C) 2008 Elsevier B.V. All rights reserved.

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

linear regression
path models
multi-block data


A novel joint-processing adaptive nonlinear equalizer using a modular recurrent neural network for chaotic communication systems To eliminate nonlinear channel distortion in chaotic communication systems, a novel joint-processing adaptive nonlinear equalizer based on a pipelined recurrent neural network (JPRNN) is proposed, using a modified real-time recurrent learning (RTRL) algorithm. Furthermore, an adaptive amplitude RTRL algorithm is adopted to overcome the deteriorating effect introduced by the nesting process. Computer simulations illustrate that the proposed equalizer outperforms the pipelined recurrent neural network (PRNN) and recurrent neural network (RNN) equalizers. (C) 2010 Elsevier Ltd. All rights reserved.

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

pipelined architecture
channel equalizer
chaotic signal


Dynamics of connected vehicle systems with delayed acceleration feedback Acceleration-based connected cruise control (CCC) is implemented for heterogeneous platoons. The ad-hoc nature of wireless vehicle-to-vehicle (V2V) communication is exploited. The design is robust against variation of human parameters and is scalable for large systems. Delays are used as design parameters in order to ensure string stability. It is demonstrated that acceleration feedback shall be used in a selective manner.

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


Exact solution for nonlinear Schrodinger equation by He's frequency formulation In this work, we apply He's frequency formulation to search for the solution to nonlinear Schrodinger equation. Three examples are given and the solutions obtained are in good accordance with Wazwaz's solution [Abdul-Majid Wazwaz, A study on linear and nonlinear Schrodinger equations by the variational iteration method, Chaos Solitons Fractals 37 (4) (2008) 1136-1142]. It is shown that He's frequency formulation is of utter straightforward and effective. (C) 2009 Elsevier Ltd. All rights reserved.

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

nonlinear schrodinger equation
exact solution


On the role of trust in collaborative web search Recommender systems combine ideas from information retrieval, user modelling, and artificial intelligence to focus on the provision of more intelligent and proactive information services. As such, recommender systems play an important role when it comes to assisting the user during both routine and specialised information retrieval tasks. Like any good assistant it is important that users can trust in the ability of a recommender system to respond with timely and relevant suggestions. In this paper, we will look at a collaborative recommendation system operating in the domain of Web search. We will show how explicit models of trust can help to inform more reliable recommendations that translate into more relevant search results. Moreover, we demonstrate how the availability of this trust-model facilitates important interface enhancements that provide a means to declare the provenance of result recommendations in a way that will allow searchers to evaluate their likely relevance based on the reputation and trustworthiness of the recommendation partners behind these suggestions.

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

trust
user modelling
collaborative web search


An intelligent learning diagnosis system for Web-based thematic learning platform This work proposes an intelligent learning diagnosis system that supports a Web-based thematic learning model, which aims to cultivate learners' ability of knowledge integration by giving the learners the opportunities to select the learning topics that they are interested, and gain knowledge on the specific topics by surfing on the Internet to search related learning courseware and discussing what they have learned with their colleagues. Based on the log files that record the learners' past online learning behavior, an intelligent diagnosis system is used to give appropriate learning guidance to assist the learners in improving their study behaviors and grade online class participation for the instructor. The achievement of the learners' final reports can also be predicted by the diagnosis system accurately. Our experimental results reveal that the proposed learning diagnosis system can efficiently help learners to expand their knowledge while surfing in cyberspace Web-based "theme-based learning" model. (C) 2005 Elsevier Ltd. All rights reserved.

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

web-based learning
theme-based learning
fuzzy expert system
k-nearest neighbor
naive bayesian classifier
support vector machines


The longest common extension problem revisited and applications to approximate string searching ? The Longest Common Extension (LCE) problem considers a string s and computes, for each pair (i,j) ( i , j ) , the longest substring of s that starts at both i and j. It appears as a subproblem in many fundamental string problems and can be solved by linear-time preprocessing of the string that allows (worst-case) constant-time computation for each pair. The two known approaches use powerful algorithms: either constant-time computation of the Lowest Common Ancestor in trees or constant-time computation of Range Minimum Queries in arrays. We show here that, from practical point of view, such complicated approaches are not needed. We give two very simple algorithms for this problem that require no preprocessing. The first is 5 times faster than the best previous algorithms on the average whereas the second is faster on virtually all inputs. As an application, we modify the LandauVishkin algorithm for approximate matching to use our simplest LCE algorithm. The obtained algorithm is 13 to 20 times faster than the original. We compare it with the more widely used Ukkonen's cutoff algorithm and show that it behaves better for a significant range of error thresholds.

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

string
algorithm
longest common extension


Lumbar Spine Segmentation Using a Statistical Multi-Vertebrae Anatomical Shape plus Pose Model Segmentation of the spinal column from computed tomography (CT) images is a preprocessing step for a range of image-guided interventions. One intervention that would benefit from accurate segmentation is spinal needle injection. Previous spinal segmentation techniques have primarily focused on identification and separate segmentation of each vertebra. Recently, statistical multi-object shape models have been introduced to extract common statistical characteristics between several anatomies. These models can be used for segmentation purposes because they are robust, accurate, and computationally tractable. In this paper, we develop a statistical multi-vertebrae shape+pose model and propose a novel registration-based technique to segment the CT images of spine. The multi-vertebrae statistical model captures the variations in shape and pose simultaneously, which reduces the number of registration parameters. We validate our technique in terms of accuracy and robustness of multi-vertebrae segmentation of CT images acquired from lumbar vertebrae of 32 subjects. The mean error of the proposed technique is below 2 mm, which is sufficient for many spinal needle injection procedures, such as facet joint injections.

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

computed tomography (ct)
multi-vertebrae anatomical model
spinal intervention
statistical shape plus pose model


Relative blocking in posets Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded posets are considered and those related to the Boolean lattices are explored; it is shown that such sequences inherit all the familiar properties of the Farey sequences.

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

antichain
blocker
blocker map
clutter
farey sequence
lattice
poset


Mixed finite elements for numerical weather prediction We show how mixed finite element methods that satisfy the conditions of finite element exterior calculus can be used for the horizontal discretisation of dynamical cores for numerical weather prediction on pseudo-uniform grids. This family of mixed finite element methods can be thought of in the numerical weather prediction context as a generalisation of the popular polygonal C-grid finite difference methods. There are a few major advantages: the mixed finite element methods do not require an orthogonal grid, and they allow a degree of flexibility that can be exploited to ensure an appropriate ratio between the velocity and pressure degrees of freedom so as to avoid spurious mode branches in the numerical dispersion relation. These methods preserve several properties of the C-grid method when applied to linear barotropic wave propagation, namely: (a) energy conservation, (b) mass conservation, (c) no spurious pressure modes, and (d) steady geostrophic modes on the f -plane. We explain how these properties are preserved, and describe two examples that can be used on pseudo-uniform grids: the recently-developed modified RTk-Q(k-1) element pairs on quadrilaterals and the BDFM1-P1DG P 1 DG element pair on triangles. All of these mixed finite element methods have an exact 2:1 ratio of velocity degrees of freedom to pressure degrees of freedom. Finally we illustrate the properties with some numerical examples.

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

mixed finite elements
numerical weather prediction

stability
steady geostrophic states
geophysical fluid dynamics


DC offset control with application in a zero-IF 0.18 mu m CMOS Bluetooth receiver chain A compact DC offset correction circuit based on the intrinsic properties of quasi-floating gate (QFG) transistors is presented. The proposed scheme uses a tuning mechanism to make its initial response faster improving the traditional large settling time of these circuits. A zero-IF baseband receiver chain suitable for Bluetooth that includes the proposed dc offset correction has been designed in a 0.18 mu m CMOS technology at 1.2 V supply voltage.

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

direct-conversion receivers
low power and low-voltage circuits


Combining accuracy and success-rate to improve the performance of eXtended Classifier System (XCS) for data-mining and control applications The emergence of eXtended Classifier Systems (XCS) raised the bar for Learning Classifier Systems by incorporating the accuracies of the rules in the LCS's traditional reinforcement mechanism. However, neither XCS nor its extensions take into account the nature of a classifier's experience of attending the action set. We introduce an experienceevaluation mechanism that, once added to the traditional XCS, would assigns to each member of the action set a success rate indicating how effectively the classifier has contributed to the correct responding of the system to the environment's queries. Application of the augmented system (called SRXCS) to several benchmark problems shows that the proposed mechanism enhances XCS' classification capability and its rate of convergence at the same time. Application results indicate that SRXCS performs notably better on both pattern association and pattern recognition tasks. The applicability and efficiency of the proposed mechanism is further demonstrated through solving a fairly complex path planning problem for an autonomous mobile robot in a dynamic environment.

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

rule experience
rule elimination
reinforcement policy


an experimental study of field dependency in altered gz environments Failure to address extreme environments constraints at the human-computer interaction level may lead to the commission of critical and potentially fatal errors. This experimental study addresses gaps in our current theoretical understanding of the impact of Gz accelerations and field dependency independency on task performance in human-computer interaction. It investigates the effects of Gz accelerations and field dependency independency on human performance in the completion of perceptual-motor tasks on a personal digital assistant (PDA). We report the results of a controlled experiment, conducted in an aerobatic aircraft under multiple Gz conditions, showing that cognitive style significantly impacts latency and accuracy in target acquisition for perceptual-motor tasks in altered Gz environments and propose design guidelines as countermeasures. Based on the results, we argue that developing design requirements taking into account cognitive differences in extreme environments will allow users to execute perceptual-motor tasks efficiently without unnecessarily increasing cognitive load and the probability of critical errors.

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

mobile devices
perceptual style
comparative informatics


locality discriminating indexing for document classification This paper introduces a locality discriminating indexing (LDI) algorithm for document classification. Based on the hypothesis that samples from different classes reside in class-specific manifold structures, LDI seeks for a projection which best preserves the within-class local structures while suppresses the between-class overlap. Comparative experiments show that the proposed method isable to derives compact discriminating document representations for classification.

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


accelespell, a gestural interactive game to learn and practice finger spelling In this paper, an interactive computer game for learning and practicing continuous fingerspelling is described. The game is controlled by an instrumented glove known as AcceleGlove and a recognition algorithm based on decision trees. The Graphical User Interface is designed to allow beginners to remember the correct hand shapes and start finger spelling words sooner than traditional methods of learning.

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


A systematic optimization approach for assembly sequence planning using Taguchi method, DOE, and BPNN Research in assembly planning can be categorised into three types of approach: graph-based, knowledge-based and artificial intelligence approaches. The main drawbacks of the above approaches are as follows: the first is time-consuming; in the second approach it is difficult to find the optimal solution; and the third approach requires a high computing efficiency. To tackle these problems, this study develops a novel approach integrated with some graph-based heuristic working rules, robust back-propagation neural network (BPNN) engines via Taguchi method and design of experiment (DOE), and a knowledge-based engineering (KBE) system to assist the assembly engineers in promptly predicting a near-optimal assembly sequence. Three real-world examples are dedicated to evaluating the feasibility of the proposed model in terms of the differences in assembly sequences. The results show that the proposed model can efficiently generate BPNN engines, facilitate assembly sequence optimisation and allow the designers to recognise the contact relationships, assembly difficulties and assembly constraints of three-dimensional (3D) components in a virtual environment type.

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

assembly sequence planning
design of experiment
taguchi method

assembly precedence diagrams
neural networks


A fuzzy neural network controller with adaptive learning rates for nonlinear slider-crank mechanism A fuzzy neural network (FNN) controller with adaptive learning rates is proposed to control a nonlinear mechanism system in this study. First, the network structure and the on-line learning algorithm of the FNN is described. To guarantee the convergence of the tracking error, analytical methods based on a discrete-type Lyapunov function are proposed to determine the adaptive learning rates of the FNN. Next, a slider-crank mechanism, which is driven by a permanent magnet (PM) synchronous motor, is studied as an example to demonstrate the effectiveness of the proposed control technique; the FNN controller is implemented to control the slider position of the motor-slider-crank nonlinear mechanism. The robust control performance and learning ability of the proposed FNN controller with adaptive learning rates is demonstrated by simulation and experimental results.

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

fuzzy neural network
adaptive learning rates
synchronous motor


Simulated analysis for InGaP/GaAs heterostructure-emitter bipolar transistor with InGaAs/GaAs superlattice-base structure A novel InGaP/GaAs heterostructure-emitter bipolar transistor (HEBT) with InGaAs/GaAs superlattice-base structure is proposed and demonstrated by two-dimensional analysis. As compared with the traditional HEBT, the studied superlattice-base device exhibits a higher collector current, a higher current gain of 246, and a lower baseemitter (BE) turn-on voltage of 0.966V at a current level of 1?A, attributed to the increased charge storage of minority carriers in the InGaAs/GaAs superlattice-base region by tunneling behavior. The low turn-on voltage can reduce the operating voltage and collectoremitter offset voltage for low power consumption in circuit applications.

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

ingap/gaas
heterostructure emitter
superlattice base
turn-on voltage


Why it has become more difficult to predict Nobel Prize winners: a bibliometric analysis of nominees and winners of the chemistry and physics prizes (19012007) We propose a comprehensive bibliometric study of the profile of Nobel Prize winners in chemistry and physics from 1901 to 2007, based on citation data available over the same period. The data allows us to observe the evolution of the profiles of winners in the years leading up toand followingnominations and awarding of the Nobel Prize. The degree centrality and citation rankings in these fields confirm that the Prize is awarded at the peak of the winners citation history, despite a brief Halo Effect observable in the years following the attribution of the Prize. Changes in the size and organization of the two fields result in a rapid decline of predictive power of bibliometric data over the century. This can be explained not only by the growing size and fragmentation of the two disciplines, but also, at least in the case of physics, by an implicit hierarchy in the most legitimate topics within the discipline, as well as among the scientists selected for the Nobel Prize. Furthermore, the lack of readily-identifiable dominant contemporary physicists suggests that there are few new paradigm shifts within the field, as perceived by the scientific community as a whole.

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


an interactive documentation system Most chronic users of time sharing computer systems are familiar with programs that allow the creation and manipulation of text files. Less often they have at their disposal programs that will format the document described by a text file, generating output such as a typist might produce. Rarely is there any mechanism by which graphics can be integrated with text. Lawrence Livermore Laboratory has a powerful, flexible and interactive computer-based documentation system that will format a source document description according to user specifications and incorporate illustrations to produce online documents, offset reproduction masters, 35mm color slides, movie titles, or viewgraphs. The flexibility of the system is greatly enhanced by the use of a device independent graphics library. Text may be plotted using the hardware characters specific to a device (when possible), or may be drawn as Hershey characters or polygonally outlined symbols. Illustrations may be defined in a simple 2d graphics language, and graphical output from application programs may also be incorporated directly into a document.

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

color use flexibility graphics user online sharing systems users language device text hardware manipulation documentation laboratory

applications
computation
text processing
timing
libraries
interaction
program
printing
character
documentation graphics
color graphics
integrability


Robust time-varying filtering and separation of some nonstationary signals in low SNR environments The proposed algorithm improves filtering performance for monocomponent signals. The proposed algorithm separates multicomponent signals into individual components. The requirement of high sampling rates is significantly relaxed. The proposed algorithm is implemented with low complexity.

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

time-varying filtering
multi-component separation
instantaneous frequency estimation
sinusoidal timefrequency distribution


Towards a general neural controller for quadrupedal locomotion Our study aims at the design and implementation of a general controller for quadruped locomotion, allowing the robot to use the whole range of quadrupedal gaits (i.e.from low speed walking to fast running). A general legged locomotion controller must integrate both posture control and rhythmic motion control and have the ability to shift continuously from one control method to the other according to locomotion speed. We are developing such a general quadrupedal locomotion controller by using a neural model involving a CPG (Central Pattern Generator) utilizing ground reaction force sensory feedback. We used a biologically faithful musculoskeletal model with a spine and hind legs, and computationally simulated stable stepping motion at various speeds using the neuro-mechanical system combining the neural controller and the musculoskeletal model. We compared the changes of the most important locomotion characteristics (stepping period, duty ratio and support length) according to speed in our simulations with the data on real cat walking. We found similar tendencies for all of them. In particular, the swing period was approximately constant while the stance period decreased with speed, resulting in a decreasing stepping period and duty ratio. Moreover, the support length increased with speed due to the posterior extreme position that shifted progressively caudally, while the anterior extreme position was approximately constant. This indicates that we succeeded in reproducing to some extent the motion of a cat from the kinematical point of view, even though we used a 2D bipedal model. We expect that such computational models will become essential tools for legged locomotion neuroscience in the future.

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

quadruped
neural controller
cpg
rhythmic motion
posture


On the superlinear local convergence of a filter-SQP method Transition to superlinear local convergence is shown for a modified version of the trust-region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and Toint [8]. Hereby, the original trust-region SQP-steps can be used without an additional second order correction. The main modification consists in using the Lagrangian function value instead of the objective function value in the filter together with an appropriate infeasibility measure. Moreover, it is shown that the modified trust-region filter-SQP method has the same global convergence properties as the original algorithm in [8].

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

nonlinear programming
global convergence
filter


Multiway covariates regression models An abundance of methods exist to regress a y variable on a set of x variables collected in a matrix X. In the chemical sciences a growing number of problems translate into arrays of measurements X and Y, where X and Y are three-way arrays or multiway arrays. In this paper a general model is described for regressing such a multiway Y on a multiway X, while taking into account three-way structures in X and Y. A global least squares optimization problem is formulated to estimate the parameters of the model. The model is described and illustrated with a real industrial example from batch process operation. An algorithm is given in an appendix. Copyright (C) 1999 John Wiley & Sons, Ltd.

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

principal covariates regression
partial least squares
multilinear pls
three-way methods
multiway methods


A note on the iterative object symmetry transform ? This paper introduces a new operator named the iterated object transform that is computed by combining the object symmetry transform with the morphological operator erosion. This new operator has been applied on both binary and gray levels images showing the ability to grasp the internal structure of a digital object. We present also some experiments on artificial and real images and potential applications.

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

symmetry transforms
mathematical morphology
image classification
feature extraction


An anelastic allspeed projection method for gravitationally stratified flows This paper looks at gravitationally stratified atmospheric flows at low Mach and Fronde numbers and proposes a new algorithm to solve the compressible Euler equations, in which the asymptotic limits are recovered numerically and the boundary conditions for block-structured local refinement methods are well-posed. The model is non-hydrostatic and the numerical algorithm uses a splitting to separate the fast acoustic dynamics from the slower anelastic dynamics. The acoustic waves are treated implicitly while the anelastic dynamics is treated semi-implicitly and an embedded-boundary method is used to represent orography. We present an example that verifies our asymptotic analysis and a set of results that compares very well with the classical gravity wave results presented by Durran. (c) 2006 Elsevier Inc. All rights reserved.

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

non-hydrostatic atmospheric model
embedded-boundary method
gravity waves


Improvement of cardiac CT reconstruction using local motion vector fields The motion of the heart is a major challenge for cardiac imaging using CT. A novel approach to decrease motion blur and to improve the signal to noise ratio is motion compensated reconstruction which takes motion vector fields into account in order to correct motion. The presented work deals with the determination of local motion vector fields from high contrast objects and their utilization within motion compensated filtered back projection reconstruction. Image registration is applied during the quiescent cardiac phases. Temporal interpolation in parameter space is used in order to estimate motion during strong motion phases. The resulting motion vector fields are during image reconstruction. The method is assessed using a software phantom and several clinical cases for calcium scoring. As a criterion for reconstruction quality, calcium volume scores were derived from both, gated cardiac reconstruction and motion compensated reconstruction throughout the cardiac phases using low pitch helical cone beam CT acquisitions. The presented technique is a robust method to determine and utilize local motion vector fields. Motion compensated reconstruction using the derived motion vector fields leads to superior image quality compared to gated reconstruction. As a result, the gating window can be enlarged significantly, resulting in increased SNR, while reliable Hounsfield units are achieved due to the reduced level of motion artefacts. The enlargement of the gating window can be translated into reduced dose requirements.

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

cardiac ct
motion compensated reconstruction
calcium scoring


Sharing the costs of maintaining environmental resources: a comparison of different programmes Suppose state A controls some resource such as a rainforest and there are some other agents in the international system that wish to see this resource preserved. These agents are prepared to make a contribution towards sharing the costs of maintaining the resource. What would be the long term trajectory of the resource level under different programmes? What type of cost sharing programme would maintain the highest level of the resource? Which programme would give the best value for money for the contributing player? This paper attempts to answer these questions. This is done by examining a dynamic model with an infinite time horizon.

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

environment
international environmental agreements
rainforests
dynamic models
optimal control
resource preservation
debt for equity


Regression based D-optimality experimental design for sparse kernel density estimation This paper derives an efficient algorithm for constructing sparse kernel density (SKD) estimates. The algorithm first selects a very small subset of significant kernels using an orthogonal forward regression (OFR) procedure based on the D-optimality experimental design criterion. The weights of the resulting sparse kernel model are then calculated using a modified multiplicative nonnegative quadratic programming algorithm. Unlike most of the SKD estimators, the proposed D-optimality regression approach is an unsupervised construction algorithm and it does not require an empirical desired response for the kernel selection task. The strength of the D-optimality OFR is owing to the fact that the algorithm automatically selects a small subset of the most significant kernels related to the largest eigenvalues of the kernel design matrix, which counts for the most energy of the kernel training data, and this also guarantees the most accurate kernel weight estimate. The proposed method is also computationally attractive, in comparison with many existing SKD construction algorithms. Extensive numerical investigation demonstrates the ability of this regression-based approach to efficiently construct a very sparse kernel density estimate with excellent test accuracy, and our results show that the proposed method compares favourably with other existing sparse methods, in terms of test accuracy, model sparsity and complexity, for constructing kernel density estimates.

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

probability density function
parzen window estimate
sparse kernel modelling
optimal experimental design
d-optimality


Pulmonary nodule registration in serial CT scans using global rib matching and nodule template matching We propose an automatic nodule registration method between baseline and follow-up chest CT scans. Initial alignment using the center of the lung volume corrects the gross translational mismatch, and rigid registration using coronal and sagittal maximum intensity projection images effectively refines the rigid motion of the lungs. Nodule correspondences are established by finding the most similar region in terms of density as well as the geometrical constraint. The proposed nodule registration method increased the nodule hit rate (the ratio of the number of successfully matched nodules to total nodule number) from 26% to 100%.

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

pulmonary nodule registration
rib matching
nodule template matching

geometrical constraint using log-polar image


robotics in special needs education The purpose of this study is to explore the potential of robotics as an educational tool in special needs education. Qualitative case studies are used to increase knowledge about programmable LEGO NXT and Topobo robotics constructions kits in special needs education, and about the social robot and Topobo that are used in early childhood education when possible learning disabilities have not yet been diagnosed. This study aims to provide suggestions about how robotics might be used to recognize disabilities at an early stage of education and to compensate for them in learning.

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

robotics
social robot
special needs education

educational technology
programmable construction kit


Applying Fisher's filter to select KDD connections' features and using neural networks to classify and detect attacks Most of the neural networks-based intrusion detection systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything) to the detection process. That is why the purpose of this study is to identify important KDD features which will be used to train a neural network (NN), in order to best classify and detect attacks. Four NNs were studied: Modular, Recurrent, Principal Component Analysis (PCA), and Time-Lag recurrent (TLR) NNs. We investigated the performance of combining the Fisher's filter used as a feature selection technique, with one of the previously cited NNs. Our simulations show that using Fisher's filter improves largely the performance of the four considered NNs in terms of detection rate, attack classification, and computational time.

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

intrusion detection systems
neural networks

knowledge discovery and data mining (kdd) dataset