using properties for uniform interaction in the presto document system Most document or information management systems rely on hierarchies to organise documents (e.g. files, email messages or web bookmarks). However, the rigid structures of hierarchical schemes do not mesh well with the more fluid nature of everyday document practices. This paper describes Presto, a prototype system that allows users to organise their documents entirely in terms of the properties those documents hold for users. Properties provide a uniform mechanism for managing, coding, searching, retrieving and interacting with documents. We concentrate in particular on the challenges that property-based approaches present and the architecture we have developed to tackle them.

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

interaction
mesh
systems
users
prototype
web
architecture
hierarchies
paper
information management
email

challenge
hierarchic
document properties
document interfaces
code
message
document management
bookmark
documentation
practical
interaction models
management
scheme


Composite event support in an active database An intelligent or active database system is able to provide support to engineering applications, which require both data and rules to be managed. CLOSE is an active database, which integrates an object-oriented database, ObjectStore with an expert system, CLIPS. Engineering applications require a broad range of composite events, which are combinations of primitive events such as time events, method events and absolute events. This paper focuses on the design and implementation of composite events. Detection of these composite events is supported by a Rule Manager. The data structures used and the mechanism for composite event detection is described. Example applications are also presented in order to highlight the usefulness of composite events. (C) 2000 Elsevier Science Ltd. All rights reserved.

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


Analysis and performance of a hybrid multiple access scheme: IDMA/CDMA Purpose - The purpose of this paper is to introduce the analysis and performance of a hybrid multiple access scheme which combines interleave division multiple access (IDMA) and code division multiple access (CDMA), referred to as IDMA/CDMA. With experimentations, the scheme can achieve good performance with simple user ends for the system. Design/methodology/approach - IDMA technique is employed as the uplink transmission and CDMA technique as the downlink transmission. The performance comparison of IDMA and IDMA/CDMA downlink is studied with Monte Carlo simulations to investigate the bit error rates. For IDMA/CDMA downlink, the signals are interleaved by random interleavers, spreaded by M-sequence and orthogonal Gold sequence, respectively, and then transmitted over an AWGN with BPSK modulation. Moreover, a channel estimation approach for IDMA based on expectation maximization (EM) algorithm is also presented. Findings - The multi-user detection (MUD) algorithm in uplink IDMA systems is much simpler than that used in traditional CDMA systems. It is also well known that the orthogonal spreading codes in CDMA can effectively help suppress the MM in the synchronized environments. But for the asynchronized application, the performance of CDMA systems will degrade due to the serious multiple user interference. According to traditional IDMA and orthogonal code division multiple access/IDMA signal detection algorithms, every UE has to detect all of the signals of other users for iterative detection. The advantages of IDMA and CDMA technologies can be utilized substantially. Originality/value - The proposed hybrid multiple access scheme can achieve a very simple chip-by-chip iterative MUD strategy at base station, and the simplified receiving operation at UE. On the other hand, this paper also evaluates channel estimation approach for IDMA based on EM algorithm.

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


Fast on-line signature recognition based on VQ with time modeling This paper proposes a multi-section vector quantization approach for on-line signature recognition. We have used the MCYT database, which consists of 330 users and 25 skilled forgeries per person performed by 5 different impostors. This database is larger than those typically used in the literature. Nevertheless, we also provide results from the SVC database. Our proposed system outperforms the winner of SVC with a reduced computational requirement, which is around 47 times lower than DTW. In addition, our system improves the database storage requirements due to vector compression, and is more privacy-friendly as it is not possible to recover the original signature using the codebooks. Experimental results with MCYT provide a 99.76% identification rate and 2.46% EER (skilled forgeries and individual threshold). Experimental results with SVC are 100% of identification rate and 0% (individual threshold) and 0.31% (general threshold) when using a two-section VQ approach. (C) 2010 Elsevier Ltd. All rights reserved.

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

on-line signature recognition
time normalization
reduced computational requirements


A theoretical study on 1,5-diazido-3-nitrazapentane (DANP) and 1,7-diazido-2,4,6-trinitrazaheptane (DATNH): molecular and crystal structures, thermodynamic and detonation properties, and pyrolysis mechanism 1,5-Diazido-3-nitrazapentane (DANP) and 1,7-diazido-2,4,6-trinitrazaheptane (DATNH) are two energetic plasticizers. To better understand them, a detailed theoretical investigation was carried out using density functional theory and molecular mechanics methods. The crystal structures, spectra, thermodynamic properties, heats of formation, detonation velocity, detonation pressure, specific impulse and thermal stability were estimated. Possible initiation steps of pyrolysis were discussed by considering the bond breaking of N-NO2, C-N-3, and N-N-2 (via hydrogen transfer) for both compounds and the cyclization of the adjacent nitro and azido groups for DATNH. Results show that the rupture of N-NO2 and N-N-2 (via hydrogen transfer) may happen simultaneously as the initial step of pyrolysis. Both crystals have P-1 symmetry as was observed experimentally. DANP has higher stability than DATNH, while DATNH has better detonation performance than DANP. In addition, DANP has a lower while DATNH has a higher specific impulse than RDX, which shows their prospects as propellant components.

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

density functional theory
detonation performance
pyrolysis mechanism


Language classes generated by tree controlled grammars with bounded nonterminal complexity A tree controlled grammar is specified as a pair (G. G') where G is a context-free grammar and G' is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree - except the last level - belong to L(G'). We define the nonterminal complexity Var(H) of H = (G, G') as the sum of the numbers of nonterminals of G and G'. In Turaev et al. (2011) [23] it is shown that tree controlled grammars H with Var(H) <= 9 are sufficient to generate all recursively enumerable languages. In this paper, we improve the bound to seven. Moreover, we show that all linear and regular simple matrix languages can be generated by tree controlled grammars with a nonterminal complexity bounded by three, and we prove that this bound is optimal for the mentioned language families. Furthermore, we show that any context-free language can be generated by a tree controlled grammar (G. G') where the number of nonterminals of G and G' is at most four. (C) 2012 Published by Elsevier B.V.

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

tree controlled grammars
nonterminal complexity

bounds for linear context-free and regular simple matrix languages


An adaptive fuzzy controller based on harmony search and its application to power plant control A non-overshoot stability-guaranteed adaptive fuzzy control method is developed. A repair operation is proposed to address the time-varying issue. A modified Binary Harmony Search is adopted to realize the optimal control. Two strategies are compared and analyzed for implementing non-overshoot control. The method is applied to the control of complicated time-varying power plant objects.

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

adaptive fuzzy control
harmony search
power plant


a multi-level approach to reduce the impact of nbti on processor functional units NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture levels. In this paper, we propose a multi-level optimization approach, combining techniques at the circuit and microarchitecture levels, for reducing the impact of NBTI on the functional units (FUs) of a high-performance processor core. We perform SPICE simulations to evaluate the impact of circuit-level design optimizations to reduce the NBTI guardband in terms of area, delay, and power. We then propose a set of NBTI-aware dynamic instruction scheduling policies at the microarchitecture level and quantify their impact on application performance and guardband reduction through execution-driven simulation. We show that carefully combining techniques at both these levels provides the most attractive solution to reducing the guardband while imposing the least overhead in terms of area, power, delay, and application performance.

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


ON GENERALIZED COHEN-MACAULAY CANONICAL MODULES Let (R, ?) be a Noetherian local ring which is a quotient of a Gorenstein local ring. A finitely generated R-module M is called generalized Cohen-Macaulay canonical if the canonical module K(M) of M is generalized Cohen-Macaulay. In this paper, we give characterizations of generalized Cohen-Macaulay canonical modules in term of certain systems of parameters.

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

