Congruences and ideals in pseudo effect algebras as total algebras Congruences and ideals in pseudo-effect algebras and their total algebra versions are studied. It is shown that every congruence of the total algebra induces a Riesz congruence in the corresponding pseudo-effect algebra. Conversely, to every normal Riesz ideal in a pseudo-effect algebra there is a total algebra, in which the given ideal induces a congruence of the total algebra. Ideals of total algebras corresponding to lattice-ordered pseudo-effect algebras are characterized, and it is shown that they coincide with normal Riesz ideals in the pseudo-effect algebras.

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

pseudo-effect algebra
commutative directoid


a trait based re-engineering technique for java hierarchies Traits are pure behavior components introduced in the Smalltalk community in order to integrate the traditional class inheritance with a composition mechanism: a class is composed by traits and inherits from superclasses. This offers the advantage of promoting code reuse. In this paper, we tackle the problem of re-engineering a Java hierarchy into traits, by adapting to a Java setting a methodology developed by Lienhard, Ducasse, and Arvalo for a Smalltalk setting, based on Formal Concept Analysis. We illustrate the approach by applying it to the Java input stream library. We also obtain two by-products: (i) we identify clearly some workarounds that programmers must exploit in order to overcome some of the limitations of Java single inheritance; (ii) we single out some features a Java with traits might include, as none of the proposals in the literature in this sense has taken the lead yet.

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

code reuse
formal concept analysis
java
trait


PYTHIA-II: A knowledge/database system for managing performance data and recommending scientific software Often scientists need to locate appropriate software for their problems and then select from among many alternatives. We have previously proposed an approach for dealing with this task by processing performance data of the targeted software. This approach has been tested using a customized implementation referred to as PYTHIA. This experience made us realize the complexity of the algorithmic discovery of knowledge from performance data and of the management of these data together with the discovered knowledge. To address this issue, we created PYTHLA-II-a modular framework and system which combines a general knowledge discovery in databases (KDD) methodology and recommender system technologies to provide advice about scientific software/hardware artifacts. The functionality and effectiveness of the system is demonstrated for two existing performance studies using sets of software for solving partial differential equations. From the end-user perspective, PYTHIA-II allows users to specify the problem to be solved and their computational objectives. In turn, PYTHIA-II (i) selects the software available for the user's problem, (ii) suggests parameter values, and (iii) assesses the recommendation provided. PYTHIA-II provides all the necessary facilities to set up database schemas for testing suites and associated performance data in order to test sets of software. Moreover, it allows easy interfacing of alternative data mining and recommendation facilities. PYTHIA-II is an open-ended system implemented on public domain software and has been used for performance evaluation in several different problem domains.

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

data mining
knowledge discovery in databases
performance evaluation
scientific software

algorithms
experimentation
inductive logic programming
knowledge-based systems
recommender systems


Robust segmentation of primitives from range data in the presence of geometric degeneracy This paper addresses a common problem in the segmentation of range images. We would like to identify and fit surfaces of known type wherever these are a good fit. This paper presents methods for the least-squares fitting of spheres, cylinders, cones, and tori to 3D point data, and their application within a segmentation framework. Least-squares fitting of surfaces other than planes, even of simple geometric type, has been rarely studied. Our main application areas of this research are reverse engineering of solid models from depth-maps and automated 3D inspection where reliable extraction of these surfaces is essential. Our fitting method has the particular advantage of being robust in the presence of geometric degeneracy, i.e.. as the principal curvatures of the surfaces being fitted decrease (or become more equal), the results returned naturally become closer and closer to those surfaces of "simpler type." i.e., planes, cylinders, cones, or spheres, which best describe the data. Many other methods diverge because, in such cases, various parameters or their combination become infinite.

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

nonlinear least squares
geometric distance
cylinder
cone
sphere
torus
surface fitting


Finding the ?-core of a tree An ?-core of a tree T=(V,E) with |V|=n, is a path P with length at most ? that is central with respect to the property of minimizing the sum of the distances from the vertices in P to all the vertices of T not in P. The distance between two vertices is the length of the shortest path joining them. In this paper we present efficient algorithms for finding the ?-core of a tree. For unweighted trees we present an O(n?) time algorithm, while for weighted trees we give a procedure with time complexity of . The algorithms use two different types of recursive principle in their operation.

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


The collateral coverage of data flow criteria when branch testing When exercising program code with test data in an attempt to satisfy a given testing criterion, there will be a concurrent accrual of coverage in respect of other testing criteria. Knowledge of the extent of such collateral coverage can be used to advantage both in providing better estimates of the overheads entailed by the overall testing exercise, and in helping to determine an optimal sequence for the application of a set of testing methods. In this paper, the results deriving from a set of experiments are reported. The aim of the experiments was to investigate the extent of the collateral coverage that is achieved in respect of the data-flow testing criteria when branch testing is undertaken.

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


Stability analysis of the discrete Takagi-Sugeno fuzzy model with time-varying consequent uncertainties In this paper, we present two new robust stability criteria to analyze the robust stability of the discrete Takagi-Sugeno (TS) fuzzy dynamic model with time-varying consequent uncertainties. These proposed robust stability criteria do not need finding a common positive-definite matrix solution of Lyapunov equations and do not need solving any Lyapunov equation, therefore these robust stability criteria enable us to check the robust stability of the discrete TS fuzzy model with more convenient computation and enable us to analyze the robust stability of the discrete TS fuzzy model whose rules do not have a common positive-definite matrix solution of Lyapunov equations. Two examples are included to illustrate the applications of the proposed methods. (C) 2001 Elsevier Science B.V. All rights reserved.

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

control theory
linguistic modeling
discrete takagi-sugeno fuzzy model
time-varying consequent uncertainties
robust stability analysis


Data-reuse-driven energy-aware cosynthesis of scratch pad memory and hierarchical bus-based communication architecture for multiprocessor streaming applications As technology advances, it becomes feasible to implement a large multiprocessor systems-on-chip (MPSoCs) to satisfy the increased performance demands of embedded applications. The increased complexity of systems leads to an increased power consumption. Reducing the consumption is an important task, considering that the available power may be limited in battery-operated embedded systems. The selection of memory and communication architectures affects the power efficiency of the design. In this paper, we propose a novel approach that enables the energy-aware cosynthesis of both memory and communication architectures for streaming applications. As opposed to earlier techniques, we propose a powerful compile-time analysis of memory access behavior in multiprocessor systems, which adds flexibility in selecting scratch-pad-based memory architectures. We propose and compare three memory/communication synthesis techniques, namely, an optimal mixed integer-linear-programming (ILP)based cosynthesis technique, a mixed ILP (MILP)-based traditional two-step synthesis approach, where memory and communication synthesis is sequentially performed, and a cosynthesis heuristic that synthesizes energy-efficient hierarchical busbased communication architectures with guaranteed throughput. Our experimental results on a number of streaming applications show that both the traditional two-step synthesis approach and heuristic result in up to 50% worse power consumption in comparison with our proposed cosynthesis approach. However, on some of the streaming benchmarks, our cosynthesis heuristic approach was able to find optimal or near-optimal results in a much shorter time than the MILP cosynthesis approach.

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

multiprocessor scratch pad memory (spm) hierarchy


