A functional optimization approach to an inverse magneto-convection problem A formulation and an FEM implementation for the solution of an ill-posed inverse/design magneto-convection problem is proposed. In particular, an incompressible, viscous, electrically conducting liquid material occupying a given domain ? is considered. Convection is driven by buoyancy effects as well as a Lorentz force generated due to the applied magnetic field. Thermal boundary conditions are only prescribed in the part (???h0) of the boundary ?. In addition, the temperature distribution is also prescribed in the part ?I of the boundary ?h1, where the heat flux is known, i.e. ?I is a boundary with overspecified thermal boundary conditions. The inverse magneto-convection problem is posed as an optimization problem in L2(?I[0,tmax]) for the calculation of the boundary heat flux qo(x,t), with (x,t)?(?h0[0,tmax]). The optimization scheme minimizes the discrepancy ??m(x,t)??(x,t;qo)?L2(?I[0,tmax]) between the temperature ?(x,t;qo) calculated from the solution of a direct problem for each flux qo and the desired (or measured) temperature ?m(x,t) on the boundary ?I. The exact L2 gradient of the cost functional is obtained from appropriately defined adjoint fields. The adjoint problem is defined from the sensitivity operators obtained by linearization of the equations governing the direct problem. The standard SUPG/PSPG stabilized FEM formulation for incompressible fluid flow simulation is here extended to thermo-magnetically driven flows. The proposed FEM formulation is used for the calculation of the direct, adjoint and sensitivity thermal, fluid flow and electric potential fields. The entire optimization algorithm is solved using the conjugate gradient method. Finally, the method is demonstrated through the solution of a few inverse problems with known results. The need for regularization is identified in one of the example problems with uniformly distributed random errors in the temperature data ?m(x,t) and a H1 regularized formulation is introduced to obtain stable solutions. Finally, the numerical results are elucidated and potential applications are addressed.

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

functional optimization
inverse problems
regularization

stabilized finite element methods
mhd
adjoint techniques


multiobjective genetic rule selection as a data mining postprocessing procedure In this paper, we show the usefulness of multiobjective genetic rule selection as a postprocessing procedure in data mining for pattern classification problems. First we extract a prespecified number of rules using a data mining technique. Then we apply multiobjective genetic rule selection to the extracted rules. Experimental results show that multiobjective genetic rule selection significantly decreases the number of extracted rules while improving their classification accuracy.

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

multiobjective rule selection
knowledge extraction


accelerating matlab image processing toolbox functions on gpus In this paper, we present our effort in developing an open-source GPU (graphics processing units) code library for the MATLAB Image Processing Toolbox (IPT). We ported a dozen of representative functions from IPT and based on their inherent characteristics, we grouped these functions into four categories: data independent, data sharing, algorithm dependent and data dependent. For each category, we present a detailed case study, which reveals interesting insights on how to efficiently optimize the code for GPUs and highlight performance-critical hardware features, some of which have not been well explored in existing literature. Our results show drastic speedups for the functions in the data-independent or data-sharing category by leveraging hardware support judiciously; and moderate speedups for those in the algorithm-dependent category by careful algorithm selection and parallelization. For the functions in the last category, fine-grain synchronization and data-dependency requirements are the main obstacles to an efficient implementation on GPUs.

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


Consistent integration of models based on views of meta models The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to generalized typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result, we present suitable conditions for the integration and decomposition of consistent view models (Theorem 4.1) and extend these conditions to view models defined over meta models with constraints (Theorem 5.1). As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.

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

meta-modelling
view interaction
view integration


a 3d active touch interaction based on the meso-structure analyzing In the field of digital archive, high-definition measurement, modeling and rendering of the cultural properties are very important problems. However, it is not allowed to touch valued cultural properties in general and it is impossible to measure parameter of these cultural properties by contact measuring method. Therefore, we model a surface asperity of the cultural property "Noh-cloth" based on meso-structure analyzing and propose a novel system for the 3D Noh-cloth exhibition which enables users to touch interactively with 3D haptic device and vibration speakers.

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


Eventually Strong Failure Detector with Unknown Membership The distributed computing scenario is rapidly evolving for integrating self-organizing and dynamic wireless networks. Unreliable failure detectors (FDs) are classical mechanisms that provide information about process failures and can help systems to cope with the high dynamics of these networks. A number of failure detection algorithms have been proposed so far. Nonetheless, most of them assume a global knowledge about the membership as well as a fully communication connectivity; additionally, they are time-based, requiring that eventually some bound on the message transmission will permanently hold. These assumptions are no longer appropriate to the new scenario. This paper presents a new FD protocol that implements a new class of detectors, namely S-M, which adapts the properties of the S class to a dynamic network with an unknown membership. It has the interesting feature of being time-free, so that it does not rely on timers to detect failures; moreover, it tolerates the mobility of nodes and message losses.

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

unreliable failure detector
dynamic distributed systems
wireless mobile networks
asynchronous systems


Improving IR-based traceability recovery via noun-based indexing of software artifacts One of the most successful applications of textual analysis in software engineering is the use of information retrieval (IR) methods to reconstruct traceability links between software artifacts. Unfortunately, because of the limitations of both the humans developing artifacts and the IR techniques any IR-based traceability recovery method fails to retrieve some of the correct links, while on the other hand it also retrieves links that are not correct. This limitation has posed challenges for researchers that have proposed several methods to improve the accuracy of IR-based traceability recovery methods by removing the noise' in the textual content of software artifacts (e.g., by removing common words or increasing the importance of critical terms). In this paper, we propose a heuristic to remove the noise' taking into account the linguistic nature of words in the software artifacts. In particular, the language used in software documents can be classified as a technical language, where the words that provide more indication on the semantics of a document are the nouns. The results of a case study conducted on five software artifact repositories indicate that characterizing the context of software artifacts considering only nouns significantly improves the accuracy of IR-based traceability recovery methods. Copyright (c) 2012 John Wiley & Sons, Ltd.

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

vector space model
latent semantic indexing
jensen-shannon method
empirical studies


Inconsistency-tolerant bunched implications It is known that logical systems with the property of paraconsistency can deal with inconsistency-tolerant and uncertainty reasoning more appropriately than systems which are non-paraconsistent. It is also known that the logic BI of bunched implications is useful for formalizing resource-sensitive reasoning. In this paper, a paraconsistent extension PBI of BI is studied. The logic PBI is thus intended to formalize an appropriate combination of inconsistency-tolerant reasoning and resource-sensitive reasoning. A Gentzen-type sequent calculus SPBI for PBI is introduced, and the cut-elimination and decidability theorems for SPBI are proved. An extension of the Grothendieck topological semantics for BI is introduced for PBI, and the completeness theorem with respect to this semantics is proved. (c) 2012 Elsevier Inc. All rights reserved.

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

bunched implications
completeness theorem
decidability

inconsistency-tolerant reasoning
paraconsistent logic
resource-sensitive reasoning