generalized cohen-macaulay canonical modules


Design concept for wire-bonding reliability improvement by optimizing position in power devices The most effective way to increase the reliability of wire bonds in IGBT modules is reduction of temperature difference between the aluminum wires and the device. However, this lowers the power handling capability of the modules. In this paper, we show that the configuration of aluminum wire bonds on power devices has a considerable effect on the temperature distribution of the device, and that the optimization of the layout by thermo-electric simulation can make the temperature distribution of the devices more uniform and consequently reduce the maximum junction temperature difference, ?Tjmax. Tentative experiments showed that rearranging the bonding position resulted in reduction of ?Tjmax by five to 8C, and that the chip temperature distribution estimated by the thermo-electric simulation was qualitatively similar to the actual measurement results. These results suggest that wire-bonding optimization by thermo-electric simulation can contribute not only to realizing more compact power modules but also to improving the module reliability.

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

simulation
reliability
temperature distribution

wire bonding
power module
power semiconductor
hybrid vehicle
performance


on achieving software diversity for improved network security using distributed coloring algorithms It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applications of single attacks. Research efforts in the field have focused on introducing diversity using a variety of techniques on a system-by-system basis. This paper, on the other hand, assumes the availability of diverse software packages for each system and then seeks to increase the intrinsic value of available diversity by considering the entire computer network. We present several distributed algorithms for the assignment of distinct software packages to individual systems and analyze their performance. Our goal is to limit the ability of a malicious node to use a single attack to compromise its neighboring nodes, and by extension, the rest of the nodes in the network. The algorithms themselves are analyzed for attack tolerance, and strategies for improving the security of the individual software assignment schemes are presented. We present a comparative analysis of our algorithms using simulation results on a topology obtained from e-mail traffic logs between users at our institution. We find that hybrid versions of our algorithms incorporating multiple assignment strategies achieve better attack tolerance than any given assignment strategy. Our work thus shows that diversity must be introduced at all levels of system design, including any scheme that is used to introduce diversity itself.

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

network
software diversity
value
distributed algorithms
applications
use
simulation
analysis
performance
paper
traffic
worms
availability
software
research
strategies
systems
system design
users
diversity
assignment
hardware
distributed
hybrid
attack
scheme

survivability
color
platform
computation
topologies
extensibility
network security
graph coloring
packaging
operating system
version
viruses and worms
secure
software monoculture
algorithm
effect


Knowledge grid based knowledge supply model This paper is mainly concerned with a knowledge supply model in the environment of knowledge grid to realize the knowledge sharing globally. By integrating members, roles, and tasks in a workflow, three sorts of knowledge demands are gained. Based on knowledge demand information, a knowledge supply model is proposed for the purpose of delivering the right knowledge to the right persons. Knowledge grid, acting as a platform for implementing the knowledge supply, is also discussed mainly from the view of knowledge space. A prototype system of knowledge supply has been implemented and applied in product development.

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

knowledge supply
knowledge grid
workflow


Use Case and Task Models: An Integrated Development Methodology and Its Formal Foundation User Interface (UI) development methods are poorly integrated with standard software engineering practice. The differences in terms of artifacts involved, development philosophies, and lifecycles can often result in inconsistent system and UI specifications leading to duplication of effort and increased maintenance costs. To address such shortcomings, we propose an integrated development methodology for use case and task models. Use cases are generally used to capture functional requirements whereas task models specify the detailed user interactions with the UI. Our methodology can assist practitioners in developing software processes which allow these two kinds of artifacts to be developed in a codependent and integrated manner. We present our methodology, describe its semantic foundations along with a set of formal conformance relations, and introduce an automated verification tool.

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

verification
task models
integrated development methodology
conformance


Interacting multiple model for improving the precision of vehicle-mounted global position system ? Clothoid model which shows longitudinal and lateral constant speed motion and the Adaptive Current Statistics model which shows the accelerating of the vehicle. Enhancing the positioning accuracy by the ACS model and clothoid model. IMM is better to improve the position accuracy within the limited cost.

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

adaptive current statistics
clothoid
global position system
interacting multiple model


integrated architectural/physical planning approach for minimization of current surge in high performance clock-gated microprocessors We propose an integrated architectural/physical planning approach to reduce the power supply noise due to current surge in high performance, general-purpose, clock-gated microprocessors. The proposed approach combines dynamic selection of functional units on-the-fly, dynamic issue width scaling and physical planning with soft module, to balance the current demand across layout. Experimental results show that the proposed approach could reduce the peak noise by 6.54\% and consequently, the decoupling capacitance requirement by 21.8\%. The degradation in IPC (Instruction Per Cycle) due to the selection logic and issue width scaling is only 1.86e-7 (without increasing clock cycle period) in 0.18mm technology.

O 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


Integral framework for acquiring and evolving situations in smart environments Smart environments enhance user capabilities and comfort by providing new services and automated service execution based on sensed user activity. Though, when becoming really "smart", such environments should not only provide some service automation, but further learn and adapt their behavior during use. This article motivates and investigates learning of situation models in a smart environment, covering knowledge acquisition from observation as well as evolving situation models during use. An integral framework for acquiring and evolving different layers of a situation model is detailed. Different learning methods are presented as part of this framework: role detection per entity, unsupervised extraction of situations from multimodal data, supervised learning of situation representations, and the evolution of a predefined situation model with feedback. The situation model serves as frame and support for the different methods, permitting to stay in an intuitive declarative framework. An implementation of the whole framework for a smart home environment is described, and the results of several evaluations are depicted.

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

context awareness
situation learning framework
situation split
user preference integration
hidden markov models


A qualitative process system for modeling NF-kappa B and AP-1 gene regulation in immune cell biology research An experiment-oriented integrated model of the regulation of the biologically ubiquitous NF-kappa B and AP-1 gene transcription promoters was built by extending a previously developed qualitative process system for simulating cell behavior in the immune system. The core knowledge base (KB) implemented a deep biological ontology including molecular, ultrastructural, cytological, histological, and organismic definitions. KB states, relationships, predicates, and heuristics also represented process interactions between reactive oxygen species, growth factors, and a variety of kinases phosphorylating intermediate molecules in the NF-kappa B and AP-1 regulatory signaling pathways. The system successfully simulated the molecular process steps underlying outcomes of eight different molecular generics laboratory experiments, including those dealing with NF-kappa B and AP-1 regulation in immunodeficiency virus infection and tumor necrosis factor responses. (C) 1999 Elsevier Science B.V. All rights reserved.

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

qualitative modeling
immunology research


Simulation of multiphase flow in fractured reservoirs using a fracture-only model with transfer functions We present a fracture-only reservoir simulator for multiphase flow: the fracture geometry is modeled explicitly, while fluid movement between fracture and matrix is accommodated using empirical transfer functions. This is a hybrid between discrete fracture discrete matrix modeling where both the fracture and matrix are gridded and dual-porosity or dual-permeability simulation where both fracture and matrix continua are upscaled. The advantage of this approach is that the complex fracture geometry that controls the main flow paths is retained. The use of transfer functions, however, simplifies meshing and makes the simulation method considerably more efficient than discrete fracture discrete matrix models. The transfer functions accommodate capillary- and gravity-mediated flow between fracture and matrix and have been shown to be accurate for simple fracture geometries, capturing both the early- and late-time average behavior. We verify our simulator by comparing its predictions with simulation results where the fracture and matrix are explicitly modeled. We then show the utility of the approach by simulating multiphase flow in a geologically realistic fracture network. Waterflooding runs reveal the fraction of the fracture-matrix interface area that is infiltrated by water so that matrix imbibition can occur. The evolving fraction of the fracture-matrix interface area turns out to be an important characteristic of any particular fracture system to be used as a scaling parameter for capillary driven fracture-matrix transfer.

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