A linear time approximation algorithm for ruler folding problem A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ruler Folding Problem", which is NP-Complete is to find the minimum length of the folded chain. The best linear approximation algorithm for it were proposed by Hopcroft et al. Their algorithm folds any open chain in the interval whose length is less than 2m(1), where m(1) is the length of the longest link in the chain. We propose a linear time approximation algorithm using O(1) additional space. Our algorithm has lower upper bound for the length of the folded chain which is max{2m(1)- m(1)- m(2)/2(k) - 2, Sigma(k-1)(i=0) m(1)/2(i)} where m(1) and m(2) are the lengths of the two distinct maximum length links in the chain respectively, and k is the number of links whose lengths are m1 in the chain. Hence it is the best known approximation algorithm for "Ruler Folding Problem".

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

carpenter's ruler
approximation algorithms


Optimized features selection for gender classification using optimization algorithms Optimized feature selection is an important task in gender classification. The optimized features not only reduce the dimensions, but also reduce the error rate. In this paper, we have proposed a technique for the extraction of facial features using both appearance-based and geometric-based feature extraction methods. The extracted features are then optimized using particle swarm optimization (PSO) and the bee algorithm. The geometric-based features are optimized by PSO with ensemble classifier optimization by the genetic algorithm. Using this approach, we have obtained promising results in terms of the classification error rate and computation time minimization. Moreover, our optimized feature-based method is robust to illumination, noise, and occlusion changes.

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

gender classification
facial features
particle swarm optimization
genetic algorithm
bee algorithm


Initial Synchronisation of Wideband and UWB Direct Sequence Systems: Single- and Multiple-Antenna Aided Solutions This survey guides the reader through the open literature on the principle of initial synchronisation in single-antenna-assisted single-and multi-carrier Code Division Multiple Access (CDMA) as well as Direct Sequence-Ultra WideBand (DS-UWB) systems, with special emphasis on the DownLink (DL). There is a paucity of up-to-date surveys and review articles on initial synchronization solutions for MIMO-aided and cooperative systems - even though there is a plethora of papers on both MIMOs and on cooperative systems, which assume perfect synchronization. Hence this paper aims to fill the related gap in the literature.

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


ECG beat classification using particle swarm optimization and radial basis function neural network This paper presents a method for electrocardiogram (ECG) beat classification based on particle swarm optimization (PSO) and radial basis function neural network (RBFNN). Six types of beats including Normal Beat, Premature Ventricular Contraction (PVC), Fusion of Ventricular and Normal Beat (F), Atrial Premature Beat (A), Right Bundle Branch Block Beat (R) and Fusion of Paced and Normal Beat (f) are obtained from the MIT-BIH arrhythmia database. Four morphological features are extracted from each beat after the preprocessing of the selected records. For classification stage of the extracted features, a RBFNN structure which is evolved by particle swarm optimization is used. Several experiments are performed over the test set and it is observed that the proposed method classifies ECG beats with a smaller size of network without making any concessions on the classification performance.

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

radial basis function neural networks
arrhythmia classification


Transforming a hospital through growing, not building, an electronic patient record system The benefits for any health care provider of successfully introducing an Electronic Patient Record System (EPRS) into their organisation can be considerable. It has the potential to enhance both clinical care and managerial processes, as well as producing more cost-effective care and care programmes across clinical disciplines and health care sectors. However, realising an EPRS's full potential can be a long and difficult process and should not be entered into lightly. Introducing an EPR System involves major personnel, organisational and technological changes. These changes must be interwoven and symbiotic and must be managed so that they grow together in stages towards a vision created and shared by all clinical professional staff, other staff, and managers in that process. The use of traditional "building" or "journey" metaphors inadequately reflects the complexity, uncertainty and, therefore, the unpredictability of the process. We propose that a more useful metaphor may be of "growing" a progressively more united, unified information system and health care organisation. We suggest this metaphor better recognises that the evolutionary process appears to be more organic than predictable and more systemic than mechanistic. An illustration is given of how these organisational clinical and technical issues might evolve and interweave in a hospital setting through a number of stages.

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

organizational change
implementation
information systems


How has volatility in metals markets changed? Within the industrial metals industry, there has been a great deal of interest surrounding trends in metals market volatility over time. This paper uses a rolling AR(1)-GARCH(1,1) model to estimate and forecast the volatility processes for daily returns on the futures prices of two important non-ferrous metals, namely aluminium and copper. The rolling models are used to examine how the processes driving aluminium and copper returns volatility have evolved over a long sample. The variation over time seen in the volatility processes, as modelled by GARCH, suggest that, while volatility in returns has not necessarily increased, the conditional volatility process in metals markets is itself time-varying when analysed over a long horizon. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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


real-time volumetric shadows using 1d min-max mipmaps Light scattering in a participating medium is responsible for several important effects we see in the natural world. In the presence of occluders, computing single scattering requires integrating the illumination scattered towards the eye along the camera ray, modulated by the visibility towards the light at each point. Unfortunately, incorporating volumetric shadows into this integral, while maintaining real-time performance, remains challenging. In this paper we present a new real-time algorithm for computing volumetric shadows in single-scattering media on the GPU. This computation requires evaluating the scattering integral over the intersections of camera rays with the shadow map, expressed as a 2D height field. We observe that by applying epipolar rectification to the shadow map, each camera ray only travels through a single row of the shadow map (an epipolar slice), which allows us to find the visible segments by considering only 1D height fields. At the core of our algorithm is the use of an acceleration structure (a 1D minmax mipmap) which allows us to quickly find the lit segments for all pixels in an epipolar slice in parallel. The simplicity of this data structure and its traversal allows for efficient implementation using only pixel shaders on the GPU.

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

volumetric scattering
global illumination


Learning Linear and Nonlinear PCA with Linear Programming An SVM-like framework provides a novel way to learn linear principal component analysis (PCA). Actually it is a weighted PCA and leads to a semi-definite optimization problem (SDP). In this paper, we learn linear and nonlinear PCA with linear programming problems, which are easy to be solved and can obtain the unique global solution. Moreover, two algorithms for learning linear and nonlinear PCA are constructed, and all principal components can be obtained. To verify the performance of the proposed method, a series of experiments on artificial datasets and UCI benchmark datasets are accomplished. Simulation results demonstrate that the proposed method can compete with or outperform the standard PCA and kernel PCA (KPCA) in generalization ability but with much less memory and time consuming.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 component analysis
linear programming


Photoluminescence beyond 1.5?m from InAs quantum dots Photoluminescence measurements were carried out to investigate the origin of long wavelength emissions (?1.6?m at room temperature) observed from wafers with InAs quantum dots capped with GaAsSb layers. For wafers with high Sb content (22% and 26%) photoluminescence peak energies were found to be linearly proportional to third root of optical excitation power, a characteristic of emission due to a type-II band alignment. This work therefore presents unambiguous evidence that the long wavelength emission of the wafers comes from type-II band alignment between the InAs quantum dots and the GaAsSb capping layers.

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


