Speed up kernel discriminant analysis Linear discriminant analysis (LDA) has been a popular method for dimensionality reduction, which preserves class separability. The projection vectors are commonly obtained by maximizing the between-class covariance and simultaneously minimizing the within-class covariance. LDA can be performed either in the original input space or in the reproducing kernel Hilbert space (RKHS) into which data points are mapped, which leads to kernel discriminant analysis (KDA). When the data are highly nonlinear distributed, KDA can achieve better performance than LDA. However, computing the projective functions in KDA involves eigen-decomposition of kernel matrix, which is very expensive when a large number of training samples exist. In this paper, we present a new algorithm for kernel discriminant analysis, called Spectral Regression Kernel Discriminant Analysis (SRKDA). By using spectral graph analysis, SRKDA casts discriminant analysis into a regression framework, which facilitates both efficient computation and the use of regularization techniques. Specifically, SRKDA only needs to solve a set of regularized regression problems, and there is no eigenvector computation involved, which is a huge save of computational cost. The new formulation makes it very easy to develop incremental version of the algorithm, which can fully utilize the computational results of the existing training samples. Moreover, it is easy to produce sparse projections (Sparse KDA) with a L (1)-norm regularizer. Extensive experiments on spoken letter, handwritten digit image and face image data demonstrate the effectiveness and efficiency of the proposed algorithm.

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

kernel discriminant analysis
regression
dimensionality reduction


COMPARISON OF OPTIMAL PATH PLANNING ALGORITHMS FOR INTELLIGENT CONTROL OF ROBOTIC PART ASSEMBLY TASK Two intelligent part-bringing (path planning or finding) algorithms, to bring a part from an initial position to an assembly hole or a receptacle (target or destination) for a purpose of part mating, related to a robotic part assembly task are introduced. These algorithms are then compared through simulations and several criteria. An entropy function, which is a useful measure of the variability and the information in terms of uncertainty, is introduced to measure its overall performance of a task execution related to the part-bringing task. Fuzzy set theory, well-suited to a management of uncertainty, is introduced to address an uncertainty associated with the part-bringing procedure. A degree of uncertainty associated with a part-bringing is used as an optimality criterion, or cost function, e.g. minimum fuzzy entropy, for a specific task execution. It is shown that the machine organizer using a sensor system can intelligently determine an optimal control value, based on explicit performance criteria, to overcome environmental uncertainty. The algorithms use knowledge processing functions such as machine reasoning, planning, inferencing, learning, and decision-making. The results show the effectiveness of the proposed approaches.

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

path planning algorithms
comparison
fuzzy entropy
optimality criterion
uncertainty

fuzzy theory versus neural network
machine intelligence
fuzziness
vision sensor


constraint-based modelling and analysis of organisations Modern organisations are characterised by a great variety of forms and often involve many actors with diverse goals, performing a wide range of tasks in changing environmental conditions. Due to high complexity, mistakes and inconsistencies are not rare in organisations. To provide better insights into the organisational operation and to identify different types of organisational problems explicit specification of relations and rules, on which the structure and behaviour of an organisation are based, is required. Before it is used, the specification of an organisation should be checked for internal consistency and validity w.r.t. the domain. To this end, the paper introduces a framework for formal specification of constraints that ensure the consistency and validity of organisational specifications. To verify the satisfaction of constraints, efficient and scalable algorithms have been developed and implemented. The framework presented here is based on the organisation modelling framework from [2] which defines four interrelated organisational views (or perspective) with their dedicated predicate logic-based languages: performance-oriented, process-oriented, organisation-oriented and agent-oriented. To express temporal relations, the dedicated languages of the views are embedded into the Temporal Trace Language (TTL) [2], which is a variant of the order-sorted predicate logic. Some of the examples given in the paper are from a case study in the air traffic domain.

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

consistency of a specification
organisation design
organisation modeling
validity of a specification


Global exponential stability of BAM neural networks with recent-history distributed delays and impulses ? In this paper bi-directional associative memory (BAM) neural networks with recent-history distributed delays and impulses are considered. Sufficient conditions for the existence and global exponential stability of a unique equilibrium point are established by using the fixed point theorem and differential inequality techniques. The results of this paper are new and they complement previously known results.

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


Structural similarity-based object tracking in multimodality surveillance videos This paper addresses the problem of object tracking in video sequences for surveillance applications by using a recently proposed structural similarity-based image distance measure. Multimodality surveillance videos pose specific challenges to tracking algorithms, due to, for example, low or variable light conditions and the presence of spurious or camouflaged objects. These factors often cause undesired luminance and contrast variations in videos produced by infrared sensors (due to varying thermal conditions) and visible sensors (e.g., the object entering shadowy areas). Commonly used colour and edge histogram-based trackers often fail in such conditions. In contrast, the structural similarity measure reflects the distance between two video frames by jointly comparing their luminance, contrast and spatial characteristics and is sensitive to relative rather than absolute changes in the video frame. In this work, we show that the performance of a particle filter tracker is improved significantly when the structural similarity-based distance is applied instead of the conventional Bhattacharyya histogram-based distance. Extensive evaluation of the proposed algorithm is presented together with comparisons with colour, edge and mean-shift trackers using real-world surveillance video sequences from multimodal (infrared and visible) cameras.

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

structural similarity measure
object tracking
video sequences

particle filtering
colour and edge cues
multimodal data


Docking study of the precursor peptide of matoparan onto its putative processing enzyme, dipeptidyl peptidase IV: a revisit to molecular ticketing Stepwise-cleavage process of promastoparans to reach maturity was investigated theoretically by combining ab initio folding and unbounded docking. The comparison between the structures of the promastoparans both before and after docking were examined along with the hydrogen bonding interaction pattern between the dipetidyl peptidase IV (DPPIV) and promastoparans to reveal how the endpoint of this stepwise cleavage is recognized among these promastoparans with highly resemble amino acid sequences. The current approach of folding and docking study provides structural insight on the stepwise cleavage process.

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

replica exchange molecular dynamics (remd)


CHARGEBACK AND MATURITY OF IS USE A survey of IS executives was conducted to assess their use of chargeback systems and the maturity of IS management and use. The majority of respondents reported the use of some form of chargeback system that recovered the costs of providing IS services. Findings indicate a positive relationship between sophisticated chargeback systems and most measures of maturity of IS management and use. However, a significant negative relationship was found between level of chargeback and measures of strategic use of IS.

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

is maturity
is cost recovery
value of information
is stages of maturity
levels of chargeback
strategic is
irm
strategic management
end user involvement


Large-scale SPH simulations of droplet impact onto a liquid surface up to the consequent formation of Worthington jet In this study, the whole process of liquid droplet impact onto a liquid surface up to the consequent formation of the central column was simulated using the smoothed particle hydrodynamics method (SPH), and compared with an experiment using a high-speed video camera. The surface tension tensor for the particle-based expression was adequately included as the gradient of the surface tension and that enabled the simulation leading to the formations of crater and crown as well as the consequent central column. The simulated time series of the crater depth and diameter and crown height corresponded quantitatively well with the experimental result up to the rebound motion while discrepancies remained as a lower central column height in the simulation, and this seemed to be ascribed to the difficulty in realizing the complex surface structure that inevitably appeared in the fast rebound motion. 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 B I O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

smoothed particle hydrodynamics
droplet impact
surface tension