countercurrent imbibition
dual porosity
finite element/finite volume method


A list of features that a graphical xml query language should support EXtensible Markup Language (XML) tends to become a standard way of data interchanging on the Web. Therefore a need for one or more languages was created, that will have the ability to manage and extract data from XML sources In addition, the data on the Web do not always have strict structure (semistructured data). As a result, query languages should be able to retrieve information from these data too. XQuery is the W3C standard to retrieve information from XML documents. Moreover, graphical user interfaces are user friendly enough for naive users to use them. Thus, a graphical query language for XML documents is a very interesting research field. In this paper we draw a list of features that a graphical query language for XML documents should support. Moreover, we examine how the most representative graphical query languages for XML data have presented those features. Finally, in order to compare the languages, we present a comparison table.

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

graphical query languages
semistructured data
xquery


Related key chosen IV attacks on Decim v2 and Decim-128 The Decim v1 is a hardware oriented stream cipher that was proposed by Berbain et al. and has been submitted to eSTREAM. Decim v2 is a revised version of Decim v1 and was submitted to ISO/IEC 18033-4. Decim-128 is a 128-bit security version of Decim. In this paper, we propose related key chosen IV attacks on Decim v2 and Decim-128. The attacks on Decim v2 and Decim-128 can recover the 80-bit and 128-bit secret keys with computational complexity of 2(68)/2(96), requiring 2(20)/2(51) chosen IVs, 2(26)/2(56.88)-bit stream sequence and negligible/2(42.58) bits space, respectively. When more than 8 and 10 related keys can be obtained for Decim v2 and Decim-128, the computational complexity can be reduced to 2(32)/2(38), requiring 2(23)/2(33.32) chosen IVs, 2(29)/2(39.25)-bit stream sequence and negligible/2(30.91) bits space, respectively. These results have been the best key recovery attacks on Decim v2 and Decim-128. (C) 2011 Elsevier Ltd. All rights reserved.

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

cryptanalysis
related key chosen iv attack
decim-128


Approximation of Irregular Geometric Data by Locally Calculated Univariate Cubic \(L^1\) Spline Fits \(L^1\) splines have been under development for interpolation and approximation of irregular geometric data. We investigate the advantages in terms of shape preservation and computational efficiency of calculating univariate cubic \(L^1\) spline fits using a steepest-descent algorithm to minimize a global data-fitting functional under a constraint implemented by a local analysis-based interpolating-spline algorithm on 5-node windows. Comparison of these locally calculated \(L^1\) spline fits with globally calculated \(L^1\) spline fits previously reported in the literature indicates that the locally calculated spline fits preserve shape on the average slightly better than the globally calculated spline fits and are computationally more efficient because the locally-calculated-spline-fit algorithm can be parallelized.

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

approximation
shape preservation
univariate


CrossMDA: a model-driven approach for aspect management Nowadays, the complexity of software applications has brought new challenges to developers, having to deal with a large number of computational requirements. Among these requirements, those known as crosscutting concerns transpass components boundaries, leading to maintainability and comprehension problems. This paper presents CrossMDA, a framework that encompasses a transformation process to integrate crosscutting concerns in model-oriented systems. It uses the concepts of horizontal separation of concerns from AOP to create independent business and aspect models, integrating those models through MDA transformations ( vertical separation of concerns). CrossMDA comprises a development process, a set of services and support tools. The main advantages of this approach are to raise the abstraction level of aspect modeling, to promote the reuse of crosscutting concerns modeled as PIM elements, besides automating the process of mapping the relationship of crosscutting concerns and business models through the process of MDA transformations.

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

crosscutting concerns
mda transformations

model driven architecture
aspect oriented software development


A FPGA CORE GENERATOR FOR EMBEDDED CLASSIFICATION SYSTEMS We describe in this work a Core Generator for Pattern Recognition tasks. This tool is able to generate, according to user requirements, the hardware description of a digital architecture, which implements a Support Vector Machine, one of the current state-of-the-art algorithms for Pattern Recognition. The output of the Core Generator consists of a high-level language hardware core description, suitable to be mapped on a reconfigurable device, like a Field Programmable Gate Array (FPGA). As an example of the use of our tool, we compare different solutions, by targeting several reconfigurable devices, and implement the recognition part of a machine vision system for automotive applications.

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

core generator
pattern recognition
support vector machine
field programmable gate array


Numerical investigation of fully developed laminar flow in irregular annuli: Square-circular ducts Numerical study is carried out on fully developed laminar axial flow of incompressible Newtonian fluid in irregular annuli of different cross-sectional geometry. Accurate prediction of the friction factor of this flow was obtained using high-order finite element method. Investigations are performed for the annular flow between rectangular and circular ducts under all possible arrangements. The governing equations are solved by an efficient finite element technique. It was found that a higher annular area-ratio will lead to a monotonic increase in (f Re) value in the case of regular annuli, and will lead to an increase followed by a decrease in (f Re) value in the case of irregular annuli. Furthermore, this study illustrates that irregular annuli have lower (f Re) value than regular annuli, and that the square-in-circle case (SC-case) has the lowest (f Re) value whereas the circle-in-circle case (CC-case) has the highest (1 Re) value. The finite element technique developed in this study was validated against the already reported numerical results in the literature, and the results presented in this work show excellent agreement. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

fully developed flow
irregular annulus
numerical analysis


Theoretical comparison of two interstitial ultrasound applicators designed to induce cylindrical zones of tissue ablation Although interstitial techniques are invasive, they are still the first-line therapeutic modalities for certain types of tumour. They are mainly relevant to tumours that are either inoperable or located so deep that access is complicated. Of the various types of radiation that can be delivered by the interstitial route, ultrasound is the most suitable for deep heating. The study compares the efficacy of two types of applicator with respect to their ability to induce cylindrical zones of coagulation necrosis. The transducer of the first applicator is tubular, whereas the second is plane and can rotate around its axis. Both have an external diameter of 4 mm, are fitted with surface cooling systems and operate at 10.7 MHz and 14 W.cm(-2). Comparison involves mathematical modelling of ablated tissue in the targeted area by resolving the bioheat transfer equation (BHTE) using an algorithm based on finite differences. The BHTE gives a temperature Value from which the thermal dose can be determined. It is shown that tissue ablation by tubular transducers is slow, and, in consequence, perfusion disturbs the heating pattern: in vivo, irradiation with a tubular transducer lasting 1081 s would be required to ablate a tissue mass with a radius of 8 mm. The corresponding period using a rotating plane transducer with 20 firing angles is only 618 s. The mean exposure time of each shot lasts 37 +/- 7 s. Therefore perfusion would have much less impact in the case of therapy administered using a plane transducer than that using a tubular one.

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

plane or tubular transducers
theoretical model


Facial expression recognition in dynamic sequences: An integrated approach Extraction of dynamic signals via a parametric space to improve the automatic facial expression recognition rate. An objective comparison with systems utilizing static apex expression recognition. The use of a visualisation technique for the analysis and initial understanding of facial feature data. An intuitive user study to investigate the correlation between human perception and machine vision.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 feature extraction and visualisation