Luminescent Amino-functionalized or Erbium-doped Silica Spheres for Biological Applications This work presents the morphological and optical properties of luminescent silica spheres, discussing applications in bioimaging and biosensing. The spheres are obtained by the hydrolysis and condensation of tetraethylorthosilicate (TEOS) and can be synthesized by following either a basic or an acidic route. Luminescence emission is induced after incorporation of aminopropyltriethoxysilane (APTES) during synthesis or by introducing an optically active element, such as erbium, or other rare-earth elements. The luminescence properties of APTES-functionalized silica spheres have been investigated and optimized by varying the annealing temperature. On the other hand, erbium incorporation in silica spheres was also studied and the corresponding Er3+ luminescence emission at 1.54?m was evaluated for intensity and lifetime. The basic pH environment in the synthesis allows good control of the size of the spheres (?200nm in diameter), whereas the acidic route produces a wide dispersion in particle size (2005000nm). Both these approaches, however, can be followed to obtain an efficient photoluminescence (PL) emission for the APTES-functionalized silica spheres after 400600C thermal treatment. If Er(NO3)3 is introduced in the basic solution, a rapid precipitation of Er(OH)3 occurs, but erbium can be easily and efficiently incorporated in the acid-synthesized spheres, showing high PL intensity at 1.54?m with lifetime of 3.9ms. Finally, I discuss perspectives for the applications of these luminescent silica spheres, in particular as biological markers for bioimaging and biosensing.

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


3-D head model retrieval using a single face view query In this paper, a novel 3-D head model retrieval approach is proposed, in which only a single 2-D face view query is required. The proposed approach will be important for multimedia application areas such as virtual world construction and game design, in which 3-D virtual characters with a given set of facial features can be rapidly constructed based on 2-D view queries, instead of having to generate each model anew. To achieve this objective, we construct an adaptive mapping through which each 2-D view feature vector is associated with its corresponding 3-D model feature vector. Given this estimated 3-D model feature vector, similarity matching can then be performed in the 3-D model feature space. To avoid the explicit specification of the complex relationship between the 2-D and 3-D feature spaces, a neural network approach is adopted in which the required mapping is implicitly specified through a set of training examples. In addition, for efficient feature representation, principal component analysis (PCA) is adopted to achieve dimensionality reduction for facilitating both the mapping construction and the similarity matching process. Since the linear nature of the original PCA formulation may not be adequate to capture the complex characteristics of 3-D models, we also consider the adoption of its nonlinear counterpart, i.e., the so-called kernel PCA approach, in this work. Experimental results show that the proposed approach is capable of successfully retrieving the set of 3-D models which are similar in appearance to a given 2-D face view.

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

3-d model retrieval
kernel principal component analysis


The Poisson fading channel In this first paper of a two-part series, a single-user single-input single-output (SISO) shot-noise-limited Poisson channel is considered over which an information signal is transmitted by modulating the intensity of an optical beam, and individual photon arrivals are counted at the photodetector receiver. The transmitted signal, which is chosen to satisfy peak and average constraints, undergoes multiplicative fading, which occurs over coherence time intervals of fixed duration. The fade coefficient (channel state) remains constant in each coherence interval, and varies across successive such intervals in an independent and identically distributed (i.i.d.) fashion. A single-letter characterization of the capacity of this channel is obtained when the receiver is provided with perfect channel state information (CSI) while the transmitter CSI can be imperfect. The asymptotic behavior of channel capacity in the low and high peak-signal-to-shot-noise ratio (SNR) regimes is studied.

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

channel capacity
channel state information
coherence time
poisson fading channel

free-space optical communication
lognormal fading
single input single output


A Study of Inherent Pen Input Modalities for Precision Parameter Manipulations during Trajectory Tasks Adjustment of a certain parameter in the course of performing a trajectory task such as drawing or gesturing is a common manipulation in pen-based interaction, Since pen tip information is confined to x-y coordinate data, such concurrent parameter adjustment is not easily accomplished in devices using only a pen tip. This paper comparatively investigates the performance of inherent pen input modalities (Pressure, Tilt, Azimuth, and Rolling) and Key Pressing with the non-preferred hand used for precision parameter manipulation during pen sliding actions. We elaborate our experimental design framework here and conduct experimentation to evaluate the effect of the five techniques. Results show that Pressure enabled the fastest performance along with the lowest error rate, while Azimuth exhibited the worst performance. Tilt showed slightly faster performance and achieved a lower error rate than Rolling. However, Rolling achieved the most significant learning effect on Selection Time and was favored over Tilt in subjective evaluations. Our experimental results afford a general understanding of the performance of inherent pen input modalities in the course of a trajectory task in HCI (human computer interaction).

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

inherent pen input modalities
multi-scale navigation
pen-based interfaces


Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching The research in the parameterized 3D-MATCHING problem has yielded a number of new algorithmic techniques and an impressive list of improved algorithms. In this article, a new deterministic algorithm for the problem is developed that integrates and improves a number of known techniques, including greedy localization, dynamic programming, and color coding. The new algorithm, which either constructs a matching of k triples in a given triple set or correctly reports that no such a matching exists, runs in time O*(2.80(3k)), improving a long list of previous algorithms for the problem.

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 B I O O O O O O O O O O O O O O O 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 programming matching
parameterized algorithms


Symbolic computation with finite biquandles A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Z(p) from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms. (c) 2007 Elsevier Ltd. All rights reserved.

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

yang-baxter cohomology
knot invariants
virtual knot invariants


Vacancy distribution measurements in CZ Si crystals grown by different pulling rate Vacancy concentration distribution is estimated by measuring deep levels induced by N2-vacancy complexes in the wafers which are prepared from Si crystals grown by different pulling rate. It is found that the vacancy concentration is very low inside the OSF-ring and a little low in the ring region. Two kinds of the vacancy density profiles are observed in the specimens without the OSF-ring which are prepared from Si crystals grown by fast (1.4 mm/mm) and slow (0.4 mm/mm) pulling rate: one is a gradual and the other is a abrupt zigzag profile. We interpret the gradual profile is caused by macroscopic density change of the octahedral void defects and the abrupt variation is accompanied with the growth striation.

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

effect of crystal pulling rate on vacancy density


Diversity Precoding for UWB MISO Systems in IEEE Channel Models In this letter, we consider a diversity precoding scheme for signal detection in ultra-wideband (UWB) multiple input single output (MISO) systems, which consists of linear diversity prefilters in the transmitter. For a UWB MISO system, the BER performance of a linear transmit diversity precoding system with imperfect channel estimation is presented in IEEE 802.15.3a UWB multipath channels and also compared with that of a linear receive diversity postcoding approach. It is shown that the diversity precoding UWB MISO system offers the performance equivalent to the diversity postcoding scheme for single input multiple output (SIMO) systems while making the mobiles low-cost and low-power.

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


Jensen and Chebyshev inequalities for pseudo-integrals of set-valued functions Set-valued functions are an important mathematical notion and play a crucial role in several practical areas. At the same time, pseudo-analysis as a background allows extension of some classical mathematical notions to the forms that are highly applicable in some nonstandard situations. This paper focuses on pseudo-integration of set-valued functions, which is generalization of Aumann's research, and corresponding extensions of the Jensen and Chebyshev integral inequalities to the set-valued case. Since the integral inequalities in question are widely used in various aspects of mathematics, the main motivation for the presented research lies in the possibility of expanding the applicability of these inequalities by combining the properties of set-valued functions with pseudo-analysis. (C) 2012 Elsevier B.V. All rights reserved.

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

jensen-type inequality
chebyshev-type inequality
pseudo-operations
pseudo-integral
set-valued functions