multi-source domain adaptation and its application to early detection of fatigue We consider the characterization of muscle fatigue through noninvasive sensing mechanism such as surface electromyography (SEMG). While changes in the properties of SEMG signals with respect to muscle fatigue have been reported in the literature, the large variation in these signals across different individuals makes the task of modeling and classification of SEMG signals challenging. Indeed, the variation in SEMG parameters from subject to subject creates differences in the data distribution. In this paper, we propose a transfer learning framework based on the multi-source domain adaptation methodology for detecting different stages of fatigue using SEMG signals, that addresses the distribution differences. In the proposed framework, the SEMG data of a subject represent a domain; data from multiple subjects in the training set form the multiple source domains and the test subject data form the target domain. SEMG signals are predominantly different in conditional probability distribution across subjects. The key feature of the proposed framework is a novel weighting scheme that addresses the conditional probability distribution differences across multiple domains (subjects). We have validated the proposed framework on Surface Electromyogram signals collected from 8 people during a fatigue-causing repetitive gripping activity. Comprehensive experiments on the SEMG data set demonstrate that the proposed method improves the classification accuracy by 20\% to 30\% over the cases without any domain adaptation method and by 13\% to 30\% over the existing state-of-the-art domain adaptation methods.

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

transfer learning
surface electromyogram

subject based variability
multi-source domain adaption


Smart pump alerts: All that glitters is not gold The implementation of smart pump technology can reduce the incidence of errors in the administration of intravenous drugs. This approach involves developing drug libraries for specific units and setting hard and soft limits for each drug. If a programming error occurs and these limits are exceeded, an alarm sounds and the infusion can be blocked. A detailed analysis of these alarms is essential in order not to bias the results in favor of a positive impact of this technology. To evaluate the results of the first analysis of the use of smart infusion pumps and to assess the significance and practical implications of the alarms sounded. The study was performed by a multidisciplinary team that consisted of a clinical pharmacist, a pediatrician from the pediatric intensive care unit (PICU), and the chief nurse of the unit. A library of 108 drugs was developed over a 7-month period and introduced into 40 syringe pumps and 12 volumetric pumps (Alaris with Plus software) before being applied in 6 of the 11 beds in the PICU. After four month's use, data were analyzed using the Guardrails CQI v4.1 Event Reporter program. Following the first four months of implementation, compliance with the drug library was 87%. By analyzing the alerts triggered, we were able to detect problems such as the need to increase user training, readjust limits that did not correspond to clinical practice, correct errors in the editing of the drug library and including a training profile. It is difficult to obtain accurate data on the true impact of this technology in the early stages of its implementation. This preliminary analysis allowed us to identify improvement measures to distinguish, in future evaluations, the alarms triggered by a real programming error from those caused by incorrect use.

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


Binary zero-correlation zone sequence set construction using a cyclic Hadamard sequence The present paper introduces a new construction of a class of binary periodic sequence set having a zero-correlation zone (hereinafter binary ZCA sequence set). The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The present paper shows that such a construction generates a binary ZCA sequence set by using a cyclic difference set and a collection of mutually orthogonal complementary sets.

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

cyclic difference set
cyclic hadamard sequence
mutually orthogonal complementary sets


Analysis of the WAP protocol over SMS in GSM networks This paper, based on the PALIO Project within the fifth Research Framework of the European Commission, deals with an information tourist service accessible through mobile phones by means of the Wireless Application Protocol (WAP). We have considered a Global System for Mobile communications (GSM) network where the WAP traffic is transported by the Short Message Service (SMS) on a logical channel that also conveys signaling messages. Suitable models have been considered for both WAP browsing traffic and signaling traffic. We have proposed a theoretical approach to evaluate the mean delay to browse a WAP page taking into account the impact of the signaling load. Analytical predictions have been validated through comparisons with simulation results. Moreover, we have also considered a specific Quality of Service (QoS) requirement in terms of the maximum deck transmission delay that is guaranteed in 95 per cent of cases. Consequently, it has been possible to evaluate the number of WAP users that can be supported per cell. The study carried out in this paper permits to prove the feasibility for the envisaged mobile service based on WAP and it also allows dimensioning WAP pages so that each user experiences reasonable browsing delays. Copyright 2001 John Wiley & Sons, Ltd.

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

personal communications
traffic modeling


Solving modern mixed-size placement instances Physical design of modern systems-on-chip is extremely challenging. Such digital integrated circuits often contain tens of millions of logic gates, intellectual property blocks, embedded memories and custom register-transfer level (RTL) blocks. At current and future technology nodes, their power and performance are impacted, more than ever, by the placement of their modules. However, our experiments show that traditional techniques for placement and floorplanning, and existing academic tools cannot reliably solve the placement task. To study this problem, we identify particularly difficult industrial instances and reproduce the failures of existing tools by modifying pre-existing benchmark instances. Furthermore, we propose algorithms that facilitate placement of these difficult instances. Empirically, our techniques consistently produce legal placements, and on instances where comparison is possible, reduce wirelength by 13% over Capo 9.4 and 31% over PATOMA 1.0the pre-existing tools that most frequently produce legal placements in our experiments.

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


emotions experienced by families living at a distance This paper describes some of the results of a probe study where members of three-generational families, where at least one person is geographically separated from the others, talk about their emotional experiences. The method for eliciting this information is briefly described along with some of the themes identified in a grounded theory analysis. These include: sharing the moment with pride; reassurance with regard to intergenerational obligations; comfort and consolation from yearning; and little time to give comfort to one another.

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

affective communication
presence technology
probes
emotion


unbiased tournament selection Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection introduces a sampling bias into the selection process. We review analytic results and present empirical evidence that shows this bias has a significant impact on search performance. We introduce two new forms of unbiased tournament selection that remove or reduce sampling bias in tournament selection.

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

evolutionary computation
loss of diversity


Segregation of the bulk blend fertilizers Bulk blend fertilizers are a mixture of different kinds of fertilizers in order to obtain a predicted N-P-K chemical composition. Although this production method has some advantages, segregation appears at different stages, from the production to the final spreading on the field. An experiment has been implemented to predict and quantify the influence of some physical properties on the occurrence of segregation. The principle was to blend two fertilizers having identical physical properties except for one, such as size, shape or density and to measure the segregation of the blend following various operations, such as filling or emptying a container. Results show that the spread of the fragment size distribution has a big influence on the segregation of the generated heap. In order to reduce this phenomenon, the granulometric spread index (GSI) [(d(84)-d(16))/2d(50)] must be smaller than 10. Other properties don't seem to have an influence. The granulometric segregation can lead to a chemical heterogeneity. The absolute sum of the difference between d(16) and d(84) must be limited around 0.5 mm. Above this value, the chemical segregation begins to be excessive. It seems also that if there is a limited difference in size for the components, the chemical segregation is amplified if the density of the fertilizer with the biggest particles is lower. It is not the case for the difference in shape. (C) 2004 Elsevier B.V. All rights reserved.

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


A different DeutschJozsa One of the early achievements of quantum computing was demonstrated by Deutsch and Jozsa (Proc R Soc Lond A Math Phys Sci 439(1907):553, 1992) regarding classification of a particular type of Boolean functions. Their solution demonstrated an exponential speedup compared to classical approaches to the same problem; however, their solution was the only known quantum algorithm for that specific problem so far. This paper demonstrates another quantum algorithm for the same problem, with the same exponential advantage compared to classical algorithms. The novelty of this algorithm is the use of quantum amplitude amplification, a technique that is the key component of another celebrated quantum algorithm developed by Grover (Proceedings of the twenty-eighth annual ACM symposium on theory of computing, ACM Press, New York, 1996). A lower bound for randomized (classical) algorithms is also presented which establishes a sound gap between the effectiveness of our quantum algorithm and that of any randomized algorithm with similar efficiency.

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

quantum algorithm
deutschjozsa
amplitude amplification
lower bound
randomized algorithm