Computing the Voronoi cells of planes, spheres and cylinders in R-3 We present an algorithm for computing the Voronoi cell for a set of planes, spheres and cylinders in R-3. The algorithm is based on a lower envelope computation of the bisector surfaces between these primitives, and the projection of the trisector curves onto planes bounding the object for which the Voronoi cell is computed. denoted the base object. We analyze the different bisectors and trisectors that can occur in the Computation. Our analysis shows that most of the bisector surfaces are quadric surfaces and five of the ten possible trisectors are conic section curves. We have implemented our algorithm using the IRIT library and the CGAL 3D lower envelope package. All presented results are from our implementation. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

constructive solid geometry
skeleton
medial axis


Architecture and evaluation of a unified V2V and V2I communication system based on cellular networks Vehicle communications are becoming the cornerstone in the future vehicle equipment. More specifically, vehicle to vehicle communications (V2V) are the main object of researching nowadays, because vehicle to infrastructure (V2I) approximations are already being developed as commercial solutions. Cellular networks (CN) are usually applied in V2I solutions, whereas ad hoc networks are practically the only technology considered in V2V communications. Due to fact that CN are currently a reality and the operators are continuously improving the network, this communication technology could be considered as a candidate to deal with V2V necessities as well. The present paper defends the applicability of CN in the V2V field, and presents a novel communication paradigm for vehicles which unifies both V2V and V2I paradigms into one system. A peer to peer network technology has been used over the CN basis to create a group-based communication infrastructure which enables the message propagation among vehicles and between the car and the road side infrastructure. The architecture has been implemented in both hardware and software terms, and multitude of field tests have been carried out, whose main performance results are shown in the paper. (C) 2007 Elsevier B.V. All rights reserved.

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


Design of Robust Transceiver for Precoded Uplink MU-MIMO Transmission in Limited Feedback System This paper proposes a robust transceiver design against the effect of channel state information (CSI) estimation error to optimize precoded uplink (UL) multi-user multiple-input multiple-output (MU-MIMO) transmission in limited feedback system under the consideration of the least-square technique on CSI estimation. To improve this limited feedback precoding, the constrained minimum variance (MV) approach with quadratic form to realize the computationally-efficient optimization problem, advantageously invoking the characteristics of the CSI estimation error, is proposed to suppress the effect of CSI estimation error, multiple user interference and noise. According to the Lagrange multiplier method on this MV approach, the deterministic function to resist uncertain CSI can be obtained to optimize design of the precoder and adaptive matrices jointly. With these optimum adaptive and precoder matrices, an optimum robust weighting matrix can be obtained to facilitate the user-wise detection in precoded UL MU-MIMO system. Performance analysis shows that the proposed robust weighting matrix is an unbiased design and it also can regularize the diagonal loading factor technique, and the detection performance of the proposed robust transceiver design can be predicted simplistically by applying our derived signal-to-interference-plus-noise ratio formulation. Computer simulations are conducted to confirm the efficacy of the proposed design in both perfect and imperfect CSI estimation.

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


MAHRU-M: A mobile humanoid robot platform based on a dual-network control system and coordinated task execution This paper introduces a mobile humanoid robot platform able to execute various services for humans in their everyday environments. For service in more intelligent and varied environments, the control system of a robot must operate efficiently to ensure a coordinated robot system. We enhanced the efficiency of the control system by developing a dual-network control system. The network system consists of two communication protocols: high-speed IEEE 1394, and a highly stable Controller Area Network (CAN). A service framework is also introduced for the coordinated task execution by a humanoid robot. To execute given tasks, various sub-systems of the robot were coordinated effectively by this system. Performance assessments of the presented framework and the proposed control system are experimentally conducted. MAHRU-M, as a platform for a mobile humanoid robot, recognizes the designated object. The objects pose is calculated by performing model-based object tracking using a particle filter with back projection-based sampling. A unique approach is used to solve the human-like arm inverse kinematics, allowing the control system to generate smooth trajectories for each joint of the humanoid robot. A mean-shift algorithm using bilateral filtering is also used for real-time and robust object tracking. The results of the experiment show that a robot can execute its services efficiently in human workspaces such as an office or a home.

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

humanoid robot
control system
task execution


Standby power consumption estimation by interacting leakage current mechanisms in nanoscaled CMOS digital circuits Leakage currents are gaining importance as design parameters in nanometer CMOS technologies. A novel leakage current estimation method, which takes into account the dependency of leakage mechanisms, is proposed for general CMOS complex gates, including non-seriesparallel transistor arrangements, not covered by existing approaches. The main contribution of this work is a fast, accurate, and systematic procedure to determine the potentials at transistor network nodes for calculating standby static currents. The proposed method has been validated through electrical simulations, showing an error smaller than 7% and an 80 speed-up when comparing to electrical simulation.

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

static power dissipation
subthreshold leakage
gate oxide tunneling


GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose several novel solutions to this problem based on genetic algorithms (GA). The proposed solutions consist of six different schemes for genotype representation, and also several new heuristic algorithms for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed algorithms in comparison with other existing heuristic and GA-based algorithms using simulation results. The most efficient combination of various proposed alternative algorithms is selected as our final solution by the simulation results. This proposed GA-based algorithm has overcome the existing algorithms considering average tree cost and running time. (C) 2003 Elsevier B.V. All rights reserved.

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

quality of service
multiconstrained steiner tree
genetic algorithm


A second-order TVD implicit-explicit finite volume method for time-dependent convection-reaction equations A class of conservative methods is developed in the more general framework of cell-centered upwind differences to approximate numerically the solution of one-dimensional non-linear conservation laws with (possibly) stiff reaction source terms. These methods are based on a non-oscillatory piecewise linear polynomial representation of the discrete solution within any mesh interval to compute pointwise solution values. The piecewise linear approximate solution is obtained by approximating the cell average of the analytical solution and the solution slope in every mesh cell. These two quantities are evolved in time by solving a set of discrete equations that are suitably designed to ensure formal second-order consistency. Several numerical tests which are taken from literature illustrate the performance of the method in solving non-stiff and stiff convection-reaction equations in conservative form. (C) 2009 IMACS. Published by 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

stiff reaction terms
shock-capturing non-oscillatory methods
implicit-explicit time-stepping methods


parallel scheduling of complex dags under uncertainty This paper introduces a parallel scheduling problem where a directed acyclic graph modeling t tasks and their dependencies needs to be executed on n unreliable workers. Worker i executes task j correctly with probability p i , j . The goal is to find a regimen ?, that dictates how workers get assigned to tasks (possibly in parallel and redundantly) throughout execution, so as to minimize expected completion time. This fundamental parallel scheduling problem arises in grid computing and project management fields, and has several practical applications.We show a polynomial time algorithm for the problem restricted to the case when dag width is at most a constant and the number of workers is also at most a constant. These two restrictions may appear to be too severe. However, they are fundamentally required. Specifically, we demonstrate that the problem is NP-hard with constant number of workers when dag width can grow, and is also NP-hard with constant dag width when the number of workers can grow. When both dag width and the number of workers are unconstrained, then the problem is inapproximable within factor less than 5/4, unless P=NP.

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

scheduling of dags
probabilistic failures
resource constraints
combinatorial optimization
algorithms and theory