Applying model-driven engineering to the development of Rich Internet Applications for Business Intelligence Business Intelligence (BI) applications have been gradually ported to the Web in search of a global platform for the consumption and publication of data and services. On the Internet, apart from techniques for data/knowledge management, BI Web applications need interfaces with a high level of interoperability (similar to the traditional desktop interfaces) for the visualisation of data/knowledge. In some cases, this has been provided by Rich Internet Applications (RIA). The development of these BI RIAs is a process traditionally performed manually and, given the complexity of the final application, it is a process which might be prone to errors. The application of model-driven engineering techniques can reduce the cost of development and maintenance (in terms of time and resources) of these applications, as they demonstrated by other types of Web applications. In the light of these issues, the paper introduces the Sm4RIA-B methodology, i.e., a model-driven methodology for the development of RIA as BI Web applications. In order to overcome the limitations of RIA regarding knowledge management from the Web, this paper also presents a new RIA platform for BI, called RI@BI, which extends the functionalities of traditional RIAs by means of Semantic Web technologies and B2B techniques. Finally, we evaluate the whole approach on a case studythe development of a social network site for an enterprise project manager.

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

rich internet applications
knowledge management


Simulation of chemical metabolism for fate and hazard assessment. IV. Computer-based derivation of metabolic simulators from documented metabolism maps Computer simulation of xenobiotic metabolism and degradation is usually performed proceeding from a set of expert-developed rules modelling the actual enzyme-driven chemical reactions. With the accumulation of extensive metabolic pathway data, the analysis required to derive such chemical reaction patterns has become more objective, but also more convoluted and demanding. Herein we report on our computer-based approach for the analysis of metabolic maps, leading to the construction of reaction rules statistically suitable for simulation purposes. It is based on the set of so-called bare transformations which encompass all unique reaction patterns as obtained by a heuristically enhanced maximum common subgraph algorithm. The bare transformations guarantee that no existing metabolite is missed in simulation at the expense of an enormous amount of false positive predictions. They are rendered more selective by correlating the generated true and false positives to the locations of typical chemical functional groups in the potential reactants. The approach and its results are illustrated for a metabolic map collection of 15 cycloalkanes.

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

metabolism
modelling
metabolic maps
simulation


computational logic in the undergraduate curriculum Logic provides the mathematical basis for hardware design and software development. In fact, digital circuits and computer programs are logic formulas expressed in a formal language. Accordingly, educated computer scientists should have experience in reasoning about the formulas that their digital circuits and programs represent. An exemplary way to get this experience is to use computational logic in support of such reasoning. This paper searches the typical undergraduate curriculum in computer science for opportunities to include material on computational logic in the context of hardware and software design and implementation. It explains how computational logic has been included as an element of two courses required in most computer science programs. It discusses some successes and a few missteps that the author has experienced over the past nine years in developing this material and using it in the classroom, and it suggests opportunities for similar efforts in other courses.

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

formal methods
software engineering
theorem provers
acl2
computer science curriculum


Understanding the Mechanisms of Transmission of Ehrlichia ruminantium and Its Influence on the Structure of Pathogen Populations in the Field The understanding of the structure of Ehrlichia ruminantium stock population in the field was highlighted by experiments done in controlled conditions on the goat model. The mixture of strains observed in ticks seemed to be due to simultaneous infections rather than successive infections of the carrier. During a dual infection, the timing of Ehrlichia ruminantium circulation of the two stocks in hosts influenced their selection by ticks

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

heartwater
amblyomma ticks
structure of population


A linearized technique in an All-MOS transconductance amplifier A linearized technique in an all-MOS transconductance amplifier is presented. This proposed technique utilizes a simple source follower without the need of complex circuits. The linearization principle and the design methodology are demonstrated in this paper. The corresponding circuit has been fabricated in a 0.35 ? m CMOS technology, and its active chip area is 145.8 79.6 ? m 2 . From the experimental results, the proposed technique improves the nonlinearity error from 10.92% to 0.64% at a 3.3V supply voltage.

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


L-infinity fuzzy logic Using a new family of t-norms and t-conorms we show that fuzzy logic, whose truth values are rational numbers in [0, 1], obeys the elementary laws of classical logic (those given in Section 4). (C) 1999 Elsevier Science B.V. All rights reserved.

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


Frequency domain microphone array calibration and beamforming for automatic speech recognition This investigation proposed two array beamformers SPFDBB (Soft Penalty Frequency Domain Block Beamformer) and FDABB (Frequency Domain Adjustable Block Beamformer). Compared with the conventional beamformers, these frequency-domain methods can significantly reduce the computation power requirement in ASR (Automatic Speech Recognition) based applications. Like other reference signal based techniques, SPFDBB and FDABB minimize microphone's mismatch, desired signal cancellation caused by reflection effects and resolution due to the array's position. Additionally, these proposed methods are suitable for both near-field and far-field environments. Generally, the convolution relation between channel and speech source in time domain cannot be modeled accurately as a multiplication in the frequency domain with a finite window size, especially in ASR applications. SPFDBB and FDABB can approximate this multiplication by treating several frames as a block to achieve a better beamforming result. Moreover, FDABB adjusts the number of frames on-line to cope with the variation of characteristics in both speech and interference signals. A better performance was found to be achievable by combining these methods with an ASR mechanism.

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

beamformer
microphone array
calibration
speech recognition


Intelligent initial finite element mesh generation for solutions of 2D problems The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on the mesh generation algorithm. The sizing function used by the mesh generation algorithm is established by control sphere and control space concepts and fully controls mesh gradation in the complex 2D problem domains.

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


Gallop-Vegas: An enhanced slow-start mechanism for TCP Vegas In this article, we present a new slow-start variant, which improves the throughput of transmission control protocol (TCP) Vegas. We call this new mechanism Gallop-Vegas because it quickly ramps up to the available bandwidth and reduces the burstiness during the slow-start phase. TCP is known to send bursts of packets during its slow-start phase due to the fast window increase and the ACK-clock based transmission. This phenomenon causes TCP Vegas to change from slow-start phase to congestion-avoidance phase too early in the large bandwidth-delay product (BDP) links. Therefore, in Gallop-Vegas, we increase the congestion window size with a rate between exponential growth and linear growth during slow-start phase. Our analysis, simulation results, and measurements on the Internet show that Gallop-Vegas significantly improves the performance of a connection, especially during the slow-start phase. Furthermore, it is implementation feasible because only sending part needs to be modified.

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

slow-start
transmission control protocol (tcp)
tcp-vegas


fine tuning matrix multiplications on multicore Multicore systems are becoming ubiquituous in scientificcomputing. As performance libraries are adapted to such systems, thedifficulty to extract the best performance out of them is quite high. Indeed,performance libraries such as Intel's MKL, while performing verywell on unicore architectures, see their behaviour degrade when used onmulticore systems. Moreover, even multicore systems show wide differencesamong each other (presence of shared caches, memory bandwidth,etc.) We propose a systematic method to improve the parallel executionof matrix multiplication, through the study of the behavior of unicoreDGEMM kernels in MKL, as well as various other criteria. We show thatour fine-tuning can out-perform Intel's parallel DGEMM of MKL, withperformance gains sometimes up to a factor of two.

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


Nonlocality distillation for high-dimensional correlated boxes Most of the existing distillation protocols only work for binary-input binary-output nonlocal boxes (two-dimensional boxes), and they cannot be generalized to the binary-input multi-output nonlocal boxes (high-dimensional boxes) in a trivial way. We will design some comparator-based protocols to distill high-dimensional nonlocal boxes. Our protocols are more powerful and universal than the previous ones in the sense that they can distill the arbitrary-dimensional boxes rather than the limited two-dimensional ones. The initial nonlocalities and the wiring manners between the boxes are two main factors deciding the distillation efficiency.

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