Intelligent spam filtering for massive short message stream Purpose - The purpose of this paper is to provide an intelligent spam filtering method to meet the real-time processing requirement of the massive short message stream and reduce manual operation of the system. Design/methodology/approach - An integrated framework based on a series of algorithms is proposed. The framework consists of message filtering module, log analysis module and rules handling module, and dynamically filters the short message spam, while generating the filtering rules. Experiments using Java are used to execute the proposed work. Findings -The experiments are carried out both on the simulation model (off-line) and on the actual plant (on-line). All experiment data are considered in both normal and spam real short messages. The results show that use of the integrated framework leads to a comparable accuracy and meet the real-time filtration requirement. Originality/value - The approach in the design of the filtering system is novel. In addition, implementation of the proposed integrated framework allows the method not only to reduce the computational cost which leads to a high processing speed but also to filter spam messages with a high accuracy.

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

internet
data management
information technology
mobile technology
mobile networks
programming and algorithm theory
spam filtration
massive data processing
sampling algorithm


performance evaluation of a selective cooperative scheme for wireless sensor networks Wireless sensor networks are becoming popular in many industrial and civilian application areas. The need is to improve the performance of such systems that can be significantly done by using adaptive cooperative diversity (SCA) technique, which is basically a cross-layer design that combines truncated ARQ at the link layer and cooperative diversity at the physical layer. In addition to it, LEACH protocol gives advantage of utilizing randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. This paper proposes an integrated system, SCA with LEACH and evaluates its performance with LEACH with truncated ARQ system. Comparison is done based on network lifetime and packet loss rate of system under varying propagation scenarios, number of retransmissions, initial energy by node and network size. Simulation results show better performances with various achieved thresholds.

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


Study of the behaviour of monomers in thermal nanoimprint lithography Thermoplastics are commonly used in thermal nanoimprint lithography (NIL) but their high viscosity leads to inhomogeneities of residual thickness in patterns with various densities. Monomers exhibit low viscosity and are imprinted easily and polymerized with UVNIL processes. These monomers can be also used for thermal NIL. We have imprinted A-POSS material which is spontaneously polymerized at 170C. The inorganic part of this monomer is interesting for pattern transfer and for permanent applications. Thermal properties of this molecule are presented in this paper. It is shown that polymerization occurs at 170C, and that the viscosity is 1330mPas at ambient temperature. Imprint experiments have demonstrated that A-POSS flows over larger surfaces during imprint step, compared to thermoplastics. Patterns with different densities have been studied and different filling regimes have been observed depending on material viscosity. They are induced by a competition between material flow and mold deformation. Finally, we imprinted some nanoelectrodes simultaneously with millimetric large connection pads, and it was demonstrated that complete filling was obtained with monomers whereas this was not possible with thermoplastics.

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

nanoimprint lithography
monomer
viscosity


Material-specific adaptation of color invariant features For the modeling of materials, the mapping of image features onto a codebook of feature representatives receives extensive treatment. For reason of their generality and simplicity, filterbank outputs are commonly used as features. The MR8 filterbank of Varma and Zisserman is performing well in a recent evaluation. In this paper, we construct color invariant filter sets from the original MR8 filterbank. We evaluate several color invariant alternatives over more than 250 real-world materials recorded under a variety of imaging conditions including clutter. Our contribution is a material recognition framework that learns automatically for each material specifically the most discriminative filterbank combination and corresponding degree of color invariance. For a large set of materials each with different physical properties, we demonstrate the material-specific filterbank models to be preferred over models with fixed filterbanks.

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

image modeling
codebook representation
texture
textons


Modeling and simulation of wind turbine Savonius rotors using artificial neural networks for estimation of the power ratio and torque The power factor and torque of wind turbines are predicted using artificial neural networks (ANNs) based on experimental data which have been collected for seven prototype vertical Savonius rotors tested in a wind tunnel. In this research, the rotors with different configurations were located in the wind tunnel and the tests were repeated 46 times in order to reduce errors. Since the Reynolds number has a negligible effect on power ratio, therefore tip speed ratio (TSR) is the main input parameter to be predicted in neural network. Also, the rotors power factor and torque were simulated for different tip speed ratios and different blade angles. The simulated results show a strong capability for providing reasonable predictions and estimations of the maximum power of rotors and maximizing the efficiency of Savonius turbines. According to artificial neural nets simulations and the experimental results, increasing tip speed ratio leads to a higher power ratio and torque. For all the tested rotors, a maximum and minimum amount of torque has happened at angle of 60o and 120o, respectively.

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

neural networks
savonius rotors
blade angles
tsr
wind tunnel


Inverse viscoelastic material characterization using POD reduced-order modeling in acousticstructure interaction A strategy is presented for applying the proper orthogonal decomposition (POD) technique for model reduction in computational inverse solution strategies for viscoelastic material characterization. POD is used to derive a basis of optimal dimension from a selection of possible solution fields which are generated through a traditional acousticstructure interaction finite element model for a given vibroacoustic experiment. The POD bases are applied with the Galerkin weak-form finite element method to create a reduced-order numerical model with decreased computational cost, but which still maintains accuracy close to that of the original full-order finite element model. The reduced-order model is then combined with a global optimization technique to identify estimates to the viscoelastic material properties of a fluid immersed solid from vibroacoustic tests. A strategy is also presented to select the viscoelastic parameters of the initial full-order analyses used to create the POD bases. The selection process is shown through an example to maximize the generalization capabilities of the reduced-order model over the material search space for a minimal number of full-order analyses. Two examples are then presented in which the parameters of rheological viscoelastic models are identified for solids immersed in water, which are subject to a steady-state harmonic pressure while the acoustic response is measured at a point in the surrounding fluid. The POD reduced-order models were able to generalize over the material search domains for the inverse problems. Therefore, the reduced-order solution strategy was capable of identifying accurate estimates to the viscoelastic behavior of the solids with minimal computational expense.

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

proper orthogonal decomposition
optimization

vibroacoustics
viscoelasticity
inverse problem


max margin learning on domain-independent web information extraction Domain-independent web information extraction can be addressed as a structured prediction problem where we learn a mapping function from an input web page to the structured and interdependent output variables, labeling each block on the page. In this paper, built upon an HTML parser of Internet Explorer that parses and renders a web page based on HTML tags and visual appearance, we propose a max margin learning approach for web information extraction. Specifically, the output of the parser is a vision tree, which is similar to a DOM tree but with visual information, i.e., how each node is displayed. Based on this hierarchical structure, we develop a max margin learning method for labeling each of its nodes. Due to the rich connections between blocks on the web page, we further introduce edges that connect spatially adjacent nodes on the vision tree, complicating the problem into a cyclic graph labeling task. A max margin learning method on cyclic graphs is developed for this problem, where loopy belief propagation is used for approximate inference. Experimental results on web data extraction show the feasibility and promise of our approach.

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

max margin learning
belief propagation
web information extraction