A comprehensive empirical comparison of modern supervised classification and feature selection methods for text categorization An important aspect to performing text categorization is selecting appropriate supervised classification and feature selection methods. A comprehensive benchmark is needed to inform best practices in this broad application field. Previous benchmarks have evaluated performance for a few supervised classification and feature selection methods and limited ways to optimize them. The present work updates prior benchmarks by increasing the number of classifiers and feature selection methods order of magnitude, including adding recently developed, state-of-the-art methods. Specifically, this study used 229 text categorization data sets/tasks, and evaluated 28 classification methods (both well-established and proprietary/commercial) and 19 feature selection methods according to 4 classification performance metrics. We report several key findings that will be helpful in establishing best methodological practices for text categorization.

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

machine learning
text processing
information retrieval


Design and simulation of a nanoelectronic single-electron ControlNot gate A nanoelectronic single-electron ControlNot gate is presented in this paper. Bits of information are represented by the presence or absence of single electrons at conducting islands. The logic operation of the gate is verified using simulation, whereas the stability of its operation is analyzed using Monte-Carlo method.

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


Specifying ACT-R models of user interaction with a GOMS language We describe a system, G2A, that produces ACT-R models from GOMS models. The GOMS models can contain hierarchical methods, visual and memory stores, and control constructs. G2A allows ACT-R models to be built much more quickly, in hours rather than weeks. Because GOMS is a more abstract formalism than ACT-R, most GOMS operators can be plausibly translated in different ways into ACT-R productions (e.g., a GOMS Look-for operator can be carried out by different visual search strategies in ACT-R). Given a GOMS model, G2A generates and evaluates alternative ACT-R models by systematically varying the mapping of GOMS operators to ACT-R productions. In experiments with a text editing task, G2A produces ACT-R models whose predictions are within 5% of GOMS model predictions. In the same domain, G2A also generates ACT-R models that give better predictions than GOMS, providing good predictions of overall task duration for actual users (within 2%), though the models are less accurate at a detailed level. In a separate experiment with a mouse-driven telephone dialing task, G2A produces models that do a better job of distinguishing between competing interfaces than a Fitts law model or an ACT-R model built by hand. G2A starts to describe the relationship between two major theories of cognition. This may have appeared a simple relationship, but the complexity of the translation illustrates why this was not done before. G2A shows a way forward for cognitive models, that of higher level languages that compile into more detailed specifications.

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


Anti-HIV, Anti-Poxvirus, and Anti-SARS Activity of a Nontoxic, Acidic Plant Extract from the Trifollium Species Secomet-V/anti-Vac Suggests That It Contains a Novel Broad-Spectrum Antiviral Enveloped animal viruses such as human immunodeficiency virus (HIV), hepatitis B virus, hepatitis C virus, human papillomavirus, Marburg, and influenza are major public health concerns around the world. The prohibitive cost of antiretroviral (ARV) drugs for most HIV-infected patients in sub-Saharan Africa and the serious side effects in those who have access to ARV drugs make a compelling case for the study of complementary and alternative therapies. Such therapies should have scientifically proved antiviral activity and minimal toxic effects. A plant extract, Secomet-V, with an anecdotal indication in humans for promise as an anti-HIV treatment, was investigated. Using a previously described attenuated vaccinia virus vGK5, we established the antiviral activity of Secomet-V. Chemical analysis showed that it has an acidic pH, nontoxic traces of iron (<10 ppm), and almost undetectable levels of arsenic (<1.0 ppm). The color varies from colorless to pale yellow to dark brown. The active agent is heat stable at least up to sterilizing temperature of 121C. The crude plant extract is a mixture of several small molecules separable by high-pressure liquid chromatography. The HIV viral loads were significantly reduced over several months in a few patients monitored after treatment with Secomet-V. Secomet-V was also found to have antiviral activity against the SARS virus but not against the West Nile virus. Secomet-V, therefore, is a broad-spectrum antiviral, which possibly works by neutralizing viral infectivity, resulting in the prevention of viral attachment.

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

anti-hiv
anti-poxvirus
secomet-v
anti-sars
broad-spectrum antiviral
enveloped viruses


Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date This paper deals with the total weighted tardiness minimization with a common due date on a single machine. The best previous approximation algorithm for this problem was recently presented in [H. Kellerer, V.A. Strusevich, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, Theoretical Computer Science 369 (2006) 230238] by Kellerer and Strusevich. They proposed a fully polynomial time approximation scheme (FPTAS) of O((n6logW)/?3) O ( ( n 6 log W ) / ? 3 ) time complexity (W W is the sum of weights, n n is the number of jobs and ? ? is the error bound). For this problem, we propose a new approach to obtain a more effective FPTAS of O(n2/?) O ( n 2 / ? ) time complexity. Moreover, a more effective and simpler dynamic programming algorithm is designed.

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

tardiness
common due date
fptas
approximation


formalization of temporal thematic map contents In this paper, we will focus on the temporal evolution of thematic maps in order to answer queries that refer to the time varying elements characterizing a thematic map, i.e., the geometric component of the map and the associated alphanumeric information. In this context, we first define through a functional approach (functional in the sense that it uses the function as mathematical structure) the notions of basic and thematic maps and a set of operators for their manipulation. Then, we define a space-time composite functional approach by associating time to the above mentioned notions in order to model the temporal evolution of maps information. In this context, we consider some new temporal operators. Finally, we illustrate the application of the proposed operators through some query examples.

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


THE THEORY OF TONE SEMANTICS - CONCEPT, FOUNDATION, AND APPLICATION Tone semantics is a psychoacoustic-based theory of gestalt perception that deals with tone perception and the assignment of functional relationships between tones in the musical context. The theory provides an operational account of semantics in terms of complex dynamic systems theory and forms the basis for non-symbolic research in music imagination. This is illustrated by an application in the automatic recognition of tone centers from acoustical input. An analysis of the basic concepts and related epistemological and methodological principles reveals a promising paradigm for music research.

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

music recognition
cognitive musicology
ai


reducing electricity cost through virtual machine placement in high performance computing clouds In this paper, we first study the impact of load placement policies on cooling and maximum data center temperatures in cloud service providers that operate multiple geographically distributed data centers. Based on this study, we then propose dynamic load distribution policies that consider all electricity-related costs as well as transient cooling effects. Our evaluation studies the ability of different cooling strategies to handle load spikes, compares the behaviors of our dynamic cost-aware policies to cost-unaware and static policies, and explores the effects of many parameter settings. Among other interesting results, we demonstrate that (1) our policies can provide large cost savings, (2) load migration enables savings in many scenarios, and (3) all electricity-related costs must be considered at the same time for higher and consistent cost savings.

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

computing cloud
multi-data-center
energy


genre identification and goal-focused summarization In this paper, we present a novel technique of first performing document genre identification, then utilizing the genre for producing tailored summaries based on a user's information seeking needs - genre oriented goal-focused summarization - such as a plot or opinion summary of a movie review. We create a test corpus to determine genre classification accuracy for 16 genres, and examine performance on various amounts of training data for machine learning algorithms - Random Forests, SVM light and Nave Bayes. Results show that Random Forests outperforms SVM light and Nave Bayes. The genre tag is used to inform a downstream summarization engine. We define types of summaries for 7 genres, create a ground truth corpus and analyze the results of genre oriented goal-focused summarization, showing that this type of user based summarization requires different algorithms than the leading sentence baseline which is known to perform well in the case of news articles.

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

summarization
machine learning
genre identification

text categorization
evaluation
text classification
metadata extraction
task-based information retrieval
data mining