high-dimensional nonsignaling correlated box


A case-study on nave labelling for the nearest mean and the linear discriminant classifiers The abundance of unlabelled data alongside limited labelled data has provoked significant interest in semi-supervised learning methods. Nave labelling refers to the following simple strategy for using unlabelled data in on-line classification. A new data point is first labelled by the current classifier and then added to the training set together with the assigned label. The classifier is updated before seeing the subsequent data point. Although the danger of a run-away classifier is obvious, versions of nave labelling pervade in on-line adaptive learning. We study the asymptotic behaviour of nave labelling in the case of two Gaussian classes and one variable. The analysis shows that if the classifier model assumes correctly the underlying distribution of the problem, nave labelling will drive the parameters of the classifier towards their optimal values. However, if the model is not guessed correctly, the benefits are outweighed by the instability of the labelling strategy (run-away behaviour of the classifier). The results are based on exact calculations of the point of convergence, simulations, and experiments with 25 real data sets. The findings in our study are consistent with concerns about general use of unlabelled data, flagged up in the recent literature.

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

semi-supervised learning
on-line classifiers


A high throughput robot system for machine vision based plant phenotype studies This work demonstrates how a high throughput robotic machine vision systems can quantify seedling development with high spatial and temporal resolution.The throughput that the system provides is high enough to match the needs of functional genomics research. Analyzing images of plant seedlings growing and responding to stimuli is a proven approach to finding the effects of an affected gene. However, with 10(4) genes in a typical plant genome, comprehensive studies will require high throughput methodologies. To increase throughput without sacrificing spatial or temporal resolution, a 3 axis robotic gantry system utilizing visual servoing was developed. The gantry consists of direct drive linear servo motors that can move the cameras at a speed of 1 m/s with an accuracy of 1 mu m, and a repeatability of 0.1 mu m. Perpendicular to the optical axis of the cameras was a 1 m(2) sample fixture holds 36 Petri plates in which 144 Arabidopsis thaliana seedlings (4 per Petri plate) grew vertically along the surface of an agar gel. A probabilistic image analysis algorithm was used to locate the root of seedlings and a normalized gray scale variance measure was used to achieve focus by servoing along the optical axis. Rotation of the sample holder induced a gravitropic bending response in the roots, which are approximately 45 mu m wide and several millimeter in length. The custom hardware and software described here accurately quantified the gravitropic responses of the seedlings in parallel at approximately 3 min intervals over an 8-h period. Here we present an overview of our system and describe some of the necessary capabilities and challenges to automating plant phenotype studies.

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

focusing
plant phenotyping
image segmentation


Artificial neural network-based equation for estimating VO2max from the 20 m shuttle run test in adolescents Objective: To develop an artificial neural network (ANN)-equation to estimate maximal oxygen uptake (VO2max) from 20 m shuttle run test (20mSRT) performance (stage), sex, age, weight, and height in young persons. Methods: The 20mSRT was performed by 193 (122 boys and 71 girls) adolescents aged 13-19 years. All the adolescents wore a portable gas analyzer to measure VO2 and heart rate during the test. The equation was developed and cross-validated following the ANN mathematical model. The neural net performance was assessed through several error measures. Agreement between the measured VO2max and estimated VO2max from Leger's and ANN equations were analysed following the Bland and Altman method. Results: The percentage error was 17.13 and 7.38 for Leger and ANN-equation (P < 0.001), respectively, and the standard error of the estimate obtained with Leger's equation was 4.27 ml/(kg min), while for the ANN- equation was 2.84 ml/(kg min). A Bland-Altman plot for the measured VO2max and Leger-VO2max showed a mean difference of 4.9 ml/(kg min) (P < 0.001), while the Bland-Altman plot for the measured VO2max and ANN-VO2max showed a mean difference of 0.5 ml/(kg min) (P = 0.654). In the validation sample, the percentage error was 21.08 and 8.68 for Leger and ANN-equation (P < 0.001), respectively. Conclusions: In this study, an ANN-based equation to estimate VO2max., from 20mSRT performance (stage), sex, age, weight, and height in adolescents was developed and cross-validated. The newly developed equation was shown to be more accurate than Leger's. The proposed model has been coded in a user-friendly spreadsheet. (C) 2008 Elsevier B.V. All rights reserved.

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

cardiorespiratory fitness
aerobic capacity test
exercise field test
artificial neural networks


The stochastic U-line balancing problem: A heuristic procedure Many heuristics have been proposed for the assembly line balancing problem due to its computational complexity and difficulty in identifying an optimal solution. Still, the basic line balancing model fails to consider a number of realistic elements. The implementation of a Just-In-Time manufacturing system generally entails the replacement of traditional straight assembly lines with U-shaped lines. An important issue in the U-line balancing problem is the consideration of task time variability due to human factors or various disruptions. In this paper, we consider the stochastic U-line balancing problem. A hybrid heuristic is presented consisting of an initial feasible solution module and a solution improvement module. To gain insight into its performance, we analyze the heuristic under different scenarios of task time variability. Computational results clearly demonstrate the efficiency and robustness of our algorithm.

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


Activity-based divergent supply chain planning for competitive advantage in the risky global environment: A DEMATEL-ANP fuzzy goal programming approach Supply chain management allows modern enterprises to relax their own capacities and produce in a more flexible manner for diversified consumer demands. However, for an enterprise with divergent supply chain (DSC) and multiple product lines, to plan the production allocation for higher competitive advantage in the risky global market is a challenging problem. The existing literature still has not address this problem very well. This paper is aimed to treat this problem by using an integrated approach of activity based costing (ABC) and management, five forces analysis, risk and value-at-risk analysis, decision making trial and evaluation laboratory (DEMATEL), analytic network process (ANP), and fuzzy goal programming (FGP). The proposed model can effectively incorporate the key factors of precise costing, managerial constraints, competitive advantage analysis, and risk management into DSC forecasting and multi-objective production planning. A case study of a consumer-oriented cell phone DSC is also presented. The sensitivity analysis shows that identifying and relaxing crucial constraints can play an important role in DSC planning for higher competitive advantage and lower risk.

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

divergent supply chain (dsc) planning
activity-based costing and management
value-at-risk (var)
analytic network process (anp)
fuzzy goal programming (fgp)


using sharable ontology to retrieve historical images We present a framework of utilizing sharable domain ontology and thesaurus to help the retrieval of historical images of the First Emperor of China's terracotta warriors and horses. Incorporating the sharable domain ontology in RDF and RDF schemas of semantic web and a thesaurus, we implement methods to allow easily annotating images into RDF instances and parsing natural language like queries into the query schema in XML format. We also implement a partial structural matching algorithm to match the query schema with images at the level of semantic schemas. Therefore the historical images can be retrieved by nave users of domain specific history in terms of natural language like queries.

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

help
framework
thesaurus
schema
natural language
users
semantic
xml
matching
retrieval
rdf schemas
queries
sharable ontology
algorithm
query
parsing

china
imaging
ontologies
histories
method
structure
semantic web
historical image retrieval
multi-agent systems