Artificial intelligence techniques applied to the development of a decision-support system for diagnosing celiac disease Background: Celiac disease (CD) is a difficult-to-diagnose condition because of its multiple clinical presentations and symptoms shared with other diseases. Gold-standard diagnostic confirmation of suspected CD is achieved by biopsying the small intestine. Objective: To develop a clinical decision-support system (CDSS) integrated with an automated classifier to recognize CD cases, by selecting from experimental models developed using intelligence artificial techniques. Methods: A web-based system was designed for constructing a retrospective database that included 178 clinical cases for training. Tests were run on 270 automated classifiers available in Weka 3.6.1 using five artificial intelligence techniques, namely decision trees, Bayesian inference, k-nearest neighbor algorithm, support vector machines and artificial neural networks. The parameters evaluated were accuracy, sensitivity, specificity and area under the ROC curve (AUC). AUC was used as a criterion for selecting the CDSS algorithm. A testing database was constructed including 38 clinical CD cases for CDSS evaluation. The diagnoses suggested by CDSS were compared with those made by physicians during patient consultations. Results: The most accurate method during the training phase was the averaged one-dependence estimator (AODE) algorithm (a Bayesian classifier), which showed accuracy 80.0%, sensitivity 0.78, specificity 0.80 and AUC 0.84. This classifier was integrated into the web-based decision-support system. The gold-standard validation of CDSS achieved accuracy of 84.2% and k = 0.68 (p < 0.0001) with good agreement. The same accuracy was achieved in the comparison between the physician's diagnostic impression and the gold standard k = 0. 64 (p < 0.0001). There was moderate agreement between the physician's diagnostic impression and CDSS k = 0.46 (p = 0.0008). Conclusions: The study results suggest that CDSS could be used to help in diagnosing CD, since the algorithm tested achieved excellent accuracy in differentiating possible positive from negative CD diagnoses. This study may contribute towards developing of a computer-assisted environment to support CD diagnosis. (C) 2011 Elsevier Ireland Ltd. All rights reserved.

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


VHD: a system for directing real-time virtual actors In this paper, we present a new system dedicated to the real-time production of multimedia products and TV shows involving multiple virtual actors and presenters. This system, named VHD (Virtual Human Director), may also be used for character animation on high-level systems and interaction with Web-based applications. The user can create virtual stories by directing all actions in real time. It is similar to a movie producer directing actors during filming but with more control given to the director in the sense that everything is decided and controlled by the same person. To make this complicated task possible, in a useable way, we based the interaction on the high-level control of the virtual actor.

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

authoring tool
virtual humans
real-time facial animation
body animation
motion capture
virtual speech
virtual presenter


Dynamic deflection routing with virtual wavelength assignment in optical burst-switched networks In optical burst-switched networks, one of the most significant issues is contention resolution. There have been several deflection routing techniques as contention resolution. While contention is resolved by traditional deflection routing, it cannot guarantee that the control packet will reserve all the wavelengths successfully to the destination on the alternate path, especially when traffic load in a network is high. Therefore, in this paper, we propose a Deflection Routing with Virtual Wavelength Assignment (DR-VWA) algorithm in order to provide a higher resource guarantee for loss-sensitive traffic bursts. The proposed DR-VWA scheme (1) dynamically decides the alternate path with the least traffic load and (2) allows high-priority bursts in terms of loss to be assigned available wavelengths over the path virtually. The proposed scheme is evaluated through simulation, and it is shown that significant improvement with regard to burst loss and wavelength conversion cost can be achieved.

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

optical burst switching
detection routing
burst blocking


Handling defeasibilities in action domains Representing defeasibility is an important issue in common sense reasoning. In reasoning about action and change, this issue becomes more difficult because domain and action related defeasible information may conflict with general inertia rules. Furthermore, different types of defeasible information may also interfere with each other during the reasoning. In this paper, we develop a prioritized logic programming approach to handle defeasibilities in reasoning about action. In particular, we propose three action languages and AF(0), AF(1) and AF(2) which handle three types of defeasibilities in action domains named defeasible constraints, defeasible observations and actions with defeasible and abnormal effects respectively. Each language with a higher superscript can be viewed as an extension of the language with a lower superscript. These action languages inherit the simple syntax of A language but their semantics is developed in terms of transition systems where transition functions are defined based on prioritized logic programs. By illustrating various examples, we show that our approach eventually provides a powerful mechanism to handle various defeasibilities in temporal prediction and postdiction. We also investigate semantic properties of these three action languages and characterize classes of action domains that present more desirable solutions in reasoning about action within the underlying action languages.

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

reasoning about action
logic programming
common sense reasoning
defeasibility


integrating simulation and geographic information system This paper presents the results of a software system which integrates geographical information systems (GIS), object oriented simulation (OOS), and multi-sensor fusion algorithms. This system allows the Navy to evaluate the performance of different multi-sensor configurations in order to identify enemy ships, friendly ships, or other entities present in the ocean. ArcGIS provides geographical information such as seabed composition, bathymetry, and proximity to the coast. The simulation system developed on AnyLogic takes the GIS data as input, and performs simulations to evaluate the impact of the geographical conditions on the ability of the sensors to identify entities in the ocean.

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

geographical information systems
object oriented simulation


SOAP Processing Performance and Enhancement The web services (WS) technology provides a comprehensive solution for representing, discovering, and invoking services in a wide variety of environments, including Service Oriented Architectures (SOA) and grid computing systems. At the core of WS technology lie a number of XML-based standards, such as the Simple Object Access Protocol (SOAP), that have successfully ensured WS extensibility, transparency, and interoperability. Nonetheless, there is an increasing demand to enhance WS performance, which is severely impaired by XML's verbosity. SOAP communications produce considerable network traffic, making them unfit for distributed, loosely coupled, and heterogeneous computing environments such as the open Internet. Also, they introduce higher latency and processing delays than other technologies, like Java RMI and CORBA. WS research has recently focused on SOAP performance enhancement. Many approaches build on the observation that SOAP message exchange usually involves highly similar messages (those created by the same implementation usually have the same structure, and those sent from a server to multiple clients tend to show similarities in structure and content). Similarity evaluation and differential encoding have thus emerged as SOAP performance enhancement techniques. The main idea is to identify the common parts of SOAP messages, to be processed only once, avoiding a large amount of overhead. Other approaches investigate nontraditional processor architectures, including micro-and macrolevel parallel processing solutions, so as to further increase the processing rates of SOAP/XML software toolkits. This survey paper provides a concise, yet comprehensive review of the research efforts aimed at SOAP performance enhancement. A unified view of the problem is provided, covering almost every phase of SOAP processing, ranging over message parsing, serialization, deserialization, compression, multicasting, security evaluation, and data/instruction-level processing.

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

web-based services
xml/xsl/rdf
performance measures
performance evaluation
integrity
protection


Input selection based on an ensemble Since an ensemble of neural networks outperforms a single network, we expect that the selection of input variables based on an ensemble is superior to the selection based on a single neural network. In this article, we will present an algorithm that performs input selection based on an ensemble of neural networks. Using this algorithm, the correct sets of variables were found for two artificial problems. Furthermore, for two real-world problems, we determined the relevance of the input variables. Our predictions were equal or better than the predictions of other methods described in the literature.

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

architecture selection
combining classifiers
combining predictors
feature selection
knowledge extraction
subset selection


Dynamic adaptive ensemble case-based reasoning: application to stock market prediction This paper proposes a new learning technique which extracts new case vectors using Dynamic Adaptive Ensemble CBR (DAE CBR). The main idea of DAE CBR originates from finding combinations of parameter and updating and applying an optimal CBR model to application or domain area. These concepts are investigated against the backdrop of a practical application involving the prediction of a stock market index.

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

dynamic ensemble case-based reasoning
artificial neural network
knowledge discovery
data mining
stock price prediction
learning system