New statistical approaches for anomaly detection Computer security is a growing problem. Over the last years, the number and variety of security attacks in IP-based network infrastructures have increasingly grown, leading to the need of developing new security architectures. In this scenario, the use of intrusion detection systems (IDSs) has emerged as a key element, since it permits to tackle security threats by masquerader, misfeasor, and clandestine users. In this paper, we address the problem considering some new statistical techniques for detecting network anomalies. In more detail, the paper discusses the use of several statistical models to characterize the normal behavior of the network traffic running over TCP, so that anomalies can be revealed as significant deviations from such behavior. Namely, our proposal is based on the use of Markov chains, co-occurrence matrices, and compression algorithms, for modeling the TCP connections, in terms of statistical analysis of some of the packet header fields. The performance analysis, presented in this paper, demonstrates the effectiveness of the proposed methods. Copyright (C) 2009 John Wiley & Sons, Ltd.

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


a measurement-friendly network (mfn) architecture Using active Techniques to measure networks, that is by injecting probe packets, has proved to be quite challenging for properties beyond simple end-to-end delay and loss. Some of the greatest difficulties have resulted from our inability to design techniques robust to multi-hop queueing effects. This difficulty is only compounded by the need to keep measurements non-intrusive, that is to minimally affect ongoing data flows. In this paper, we show that novel network primitives based on hop-dependent priority queueing are very effective in addressing these challenges. By enabling these primitives, network operators can perform a variety of active measurements accurately. Such measurement-friendliness results from many factors including ease of applying fundamentally single-hop methods, better measurement capabilities, and easier clock synchronization. Other advantages of our architecture include ease of deployment, simplicity, low overhead and generality, i.e., no constraints on scheduling policies for data packets. We also discuss the challenges faced, for example, in coping with small but unavoidable inaccuracies and with exposing the primitives to end-users.

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

measurement-friendly network
probing
active measurement


Higher order unification via explicit substitutions Higher order unification is equational unification for beta eta-conversion. But it is not first order equational unification, as substitution has to avoid capture. Thus, the methods for equational unification (such as narrowing) built upon grafting (i.e,, substitution without renaming) cannot be used for higher order unification, which needs specific algorithms. Our goal in this paper is to reduce higher order unification to first order equational unification in a suitable theory. This is achieved by replacing substitution by grafting, but this replacement is not straightforward as it raises two major problems. First, some unification problems have solutions with grafting but no solution with substitution. Then equational unification algorithms rest upon the fact that grafting and reduction commute. But grafting and beta eta-reduction do not commute in lambda-calculus and reducing an equation may change the set of its solutions. This difficulty comes from the interaction between the substitutions initiated by prl-reduction and the ones initiated by the unification process. Two kinds of Variables are involved: those of beta eta-conversion and those of unification. So, we need to set up a calculus which distinguishes between these two kinds of variables and such that reduction and grafting commute. For this purpose, the application of a substitution of a reduction variable to a unification one must be delayed until this variable is instantiated. Such a separation and delay are provided by a calculus of explicit substitutions. Unification in such a calculus can be performed by well-known algorithms such as narrowing, but we present a specialised algorithm for greater efficiency. At last we show how to relate unification in lambda-calculus and in a calculus with explicit substitutions. Thus, we come up with a new higher order unification algorithm which eliminates some burdens of the previous algorithms, in particular the functional handling of scopes. Huet's algorithm can be seen as a specific strategy for our algorithm, since each of its steps can be decomposed into elementary ones, leading to a more atomic description of the unification process. Also, solved forms in lambda-calculus can easily be computed from solved forms in lambda sigma-calculus. (C) 2000 Academic Press.

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

explicit substitutions
higher order unification
equational unification


Interactive ads recommendation with contextual search on product topic space The rapid popularization of various online media services have attracted large amounts of consumers and shown us a large potential market of video advertising. In this paper, we propose interactive service recommendation based on ad concept hierarchy and contextual search. Instead of traditional ODP (Open Directory Project) based approach, we built a ad domain based concept hierarchy to make the most of the product details over the e-commerce sites. Firstly, we capture the summarization images related to the advertising product in the video content and search visually similar product images from the built product image database. Then, we aggregate the visual tags and textual tags with K-line clustering. Finally, we map them to the product concept space and make keywords suggestion, and users can interactively select keyframes or keywords to personalize their intentions by textual re-search. Experiments and comparison show that the system can accurately provide effective advertising suggestions.

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


Localization and segmentation of aortic endografts using marker detection A method for localization and segmentation of bifurcated aortic endografts in computed tomographic angiography (CTA) images is presented. The graft position is determined by detecting radiopaque markers sewn on the outside of the graft. The user indicates the first and the last marker, whereupon the remaining markers are automatically detected. This is achieved by first detecting marker-like structures through second-order scaled derivative analysis, which is combined with prior knowledge of graft shape and marker configuration. The identified marker centers approximate the graft sides and, derived from these, the central axis. The graft boundary is determined by maximizing the local gradient in the radial direction along a deformable contour passing through both sides. Three segmentation methods were tested. The first performs graft contour detection in the initial CT-slices, the second in slices that were reformatted to be orthogonal to the approximated graft axis, and the third uses the segmentation from the second method to find a more reliable approximation of the axis and subsequently performs contour detection. The methods have been applied to ten CTA images and the results were compared to manual marker indication by one observer and region growing aided segmentation by three observers. Out of a total of 266 markers, 262 were detected. Adequate approximations of the graft sides were obtained in all cases. The best segmentation results were obtained using a second iteration orthogonal to the axis determined from the first segmentation, yielding an average relative volume of overlap with the expert segmentations of 92%, while the interexpert reproducibility is 95%. The averaged difference in volume measured by the automated method and by the experts equals the difference among the experts: 3.5%.

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

blood vessels
boundary detection
image segmentation


Obstacle Avoidance During Walking in Real and Virtual Environments Immersive virtual environments are a promising research tool for the study of perception and action, on the assumption that visual-motor behavior in virtual and real environments is essentially similar. We investigated this issue for locomotor behavior and tested the generality of Fajen and Warren's [2003] steering dynamics model. Participants walked to a stationary goal while avoiding a stationary obstacle in matched physical and virtual environments. There were small, but reliable, differences in locomotor paths, with a larger maximum deviation (Delta = 0.16 m), larger obstacle clearance (Delta = 0.16 m), and slower walking speed (Delta = 0.13 m/s) in the virtual environment. Separate model fits closely captured the mean virtual and physical paths (R(2) > 0.98). Simulations implied that the path differences are not because of walking speed or a 50% distance compression in virtual environments, but might be a result of greater uncertainty about the egocentric location of virtual obstacles. On the other hand, paths had similar shapes in the two environments with no difference in median curvature and could be modeled with a single set of parameter values (R(2) > 0.95). Fajen and Warren's original parameters successfully generalized to new virtual and physical object configurations (R(2) > 0.95). These results justify the use of virtual environments to study locomotor behavior.

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

verification
experimentation
theory
locomotion
virtual reality
modeling