A parallel Bees Algorithm implementation on GPU Bees Algorithm is a population-based method that is a computational bound algorithm whose inspired by the natural behavior of honey bees to finds a near-optimal solution for the search problem. Recently, many parallel swarm based algorithms have been developed for running on GPU (Graphic Processing Unit). Since nowadays developing a parallel Bee Algorithm running on the GPU becomes very important. In this paper, we extend the Bees Algorithm (CUBA (i.e. CUDA based Bees Algorithm)) in order to be run on the CUDA (Compute Unified Device Architecture). CUBA (CUDA based Bees Algorithm). We evaluate the performance of CUBA by conducting some experiments based on numerous famous optimization problems. Results show that CUBA significantly outperforms standard Bees Algorithm in numerous different optimization problems.

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

parallel bees algorithm
swarm intelligence
gpgpu


Robust active shape model using AdaBoosted histogram classifiers and shape parameter optimization Active Shape Model (ASM) has been shown to be a powerful tool to aid the interpretation of images, especially in face alignment. ASM local appearance model parameter estimation is based on the assumption that residuals between model fit and data have a Gaussian distribution. Moreover, to generate an allowable face shape, ASM truncates coefficients of shape principal components into the bounds determined by eigenvalues. In this paper, an algorithm of modeling local appearances, called AdaBoosted ASM, and a shape parameter optimization method are proposed. In the algorithm of modeling the local appearances, we describe our novel modeling method by using AdaBoosted histogram classifiers, in which the assumption of the Gaussian distribution is not necessary. In the shape parameter optimization, we describe that there is an inadequacy on controlling shape parameters in ASM, and our novel method on how to solve it. Experimental results demonstrate that the AdaBoosted histogram classifiers improve robustness of landmark displacement greatly, and the shape parameter optimization solves the inadequacy problem of ASM on shape constraint effectively.

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

pca
adaboosted histogram classifier
shape parameter opimization


From molecular dynamics to fluorescence anisotropy of fluorophores bound to oriented structures Molecular dynamics are often used to analyze and interpret fluorophore motions in relation to observed fluorescence anisotropy measurements. The Soleillet method allows computation of fluorescence anisotropy from molecular dynamics for isotropically oriented fluorophores, but not for oriented fluorophores, such as might be used to study oriented bacterial cultures, oriented, functionalized nanotubes, or oriented, stacked planar bilayers. A numerical approach to distribute molecular dynamics systems appropriately into a larger experimental frame context, allowing prediction of time-resolved and steady-state anisotropies for fluorophores distributed in the crystal-like arrays, is presented. The classical principles of absorption selectivity and motional effects on fluorescence anisotropy for isotropically distributed fluorophores are confirmed. Fluorescence anisotropy for fluorophores distributed on oriented cylinders are predicted to show a rich cylinder-angle dependence.

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

fluorescence anisotropy
molecular dynamics


3D hand tracking for human computer interaction We propose a real-time model-based 3D hand tracker that combines image regions and the signal from an off-the-shelf 3-axis accelerometer placed on the user's hand. The visual regions allow the tracker to cope with occlusions, motion blur and background clutter, while the latter aids with the inherent silhouette-pose ambiguities. The accelerometer and tracker are synchronised by casting the calibration problem as one of principal component analysis. Based on the assumption that, often, the number of possible hand configurations is limited by the activity the hand is engaging in, we use a multiclass pose classifier to distinguish between a number of activity dependent articulated hand configurations. We demonstrate the benefits of our method, both qualitatively and quantitatively, on a variety of video sequences and hand configurations and show a proof-of-concept human computer interface based on our system. (C) 2012 Elsevier B.V. All rights reserved.

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

region based tracking
3d tracking
real time 3d tracking
accelerometer tracker integration
pose classification
articulated hand tracking


Optimal estimation for the Pareto distribution This paper proposes an optimal estimation method for the shape parameter, probability density function and upper tail probability of the Pareto distribution. The new method is based on a weighted empirical distribution function. The exact efficiency functions of the estimators relative to the existing estimators are derived. The paper gives L-1-optimal and L-2-optimal weights for the new weighted estimator. Monte Carlo simulation results confirm the theoretical conclusions. Both theoretical and simulation results show that the new estimation method is more efficient relative to several existing methods in many situations.

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

order statistics
density estimation
pareto upper tail


Approximating the solution of second order differential equation with retarded argument A new numerical method for second order nonlinear delay differential equations is constructed. The method combines the fixed point Banach-Picard technique with the trapezoidal quardarature rule and cubic spline interpolation. The effective error estimation of the method which gives a stopping criterion of the algorithm is obtained.

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

second order delay differential equations


Achieving process modeling and execution through the combination of aspect and model-driven engineering approaches One major advantage of executable software process models is that once defined, they can be simulated, checked and validated in short incremental and iterative cycles. This also makes them a powerful asset for important process improvement decisions such as resource allocation, deadlock identification and process management. In this paper, we propose a framework that combines Aspect and Model-driven Engineering approaches in order to ensure process modeling, simulation and execution. This framework is based on UML4SPM, a UML2.0-based language for Software Process Modeling and Kermeta, an executable metaprogramming language. Copyright (C) 2010 John Wiley & Sons, Ltd.

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


Adaptive multi-dimensional filters In the present work, adaptive multi-dimensional filtering technique is proposed, which in addition to numerical stabilization, results in significant reduction of computational efforts. A criterion for adaptive filtering is proposed with algorithm provided. A new buffer domain technique based on adaptive filtering is developed and demonstrated for flow past a stationary cylinder for different Reynolds numbers. This technique also allows calculations in a reduced domain, showing another use of adaptive filtering. Rotary oscillation of a circular cylinder at different forcing parameters show excellent match with results in the literature, demonstrating potential benefits of adaptive filtering. (C) 2011 Elsevier Ltd. All rights reserved.

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

adaptive filters
multi-dimensional filters
navier-stokes equation
large eddy simulation


Competition between hydrogen bonds and halogen bonds in complexes of formamidine and hypohalous acids Quantum chemical calculations have been per-formed for the complexes of formamidine (FA) and hypohalous acid (HOX, X = F, Cl, Br, I) to study their structures, properties, and competition of hydrogen bonds with halogen bonds. Two types of complexes are formed mainly through a hydrogen bond and a halogen bond, respectively, and the cyclic structure is more stable. For the F, Cl, and Br complexes, the hydrogen-bonded one is more stable than the halogen-bonded one, while the halogen-bonded structure is favorable for the I complexes. The associated H-O and X-O bonds are elongated and exhibit a red shift, whereas the distant ones are contracted and display a blue shift. The strength of hydrogen and halogen bonds is affected by F and Li substitutents and it was found that the latter tends to smooth differences in the strength of both types of interactions. The structures, properties, and interaction nature in these complexes have been understood with natural bond orbital (NBO) and atoms in molecules (AIM) theories.

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

competition
formamidine
halogen bond
hydrogen bond
hypohalous acids


New binary one-generator quasi-cyclic codes Sixteen new binary quasi-cyclic linear codes improving the best known lower bounds on minimum distance in Brouwer's tables [1] are constructed. The parameters of these codes are [102,26,32], [102,27,30], [142,35,40] [142,36,38] [146136, 40], [170,16,72], [170,20,66], [170,33,52] [170,36,50], [178,33,56], [178,34,54], [182,27,64] [182,36,56], [186,17,76], [210,23,80], [254,22,102] Sixty cyclic and thirty quasi-cyclic codes, which attain the respective bounds in Brouwer's table and are not included in Chen's table [2] are presented as well.

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