Quality of service-aware coordinated dynamic spectrum access: prioritized Markov model and call admission control In this paper, we propose a heterogeneous-prioritized spectrum sharing policy for coordinated dynamic spectrum access networks, where a centralized spectrum manager coordinates the access of primary users (PUs) and secondary users (SUs) to the spectrum. Through modeling the access of PUs and multiple classes of SUs as continuous-time Markov chains, we analyze the overall system performance with consideration of a grade-of-service guarantee for both the PUs and the SUs. In addition, two new call admission control (CAC) strategies are devised in our models to enhance the maximum admitted traffic of SUs for the system. Numerical results show that the proposed heterogeneous-prioritized policy achieves higher maximum admitted traffic for SUs. The trade-off between the system's serving capability and the fairness among multiple classes of SUs is also studied. Moreover, the proposed CAC strategies can achieve better performance under max-sum, proportional, and max-min fairness criteria than the conventional CAC strategies. Copyright (c) 2011 John Wiley & Sons, Ltd.

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


Parallel multi-frontal solver for p adaptive finite element modeling of multi-physics computational problems The paper presents a parallel direct solver for multi-physics problems. The solver is dedicated for solving problems resulting from adaptive finite element method computations. The concept of finite element is actually replaced by the concept of the node. The computational mesh consists of several nodes, related to element vertices, edges, faces and interiors. The ordering of unknowns in the solver is performed on the level of nodes. The concept of the node can be efficiently utilized in order to recognize unknowns that can be eliminated at a given node of the elimination tree. The solver is tested on the exemplary three-dimensional multi-physics problem involving the computations of the linear acoustics coupled with linear elasticity. The three-dimensional tetrahedral mesh generation and the solver algorithm are modeled by using graph grammar formalism. The execution time and the memory usage of the solver are compared with the MUMPS solver.

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

parallel multi-frontal solver
multi-physics problems
p adaptivity
hypermatrix


Cross-layer architecture for scalable video transmission in wireless network ? Multimedia applications such as video conference, digital video broadcasting (DVB), and streaming video and audio have been gaining popularity during last years and the trend has been to allocate these services more and more also on mobile users. The demand of quality of service (QoS) for multimedia raises huge challenges on the network design, not only concerning the physical bandwidth but also the protocol design and services. One of the goals for system design is to provide efficient solutions for adaptive multimedia transmission over different access networks in all-IP environment. The joint source and channel coding (JSCC/D) approach has already given promising results in optimizing multimedia transmission. However, in practice, arranging the required control mechanism and delivering the required side information through network and protocol stack have caused problems and quite often the impact of network has been neglected in studies. In this paper we propose efficient cross-layer communication methods and protocol architecture in order to transmit the control information and to optimize the multimedia transmission over wireless and wired IP networks. We also apply this architecture to the more specific case of streaming of scalable video streams. Scalable video coding has been an active research topic recently and it offers simple and flexible solutions for video transmission over heterogeneous networks to heterogeneous terminals. In addition it provides easy adaptation to varying transmission conditions. In this paper we illustrate how scalable video transmission can be improved with efficient use of the proposed cross-layer design, adaptation mechanisms and control information.

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

scalable video coding (svc)
cross-layer communication design
multimedia delivery
udp-lite
rtp packetization
wlan link layer scheduling
medium access control (mac)


Information System Planning and Decision Making Framework: A Case Study Although numerous academic and industry studies have identified a variety of connections among strategies, processes, and systems, the phenomenon of information system adoption and post-implementation failure is still common. One factor in system adoption that has not yet been thoroughly considered is the conceptualization of processes and systems at multiple levels of complexity. This paper uses a case study to illustrate a framework that outlines the flow of conceptualization efforts during system adoption and implementation.

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

information system planning
adoption
implementation
conceptualization


On managing traffic over virtual private network links A Virtual Private Network (VPN) provides corporate networking between geographically dispersed company sites. VPN sites consist of Local Area Networks (LANs) interconnected over a public network infrastructure, through virtual links. The goal of this work is to develop a control model able to manage traffic on these links. By maximizing bandwidth utilization on each link, an optimum balance for the allocation of bandwidth on the entire VPN can be found. The proposed model is called hierarchical bandwidth manager and is implemented in each LAN of the VPN, It is also able to cope with best-effort and guaranteed flows so that bandwidth left unused by guaranteed hows is dynamically distributed among best-effort ones. In each LAN, a tree representation is used to share the capacity of each virtual link between multiple flows in a hierarchical and distributed manner. Each node in the tree respects an inter-node bandwidth share protocol and/or is regulated through an intra-host regulation mechanism. This latter is implemented through a new technique which we call the fair shaper. An implementation of this technique in a Solaris 2.5 operating system and results of the implementation of the inter-node bandwidth share protocol in the ns network simulator are also described in this paper.

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

traffic shaping
pair packet scheduling
hierarchical bandwidth management


Code-based analysis of the development effort of a large scale courseware project This paper investigates proposed code-based measures for multimedia courseware as part of an on-going program of research into effort estimation models. The proposed code-based size measures are analysed using source code and project data from WinEcon courseware written in the ToolBook authoring language. Statistical analysis of a priori, ToolBook specific and portable subsets of 47 code measurements are presented along with proposed predictive models of courseware development effort based on a priori, best subset and portable subset modelling assumptions. (C) 1997 Elsevier Science B.V.

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


Design and implementation of the E-referencer An expert system Web interface to online catalogs called E-Referencer is being developed. An initial prototype has been implemented. The interface has a repertoire of initial search strategies and reformulation strategies that it selects and implements to help users retrieve relevant records. It uses the Z39.50 protocol to access library systems on the Internet. This paper describes the design and implementation of the E-Referencer. A preliminary evaluation of the strategies is also presented.

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

online cataloge searches
information rerieval
knowledge-based approach
z39.50 standard


Adaptive learning via selectionism and Bayesianism, Part I: Connection between the two According to the selection-by-consequence characterization of operant learning, individual animals/species increase or decrease their future probability of action choices based on the consequence (i.e.,reward or punishment) of the currently selected action (the so-called Law of Effect). Under Bayesianism, on the other hand, evidence is evaluated based on likelihood functions so that action probability is modified from a priori to a posteriori according to the Bayes formula. Viewed as hypothesis testing, a selectionist framework attributes evidence exclusively to the selected, focal hypothesis, whereas a Bayesian framework distributes across all hypotheses the support from a piece of evidence. Here, an intimate connection between the two theoretical frameworks is revealed. Specifically, it is proven that when individuals modify their action choices based on the selectionists Law of Effect, the learning population, on the ensemble level, evolves according to a Bayesian-like dynamics. The learning equation of the linear operator model [Bush, R. R., & Mosteller, F. (1955). Stochastic models for learning, New York: John Wiley and Sons], under ensemble averaging, yields the class of predictive reinforcement learning models (e.g.,[Busemeyer, J. R., & Myung, I. J. (1992). An adaptive approach to human decision making: Learning theory, decision theory, and human performance. Journal of Experimental Psychology: General, 121, 177194; Montague, P. R., Dayan, P., & Sejnowski, T. J. (1996). A framework for mesencephalic dopamine systems based on predictive Hebbian learning. Journal of Neuroscience, 16, 19361947]).

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

operant conditioning
stochastic learning automata
bayesian update
gibbsboltzman distribution