Propositional dynamic logic with recursive programs We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata [R. Alur, P. Madhusudan, Visibly pushdown languages, in: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), 2004, ACM, pp. 202-211]. We show that the satisfiability problem for this extension remains decidable, generalising known decidability results for extensions of PDL by non-regular programs. Our decision procedure establishes a 2-ExpTIME Upper complexity bound, and we prove a matching lower bound that applies already to rather weak extensions of PDL with non-regular programs. Thus, we also show that such extensions tend to be more complex than standard PDL. (c) 2007 Elsevier Inc. All rights reserved.

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

propositional dynamic logic
visibly pushdown automata


A conservative unstructured scheme for rapidly varied flows This article introduces a new semi-implicit, staggered finite volume scheme on unstructured meshes for the modelling of rapidly varied shallow water flows. Rapidly varied flows occur in the inundation of dry land during flooding situations. They typically involve bores and hydraulic JUMPS after obstacles Such as road hanks. Near Such sudden flow transitions, the grid resolution is often low compared with the gradients of the bathymetry. Locally the hydrostatic pressure assumption may become invalid. In these situations, it is crucial to apply the correct conservation properties to obtain accurate results. An important feature of this scheme is therefore its ability to conserve momentum locally or, by choice, preserve constant energy head along a streamline. This is achieved using a special interpolation method and control volumes for momentum. The efficiency of inundation calculations with locally very high velocities, and in the case of unstructured meshes locally very small grid distances, is severely hampered by the Courant condition. This article provides a solution in the form of a locally implicit time integration for the advective terms that allows for all explicit calculation in most of the domain, while maintaining, unconditional stability by implicit Calculations only where necessary. The complex geometry of flooded urban areas asks for the flexibility of unstructured meshes. The efficient calculation of the pressure gradient in this, and other semi-implicit staggered schemes, requires, however, in orthogonality condition to be put on the grid. In this article a simple method is introduced to generate unstructured hybrid meshes that fulfil this requirement. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

inundation
conservation properties
locally implicit

rapidly varied flow
unstructured mesh
hybrid mesh
momentum conservation
advection
flooding and drying


Performance comparisons between cellular-only and cellular/WLAN integrated systems based on analytical models To solve the traffic load imbalance issue in cellular networks, which is often in the form of hot-spots caused by the different user mobility levels, one of the good solutions at present is to construct heterogeneous integrated wireless networks that combine cellular networks and wireless local area networks (WLANs) together. In general, the traffic volume is significantly heavier in the hot-spots of cellular networks and a higher data transferring rate can be provided by introducing aWLAN so as to raise the utilization of the channel and achieve a good balance between user satisfaction and the efficiency of the network. In this paper, we provide a comprehensive performance comparison of the systems both before and after the integration, based on an existing mathematical model, focusing on both the qualitative and the quantitative analysis of changes in the performance of the system to validate the efficiency and superiority of the cellular/WLAN integrated systems over cellular-only systems.

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

cellular network
wlan
heterogeneous wireless network
performance evaluation
traffic load balance
horizontal handover
vertical handover


Software for computerised analysis of cardiotocographic traces A software for automatic CTG analysis which could be a useful clinical tool is shown. The software provides important classical and nonlinear parameters. Simulated and real CTG traces were analysed to test software reliability. The software showed good performance, in fact all simulated events were detected. On real CTG: sensitivity equal to 93%, positive predictive value 82%, accuracy 77%.

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

computerised cardiotocography
foetal heart rate variability
nonlinear indices
fhr clinical analysis
software performance
matlab


Quantitative structural information for inferring context free grammars with an extended Cocke-Younger-Kasami algorithm In this paper, we propose an approach to quantitative structural information for inferring context free grammars. First, we construct derivative capacity of nonterminal symbols in context free grammar, concomitant indicator and embedded dimensional number of strings in samples set, which are called as quantitative structural information; then, we rewrite Cocke-Younger-Kasarni (CYK) algorithm for parsing in the form of the derivative set; third, we present the construction of new production rule and the descriptive procedure for inferring with an extended CYK algorithm by the quantitative structural information. Finally, we discuss the extended CYK algorithm for inferring context free grammars. (C) 2011 Elsevier B.V. All rights reserved.

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

quantitative structural information
context free grammars
cyk algorithm

chomsky normal form
grammatical inference
machine learning


higher-order functional programming and wildcards in java Despite the absence of first-class functions in Java, it is possible to program in the style of functional languages like ML or Haskell using the new capabilities in Java 1.5. We show how to use generic classes to program higher-order functions and how this interacts with object-oriented programming. We also show the necessity of the wildcard construct in Java and reveal several pitfalls. We conclude that the constructs in Java do not permit a functional framework that is completely compatible with object-oriented programming.

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


Dynamic 3-D Visualization of Vocal Tract Shaping During Speech Noninvasive imaging is widely used in speech research as a means to investigate the shaping and dynamics of the vocal tract during speech production. 3-D dynamic MRI would be a major advance, as it would provide 3-D dynamic visualization of the entire vocal tract. We present a novel method for the creation of 3-D dynamic movies of vocal tract shaping based on the acquisition of 2-D dynamic data from parallel slices and temporal alignment of the image sequences using audio information. Multiple sagittal 2-D real-time movies with synchronized audio recordings are acquired for English vowel-consonant-vowel stimuli /ala/, /ara/, /asa/, and /afa/. Audio data are aligned using mel-frequency cepstral coefficients (MFCC) extracted from windowed intervals of the speech signal. Sagittal image sequences acquired from all slices are then aligned using dynamic time warping (DTW). The aligned image sequences enable dynamic 3-D visualization by creating synthesized movies of the moving airway in the coronal planes, visualizing desired tissue surfaces and tube-shaped vocal tract airway after manual segmentation of targeted articulators and smoothing. The resulting volumes allow for dynamic 3-D visualization of salient aspects of lingual articulation, including the formation of tongue grooves and sublingual cavities, with a temporal resolution of 78 ms.

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

articulation
dynamic time warping
speech production
vocal tract shaping

real-time magnetic resonance imaging (mri)


Nurses and nurse students demands of functions and usability in a PDA Healthcare organisations are nowadays expecting the support of IT in the daily routines. Personal digital assistants (PDAs) are in use in some healthcare organisations but in an irregular and unplanned way. The aim of the present study was to describe nurses and nurse students demands of functions and usability in a PDA. Interviews were made with 12 nurses at the County Hospital of Kalmar and a questionnaire was given to nurse students (n=84) in their last, i.e. third, year at the Department of Health and Behavioural Sciences, University of Kalmar. There was a need for nurses to make the information in general more rich and efficient by means of a PDA. In a PDA, the nurses and nurse students expected access to information about the patients, knowledge resources and functions for their daily work. The nurses and nurse students had high expectations of a PDA for information retrieval. A PDA has the potential to be accepted as a supportive tool in healthcare organisations if it contains the demanded content which must be adapted to the users needs and the general IT-system used, and the PDA must have a user friendly design.

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

ehcr
handheld computer
healthcare technology
it-tool for nurses