A(2)-MAKE: An efficient anonymous and accountable mutual authentication and key agreement protocol for WMNs Multi-hop hybrid wireless mesh networks (WMNs) have recently attracted increasing attention and deployment. For easy acceptance and wide deployment of WMNs, security, privacy, and accountability issues have to be addressed by providing efficient, reliable, and scalable protocols. The fact that regular users, which may be resource-constrained wireless devices, are involved in routing activities highlights the need for efficiency and compactness. However, the said objectives, i.e., security, privacy, accountability, efficiency etc., are, most of the time, not compatible. So far no previous work has adequately reconciled these conflicting objectives in a practical framework. In this paper, we design and implement such a framework named as A(2)-MAKE, which is a collection of protocols. The framework provides an anonymous mutual authentication protocol whereby legitimate users can connect to network from anywhere without being identified or tracked unwillingly. No single party (or authority, network operator, etc.) can violate the privacy of a user, which is provided in our framework in the strongest sense. Our framework utilizes group signatures, where the private keys and corresponding credentials of the users are generated in a secure three-party protocol. User accountability is implemented via user identification and revocation protocols that can be executed by two semi-trusted authorities, one of which is the network operator. The assumptions about the trust level of the network operator are relaxed with respect to similar protocols. Our framework makes use of more efficient signature generation and verification algorithms in terms of computational complexity than their counterparts in literature, where signature size is almost the same as the shortest signatures proposed for similar purposes so far. (C) 2011 Elsevier B.V. All rights reserved.

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

network security
privacy-aware authentication
cryptographic protocols


Fast and accurate center of gravity defuzzification of fuzzy system outputs defined on trapezoidal fuzzy partitions In this article three methods are presented to perform the center of gravity (COG) defuzzification method in the context of linguistic fuzzy models with t-norm-based inference: one well-known method, the discretisation method, and two new methods, the slope-based method and the modified transformation function method. The methods are worked out for trapezoidal membership functions forming a fuzzy partition in the sense of Ruspini. Experimental results show that the newly introduced methods exhibit excellent accuracy at an extremely low computational cost compared to the widely applied discretisation method. (C) 2005 Elsevier B.V. All rights reserved.

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

trapezoidal membership functions
modified transformation function method

center of gravity defuzzification method


Spectral compact difference hybrid computation of passive scalar in isotropic turbulence An accurate and efficient hybrid numerical method is developed for direct numerical simulation of passive scalar in homogeneous turbulence for the Schmidt number 1 and 50. The hybrid method uses the standard Fourier spectral method for the incompressible NavierStokes equation and the combined compact difference scheme for the passive scalar transport equation. Accuracy of the method is carefully examined by comparing with the full spectral method regarding the spectra, probability density function, field structure of the passive scalar, and is found to be very satisfactory. The computational time for the hybrid method is decreased by 26% for the Schmidt number 1 when compared to the full spectral method, and by 77% for the Schmidt number 50 when the number of grid points for the velocity field is reduced under the scale separation.

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

direct numerical simulation
hybrid method
combined compact difference
turbulence
passive scalar


Numerical validation of an homogenized interface model ? Complete numerical study of a matched asymptotic expansion method using the first two terms of the expansion. Validation of the method. Implementation of the zeroth and first order terms. Original algorithm for solving the first order problem by a domain decomposition type algorithm. Numerical tests which show the efficiency of the proposed method.

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

finite element method
linear elasticity
matched asymptotic expansions


an interactive system for seismic velocity analysis Seismic data processing is a time-consuming operation. Two main reasons for this are the large amounts of data, which have to be put in and taken out of the computer regularly, and the need for intervention by an expert at many intermediate stages. A subsidiary cause is the large amount of computation. The recent appearance of multiprocessor computers has created the opportunity to provide an interactive system to ease and speed-up the seismic data processing cycle. This paper describes the development of an initial interactive system for the velocity analysis and NMO/stacking stage of seismic processing. Computational power and storage are supplied by two 32-node Intel iPSC/1 Hypercubes, both with 16 memory nodes and 16 vector nodes. Each hypercube has 96 Mbytes of memory and a top processing speed of over 100 Mflops (32 bit). A SUN-3 Workstation is used to display intermediate results and to enable the expert to direct the processing more efficiently.

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

interactive system
data processing
analysis
storage
computation
direct
data
power
hypercube
paper
multiprocessor

reasoning vectorization stack developer memorialized process timing


A case-based reasoning system for housing discrimination law A case-based reasoning system was developed for housing discrimination laws that is general enough for other applications. The knowledge base consists of previously decided housing discrimination court cases presented as templates. Events in each case are represented as patterns of actions weighted for importance. New cases are matched with old using a pattern detection mechanism. Adaptation of the old case to the new is then based on certainty factor algebra.

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

artificial intelligence
case-based reasoning
certainty factors


Evolving a pervasive IT infrastructure: a technology integration approach Over the past five years or so, pervasive computing has emerged as a new computing paradigm with a great deal of appeal. Enterprises are increasingly showing interest in deploying pervasive information technology (IT) infrastructures to realise the perceived benefits offered by this new computing paradigm. However, a return on the investment and considerations of the currently deployed infrastructure is a constraint for businesses to invest in a pervasive IT infrastructure. Realising that the economics of an investment in a new infrastructure can affect the embracing of pervasive IT, we suggest an approach that shows how the existing technology solutions available in the market and deployed in an enterprise can be used to develop a pervasive IT infrastructure, thereby protecting investments and maximising returns. We present an evolution model to systematically and incrementally achieve a pervasive IT environment, and present guidelines for evaluating which services to develop first based on evolving the existing infrastructure point of view. This work provides practical implications for enterprises as well as pointers for research.

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

pervasive computing
technology integration

information technology (it)
pervasiveness quotient (pq)
ubiquitous computing


Oscillation

of

second

order

quasilinear

neutral

delay

differential

equations

In

this

paper,

by

employing

Riccati

transformation

technique,

some

new

sufficient

conditions

for

the

oscillation

criteria

are

given

for

the

second

order

quasilinear

neutral

delay

differential

equations

with

delayed

argument

in

the

form

$$\bigl(r(t)\bigl|z'(t)\bigr|^{\alpha-1}z'(t)\bigr)'+q(t)f\bigl(x\bigl(\sigma(t)\bigr)\bigr)=0,\quad

t\geq

where

z(t)=x(t)?p(t)x(?(t)),

Two

examples

are

considered

to

illustrate

the

main

results.

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

oscillation
neutral delay differential equations
riccati transformation technique


Outdoor scene classification by a neural tree-based approach This paper describes a Neural Tree (NT) based system for outdoor scene classification. A new NT classifier with backtracking capabilities is employed at different levels of the system architecture. First, it is used to obtain a rough interpretation of the scene by classifying each image pixel into multiple classes of static background objects, e.g. road, sky, vegetation, or into one generic class representing moving objects, e.g, vehicles, pedestrians. Then it is applied to obtain a more accurate scene interpretation by classifying all detected mobile objects into multiple classes, e.g. cars, lorries, buses, and also estimating their pose. Experiments have been performed on a large set of optical and infrared images. System performances are tested on both clean and noisy data, and comparative studies with other classifiers (i.e, a multi layer perceptron, a binary decision tree, a standard NT and a bank of neural networks) and with other scene classification methods are carried out.

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