Multilayer perceptron for reference evapotranspiration estimation in a semiarid region Calculation of reference evapotranspiration (ETo) is essential in hydrology and agriculture. ETo plays an important role in planning and management of water resources and irrigation scheduling. The results of many studies strongly support the use of the PenmanMonteith FAO 56 (PMF-56) method as the standard method of estimating ETo. The basic obstacle to using this method widely is the numerous meteorological variables required. Multilayer perceptron (MLP) networks optimized with different learning algorithms and activation functions were applied for estimating ETo in a semiarid region in Iran. Four MLP models comprising various combinations of meteorological variables are developed. The MLP model which needs all of the meteorological parameters performed best for ETo estimation amongst the other MLP models. It was also found that the ConjugateGradient, DeltaBarDelta, DeltaBarDelta and LevenbergMarquardt were the best algorithms for training the MLP1, MLP2, MLP3 and MLP4 models, respectively.

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

reference evapotranspiration
meteorological parameters
iran

artificial neural network
learning algorithm


Image recognition using Simplified Fuzzy ARTMAP augmented with a moment based feature extractor The capability of Kasuba's Simplified Fuzzy ARTMAP (SFAM) to behave as a Pattern Recognizer/Classifier of images both noisy and noise free has been investigated in this paper. This calls for augmenting the original Neuro-Fuzzy model with a modified moment-based RST invariant feature extractor. The potential of the SFAM based Pattern Recognizer to recognize patterns - monochrome and color, noisy and noise free - has been studied on two experimental problems. The first experiment which concerns monochrome images, pertains to recognition of satellite images, a problem discussed by Wang et at. The second experiment, which concerns color images, deals with the recognition of some sample test colored patterns. The results of the computer simulation have also been presented.

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

moments
feature extraction
pattern recognition


Understanding and forecasting hypoxia using machine learning algorithms This study's primary objective lies in short-term forecasting of where and when hypoxia may transpire to enable observing its effects in real time, focusing on a case study in Corpus Christi Bay (Texas). Dissolved oxygen levels in this bay can be characterized by three temporal trends (daily, seasonal, and long-term). To predict hypoxic events, these three mathematical trends are isolated and extracted to obtain unbiased forecasts using a sequential normalization approach. Next, machine learning algorithms are constructed employing the continuous, normalized values from a variety of sensor locations. By including latitude and longitude coordinates as additional variables, a spatial depiction of hypoxic conditions can be illustrated effectively, allowing for more efficient summer data collection and more accurate, near-real-time projections. Using k-nearest neighbor and regression tree algorithms, approximate probabilities of observing hypoxia the following day were calculated, and estimates of dissolved oxygen levels were also computed. During periods in which hypoxia was observed, forecast probabilities of hypoxia exceeded 80%. Conversely, during periods in which no hypoxia was observed, the model's estimate remained below 20%. These results indicate that the modeling approach produces reasonable forecasts for this case study.

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


pattern computation for compression garment This paper addresses the problem of computing planar patterns for compression garments. In the garment industry, the compression garment has been more and more widely used to retain a shape of human body, where certain strain (or normal pressure) is designed at some places on the compression garment. Variant values and distribution of strain can only be generated by sewing different 2D patterns and warping them onto the body. We present a physical/geometric approach to compute 2D meshes that, when folded onto the 3D body, can generate a user-defined strain distribution through proper distortion. This is opposite to the widely studied mesh parameterization problem, whose objective is to minimize the distortion between the 2D and 3D meshes in angle, area or length.

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


The scope of application of multi-agent systems in the process industry: three case studies It has been suggested that multi-agent systems (MAS) are specially adequate for the solution of problems with a dynamic, uncertain and distributed nature. Within industrial applications, there is a wide spectrum of problems with these characteristics, in particular those covering the modelling of artifacts, methodologies and organisations. Three case studies on the application of MAS in the process industry are presented. All of them relate to tools that are being developed to support very diverse core tasks in the process industry (and, by extension, the petroleum industry): An intelligent search system composed of Internet information agents which are able to gather, compile and classify data available in web pages related to a specific technological domain. This search engine is the first step towards the construction of a knowledge management platform that will allow chemical process industries to improve their capabilities to monitor, predict and respond to technological trends and challenges. A system to support the concurrent design of processes, to ease communication between engineers who perform design and keep them informed about the progress of the design process. A tool to support the configuration of work teams. This tool will assist in the configuration of the most suitable team for a specific project. It takes into account the ideal size of the team (2 to n members); its specific composition (managers, engineers/scientists, assistants, etc.); and the proposed type of organisation (centralised, tree hierarchy, etc.). These case studies are representative of a large variety of the possible applications of agent based systems in the process industry.

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

multi-agent systems
ontologies
design and re-design of processes
social simulation


Analogic: Inference beyond logic Analogic is the unique class of many-valued, non-monotonic logics which preserves the richness of inferences in (Boolean) logic and the manipulability of (Boolean) algebra underlying logic, and, in addition, contains a number of unexpected, emergent properties which extend inferentiability in non-trivial ways beyond the limits of logic. For example, one such inference is rada (reductio ad absurdum, reasoning by contradiction, but now in the absence of excluded middle). This is important to retain since direct proofs of many theorems are not known. Another example is chaining. Transitivity is uncommon in many-valued logics; however, in analogic we can carry out inferences in either direction even through weak links in the chain. The latter, impossible in logic, simulate intuitive leaps in reasoning. Protologic effects inferences using only (n+1) implications which require 2n implications in logic. Indeed protologic has no counterpart in logic, or any other form of reasoning. Analogic is useful in formulating problems which are largely inferential including document and pattern classification and retrieval. These inference properties, long sought after in alternative logics by adding appropriate axioms or other indicative implicit or explicit restrictions, are now available in analogic, in turn the result of removing an axiom and letting inferences become many-valued.

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

many-valued logic
non-monotonic logic
fuzzy logic
fidelity


High-order pole-treatment in cylindrical coordinates for incompressible flow simulations with finite-difference collocated schemes A finite-difference collocated scheme is proposed for the simulation of unsteady incompressible flows in cylindrical coordinates. The RhieChow flux-interpolation technique is used to avoid the oddeven decoupling of the pressure field. It is shown that the calculation of the Coriolis and centrifugal acceleration terms based on the cell-center values lead to numerical instabilities near the pole in the inviscid regime. To avoid this issue, a new formulation based on the combination of cell-center and cell-face velocity components is proposed for the calculation of these terms. Furthermore, a new pole treatment methodology is introduced to calculate the viscous terms, resulting single-valued properties at the pole. As regards the extensions of the present scheme to higher orders of accuracy, a fourth-order spatial discretization is also introduced and verified. Moreover, it is shown that for higher-order extensions, the present pole treatment is able to preserve the order of accuracy and the L2 L 2 -norm and L? L ? -norm errors are greatly improved in comparison with the previous schemes. The robustness of the present method is assessed via five different numerical tests including laminar flows in a polar cavity, vortex-wall interaction, evolution of a monopole vortex-system to a tripole vortex-system, advection of the lamb dipole, and large eddy simulation (LES) of turbulent pipe flows. Compared to the previous LES results for turbulent pipe flows, significant improvement is obtained for the mean and fluctuating velocities especially at the core region of the channel. Similarly, at the wall region, the fluctuating axial and azimuthal velocities and the skewnesses of the axial and radial velocities are very close to the previous direct numerical simulation and experimental data.

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