Approximate entity extraction in temporal databases We study the problem of efficiently extracting K entities, in a temporal database, which are most similar to a given search query. This problem is well studied in relational databases, where each entity is represented as a single record and there exist a variety of methods to define the similarity between a record and the search query. However, in temporal databases, each entity is represented as a sequence of historical records. How to properly define the similarity of each entity in the temporal database still remains an open problem. The main challenging is that, when a user issues a search query for an entity, he or she is prone to mix up information of the same entity at different time points. As a result, methods, which are used in relational databases based on record granularity, cannot work any further. Instead, we regard each entity as a set of "virtual records", where attribute values of a "virtual record" can be from different records of the same entity. In this paper, we propose a novel evaluation model, based on which the similarity between each "virtual record" and the query can be effectively quantified, and the maximum similarity of its "virtual records" is taken as the similarity of an entity. For each entity, as the number of its "virtual records" is exponentially large, calculating the similarity of the entity is challenging. As a result, we further propose a Dominating Tree Algorithm (DTA), which is based on the bounding-pruning-refining strategy, to efficiently extract K entities with greatest similarities. We conduct extensive experiments on both real and synthetic datasets. The encouraging results show that our model for defining the similarity between each entity and the search query is effective, and the proposed DTA can perform at least two orders of magnitude improvement on the performance comparing with the naive approach.

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

temporal databases
approximate entity extraction


Non-fragile passive controller design for nonlinear Markovian jumping systems via observer-based controls The paper deals with the problem of non-fragile observer-based passive control for a class of Markovian jumping systems (MJSs) subjected to uncertainties, nonlinearities and time-delays. Based on the TakagiSugeno fuzzy models, the dynamics of mode-dependent non-fragile state observer and feedback controller system and the combined closed-loop fuzzy dynamic MJSs are constructed. A sufficient condition for passivity and stochastic stability of the combined system is derived and proved by means of the LyapunovKrasovskii functional methods and linear matrix inequalities (LMIs) techniques. The non-fragile passive controller and observer parameters can be solved directly by using the existing LMIs optimization techniques. Finally, a numerical simulation is given to illustrate the performance of the proposed approach.

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

markovian jumping systems
passive control
takagisugeno fuzzy models

non-fragile state observer
linear matrix inequalities (lmis)


Highly adhesive electroless barrier/Cu-seed formation for high aspect ratio through-Si vias A conformal diffusion barrier was formed in a high aspect ratio through-silicon via using electroless plating. Dense adsorption of Pd nanoparticle catalyst on SiO2 assisted the formation of a thin electroless CoWB layer, upon which an electroless Cu seed layer could be deposited. The adhesion strength of the CoWB film was enhanced by reducing the film thickness, and the maximum strength was obtained at a thickness of 20nm. The CoWB layer exhibited good barrier properties against Cu diffusion to SiO2 after annealing at 300C, although slight diffusion of the Pd atoms in Cu was observed.

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

through si via
diffusion barrier layer
pd nano particles


Adaptive mouth segmentation using chromatic features The automatic segmentation of the mouth from its facial background is a very difficult computer vision problem due to the low grayscale distinction between classes. Recently chromatic based segmentation has enjoyed some popularity for the purposes of mouth tracking due to its ability to distinguish between the two classes. Such systems have to be highly adaptive due to problems with colour constancy. In this paper, a technique for adaptive segmentation is investigated using an unsupervised clustering technique incorporating the expectation maximisation (EM) algorithm across a variety of chromatic features. Results are presented from the M2VTS database across a number of subjects.

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


Gauss-Radau formulae for Jacobi and Laguerre weight functions Explicit expressions are obtained for the weights of the Gauss-Radau quadrature formula for integration over the interval [-1, 1] relative to the Jacobi weight function (1-t)(alpha)(1+t)(beta), alpha>-1, beta>-1. The nodes are known to be the eigenvalues of a symmetric tridiagonal matrix, which is also obtained explicitly. Similar results hold for Gauss-Radau quadrature over the interval [0, infinity) relative to the Laguerre weight t(alpha) e(-t), alpha>-1. (C) 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.

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

gauss-radau formula
laguerre weight function


A FIRST STAGE COMPARATIVE SURVEY ON HUMAN ACTIVITY RECOGNITION METHODOLOGIES The development of vision-based human activity recognition and analysis systems has been a matter of great interest to both the research community and practitioners during the last 20 years. Traditional methods that require a human operator watching raw video streams are nowadays deemed as at least ineffective and expensive. New, smart solutions in automatic surveillance and monitoring have emerged, propelled by significant technological advances in the fields of image processing, artificial intelligence, electronics and optics, embedded computing and networking, molding the future of several applications that can benefit from them, like security and healthcare. The main motivation behind it is to exploit the highly informative visual data captured by cameras and perform high-level inference in an automatic, ubiquitous and unobtrusive manner, so as to aid human operators, or even replace them. This survey attempts to comprehensively review the current research and development on vision-based human activity recognition. Synopses from various methodologies are presented in an effort to garner the advantages and shortcomings of the most recent state-of-the-art technologies. Also a first-level self-evaluation of methodologies is also proposed, which incorporates a set of significant features that best describe the most important aspects of each methodology in terms of operation, performance and others and weighted by their importance. The purpose of this study is to serve as a reference for further research and evaluation to raise thoughts and discussions for future improvements of each methodology towards maturity and usefulness.

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

human action/activity recognition
event detection
behavior analysis
comparative study


Progress toward generating informative porcine biomedical models using induced pluripotent stem cells Porcine induced pluripotent stem cells hold significant promise in modeling human biomedical regenerative medicine and as translational large animal disease models.

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


Spatial-resolution enhancement in computed tomography We propose an approach that combines an asymmetric fan-beam configuration and a new reconstruction algorithm to enhancing spatial resolution in computed tomography (CT). The asymmetric configuration can be achieved by changing the center of rotation (COR) from the conventional symmetric configuration. It does not, however, require new detectors and X-ray source nor alter the relative geometry between the detector and the X-ray source. By effectively reducing the distance of the COR to the X-ray source, the asymmetric configuration can increase the effective sampling density in projection data without reducing the size of the field of view (FOV). The proposed algorithm, on the other hand, can reconstruct images directly from data acquired with this asymmetric configuration. We performed numerical studies to demonstrate and validate the proposed acquisition/reconstruction approach. Results in these studies confirm that the proposed approach can lead to enhanced spatial resolution in reconstructed images. The proposed acquisition/reconstruction approach may find applications in micro-CT and industrial CT in which the CORs may be changed.

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

computed tomography (ct)
image reconstruction
image resolution


Predictive LPV control of a liquid-gas separation process The problem of controlling a liquid-gas separation process is approached by using LPV control techniques. An LPV model is derived from a nonlinear model of the process using differential inclusion techniques. Once an LPV model is available, an LPV controller can be synthesized. The authors present a predictive LPV controller based on the GPC controller [Clarke D, Mohtadi C, Tuffs P. Generalized predictive control - Part I. Automatica 1987;23(2):137-48; Clarke D, Mohtadi C, Tuffs P. Generalized predictive control - Part II. Extensions and interpretations. Automatica 1987;23(2):149-60]. The resulting controller is denoted as GPC-LPV. This one shows the same structure as a general LPV controller [El Gahoui L, Scorletti G. Control of rational systems using linear-fractional representations and linear matrix inequalities. Automatica 1996;32(9):1273-84; Scorletti G, El Ghaoui L. Improved LMI conditions for gain scheduling and related control problems. International Journal of Robust Nonlinear Control 1998;8:845-77; Apkarian P, Tuan HD. Parametrized LMIs in control theory. In: Proceedings of the 37th IEEE conference on decision and control; 1998. p. 152-7; Scherer CW. LPV control and full block multipliers. Automatica 2001;37:361-75], which presents a linear fractional dependence on the process signal measurements. Therefore, this controller has the ability of modifying its dynamics depending on measurements leading to a possibly nonlinear controller. That controller is designed in two steps. First, for a given steady state point is obtained a linear GPC using a linear local model of the nonlinear system around that operating point. And second, using bilinear and linear matrix inequalities (BMIs/LMIs) the remaining matrices of GPC-LPV are selected in order to achieve some closed loop properties: stability in some operation zone, norm bounding of some input/output channels, maximum settling time, maximum overshoot, etc., given some LPV model for the nonlinear system. As an application, a GPC-LPV is designed for the derived LPV model of the liquid-gas separation process. This methodology can be applied to any nonlinear system which can be embedded in an LPV system using differential inclusion techniques. (C) 2006 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 B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