change detection
invariant moments
neural trees
object recognition
outdoor scene understanding


Simulation of tactical communications systems by inferring detailed data from the joint theater-level computer-aided exercises A new scheme for the simulation of tactical communications systems is introduced in which the mobility, call, and availability patterns for communications equipment are generated by using the data inferred from joint theater-level battle simulations. In this technique, the mobility, strength, and posture data related to military units are stored in a database by a military constructive simulation system during computer-aided exercises. Then, the mobility, call, and availability patterns for the communications equipment are derived from these data in the required detail and time resolution by the authors' models. The data structures and the statistical data used in these models, the description of a tactical communications system studied by using the authors' technique, and example results from this study are also presented.

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

tactical communications
constructive simulation

military communications
combat models
joint theater-level simulation
highly aggregated combat modeling
computer-aided exercise
mobile communications


exposing document context in the personal web Reconnaissance agents show context by displaying documents with similar content to the one(s) the user currently has open. Research paper search engines show context by displaying documents that cite or are cited by the currently open document(s). We present a tool that applies such ideas to the personal web , that is, the space rooted in user documents but tightly connected to web documents as well. The tool organizes the personal web with a single topic hierarchy based on direct links, instead of the traditional file, bookmark, and (hidden) direct link hierarchies. The tool allows a user to easily navigate through related user and web documents, no matter whether the documents are related by directory-document, bookmark-document, direct-link, or even similar content relationships.

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

personal web
relationships
space
reconnaissance
web
tool
direct
links
hierarchies
paper
bookmark
context
user
search

contention
information navigation
personality
recommender
documentation
linking


Differential evolution for solving multi-mode resource-constrained project scheduling problems In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and minimization of the makespan. To solve this problem, we propose a differential evolution (DE) algorithm. We focus on the performance of this algorithm to solve the problem within small time per activity. Finally, we present the results of our thorough computational study. Results obtained on six classes of test problems and comparison with other algorithms from the literature show that our algorithm gives better solutions.

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

differential evolution
scheduling
makespan


Meanings of information: The assumptions and research consequences of three foundational LIS theories This article addresses the question what is information? by comparing the meaning of the term information and epistemological assumptions of three theories in library and information science: the Shannon-Weaver model, Brookes interpretation of Popper's World 3, and the Data-Information-Knowledge-Wisdom model. It shows that the term information in these theories refers to empirical entities or events and is conceptualized as having causal powers upon human minds. It is argued that the epistemological assumptions have led to the negligence of the cultural and social aspects of the constitution of information (i.e., how something is considered to be and not to be information) and the unquestioned nature of science in research methodologies.

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


Auditory Perception of Geometry-Invariant Material Properties Accurately modeling the intrinsic material-dependent damping property for interactive sound rendering is a challenging problem. The Rayleigh damping model is commonly regarded as an adequate engineering model for interactive sound synthesis in virtual environment applications, but this assumption has never been rigorously analyzed. In this paper, we conduct a formal evaluation of this model. Our goal is to determine if auditory perception of material under Rayleigh damping assumption is "geometry-invariant", i.e. if this approximation model is transferable across different shapes and sizes. First, audio recordings of same-material objects in various shapes and sizes are analyzed to determine if they can be approximated by the Rayleigh damping model with a single set of parameters. Next, we design and conduct a series of psychoacoustic experiments, in subjects evaluate if audio clips synthesized using the Rayleigh damping model are from the same material, when we alter the material, shape, and size parameters. Through both quantitative and qualitative evaluation, we show that the acoustic properties of the Rayleigh damping model for a single material is generally preserved across different geometries of objects consisting of homogeneous materials and is therefore a suitable, geometry-invariant sound model. Our study results also show that consistent with prior crossmodal expectations, visual perception of geometry can affect the auditory perception of materials. These findings facilitate the wide adoption of Rayleigh damping for interactive auditory systems and enable reuse of material parameters under this approximation model across different shapes and sizes, without laborious per-object parameter tuning.

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


Optimal single machine scheduling of products with components and changeover cost We study scheduling products with subassemblies on a single machine. We derive structural results that characterize optimal schedules. We show that optimal schedules can be derived from a recurrent sequence of schedules. These optimal schedules can be implemented before total demand is known.

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

scheduling
single machine
components
changeover cost


Verification of a three-dimensional unstructured finite element method using analytic and manufactured solutions We report on the verification of a three-dimensional unstructured finite element method applicable to compressible fluid dynamics and diffusion problems. Our verification methodology uses a combination of analytic and manufactured solutions to formally measure convergence rates in global error for both shock-dominated flows and smooth problems. In addition we measure the global error in vorticity, which should converge at reduced-order relative to the velocity solution. The numerical method under investigation is an edge-based Finite Element formulation on linear tetrahedra with a parabolic MUSCL reconstruction for the advective fluxes. The scheme is nominally second-order accurate on smooth flows. For diffusion problems the formulation also is nominally second-order accurate. Using global error analysis we measure convergence rates of 0.8-1.0 for shock-dominated problems and 1.5-2.4 for smooth problems. Calculations with Adaptive Mesh Refinement (AMR) are observed to produce errors comparable to finer mesh simulations but at significantly reduced computational cost. A convergence rate of 2.2 also is observed for a simplified diffusion problem. Examples of how these studies can inform simulation practices are provided. (C) 2013 Elsevier Ltd. All rights reserved.

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


using game creation for teaching computer programming to high school students and teachers In this paper we describe a two-week residential summer game camp for rising 9th and 10th grade students and a four-week high school teacher professional development course. We present survey results that indicate our approach results in increased computer programming knowledge and self-confidence for both students and teachers. Our project aims to use a holistic game creation approach to increase student interest in computer science by directly teaching to students in a summer camp, instructing the teachers during a 4-week professional development course, and finally by supporting teachers as they use our curriculum in their high schools.

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


QUQNTUM DISCORD AND QUANTUM PHASE TRANSITION IN SPIN-1/2 FRUSTRATED HEISENBERG CHAIN By using the concept of the quantum discord (QD), we study the spin-1/2 antiferro-magnetic Heisenberg chain with next-nearest-neighbor interaction. Due to the SU(2) symmetry and Z(2) symmetry in this system, we obtain the analytical result of the QD and its geometric measure (GMQD), which is determined by the two-site correlators. For the 4-site and 6-site cases, the connection between GMQD (QD) and the eigenenergies was revealed. From the analytical and numerical results, we find GMQD (QD) is an effective tool in detecting both the first-order and the infinite-order quantum-phase-transition points for the finite-size systems. Moreover, by using the entanglement excitation energy and a universal frustration measure we consider the frustration properties of the system and find a nonlinear dependence of the GMQD on the frustration.

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

quantum discord
quantum phase transition
frustration


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


delay and peak power minimization for on-chip buses using temporal redundancy In this paper, we propose a novel temporal redundancy based encoding technique for delay and peak power minimization. The proposed encoding scheme is tested with the SPEC2000 CINT benchmarks for 90 nm and 65 nm technologies. The experimental results show that our approach is very effective in reducing the peak power. From the delay perspective, our approach reduces the delay by at least 11\% (4\%) in the address (data) buses compared to the data transmission without encoding.

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