cylindrical coordinates
collocated scheme
les

finite difference
high-order pole-treatment
axis treatment
coriolis force


Intelligent short-term load forecasting in Turkey A method is proposed to forecast Turkeys total electric load one day in advance by neural networks. A hybrid learning scheme that combines off-line learning with real-time forecasting is developed to use the available data for adapting the weights and to further adjust these connections according to changing conditions. Data are clustered due to the differences in their characteristics. Special days are extracted from the normal training sets and handled separately. In this way, a solution is provided for all load types, including working days, weekends and special holidays. A traditional ARMA model is constructed for the same data as a benchmark. Proposed method gives lower percent errors all the time, especially for holidays. The average error for year 2002 is obtained as 1.60%.

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


On the lot-type design problem We consider the problem of approximating the branch- and size-dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available lot-types. We propose a formalized model that arises from a practical cooperation with an industry partner. Besides an integer linear programming formulation, we provide an appropriate primal heuristic for this problem.

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

p-median problem
facility location problem
integer linear program formulation
real-world data
location-allocation


Classification-based self-adaptive differential evolution and its application in multi-lateral multi-issue negotiation Multi-lateral multi-issue negotiations are the most complex realistic negotiation problems. Automated approaches have proven particularly promising for complex negotiations and previous research indicates evolutionary computation could be useful for such complex systems. To improve the efficiency of realistic multi-lateral multi-issue negotiations and avoid the requirement of complete information about negotiators, a novel negotiation model based on an improved evolutionary algorithm p-ADE is proposed. The new model includes a new multi-agent negotiation protocol and strategy which utilize p-ADE to improve the negotiation efficiency by generating more acceptable solutions with stronger suitability for all the participants. Where p-ADE is improved based on the well-known differential evolution (DE), in which a new classification-based mutation strategy DE/rand-to-best/pbest as well as a dynamic self-adaptive parameter setting strategy are proposed. Experimental results confirm the superiority of p-ADE over several state-of-the-art evolutionary optimizers. In addition, the p-ADE based multiagent negotiation model shows good performance in solving realistic multi-lateral multi-issue negotiations.

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

global optimum
e-commerce
agent
multi-lateral multi-issue negotiation


Usability of optically simulated haptic feedback In this contribution a method will be described to optically simulate haptic feedback without resorting to mechanical force feedback devices. This method exploits the domination of the visual over the haptic modality. The perception of haptic feedback, usually generated by force feedback devices, was simulated by tiny displacements on the cursor position relative to the intended force. The usability of optically simulated haptic feedback (OSHF) was tested experimentally by measuring effectiveness, efficiency and satisfaction of its users in a Fitts type target-acquisition task and comparing the results with the usability of mechanically simulated force feedback and normal feedback. Results show that OSHF outperforms mechanically simulated haptic feedback and normal feedback, especially in the case of small targets.

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

user interfaces
gui
haptics
simulation
interactive animation
target acquisition
multisensory perception
interaction styles


Spatial model steering, an exploratory approach to uncertainty awareness in land use allocation ? One evidenced based approach for exploring future agricultural land use change scenarios is Land Use Allocation (LUA). This approach can be used to support medium to long term strategic planning. Specifically, land managers can consider a number of diverse environmental social, economic and physical factors, and explore land use allocation scenarios before choosing to produce one or more commodities in a given region. One of the most successful ways to implement a LUA approach is through the integration of geoprocessing with Multi-Criteria Decision Making methods (MCDM). Leveraging this spatial MCDM modeling approach with the Service Oriented Architecture (SOA) paradigm, we have developed a Spatial Model Steering (SMS) framework that enables users to explore the decision space and thus increase their awareness of the influence of key variables. In this framework a user can visually steer the LUA model key factors, explore and compare what if future land use scenarios by changing these factors and visualizing a range of potential LUA outcomes. In doing so, we believe that users can develop increased confidence in their understanding of the key factors governing the underlying models and ultimately obtain greater awareness of the uncertainty in the outcomes.

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

spatial model steering
land use allocation
service oriented architecture
uncertainty awareness


The Method of Reducing the Cycle of Programmable Logic Controller (PLC) Vulnerable "to Avalanche of Events" Reducing the cycle duration of PLC (Programmable Logic Controller) is one of the methods for increasing the access frequency of nodes in the real time distributed system into the transmission medium. The authors presents in this paper one of the methods developed by themselves for a rather specific use of a cases of avalanche of events.

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

distributed real time system
industrial computer network
time cycle of exchange data
plc programming


A fully parallelized scheme of constructing independent spanning trees on Mbius cubes A set of spanning trees in a graph is said to be independent (ISTs for short) if all the trees are rooted at the same node \(r\) and for any other node \(v(\ne r)\), the paths from \(v\) to \(r\) in any two trees are node-disjoint except the two end nodes \(v\) and \(r\). It was conjectured that for any \(n\)-connected graph there exist \(n\) ISTs rooted at an arbitrary node. Let \(N=2^n\) be the number of nodes in the \(n\)-dimensional Mbius cube \(MQ_n\). Recently, for constructing \(n\) ISTs rooted at an arbitrary node of \(MQ_n\), Cheng et al.(Comput J 56(11):13471362, 2013) and (J Supercomput 65(3):12791301, 2013), respectively, proposed a sequential algorithm to run in \({\mathcal O}(N\log N)\) time and a parallel algorithm that takes \({\mathcal O}(N)\) time using \(\log N\) processors. However, the former algorithm is executed in a recursive fashion and thus is hard to be parallelized. Although the latter algorithm can simultaneously construct \(n\) ISTs, it is not fully parallelized for the construction of each spanning tree. In this paper, we present a non-recursive and fully parallelized approach to construct \(n\) ISTs rooted at an arbitrary node of \(MQ_n\) in \({\mathcal O}(\log N)\) time using \(N\) nodes of \(MQ_n\) as processors. In particular, we derive useful properties from the description of paths in ISTs, which make the proof of independency to become easier than ever before.

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

interconnection networks
parallel algorithms


Application of the RIMARC algorithm to a large data set of action potentials and clinical parameters for risk prediction of atrial fibrillation Ex vivo recorded action potentials (APs) in human right atrial tissue from patients in sinus rhythm (SR) or atrial fibrillation (AF) display a characteristic spike-and-dome or triangular shape, respectively, but variability is huge within each rhythm group. The aim of our study was to apply the machine-learning algorithm ranking instances by maximizing the area under the ROC curve (RIMARC) to a large data set of 480 APs combined with retrospectively collected general clinical parameters and to test whether the rules learned by the RIMARC algorithm can be used for accurately classifying the preoperative rhythm status. APs were included from 221 SR and 158 AF patients. During a learning phase, the RIMARC algorithm established a ranking order of 62 features by predictive value for SR or AF. The model was then challenged with an additional test set of features from 28 patients in whom rhythm status was blinded. The accuracy of the risk prediction for AF by the model was very good (0.93) when all features were used. Without the seven AP features, accuracy still reached 0.71. In conclusion, we have shown that training the machine-learning algorithm RIMARC with an experimental and clinical data set allows predicting a classification in a test data set with high accuracy. In a clinical setting, this approach may prove useful for finding hypothesis-generating associations between different parameters.

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

atrial fibrillation
risk prediction
rimarc algorithm
clinical parameters