Appearance-cloning: Photo-consistent scene recovery from multi-view images This paper introduces the novel volumetric methodology "appearance-cloning" as a viable solution for achieving, a more improved photo-consistent scene recovery, including a greatly enhanced geometric recovery performance, from a set of photographs taken at arbitrarily distributed multiple camera viewpoints. We do so while solving many of the problems associated with previous stereo-based and volumetric methodologies. We redesign the photo-consistency decision problem of individual voxel in volumetric space as the photo-consistent shape search problem in image space, by generalizing the concept of the point correspondence search between two images in stereo-based approach, within a volumetric framework. In detail, we introduce a self-constrained greedy-style optimization methodology, which iteratively searches a more photo-consistent shape based on the probabilistic shape photo-consistency measure, by using the probabilistic competition between candidate shapes. Our new measure is designed to bring back the probabilistic photo- consistency of a shape by comparing the appearances captured from multiple cameras with those rendered from that shape using the per-pixel Maxwell model in image space. Through various scene recoveries experiments including specular and dynamic scenes, we demonstrate that if sufficient appearances are given enough to reflect scene characteristics, our appearance-cloning approach can successfully recover both the geometry and photometry information of a scene without any kind of scene-dependent algorithm tuning.

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

image-based modeling
volumetric reconstruction
voxel coloring
space carving
appearance
photo-consistency
color similarity


CoJACK: A high-level cognitive architecture with demonstrations of moderators, variability, and implications for situation awareness We report a high-level architecture, CoJACK, that provides insights on behavior variability, situation awareness, and behavioral moderators. CoJACK combines Beliefs/Desires/Intentions (BDI) agents high-level knowledge representation and usability with several aspects of low-level cognitive architectures, including processing time predictions, errors, and traceability. CoJACK explores new areas for cognitive architectures, such as variability arising from moderators. It also allows aspects of situation awareness (SA) in a cognitive architecture to be explored. Its behavior and the effects of moderators on behavior are demonstrated in a simple adversarial environment. It provides lessons for other architectures including how to define, measure, and control variability due to individual and temporal aspects of cognition; the importance of SA and knowledge representations necessary to support complex SA; the potential for parameter sweeps and paths as measures of variability; and some of the complexities that will arise when aspects of moderators and SA are added to cognitive architectures.

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

cognitive architecture
bdi
situation awareness
usability


coordinate representation of order types requires exponential storage We give doubly exponential upper and lower bounds on the size of the smallest grid on which we can embed every planar configuration of n points in general position up to order type. The lower bound is achieved by the construction of a widely dispersed rigid configuration which is then modified to one in general position by recent techniques of Sturmfels and White, while the upper bound uses recent results of Grigor'ev and Vorobjou on the solution of simultaneous inequalities. This provides a sharp answer to a question first posed by Chazelle.

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

order
lower bound
grid
size
storage
types
general
representation

coordination point configurability embedding posit


Theoretical justification of the central area indices and the central interval indices The central area indices and the central interval indices, as introduced in Dorta-Gonzlez and Dorta-Gonzlez (Scientometrics 88(3):729745, 2011), are studied from a theoretical point of view. They are defined in order to yield higher impact values of selective authors (i.e., authors with concentrated number of citations over their publications). We show that this property is not valid for every citation distribution. However, if Zipfs law is adopted for the citation distribution, we can show that the central area indices and the central interval indices have indeed higher values for more selective authors.

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

central area index
central interval index
h-index
hirsch index


Design and verification of peripheral control circuits in Esterel We present a case study showing how an existing concurrent programming language can be used to produce either efficient control-oriented circuits or embedded software from the same description. This description is also amenable to fully automatic formal verification and can be used to produce pairs of reconfigurable components which can be dynamically scheduled into either hardware or software resources. By using an existing concurrent language we increase the productivity because we can make use of readily available tools for debugging, analysis and verification. We believe that a language and a system that generates good software and hardware is a promising starting point for helping mainstream software developers target future manycore systems which will comprise a mixture of software and hardware components as well as provide a valuable technique for producing interchangeable reconfigurable components for run-time reconfigurable FPGAs. Copyright (C) 2007 S. Singh. [Correction made here after initial online publication]

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

circuit synthesis
synchronous hardware descriptions


on isomorphisms and density of np and other complete sets If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P @@@@ NP and if all PTAPE complete sets are p-isomorphic then P @@@@ PTAPE. We show that all NP complete sets known (in the literature) are indeed p-isomorphic and so are the known PTAPE complete sets. Thus showing that, inspite of the radically different origins and attempted simplification of these sets, all the known NP complete sets are identical but for polynomially time bounded permutations. Furthermore, if all NP complete sets are p-isomorphic then they all must have similar densities and, for example, no language over a single letter alphabet can be NP complete, nor can any sparse language over an arbitrary alphabet be NP complete. We show that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet. Similarly, we show that the hardest context-sensitive languages cannot be sparse. We also relate the existence of sparse complete sets to the existence of simple combinatorial circuits for the corresponding truncated recognition problem of these languages.

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

simplification polynomial recognition language circuits

map timing examples context-sensitivity permutation completeness


Functional Test of Mesh-Based NoCs with Deterministic Routing: Integrating the Test of Interconnects and Routers In this work, a comprehensive functional-based test method is presented to integrate the test of Network-on-Chip interconnects and routers. Experimental results show that fault coverage can reach up to 100% of interconnect faults and over 90% of router faults. The test structures needed to implement the test method are presented and the scalability of the method is discussed. We show that our approach scales well with the number of routers and channel width. The cost of the functional test strategy and the cost of a scan-based strategy are also analyzed in order to present scenarios where each strategy fits better.

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

functional testing
networks-on-chip
scan testing


Designing coarse-grain reconfigurable architectures by inlining flexibility into custom arithmetic data-paths This paper introduces a design technique for coarse-grained reconfigurable architectures targeting digital signal processing (DSP) applications. The design procedure is analyzed in detail and an area-time-power efficient reconfigurable kernel architecture is presented. The proposed technique inlines flexibility into custom carry-save (CS) arithmetic datapaths exploiting a stable and canonical interconnection scheme. The canonical interconnection is revealed by a transformation, called uniformity transformation, imposed on the basic architectures of CS-multipliers and CS-chain-adders/subtractors. Experimental results including quantitative and qualitative comparisons with existing reconfigurable arithmetic cores and exploration results of the proposed reconfigurable architecture are provided. (C) 2009 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 B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


PANN: Partial-wave analysis of nucleon-nucleon scattering in wide-energy region PANN is a partial-wave analysis program which can be used to determine the complex scattering amplitudes of elastic nucleon-nucleon scattering by fitting the experimental data on many kinds of observables. It is able to apply for an analysis in the wide energy region such as a few MeV similar to 10 GeV. In PANN, the higher partial-wave amplitudes for the analysis in the low energy region (<1 GeV) are given by the one-pion exchange amplitude, and the ones in the high-energy region of several GeV are evaluated by the modified one-boson exchange amplitudes which is equivalent to Veneziano amplitudes, (C) 2000 Published by Elsevier Science B.V.

partial-wave analysis
nucleon-nucleon scattering
regge amplitudes
multi-pole
dibaryon
one-boson-exchange


An initial exploration of the link relationship between UK university Web sites Aggregates of links are of interest to information scientists in the same way as citation counts are: as potential sources of data from which new knowledge can be mined. Builds on the recent discovery of a correlation between a Web link count measure and the research quality of British universities by applying a range of multivariate statistical techniques to counts of links between pairs of universities. 'This represents an initial attempt at developing an understanding of this phenomenon. Extracts plausible results. Also identifies outliers in the data by the techniques, some of which were verified by being tracked down to identifiable Web phenomena. This is an important outcome because successful anomaly identification is a precondition to more effective analysis of this kind of data. The identification of groupings is encouraging evidence that Web links between universities can be mined for significant results, although it is clear that more methodological development is needed, if any but the simplest patterns are to be extracted. Finally, based upon the types of patterns extracted, argues that none of the methods used are capable of fully analysing link structures on their own.

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