lpv controllers
lpv systems
nonlinear systems
bmis


Discretized ISO-learning neural network for obstacle avoidance in reactive robot controllers Isotropic sequence order learning (ISO-learning) and its variations, input correlation only learning (ICO-learning) and ISO three-factor learning (ISO3-learning) are unsupervised neural algorithms to learn temporal differences. As robotic software operates mainly in discrete time domain, a discretization of ISO-learning is needed to apply classical conditioning to reactive robot controllers. Discretization of ISO-learning is achieved by modifications to original rules: weights sign restriction, to adequate ISO-learning devices outputs to the usually predefined kinds of connections (excitatory/inhibitory) used in neural networks, and decay term in learning rate for weights stabilization. Discrete ISO-learning devices are included into neural networks used to learn simple obstacle avoidance in the reactive control of two real robots.

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

iso-learning
temporal sequence learning
reactive robot control
braitenberg's vehicles


A finite mixture model of vehicle-to-vehicle and day-to-day variability of traffic network travel times Separates vehicle-to-vehicle vs. day-to-day variability of travel time. Recognizes multiple possible regimes in traffic flow. Model derived mathematically and calibrated with actual and simulated data. Clustering technique used to identify input scenarios (e.g. weather). Can help assess and evaluate impact of different intervention scenarios on reliability.

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

travel time reliability
travel time variability
gammagamma distribution
expectationmaximization algorithm


Modeling and querying provenance by extending CIDOC CRM This paper elaborates on the problem of modeling provenance for both physical and digital objects. In particular it discusses provenance according to OAIS (ISO 14721:2003) and how it relates with the conceptualization of CIDOC CRM ontology (ISO 21127:2006). Subsequently it introduces an extension of the CIDOC CRM ontology, able to capture the modeling and the query requirements regarding the provenance of digital objects. Over this extension the paper provides a number of indicative examples of modeling provenance in various domains. Subsequently, it introduces a number of indicative provenance query templates, and finally it describes an implementation using Semantic Web technologies.

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

provenance modeling
querying provenance information
digital presentation


Solid-State Disk with Double Data Rate DRAM Interface for High-Performance PCs We propose a Solid-State Disk (SSD) with a Double Data Rate (DDR) DRAM interface for high-performance PCs. Traditional SSDs simply inherit the interface protocol of Hard Disk Drives (HDD) such as Parallel Advanced Technology Attachment (PATA) or Serial-ATA (SATA) for maintaining the compatibility. However, SSD itself provides much higher performance than HDD, hence the interface also needs to be enhanced. Unlike the traditional SSDs, the proposed SSD with DDR DRAM interface is placed in the North Bridge which provides two or more DDR DRAM interface ports in high-performance PCs. The novelty of our work is on DQS signaling scheme which allows arbitrary Column Address Strobe (CAS) latency unlike typical DDR DRAM interface scheme. The experimental results show that the proposed SSD maximally outperforms the traditional SSD by 8.7 times in read mode, by 1.5 times in write mode. Also, for synthetic workloads, the proposed scheme shows performance improvement over the conventional architecture by a factor of 1.6 times.

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


The connectivity of exchanged crossed cube ? The exchanged crossed cube, proposed by Li et al., is a new interconnection network having better properties than other variations of hypercube in the area of the fewer diameter, smaller links and lower cost factor. In this work we will show that the connectivity of exchanged crossed cube is equal to its minimum degree. Moreover each smallest cut in exchanged crossed cube is a neighborhood of some vertex.

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


Contributions to non-identifier based adaptive control in mechatronics Funnel-Control (FC)an adaptive (time-varying) MIMO/SISO control strategyis re-introduced and its applicability introductory for position control of nonlinear, coupled (rigid) robotic systems and for speed control of nonlinear two-mass flexible servo systems is shown. Additionally Error Reference Control (ERC)a direct derivative of FCis established. ERC is specially designed with asymmetric boundaries and auxiliary reference, ensuring that the control error evolves within a prespecified tube (a shrinked funnel region, achieving even better tracking performance). FC and hence ERC are based on the high-gain stabilizability of minimum-phase systems with relative degree one and known sign of the high-frequency gain. Although the plant only needs to be known in structure, both concepts assure prescribed transient behavior without identification and/or parameter estimation. As most industrial applications, also the considered robotic and two-mass flexible servo systems, exhibit relative degrees greater than one, FC and ERC cannot directly be applied. Therefore a special state feedback is introduced, reducing the relative degree and retaining the minimum-phase property. The additional implementation of a nominal PI-like extension guarantees good disturbance rejection and asymptotic tracking of (constant) velocity and position reference trajectories. Simulation results for a 6-DOF Manutec r3 robot underpin and compare the achievable position control performance of one overall MIMO Funnel Controller for all joints and one SISO Funnel Controller for each joint (6 controllers). For nonlinear two-mass flexible servo systems, measurement results demonstrate the achievable load speed control performance of FC and ERC in comparison to optimal LQ state feedback.

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

error reference control
relative degree
mechatronics

non-identifier adaptive control
funnel control
minimum phase


Adaptive Passivity-Based Control of PEM Fuel Cell/Battery Hybrid Power Source for Stand-Alone Applications In this paper, a DC hybrid power source composed of PEM fuel cell as main source, Li-ion battery storage as transient power source and their power electronic interfacing is modelled based on Euler-Lagrange framework. Subsequently, adaptive passivity-based controllers are synthesized using the energy shaping and damping injection technique. Local asymptotic stability is insured as well. In addition, the power management system is designed in order to manage power flow between components. Evaluation of the proposed system and simulation of the hybrid system are accomplished using MATLAB/Simulink. Afterwards, linear PI controllers are provided for the purpose of comparison with proposed controllers responses. The results show that the outputs of hybrid system based on adaptive passivity-based controllers have a good tracking response, low overshoot, short settling time and zero steady-state error. The comparison of results demonstrates the robustness of the proposed controllers for reference DC voltage and resistive load changes.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 passivity-based control
batteries
fuel cells
hybrid power systems
load management


The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction In this paper, we propose a new criterion, namely the minimal spanning tree preservation approach, for both of the DNA multiple sequence alignment and the construction of evolutionary trees. It is our aim to keep the proximity information among the sequences or species via our approach. The basic idea behind this approach is that those distances among species which are close to one another are more informative than the others.

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

minimal spanning tree
multiple sequence alignment
evolutionary tree


Properly colored paths and cycles In an edge-colored graph, let dc(v) d c ( v ) be the number of colors on the edges incident to v v and let ?c(G) ? c ( G ) be the minimum dc(v) d c ( v ) over all vertices v?G v ? G . In this work, we consider sharp conditions on ?c(G) ? c ( G ) which imply the existence of properly edge-colored paths and cycles, meaning no two consecutive edges have the same color.

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

properly colored cycles
edge-colored graphs