matchmaking for autonomous agents in electronic marketplaces Matchmaking is the process of mediating demand and supply based on profile information. Matchmaking plays a crucial role in agent-based electronic marketplaces: the problem to be solved is to find the most appropriate agents, products, or services for a task, negotiation, or market transaction. Most real-world problems require multidimensional matchmaking, i. e., the ability to combine various dimensions of decision-making to define an overall solution to a matchmaking problem, requiring the interplay of multiple matchmaking algorithms. In addition, in order to be applicable for real-world applications, the matchmaking component must be easily integrated into standard industrial marketplace platforms. The work described in this work aims at deploying agent- based matchmaking for industrial electronic business applications. The main contributions of this work are the following: (i) we provide a configurable framework called GRAPPA (Generic Request Architecture for Passive Provider Agents) which is designed to be adapted to electronic marketplace applications. Using GRAPPA, system designers can easily specify demand and supply profiles as XML objects; (ii) within GRAPPA we provide an extensible library of matchmaking functions (building blocks) that can be used for rapid development of matchmaking solutions that include standard information retrieval algorithms.

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

enterprise java beans
distance functions
distance computation


A SIMPLE based discontinuous Galerkin solver for steady incompressible flows In this paper we present how the well-known SIMPLE algorithm can be extended to solve the steady incompressible NavierStokes equations discretized by the discontinuous Galerkin method. The convective part is discretized by the local Lax-Friedrichs fluxes and the viscous part by the symmetric interior penalty method. Within the SIMPLE algorithm, the equations are solved in an iterative process. The discretized equations are linearized and an equation for the pressure is derived on the discrete level. The equations obtained for each velocity component and the pressure are decoupled and therefore can be solved sequentially, leading to an efficient solution procedure. The extension of the proposed scheme to the unsteady case is straightforward, where fully implicit time schemes can be used. Various test cases are carried out: the Poiseuille flow, the channel flow with constant transpiration, the Kovasznay flow, the flow into a corner and the backward-facing step flow. Using a mixed-order formulation, i.e. order k for the velocity and order k-1 k - 1 for the pressure, the scheme is numerically stable for all test cases. Convergence rates of k+1 k + 1 and k in the L2 L 2 -norm are observed for velocity and pressure, respectively. A study of the convergence behavior of the SIMPLE algorithm shows that no under-relaxation for the pressure is needed, which is in strong contrast to the application of the SIMPLE algorithm in the context of the finite volume method or the continuous finite element method. We conclude that the proposed scheme is efficient to solve the steady incompressible NavierStokes equations in the context of the discontinuous Galerkin method comprising hp-accuracy.

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

navierstokes equations
incompressible flows
simple algorithm

finite element methods
discontinuous galerkin methods
segregated solution algorithms


Uncertainty measures for general Type-2 fuzzy sets Five uncertainty measures have previously been defined for interval Type-2 fuzzy sets (IT2 FSs), namely centroid, cardinality, fuzziness, variance and skewness. Based on a recently developed ?-plane representation for a general T2 FS, this paper generalizes these definitions to such T2 FSs and, more importantly, derives a unified strategy for computing all different uncertainty measures with low complexity. The uncertainty measures of T2 FSs with different shaped Footprints of Uncertainty and different kinds of secondary membership functions (MFs) are computed and are given as examples. Observations and summaries are made for these examples, and a Summary Interval Uncertainty Measure for a general T2 FS is proposed to simplify the interpretations. Comparative studies of uncertainty measures for Quasi-Type-2 (QT2), IT2 and T2 FSs are also performed to examine the feasibility of approximating T2 FSs using QT2 or even IT2 FSs.

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

cardinality
centroid
fuzziness
skewness
uncertainty measures
variance

?-plane representation
type-2 fuzzy sets


Characterizing information transfer by using a Joint Cognitive Systems model to improve continuity of care in the aged This study explores multidisciplinary and cross-sector health professional experiences with the information needs for safe patient transfers across the care continuum using a Joint Cognitive Systems (JCS) model. Qualitative experiences of three JCS components and their attributes and are presented. A qualitative content analysis using Joint Cognitive Systems constructs were extracted from sixteen multidisciplinary and cross-sector health professional interviews. Participants were asked to describe their information needs and experiences with the patient transfer process. Information transfer associated with three JCS constructs (alignment of goals, enhanced control, and co-agency dynamics) was examined. The breakdown in the information transfer process might be due to the relative strengths of each sector's core expertise. Alignment must cross settings and disciplines and consist of the: (1) transfer of goal relevant and integrated information; (2) accommodation to the control attributes of increased clinical complexity, lack of systematic work processes and feedback or feed forward information; and (3) improvement in the co-agency dynamics of interdependency, trust, inter-related actions and expertise. Economic pressures and care complexities of the aged require improved effectiveness and efficiencies in the information transfer process. This study aims to understand the information transfer needs from hospitals to skilled nursing care laying a foundation towards a medical informatics solution. An informatics solution must accommodate the differing contextual environments and subsequent information needs and paradigms of the Joint Cognitive System of care across the continuum.

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

aged
patient transfers
medical informatics
joint cognitive systems

continuity of patient care
qualitative research
social work


Solution method for the location planning problem of logistics park with variable capacity In this paper we study a logistics park location planning problem in which the capacity of the logistics park is determined by the sectors used to establish it in an open site. Since the size of each sector is not necessarily the same in every potential site, the capacity of the logistics park is thus variable, which makes this problem different from the traditional location problems in which the capacity of each facility is fixed. The task of this problem is to determine the location of the logistics parks, the sectors to be used to establish the logistics park in each open site, and the allocation of customers to the established logistics parks so as to minimize the total costs for establishing the logistics parks and supplying the demands of customers. The size mode is introduced to deal with the nonlinear establishment cost function and consequently this problem is formulated as an integer linear programming (ILP) model. Since CPLEX can only solve the ILP model with small-size problems, a tabu search (TS) hybrid with filter and fan (F&F) is presented to obtain near optimal solutions. In the hybrid algorithm, the TS is used to improve the solution by changing the allocation of customers to open sites while the F&F is used to further improve the solution by adjusting the status of sites (i.e., open or closed). In addition, an elite solution pool is constructed to store good solutions found in the searching history. Whenever the hybrid algorithm is trapped in local minima, a new start solution will be generated from the elite pool so as to improve the search diversity. To evaluate the performance of the proposed hybrid TS method, the column generation (CG) method with an acceleration strategy is developed to provide tight lower bounds. Computational results showed that the proposed hybrid algorithm can obtain optimal solutions for most of the small size problems and satisfactory near-optimal solutions with comparison to lower bounds for large size problems.

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

location planning problem
variable capacity
logistics park
column generation

integer programming model
hybrid metaheuristic


Flexible AC transmission system devices: allocation and transmission pricing The transmission of electricity differs from transportation of any typical commodity by some inherent aspects such as: the production needs to match the consumption at the same time; system control is not an easy task; the electricity flows do not usually follow the economic law. The last aspect is normally observed when transmission systems are included in, for instance, an economic dispatch problem. One way to minimize the operational costs caused by an overloaded transmission system is through the installation of Flexible AC Transmission System (FACTS) devices in the system. They are able to change power flows by modifying the network parameters. This paper focuses on the ability of FACTS devices to change the overall costs of the system and their impact on transmission pricing. The allocation and the determination of the FACTS required are also discussed. Some examples using the IEEE-14 system and the Brazilian electrical system of the Southern region are given to illustrate the concepts introduced in this paper.

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