Extroversion, neuroticism and self-concept: their impact on internet users in India The aim of this study was to find out the influence of personality structure of an individual, i.e., extroversion, neuroticism and self-concept on the usage of the Internet in India. Further, it was also aimed to find out the correlation between the three above-mentioned variables in the light of Internet usage. Exploratory research design was used in this study and the tools used were: Eysenck Personality Inventory and Mohsin Self-Concept Inventory. The Internet was the medium for data collection and individuals were invited by e-mail to participate in the study. The method of random sampling was used for selecting the sample size of 200. In this study, Internet users were classified as heavy or light users based on the number of hours spent online. While we found no significant difference between heavy and light users of Internet on extroversion and neuroticism, it was found that the heavy users scored high on self-concept.

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


loop schemata We define a class of program schemata arising from the subrecursive programming language Loop. In this preliminary report on Loop schemata we show how to assign functional expressions to these schemata (as one aspect of the problem of assigning meaning to these programs), and we outline a solution to the schemata equivalence problem . Schemata equivalence is reduced to questions about formal expressions. Certain subcases of the problem are easily shown solvable, and although we claim that the general problem is solvable, we do not present the complete solution here because of its complexity.

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

subrecursive programming language
program
equivalence problem
functional

universal programming language
program schemata
unsolvability
computable function
algol
loop language
primitive recursive function
general recursive functional


EAPA: An efficient authentication protocol against pollution attack for smart grid The development of smart grid depends on increased deployment of two-way communication to improve its efficiency and reliability of power delivery. However, this additional dependency also expands the risk from pollution attacks, which consist of injecting malicious packets in the network. The pollution attacks are amplified by the network coding process, resulting in a greater damage to the state estimation and decision making. In this paper, we address this issue by designing an efficient authentication protocol, named EAPA, for the smart grid communication. The proposed scheme allows not only recipient nodes, but also intermediate nodes, to verify the integrity and origin of the packets received without having to decode, and thus detect and discard the malicious packets in transit that fail the verification. By this means, the pollution is canceled out before reaching the destinations. Security analysis demonstrates that the EAPA can be resilient to data/tag pollution attacks and replay attacks. Performance evaluation results show that our EAPA can reduce much more communication overhead than Wus scheme.

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

smart grid
authentication
pollution attack


A dendritic model of coincidence detection in the avian brainstem ? We have constructed a detailed biophysical model of coincidence detector neurons in the nucleus laminaris (auditory brainstem) which are purported to detect interaural time differences (ITDs). In the model, ITD coding is improved when the inputs from both ears are located on the bipolar dendrites and segregated, over having both inputs on the soma: the model behaves like the in vivo coincidence detectors. The model has enabled us to explore features of the coincidence detector neurons unexplained by a simpler biophysical model (Agmon-Snir et al., Nature 393 (1998) 262272), including the effect of synapse location and multiple dendrites.

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


The disruptive potential of PWLAN at the country-level: The cases of Germany, the UK, and the USA This paper analyzes the impact of WLAN technologies for incumbent MNOs based on an empirical cross-country study of the players in the public WLAN-hotspot market using the theory of disruptive innovation and theoretical extensions for the industry- and country-level. The main research question to be analyzed is whether and why PWLAN has shown a disruptive or sustaining impact trend for incumbent MNOs in the hotspot markets of Germany, the UK, and the USA in recent years. The results imply that incumbent MNOs and new entrants have taken advantage of the opportunity provided by PWLAN, but the market success of both types of players varies between the countries analyzed. Incumbent MNOs dominate in Germany but not in the UK and the USA. The reasons for these country-specific differences were further investigated, and the results suggest that the analysis of disruptive potential in telecommunications needs to include country- and firm-specific factors, which are, again, largely influenced by the local regulation.

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

wlan
pwlan
disruptive innovation
telecommunications
regulation

wi-fi
mno
hotspots
cross-country study
mobile communications


on the capacity improvement of ad hoc wireless networks using directional antennas The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity of an ad hoc network does not scale well with the increasing number of nodes in the system when using omnidirectional antennas [6]. We investigate the capacity of ad hoc wireless networks using directional antennas. In this work, we consider arbitrary networks and random networks where nodes are assumed to be static.In arbitrary networks, due to the reduction of the interference area, the capacity gain is proven to be ?2?/? when using directional transmission and omni reception. Because of the reduced probability of two neighbors pointing to each other, the capacity gain is ?2?/? when omni transmission and directional reception are used. Although these two expressions look similar, the proof technique is different. By taking advantage of the above two approaches, the capacity gain is 2?/??? when both transmission and reception are directional.For random networks, interfering neighbors are reduced due to the decrease of interference area when directional antennas are used for transmission and/or reception. The throughput improvement factor is 2?/?, 2?/? and 4? 2 /?? for directional transmission/omni reception, omni transmission/direc-tional reception, and directional transmission/directional reception, respectively.We have also analyzed hybrid beamform patterns that are a mix of omnidirectional/directional and a better model of real directional antennas.

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

network
wireless networks
capacity
scale
factor
reduction
throughput
proven
probability
model
hybrid
interference

point
ad hoc networks
systems
express
concurrency
direct
randomization
directional antenna
ad-hoc
pattern


object-oriented design with trace modeler and trace4j We present two tools that make students more productive during various object-oriented design activities. The first one, Trace Modeler, is a smart UML sequence diagram editor that helps students understand and apply responsibility-driven design. The second tool, Trace4J, is used to record and process the execution of a java program. Both tools are complementary. Students use Trace4J to produce focused sequence diagrams for (part of) a program's execution. Trace Modeler's support for huge diagrams lets them navigate and understand the large results in the initial stages of their processing experiments.

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

object-oriented design
unified modeling language
software development
case tool
program visualization
documentation
responsibility-driven design


Price-based resource allocation for wireless ad hoc networks with multi-rate capability and energy constraints Wireless ad hoc networks have attracted a lot of attentions recently. Resource allocation in such networks needs to address both fairness and overall network performance. Pricing is a prospective direction to regulate behaviors of individual nodes while providing incentives for cooperation. In this work, we develop some pricing strategies for resource allocation by taking account of factors like multiple transmission rates and energy consumption of nodes, which have not been well studied in former works. Multi-rate transmission capability is commonly seen in most wireless products nowadays, while energy is one of the most important resources in portable devices. We propose a clique-based model which allows us to achieve optimal resource utilization and fairness among network flows when multi-rate transmission is considered. We also show how to extend the model to dynamically adjust prices based on energy consumptions of flows. In particular, our model takes into account energy consumptions in the transmitters' side, the receivers' side, and those that are non-transmitters and non-receivers but are interfered by these activities. So our model can more accurately reflect the real energy constraint in a wireless network. Simulation results are presented to show the convergence and other properties of these strategies. (C) 2008 Elsevier B.V. All rights reserved.

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

ad hoc network
nonlinear programming
wireless communication


A cognitive robotic ecology approach to self-configuring and evolving AAL systems Robotic ecologies are systems made out of several robotic devices, including mobile robots, wireless sensors and effectors embedded in everyday environments, where they cooperate to achieve complex tasks. This paper demonstrates how endowing robotic ecologies with information processing algorithms such as perception, learning, planning, and novelty detection can make these systems able to deliver modular, flexible, manageable and dependable Ambient Assisted Living (AAL) solutions. Specifically, we show how the integrated and self-organising cognitive solutions implemented within the EU project RUBICON (Robotic UBIquitous Cognitive Network) can reduce the need of costly pre-programming and maintenance of robotic ecologies. We illustrate how these solutions can be harnessed to (i) deliver a range of assistive services by coordinating the sensing & acting capabilities of heterogeneous devices, (ii) adapt and tune the overall behaviour of the ecology to the preferences and behaviour of its inhabitants, and also (iii) deal with novel events, due to the occurrence of new user?s activities and changing user?s habits.

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

robotic ecology
ambient assisted living
planning


Choosing the best pairwise comparisons of means from non-normal populations, with unequal variances, but equal sample sizes A Monte Carlo simulation evaluated five pairwise multiple comparison procedures for controlling Type I error rates, any-pair power, and all-pairs power. Realistic conditions of non-normality were based on a previous survey. Variance ratios were varied from 1:1 to 64:1. Procedures evaluated included Tukey's honestly significant difference (HSD) preceded by an F test, the Hayter-Fisher, the Games-Howell preceded by an F test, the Pertiz with F tests, and the Peritz with Alexander-Govern tests. Tukey's procedure shows the greatest robustness in Type I error control. Any-pair power is generally best with one of the Peritz procedures. All-pairs power is best with the Pertiz F test procedure. However, Tukey's HSD preceded by the Alexander-Govern F test may provide the best combination for controlling Type I and power rates in a variety of conditions of non-normality and variance heterogeneity.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-board analysis of uncalibrated data for a spacecraft at mars Analyzing data on-board a spacecraft as it is collected enables several advanced spacecraft capabilities, such as prioritizing observations to make the best use of limited bandwidth and reacting to dynamic events as they happen. In this paper, we describe how we addressed the unique challenges associated with on-board mining of data as it is collected: uncalibrated data, noisy observations, and severe limitations on computational and memory resources. The goal of this effort, which falls into the emerging application area of spacecraft-based data mining, was to study three specific science phenomena on Mars. Following previous work that used a linear support vector machine (SVM) on-board the Earth Observing 1 (EO-1)spacecraft, we developed three data mining techniques for use on-board the Mars Odyssey spacecraft. These methods range from simple thresholding to state-of-the-art reduced-set SVM technology. We tested these algorithms on archived data in a flight software testbed. We also describe a significant, serendipitous science discovery of this data mining effort: the confirmation of a water ice annulus around the north polar cap of Mars. We conclude with a discussion on lessons learned in developing algorithms for use on-board a spacecraft.

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

on-board data mining
resource-constrained computing
real-time data analysis


Intelligent timetable evaluation using fuzzy AHP There is a substantial body of empirical literature that establishes the benefits of customer satisfaction for enterprises. Among different available options to present our service, selecting the best choice in the customers eyes is a vital decision. Developing appropriate passenger train schedules is counted as one of the major managerial concerns in transportation environment. Although different algorithms have been developed to create predictive schedules for a fleet of passenger trains using different performance indicators, selecting the best one embraces some ambiguities and uncertainties. That is because a one-dimensional objective function may not be sufficient for responding customer concerns. The main objective of this paper is to propose an approach within the fuzzy AHP framework for tackling the complexity of multidimensional service evaluations, where sum of weighted waiting times, average of unit waiting time and maximum ratio of waiting time to journey time of a schedule are evaluated and the ultimate judgment on goodness of the schedule is made via the aggregation of the performance measures used. The study is based on the knowledge of certain managers and experts in IRC (Iran Railways Corporation) who are aware of available complexities in train scheduling and have been dealing with customers for several years.

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


Cheating behaviours, the Internet and Education undergraduate students This paper describes an illuminative small-scale study that piloted an initial survey instrument intended to investigate correspondences between 47 undergraduate Education final year students' use of information and communications technology (ICT), including the Internet, and within the context of their adoption of tactics intended to impress lecturers or to exploit the hidden curriculum students' engagement in cheating behaviours such as plagiarism. The study disclosed that 0.23 of the sample had reported single instances of cheating behaviours and that 0.21 of the sample had reported multiple instances of cheating behaviours. Analysis of data discerned correspondences between these cheating behaviours and personal factors. However, indicators of ICT capability and the Internet did not correlate significantly with cheating behaviours. Those students who had reported multiple instances of cheating behaviours were found to rate their ICT capabilities higher than their peers but had a tendency to report less frequent use of the Internet for coursework. Inferences are tentatively drawn for further research and for academic practices.

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

lecturer impressing strategies
rules of the game


POD-based reduced-order models with deforming grids Proper orthogonal decomposition based reduced order modeling (POD/ROM) is examined with deforming grids. POD/ROM is a technique that operates in an index-space for computations, not typically accounting for grid dynamics. Two model problems are presented to demonstrate the method of accounting for the effects of grid deformation on POD/ROM. The analytical solution of flow about an oscillating cylinder and potential flow over an oscillating panel. The accuracy and robustness of POD/ROM on deforming grids are compared to that of rigid grid POD/ROM. Deforming grid POD/ROMs are found to require more modes than rigid grid POD/ROMs for similar accuracy levels. In addition, for deforming grids, POD/ROMs are less accurate when the grid deformation is significantly altered from the deformations seen in the POD/ROM development. To address these issues, a new technique is developed that compares the relative grid motion between the POD/ROM creation and execution. The technique determines the current relative grid deformation and selects the best POD/ROM from those available. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

proper orthogonal decomposition
reduced order modeling
deforming grid


Characterizing the protonation states of the catalytic residues in apo and substrate-bound human T-cell leukemia virus type 1 protease Protonation states of the catalytic residues in HTLV-1 protease were investigated. In apo HTLV-1 protease, the two catalytic residues are both unprotonated. In HTLV-1 proteasesubstrate complex, Asp32 is protonated, Asp32? is unprotonated. Substrate binding favors a protonated Asp32 over protonated Asp32? by 2.8kcal/mol. The HTLV-1 proteasesubstrate complex structure was analyzed in detail.

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

htlv-1 protease
free energy simulations
qm/mm


On some classes of almost automorphic functions and applications to fractional differential equations We study in this paper the properties of C(n) C ( n ) -almost automorphic and asymptoticallyC(n) C ( n ) -almost automorphic functions (a new concept) with values in a Banach space. We then give a new result related to the existence and uniqueness of an asymptotically almost automorphic solution of a semilinear fractional differential equation of the form D?x(t)=Ax(t)+F(t,x(t),Bx(t)) D ? x ( t ) = A x ( t ) + F ( t , x ( t ) , B x ( t ) ) with t?R,0<?<1 t ? R , 0 < ? < 1 , where A A generates a family of ? ? -resolvent family S?(t) S ? ( t ) and f f satisfies some Lipschitz conditions.

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

c(n) c ( n ) -almost automorphic functions c(n) c ( n ) c(n) c ( n ) c ( n )

asymptotically almost automorphic functions


Contributions of I h to feature selectivity in layer II stellate cells of the entorhinal cortex Stellate cells (SCs) of the entorhinal cortex generate prominent subthreshold oscillations that are believed to be important contributors to the hippocampal theta rhythm. The slow inward rectifier I h is expressed prominently in SCs and has been suggested to be a dominant factor in their integrative properties. We studied the input-output relationships in stellate cells (SCs) of the entorhinal cortex, both in control conditions and in the presence of the I h antagonist ZD7288. Our results show that I h is responsible for SCs subthreshold resonance, and contributes to enhanced spiking reliability to theta-rich stimuli. However, SCs still exhibit other traits of rhythmicity, such as subthreshold oscillations, under I h blockade. To clarify the effects of I h on SC spiking, we used a generalized form of principal component analysis to show that SCs select particular features with relevant temporal signatures from stimuli. The spike-selected mix of those features varies with the frequency content of the stimulus, emphasizing the inherent nonlinearity of SC responses. A number of controls confirmed that this selectivity represents a stimulus-induced change in the cellular input-output relationship rather than an artifact of the analysis technique. Sensitivity to slow features remained statistically significant in ZD7288. However, with I h blocked, slow stimulus features were less predictive of spikes and spikes conveyed less information about the stimulus over long time scales. Together, these results suggest that I h is an important contributor to the input-output relationships expressed by SCs, but that other factors in SCs also contribute to subthreshold oscillations and nonlinear selectivity to slow features.

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

inward rectifier
reliability
principal component analysis

information theory
spike-triggered covariance
single-neuron computation


Application of a New Classification to a Breast Tumor Series from a Population-Based Cancer Registry A new classification based on gene expression profiling or immunohistochemical (IHC) characteristics may replace current histopathological classifications and predict better clinical outcomes. We used IHC markers to classify incident cases ascertained by the Palermo Breast Cancer Registry (20022004) into four subtypes: luminal-A (ER+ or PgR+ and HER2/neu?); luminal-B (ER+ or PgR+, HER2/neu+); basal-like (ER?, PgR?, HER2/neu?); and HER2+/ER? (HER2/neu+, ER?, PgR?). We evaluated HER2/neu, ER and PgR in 1300/1985 (65%) cases. The most common IHC-subtype was luminal-A (68%), whereas luminal-B, basal-like, and HER2+/ER? accounted for 14%, 13%, and 5%, respectively. IHC-subtypes were not associated with tumor size, geographic location within the province, or menopause, but differed by NPI (P < 0.0001), grading (P < 0.0001), lymph-node involvement (P= 0.04), metastases (P= 0.04), and TNM stage (P= 0.04). Endocrine therapy was administered to 81% of 519 postmenopausal, luminal-A, and luminal-B cases and to 32% of 114 postmenopausal, basal-like, and HER2+/ER? cases.

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


NETWORK FAILURE DETECTION AND GRAPH CONNECTIVITY We consider a model for monitoring the connectivity of a network subject to node or edge failures. In particular, we are concerned with detecting (epsilon, k)-failures: events in which an adversary deletes up to k network elements (nodes or edges), after which there are two sets of nodes A and B, each at least an epsilon fraction of the network, that are disconnected from one another. We say that a set D of nodes is an (epsilon, k)-detection set if, for any (epsilon, k)-failure of the network, some two nodes in D are no longer able to communicate; in this way, D "witnesses" any such failure. Recent results show that for any graph G, there is an (epsilon, k)-detection set of size bounded by a polynomial in k and epsilon, independent of the size of G. In this paper, we expose some relationships between bounds on detection sets and the edge-connectivity lambda and node-connectivity k of the underlying graph. Specifically, we show that detection set bounds can be made considerably stronger when parameterized by these connectivity values. We show that for an adversary that can delete k. edges, there is always a detection set of size O(k/epsilon log 1/epsilon) which can be found by random sampling. Moreover, an (epsilon, lambda)- detection set of minimum size (which is at most 1/epsilon) can be computed in polynomial time. A crucial point is that these bounds are independent not just of the size of G but also of the value of lambda. Extending these bounds to node failures is much more challenging. The most technically difficult result of this paper is that a random sample of O(1/epsilon log 1/epsilon) nodes is a detection set for adversaries that can delete a number of nodes up to k, the node-connectivity. For the case of edge-failures we use VC-dimension techniques and the cactus representation of all minimum edge-cuts of a graph; for node failures, we develop a novel approach for working with the much more complex set of all minimum node-cuts of a graph.

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

detection sets
connectivity
cactus representation

network failures
minimal cuts
vc-dimension


A new technique for minimizing network loss from users perspective Loss control is an essential issue for video transportation over IP networks. Buffer management is a traditional network technique to protecting video data against IP packet loss. In this paper, a new innovative use of packet scheduling to meet the loss constraints of video communication is proposed. A packet-scheduling scheme at a router that assures that intra and inter-stream loss requests for video transportation are met was developed and evaluated using real video data. The results demonstrate the advantages of the proposed scheme, in terms of loss performance and fairness.

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

quality of service (qos)
video communications


optical bus versus electronic bus for address-transactions in future smp architectures The fast evolution of processor performance necessitates a permanent evolution of all the multiprocessor components, even for small to medium-scale symmetric multiprocessors (SMP) build around shared busses. This kind of multiprocessor is especially attractive because the problem of data coherency in caches can be solved by a class of snooping protocols specific to these shared-bus architecture. But the bandwidth demand, especially for the addresses, is becoming so important that a technological step must be considered. Optical communications are becoming mature, and bring a huge information bandwidth through the implementation of optical busses. This paper is focused on the address bandwidth needed by shared-bus SMP without suggesting a complete solution. We show that an optical address bus can fulfill the bandwidth demand of future SMPs contrarily to standard electronic busses.

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

bandwidth requirement
shared bus
smp architecture


A literature review on optimum and preferred joint angles inautomotive sitting posture Overview over the state of the art of optimum automotive sitting posture. We did a literature review in the field of automotive optimum and preferred joint angles. We compared the methods and the results of the actual available literature. We give recommendations for further research in this field.

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


towards a group recommender process model for ad-hoc groups and on-demand recommendations Movie recommender systems simplify the movie selection by providing movie suggestions based on the respective user's personal taste. Most of the current systems address individual users, support stationary use, and require pre-configuration. In this paper we present an approach for group recommendations for movies based on a novel group recommender process model for ad-hoc groups with on-demand recommendations.

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

computer-supported cooperative work
mobile system
group recommendation process
group recommender system


Improving efficiency of merging symbolic rules into integrated rules: splitting methods and mergability criteria Neurules are a type of neuro-symbolic rules integrating neurocomputing and production rules. Each neurule is represented as an adaline unit. Neurules exhibit characteristics such as modularity, naturalness and ability to perform interactive and integrated inferences and provide explanations for reached conclusions. One way of producing a neurule base is through conversion of an existing symbolic rule base yielding an equivalent but more compact rule base. The conversion process merges symbolic rules having the same conclusion into one or more neurules. Because of the inability of the adaline unit to handle inseparability, more than one neurule for each conclusion may be produced by splitting the initial set of symbolic rules into subsets. This paper presents research work improving the conversion process in terms of runtime and number of produced neurules. First, we show how easier it is to construct a neurule base than a connectionist one. Second, we present alternative rule set splitting methods. Finally, we define criteria concerning the ability or inability to convert a rule set into a single, equivalent, but more compact rule. With application of such mergability criteria, the conversion process of symbolic rules into neurules becomes more time-efficient. All the aforementioned are supported by experimental results.

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

rule merging
rule clustering
neuro-symbolic approaches
hybrid expert systems
hybrid intelligent systems
hybrid knowledge representation


On the solvability of a fractional differential equation model involving the p-Laplacian operator In this paper, we study the solvability of a Caputo fractional differential equation model involving the p-Laplacian operator with boundary value conditions. By using the Banach contraction mapping principle, some new results on the existence and uniqueness of a solution for the model are obtained. It is interesting to note that the sufficient conditions for the solvability of the model depend on the parameters p and a. Furthermore, we give some examples to illustrate our results. (C) 2012 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 B I I I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

existence and uniqueness
banach contraction mapping principle

p-laplacian operator
caputo fractional derivative
boundary value problem


The illusion of tacit knowledge as the great problem in the development of product configurators In many cases, the use of product configurators provides a number of benefits for engineering-oriented companies, such as shorter lead times, the use of fewer man hours, and improved product quality. However, not all of these projects are successful. The task of defining what should be implemented into the configurator is much more complex than anticipated in many configurator projects. In the worst-case scenario, this implies that the configurator is never fully developed or it fails to support the users in a satisfactory manner. The difficulties in creating adequate specifications of what to implement in the knowledge base of a configurator have been explained in much of the configuration literature by the assumption that much of the relevant knowledge of the product experts is tacit. However, this paper shows that this kind of explanation can be misleading and may even be incorrect. This is accomplished by discussing the problems inherent in such explanations and through interviews with configuration project knowledge engineers. Therefore, according to this basis, this paper provides general recommendations concerning the use of the term tacit knowledge and outlines issues related to the acquisition of product knowledge in configuration projects.

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

knowledge acquisition
knowledge engineering
knowledge management
product configuration


Controlled perturbation for arrangements of circles Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and fares induced by C) using floating point arithmetic. We present an efficient scheme, controlled perturbation, that perturbs the circles in C slightly to form a collection V, so that all the predicates that arise in the construction of A(C') are computed accurately and A(C') is degeneracy free. We introduced controlled perturbation several years ago, and already applied it to certain types of arrangements. The major contribution of the current work is the derivation of a good (small) resolution bound, that is, a bound on the minimum separation of features of the arrangement that is required to guarantee that the predicates involved in the construction can be safely computed with the given (limited) precision arithmetic. A smaller resolution bound leads to smaller perturbation of the original input. We present the scheme, describe how the resolution bound is determined and how it effects the perturbation magnitude. We implemented the perturbation scheme and the construction of the arrangement and we report on experimental results.

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


Solutions to the Cauchy problem for differential equations in Banach spaces with fractional order ? In this paper, we use the monotone iterative technique combined with cone theory to investigate the existence of solutions to the Cauchy problem for Caputo fractional differential equations in Banach spaces. New existence theorems are obtained for the case of a cone P P being normal and fully regular respectively. Moreover, two examples are given to illustrate the abstract results.

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

fractional differential equation
banach space


Bin packing with fixed number of bins revisited AS BIN PACKING is NP-hard already for k = 2 bins. it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially bounded integers, then the problem can be solved in time n(O(k)) for an input of length n by dynamic programming. We show, by proving the W[1]-hardness of UNARY BIN PACKING (where the sizes are given in unary encoding), that this running time cannot be improved to f (k) . n(O(1)) for any function f (k) (under standard complexity assumptions). On the other hand, we provide an algorithm for BIN PACKING that obtains in time 2(O(k log2 k)) + O (n) a solution with additive error at most 1. i.e., either finds a packing into k + 1 bins or decides that k bins do not suffice. (c) 2012 Elsevier Inc. All rights reserved.

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

parameterized complexity
additive approximation
will-hardness


clouddb workshop summary This is the first workshop in CIKM conference that addresses the challenge of large data management based on cloud computing infrastructure. This workshop will bring together researchers and practitioners in cloud computing and data-intensive system design, programming, parallel algorithms, data management, scientific applications, and information-based applications to maximize performance, minimize cost and improve the scale of their endeavors. Totally this workshop attracted 11 submissions from Asia, Canada, Europe, and the United States. The program committee accepted 8 papers, among which there are 5 full papers and 3 short papers. Topics of accepted papers includes query processing & index, service in the Cloud, platform availability, Cloud system implementation, data replication and so on. These proceedings will serve as a valuable reference for cloud data management researchers and developers.

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


A multi-net system for the fault diagnosis of a diesel engine A multi-net fault diagnosis system designed to provide an early warning of combustion-related faults in a diesel engine is presented. Two faults (a leaking exhaust valve and a leaking fuel injector nozzle) were physically induced (at separate times) in the engine. A pressure transducer was used to sense the in-cylinder pressure changes during engine cycles under both of these conditions, and during normal operation. Data corresponding to these measurements were used to train artificial neural nets to recognise the faults, and to discriminate between them and normal operation. Individually trained nets, some of which were trained on sub-tasks, were combined to form a multi-net system. The multi-net system is shown to be effective when compared with the performance of the component nets from which it was assembled. The system is also shown to outperform a decision-tree algorithm (C5.0), and a human expert; comparisons which show the complexity of the required discrimination. The results illustrate the improvements in performance that can come about from the effective use of both problem decomposition and redundancy in the construction of multi-net systems.

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

artificial neural networks
combustion
condition monitoring
ensembles
modular


Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas DPLL (for Davis, Putnam, Logemann, and Loveland) algorithms form the largest family of contemporary algorithms for SAT (the propositional satisfiability problem) and are widely used in applications. The recursion trees of DPLL algorithm executions on unsatisfiable formulas are equivalent to treelike resolution proofs. Therefore, lower bounds for treelike resolution (known since the 1960s) apply to them. However, these lower bounds say nothing about the behavior of such algorithms on satisfiable formulas. Proving exponential lower bounds for them in the most general setting is impossible without proving P not equal NP; therefore, to prove lower bounds, one has to restrict the power of branching heuristics. In this paper, we give exponential lower bounds for two families of DPLL algorithms: generalized myopic algorithms, which read up to n(1-epsilon) of clauses at each step and see the remaining part of the formula without negations, and drunk algorithms, which choose a variable using any complicated rule and then pick its value at random.

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


Stigmergic dimensions of online creative interaction This paper examines the stigmergic dimensions of online interactive creativity through the lens of Picbreeder. Picbreeder is a web-based system for collaborative interactive evolution of images. The Picbreeder applet starts by randomly generating several images, which are then mated and mutated based on the users selections. The user can then publish the image to the Picbreeder website where other users can download and continue the images evolution. Within this process, users collaboratively create images with significant complexity, all without explicit communication. In short, Picbreeder encourages a new form of stigmergic collaborative creation. The most surprising result of the Picbreeder experiment during more than 3 years of operation has been the quality of the resulting images, despite the limited ways of interacting with other users. This fact challenges some commonly held notions of creativity, both online and offline. While current cognitive research in creativity places significant emphasis of the personal traits and cognitive structures that give rise to creative thought, Picbreeder highlights the potential for the emergence of creativity through stigmergic interaction. Picbreeder offers a rich data set for analysis of collaborative interaction with over 155,000 inputs from hundreds of users combined to create over 7500 images. It is hoped that the insights offered in this paper will influence both the understanding of collaborative creativity and the development of new modes of online creative interaction.

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

creativity
collaborative interactive evolution

stigmergy
interactive evolutionary computation
memetic evolution


Smooth and robust solutions for Dirichlet boundary control of fluidsolid conjugate heat transfer problems ? We study a new optimization scheme that generates smooth and robust solutions for Dirichlet velocity boundary control (DVBC) of conjugate heat transfer (CHT) processes. The solutions to the DVBC of the incompressible NavierStokes equations are typically nonsmooth, due to the regularity degradation of the boundary stress in the adjoint NavierStokes equations. This nonsmoothness is inherited by the solutions to the DVBC of CHT processes, since the CHT process couples the NavierStokes equations of fluid motion with the convectiondiffusion equations of fluidsolid thermal interaction. Our objective in the CHT boundary control problem is to select optimally the fluid inflow profile that minimizes an objective function that involves the sum of the mismatch between the temperature distribution in the fluid system and a prescribed temperature profile and the cost of the control. Our strategy to resolve the nonsmoothness of the boundary control solution is based on two features, namely, the objective function with a regularization term on the gradient of the control profile on both the continuous and the discrete levels, and the optimization scheme with either explicit or implicit smoothing effects, such as the smoothed Steepest Descent and the Limited-memory BroydenFletcherGoldfarbShanno (L-BFGS) methods. Our strategy to achieve the robustness of the solution process is based on combining the smoothed optimization scheme with the numerical continuation technique on the regularization parameters in the objective function. In the section of numerical studies, we present two suites of experiments. In the first one, we demonstrate the feasibility and effectiveness of our numerical schemes in recovering the boundary control profile of the standard case of a Poiseuille flow. In the second one, we illustrate the robustness of our optimization schemes via solving more challenging DVBC problems for both the channel flow and the flow past a square cylinder, which use initial control profiles far from optimal and require the numerical continuation technique applied on regularization parameters. We believe our solution strategy is general and can be applied to other large-scale optimal control problems which involve multiphysics processes and require smooth approximations to the optimal control profile.

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

optimal control
regularization
numerical continuation
multiphysics
conjugate heat transfer
navierstokes


Synchronization of coupled Duffing-type oscillator dynamical networks ? In this paper, synchronization of a network of the coupled Duffing-type oscillators is considered. By using different methods, two kinds of synchronization are investigated over two graph topologies, one is the global synchronization in the sense of Lyapunov over the directed graph, the other is the exponential synchronization over the undirected graph. Firstly, the global synchronization condition of nonlinear network is obtained by the Lyapunov method. Then the global exponential synchronization condition and its synchronized region of linear network are obtained. Finally, some simulations are given to verify the theoretical results.

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

coupled oscillators
duffing oscillators
graph theory


Synthesis and evaluation of amphiphilic RGD derivatives: uses for solvent casting in polymers and tissue engineering applications Derivatives containing arginine-glycine-aspartic acid (RGD) inhibit fibrinogen binding to activated platelets and promote endothelial and smooth muscle cell attachment. An amphiphilic derivative of RGD that can be dissolved in an organic solvent has potential in the development of non-thrombogenic biomaterials. Such a derivative, LA-GRGD, was synthesised by coupling glycine-arginine-glycine-aspartic acid (GRGD) with lauric acid (LA). Its solubility and antithrombotic, cytotoxic and cell-binding effects were then evaluated in comparison with heparin (which is used clinically) and a fibronectin-engineered protein polymer (FEPP). Thromboelastography (TEG) was used to measure blood clotting time using fresh whole blood from healthy volunteers. Tissue factor (TF) activity was measured using plasma with a standard prothrombin time assay (PT). Cytotoxicity was assessed on human umbilical cord endothelial cells (HUVECs) using an Alamar blue assay. Solubility of the conjugate was assessed in a co-solvent. These techniques were used to study LA-GRGD, using heparin and FEPP as controls. The amphiphilic property of LA-GRGD was dependent on the feed mole ratio of GRGD to LA. LA-GRGD was soluble in acetone:water and water. LA-GRGD inhibited TF by >90% and prolonged TEG-r by 8.2 +/- 3.3 min (200 mug ml(-1)). Heparin inhibited TF by >90%, but prolonged TEG-r by 97.4 +/- 1.6 min (1 U ml(-1)); FEPP inhibited TF by >90% (100 mug ml(-1)) and prolonged TEG-r by 73.7 +/- 8.4 min (10 mug ml(-1)). Heparin had no cytotoxic effect on EC metabolism and viability at the concentrations studied (0.1-100 U ml(-1)). No significant cytotoxic effect was produced by LA-GRGD or FEPP at concentrations ranging from 0.1 mug ml(-1) to 50 mug ml(-1), but, at higher concentrations (100 mug ml(-1) and 200 mug ml(-1)), a detrimental effect was observed. Cell binding studies showed that LA-GRGD bound 29% of ECs compared with FEPP (60%) and heparin (22%). This new approach for synthesising amphiphilic RGD and its analogues has potential as a drug delivery system for the manufacture of new polymer formulations for use in bypass grafts and other tissue-engineered devices.

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

lauric acid
solvent casting
prothrombin time assay
heparin


Stabilized formulations for incompressible flows with thermal coupling We present applications of the stabilized finite element formulations developed for incompressible flows with thermal coupling to 2D and 3D test problems. The stabilized formulations are based on the streamline-upwind/Petrov-Galerkin and pressure-stabilizing/Petrov-Galerkin stabilizations and are supplemented with discontinuity capturing (DC), including the discontinuity-capturing directional dissipation. The stabilization and DC parameters associated with these formulations are also presented. The coupled fluid mechanics and temperature equations are solved with a direct coupling technique. The test problems computed include 2D and 3D natural convection, as well as a simplified 3D model of air Circulation in a small data center. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

thermal coupling
discontinuity capturing

incompressible flow
finite elements
supg/pspg formulations


Identification and control of Hammerstein systems via wireless networks This article investigates a systematic approach for the identification and control of Hammerstein systems over a physical IEEE 802.11b wireless channel. Three major factors which may affect system stability and stabilisation are concerned: wireless network-induced delays, nonlinearity and model mismatch. First the network-induced delays are characterised by an inverse Gaussian distribution model according to IEEE 802.11b protocol and a model-based compensation method is used to estimate the delayed samples. Then an inverse function of nonlinear part of the identified model is used to attenuate the influence of nonlinearity, while the model mismatch is regarded as disturbance which is then dealt with by H control approach. A sufficient condition for mean-square asymptotic stability is obtained and expressed by a set of linear matrix inequalities, enabling direct controller design. Finally, numerical simulation examples are used to confirm the efficacy of the proposed approach.

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

wireless networked control
system identification
hammerstein system


The list scheduling algorithm for scheduling unreliable jobs on two parallel machines In this paper, we study a scheduling problem with unreliable jobs. Each job is characterized by a success probability and by a reward earned in case of success. In case of failure, the job blocks the machine that is processing it, and the jobs subsequently sequenced on that machine cannot be performed. The objective function is to maximize the expected reward. We address the problem in the case of two parallel machines, and analyze the worst-case performance of a simple list scheduling algorithm. We show that the algorithm provides an approximation ratio of ( 2 + 2 ) / 4 ? 0 , 853 , and that the bound is tight. We also provide a complexity result concerning the related Total Weighted Discounted Completion Time Problem on parallel machines.

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


JESS-based web interface for XML document validation Ensuring consistency among data exchange specifications in XML is critical to seamless integration of various business-to-business (B2B) applications. To this end, a specification should be thoroughly verified in manifold perspectives such as grammar/syntax conformance, design compliance, and canonical semantics accordance. A single hand-woven testbed implementation will fail to versatilely support such a variety of testings. In this paper, we propose a novel validation tool of XML documents using an expert system and open validation rule scripts. Particularly, we illustrate a web-based implementation to ensure an XML schemas design compliance to design and naming rules (NDR), namely a quality of schema design (QoD) test.

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

interoperability
jess
schema design quality


Affine-transformation and 2D-projection invariant k-NN classification of handwritten characters via a new matching measure We enhance k-NN classification by affine and 2D-projection invariant matchings. We develop acceleration methods for those distortion-tolerant matching techniques. We propose a matching measure using similarity in direction and curvature of edges. Experiments using the MNIST database show a very low error rate of 0.30%. The source code used in the above-mentioned experiments is uploaded.

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

nearest-neighbor distance of equi-gradient direction